Let V be a finite dimensional complex vector space. Let T : V â V be a diagonalizable, linear map. [closed]
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
For each positive integer $k$ we write $T^k = Tcircdotscirc T$, the $k$-fold composition of the map $T$. With this notation, we can define $p(T) := a_0mathrmId_V + a_1T +dots + a_nT^n$ whenever $p(x) = a_0 + a_1x +dots + a_nx^n$ is a polynomial with complex coefficients
$a_0,dots, a_n$.
a) Show that if f $û$ is any eigenvalue of $T$ and $p$ is any polynomial, $p(û)$ is an eigenvalue of $p(T)$
b) Show that if $ò$ is a basis of $V$ then $p([T]^ò_ò)$ is diagonalizable for any polynomial $p(x)$ with complex coefficients. Deduce that $p(T)$ is diagonalizable.
c) Suppose that All of the eigenvalues s û of T satisfy |û| < 1. Show that for
any basis ñ of V , the matrix limkâÂÂâÂÂ[T^k]ñ
ñ = O, in the sense that the components of
the matrix [T^k]ñ
ñ
all tend to 0 as k â âÂÂ.
linear-algebra eigenvalues-eigenvectors
closed as off-topic by mathcounterexamples.net, GEdgar, amWhy, Adrian Keister, Jendrik Stelzner Aug 10 at 1:03
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Adrian Keister, Jendrik Stelzner
add a comment |Â
up vote
0
down vote
favorite
For each positive integer $k$ we write $T^k = Tcircdotscirc T$, the $k$-fold composition of the map $T$. With this notation, we can define $p(T) := a_0mathrmId_V + a_1T +dots + a_nT^n$ whenever $p(x) = a_0 + a_1x +dots + a_nx^n$ is a polynomial with complex coefficients
$a_0,dots, a_n$.
a) Show that if f $û$ is any eigenvalue of $T$ and $p$ is any polynomial, $p(û)$ is an eigenvalue of $p(T)$
b) Show that if $ò$ is a basis of $V$ then $p([T]^ò_ò)$ is diagonalizable for any polynomial $p(x)$ with complex coefficients. Deduce that $p(T)$ is diagonalizable.
c) Suppose that All of the eigenvalues s û of T satisfy |û| < 1. Show that for
any basis ñ of V , the matrix limkâÂÂâÂÂ[T^k]ñ
ñ = O, in the sense that the components of
the matrix [T^k]ñ
ñ
all tend to 0 as k â âÂÂ.
linear-algebra eigenvalues-eigenvectors
closed as off-topic by mathcounterexamples.net, GEdgar, amWhy, Adrian Keister, Jendrik Stelzner Aug 10 at 1:03
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Adrian Keister, Jendrik Stelzner
Hint for A: write down what $p(T)$ is and multiply by an eigenvector.
â Sean Roberson
Aug 9 at 20:06
2
You asked 3 questions within the last 2 hours. One of which has been put on hold. In each cases youâÂÂre not providing any thought from your own. Not a good start guy!
â mathcounterexamples.net
Aug 9 at 20:08
Are you in the same class as this person?
â angryavian
Aug 9 at 20:14
I donâÂÂt have the pleasure to know her/him...
â mathcounterexamples.net
Aug 9 at 20:14
@mathcounterexamples.net I was addressing the OP; the question and formatting (before edits) are almost the same
â angryavian
Aug 9 at 20:18
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
For each positive integer $k$ we write $T^k = Tcircdotscirc T$, the $k$-fold composition of the map $T$. With this notation, we can define $p(T) := a_0mathrmId_V + a_1T +dots + a_nT^n$ whenever $p(x) = a_0 + a_1x +dots + a_nx^n$ is a polynomial with complex coefficients
$a_0,dots, a_n$.
a) Show that if f $û$ is any eigenvalue of $T$ and $p$ is any polynomial, $p(û)$ is an eigenvalue of $p(T)$
b) Show that if $ò$ is a basis of $V$ then $p([T]^ò_ò)$ is diagonalizable for any polynomial $p(x)$ with complex coefficients. Deduce that $p(T)$ is diagonalizable.
c) Suppose that All of the eigenvalues s û of T satisfy |û| < 1. Show that for
any basis ñ of V , the matrix limkâÂÂâÂÂ[T^k]ñ
ñ = O, in the sense that the components of
the matrix [T^k]ñ
ñ
all tend to 0 as k â âÂÂ.
linear-algebra eigenvalues-eigenvectors
For each positive integer $k$ we write $T^k = Tcircdotscirc T$, the $k$-fold composition of the map $T$. With this notation, we can define $p(T) := a_0mathrmId_V + a_1T +dots + a_nT^n$ whenever $p(x) = a_0 + a_1x +dots + a_nx^n$ is a polynomial with complex coefficients
$a_0,dots, a_n$.
a) Show that if f $û$ is any eigenvalue of $T$ and $p$ is any polynomial, $p(û)$ is an eigenvalue of $p(T)$
b) Show that if $ò$ is a basis of $V$ then $p([T]^ò_ò)$ is diagonalizable for any polynomial $p(x)$ with complex coefficients. Deduce that $p(T)$ is diagonalizable.
c) Suppose that All of the eigenvalues s û of T satisfy |û| < 1. Show that for
any basis ñ of V , the matrix limkâÂÂâÂÂ[T^k]ñ
ñ = O, in the sense that the components of
the matrix [T^k]ñ
ñ
all tend to 0 as k â âÂÂ.
linear-algebra eigenvalues-eigenvectors
edited Aug 9 at 20:32
asked Aug 9 at 20:01
Kayy Wang
63
63
closed as off-topic by mathcounterexamples.net, GEdgar, amWhy, Adrian Keister, Jendrik Stelzner Aug 10 at 1:03
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Adrian Keister, Jendrik Stelzner
closed as off-topic by mathcounterexamples.net, GEdgar, amWhy, Adrian Keister, Jendrik Stelzner Aug 10 at 1:03
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Adrian Keister, Jendrik Stelzner
Hint for A: write down what $p(T)$ is and multiply by an eigenvector.
â Sean Roberson
Aug 9 at 20:06
2
You asked 3 questions within the last 2 hours. One of which has been put on hold. In each cases youâÂÂre not providing any thought from your own. Not a good start guy!
â mathcounterexamples.net
Aug 9 at 20:08
Are you in the same class as this person?
â angryavian
Aug 9 at 20:14
I donâÂÂt have the pleasure to know her/him...
â mathcounterexamples.net
Aug 9 at 20:14
@mathcounterexamples.net I was addressing the OP; the question and formatting (before edits) are almost the same
â angryavian
Aug 9 at 20:18
add a comment |Â
Hint for A: write down what $p(T)$ is and multiply by an eigenvector.
â Sean Roberson
Aug 9 at 20:06
2
You asked 3 questions within the last 2 hours. One of which has been put on hold. In each cases youâÂÂre not providing any thought from your own. Not a good start guy!
â mathcounterexamples.net
Aug 9 at 20:08
Are you in the same class as this person?
â angryavian
Aug 9 at 20:14
I donâÂÂt have the pleasure to know her/him...
â mathcounterexamples.net
Aug 9 at 20:14
@mathcounterexamples.net I was addressing the OP; the question and formatting (before edits) are almost the same
â angryavian
Aug 9 at 20:18
Hint for A: write down what $p(T)$ is and multiply by an eigenvector.
â Sean Roberson
Aug 9 at 20:06
Hint for A: write down what $p(T)$ is and multiply by an eigenvector.
â Sean Roberson
Aug 9 at 20:06
2
2
You asked 3 questions within the last 2 hours. One of which has been put on hold. In each cases youâÂÂre not providing any thought from your own. Not a good start guy!
â mathcounterexamples.net
Aug 9 at 20:08
You asked 3 questions within the last 2 hours. One of which has been put on hold. In each cases youâÂÂre not providing any thought from your own. Not a good start guy!
â mathcounterexamples.net
Aug 9 at 20:08
Are you in the same class as this person?
â angryavian
Aug 9 at 20:14
Are you in the same class as this person?
â angryavian
Aug 9 at 20:14
I donâÂÂt have the pleasure to know her/him...
â mathcounterexamples.net
Aug 9 at 20:14
I donâÂÂt have the pleasure to know her/him...
â mathcounterexamples.net
Aug 9 at 20:14
@mathcounterexamples.net I was addressing the OP; the question and formatting (before edits) are almost the same
â angryavian
Aug 9 at 20:18
@mathcounterexamples.net I was addressing the OP; the question and formatting (before edits) are almost the same
â angryavian
Aug 9 at 20:18
add a comment |Â
3 Answers
3
active
oldest
votes
up vote
1
down vote
For (a), let $v$ be an eigenvector of $lambda$ for $T$, i.e. $Tv=lambda v$, $p$ a polynomial as in your question. Then you have
$$p(T)v=(sum_i=0^na_iT^i)v=sum_i=0^n(a_iT^i)v=sum_i=0^na_iT^iv=sum_i=0^na_ilambda^iv=(sum_i=0^na_ilambda^i)v$$
The first two equalities just follow from basic properties of linear maps and their sums like distribution over addition, etc. The most important property used, is that $T^iv=lambda^iv$ for this eigenvector $v$.
You can see this, by considering an induction on $i$:
The base case for $i=0$ just amounts to: $T^0v=id_Vv=v=1cdot
v=lambda^0v$.Now, for the induction step, assume that $T^iv=lambda^iv$ for some
$i$, then $T^i+1v=TT^iv=Tlambda^iv=lambda^i Tv=lambda^i+1v$.
For (b), consider what the conditions for a matrix are to be diagonalizable in the complex numbers. Especially, to deduce diagonalizability of $p(T)$, how is $p(T)$ connected with $p([T]^beta_beta)$?
add a comment |Â
up vote
0
down vote
Observe that $T^n(v) = T^n-1(T(v)) = T^n-1(lambda v) = lambda^nv$.
We are looking for a $v$ such that $p(T)(v) = p(lambda)(v)$.
Assume that $v$ is an eigenvector of $T$, i.e. $T(v) = lambda v$.
Then
$p(T)(v) = (a_nT^n + ... +a_1T + a_0)(v) =$
$= a_nT^n(v) + ... + a_1T(v) + a_0v =$
$=a_nlambda^nv + ... + a_1lambda v + a_0v$
$= p(lambda)(v)$
add a comment |Â
up vote
0
down vote
For a), use the hint in the comments, just to write out $p(T)$ and apply it to an eigenvector.
For b), it is easy to prove that any power of a diagonalizable matrix is diagonalizable (and is similar to $D^n$, where $PAP^-1=D$).
add a comment |Â
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
For (a), let $v$ be an eigenvector of $lambda$ for $T$, i.e. $Tv=lambda v$, $p$ a polynomial as in your question. Then you have
$$p(T)v=(sum_i=0^na_iT^i)v=sum_i=0^n(a_iT^i)v=sum_i=0^na_iT^iv=sum_i=0^na_ilambda^iv=(sum_i=0^na_ilambda^i)v$$
The first two equalities just follow from basic properties of linear maps and their sums like distribution over addition, etc. The most important property used, is that $T^iv=lambda^iv$ for this eigenvector $v$.
You can see this, by considering an induction on $i$:
The base case for $i=0$ just amounts to: $T^0v=id_Vv=v=1cdot
v=lambda^0v$.Now, for the induction step, assume that $T^iv=lambda^iv$ for some
$i$, then $T^i+1v=TT^iv=Tlambda^iv=lambda^i Tv=lambda^i+1v$.
For (b), consider what the conditions for a matrix are to be diagonalizable in the complex numbers. Especially, to deduce diagonalizability of $p(T)$, how is $p(T)$ connected with $p([T]^beta_beta)$?
add a comment |Â
up vote
1
down vote
For (a), let $v$ be an eigenvector of $lambda$ for $T$, i.e. $Tv=lambda v$, $p$ a polynomial as in your question. Then you have
$$p(T)v=(sum_i=0^na_iT^i)v=sum_i=0^n(a_iT^i)v=sum_i=0^na_iT^iv=sum_i=0^na_ilambda^iv=(sum_i=0^na_ilambda^i)v$$
The first two equalities just follow from basic properties of linear maps and their sums like distribution over addition, etc. The most important property used, is that $T^iv=lambda^iv$ for this eigenvector $v$.
You can see this, by considering an induction on $i$:
The base case for $i=0$ just amounts to: $T^0v=id_Vv=v=1cdot
v=lambda^0v$.Now, for the induction step, assume that $T^iv=lambda^iv$ for some
$i$, then $T^i+1v=TT^iv=Tlambda^iv=lambda^i Tv=lambda^i+1v$.
For (b), consider what the conditions for a matrix are to be diagonalizable in the complex numbers. Especially, to deduce diagonalizability of $p(T)$, how is $p(T)$ connected with $p([T]^beta_beta)$?
add a comment |Â
up vote
1
down vote
up vote
1
down vote
For (a), let $v$ be an eigenvector of $lambda$ for $T$, i.e. $Tv=lambda v$, $p$ a polynomial as in your question. Then you have
$$p(T)v=(sum_i=0^na_iT^i)v=sum_i=0^n(a_iT^i)v=sum_i=0^na_iT^iv=sum_i=0^na_ilambda^iv=(sum_i=0^na_ilambda^i)v$$
The first two equalities just follow from basic properties of linear maps and their sums like distribution over addition, etc. The most important property used, is that $T^iv=lambda^iv$ for this eigenvector $v$.
You can see this, by considering an induction on $i$:
The base case for $i=0$ just amounts to: $T^0v=id_Vv=v=1cdot
v=lambda^0v$.Now, for the induction step, assume that $T^iv=lambda^iv$ for some
$i$, then $T^i+1v=TT^iv=Tlambda^iv=lambda^i Tv=lambda^i+1v$.
For (b), consider what the conditions for a matrix are to be diagonalizable in the complex numbers. Especially, to deduce diagonalizability of $p(T)$, how is $p(T)$ connected with $p([T]^beta_beta)$?
For (a), let $v$ be an eigenvector of $lambda$ for $T$, i.e. $Tv=lambda v$, $p$ a polynomial as in your question. Then you have
$$p(T)v=(sum_i=0^na_iT^i)v=sum_i=0^n(a_iT^i)v=sum_i=0^na_iT^iv=sum_i=0^na_ilambda^iv=(sum_i=0^na_ilambda^i)v$$
The first two equalities just follow from basic properties of linear maps and their sums like distribution over addition, etc. The most important property used, is that $T^iv=lambda^iv$ for this eigenvector $v$.
You can see this, by considering an induction on $i$:
The base case for $i=0$ just amounts to: $T^0v=id_Vv=v=1cdot
v=lambda^0v$.Now, for the induction step, assume that $T^iv=lambda^iv$ for some
$i$, then $T^i+1v=TT^iv=Tlambda^iv=lambda^i Tv=lambda^i+1v$.
For (b), consider what the conditions for a matrix are to be diagonalizable in the complex numbers. Especially, to deduce diagonalizability of $p(T)$, how is $p(T)$ connected with $p([T]^beta_beta)$?
edited Aug 9 at 20:17
answered Aug 9 at 20:12
zzuussee
1,701420
1,701420
add a comment |Â
add a comment |Â
up vote
0
down vote
Observe that $T^n(v) = T^n-1(T(v)) = T^n-1(lambda v) = lambda^nv$.
We are looking for a $v$ such that $p(T)(v) = p(lambda)(v)$.
Assume that $v$ is an eigenvector of $T$, i.e. $T(v) = lambda v$.
Then
$p(T)(v) = (a_nT^n + ... +a_1T + a_0)(v) =$
$= a_nT^n(v) + ... + a_1T(v) + a_0v =$
$=a_nlambda^nv + ... + a_1lambda v + a_0v$
$= p(lambda)(v)$
add a comment |Â
up vote
0
down vote
Observe that $T^n(v) = T^n-1(T(v)) = T^n-1(lambda v) = lambda^nv$.
We are looking for a $v$ such that $p(T)(v) = p(lambda)(v)$.
Assume that $v$ is an eigenvector of $T$, i.e. $T(v) = lambda v$.
Then
$p(T)(v) = (a_nT^n + ... +a_1T + a_0)(v) =$
$= a_nT^n(v) + ... + a_1T(v) + a_0v =$
$=a_nlambda^nv + ... + a_1lambda v + a_0v$
$= p(lambda)(v)$
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Observe that $T^n(v) = T^n-1(T(v)) = T^n-1(lambda v) = lambda^nv$.
We are looking for a $v$ such that $p(T)(v) = p(lambda)(v)$.
Assume that $v$ is an eigenvector of $T$, i.e. $T(v) = lambda v$.
Then
$p(T)(v) = (a_nT^n + ... +a_1T + a_0)(v) =$
$= a_nT^n(v) + ... + a_1T(v) + a_0v =$
$=a_nlambda^nv + ... + a_1lambda v + a_0v$
$= p(lambda)(v)$
Observe that $T^n(v) = T^n-1(T(v)) = T^n-1(lambda v) = lambda^nv$.
We are looking for a $v$ such that $p(T)(v) = p(lambda)(v)$.
Assume that $v$ is an eigenvector of $T$, i.e. $T(v) = lambda v$.
Then
$p(T)(v) = (a_nT^n + ... +a_1T + a_0)(v) =$
$= a_nT^n(v) + ... + a_1T(v) + a_0v =$
$=a_nlambda^nv + ... + a_1lambda v + a_0v$
$= p(lambda)(v)$
answered Aug 9 at 20:12
Lukas Kofler
6191518
6191518
add a comment |Â
add a comment |Â
up vote
0
down vote
For a), use the hint in the comments, just to write out $p(T)$ and apply it to an eigenvector.
For b), it is easy to prove that any power of a diagonalizable matrix is diagonalizable (and is similar to $D^n$, where $PAP^-1=D$).
add a comment |Â
up vote
0
down vote
For a), use the hint in the comments, just to write out $p(T)$ and apply it to an eigenvector.
For b), it is easy to prove that any power of a diagonalizable matrix is diagonalizable (and is similar to $D^n$, where $PAP^-1=D$).
add a comment |Â
up vote
0
down vote
up vote
0
down vote
For a), use the hint in the comments, just to write out $p(T)$ and apply it to an eigenvector.
For b), it is easy to prove that any power of a diagonalizable matrix is diagonalizable (and is similar to $D^n$, where $PAP^-1=D$).
For a), use the hint in the comments, just to write out $p(T)$ and apply it to an eigenvector.
For b), it is easy to prove that any power of a diagonalizable matrix is diagonalizable (and is similar to $D^n$, where $PAP^-1=D$).
answered Aug 9 at 20:23
Chris Custer
5,5862622
5,5862622
add a comment |Â
add a comment |Â
Hint for A: write down what $p(T)$ is and multiply by an eigenvector.
â Sean Roberson
Aug 9 at 20:06
2
You asked 3 questions within the last 2 hours. One of which has been put on hold. In each cases youâÂÂre not providing any thought from your own. Not a good start guy!
â mathcounterexamples.net
Aug 9 at 20:08
Are you in the same class as this person?
â angryavian
Aug 9 at 20:14
I donâÂÂt have the pleasure to know her/him...
â mathcounterexamples.net
Aug 9 at 20:14
@mathcounterexamples.net I was addressing the OP; the question and formatting (before edits) are almost the same
â angryavian
Aug 9 at 20:18