Characteristic polynomial of a linear operator in matrix space
up vote
1
down vote
favorite
For $A in M_{ntimes n}(F)=V$, we define a linear operator $T$ such that $T(X)=AX$ for $Xin V$.
I need to show that the characteristic polynomial of $T$ is $(f_A(t))^n$, where $f_A(t)$ is the characteristic polynomial of $A$.
My latest approach has been to define $W$, the $T$-cyclic subspace of $V$ generated by some $X$. Then,
$beta = {X,,T(X),,T^2(X),,dots,,T^{k-1}(X)}$
is an ordered basis for $W$, where $k=dim(W)$. From here, I'm thinking I need to extend the basis to $n$ so that it's a basis for $V$ and then show somehow that, since $T^n(X)=A^nX$, my desired result falls out.
Am I on the right track? Any pushes in the right direction that could help me put the pieces together? Or is there a totally different way to solve this that has eluded me?
linear-algebra matrices vector-spaces linear-transformations
add a comment |
up vote
1
down vote
favorite
For $A in M_{ntimes n}(F)=V$, we define a linear operator $T$ such that $T(X)=AX$ for $Xin V$.
I need to show that the characteristic polynomial of $T$ is $(f_A(t))^n$, where $f_A(t)$ is the characteristic polynomial of $A$.
My latest approach has been to define $W$, the $T$-cyclic subspace of $V$ generated by some $X$. Then,
$beta = {X,,T(X),,T^2(X),,dots,,T^{k-1}(X)}$
is an ordered basis for $W$, where $k=dim(W)$. From here, I'm thinking I need to extend the basis to $n$ so that it's a basis for $V$ and then show somehow that, since $T^n(X)=A^nX$, my desired result falls out.
Am I on the right track? Any pushes in the right direction that could help me put the pieces together? Or is there a totally different way to solve this that has eluded me?
linear-algebra matrices vector-spaces linear-transformations
Another route I have found to investigate is to start by using the fact that the characteristic polynomial of any $Ain M_{ntimes n}(F)$ is equal to $(-1)^n(a^nt^n + a_{n-1}t^{n-1} + dots + a_1t + a_0$).
– notadoctor
Nov 15 at 22:25
Nevermind, I've managed to solve it. See my answer below.
– notadoctor
Nov 16 at 8:48
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
For $A in M_{ntimes n}(F)=V$, we define a linear operator $T$ such that $T(X)=AX$ for $Xin V$.
I need to show that the characteristic polynomial of $T$ is $(f_A(t))^n$, where $f_A(t)$ is the characteristic polynomial of $A$.
My latest approach has been to define $W$, the $T$-cyclic subspace of $V$ generated by some $X$. Then,
$beta = {X,,T(X),,T^2(X),,dots,,T^{k-1}(X)}$
is an ordered basis for $W$, where $k=dim(W)$. From here, I'm thinking I need to extend the basis to $n$ so that it's a basis for $V$ and then show somehow that, since $T^n(X)=A^nX$, my desired result falls out.
Am I on the right track? Any pushes in the right direction that could help me put the pieces together? Or is there a totally different way to solve this that has eluded me?
linear-algebra matrices vector-spaces linear-transformations
For $A in M_{ntimes n}(F)=V$, we define a linear operator $T$ such that $T(X)=AX$ for $Xin V$.
I need to show that the characteristic polynomial of $T$ is $(f_A(t))^n$, where $f_A(t)$ is the characteristic polynomial of $A$.
My latest approach has been to define $W$, the $T$-cyclic subspace of $V$ generated by some $X$. Then,
$beta = {X,,T(X),,T^2(X),,dots,,T^{k-1}(X)}$
is an ordered basis for $W$, where $k=dim(W)$. From here, I'm thinking I need to extend the basis to $n$ so that it's a basis for $V$ and then show somehow that, since $T^n(X)=A^nX$, my desired result falls out.
Am I on the right track? Any pushes in the right direction that could help me put the pieces together? Or is there a totally different way to solve this that has eluded me?
linear-algebra matrices vector-spaces linear-transformations
linear-algebra matrices vector-spaces linear-transformations
edited Nov 15 at 21:15
asked Nov 15 at 20:53
notadoctor
917
917
Another route I have found to investigate is to start by using the fact that the characteristic polynomial of any $Ain M_{ntimes n}(F)$ is equal to $(-1)^n(a^nt^n + a_{n-1}t^{n-1} + dots + a_1t + a_0$).
– notadoctor
Nov 15 at 22:25
Nevermind, I've managed to solve it. See my answer below.
– notadoctor
Nov 16 at 8:48
add a comment |
Another route I have found to investigate is to start by using the fact that the characteristic polynomial of any $Ain M_{ntimes n}(F)$ is equal to $(-1)^n(a^nt^n + a_{n-1}t^{n-1} + dots + a_1t + a_0$).
– notadoctor
Nov 15 at 22:25
Nevermind, I've managed to solve it. See my answer below.
– notadoctor
Nov 16 at 8:48
Another route I have found to investigate is to start by using the fact that the characteristic polynomial of any $Ain M_{ntimes n}(F)$ is equal to $(-1)^n(a^nt^n + a_{n-1}t^{n-1} + dots + a_1t + a_0$).
– notadoctor
Nov 15 at 22:25
Another route I have found to investigate is to start by using the fact that the characteristic polynomial of any $Ain M_{ntimes n}(F)$ is equal to $(-1)^n(a^nt^n + a_{n-1}t^{n-1} + dots + a_1t + a_0$).
– notadoctor
Nov 15 at 22:25
Nevermind, I've managed to solve it. See my answer below.
– notadoctor
Nov 16 at 8:48
Nevermind, I've managed to solve it. See my answer below.
– notadoctor
Nov 16 at 8:48
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
Extending the ordered basis so that $k=n$, we have
$beta = {X, AX, A^2X,...,A^{n-1}X}$
as a basis for $V$. Now we simply express $T$ as $[T]_{beta}$, the matrix form of the operator, and take the characteristic polynomial of the result. Note that:
$T(X)=AX$
$T(AX)=A^2X$
$dots$
$T(A^{n-1}X)=A^nX$
and thus
$[T]_{beta}=AI_n$
which has the characteristic polynomial given by $(f_A(t))^n$, as needed.
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
Extending the ordered basis so that $k=n$, we have
$beta = {X, AX, A^2X,...,A^{n-1}X}$
as a basis for $V$. Now we simply express $T$ as $[T]_{beta}$, the matrix form of the operator, and take the characteristic polynomial of the result. Note that:
$T(X)=AX$
$T(AX)=A^2X$
$dots$
$T(A^{n-1}X)=A^nX$
and thus
$[T]_{beta}=AI_n$
which has the characteristic polynomial given by $(f_A(t))^n$, as needed.
add a comment |
up vote
1
down vote
accepted
Extending the ordered basis so that $k=n$, we have
$beta = {X, AX, A^2X,...,A^{n-1}X}$
as a basis for $V$. Now we simply express $T$ as $[T]_{beta}$, the matrix form of the operator, and take the characteristic polynomial of the result. Note that:
$T(X)=AX$
$T(AX)=A^2X$
$dots$
$T(A^{n-1}X)=A^nX$
and thus
$[T]_{beta}=AI_n$
which has the characteristic polynomial given by $(f_A(t))^n$, as needed.
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Extending the ordered basis so that $k=n$, we have
$beta = {X, AX, A^2X,...,A^{n-1}X}$
as a basis for $V$. Now we simply express $T$ as $[T]_{beta}$, the matrix form of the operator, and take the characteristic polynomial of the result. Note that:
$T(X)=AX$
$T(AX)=A^2X$
$dots$
$T(A^{n-1}X)=A^nX$
and thus
$[T]_{beta}=AI_n$
which has the characteristic polynomial given by $(f_A(t))^n$, as needed.
Extending the ordered basis so that $k=n$, we have
$beta = {X, AX, A^2X,...,A^{n-1}X}$
as a basis for $V$. Now we simply express $T$ as $[T]_{beta}$, the matrix form of the operator, and take the characteristic polynomial of the result. Note that:
$T(X)=AX$
$T(AX)=A^2X$
$dots$
$T(A^{n-1}X)=A^nX$
and thus
$[T]_{beta}=AI_n$
which has the characteristic polynomial given by $(f_A(t))^n$, as needed.
answered Nov 16 at 8:31
notadoctor
917
917
add a comment |
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3000315%2fcharacteristic-polynomial-of-a-linear-operator-in-matrix-space%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
Another route I have found to investigate is to start by using the fact that the characteristic polynomial of any $Ain M_{ntimes n}(F)$ is equal to $(-1)^n(a^nt^n + a_{n-1}t^{n-1} + dots + a_1t + a_0$).
– notadoctor
Nov 15 at 22:25
Nevermind, I've managed to solve it. See my answer below.
– notadoctor
Nov 16 at 8:48