Real Inner Product Space, Hermitian Operator $T = S^n$ for n odd The Next CEO of Stack OverflowMatrices for which $mathbfA^-1=-mathbfA$Prove non-zero eigenvalues of skew-Hermitian operator are pure imaginaryOrthogonal Operator Infinite Dimensional Inner Product SpaceOperator norm of symmetric Matrix in Hilbert Space with Hermitian Inner Productinner product and hermitian scalar productA conjugate LT in an inner product spaceInverse of hermitian operatorComplex vs. Real Inner-Product SpacesUnitary operator on inner product spaceNormal matrix over real inner product space with real eigenvalues is HermitianIs it possible to recognize when an endomorphism of a finite dimensional vector space is unitary for some choice of inner product?
How do I transpose the 1st and -1th levels of an arbitrarily nested array?
How did the Bene Gesserit know how to make a Kwisatz Haderach?
Anatomically Correct Strange Women In Ponds Distributing Swords
How do I go from 300 unfinished/half written blog posts, to published posts?
WOW air has ceased operation, can I get my tickets refunded?
Non-deterministic sum of floats
If/When UK leaves the EU, can a future goverment conduct a referendum to join the EU?
Help understanding this unsettling image of Titan, Epimetheus, and Saturn's rings?
Novel about a guy who is possessed by the divine essence and the world ends?
What was the first Unix version to run on a microcomputer?
If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?
Can you replace a racial trait cantrip when leveling up?
Phase of a real number
Would a completely good Muggle be able to use a wand?
What is "(CFMCC)" on an ILS approach chart?
Why does the UK parliament need a vote on the political declaration?
What benefits would be gained by using human laborers instead of drones in deep sea mining?
How does the mv command work with external drives?
Is "for causing autism in X" grammatical?
If a black hole is created from light, can this black hole then move at speed of light?
Should I tutor a student who I know has cheated on their homework?
Which tube will fit a -(700 x 25c) wheel?
Complex fractions
Between two walls
Real Inner Product Space, Hermitian Operator $T = S^n$ for n odd
The Next CEO of Stack OverflowMatrices for which $mathbfA^-1=-mathbfA$Prove non-zero eigenvalues of skew-Hermitian operator are pure imaginaryOrthogonal Operator Infinite Dimensional Inner Product SpaceOperator norm of symmetric Matrix in Hilbert Space with Hermitian Inner Productinner product and hermitian scalar productA conjugate LT in an inner product spaceInverse of hermitian operatorComplex vs. Real Inner-Product SpacesUnitary operator on inner product spaceNormal matrix over real inner product space with real eigenvalues is HermitianIs it possible to recognize when an endomorphism of a finite dimensional vector space is unitary for some choice of inner product?
$begingroup$
Let V be a finite dimensional inner product space over $mathbbR$, and $T: Vrightarrow V$ hermitian.
Suppose n is an odd positive integer.
Want to show:
$exists S:Vrightarrow V $ such that $T = S^n$
Here, I know that T is Hermitian if $T = T^*$ its complex conjugate and so, $T = T^t$ because it is a real operator.
I am having trouble with this question because I don't know where the criteria that n is odd will come in. Will the reasoning be similar to this? https://math.stackexchange.com/a/89715/651806
linear-algebra inner-product-space
$endgroup$
add a comment |
$begingroup$
Let V be a finite dimensional inner product space over $mathbbR$, and $T: Vrightarrow V$ hermitian.
Suppose n is an odd positive integer.
Want to show:
$exists S:Vrightarrow V $ such that $T = S^n$
Here, I know that T is Hermitian if $T = T^*$ its complex conjugate and so, $T = T^t$ because it is a real operator.
I am having trouble with this question because I don't know where the criteria that n is odd will come in. Will the reasoning be similar to this? https://math.stackexchange.com/a/89715/651806
linear-algebra inner-product-space
$endgroup$
1
$begingroup$
Because $x mapsto sqrt[n]x$ is bijective. And $T$ can be diagonalised...
$endgroup$
– copper.hat
Mar 18 at 20:26
1
$begingroup$
If all you have is a real scalar product you don't have a notion of hermitian. You mean $T$ is symmetric? The latter means that $T$ can be diagonalized by a orthogonal transformation and the eigenvalues are real. Then you need to find the $n$-th root of said numbers. If $n$ is odd there's always a real solution.
$endgroup$
– lcv
Mar 18 at 20:28
add a comment |
$begingroup$
Let V be a finite dimensional inner product space over $mathbbR$, and $T: Vrightarrow V$ hermitian.
Suppose n is an odd positive integer.
Want to show:
$exists S:Vrightarrow V $ such that $T = S^n$
Here, I know that T is Hermitian if $T = T^*$ its complex conjugate and so, $T = T^t$ because it is a real operator.
I am having trouble with this question because I don't know where the criteria that n is odd will come in. Will the reasoning be similar to this? https://math.stackexchange.com/a/89715/651806
linear-algebra inner-product-space
$endgroup$
Let V be a finite dimensional inner product space over $mathbbR$, and $T: Vrightarrow V$ hermitian.
Suppose n is an odd positive integer.
Want to show:
$exists S:Vrightarrow V $ such that $T = S^n$
Here, I know that T is Hermitian if $T = T^*$ its complex conjugate and so, $T = T^t$ because it is a real operator.
I am having trouble with this question because I don't know where the criteria that n is odd will come in. Will the reasoning be similar to this? https://math.stackexchange.com/a/89715/651806
linear-algebra inner-product-space
linear-algebra inner-product-space
asked Mar 18 at 20:09
Kevin AllenKevin Allen
154
154
1
$begingroup$
Because $x mapsto sqrt[n]x$ is bijective. And $T$ can be diagonalised...
$endgroup$
– copper.hat
Mar 18 at 20:26
1
$begingroup$
If all you have is a real scalar product you don't have a notion of hermitian. You mean $T$ is symmetric? The latter means that $T$ can be diagonalized by a orthogonal transformation and the eigenvalues are real. Then you need to find the $n$-th root of said numbers. If $n$ is odd there's always a real solution.
$endgroup$
– lcv
Mar 18 at 20:28
add a comment |
1
$begingroup$
Because $x mapsto sqrt[n]x$ is bijective. And $T$ can be diagonalised...
$endgroup$
– copper.hat
Mar 18 at 20:26
1
$begingroup$
If all you have is a real scalar product you don't have a notion of hermitian. You mean $T$ is symmetric? The latter means that $T$ can be diagonalized by a orthogonal transformation and the eigenvalues are real. Then you need to find the $n$-th root of said numbers. If $n$ is odd there's always a real solution.
$endgroup$
– lcv
Mar 18 at 20:28
1
1
$begingroup$
Because $x mapsto sqrt[n]x$ is bijective. And $T$ can be diagonalised...
$endgroup$
– copper.hat
Mar 18 at 20:26
$begingroup$
Because $x mapsto sqrt[n]x$ is bijective. And $T$ can be diagonalised...
$endgroup$
– copper.hat
Mar 18 at 20:26
1
1
$begingroup$
If all you have is a real scalar product you don't have a notion of hermitian. You mean $T$ is symmetric? The latter means that $T$ can be diagonalized by a orthogonal transformation and the eigenvalues are real. Then you need to find the $n$-th root of said numbers. If $n$ is odd there's always a real solution.
$endgroup$
– lcv
Mar 18 at 20:28
$begingroup$
If all you have is a real scalar product you don't have a notion of hermitian. You mean $T$ is symmetric? The latter means that $T$ can be diagonalized by a orthogonal transformation and the eigenvalues are real. Then you need to find the $n$-th root of said numbers. If $n$ is odd there's always a real solution.
$endgroup$
– lcv
Mar 18 at 20:28
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
On a finite-dimensional real inner product space, the notions of hermitian and symmetric for operators coincide; that is,
$T^dagger = T^t = T; tag 1$
since $T$ is symmetric, it may be diagonalized by some orthogonal operator
$O:V to V, tag 2$
$OO^t = O^tO = I, tag 3$
$OTO^t = D = textdiag (t_1, t_2, ldots, t_m), ; t_i in Bbb R, ; 1 le i le m, tag 4$
where
$m = dim_Bbb RV; tag 5$
since each $t_i in Bbb R$, for odd $n in Bbb N$ there exists
$rho_i in Bbb R, ; rho_i^n =t_i; tag 6$
we observe that this assertion fails for even $n$, since negative reals do not have even roots; we set
$R = textdiag (rho_1, rho_2, ldots, rho_m); tag 7$
then
$R^n = textdiag (rho_1^n, rho_2^n, ldots, rho_m^n) =
textdiag (t_1, t_2, ldots, t_m) = D; tag 8$
it follows that
$T = O^tDO = O^tR^nO = (O^tRO)^n, tag 9$
where we have used the general property that matrix conjugation preserves products:
$O^tAOO^TBO = O^tABO, tag10$
in affirming (9). We close by simply setting
$S = O^tRO. tag11$
$endgroup$
1
$begingroup$
Ah, and the diagonalisability property follows from the Spectral Theorem, right?
$endgroup$
– Kevin Allen
Mar 18 at 22:41
1
$begingroup$
@KevinAllen: yes, more or less; see en.wikipedia.org/wiki/Spectral_theorem.
$endgroup$
– Robert Lewis
Mar 19 at 16:40
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3153254%2freal-inner-product-space-hermitian-operator-t-sn-for-n-odd%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
On a finite-dimensional real inner product space, the notions of hermitian and symmetric for operators coincide; that is,
$T^dagger = T^t = T; tag 1$
since $T$ is symmetric, it may be diagonalized by some orthogonal operator
$O:V to V, tag 2$
$OO^t = O^tO = I, tag 3$
$OTO^t = D = textdiag (t_1, t_2, ldots, t_m), ; t_i in Bbb R, ; 1 le i le m, tag 4$
where
$m = dim_Bbb RV; tag 5$
since each $t_i in Bbb R$, for odd $n in Bbb N$ there exists
$rho_i in Bbb R, ; rho_i^n =t_i; tag 6$
we observe that this assertion fails for even $n$, since negative reals do not have even roots; we set
$R = textdiag (rho_1, rho_2, ldots, rho_m); tag 7$
then
$R^n = textdiag (rho_1^n, rho_2^n, ldots, rho_m^n) =
textdiag (t_1, t_2, ldots, t_m) = D; tag 8$
it follows that
$T = O^tDO = O^tR^nO = (O^tRO)^n, tag 9$
where we have used the general property that matrix conjugation preserves products:
$O^tAOO^TBO = O^tABO, tag10$
in affirming (9). We close by simply setting
$S = O^tRO. tag11$
$endgroup$
1
$begingroup$
Ah, and the diagonalisability property follows from the Spectral Theorem, right?
$endgroup$
– Kevin Allen
Mar 18 at 22:41
1
$begingroup$
@KevinAllen: yes, more or less; see en.wikipedia.org/wiki/Spectral_theorem.
$endgroup$
– Robert Lewis
Mar 19 at 16:40
add a comment |
$begingroup$
On a finite-dimensional real inner product space, the notions of hermitian and symmetric for operators coincide; that is,
$T^dagger = T^t = T; tag 1$
since $T$ is symmetric, it may be diagonalized by some orthogonal operator
$O:V to V, tag 2$
$OO^t = O^tO = I, tag 3$
$OTO^t = D = textdiag (t_1, t_2, ldots, t_m), ; t_i in Bbb R, ; 1 le i le m, tag 4$
where
$m = dim_Bbb RV; tag 5$
since each $t_i in Bbb R$, for odd $n in Bbb N$ there exists
$rho_i in Bbb R, ; rho_i^n =t_i; tag 6$
we observe that this assertion fails for even $n$, since negative reals do not have even roots; we set
$R = textdiag (rho_1, rho_2, ldots, rho_m); tag 7$
then
$R^n = textdiag (rho_1^n, rho_2^n, ldots, rho_m^n) =
textdiag (t_1, t_2, ldots, t_m) = D; tag 8$
it follows that
$T = O^tDO = O^tR^nO = (O^tRO)^n, tag 9$
where we have used the general property that matrix conjugation preserves products:
$O^tAOO^TBO = O^tABO, tag10$
in affirming (9). We close by simply setting
$S = O^tRO. tag11$
$endgroup$
1
$begingroup$
Ah, and the diagonalisability property follows from the Spectral Theorem, right?
$endgroup$
– Kevin Allen
Mar 18 at 22:41
1
$begingroup$
@KevinAllen: yes, more or less; see en.wikipedia.org/wiki/Spectral_theorem.
$endgroup$
– Robert Lewis
Mar 19 at 16:40
add a comment |
$begingroup$
On a finite-dimensional real inner product space, the notions of hermitian and symmetric for operators coincide; that is,
$T^dagger = T^t = T; tag 1$
since $T$ is symmetric, it may be diagonalized by some orthogonal operator
$O:V to V, tag 2$
$OO^t = O^tO = I, tag 3$
$OTO^t = D = textdiag (t_1, t_2, ldots, t_m), ; t_i in Bbb R, ; 1 le i le m, tag 4$
where
$m = dim_Bbb RV; tag 5$
since each $t_i in Bbb R$, for odd $n in Bbb N$ there exists
$rho_i in Bbb R, ; rho_i^n =t_i; tag 6$
we observe that this assertion fails for even $n$, since negative reals do not have even roots; we set
$R = textdiag (rho_1, rho_2, ldots, rho_m); tag 7$
then
$R^n = textdiag (rho_1^n, rho_2^n, ldots, rho_m^n) =
textdiag (t_1, t_2, ldots, t_m) = D; tag 8$
it follows that
$T = O^tDO = O^tR^nO = (O^tRO)^n, tag 9$
where we have used the general property that matrix conjugation preserves products:
$O^tAOO^TBO = O^tABO, tag10$
in affirming (9). We close by simply setting
$S = O^tRO. tag11$
$endgroup$
On a finite-dimensional real inner product space, the notions of hermitian and symmetric for operators coincide; that is,
$T^dagger = T^t = T; tag 1$
since $T$ is symmetric, it may be diagonalized by some orthogonal operator
$O:V to V, tag 2$
$OO^t = O^tO = I, tag 3$
$OTO^t = D = textdiag (t_1, t_2, ldots, t_m), ; t_i in Bbb R, ; 1 le i le m, tag 4$
where
$m = dim_Bbb RV; tag 5$
since each $t_i in Bbb R$, for odd $n in Bbb N$ there exists
$rho_i in Bbb R, ; rho_i^n =t_i; tag 6$
we observe that this assertion fails for even $n$, since negative reals do not have even roots; we set
$R = textdiag (rho_1, rho_2, ldots, rho_m); tag 7$
then
$R^n = textdiag (rho_1^n, rho_2^n, ldots, rho_m^n) =
textdiag (t_1, t_2, ldots, t_m) = D; tag 8$
it follows that
$T = O^tDO = O^tR^nO = (O^tRO)^n, tag 9$
where we have used the general property that matrix conjugation preserves products:
$O^tAOO^TBO = O^tABO, tag10$
in affirming (9). We close by simply setting
$S = O^tRO. tag11$
answered Mar 18 at 20:46
Robert LewisRobert Lewis
48.5k23167
48.5k23167
1
$begingroup$
Ah, and the diagonalisability property follows from the Spectral Theorem, right?
$endgroup$
– Kevin Allen
Mar 18 at 22:41
1
$begingroup$
@KevinAllen: yes, more or less; see en.wikipedia.org/wiki/Spectral_theorem.
$endgroup$
– Robert Lewis
Mar 19 at 16:40
add a comment |
1
$begingroup$
Ah, and the diagonalisability property follows from the Spectral Theorem, right?
$endgroup$
– Kevin Allen
Mar 18 at 22:41
1
$begingroup$
@KevinAllen: yes, more or less; see en.wikipedia.org/wiki/Spectral_theorem.
$endgroup$
– Robert Lewis
Mar 19 at 16:40
1
1
$begingroup$
Ah, and the diagonalisability property follows from the Spectral Theorem, right?
$endgroup$
– Kevin Allen
Mar 18 at 22:41
$begingroup$
Ah, and the diagonalisability property follows from the Spectral Theorem, right?
$endgroup$
– Kevin Allen
Mar 18 at 22:41
1
1
$begingroup$
@KevinAllen: yes, more or less; see en.wikipedia.org/wiki/Spectral_theorem.
$endgroup$
– Robert Lewis
Mar 19 at 16:40
$begingroup$
@KevinAllen: yes, more or less; see en.wikipedia.org/wiki/Spectral_theorem.
$endgroup$
– Robert Lewis
Mar 19 at 16:40
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3153254%2freal-inner-product-space-hermitian-operator-t-sn-for-n-odd%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
Because $x mapsto sqrt[n]x$ is bijective. And $T$ can be diagonalised...
$endgroup$
– copper.hat
Mar 18 at 20:26
1
$begingroup$
If all you have is a real scalar product you don't have a notion of hermitian. You mean $T$ is symmetric? The latter means that $T$ can be diagonalized by a orthogonal transformation and the eigenvalues are real. Then you need to find the $n$-th root of said numbers. If $n$ is odd there's always a real solution.
$endgroup$
– lcv
Mar 18 at 20:28