Values of $alpha$ such that the inverse of a linear operator is bounded
$begingroup$
I need help with this problem.
Problem. Consider the Banach space $ell^1$. Let $I$ be the identity operator and $S:ell^1 to ell^1$ be the shift operator, i.e. $S((x))_k=x_{k+1}$. Now define the family of operators $T_alpha :=I+alpha S$ for $alphainmathbb{R}.$
Determine all values of $alphainmathbb{R}$ such that the inverse of $T_alpha$ is bounded.
The notion of inverse that is used here is as an operator $T_alpha^{-1}:mathcal{R}(T_alpha)to ell^1$. Where $mathcal{R} $ denotes the range. For the inverse operator to exist only injectivity is needed.
Attempt.
The previous problem asked for values of $alpha$ such that the inverse exist. By some straightforward calculations I found that for $|alpha|leq 1$ the inverse exists. After doing this and that I found the inverse, namely:
begin{align}
T^{-1}_alpha y=left(d(1), d(2), ......right)
end{align}
where $$d(j) = sum_{kgeq j}(-alpha)^{k-j}y(k)$$
Now I split cases.
Case 1 $alpha=1$ (case $alpha=-1$ is analoguos). Take $x_n=frac{1}{n}(1,-1,...,1,-1,0,0,0)$ with $n$ nonzero elements. Clearly $Vert x_nVert =1$. We have for this $x$:
begin{align}
d_n(j)=frac{1}{n}sum_{k=j}^n(-1)^{k-j}(-1)^{k-1}=frac{n+1-j}{n}(-1)^{j+1}
end{align}
So:
begin{align}
Vert T_alpha^{-1} x_nVert = sum_{j=1}^n frac{n+1-j}{n}=frac{n+1}{2}to infty
end{align}
Hence $T_alpha^{-1}$ is not bounded for $alpha=1$. Something similar can be done for the case $alpha=-1$.
Case 2 $|alpha|<1$. I can do something similar as above, but that is too constructive and lost insight. So I thought to do it in an easier way. I thought about the following theorem that says that the existence of some $b>0$ such that for all $xinell^1$: $Vert T_alpha x Vertgeq bVert xVert$ implies the boundedness of $T^{-1}_alpha$.
I wanted to use it like this. Let $xneq 0$. One has by the reverse triangle inequality: $$frac{Vert T_alpha x Vert}{Vert xVert } geq frac{1}{Vert xVert }bigg| Vert IxVert-|alpha|Vert SxVertbigg|$$ One knows that $Vert SVert =1$, but that did not brought me anywhere.
Question. Is my solution for $alpha=1$ correct? Is there easier ways to do this exercise, expecially for the case $|alpha|<1$?
functional-analysis banach-spaces normed-spaces
$endgroup$
add a comment |
$begingroup$
I need help with this problem.
Problem. Consider the Banach space $ell^1$. Let $I$ be the identity operator and $S:ell^1 to ell^1$ be the shift operator, i.e. $S((x))_k=x_{k+1}$. Now define the family of operators $T_alpha :=I+alpha S$ for $alphainmathbb{R}.$
Determine all values of $alphainmathbb{R}$ such that the inverse of $T_alpha$ is bounded.
The notion of inverse that is used here is as an operator $T_alpha^{-1}:mathcal{R}(T_alpha)to ell^1$. Where $mathcal{R} $ denotes the range. For the inverse operator to exist only injectivity is needed.
Attempt.
The previous problem asked for values of $alpha$ such that the inverse exist. By some straightforward calculations I found that for $|alpha|leq 1$ the inverse exists. After doing this and that I found the inverse, namely:
begin{align}
T^{-1}_alpha y=left(d(1), d(2), ......right)
end{align}
where $$d(j) = sum_{kgeq j}(-alpha)^{k-j}y(k)$$
Now I split cases.
Case 1 $alpha=1$ (case $alpha=-1$ is analoguos). Take $x_n=frac{1}{n}(1,-1,...,1,-1,0,0,0)$ with $n$ nonzero elements. Clearly $Vert x_nVert =1$. We have for this $x$:
begin{align}
d_n(j)=frac{1}{n}sum_{k=j}^n(-1)^{k-j}(-1)^{k-1}=frac{n+1-j}{n}(-1)^{j+1}
end{align}
So:
begin{align}
Vert T_alpha^{-1} x_nVert = sum_{j=1}^n frac{n+1-j}{n}=frac{n+1}{2}to infty
end{align}
Hence $T_alpha^{-1}$ is not bounded for $alpha=1$. Something similar can be done for the case $alpha=-1$.
Case 2 $|alpha|<1$. I can do something similar as above, but that is too constructive and lost insight. So I thought to do it in an easier way. I thought about the following theorem that says that the existence of some $b>0$ such that for all $xinell^1$: $Vert T_alpha x Vertgeq bVert xVert$ implies the boundedness of $T^{-1}_alpha$.
I wanted to use it like this. Let $xneq 0$. One has by the reverse triangle inequality: $$frac{Vert T_alpha x Vert}{Vert xVert } geq frac{1}{Vert xVert }bigg| Vert IxVert-|alpha|Vert SxVertbigg|$$ One knows that $Vert SVert =1$, but that did not brought me anywhere.
Question. Is my solution for $alpha=1$ correct? Is there easier ways to do this exercise, expecially for the case $|alpha|<1$?
functional-analysis banach-spaces normed-spaces
$endgroup$
$begingroup$
For $|alpha| >1$ let $x_n=(-frac 1 {alpha})^{n}$. Then ${x_n} in l^{1}$ and $(I+alpha S ){x_n}=0$. Hence $T_alpha$ is not one-to-one and it does not have an inverse.
$endgroup$
– Kavi Rama Murthy
Jan 22 '18 at 7:31
$begingroup$
@KaviRamaMurthy yes!! That is also the example that I had.
$endgroup$
– Shashi
Jan 22 '18 at 10:29
add a comment |
$begingroup$
I need help with this problem.
Problem. Consider the Banach space $ell^1$. Let $I$ be the identity operator and $S:ell^1 to ell^1$ be the shift operator, i.e. $S((x))_k=x_{k+1}$. Now define the family of operators $T_alpha :=I+alpha S$ for $alphainmathbb{R}.$
Determine all values of $alphainmathbb{R}$ such that the inverse of $T_alpha$ is bounded.
The notion of inverse that is used here is as an operator $T_alpha^{-1}:mathcal{R}(T_alpha)to ell^1$. Where $mathcal{R} $ denotes the range. For the inverse operator to exist only injectivity is needed.
Attempt.
The previous problem asked for values of $alpha$ such that the inverse exist. By some straightforward calculations I found that for $|alpha|leq 1$ the inverse exists. After doing this and that I found the inverse, namely:
begin{align}
T^{-1}_alpha y=left(d(1), d(2), ......right)
end{align}
where $$d(j) = sum_{kgeq j}(-alpha)^{k-j}y(k)$$
Now I split cases.
Case 1 $alpha=1$ (case $alpha=-1$ is analoguos). Take $x_n=frac{1}{n}(1,-1,...,1,-1,0,0,0)$ with $n$ nonzero elements. Clearly $Vert x_nVert =1$. We have for this $x$:
begin{align}
d_n(j)=frac{1}{n}sum_{k=j}^n(-1)^{k-j}(-1)^{k-1}=frac{n+1-j}{n}(-1)^{j+1}
end{align}
So:
begin{align}
Vert T_alpha^{-1} x_nVert = sum_{j=1}^n frac{n+1-j}{n}=frac{n+1}{2}to infty
end{align}
Hence $T_alpha^{-1}$ is not bounded for $alpha=1$. Something similar can be done for the case $alpha=-1$.
Case 2 $|alpha|<1$. I can do something similar as above, but that is too constructive and lost insight. So I thought to do it in an easier way. I thought about the following theorem that says that the existence of some $b>0$ such that for all $xinell^1$: $Vert T_alpha x Vertgeq bVert xVert$ implies the boundedness of $T^{-1}_alpha$.
I wanted to use it like this. Let $xneq 0$. One has by the reverse triangle inequality: $$frac{Vert T_alpha x Vert}{Vert xVert } geq frac{1}{Vert xVert }bigg| Vert IxVert-|alpha|Vert SxVertbigg|$$ One knows that $Vert SVert =1$, but that did not brought me anywhere.
Question. Is my solution for $alpha=1$ correct? Is there easier ways to do this exercise, expecially for the case $|alpha|<1$?
functional-analysis banach-spaces normed-spaces
$endgroup$
I need help with this problem.
Problem. Consider the Banach space $ell^1$. Let $I$ be the identity operator and $S:ell^1 to ell^1$ be the shift operator, i.e. $S((x))_k=x_{k+1}$. Now define the family of operators $T_alpha :=I+alpha S$ for $alphainmathbb{R}.$
Determine all values of $alphainmathbb{R}$ such that the inverse of $T_alpha$ is bounded.
The notion of inverse that is used here is as an operator $T_alpha^{-1}:mathcal{R}(T_alpha)to ell^1$. Where $mathcal{R} $ denotes the range. For the inverse operator to exist only injectivity is needed.
Attempt.
The previous problem asked for values of $alpha$ such that the inverse exist. By some straightforward calculations I found that for $|alpha|leq 1$ the inverse exists. After doing this and that I found the inverse, namely:
begin{align}
T^{-1}_alpha y=left(d(1), d(2), ......right)
end{align}
where $$d(j) = sum_{kgeq j}(-alpha)^{k-j}y(k)$$
Now I split cases.
Case 1 $alpha=1$ (case $alpha=-1$ is analoguos). Take $x_n=frac{1}{n}(1,-1,...,1,-1,0,0,0)$ with $n$ nonzero elements. Clearly $Vert x_nVert =1$. We have for this $x$:
begin{align}
d_n(j)=frac{1}{n}sum_{k=j}^n(-1)^{k-j}(-1)^{k-1}=frac{n+1-j}{n}(-1)^{j+1}
end{align}
So:
begin{align}
Vert T_alpha^{-1} x_nVert = sum_{j=1}^n frac{n+1-j}{n}=frac{n+1}{2}to infty
end{align}
Hence $T_alpha^{-1}$ is not bounded for $alpha=1$. Something similar can be done for the case $alpha=-1$.
Case 2 $|alpha|<1$. I can do something similar as above, but that is too constructive and lost insight. So I thought to do it in an easier way. I thought about the following theorem that says that the existence of some $b>0$ such that for all $xinell^1$: $Vert T_alpha x Vertgeq bVert xVert$ implies the boundedness of $T^{-1}_alpha$.
I wanted to use it like this. Let $xneq 0$. One has by the reverse triangle inequality: $$frac{Vert T_alpha x Vert}{Vert xVert } geq frac{1}{Vert xVert }bigg| Vert IxVert-|alpha|Vert SxVertbigg|$$ One knows that $Vert SVert =1$, but that did not brought me anywhere.
Question. Is my solution for $alpha=1$ correct? Is there easier ways to do this exercise, expecially for the case $|alpha|<1$?
functional-analysis banach-spaces normed-spaces
functional-analysis banach-spaces normed-spaces
edited Jan 22 '18 at 10:30
Shashi
asked Jan 22 '18 at 2:01
ShashiShashi
7,2851628
7,2851628
$begingroup$
For $|alpha| >1$ let $x_n=(-frac 1 {alpha})^{n}$. Then ${x_n} in l^{1}$ and $(I+alpha S ){x_n}=0$. Hence $T_alpha$ is not one-to-one and it does not have an inverse.
$endgroup$
– Kavi Rama Murthy
Jan 22 '18 at 7:31
$begingroup$
@KaviRamaMurthy yes!! That is also the example that I had.
$endgroup$
– Shashi
Jan 22 '18 at 10:29
add a comment |
$begingroup$
For $|alpha| >1$ let $x_n=(-frac 1 {alpha})^{n}$. Then ${x_n} in l^{1}$ and $(I+alpha S ){x_n}=0$. Hence $T_alpha$ is not one-to-one and it does not have an inverse.
$endgroup$
– Kavi Rama Murthy
Jan 22 '18 at 7:31
$begingroup$
@KaviRamaMurthy yes!! That is also the example that I had.
$endgroup$
– Shashi
Jan 22 '18 at 10:29
$begingroup$
For $|alpha| >1$ let $x_n=(-frac 1 {alpha})^{n}$. Then ${x_n} in l^{1}$ and $(I+alpha S ){x_n}=0$. Hence $T_alpha$ is not one-to-one and it does not have an inverse.
$endgroup$
– Kavi Rama Murthy
Jan 22 '18 at 7:31
$begingroup$
For $|alpha| >1$ let $x_n=(-frac 1 {alpha})^{n}$. Then ${x_n} in l^{1}$ and $(I+alpha S ){x_n}=0$. Hence $T_alpha$ is not one-to-one and it does not have an inverse.
$endgroup$
– Kavi Rama Murthy
Jan 22 '18 at 7:31
$begingroup$
@KaviRamaMurthy yes!! That is also the example that I had.
$endgroup$
– Shashi
Jan 22 '18 at 10:29
$begingroup$
@KaviRamaMurthy yes!! That is also the example that I had.
$endgroup$
– Shashi
Jan 22 '18 at 10:29
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For $alpha=0$ you have $T_alpha=I$, so from now on let us assume that $alphane0$.
When $|alpha|<1$, we can calculate the inverse of $T_alpha$ explicitly via the Neumann series: namely,
$$
T_alpha^{-1}=sum_{n=0}^infty (-1)^nalpha^nS^n.
$$
So
$T_alpha$ is invertible for all $alpha$ with $|alpha|<1$.
Note that $$T_alpha=I+alpha S=alphaleft(frac1alpha,I+Sright).$$ Seeing it like this, we know that $T_alpha$ is invertible precisely when $-1/alphanotinsigma(S)$.
We have $|S|=1$; by the general result that $|lambda|>|S|$ implies that $lambdanotinsigma(S)$, we immediately get that $|1/alpha|>1$ implies $T_alpha$ invertible. This is another way to see that $T_alpha$ is invertible when $|alpha|<1$.
For any $lambda$ with $|lambda|<1$, if $x=(lambda^n) $, then $Sx=lambda x$, and so $lambdainsigma (S) $. As the spectrum is always closed, we have $$sigma (S)={lambda: |lambda|leq1}. $$ So
$T_alpha$ is not invertible if $|alpha|geq1$.
$endgroup$
$begingroup$
Thank you for your answer. It gave me new insights since it uses the concept of eigenvalues (is that so?) and spectrum which we did not cover yet. I think it is possible to do it without, but this answer is fine. Moreover the notion of invertible you use is as a function from $ell^1$ to $ell^1$ right? In class we use inverse as a function from the range to the domain. Only injectivity is needed for the latter.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
For example for $alpha=-1$ the inverse exists I think. Take some $yinell^1$ then $Ty=0$ implies $y_{j+1}=y_1$ since $y inell^1$ we must have $y_1=0$ and therefore $y=0$. Hence injective so invertible.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
And for $|alpha|>1$ there is no much worries since $T_alpha $ is then not Injective.
$endgroup$
– Shashi
Jan 22 '18 at 10:50
$begingroup$
Sorry, I see that I misread your definition, and I was using the other shift. I'll edit soon.
$endgroup$
– Martin Argerami
Jan 22 '18 at 11:12
$begingroup$
but the notion of inverse function that is used here is $T^{-1}_alpha:mathcal{R}(T_alpha)toell^1$. For this function to exist only injective $T_alpha$ is needed. I must indeed be a little bit careful when talking about invertibility. Do you get it?
$endgroup$
– Shashi
Jan 22 '18 at 11:12
|
show 5 more comments
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%2f2615548%2fvalues-of-alpha-such-that-the-inverse-of-a-linear-operator-is-bounded%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$
For $alpha=0$ you have $T_alpha=I$, so from now on let us assume that $alphane0$.
When $|alpha|<1$, we can calculate the inverse of $T_alpha$ explicitly via the Neumann series: namely,
$$
T_alpha^{-1}=sum_{n=0}^infty (-1)^nalpha^nS^n.
$$
So
$T_alpha$ is invertible for all $alpha$ with $|alpha|<1$.
Note that $$T_alpha=I+alpha S=alphaleft(frac1alpha,I+Sright).$$ Seeing it like this, we know that $T_alpha$ is invertible precisely when $-1/alphanotinsigma(S)$.
We have $|S|=1$; by the general result that $|lambda|>|S|$ implies that $lambdanotinsigma(S)$, we immediately get that $|1/alpha|>1$ implies $T_alpha$ invertible. This is another way to see that $T_alpha$ is invertible when $|alpha|<1$.
For any $lambda$ with $|lambda|<1$, if $x=(lambda^n) $, then $Sx=lambda x$, and so $lambdainsigma (S) $. As the spectrum is always closed, we have $$sigma (S)={lambda: |lambda|leq1}. $$ So
$T_alpha$ is not invertible if $|alpha|geq1$.
$endgroup$
$begingroup$
Thank you for your answer. It gave me new insights since it uses the concept of eigenvalues (is that so?) and spectrum which we did not cover yet. I think it is possible to do it without, but this answer is fine. Moreover the notion of invertible you use is as a function from $ell^1$ to $ell^1$ right? In class we use inverse as a function from the range to the domain. Only injectivity is needed for the latter.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
For example for $alpha=-1$ the inverse exists I think. Take some $yinell^1$ then $Ty=0$ implies $y_{j+1}=y_1$ since $y inell^1$ we must have $y_1=0$ and therefore $y=0$. Hence injective so invertible.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
And for $|alpha|>1$ there is no much worries since $T_alpha $ is then not Injective.
$endgroup$
– Shashi
Jan 22 '18 at 10:50
$begingroup$
Sorry, I see that I misread your definition, and I was using the other shift. I'll edit soon.
$endgroup$
– Martin Argerami
Jan 22 '18 at 11:12
$begingroup$
but the notion of inverse function that is used here is $T^{-1}_alpha:mathcal{R}(T_alpha)toell^1$. For this function to exist only injective $T_alpha$ is needed. I must indeed be a little bit careful when talking about invertibility. Do you get it?
$endgroup$
– Shashi
Jan 22 '18 at 11:12
|
show 5 more comments
$begingroup$
For $alpha=0$ you have $T_alpha=I$, so from now on let us assume that $alphane0$.
When $|alpha|<1$, we can calculate the inverse of $T_alpha$ explicitly via the Neumann series: namely,
$$
T_alpha^{-1}=sum_{n=0}^infty (-1)^nalpha^nS^n.
$$
So
$T_alpha$ is invertible for all $alpha$ with $|alpha|<1$.
Note that $$T_alpha=I+alpha S=alphaleft(frac1alpha,I+Sright).$$ Seeing it like this, we know that $T_alpha$ is invertible precisely when $-1/alphanotinsigma(S)$.
We have $|S|=1$; by the general result that $|lambda|>|S|$ implies that $lambdanotinsigma(S)$, we immediately get that $|1/alpha|>1$ implies $T_alpha$ invertible. This is another way to see that $T_alpha$ is invertible when $|alpha|<1$.
For any $lambda$ with $|lambda|<1$, if $x=(lambda^n) $, then $Sx=lambda x$, and so $lambdainsigma (S) $. As the spectrum is always closed, we have $$sigma (S)={lambda: |lambda|leq1}. $$ So
$T_alpha$ is not invertible if $|alpha|geq1$.
$endgroup$
$begingroup$
Thank you for your answer. It gave me new insights since it uses the concept of eigenvalues (is that so?) and spectrum which we did not cover yet. I think it is possible to do it without, but this answer is fine. Moreover the notion of invertible you use is as a function from $ell^1$ to $ell^1$ right? In class we use inverse as a function from the range to the domain. Only injectivity is needed for the latter.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
For example for $alpha=-1$ the inverse exists I think. Take some $yinell^1$ then $Ty=0$ implies $y_{j+1}=y_1$ since $y inell^1$ we must have $y_1=0$ and therefore $y=0$. Hence injective so invertible.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
And for $|alpha|>1$ there is no much worries since $T_alpha $ is then not Injective.
$endgroup$
– Shashi
Jan 22 '18 at 10:50
$begingroup$
Sorry, I see that I misread your definition, and I was using the other shift. I'll edit soon.
$endgroup$
– Martin Argerami
Jan 22 '18 at 11:12
$begingroup$
but the notion of inverse function that is used here is $T^{-1}_alpha:mathcal{R}(T_alpha)toell^1$. For this function to exist only injective $T_alpha$ is needed. I must indeed be a little bit careful when talking about invertibility. Do you get it?
$endgroup$
– Shashi
Jan 22 '18 at 11:12
|
show 5 more comments
$begingroup$
For $alpha=0$ you have $T_alpha=I$, so from now on let us assume that $alphane0$.
When $|alpha|<1$, we can calculate the inverse of $T_alpha$ explicitly via the Neumann series: namely,
$$
T_alpha^{-1}=sum_{n=0}^infty (-1)^nalpha^nS^n.
$$
So
$T_alpha$ is invertible for all $alpha$ with $|alpha|<1$.
Note that $$T_alpha=I+alpha S=alphaleft(frac1alpha,I+Sright).$$ Seeing it like this, we know that $T_alpha$ is invertible precisely when $-1/alphanotinsigma(S)$.
We have $|S|=1$; by the general result that $|lambda|>|S|$ implies that $lambdanotinsigma(S)$, we immediately get that $|1/alpha|>1$ implies $T_alpha$ invertible. This is another way to see that $T_alpha$ is invertible when $|alpha|<1$.
For any $lambda$ with $|lambda|<1$, if $x=(lambda^n) $, then $Sx=lambda x$, and so $lambdainsigma (S) $. As the spectrum is always closed, we have $$sigma (S)={lambda: |lambda|leq1}. $$ So
$T_alpha$ is not invertible if $|alpha|geq1$.
$endgroup$
For $alpha=0$ you have $T_alpha=I$, so from now on let us assume that $alphane0$.
When $|alpha|<1$, we can calculate the inverse of $T_alpha$ explicitly via the Neumann series: namely,
$$
T_alpha^{-1}=sum_{n=0}^infty (-1)^nalpha^nS^n.
$$
So
$T_alpha$ is invertible for all $alpha$ with $|alpha|<1$.
Note that $$T_alpha=I+alpha S=alphaleft(frac1alpha,I+Sright).$$ Seeing it like this, we know that $T_alpha$ is invertible precisely when $-1/alphanotinsigma(S)$.
We have $|S|=1$; by the general result that $|lambda|>|S|$ implies that $lambdanotinsigma(S)$, we immediately get that $|1/alpha|>1$ implies $T_alpha$ invertible. This is another way to see that $T_alpha$ is invertible when $|alpha|<1$.
For any $lambda$ with $|lambda|<1$, if $x=(lambda^n) $, then $Sx=lambda x$, and so $lambdainsigma (S) $. As the spectrum is always closed, we have $$sigma (S)={lambda: |lambda|leq1}. $$ So
$T_alpha$ is not invertible if $|alpha|geq1$.
edited Dec 6 '18 at 14:20
answered Jan 22 '18 at 3:07
Martin ArgeramiMartin Argerami
128k1183183
128k1183183
$begingroup$
Thank you for your answer. It gave me new insights since it uses the concept of eigenvalues (is that so?) and spectrum which we did not cover yet. I think it is possible to do it without, but this answer is fine. Moreover the notion of invertible you use is as a function from $ell^1$ to $ell^1$ right? In class we use inverse as a function from the range to the domain. Only injectivity is needed for the latter.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
For example for $alpha=-1$ the inverse exists I think. Take some $yinell^1$ then $Ty=0$ implies $y_{j+1}=y_1$ since $y inell^1$ we must have $y_1=0$ and therefore $y=0$. Hence injective so invertible.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
And for $|alpha|>1$ there is no much worries since $T_alpha $ is then not Injective.
$endgroup$
– Shashi
Jan 22 '18 at 10:50
$begingroup$
Sorry, I see that I misread your definition, and I was using the other shift. I'll edit soon.
$endgroup$
– Martin Argerami
Jan 22 '18 at 11:12
$begingroup$
but the notion of inverse function that is used here is $T^{-1}_alpha:mathcal{R}(T_alpha)toell^1$. For this function to exist only injective $T_alpha$ is needed. I must indeed be a little bit careful when talking about invertibility. Do you get it?
$endgroup$
– Shashi
Jan 22 '18 at 11:12
|
show 5 more comments
$begingroup$
Thank you for your answer. It gave me new insights since it uses the concept of eigenvalues (is that so?) and spectrum which we did not cover yet. I think it is possible to do it without, but this answer is fine. Moreover the notion of invertible you use is as a function from $ell^1$ to $ell^1$ right? In class we use inverse as a function from the range to the domain. Only injectivity is needed for the latter.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
For example for $alpha=-1$ the inverse exists I think. Take some $yinell^1$ then $Ty=0$ implies $y_{j+1}=y_1$ since $y inell^1$ we must have $y_1=0$ and therefore $y=0$. Hence injective so invertible.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
And for $|alpha|>1$ there is no much worries since $T_alpha $ is then not Injective.
$endgroup$
– Shashi
Jan 22 '18 at 10:50
$begingroup$
Sorry, I see that I misread your definition, and I was using the other shift. I'll edit soon.
$endgroup$
– Martin Argerami
Jan 22 '18 at 11:12
$begingroup$
but the notion of inverse function that is used here is $T^{-1}_alpha:mathcal{R}(T_alpha)toell^1$. For this function to exist only injective $T_alpha$ is needed. I must indeed be a little bit careful when talking about invertibility. Do you get it?
$endgroup$
– Shashi
Jan 22 '18 at 11:12
$begingroup$
Thank you for your answer. It gave me new insights since it uses the concept of eigenvalues (is that so?) and spectrum which we did not cover yet. I think it is possible to do it without, but this answer is fine. Moreover the notion of invertible you use is as a function from $ell^1$ to $ell^1$ right? In class we use inverse as a function from the range to the domain. Only injectivity is needed for the latter.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
Thank you for your answer. It gave me new insights since it uses the concept of eigenvalues (is that so?) and spectrum which we did not cover yet. I think it is possible to do it without, but this answer is fine. Moreover the notion of invertible you use is as a function from $ell^1$ to $ell^1$ right? In class we use inverse as a function from the range to the domain. Only injectivity is needed for the latter.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
For example for $alpha=-1$ the inverse exists I think. Take some $yinell^1$ then $Ty=0$ implies $y_{j+1}=y_1$ since $y inell^1$ we must have $y_1=0$ and therefore $y=0$. Hence injective so invertible.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
For example for $alpha=-1$ the inverse exists I think. Take some $yinell^1$ then $Ty=0$ implies $y_{j+1}=y_1$ since $y inell^1$ we must have $y_1=0$ and therefore $y=0$. Hence injective so invertible.
$endgroup$
– Shashi
Jan 22 '18 at 10:27
$begingroup$
And for $|alpha|>1$ there is no much worries since $T_alpha $ is then not Injective.
$endgroup$
– Shashi
Jan 22 '18 at 10:50
$begingroup$
And for $|alpha|>1$ there is no much worries since $T_alpha $ is then not Injective.
$endgroup$
– Shashi
Jan 22 '18 at 10:50
$begingroup$
Sorry, I see that I misread your definition, and I was using the other shift. I'll edit soon.
$endgroup$
– Martin Argerami
Jan 22 '18 at 11:12
$begingroup$
Sorry, I see that I misread your definition, and I was using the other shift. I'll edit soon.
$endgroup$
– Martin Argerami
Jan 22 '18 at 11:12
$begingroup$
but the notion of inverse function that is used here is $T^{-1}_alpha:mathcal{R}(T_alpha)toell^1$. For this function to exist only injective $T_alpha$ is needed. I must indeed be a little bit careful when talking about invertibility. Do you get it?
$endgroup$
– Shashi
Jan 22 '18 at 11:12
$begingroup$
but the notion of inverse function that is used here is $T^{-1}_alpha:mathcal{R}(T_alpha)toell^1$. For this function to exist only injective $T_alpha$ is needed. I must indeed be a little bit careful when talking about invertibility. Do you get it?
$endgroup$
– Shashi
Jan 22 '18 at 11:12
|
show 5 more comments
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%2f2615548%2fvalues-of-alpha-such-that-the-inverse-of-a-linear-operator-is-bounded%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
$begingroup$
For $|alpha| >1$ let $x_n=(-frac 1 {alpha})^{n}$. Then ${x_n} in l^{1}$ and $(I+alpha S ){x_n}=0$. Hence $T_alpha$ is not one-to-one and it does not have an inverse.
$endgroup$
– Kavi Rama Murthy
Jan 22 '18 at 7:31
$begingroup$
@KaviRamaMurthy yes!! That is also the example that I had.
$endgroup$
– Shashi
Jan 22 '18 at 10:29