If given $A^n = alpha I$ prove $A$ is diagonizable The 2019 Stack Overflow Developer Survey Results Are In Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar ManaraMinimal Polynomial of a scalar multiple of a MatrixProperties of a matrix with the minimal polynomial $m_A(t) = t^3+2t^2+t+1$?What can we conclude from the equality $m_A(x) = m_B(x)$?If $f_A(x) ne m_A(x)$ and $A^3=I$ then $A=I$?Minimal polynomial for an invertible matrix and its determinantLet $A in mathbbM_n(F)$. Every polynomial$(p)$ of degree n such that $p(A)=0$ then how $p$ can be expressed?How do you show that if a block matrix is diagonalizable, then its diagonal entries are diagonalizable?Calculate the determinant of $A-2A^-1$ given the characteristic and minimal polynomials of $A$Prove that $P^-1v$ is an eigenvector of $B$ corresponding to the eigenvalue $lambda$.Condition for linear transformation being invertible
Could an empire control the whole planet with today's comunication methods?
Word for: a synonym with a positive connotation?
What aspect of planet Earth must be changed to prevent the industrial revolution?
Drawing vertical/oblique lines in Metrical tree (tikz-qtree, tipa)
US Healthcare consultation for visitors
Can a flute soloist sit?
Make it rain characters
Loose spokes after only a few rides
Variable with quotation marks "$()"
Is it ethical to upload a automatically generated paper to a non peer-reviewed site as part of a larger research?
Windows 10: How to Lock (not sleep) laptop on lid close?
Why not take a picture of a closer black hole?
Is an up-to-date browser secure on an out-of-date OS?
"... to apply for a visa" or "... and applied for a visa"?
Python - Fishing Simulator
Mortgage adviser recommends a longer term than necessary combined with overpayments
Using dividends to reduce short term capital gains?
Do warforged have souls?
How to determine omitted units in a publication
How to politely respond to generic emails requesting a PhD/job in my lab? Without wasting too much time
How do you keep chess fun when your opponent constantly beats you?
Why don't hard Brexiteers insist on a hard border to prevent illegal immigration after Brexit?
What happens to a Warlock's expended Spell Slots when they gain a Level?
Do I have Disadvantage attacking with an off-hand weapon?
If given $A^n = alpha I$ prove $A$ is diagonizable
The 2019 Stack Overflow Developer Survey Results Are In
Unicorn Meta Zoo #1: Why another podcast?
Announcing the arrival of Valued Associate #679: Cesar ManaraMinimal Polynomial of a scalar multiple of a MatrixProperties of a matrix with the minimal polynomial $m_A(t) = t^3+2t^2+t+1$?What can we conclude from the equality $m_A(x) = m_B(x)$?If $f_A(x) ne m_A(x)$ and $A^3=I$ then $A=I$?Minimal polynomial for an invertible matrix and its determinantLet $A in mathbbM_n(F)$. Every polynomial$(p)$ of degree n such that $p(A)=0$ then how $p$ can be expressed?How do you show that if a block matrix is diagonalizable, then its diagonal entries are diagonalizable?Calculate the determinant of $A-2A^-1$ given the characteristic and minimal polynomials of $A$Prove that $P^-1v$ is an eigenvector of $B$ corresponding to the eigenvalue $lambda$.Condition for linear transformation being invertible
$begingroup$
Given matrix $ A inM_n(mathbbC), 0nealphainmathbbC$ such that $A^n = alpha I$ prove that $A$ is diagonizable.
I've tried proving that the minimal polynomial($m_A$) splits into linear polynomials therefore proving that $A$ is diagonizable but haven't had great success with that.
I've also found that $|A| = alpha$ even though that didn't really give me a good starting place.
How can I prove that $A$ is diagonizable?
linear-algebra matrices diagonalization
$endgroup$
add a comment |
$begingroup$
Given matrix $ A inM_n(mathbbC), 0nealphainmathbbC$ such that $A^n = alpha I$ prove that $A$ is diagonizable.
I've tried proving that the minimal polynomial($m_A$) splits into linear polynomials therefore proving that $A$ is diagonizable but haven't had great success with that.
I've also found that $|A| = alpha$ even though that didn't really give me a good starting place.
How can I prove that $A$ is diagonizable?
linear-algebra matrices diagonalization
$endgroup$
1
$begingroup$
Are you allowed to use Jordan normal form? If yes - just note that all eigenvalues are non-zero, and power of Jordan block with non-zero value and size greater then $1$ is non-diagonizable.
$endgroup$
– mihaild
yesterday
1
$begingroup$
I haven't learned the Jordan form yet, sorry
$endgroup$
– Guysudai1
yesterday
add a comment |
$begingroup$
Given matrix $ A inM_n(mathbbC), 0nealphainmathbbC$ such that $A^n = alpha I$ prove that $A$ is diagonizable.
I've tried proving that the minimal polynomial($m_A$) splits into linear polynomials therefore proving that $A$ is diagonizable but haven't had great success with that.
I've also found that $|A| = alpha$ even though that didn't really give me a good starting place.
How can I prove that $A$ is diagonizable?
linear-algebra matrices diagonalization
$endgroup$
Given matrix $ A inM_n(mathbbC), 0nealphainmathbbC$ such that $A^n = alpha I$ prove that $A$ is diagonizable.
I've tried proving that the minimal polynomial($m_A$) splits into linear polynomials therefore proving that $A$ is diagonizable but haven't had great success with that.
I've also found that $|A| = alpha$ even though that didn't really give me a good starting place.
How can I prove that $A$ is diagonizable?
linear-algebra matrices diagonalization
linear-algebra matrices diagonalization
edited yesterday
YuiTo Cheng
2,4064937
2,4064937
asked yesterday
Guysudai1Guysudai1
296111
296111
1
$begingroup$
Are you allowed to use Jordan normal form? If yes - just note that all eigenvalues are non-zero, and power of Jordan block with non-zero value and size greater then $1$ is non-diagonizable.
$endgroup$
– mihaild
yesterday
1
$begingroup$
I haven't learned the Jordan form yet, sorry
$endgroup$
– Guysudai1
yesterday
add a comment |
1
$begingroup$
Are you allowed to use Jordan normal form? If yes - just note that all eigenvalues are non-zero, and power of Jordan block with non-zero value and size greater then $1$ is non-diagonizable.
$endgroup$
– mihaild
yesterday
1
$begingroup$
I haven't learned the Jordan form yet, sorry
$endgroup$
– Guysudai1
yesterday
1
1
$begingroup$
Are you allowed to use Jordan normal form? If yes - just note that all eigenvalues are non-zero, and power of Jordan block with non-zero value and size greater then $1$ is non-diagonizable.
$endgroup$
– mihaild
yesterday
$begingroup$
Are you allowed to use Jordan normal form? If yes - just note that all eigenvalues are non-zero, and power of Jordan block with non-zero value and size greater then $1$ is non-diagonizable.
$endgroup$
– mihaild
yesterday
1
1
$begingroup$
I haven't learned the Jordan form yet, sorry
$endgroup$
– Guysudai1
yesterday
$begingroup$
I haven't learned the Jordan form yet, sorry
$endgroup$
– Guysudai1
yesterday
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Small remark: Over $mathbbC$, every polynomial splits into linear factors, so that doesn't help here. The matrix is diagonizable if and only if the minimal polynomial splits in pairwise different linear factors, so it splits and is square free.
Now for your problem: We see directly by looking at the degree that the characteristic polynomial is $x^n-alpha$. Thus, the minimal polynomial is a divisor of that one. Show that this polynomial is square free, then also the minimal polynomial, a divisor of the characteristic polynomial, will be square free and you are done.
$endgroup$
2
$begingroup$
(+1) Your answer is better than mine.
$endgroup$
– José Carlos Santos
yesterday
add a comment |
$begingroup$
If $A^n=alphaoperatornameId$, with $alphaneq0$, then $0$ is not an eigenvalue of $A$. Suppose that $A$ is not diagonalizable. Then some block of the Jordan normal form of $A$ is of the type$$beginbmatrixlambda&1&0&0&ldots&0\0&lambda&1&0&ldots&0\0&0&lambda&1&ldots&0\vdots&vdots&vdots&vdots&ddots&vdots\0&0&0&0&cdots&lambdaendbmatrix,$$with $lambdaneq0$. But no power of such a matrix is diagonlizable.
$endgroup$
add a comment |
$begingroup$
Hint: the essential fact is that eigenvectors corresponding to different eigenvalues are linearly independent. In this case, we have a basis of the space composed of eigenvectors...
$endgroup$
add a comment |
Your Answer
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%2f3183481%2fif-given-an-alpha-i-prove-a-is-diagonizable%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Small remark: Over $mathbbC$, every polynomial splits into linear factors, so that doesn't help here. The matrix is diagonizable if and only if the minimal polynomial splits in pairwise different linear factors, so it splits and is square free.
Now for your problem: We see directly by looking at the degree that the characteristic polynomial is $x^n-alpha$. Thus, the minimal polynomial is a divisor of that one. Show that this polynomial is square free, then also the minimal polynomial, a divisor of the characteristic polynomial, will be square free and you are done.
$endgroup$
2
$begingroup$
(+1) Your answer is better than mine.
$endgroup$
– José Carlos Santos
yesterday
add a comment |
$begingroup$
Small remark: Over $mathbbC$, every polynomial splits into linear factors, so that doesn't help here. The matrix is diagonizable if and only if the minimal polynomial splits in pairwise different linear factors, so it splits and is square free.
Now for your problem: We see directly by looking at the degree that the characteristic polynomial is $x^n-alpha$. Thus, the minimal polynomial is a divisor of that one. Show that this polynomial is square free, then also the minimal polynomial, a divisor of the characteristic polynomial, will be square free and you are done.
$endgroup$
2
$begingroup$
(+1) Your answer is better than mine.
$endgroup$
– José Carlos Santos
yesterday
add a comment |
$begingroup$
Small remark: Over $mathbbC$, every polynomial splits into linear factors, so that doesn't help here. The matrix is diagonizable if and only if the minimal polynomial splits in pairwise different linear factors, so it splits and is square free.
Now for your problem: We see directly by looking at the degree that the characteristic polynomial is $x^n-alpha$. Thus, the minimal polynomial is a divisor of that one. Show that this polynomial is square free, then also the minimal polynomial, a divisor of the characteristic polynomial, will be square free and you are done.
$endgroup$
Small remark: Over $mathbbC$, every polynomial splits into linear factors, so that doesn't help here. The matrix is diagonizable if and only if the minimal polynomial splits in pairwise different linear factors, so it splits and is square free.
Now for your problem: We see directly by looking at the degree that the characteristic polynomial is $x^n-alpha$. Thus, the minimal polynomial is a divisor of that one. Show that this polynomial is square free, then also the minimal polynomial, a divisor of the characteristic polynomial, will be square free and you are done.
answered yesterday
DirkDirk
4,658219
4,658219
2
$begingroup$
(+1) Your answer is better than mine.
$endgroup$
– José Carlos Santos
yesterday
add a comment |
2
$begingroup$
(+1) Your answer is better than mine.
$endgroup$
– José Carlos Santos
yesterday
2
2
$begingroup$
(+1) Your answer is better than mine.
$endgroup$
– José Carlos Santos
yesterday
$begingroup$
(+1) Your answer is better than mine.
$endgroup$
– José Carlos Santos
yesterday
add a comment |
$begingroup$
If $A^n=alphaoperatornameId$, with $alphaneq0$, then $0$ is not an eigenvalue of $A$. Suppose that $A$ is not diagonalizable. Then some block of the Jordan normal form of $A$ is of the type$$beginbmatrixlambda&1&0&0&ldots&0\0&lambda&1&0&ldots&0\0&0&lambda&1&ldots&0\vdots&vdots&vdots&vdots&ddots&vdots\0&0&0&0&cdots&lambdaendbmatrix,$$with $lambdaneq0$. But no power of such a matrix is diagonlizable.
$endgroup$
add a comment |
$begingroup$
If $A^n=alphaoperatornameId$, with $alphaneq0$, then $0$ is not an eigenvalue of $A$. Suppose that $A$ is not diagonalizable. Then some block of the Jordan normal form of $A$ is of the type$$beginbmatrixlambda&1&0&0&ldots&0\0&lambda&1&0&ldots&0\0&0&lambda&1&ldots&0\vdots&vdots&vdots&vdots&ddots&vdots\0&0&0&0&cdots&lambdaendbmatrix,$$with $lambdaneq0$. But no power of such a matrix is diagonlizable.
$endgroup$
add a comment |
$begingroup$
If $A^n=alphaoperatornameId$, with $alphaneq0$, then $0$ is not an eigenvalue of $A$. Suppose that $A$ is not diagonalizable. Then some block of the Jordan normal form of $A$ is of the type$$beginbmatrixlambda&1&0&0&ldots&0\0&lambda&1&0&ldots&0\0&0&lambda&1&ldots&0\vdots&vdots&vdots&vdots&ddots&vdots\0&0&0&0&cdots&lambdaendbmatrix,$$with $lambdaneq0$. But no power of such a matrix is diagonlizable.
$endgroup$
If $A^n=alphaoperatornameId$, with $alphaneq0$, then $0$ is not an eigenvalue of $A$. Suppose that $A$ is not diagonalizable. Then some block of the Jordan normal form of $A$ is of the type$$beginbmatrixlambda&1&0&0&ldots&0\0&lambda&1&0&ldots&0\0&0&lambda&1&ldots&0\vdots&vdots&vdots&vdots&ddots&vdots\0&0&0&0&cdots&lambdaendbmatrix,$$with $lambdaneq0$. But no power of such a matrix is diagonlizable.
edited yesterday
answered yesterday
José Carlos SantosJosé Carlos Santos
174k23133243
174k23133243
add a comment |
add a comment |
$begingroup$
Hint: the essential fact is that eigenvectors corresponding to different eigenvalues are linearly independent. In this case, we have a basis of the space composed of eigenvectors...
$endgroup$
add a comment |
$begingroup$
Hint: the essential fact is that eigenvectors corresponding to different eigenvalues are linearly independent. In this case, we have a basis of the space composed of eigenvectors...
$endgroup$
add a comment |
$begingroup$
Hint: the essential fact is that eigenvectors corresponding to different eigenvalues are linearly independent. In this case, we have a basis of the space composed of eigenvectors...
$endgroup$
Hint: the essential fact is that eigenvectors corresponding to different eigenvalues are linearly independent. In this case, we have a basis of the space composed of eigenvectors...
answered yesterday
Martín-Blas Pérez PinillaMartín-Blas Pérez Pinilla
35.5k42972
35.5k42972
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.
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%2f3183481%2fif-given-an-alpha-i-prove-a-is-diagonizable%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
-diagonalization, linear-algebra, matrices
1
$begingroup$
Are you allowed to use Jordan normal form? If yes - just note that all eigenvalues are non-zero, and power of Jordan block with non-zero value and size greater then $1$ is non-diagonizable.
$endgroup$
– mihaild
yesterday
1
$begingroup$
I haven't learned the Jordan form yet, sorry
$endgroup$
– Guysudai1
yesterday