How does the characteristics polynomial be $(lambda-1)^m lambda^m-n$ where $m le n$ here?

Clash Royale CLAN TAG#URR8PPP
up vote
2
down vote
favorite
Question. Let $A$ be a real symmetric $n times n$ matrix whose only eigenvalues are $0$ and $1$. Let the dimension of the null space of $A-I$ be $m$. Pick out the true statements:
The characteristic polynomial of $A$ is $(lambda-1)^mlambda^m-n$
$A^k=A^k+1$ for all positive integers $k$.
The rank of $A$ is $m$.
My Solution.
Since $A$ is symmetric matrix so there exists some non singular matrix, $P$ and a diagonal matrices $D$ whose diagonal entries are only $0$ and $1$ (as that of eigen values of $A$) so that $A=PDP^-1$. Therefore $A^2=PD^2P^-1=PDP^-1=A$ This implies $2$ is true.
Now according to the given condition $dim E_1=m$.(here, $E_lambda=$ eigenspace corresponding to $lambda$). Now since $A$ is diagonalizable so $BbbR^n=E_0 oplus E_1$ this implies $dim E_0=n-m$. So $dim Ker A=n-m$ i.e. $r(A)=m$. This prove $3$ to be true
But I cannot see any way to conclude 1.
Infact, I have a confusion about option $1$. here how does the power of $lambda$ is $m-n$ in option 1? I mean $m le n$ here. So how does $(lambda-1)^m lambda^m-n$ is a polynomial when $mne n$?
Please hep me to clear the confusion and option 1. Also let me know whether I made any mistake in all other options. Thank you ..
EDIT: Here the option 1 has been proved true (assuming the option 1 as it is given here). But I really don't get that answer.
linear-algebra matrices
add a comment |Â
up vote
2
down vote
favorite
Question. Let $A$ be a real symmetric $n times n$ matrix whose only eigenvalues are $0$ and $1$. Let the dimension of the null space of $A-I$ be $m$. Pick out the true statements:
The characteristic polynomial of $A$ is $(lambda-1)^mlambda^m-n$
$A^k=A^k+1$ for all positive integers $k$.
The rank of $A$ is $m$.
My Solution.
Since $A$ is symmetric matrix so there exists some non singular matrix, $P$ and a diagonal matrices $D$ whose diagonal entries are only $0$ and $1$ (as that of eigen values of $A$) so that $A=PDP^-1$. Therefore $A^2=PD^2P^-1=PDP^-1=A$ This implies $2$ is true.
Now according to the given condition $dim E_1=m$.(here, $E_lambda=$ eigenspace corresponding to $lambda$). Now since $A$ is diagonalizable so $BbbR^n=E_0 oplus E_1$ this implies $dim E_0=n-m$. So $dim Ker A=n-m$ i.e. $r(A)=m$. This prove $3$ to be true
But I cannot see any way to conclude 1.
Infact, I have a confusion about option $1$. here how does the power of $lambda$ is $m-n$ in option 1? I mean $m le n$ here. So how does $(lambda-1)^m lambda^m-n$ is a polynomial when $mne n$?
Please hep me to clear the confusion and option 1. Also let me know whether I made any mistake in all other options. Thank you ..
EDIT: Here the option 1 has been proved true (assuming the option 1 as it is given here). But I really don't get that answer.
linear-algebra matrices
Actually the factor of the characteristic polynomial is $lambda^n-m$ not $lambda^m-n$
â Chinnapparaj R
Sep 9 at 6:31
but in option 1 it is given: $lambda^m-n$...!!
â Indrajit Ghosh
Sep 9 at 6:32
add a comment |Â
up vote
2
down vote
favorite
up vote
2
down vote
favorite
Question. Let $A$ be a real symmetric $n times n$ matrix whose only eigenvalues are $0$ and $1$. Let the dimension of the null space of $A-I$ be $m$. Pick out the true statements:
The characteristic polynomial of $A$ is $(lambda-1)^mlambda^m-n$
$A^k=A^k+1$ for all positive integers $k$.
The rank of $A$ is $m$.
My Solution.
Since $A$ is symmetric matrix so there exists some non singular matrix, $P$ and a diagonal matrices $D$ whose diagonal entries are only $0$ and $1$ (as that of eigen values of $A$) so that $A=PDP^-1$. Therefore $A^2=PD^2P^-1=PDP^-1=A$ This implies $2$ is true.
Now according to the given condition $dim E_1=m$.(here, $E_lambda=$ eigenspace corresponding to $lambda$). Now since $A$ is diagonalizable so $BbbR^n=E_0 oplus E_1$ this implies $dim E_0=n-m$. So $dim Ker A=n-m$ i.e. $r(A)=m$. This prove $3$ to be true
But I cannot see any way to conclude 1.
Infact, I have a confusion about option $1$. here how does the power of $lambda$ is $m-n$ in option 1? I mean $m le n$ here. So how does $(lambda-1)^m lambda^m-n$ is a polynomial when $mne n$?
Please hep me to clear the confusion and option 1. Also let me know whether I made any mistake in all other options. Thank you ..
EDIT: Here the option 1 has been proved true (assuming the option 1 as it is given here). But I really don't get that answer.
linear-algebra matrices
Question. Let $A$ be a real symmetric $n times n$ matrix whose only eigenvalues are $0$ and $1$. Let the dimension of the null space of $A-I$ be $m$. Pick out the true statements:
The characteristic polynomial of $A$ is $(lambda-1)^mlambda^m-n$
$A^k=A^k+1$ for all positive integers $k$.
The rank of $A$ is $m$.
My Solution.
Since $A$ is symmetric matrix so there exists some non singular matrix, $P$ and a diagonal matrices $D$ whose diagonal entries are only $0$ and $1$ (as that of eigen values of $A$) so that $A=PDP^-1$. Therefore $A^2=PD^2P^-1=PDP^-1=A$ This implies $2$ is true.
Now according to the given condition $dim E_1=m$.(here, $E_lambda=$ eigenspace corresponding to $lambda$). Now since $A$ is diagonalizable so $BbbR^n=E_0 oplus E_1$ this implies $dim E_0=n-m$. So $dim Ker A=n-m$ i.e. $r(A)=m$. This prove $3$ to be true
But I cannot see any way to conclude 1.
Infact, I have a confusion about option $1$. here how does the power of $lambda$ is $m-n$ in option 1? I mean $m le n$ here. So how does $(lambda-1)^m lambda^m-n$ is a polynomial when $mne n$?
Please hep me to clear the confusion and option 1. Also let me know whether I made any mistake in all other options. Thank you ..
EDIT: Here the option 1 has been proved true (assuming the option 1 as it is given here). But I really don't get that answer.
linear-algebra matrices
linear-algebra matrices
edited Sep 9 at 6:36
asked Sep 9 at 6:25
Indrajit Ghosh
879517
879517
Actually the factor of the characteristic polynomial is $lambda^n-m$ not $lambda^m-n$
â Chinnapparaj R
Sep 9 at 6:31
but in option 1 it is given: $lambda^m-n$...!!
â Indrajit Ghosh
Sep 9 at 6:32
add a comment |Â
Actually the factor of the characteristic polynomial is $lambda^n-m$ not $lambda^m-n$
â Chinnapparaj R
Sep 9 at 6:31
but in option 1 it is given: $lambda^m-n$...!!
â Indrajit Ghosh
Sep 9 at 6:32
Actually the factor of the characteristic polynomial is $lambda^n-m$ not $lambda^m-n$
â Chinnapparaj R
Sep 9 at 6:31
Actually the factor of the characteristic polynomial is $lambda^n-m$ not $lambda^m-n$
â Chinnapparaj R
Sep 9 at 6:31
but in option 1 it is given: $lambda^m-n$...!!
â Indrajit Ghosh
Sep 9 at 6:32
but in option 1 it is given: $lambda^m-n$...!!
â Indrajit Ghosh
Sep 9 at 6:32
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
2
down vote
accepted
$A$ is diagonalizable iff $textdim(E_lambda i)=textmultiplicity of $lambda_i$ $, for all $i$
By hypothesis, dimension of $N(A-I)=m$ means $textdim(E_1)=m$=multiplicity of $1$
So $(lambda-1)^m$ is a factor of $rho_A(x)$ and so $0$ is the eigenvalue of multiplicity $n-m$.
Thus $$rho_A(x)= (lambda-1)^m (lambda)^n-m$$
then how does option 1 is true?
â Indrajit Ghosh
Sep 9 at 6:43
as it is given $lambda^m-n$ in the option.
â Indrajit Ghosh
Sep 9 at 6:43
I think It 's a typo
â Chinnapparaj R
Sep 9 at 6:44
see also the answer of your provided link in the OP!
â Chinnapparaj R
Sep 9 at 6:44
it is given that option 1 is true in that link....but how ...?? if we assume the question as it is here the it should be false ...!! that is my confusion....
â Indrajit Ghosh
Sep 9 at 6:46
 |Â
