Question regarding $l_2$-space.
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
For $x=(x_n) in l_2$, define
$T(x)=(0,x_1,x_2, cdots)$ and $S(x)=(x_2,x_3, cdots)$.
Which of the following statements are true?
$(a)$ $|T| = |S|=1$.
$(b)$ If $A: l_2 longrightarrow l_2$ is a continuous linear operator such that $|A-T|<1$, then $SA$ is invertible.
$(c)$ If $A$ is as above, then $A$ is not invertible.
$(a)$ is true which is easy to show. But I have no clue regarding $(b)$ and $(c)$. Would anybody please help me in this regard?
Thank you very much.
functional-analysis norm normed-spaces lp-spaces
 |Â
show 4 more comments
up vote
0
down vote
favorite
For $x=(x_n) in l_2$, define
$T(x)=(0,x_1,x_2, cdots)$ and $S(x)=(x_2,x_3, cdots)$.
Which of the following statements are true?
$(a)$ $|T| = |S|=1$.
$(b)$ If $A: l_2 longrightarrow l_2$ is a continuous linear operator such that $|A-T|<1$, then $SA$ is invertible.
$(c)$ If $A$ is as above, then $A$ is not invertible.
$(a)$ is true which is easy to show. But I have no clue regarding $(b)$ and $(c)$. Would anybody please help me in this regard?
Thank you very much.
functional-analysis norm normed-spaces lp-spaces
For 2, do you know about inverse approximations: If $B$ is invertible and $|A -B| < |B^-1|^-1$ then $A$ is invertible? For 1, try some examples.
â 4-ier
Aug 22 at 6:14
Yes I know @4-ier.
â Dbchatto67
Aug 22 at 6:20
But what is $B$ here?
â Dbchatto67
Aug 22 at 6:21
Hint: What is $ST$?
â 4-ier
Aug 22 at 6:21
$(1)$ is trivially true.
â Dbchatto67
Aug 22 at 6:26
 |Â
show 4 more comments
up vote
0
down vote
favorite
up vote
0
down vote
favorite
For $x=(x_n) in l_2$, define
$T(x)=(0,x_1,x_2, cdots)$ and $S(x)=(x_2,x_3, cdots)$.
Which of the following statements are true?
$(a)$ $|T| = |S|=1$.
$(b)$ If $A: l_2 longrightarrow l_2$ is a continuous linear operator such that $|A-T|<1$, then $SA$ is invertible.
$(c)$ If $A$ is as above, then $A$ is not invertible.
$(a)$ is true which is easy to show. But I have no clue regarding $(b)$ and $(c)$. Would anybody please help me in this regard?
Thank you very much.
functional-analysis norm normed-spaces lp-spaces
For $x=(x_n) in l_2$, define
$T(x)=(0,x_1,x_2, cdots)$ and $S(x)=(x_2,x_3, cdots)$.
Which of the following statements are true?
$(a)$ $|T| = |S|=1$.
$(b)$ If $A: l_2 longrightarrow l_2$ is a continuous linear operator such that $|A-T|<1$, then $SA$ is invertible.
$(c)$ If $A$ is as above, then $A$ is not invertible.
$(a)$ is true which is easy to show. But I have no clue regarding $(b)$ and $(c)$. Would anybody please help me in this regard?
Thank you very much.
functional-analysis norm normed-spaces lp-spaces
asked Aug 22 at 5:46
Dbchatto67
16912
16912
For 2, do you know about inverse approximations: If $B$ is invertible and $|A -B| < |B^-1|^-1$ then $A$ is invertible? For 1, try some examples.
â 4-ier
Aug 22 at 6:14
Yes I know @4-ier.
â Dbchatto67
Aug 22 at 6:20
But what is $B$ here?
â Dbchatto67
Aug 22 at 6:21
Hint: What is $ST$?
â 4-ier
Aug 22 at 6:21
$(1)$ is trivially true.
â Dbchatto67
Aug 22 at 6:26
 |Â
show 4 more comments
For 2, do you know about inverse approximations: If $B$ is invertible and $|A -B| < |B^-1|^-1$ then $A$ is invertible? For 1, try some examples.
â 4-ier
Aug 22 at 6:14
Yes I know @4-ier.
â Dbchatto67
Aug 22 at 6:20
But what is $B$ here?
â Dbchatto67
Aug 22 at 6:21
Hint: What is $ST$?
â 4-ier
Aug 22 at 6:21
$(1)$ is trivially true.
â Dbchatto67
Aug 22 at 6:26
For 2, do you know about inverse approximations: If $B$ is invertible and $|A -B| < |B^-1|^-1$ then $A$ is invertible? For 1, try some examples.
â 4-ier
Aug 22 at 6:14
For 2, do you know about inverse approximations: If $B$ is invertible and $|A -B| < |B^-1|^-1$ then $A$ is invertible? For 1, try some examples.
â 4-ier
Aug 22 at 6:14
Yes I know @4-ier.
â Dbchatto67
Aug 22 at 6:20
Yes I know @4-ier.
â Dbchatto67
Aug 22 at 6:20
But what is $B$ here?
â Dbchatto67
Aug 22 at 6:21
But what is $B$ here?
â Dbchatto67
Aug 22 at 6:21
Hint: What is $ST$?
â 4-ier
Aug 22 at 6:21
Hint: What is $ST$?
â 4-ier
Aug 22 at 6:21
$(1)$ is trivially true.
â Dbchatto67
Aug 22 at 6:26
$(1)$ is trivially true.
â Dbchatto67
Aug 22 at 6:26
 |Â
