Proof regarding self-adjoint linear operators.











up vote
0
down vote

favorite
1












Let $H$ be a Hilbert space, and let $T : H rightarrow H$ be a bounded self-adjoint linear operator, with $T neq 0.$



I need to show that $T^{2^k} neq 0$ $forall k in mathbb{N}$.
Here's what I've done so far:



$T^2x = T(Tx)$ and so $T^{2^k}x = T(T^{2k-1}x)$.
Hence, as T is self-adjoint, $<Tx,y> = <x,T^*y>$ and so $<T^{2k}x,y> = <x,(T^{2k})^*y>$.
However, I'm struggling to go from here, any help is appreciated.










share|cite|improve this question




















  • 1




    Have you tried using induction?
    – John Douma
    yesterday










  • @JohnDouma Yes but I wasn't sure how to approach it. I don't use induction much.
    – Zombiegit123
    yesterday






  • 1




    Can you see why the result is true for $k=0$? Assume it is true for arbitrary $k$ and show it must be true for $k+1$.
    – John Douma
    yesterday










  • @JohnDouma Just did it for the base case. Not sure how to conclude it for k+1 though.
    – Zombiegit123
    yesterday






  • 2




    Additionally, you should really use self-adjointness. For the equality $langle Tx,yrangle=langle x,T^ast yrangle$ you do not need self-adjointness, it's just the definition of the adjoint. But the statement you want to prove does not hold for arbitary bounded operators.
    – MaoWao
    yesterday















up vote
0
down vote

favorite
1












Let $H$ be a Hilbert space, and let $T : H rightarrow H$ be a bounded self-adjoint linear operator, with $T neq 0.$



I need to show that $T^{2^k} neq 0$ $forall k in mathbb{N}$.
Here's what I've done so far:



$T^2x = T(Tx)$ and so $T^{2^k}x = T(T^{2k-1}x)$.
Hence, as T is self-adjoint, $<Tx,y> = <x,T^*y>$ and so $<T^{2k}x,y> = <x,(T^{2k})^*y>$.
However, I'm struggling to go from here, any help is appreciated.










share|cite|improve this question




















  • 1




    Have you tried using induction?
    – John Douma
    yesterday










  • @JohnDouma Yes but I wasn't sure how to approach it. I don't use induction much.
    – Zombiegit123
    yesterday






  • 1




    Can you see why the result is true for $k=0$? Assume it is true for arbitrary $k$ and show it must be true for $k+1$.
    – John Douma
    yesterday










  • @JohnDouma Just did it for the base case. Not sure how to conclude it for k+1 though.
    – Zombiegit123
    yesterday






  • 2




    Additionally, you should really use self-adjointness. For the equality $langle Tx,yrangle=langle x,T^ast yrangle$ you do not need self-adjointness, it's just the definition of the adjoint. But the statement you want to prove does not hold for arbitary bounded operators.
    – MaoWao
    yesterday













up vote
0
down vote

favorite
1









up vote
0
down vote

favorite
1






1





Let $H$ be a Hilbert space, and let $T : H rightarrow H$ be a bounded self-adjoint linear operator, with $T neq 0.$



I need to show that $T^{2^k} neq 0$ $forall k in mathbb{N}$.
Here's what I've done so far:



$T^2x = T(Tx)$ and so $T^{2^k}x = T(T^{2k-1}x)$.
Hence, as T is self-adjoint, $<Tx,y> = <x,T^*y>$ and so $<T^{2k}x,y> = <x,(T^{2k})^*y>$.
However, I'm struggling to go from here, any help is appreciated.










share|cite|improve this question















Let $H$ be a Hilbert space, and let $T : H rightarrow H$ be a bounded self-adjoint linear operator, with $T neq 0.$



I need to show that $T^{2^k} neq 0$ $forall k in mathbb{N}$.
Here's what I've done so far:



$T^2x = T(Tx)$ and so $T^{2^k}x = T(T^{2k-1}x)$.
Hence, as T is self-adjoint, $<Tx,y> = <x,T^*y>$ and so $<T^{2k}x,y> = <x,(T^{2k})^*y>$.
However, I'm struggling to go from here, any help is appreciated.