show 2 more comments
up vote
0
down vote
$A$ diagonalizes to a diagonal matrix $D$ with only $0$ and $1$ on the diagonal. We know that $$n-m = operatornamerank(A - I) = operatornamerank(D - I) = text number of zeroes on the diagonal of D$$
Hence $D = operatornamediag(underbrace1, ldots, 1_m, underbrace0, ldots, 0_n-m)$ or a permutation thereof, so the characteristic polynomial of $A$ is $$det(A - lambda I) = det(D - lambda I) = det operatornamediag(underbrace1-lambda, ldots, 1-lambda_m, underbrace-lambda, ldots, -lambda_n-m) = (-1)^n (lambda-1)^mlambda^n-m$$
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
$A$ is diagonalizable iff $textdim(E_lambda i)=textmultiplicity of $lambda_i$ $, for all $i$
By hypothesis, dimension of $N(A-I)=m$ means $textdim(E_1)=m$=multiplicity of $1$
So $(lambda-1)^m$ is a factor of $rho_A(x)$ and so $0$ is the eigenvalue of multiplicity $n-m$.
Thus $$rho_A(x)= (lambda-1)^m (lambda)^n-m$$
then how does option 1 is true?
â Indrajit Ghosh
Sep 9 at 6:43
as it is given $lambda^m-n$ in the option.
â Indrajit Ghosh
Sep 9 at 6:43
I think It 's a typo
â Chinnapparaj R
Sep 9 at 6:44
see also the answer of your provided link in the OP!
â Chinnapparaj R
Sep 9 at 6:44
it is given that option 1 is true in that link....but how ...?? if we assume the question as it is here the it should be false ...!! that is my confusion....
â Indrajit Ghosh
Sep 9 at 6:46
 |Â