show 4 more comments
1 Answer
1
active
oldest
votes
up vote
0
down vote
$lVert Tx rVert = lVert x rVert$, thus $lVert T rVert le 1$. Using $x = (1, 0, dots)$ we have $lVert x rVert = 1$ and $lVert Tx rVert = 1$ as well. Hence $lVert T rVert = 1$.
$ST = Id Rightarrow 1 = lVert ST rVert le lVert S rVert 1 Rightarrow lVert S rVert ge 1$. We also have $lVert Sx rVert le lVert x rVert$, hence $lVert S rVert = 1$.
4-ier gave the solution in the comments: If $C$ is invertible and $lVert C - D rVert < lVert C^-1 rVert^-1$, then $D$ is invertible as well.
Apply this on the invertible operator $ST$: $|SA-ST|=|S(A-T)| leq |S||A-T| < |S| = |I| = |(ST)^-1|^-1$
You can find a proof outline at https://math.stackexchange.com/a/1508092/571891.
If $A$ were invertible, then per (2) $SAA^-1 = S$ would be invertible as well. However, $S$ is clearly not injective.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
$lVert Tx rVert = lVert x rVert$, thus $lVert T rVert le 1$. Using $x = (1, 0, dots)$ we have $lVert x rVert = 1$ and $lVert Tx rVert = 1$ as well. Hence $lVert T rVert = 1$.
$ST = Id Rightarrow 1 = lVert ST rVert le lVert S rVert 1 Rightarrow lVert S rVert ge 1$. We also have $lVert Sx rVert le lVert x rVert$, hence $lVert S rVert = 1$.
4-ier gave the solution in the comments: If $C$ is invertible and $lVert C - D rVert < lVert C^-1 rVert^-1$, then $D$ is invertible as well.
Apply this on the invertible operator $ST$: $|SA-ST|=|S(A-T)| leq |S||A-T| < |S| = |I| = |(ST)^-1|^-1$
You can find a proof outline at https://math.stackexchange.com/a/1508092/571891.
If $A$ were invertible, then per (2) $SAA^-1 = S$ would be invertible as well. However, $S$ is clearly not injective.
add a comment |Â
up vote
0
down vote
$lVert Tx rVert = lVert x rVert$, thus $lVert T rVert le 1$. Using $x = (1, 0, dots)$ we have $lVert x rVert = 1$ and $lVert Tx rVert = 1$ as well. Hence $lVert T rVert = 1$.
$ST = Id Rightarrow 1 = lVert ST rVert le lVert S rVert 1 Rightarrow lVert S rVert ge 1$. We also have $lVert Sx rVert le lVert x rVert$, hence $lVert S rVert = 1$.
4-ier gave the solution in the comments: If $C$ is invertible and $lVert C - D rVert < lVert C^-1 rVert^-1$, then $D$ is invertible as well.
Apply this on the invertible operator $ST$: $|SA-ST|=|S(A-T)| leq |S||A-T| < |S| = |I| = |(ST)^-1|^-1$
You can find a proof outline at https://math.stackexchange.com/a/1508092/571891.
If $A$ were invertible, then per (2) $SAA^-1 = S$ would be invertible as well. However, $S$ is clearly not injective.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
$lVert Tx rVert = lVert x rVert$, thus $lVert T rVert le 1$. Using $x = (1, 0, dots)$ we have $lVert x rVert = 1$ and $lVert Tx rVert = 1$ as well. Hence $lVert T rVert = 1$.
$ST = Id Rightarrow 1 = lVert ST rVert le lVert S rVert 1 Rightarrow lVert S rVert ge 1$. We also have $lVert Sx rVert le lVert x rVert$, hence $lVert S rVert = 1$.
4-ier gave the solution in the comments: If $C$ is invertible and $lVert C - D rVert < lVert C^-1 rVert^-1$, then $D$ is invertible as well.
Apply this on the invertible operator $ST$: $|SA-ST|=|S(A-T)| leq |S||A-T| < |S| = |I| = |(ST)^-1|^-1$
You can find a proof outline at https://math.stackexchange.com/a/1508092/571891.
If $A$ were invertible, then per (2) $SAA^-1 = S$ would be invertible as well. However, $S$ is clearly not injective.
$lVert Tx rVert = lVert x rVert$, thus $lVert T rVert le 1$. Using $x = (1, 0, dots)$ we have $lVert x rVert = 1$ and $lVert Tx rVert = 1$ as well. Hence $lVert T rVert = 1$.
$ST = Id Rightarrow 1 = lVert ST rVert le lVert S rVert 1 Rightarrow lVert S rVert ge 1$. We also have $lVert Sx rVert le lVert x rVert$, hence $lVert S rVert = 1$.
4-ier gave the solution in the comments: If $C$ is invertible and $lVert C - D rVert < lVert C^-1 rVert^-1$, then $D$ is invertible as well.
Apply this on the invertible operator $ST$: $|SA-ST|=|S(A-T)| leq |S||A-T| < |S| = |I| = |(ST)^-1|^-1$
You can find a proof outline at https://math.stackexchange.com/a/1508092/571891.
If $A$ were invertible, then per (2) $SAA^-1 = S$ would be invertible as well. However, $S$ is clearly not injective.
answered Aug 23 at 10:35
FunkTheo
304
304
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2890660%2fquestion-regarding-l-2-space%23new-answer', 'question_page');
);
Post as a guest
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
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
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
For 2, do you know about inverse approximations: If $B$ is invertible and $|A -B| < |B^-1|^-1$ then $A$ is invertible? For 1, try some examples.
â 4-ier
Aug 22 at 6:14
Yes I know @4-ier.
â Dbchatto67
Aug 22 at 6:20
But what is $B$ here?
â Dbchatto67
Aug 22 at 6:21
Hint: What is $ST$?
â 4-ier
Aug 22 at 6:21
$(1)$ is trivially true.
â Dbchatto67
Aug 22 at 6:26