Prove $ AA^t $ is diagonalizable
Clash Royale CLAN TAG#URR8PPP
up vote
3
down vote
favorite
Let $ A $ be a real matrix. Prove that $ A cdot A^t $ is diagonaziable.
This is the only info given. Now I understand that $ A cdot A^t $ is a symmetric matrix because
$ [AA^t]_ij = [A]_i^r cdot [A^t]_j^c = [A]^r_i cdot [A]^r_j = [A^t]_i^c cdot [A]^r_j = [A]_j^r cdot [A^t]_i^c = [AA^t]_ji $
and I found this document where it says symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
Thanks
linear-algebra
add a comment |Â
up vote
3
down vote
favorite
Let $ A $ be a real matrix. Prove that $ A cdot A^t $ is diagonaziable.
This is the only info given. Now I understand that $ A cdot A^t $ is a symmetric matrix because
$ [AA^t]_ij = [A]_i^r cdot [A^t]_j^c = [A]^r_i cdot [A]^r_j = [A^t]_i^c cdot [A]^r_j = [A]_j^r cdot [A^t]_i^c = [AA^t]_ji $
and I found this document where it says symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
Thanks
linear-algebra
2
In the same document : "There exists a set of n eigenvectors, one for each eigenvalue, that are mututally orthogonal"
â Max
Aug 28 at 15:48
Thanks it is just that no proof there..
â bm1125
Aug 28 at 15:51
add a comment |Â
up vote
3
down vote
favorite
up vote
3
down vote
favorite
Let $ A $ be a real matrix. Prove that $ A cdot A^t $ is diagonaziable.
This is the only info given. Now I understand that $ A cdot A^t $ is a symmetric matrix because
$ [AA^t]_ij = [A]_i^r cdot [A^t]_j^c = [A]^r_i cdot [A]^r_j = [A^t]_i^c cdot [A]^r_j = [A]_j^r cdot [A^t]_i^c = [AA^t]_ji $
and I found this document where it says symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
Thanks
linear-algebra
Let $ A $ be a real matrix. Prove that $ A cdot A^t $ is diagonaziable.
This is the only info given. Now I understand that $ A cdot A^t $ is a symmetric matrix because
$ [AA^t]_ij = [A]_i^r cdot [A^t]_j^c = [A]^r_i cdot [A]^r_j = [A^t]_i^c cdot [A]^r_j = [A]_j^r cdot [A^t]_i^c = [AA^t]_ji $
and I found this document where it says symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
Thanks
linear-algebra
asked Aug 28 at 15:46
bm1125
38016
38016
2
In the same document : "There exists a set of n eigenvectors, one for each eigenvalue, that are mututally orthogonal"
â Max
Aug 28 at 15:48
Thanks it is just that no proof there..
â bm1125
Aug 28 at 15:51
add a comment |Â
2
In the same document : "There exists a set of n eigenvectors, one for each eigenvalue, that are mututally orthogonal"
â Max
Aug 28 at 15:48
Thanks it is just that no proof there..
â bm1125
Aug 28 at 15:51
2
2
In the same document : "There exists a set of n eigenvectors, one for each eigenvalue, that are mututally orthogonal"
â Max
Aug 28 at 15:48
In the same document : "There exists a set of n eigenvectors, one for each eigenvalue, that are mututally orthogonal"
â Max
Aug 28 at 15:48
Thanks it is just that no proof there..
â bm1125
Aug 28 at 15:51
Thanks it is just that no proof there..
â bm1125
Aug 28 at 15:51
add a comment |Â
5 Answers
5
active
oldest
votes
up vote
2
down vote
accepted
$A.A^t$ being symmetric, it is diagonalizable in an orthonormal basis (spectral theorem). That is, the eigenvectors are orthogonal (and can be normalized to 1). In other words, $$A.A^t=P^t.D.P$$
where $D$ is diagonal and $P$ verifies $$P^t.P=I$$
Here $I$ is the identity. So $P^t=P^-1$.
add a comment |Â
up vote
3
down vote
It is not automatic. The fact that a symmetric matrix $B$ is diagonalizable depends on two facts:
all eigenvalues of $B$ are real
the orthogonal of an eigenspace is invariant by $B$
Then you start with an eigenvalue and a one-dimensional eigenspace, and then the orthogonoal of said eigenspace is invariant, and now you can again find an eigenvalue and a one-dimensional eigenspace. The process continues until you exhaust the $n$ dimensions.
What the above achieves is that you obtain a basis of eigenvectors, which is precisely what diagonalization is. Actually, you can obtain an orthonormal basis of eigenvectors, which tells you that you can diagonalize $B$ using a unitary (i.e., an orthogonal matrix in this case).
add a comment |Â
up vote
2
down vote
Recall that a symmetric matrix is always diagonalizable by spectral theorem.
add a comment |Â
up vote
2
down vote
$(AB)^T=B^TA^T$. $therefore (AA^T)^T=(A^T)^TA^T=AA^T$
Thus $AA^T$ is symmetric. And symmetric matrices are diagonalizable.
add a comment |Â
up vote
1
down vote
symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
"$n$ eigenvalues (not necessarily distinct)" or, as I like to call it, "$n$ eigenvalues if counted with geometric multiplicity", means exactly that there is some basis of $Bbb R^n$ for which the linear map associated with $AA^t$ is diagonal: it's any linearly independent collection of $n$ eigenvectors, which the part "$n$ eigenvalues (not necessarily distinct)" tells us exists.
add a comment |Â
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
$A.A^t$ being symmetric, it is diagonalizable in an orthonormal basis (spectral theorem). That is, the eigenvectors are orthogonal (and can be normalized to 1). In other words, $$A.A^t=P^t.D.P$$
where $D$ is diagonal and $P$ verifies $$P^t.P=I$$
Here $I$ is the identity. So $P^t=P^-1$.
add a comment |Â
up vote
2
down vote
accepted
$A.A^t$ being symmetric, it is diagonalizable in an orthonormal basis (spectral theorem). That is, the eigenvectors are orthogonal (and can be normalized to 1). In other words, $$A.A^t=P^t.D.P$$
where $D$ is diagonal and $P$ verifies $$P^t.P=I$$
Here $I$ is the identity. So $P^t=P^-1$.
add a comment |Â
up vote
2
down vote
accepted
up vote
2
down vote
accepted
$A.A^t$ being symmetric, it is diagonalizable in an orthonormal basis (spectral theorem). That is, the eigenvectors are orthogonal (and can be normalized to 1). In other words, $$A.A^t=P^t.D.P$$
where $D$ is diagonal and $P$ verifies $$P^t.P=I$$
Here $I$ is the identity. So $P^t=P^-1$.
$A.A^t$ being symmetric, it is diagonalizable in an orthonormal basis (spectral theorem). That is, the eigenvectors are orthogonal (and can be normalized to 1). In other words, $$A.A^t=P^t.D.P$$
where $D$ is diagonal and $P$ verifies $$P^t.P=I$$
Here $I$ is the identity. So $P^t=P^-1$.
answered Aug 28 at 15:54
Stefan Lafon
1864
1864
add a comment |Â
add a comment |Â
up vote
3
down vote
It is not automatic. The fact that a symmetric matrix $B$ is diagonalizable depends on two facts:
all eigenvalues of $B$ are real
the orthogonal of an eigenspace is invariant by $B$
Then you start with an eigenvalue and a one-dimensional eigenspace, and then the orthogonoal of said eigenspace is invariant, and now you can again find an eigenvalue and a one-dimensional eigenspace. The process continues until you exhaust the $n$ dimensions.
What the above achieves is that you obtain a basis of eigenvectors, which is precisely what diagonalization is. Actually, you can obtain an orthonormal basis of eigenvectors, which tells you that you can diagonalize $B$ using a unitary (i.e., an orthogonal matrix in this case).
add a comment |Â
up vote
3
down vote
It is not automatic. The fact that a symmetric matrix $B$ is diagonalizable depends on two facts:
all eigenvalues of $B$ are real
the orthogonal of an eigenspace is invariant by $B$
Then you start with an eigenvalue and a one-dimensional eigenspace, and then the orthogonoal of said eigenspace is invariant, and now you can again find an eigenvalue and a one-dimensional eigenspace. The process continues until you exhaust the $n$ dimensions.
What the above achieves is that you obtain a basis of eigenvectors, which is precisely what diagonalization is. Actually, you can obtain an orthonormal basis of eigenvectors, which tells you that you can diagonalize $B$ using a unitary (i.e., an orthogonal matrix in this case).
add a comment |Â
up vote
3
down vote
up vote
3
down vote
It is not automatic. The fact that a symmetric matrix $B$ is diagonalizable depends on two facts:
all eigenvalues of $B$ are real
the orthogonal of an eigenspace is invariant by $B$
Then you start with an eigenvalue and a one-dimensional eigenspace, and then the orthogonoal of said eigenspace is invariant, and now you can again find an eigenvalue and a one-dimensional eigenspace. The process continues until you exhaust the $n$ dimensions.
What the above achieves is that you obtain a basis of eigenvectors, which is precisely what diagonalization is. Actually, you can obtain an orthonormal basis of eigenvectors, which tells you that you can diagonalize $B$ using a unitary (i.e., an orthogonal matrix in this case).
It is not automatic. The fact that a symmetric matrix $B$ is diagonalizable depends on two facts:
all eigenvalues of $B$ are real
the orthogonal of an eigenspace is invariant by $B$
Then you start with an eigenvalue and a one-dimensional eigenspace, and then the orthogonoal of said eigenspace is invariant, and now you can again find an eigenvalue and a one-dimensional eigenspace. The process continues until you exhaust the $n$ dimensions.
What the above achieves is that you obtain a basis of eigenvectors, which is precisely what diagonalization is. Actually, you can obtain an orthonormal basis of eigenvectors, which tells you that you can diagonalize $B$ using a unitary (i.e., an orthogonal matrix in this case).
edited Aug 28 at 16:12
answered Aug 28 at 15:54
Martin Argerami
117k1071165
117k1071165
add a comment |Â
add a comment |Â
up vote
2
down vote
Recall that a symmetric matrix is always diagonalizable by spectral theorem.
add a comment |Â
up vote
2
down vote
Recall that a symmetric matrix is always diagonalizable by spectral theorem.
add a comment |Â
up vote
2
down vote
up vote
2
down vote
Recall that a symmetric matrix is always diagonalizable by spectral theorem.
Recall that a symmetric matrix is always diagonalizable by spectral theorem.
answered Aug 28 at 15:49
gimusi
71k73786
71k73786
add a comment |Â
add a comment |Â
up vote
2
down vote
$(AB)^T=B^TA^T$. $therefore (AA^T)^T=(A^T)^TA^T=AA^T$
Thus $AA^T$ is symmetric. And symmetric matrices are diagonalizable.
add a comment |Â
up vote
2
down vote
$(AB)^T=B^TA^T$. $therefore (AA^T)^T=(A^T)^TA^T=AA^T$
Thus $AA^T$ is symmetric. And symmetric matrices are diagonalizable.
add a comment |Â
up vote
2
down vote
up vote
2
down vote
$(AB)^T=B^TA^T$. $therefore (AA^T)^T=(A^T)^TA^T=AA^T$
Thus $AA^T$ is symmetric. And symmetric matrices are diagonalizable.
$(AB)^T=B^TA^T$. $therefore (AA^T)^T=(A^T)^TA^T=AA^T$
Thus $AA^T$ is symmetric. And symmetric matrices are diagonalizable.
answered Aug 28 at 16:01
Chris Custer
6,3162622
6,3162622
add a comment |Â
add a comment |Â
up vote
1
down vote
symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
"$n$ eigenvalues (not necessarily distinct)" or, as I like to call it, "$n$ eigenvalues if counted with geometric multiplicity", means exactly that there is some basis of $Bbb R^n$ for which the linear map associated with $AA^t$ is diagonal: it's any linearly independent collection of $n$ eigenvectors, which the part "$n$ eigenvalues (not necessarily distinct)" tells us exists.
add a comment |Â
up vote
1
down vote
symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
"$n$ eigenvalues (not necessarily distinct)" or, as I like to call it, "$n$ eigenvalues if counted with geometric multiplicity", means exactly that there is some basis of $Bbb R^n$ for which the linear map associated with $AA^t$ is diagonal: it's any linearly independent collection of $n$ eigenvectors, which the part "$n$ eigenvalues (not necessarily distinct)" tells us exists.
add a comment |Â
up vote
1
down vote
up vote
1
down vote
symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
"$n$ eigenvalues (not necessarily distinct)" or, as I like to call it, "$n$ eigenvalues if counted with geometric multiplicity", means exactly that there is some basis of $Bbb R^n$ for which the linear map associated with $AA^t$ is diagonal: it's any linearly independent collection of $n$ eigenvectors, which the part "$n$ eigenvalues (not necessarily distinct)" tells us exists.
symmetric matrices has $ n$ eigenvalues (not necessarily distinct) but how can I know if there is an invertible matrix $ P $ that diagonalize $ A $ ?
"$n$ eigenvalues (not necessarily distinct)" or, as I like to call it, "$n$ eigenvalues if counted with geometric multiplicity", means exactly that there is some basis of $Bbb R^n$ for which the linear map associated with $AA^t$ is diagonal: it's any linearly independent collection of $n$ eigenvectors, which the part "$n$ eigenvalues (not necessarily distinct)" tells us exists.
answered Aug 28 at 15:53
Arthur
101k795176
101k795176
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%2f2897418%2fprove-aat-is-diagonalizable%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
2
In the same document : "There exists a set of n eigenvectors, one for each eigenvalue, that are mututally orthogonal"
â Max
Aug 28 at 15:48
Thanks it is just that no proof there..
â bm1125
Aug 28 at 15:51