show 2 more comments
up vote
2
down vote
accepted
$A$ is diagonalizable iff $textdim(E_lambda i)=textmultiplicity of $lambda_i$ $, for all $i$
By hypothesis, dimension of $N(A-I)=m$ means $textdim(E_1)=m$=multiplicity of $1$
So $(lambda-1)^m$ is a factor of $rho_A(x)$ and so $0$ is the eigenvalue of multiplicity $n-m$.
Thus $$rho_A(x)= (lambda-1)^m (lambda)^n-m$$
then how does option 1 is true?
â Indrajit Ghosh
Sep 9 at 6:43
as it is given $lambda^m-n$ in the option.
â Indrajit Ghosh
Sep 9 at 6:43
I think It 's a typo
â Chinnapparaj R
Sep 9 at 6:44
see also the answer of your provided link in the OP!
â Chinnapparaj R
Sep 9 at 6:44
it is given that option 1 is true in that link....but how ...?? if we assume the question as it is here the it should be false ...!! that is my confusion....
â Indrajit Ghosh
Sep 9 at 6:46
 |Â
show 2 more comments
up vote
2
down vote
accepted
up vote
2
down vote
accepted
$A$ is diagonalizable iff $textdim(E_lambda i)=textmultiplicity of $lambda_i$ $, for all $i$
By hypothesis, dimension of $N(A-I)=m$ means $textdim(E_1)=m$=multiplicity of $1$
So $(lambda-1)^m$ is a factor of $rho_A(x)$ and so $0$ is the eigenvalue of multiplicity $n-m$.
Thus $$rho_A(x)= (lambda-1)^m (lambda)^n-m$$
$A$ is diagonalizable iff $textdim(E_lambda i)=textmultiplicity of $lambda_i$ $, for all $i$
By hypothesis, dimension of $N(A-I)=m$ means $textdim(E_1)=m$=multiplicity of $1$
So $(lambda-1)^m$ is a factor of $rho_A(x)$ and so $0$ is the eigenvalue of multiplicity $n-m$.
Thus $$rho_A(x)= (lambda-1)^m (lambda)^n-m$$
answered Sep 9 at 6:39
Chinnapparaj R
2,161520
2,161520
then how does option 1 is true?
â Indrajit Ghosh
Sep 9 at 6:43
as it is given $lambda^m-n$ in the option.
â Indrajit Ghosh
Sep 9 at 6:43
I think It 's a typo
â Chinnapparaj R
Sep 9 at 6:44
see also the answer of your provided link in the OP!
â Chinnapparaj R
Sep 9 at 6:44
it is given that option 1 is true in that link....but how ...?? if we assume the question as it is here the it should be false ...!! that is my confusion....
â Indrajit Ghosh
Sep 9 at 6:46
 |Â
