For bounded linear operators $S$ and $T$ such that $ST-TS=I$, show that $|T^n|=0$ for some $n in mathbb{N}$
$begingroup$
I found in the first part of the question that $ST^{n+1}-T^{n+1}S=(n+1)T^n$ for any non negative integer $n$, any clues on how to proceed?
Thanks.
operator-theory linear-transformations
$endgroup$
add a comment |
$begingroup$
I found in the first part of the question that $ST^{n+1}-T^{n+1}S=(n+1)T^n$ for any non negative integer $n$, any clues on how to proceed?
Thanks.
operator-theory linear-transformations
$endgroup$
add a comment |
$begingroup$
I found in the first part of the question that $ST^{n+1}-T^{n+1}S=(n+1)T^n$ for any non negative integer $n$, any clues on how to proceed?
Thanks.
operator-theory linear-transformations
$endgroup$
I found in the first part of the question that $ST^{n+1}-T^{n+1}S=(n+1)T^n$ for any non negative integer $n$, any clues on how to proceed?
Thanks.
operator-theory linear-transformations
operator-theory linear-transformations
asked Jan 31 at 12:07
MarmosetMarmoset
506
506
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
From $ST^{n+1}-T^{n+1}S=(n+1)T^n$ we get
$(n+1)||T^n|| le 2||S||cdot||T^{n+1}||le 2||S||cdot ||T|| cdot||T^n||.$
Now suppose that $||T^n|| ne 0$ for all $n$. Then we get
$n+1 le 2||S||cdot ||T||$ for all $n$, which is absurd.
$endgroup$
$begingroup$
Maybe for completeness you should include the fact that the relation is impossible for bounded operators. If $T^n=0$, then $T^{n-1}=tfrac1n(ST^n-T^nS)=0$; iterate this until $n=2$, to get $T=0$.
$endgroup$
– Martin Argerami
Jan 31 at 17:27
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%2f3094813%2ffor-bounded-linear-operators-s-and-t-such-that-st-ts-i-show-that-tn%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$
From $ST^{n+1}-T^{n+1}S=(n+1)T^n$ we get
$(n+1)||T^n|| le 2||S||cdot||T^{n+1}||le 2||S||cdot ||T|| cdot||T^n||.$
Now suppose that $||T^n|| ne 0$ for all $n$. Then we get
$n+1 le 2||S||cdot ||T||$ for all $n$, which is absurd.
$endgroup$
$begingroup$
Maybe for completeness you should include the fact that the relation is impossible for bounded operators. If $T^n=0$, then $T^{n-1}=tfrac1n(ST^n-T^nS)=0$; iterate this until $n=2$, to get $T=0$.
$endgroup$
– Martin Argerami
Jan 31 at 17:27
add a comment |
$begingroup$
From $ST^{n+1}-T^{n+1}S=(n+1)T^n$ we get
$(n+1)||T^n|| le 2||S||cdot||T^{n+1}||le 2||S||cdot ||T|| cdot||T^n||.$
Now suppose that $||T^n|| ne 0$ for all $n$. Then we get
$n+1 le 2||S||cdot ||T||$ for all $n$, which is absurd.
$endgroup$
$begingroup$
Maybe for completeness you should include the fact that the relation is impossible for bounded operators. If $T^n=0$, then $T^{n-1}=tfrac1n(ST^n-T^nS)=0$; iterate this until $n=2$, to get $T=0$.
$endgroup$
– Martin Argerami
Jan 31 at 17:27
add a comment |
$begingroup$
From $ST^{n+1}-T^{n+1}S=(n+1)T^n$ we get
$(n+1)||T^n|| le 2||S||cdot||T^{n+1}||le 2||S||cdot ||T|| cdot||T^n||.$
Now suppose that $||T^n|| ne 0$ for all $n$. Then we get
$n+1 le 2||S||cdot ||T||$ for all $n$, which is absurd.
$endgroup$
From $ST^{n+1}-T^{n+1}S=(n+1)T^n$ we get
$(n+1)||T^n|| le 2||S||cdot||T^{n+1}||le 2||S||cdot ||T|| cdot||T^n||.$
Now suppose that $||T^n|| ne 0$ for all $n$. Then we get
$n+1 le 2||S||cdot ||T||$ for all $n$, which is absurd.
answered Jan 31 at 12:18


FredFred
48.6k11849
48.6k11849
$begingroup$
Maybe for completeness you should include the fact that the relation is impossible for bounded operators. If $T^n=0$, then $T^{n-1}=tfrac1n(ST^n-T^nS)=0$; iterate this until $n=2$, to get $T=0$.
$endgroup$
– Martin Argerami
Jan 31 at 17:27
add a comment |
$begingroup$
Maybe for completeness you should include the fact that the relation is impossible for bounded operators. If $T^n=0$, then $T^{n-1}=tfrac1n(ST^n-T^nS)=0$; iterate this until $n=2$, to get $T=0$.
$endgroup$
– Martin Argerami
Jan 31 at 17:27
$begingroup$
Maybe for completeness you should include the fact that the relation is impossible for bounded operators. If $T^n=0$, then $T^{n-1}=tfrac1n(ST^n-T^nS)=0$; iterate this until $n=2$, to get $T=0$.
$endgroup$
– Martin Argerami
Jan 31 at 17:27
$begingroup$
Maybe for completeness you should include the fact that the relation is impossible for bounded operators. If $T^n=0$, then $T^{n-1}=tfrac1n(ST^n-T^nS)=0$; iterate this until $n=2$, to get $T=0$.
$endgroup$
– Martin Argerami
Jan 31 at 17:27
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%2f3094813%2ffor-bounded-linear-operators-s-and-t-such-that-st-ts-i-show-that-tn%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