functional-analysis hilbert-spaces adjoint-operators






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited yesterday









Aweygan

12.9k21441




12.9k21441










asked yesterday









Zombiegit123

304113




304113








  • 1




    Have you tried using induction?
    – John Douma
    yesterday










  • @JohnDouma Yes but I wasn't sure how to approach it. I don't use induction much.
    – Zombiegit123
    yesterday






  • 1




    Can you see why the result is true for $k=0$? Assume it is true for arbitrary $k$ and show it must be true for $k+1$.
    – John Douma
    yesterday










  • @JohnDouma Just did it for the base case. Not sure how to conclude it for k+1 though.
    – Zombiegit123
    yesterday






  • 2




    Additionally, you should really use self-adjointness. For the equality $langle Tx,yrangle=langle x,T^ast yrangle$ you do not need self-adjointness, it's just the definition of the adjoint. But the statement you want to prove does not hold for arbitary bounded operators.
    – MaoWao
    yesterday














  • 1




    Have you tried using induction?
    – John Douma
    yesterday










  • @JohnDouma Yes but I wasn't sure how to approach it. I don't use induction much.
    – Zombiegit123
    yesterday






  • 1




    Can you see why the result is true for $k=0$? Assume it is true for arbitrary $k$ and show it must be true for $k+1$.
    – John Douma
    yesterday










  • @JohnDouma Just did it for the base case. Not sure how to conclude it for k+1 though.
    – Zombiegit123
    yesterday






  • 2




    Additionally, you should really use self-adjointness. For the equality $langle Tx,yrangle=langle x,T^ast yrangle$ you do not need self-adjointness, it's just the definition of the adjoint. But the statement you want to prove does not hold for arbitary bounded operators.
    – MaoWao
    yesterday








1




1




Have you tried using induction?
– John Douma
yesterday




Have you tried using induction?
– John Douma
yesterday












@JohnDouma Yes but I wasn't sure how to approach it. I don't use induction much.
– Zombiegit123
yesterday




@JohnDouma Yes but I wasn't sure how to approach it. I don't use induction much.
– Zombiegit123
yesterday




1




1




Can you see why the result is true for $k=0$? Assume it is true for arbitrary $k$ and show it must be true for $k+1$.
– John Douma
yesterday




Can you see why the result is true for $k=0$? Assume it is true for arbitrary $k$ and show it must be true for $k+1$.
– John Douma
yesterday












@JohnDouma Just did it for the base case. Not sure how to conclude it for k+1 though.
– Zombiegit123
yesterday




@JohnDouma Just did it for the base case. Not sure how to conclude it for k+1 though.
– Zombiegit123
yesterday




2




2




Additionally, you should really use self-adjointness. For the equality $langle Tx,yrangle=langle x,T^ast yrangle$ you do not need self-adjointness, it's just the definition of the adjoint. But the statement you want to prove does not hold for arbitary bounded operators.
– MaoWao
yesterday




Additionally, you should really use self-adjointness. For the equality $langle Tx,yrangle=langle x,T^ast yrangle$ you do not need self-adjointness, it's just the definition of the adjoint. But the statement you want to prove does not hold for arbitary bounded operators.
– MaoWao
yesterday










1 Answer
1






active

oldest

votes

















up vote
4
down vote



accepted










Induction certainly does make this proof go by much smoother. Here's how one should proceed:



Since $Tneq0$, there is some nonzero $xin H$ such that $Txneq0$. Hence $|Tx|>0$,
$$langle T^2x,xrangle=langle Tx,Txrangle=|Tx|^2>0,$$
and thus $T^2neq0$. (Can you see how self-adjointness is used? )



For the induction step, just repeat the same proof with $T^{2^k}$ taking the place of $T$.






share|cite|improve this answer





















  • I follow this quite well, but how do you get the first $T^2$ from that norm?
    – Zombiegit123
    yesterday










  • Read it backwards. Since $|Tx|>0$, $|Tx|^2>0$, and thus $langle T^2x,xrangle>0$.
    – Aweygan
    yesterday











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',
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
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005085%2fproof-regarding-self-adjoint-linear-operators%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