show 2 more comments
then how does option 1 is true?
â Indrajit Ghosh
Sep 9 at 6:43
as it is given $lambda^m-n$ in the option.
â Indrajit Ghosh
Sep 9 at 6:43
I think It 's a typo
â Chinnapparaj R
Sep 9 at 6:44
see also the answer of your provided link in the OP!
â Chinnapparaj R
Sep 9 at 6:44
it is given that option 1 is true in that link....but how ...?? if we assume the question as it is here the it should be false ...!! that is my confusion....
â Indrajit Ghosh
Sep 9 at 6:46
then how does option 1 is true?
â Indrajit Ghosh
Sep 9 at 6:43
then how does option 1 is true?
â Indrajit Ghosh
Sep 9 at 6:43
as it is given $lambda^m-n$ in the option.
â Indrajit Ghosh
Sep 9 at 6:43
as it is given $lambda^m-n$ in the option.
â Indrajit Ghosh
Sep 9 at 6:43
I think It 's a typo
â Chinnapparaj R
Sep 9 at 6:44
I think It 's a typo
â Chinnapparaj R
Sep 9 at 6:44
see also the answer of your provided link in the OP!
â Chinnapparaj R
Sep 9 at 6:44
see also the answer of your provided link in the OP!
â Chinnapparaj R
Sep 9 at 6:44
it is given that option 1 is true in that link....but how ...?? if we assume the question as it is here the it should be false ...!! that is my confusion....
â Indrajit Ghosh
Sep 9 at 6:46
it is given that option 1 is true in that link....but how ...?? if we assume the question as it is here the it should be false ...!! that is my confusion....
â Indrajit Ghosh
Sep 9 at 6:46
 |Â
show 2 more comments
up vote
0
down vote
$A$ diagonalizes to a diagonal matrix $D$ with only $0$ and $1$ on the diagonal. We know that $$n-m = operatornamerank(A - I) = operatornamerank(D - I) = text number of zeroes on the diagonal of D$$
Hence $D = operatornamediag(underbrace1, ldots, 1_m, underbrace0, ldots, 0_n-m)$ or a permutation thereof, so the characteristic polynomial of $A$ is $$det(A - lambda I) = det(D - lambda I) = det operatornamediag(underbrace1-lambda, ldots, 1-lambda_m, underbrace-lambda, ldots, -lambda_n-m) = (-1)^n (lambda-1)^mlambda^n-m$$
add a comment |Â
up vote
0
down vote
$A$ diagonalizes to a diagonal matrix $D$ with only $0$ and $1$ on the diagonal. We know that $$n-m = operatornamerank(A - I) = operatornamerank(D - I) = text number of zeroes on the diagonal of D$$
Hence $D = operatornamediag(underbrace1, ldots, 1_m, underbrace0, ldots, 0_n-m)$ or a permutation thereof, so the characteristic polynomial of $A$ is $$det(A - lambda I) = det(D - lambda I) = det operatornamediag(underbrace1-lambda, ldots, 1-lambda_m, underbrace-lambda, ldots, -lambda_n-m) = (-1)^n (lambda-1)^mlambda^n-m$$
add a comment |Â
up vote
0
down vote
up vote
0
down vote
$A$ diagonalizes to a diagonal matrix $D$ with only $0$ and $1$ on the diagonal. We know that $$n-m = operatornamerank(A - I) = operatornamerank(D - I) = text number of zeroes on the diagonal of D$$
Hence $D = operatornamediag(underbrace1, ldots, 1_m, underbrace0, ldots, 0_n-m)$ or a permutation thereof, so the characteristic polynomial of $A$ is $$det(A - lambda I) = det(D - lambda I) = det operatornamediag(underbrace1-lambda, ldots, 1-lambda_m, underbrace-lambda, ldots, -lambda_n-m) = (-1)^n (lambda-1)^mlambda^n-m$$
$A$ diagonalizes to a diagonal matrix $D$ with only $0$ and $1$ on the diagonal. We know that $$n-m = operatornamerank(A - I) = operatornamerank(D - I) = text number of zeroes on the diagonal of D$$
Hence $D = operatornamediag(underbrace1, ldots, 1_m, underbrace0, ldots, 0_n-m)$ or a permutation thereof, so the characteristic polynomial of $A$ is $$det(A - lambda I) = det(D - lambda I) = det operatornamediag(underbrace1-lambda, ldots, 1-lambda_m, underbrace-lambda, ldots, -lambda_n-m) = (-1)^n (lambda-1)^mlambda^n-m$$
answered Sep 9 at 7:17
mechanodroid
24.7k62245
24.7k62245
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%2f2910459%2fhow-does-the-characteristics-polynomial-be-lambda-1m-lambdam-n-where%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
Actually the factor of the characteristic polynomial is $lambda^n-m$ not $lambda^m-n$
â Chinnapparaj R
Sep 9 at 6:31
but in option 1 it is given: $lambda^m-n$...!!
â Indrajit Ghosh
Sep 9 at 6:32