up vote
4
down vote



accepted










Induction certainly does make this proof go by much smoother. Here's how one should proceed:



Since $Tneq0$, there is some nonzero $xin H$ such that $Txneq0$. Hence $|Tx|>0$,
$$langle T^2x,xrangle=langle Tx,Txrangle=|Tx|^2>0,$$
and thus $T^2neq0$. (Can you see how self-adjointness is used? )



For the induction step, just repeat the same proof with $T^{2^k}$ taking the place of $T$.






share|cite|improve this answer





















  • I follow this quite well, but how do you get the first $T^2$ from that norm?
    – Zombiegit123
    yesterday










  • Read it backwards. Since $|Tx|>0$, $|Tx|^2>0$, and thus $langle T^2x,xrangle>0$.
    – Aweygan
    yesterday















up vote
4
down vote



accepted










Induction certainly does make this proof go by much smoother. Here's how one should proceed:



Since $Tneq0$, there is some nonzero $xin H$ such that $Txneq0$. Hence $|Tx|>0$,
$$langle T^2x,xrangle=langle Tx,Txrangle=|Tx|^2>0,$$
and thus $T^2neq0$. (Can you see how self-adjointness is used? )



For the induction step, just repeat the same proof with $T^{2^k}$ taking the place of $T$.






share|cite|improve this answer





















  • I follow this quite well, but how do you get the first $T^2$ from that norm?
    – Zombiegit123
    yesterday










  • Read it backwards. Since $|Tx|>0$, $|Tx|^2>0$, and thus $langle T^2x,xrangle>0$.
    – Aweygan
    yesterday













up vote
4
down vote



accepted







up vote
4
down vote



accepted






Induction certainly does make this proof go by much smoother. Here's how one should proceed:



Since $Tneq0$, there is some nonzero $xin H$ such that $Txneq0$. Hence $|Tx|>0$,
$$langle T^2x,xrangle=langle Tx,Txrangle=|Tx|^2>0,$$
and thus $T^2neq0$. (Can you see how self-adjointness is used? )



For the induction step, just repeat the same proof with $T^{2^k}$ taking the place of $T$.






share|cite|improve this answer












Induction certainly does make this proof go by much smoother. Here's how one should proceed:



Since $Tneq0$, there is some nonzero $xin H$ such that $Txneq0$. Hence $|Tx|>0$,
$$langle T^2x,xrangle=langle Tx,Txrangle=|Tx|^2>0,$$
and thus $T^2neq0$. (Can you see how self-adjointness is used? )



For the induction step, just repeat the same proof with $T^{2^k}$ taking the place of $T$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered yesterday









Aweygan

12.9k21441




12.9k21441












  • I follow this quite well, but how do you get the first $T^2$ from that norm?
    – Zombiegit123
    yesterday










  • Read it backwards. Since $|Tx|>0$, $|Tx|^2>0$, and thus $langle T^2x,xrangle>0$.
    – Aweygan
    yesterday


















  • I follow this quite well, but how do you get the first $T^2$ from that norm?
    – Zombiegit123
    yesterday










  • Read it backwards. Since $|Tx|>0$, $|Tx|^2>0$, and thus $langle T^2x,xrangle>0$.
    – Aweygan
    yesterday
















I follow this quite well, but how do you get the first $T^2$ from that norm?
– Zombiegit123
yesterday




I follow this quite well, but how do you get the first $T^2$ from that norm?
– Zombiegit123
yesterday












Read it backwards. Since $|Tx|>0$, $|Tx|^2>0$, and thus $langle T^2x,xrangle>0$.
– Aweygan
yesterday




Read it backwards. Since $|Tx|>0$, $|Tx|^2>0$, and thus $langle T^2x,xrangle>0$.
– Aweygan
yesterday


















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005085%2fproof-regarding-self-adjoint-linear-operators%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

A Topological Invariant for $pi_3(U(n))$