Prove that any complex $3times 3$ matrix is similar to a given form via a $3times 3$ unitary matrix.
Show that for any given $3times 3$ complex matrix $A$, there exist a $3 times 3$ unitary matrix $U$, such that
$$U^{-1}AU=
begin{pmatrix}
* & 0 & * \
* & * & 0 \
* & 0 & * \
end{pmatrix}
$$
It is a question in the Chinese Ph.d Entrance Exam, I think it is unusual because I never thought this kind of form before and don't know how to get start. If we replace the unitary with invertible, then the question is already solved by the answer which PSG give. But I am quite sure Jordan is not necessary with unitary.
I have an idea that we can use some $2times 2$ unitary matrix to adjust the first principal submatrix of $A$ in order to make the second principal submatrix of $A$ into a normal matrix by changing the center entry of $A$ and then we diagonalize the second principal submatrix of $A$ and apply Schur Lemma on the first principal submatrix of $A$ to make $A$ into the form that we want.
matrices
add a comment |
Show that for any given $3times 3$ complex matrix $A$, there exist a $3 times 3$ unitary matrix $U$, such that
$$U^{-1}AU=
begin{pmatrix}
* & 0 & * \
* & * & 0 \
* & 0 & * \
end{pmatrix}
$$
It is a question in the Chinese Ph.d Entrance Exam, I think it is unusual because I never thought this kind of form before and don't know how to get start. If we replace the unitary with invertible, then the question is already solved by the answer which PSG give. But I am quite sure Jordan is not necessary with unitary.
I have an idea that we can use some $2times 2$ unitary matrix to adjust the first principal submatrix of $A$ in order to make the second principal submatrix of $A$ into a normal matrix by changing the center entry of $A$ and then we diagonalize the second principal submatrix of $A$ and apply Schur Lemma on the first principal submatrix of $A$ to make $A$ into the form that we want.
matrices
add a comment |
Show that for any given $3times 3$ complex matrix $A$, there exist a $3 times 3$ unitary matrix $U$, such that
$$U^{-1}AU=
begin{pmatrix}
* & 0 & * \
* & * & 0 \
* & 0 & * \
end{pmatrix}
$$
It is a question in the Chinese Ph.d Entrance Exam, I think it is unusual because I never thought this kind of form before and don't know how to get start. If we replace the unitary with invertible, then the question is already solved by the answer which PSG give. But I am quite sure Jordan is not necessary with unitary.
I have an idea that we can use some $2times 2$ unitary matrix to adjust the first principal submatrix of $A$ in order to make the second principal submatrix of $A$ into a normal matrix by changing the center entry of $A$ and then we diagonalize the second principal submatrix of $A$ and apply Schur Lemma on the first principal submatrix of $A$ to make $A$ into the form that we want.
matrices
Show that for any given $3times 3$ complex matrix $A$, there exist a $3 times 3$ unitary matrix $U$, such that
$$U^{-1}AU=
begin{pmatrix}
* & 0 & * \
* & * & 0 \
* & 0 & * \
end{pmatrix}
$$
It is a question in the Chinese Ph.d Entrance Exam, I think it is unusual because I never thought this kind of form before and don't know how to get start. If we replace the unitary with invertible, then the question is already solved by the answer which PSG give. But I am quite sure Jordan is not necessary with unitary.
I have an idea that we can use some $2times 2$ unitary matrix to adjust the first principal submatrix of $A$ in order to make the second principal submatrix of $A$ into a normal matrix by changing the center entry of $A$ and then we diagonalize the second principal submatrix of $A$ and apply Schur Lemma on the first principal submatrix of $A$ to make $A$ into the form that we want.
matrices
matrices
edited Dec 6 '18 at 15:01
Lau
asked Dec 5 '18 at 3:09
LauLau
541315
541315
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
Let $U=pmatrix{u&v&w}$. The statements that $U$ is unitary and $U^{-1}AU$ has the zero pattern in question mean that ${u,v,w}$ is an orthonormal basis of $mathbb C^3$, $v$ is an eigenvector of $A$ and $Awperp v$ (or equivalently, $wperp A^ast v$).
Since $A$ is a complex square matrix, it always has a unit eigenvector $v$. Let $V=operatorname{span}{v}$. As $V^perp$ is two-dimensional and the orthogonal projection of $operatorname{span}{A^ast v}$ on $V^perp$ is at most one-dimensional, there always exists some nonzero vector $win V^perp$ that is orthogonal to $A^ast v$. Normalise $w$ and extend ${v,w}$ into an orthonormal basis ${u,v,w}$. Take $U=pmatrix{u&v&w}$ and you are done.
I think it should be $w perp A^{T}overline{v}$ because $v^{T}Aw=0$ is equivalent to the inner product of $w$ and $A^{T}overline{v}$ is zero.
– Lau
Dec 8 '18 at 8:34
1
@Lau Huh? No, the usual inner product between two vectors $x,yinmathbb C^n$ is defined by $langle x,yrangle=y^ast x$, not by $y^Tx$. The latter is not an inner product: $x^Tx$ can be zero for some nonzero $x$ (such as $x^T=(1,i)$).
– user1551
Dec 8 '18 at 9:09
oh sorry It seems that I mixed something up. Thank you very much.
– Lau
Dec 8 '18 at 10:58
add a comment |
$textbf{Case 1:}$ The characteristic polynomial is $(x-alpha)(x-beta)(x-gamma)$, where $alpha,beta$ and $gamma$ are distinct. $A$ is diagonalisable.
$textbf{Case 2:}$ The characteristic polynomial is $(x-alpha)^2(x-gamma)$, where $alpha$ and $gamma$ are distinct. If the minimal polynomial is $(x-alpha)(x-gamma)$, $A$ is diagonalisable and if the minimal polynomial is $(x-alpha)^2(x-gamma)$, $A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&gammaend{pmatrix}$
$textbf{Case 3:}$ The characteristic polynomial is $(x-alpha)^3$, if the minimal polynomial is $(x-alpha)$, $A$ is diagonalisable, if the minimal polynomial is $(x-alpha)^2$,$A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&alphaend{pmatrix}$ and if the minimal polynomial is $(x-alpha)^3$, $A$ has a cyclic vector say $v$ [i.e. ${v,Av, A^2 v}$ forms a basis]. Then with respect to this basis: ,$A$ has form $begin{pmatrix}0&0&*\1&0&*\0&1&*end{pmatrix}simbegin{pmatrix}*&0&0\*&1&0\*&0&1end{pmatrix} $
1
It is a $3times 3$ complex matrix, not real. Additionally, while a matrix is similar to Jordan form, it is not necessarily similar via a unitary matrix.
– Aaron
Dec 5 '18 at 6:07
ohh..sorry, will edit soon
– PSG
Dec 5 '18 at 6:08
Aaron, true. But two matrices are similar meaning , they are just written in terms of two different bases.Let's say the Jordon form is written w.r.t some basis, If we orthonormalize the basis, and write the matrix in the new basis, the $0$ entries will still remain $0$, I guess.
– PSG
Dec 5 '18 at 6:42
How can orthonormalization of the basis preserve 0 entries?
– Lau
Dec 5 '18 at 12:15
1
Let ${v_1,v_2,..., v_n}$ be the basis. Now say $Av_i=sum_{j=1}^{n}c_j v_jRightarrow Afrac{v_i}{||v_i||}=sum_{j=1}^{n} c_jfrac{v_j}{||v_i||}= sum_{j=1}^{n} c_jfrac{v_j}{||v_j||} times frac{||v_j||}{||v_i||}$, if some coefficient was $0$, it will remain $0$
– PSG
Dec 5 '18 at 12:27
|
show 2 more comments
I will expand on PSG's case 3.
First, by permutations of last 2 rows and cols we can search for form
$$
begin{pmatrix}
*&*&0\
*&*&0\
*&0&*\
end{pmatrix}
$$
Jordan chain of vectors $V=(v_1, v_2, v_3)$ gives us the following form:
$$
V^TAV=begin{pmatrix}
lambda&0&0\
1&lambda&0\
0&1&lambda\
end{pmatrix}
$$
When we apply standard orthonormalization we will obtain orthonormal basis $V'=(v_1', v_2', v_3')$:
$$
V'^TAV'=begin{pmatrix}
lambda&0&0\
a_0&lambda&0\
b_0&c_0&lambda\
end{pmatrix}
$$
Notably, we can always choose phases of our basis (by multiplying by right $e^{iphi}$), so all $b_0$ and $c_0$ are real.
Now we want to rotate basis $V'$ around $v'_3$ by angle $theta$, obtaining new orthonomal basis $U(theta)$:
$$
U(theta)^TAU(theta)=begin{pmatrix}
lambda_1(theta)&a'(theta)&0\
a(theta)&lambda_2(theta)&0\
b(theta)&c(theta)&lambda\
end{pmatrix}
$$
Particularly, $c(theta)=c_0costheta-b_0sintheta$. It means there is such $theta$, that $c(theta)=0$.
Why the basis is still orthonomal after we rotate $v'_3$?
– Lau
Dec 7 '18 at 0:32
We rotate around $v'_3$. Rotations keep angles between vectors.
– Vasily Mitch
Dec 7 '18 at 12:32
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3026551%2fprove-that-any-complex-3-times-3-matrix-is-similar-to-a-given-form-via-a-3-ti%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
Let $U=pmatrix{u&v&w}$. The statements that $U$ is unitary and $U^{-1}AU$ has the zero pattern in question mean that ${u,v,w}$ is an orthonormal basis of $mathbb C^3$, $v$ is an eigenvector of $A$ and $Awperp v$ (or equivalently, $wperp A^ast v$).
Since $A$ is a complex square matrix, it always has a unit eigenvector $v$. Let $V=operatorname{span}{v}$. As $V^perp$ is two-dimensional and the orthogonal projection of $operatorname{span}{A^ast v}$ on $V^perp$ is at most one-dimensional, there always exists some nonzero vector $win V^perp$ that is orthogonal to $A^ast v$. Normalise $w$ and extend ${v,w}$ into an orthonormal basis ${u,v,w}$. Take $U=pmatrix{u&v&w}$ and you are done.
I think it should be $w perp A^{T}overline{v}$ because $v^{T}Aw=0$ is equivalent to the inner product of $w$ and $A^{T}overline{v}$ is zero.
– Lau
Dec 8 '18 at 8:34
1
@Lau Huh? No, the usual inner product between two vectors $x,yinmathbb C^n$ is defined by $langle x,yrangle=y^ast x$, not by $y^Tx$. The latter is not an inner product: $x^Tx$ can be zero for some nonzero $x$ (such as $x^T=(1,i)$).
– user1551
Dec 8 '18 at 9:09
oh sorry It seems that I mixed something up. Thank you very much.
– Lau
Dec 8 '18 at 10:58
add a comment |
Let $U=pmatrix{u&v&w}$. The statements that $U$ is unitary and $U^{-1}AU$ has the zero pattern in question mean that ${u,v,w}$ is an orthonormal basis of $mathbb C^3$, $v$ is an eigenvector of $A$ and $Awperp v$ (or equivalently, $wperp A^ast v$).
Since $A$ is a complex square matrix, it always has a unit eigenvector $v$. Let $V=operatorname{span}{v}$. As $V^perp$ is two-dimensional and the orthogonal projection of $operatorname{span}{A^ast v}$ on $V^perp$ is at most one-dimensional, there always exists some nonzero vector $win V^perp$ that is orthogonal to $A^ast v$. Normalise $w$ and extend ${v,w}$ into an orthonormal basis ${u,v,w}$. Take $U=pmatrix{u&v&w}$ and you are done.
I think it should be $w perp A^{T}overline{v}$ because $v^{T}Aw=0$ is equivalent to the inner product of $w$ and $A^{T}overline{v}$ is zero.
– Lau
Dec 8 '18 at 8:34
1
@Lau Huh? No, the usual inner product between two vectors $x,yinmathbb C^n$ is defined by $langle x,yrangle=y^ast x$, not by $y^Tx$. The latter is not an inner product: $x^Tx$ can be zero for some nonzero $x$ (such as $x^T=(1,i)$).
– user1551
Dec 8 '18 at 9:09
oh sorry It seems that I mixed something up. Thank you very much.
– Lau
Dec 8 '18 at 10:58
add a comment |
Let $U=pmatrix{u&v&w}$. The statements that $U$ is unitary and $U^{-1}AU$ has the zero pattern in question mean that ${u,v,w}$ is an orthonormal basis of $mathbb C^3$, $v$ is an eigenvector of $A$ and $Awperp v$ (or equivalently, $wperp A^ast v$).
Since $A$ is a complex square matrix, it always has a unit eigenvector $v$. Let $V=operatorname{span}{v}$. As $V^perp$ is two-dimensional and the orthogonal projection of $operatorname{span}{A^ast v}$ on $V^perp$ is at most one-dimensional, there always exists some nonzero vector $win V^perp$ that is orthogonal to $A^ast v$. Normalise $w$ and extend ${v,w}$ into an orthonormal basis ${u,v,w}$. Take $U=pmatrix{u&v&w}$ and you are done.
Let $U=pmatrix{u&v&w}$. The statements that $U$ is unitary and $U^{-1}AU$ has the zero pattern in question mean that ${u,v,w}$ is an orthonormal basis of $mathbb C^3$, $v$ is an eigenvector of $A$ and $Awperp v$ (or equivalently, $wperp A^ast v$).
Since $A$ is a complex square matrix, it always has a unit eigenvector $v$. Let $V=operatorname{span}{v}$. As $V^perp$ is two-dimensional and the orthogonal projection of $operatorname{span}{A^ast v}$ on $V^perp$ is at most one-dimensional, there always exists some nonzero vector $win V^perp$ that is orthogonal to $A^ast v$. Normalise $w$ and extend ${v,w}$ into an orthonormal basis ${u,v,w}$. Take $U=pmatrix{u&v&w}$ and you are done.
answered Dec 6 '18 at 17:16
user1551user1551
71.9k566126
71.9k566126
I think it should be $w perp A^{T}overline{v}$ because $v^{T}Aw=0$ is equivalent to the inner product of $w$ and $A^{T}overline{v}$ is zero.
– Lau
Dec 8 '18 at 8:34
1
@Lau Huh? No, the usual inner product between two vectors $x,yinmathbb C^n$ is defined by $langle x,yrangle=y^ast x$, not by $y^Tx$. The latter is not an inner product: $x^Tx$ can be zero for some nonzero $x$ (such as $x^T=(1,i)$).
– user1551
Dec 8 '18 at 9:09
oh sorry It seems that I mixed something up. Thank you very much.
– Lau
Dec 8 '18 at 10:58
add a comment |
I think it should be $w perp A^{T}overline{v}$ because $v^{T}Aw=0$ is equivalent to the inner product of $w$ and $A^{T}overline{v}$ is zero.
– Lau
Dec 8 '18 at 8:34
1
@Lau Huh? No, the usual inner product between two vectors $x,yinmathbb C^n$ is defined by $langle x,yrangle=y^ast x$, not by $y^Tx$. The latter is not an inner product: $x^Tx$ can be zero for some nonzero $x$ (such as $x^T=(1,i)$).
– user1551
Dec 8 '18 at 9:09
oh sorry It seems that I mixed something up. Thank you very much.
– Lau
Dec 8 '18 at 10:58
I think it should be $w perp A^{T}overline{v}$ because $v^{T}Aw=0$ is equivalent to the inner product of $w$ and $A^{T}overline{v}$ is zero.
– Lau
Dec 8 '18 at 8:34
I think it should be $w perp A^{T}overline{v}$ because $v^{T}Aw=0$ is equivalent to the inner product of $w$ and $A^{T}overline{v}$ is zero.
– Lau
Dec 8 '18 at 8:34
1
1
@Lau Huh? No, the usual inner product between two vectors $x,yinmathbb C^n$ is defined by $langle x,yrangle=y^ast x$, not by $y^Tx$. The latter is not an inner product: $x^Tx$ can be zero for some nonzero $x$ (such as $x^T=(1,i)$).
– user1551
Dec 8 '18 at 9:09
@Lau Huh? No, the usual inner product between two vectors $x,yinmathbb C^n$ is defined by $langle x,yrangle=y^ast x$, not by $y^Tx$. The latter is not an inner product: $x^Tx$ can be zero for some nonzero $x$ (such as $x^T=(1,i)$).
– user1551
Dec 8 '18 at 9:09
oh sorry It seems that I mixed something up. Thank you very much.
– Lau
Dec 8 '18 at 10:58
oh sorry It seems that I mixed something up. Thank you very much.
– Lau
Dec 8 '18 at 10:58
add a comment |
$textbf{Case 1:}$ The characteristic polynomial is $(x-alpha)(x-beta)(x-gamma)$, where $alpha,beta$ and $gamma$ are distinct. $A$ is diagonalisable.
$textbf{Case 2:}$ The characteristic polynomial is $(x-alpha)^2(x-gamma)$, where $alpha$ and $gamma$ are distinct. If the minimal polynomial is $(x-alpha)(x-gamma)$, $A$ is diagonalisable and if the minimal polynomial is $(x-alpha)^2(x-gamma)$, $A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&gammaend{pmatrix}$
$textbf{Case 3:}$ The characteristic polynomial is $(x-alpha)^3$, if the minimal polynomial is $(x-alpha)$, $A$ is diagonalisable, if the minimal polynomial is $(x-alpha)^2$,$A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&alphaend{pmatrix}$ and if the minimal polynomial is $(x-alpha)^3$, $A$ has a cyclic vector say $v$ [i.e. ${v,Av, A^2 v}$ forms a basis]. Then with respect to this basis: ,$A$ has form $begin{pmatrix}0&0&*\1&0&*\0&1&*end{pmatrix}simbegin{pmatrix}*&0&0\*&1&0\*&0&1end{pmatrix} $
1
It is a $3times 3$ complex matrix, not real. Additionally, while a matrix is similar to Jordan form, it is not necessarily similar via a unitary matrix.
– Aaron
Dec 5 '18 at 6:07
ohh..sorry, will edit soon
– PSG
Dec 5 '18 at 6:08
Aaron, true. But two matrices are similar meaning , they are just written in terms of two different bases.Let's say the Jordon form is written w.r.t some basis, If we orthonormalize the basis, and write the matrix in the new basis, the $0$ entries will still remain $0$, I guess.
– PSG
Dec 5 '18 at 6:42
How can orthonormalization of the basis preserve 0 entries?
– Lau
Dec 5 '18 at 12:15
1
Let ${v_1,v_2,..., v_n}$ be the basis. Now say $Av_i=sum_{j=1}^{n}c_j v_jRightarrow Afrac{v_i}{||v_i||}=sum_{j=1}^{n} c_jfrac{v_j}{||v_i||}= sum_{j=1}^{n} c_jfrac{v_j}{||v_j||} times frac{||v_j||}{||v_i||}$, if some coefficient was $0$, it will remain $0$
– PSG
Dec 5 '18 at 12:27
|
show 2 more comments
$textbf{Case 1:}$ The characteristic polynomial is $(x-alpha)(x-beta)(x-gamma)$, where $alpha,beta$ and $gamma$ are distinct. $A$ is diagonalisable.
$textbf{Case 2:}$ The characteristic polynomial is $(x-alpha)^2(x-gamma)$, where $alpha$ and $gamma$ are distinct. If the minimal polynomial is $(x-alpha)(x-gamma)$, $A$ is diagonalisable and if the minimal polynomial is $(x-alpha)^2(x-gamma)$, $A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&gammaend{pmatrix}$
$textbf{Case 3:}$ The characteristic polynomial is $(x-alpha)^3$, if the minimal polynomial is $(x-alpha)$, $A$ is diagonalisable, if the minimal polynomial is $(x-alpha)^2$,$A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&alphaend{pmatrix}$ and if the minimal polynomial is $(x-alpha)^3$, $A$ has a cyclic vector say $v$ [i.e. ${v,Av, A^2 v}$ forms a basis]. Then with respect to this basis: ,$A$ has form $begin{pmatrix}0&0&*\1&0&*\0&1&*end{pmatrix}simbegin{pmatrix}*&0&0\*&1&0\*&0&1end{pmatrix} $
1
It is a $3times 3$ complex matrix, not real. Additionally, while a matrix is similar to Jordan form, it is not necessarily similar via a unitary matrix.
– Aaron
Dec 5 '18 at 6:07
ohh..sorry, will edit soon
– PSG
Dec 5 '18 at 6:08
Aaron, true. But two matrices are similar meaning , they are just written in terms of two different bases.Let's say the Jordon form is written w.r.t some basis, If we orthonormalize the basis, and write the matrix in the new basis, the $0$ entries will still remain $0$, I guess.
– PSG
Dec 5 '18 at 6:42
How can orthonormalization of the basis preserve 0 entries?
– Lau
Dec 5 '18 at 12:15
1
Let ${v_1,v_2,..., v_n}$ be the basis. Now say $Av_i=sum_{j=1}^{n}c_j v_jRightarrow Afrac{v_i}{||v_i||}=sum_{j=1}^{n} c_jfrac{v_j}{||v_i||}= sum_{j=1}^{n} c_jfrac{v_j}{||v_j||} times frac{||v_j||}{||v_i||}$, if some coefficient was $0$, it will remain $0$
– PSG
Dec 5 '18 at 12:27
|
show 2 more comments
$textbf{Case 1:}$ The characteristic polynomial is $(x-alpha)(x-beta)(x-gamma)$, where $alpha,beta$ and $gamma$ are distinct. $A$ is diagonalisable.
$textbf{Case 2:}$ The characteristic polynomial is $(x-alpha)^2(x-gamma)$, where $alpha$ and $gamma$ are distinct. If the minimal polynomial is $(x-alpha)(x-gamma)$, $A$ is diagonalisable and if the minimal polynomial is $(x-alpha)^2(x-gamma)$, $A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&gammaend{pmatrix}$
$textbf{Case 3:}$ The characteristic polynomial is $(x-alpha)^3$, if the minimal polynomial is $(x-alpha)$, $A$ is diagonalisable, if the minimal polynomial is $(x-alpha)^2$,$A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&alphaend{pmatrix}$ and if the minimal polynomial is $(x-alpha)^3$, $A$ has a cyclic vector say $v$ [i.e. ${v,Av, A^2 v}$ forms a basis]. Then with respect to this basis: ,$A$ has form $begin{pmatrix}0&0&*\1&0&*\0&1&*end{pmatrix}simbegin{pmatrix}*&0&0\*&1&0\*&0&1end{pmatrix} $
$textbf{Case 1:}$ The characteristic polynomial is $(x-alpha)(x-beta)(x-gamma)$, where $alpha,beta$ and $gamma$ are distinct. $A$ is diagonalisable.
$textbf{Case 2:}$ The characteristic polynomial is $(x-alpha)^2(x-gamma)$, where $alpha$ and $gamma$ are distinct. If the minimal polynomial is $(x-alpha)(x-gamma)$, $A$ is diagonalisable and if the minimal polynomial is $(x-alpha)^2(x-gamma)$, $A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&gammaend{pmatrix}$
$textbf{Case 3:}$ The characteristic polynomial is $(x-alpha)^3$, if the minimal polynomial is $(x-alpha)$, $A$ is diagonalisable, if the minimal polynomial is $(x-alpha)^2$,$A$ has Jordon form $begin{pmatrix}alpha&0&0\1&alpha&0\0&0&alphaend{pmatrix}$ and if the minimal polynomial is $(x-alpha)^3$, $A$ has a cyclic vector say $v$ [i.e. ${v,Av, A^2 v}$ forms a basis]. Then with respect to this basis: ,$A$ has form $begin{pmatrix}0&0&*\1&0&*\0&1&*end{pmatrix}simbegin{pmatrix}*&0&0\*&1&0\*&0&1end{pmatrix} $
edited Dec 5 '18 at 6:37
answered Dec 5 '18 at 6:04
PSGPSG
3749
3749
1
It is a $3times 3$ complex matrix, not real. Additionally, while a matrix is similar to Jordan form, it is not necessarily similar via a unitary matrix.
– Aaron
Dec 5 '18 at 6:07
ohh..sorry, will edit soon
– PSG
Dec 5 '18 at 6:08
Aaron, true. But two matrices are similar meaning , they are just written in terms of two different bases.Let's say the Jordon form is written w.r.t some basis, If we orthonormalize the basis, and write the matrix in the new basis, the $0$ entries will still remain $0$, I guess.
– PSG
Dec 5 '18 at 6:42
How can orthonormalization of the basis preserve 0 entries?
– Lau
Dec 5 '18 at 12:15
1
Let ${v_1,v_2,..., v_n}$ be the basis. Now say $Av_i=sum_{j=1}^{n}c_j v_jRightarrow Afrac{v_i}{||v_i||}=sum_{j=1}^{n} c_jfrac{v_j}{||v_i||}= sum_{j=1}^{n} c_jfrac{v_j}{||v_j||} times frac{||v_j||}{||v_i||}$, if some coefficient was $0$, it will remain $0$
– PSG
Dec 5 '18 at 12:27
|
show 2 more comments
1
It is a $3times 3$ complex matrix, not real. Additionally, while a matrix is similar to Jordan form, it is not necessarily similar via a unitary matrix.
– Aaron
Dec 5 '18 at 6:07
ohh..sorry, will edit soon
– PSG
Dec 5 '18 at 6:08
Aaron, true. But two matrices are similar meaning , they are just written in terms of two different bases.Let's say the Jordon form is written w.r.t some basis, If we orthonormalize the basis, and write the matrix in the new basis, the $0$ entries will still remain $0$, I guess.
– PSG
Dec 5 '18 at 6:42
How can orthonormalization of the basis preserve 0 entries?
– Lau
Dec 5 '18 at 12:15
1
Let ${v_1,v_2,..., v_n}$ be the basis. Now say $Av_i=sum_{j=1}^{n}c_j v_jRightarrow Afrac{v_i}{||v_i||}=sum_{j=1}^{n} c_jfrac{v_j}{||v_i||}= sum_{j=1}^{n} c_jfrac{v_j}{||v_j||} times frac{||v_j||}{||v_i||}$, if some coefficient was $0$, it will remain $0$
– PSG
Dec 5 '18 at 12:27
1
1
It is a $3times 3$ complex matrix, not real. Additionally, while a matrix is similar to Jordan form, it is not necessarily similar via a unitary matrix.
– Aaron
Dec 5 '18 at 6:07
It is a $3times 3$ complex matrix, not real. Additionally, while a matrix is similar to Jordan form, it is not necessarily similar via a unitary matrix.
– Aaron
Dec 5 '18 at 6:07
ohh..sorry, will edit soon
– PSG
Dec 5 '18 at 6:08
ohh..sorry, will edit soon
– PSG
Dec 5 '18 at 6:08
Aaron, true. But two matrices are similar meaning , they are just written in terms of two different bases.Let's say the Jordon form is written w.r.t some basis, If we orthonormalize the basis, and write the matrix in the new basis, the $0$ entries will still remain $0$, I guess.
– PSG
Dec 5 '18 at 6:42
Aaron, true. But two matrices are similar meaning , they are just written in terms of two different bases.Let's say the Jordon form is written w.r.t some basis, If we orthonormalize the basis, and write the matrix in the new basis, the $0$ entries will still remain $0$, I guess.
– PSG
Dec 5 '18 at 6:42
How can orthonormalization of the basis preserve 0 entries?
– Lau
Dec 5 '18 at 12:15
How can orthonormalization of the basis preserve 0 entries?
– Lau
Dec 5 '18 at 12:15
1
1
Let ${v_1,v_2,..., v_n}$ be the basis. Now say $Av_i=sum_{j=1}^{n}c_j v_jRightarrow Afrac{v_i}{||v_i||}=sum_{j=1}^{n} c_jfrac{v_j}{||v_i||}= sum_{j=1}^{n} c_jfrac{v_j}{||v_j||} times frac{||v_j||}{||v_i||}$, if some coefficient was $0$, it will remain $0$
– PSG
Dec 5 '18 at 12:27
Let ${v_1,v_2,..., v_n}$ be the basis. Now say $Av_i=sum_{j=1}^{n}c_j v_jRightarrow Afrac{v_i}{||v_i||}=sum_{j=1}^{n} c_jfrac{v_j}{||v_i||}= sum_{j=1}^{n} c_jfrac{v_j}{||v_j||} times frac{||v_j||}{||v_i||}$, if some coefficient was $0$, it will remain $0$
– PSG
Dec 5 '18 at 12:27
|
show 2 more comments
I will expand on PSG's case 3.
First, by permutations of last 2 rows and cols we can search for form
$$
begin{pmatrix}
*&*&0\
*&*&0\
*&0&*\
end{pmatrix}
$$
Jordan chain of vectors $V=(v_1, v_2, v_3)$ gives us the following form:
$$
V^TAV=begin{pmatrix}
lambda&0&0\
1&lambda&0\
0&1&lambda\
end{pmatrix}
$$
When we apply standard orthonormalization we will obtain orthonormal basis $V'=(v_1', v_2', v_3')$:
$$
V'^TAV'=begin{pmatrix}
lambda&0&0\
a_0&lambda&0\
b_0&c_0&lambda\
end{pmatrix}
$$
Notably, we can always choose phases of our basis (by multiplying by right $e^{iphi}$), so all $b_0$ and $c_0$ are real.
Now we want to rotate basis $V'$ around $v'_3$ by angle $theta$, obtaining new orthonomal basis $U(theta)$:
$$
U(theta)^TAU(theta)=begin{pmatrix}
lambda_1(theta)&a'(theta)&0\
a(theta)&lambda_2(theta)&0\
b(theta)&c(theta)&lambda\
end{pmatrix}
$$
Particularly, $c(theta)=c_0costheta-b_0sintheta$. It means there is such $theta$, that $c(theta)=0$.
Why the basis is still orthonomal after we rotate $v'_3$?
– Lau
Dec 7 '18 at 0:32
We rotate around $v'_3$. Rotations keep angles between vectors.
– Vasily Mitch
Dec 7 '18 at 12:32
add a comment |
I will expand on PSG's case 3.
First, by permutations of last 2 rows and cols we can search for form
$$
begin{pmatrix}
*&*&0\
*&*&0\
*&0&*\
end{pmatrix}
$$
Jordan chain of vectors $V=(v_1, v_2, v_3)$ gives us the following form:
$$
V^TAV=begin{pmatrix}
lambda&0&0\
1&lambda&0\
0&1&lambda\
end{pmatrix}
$$
When we apply standard orthonormalization we will obtain orthonormal basis $V'=(v_1', v_2', v_3')$:
$$
V'^TAV'=begin{pmatrix}
lambda&0&0\
a_0&lambda&0\
b_0&c_0&lambda\
end{pmatrix}
$$
Notably, we can always choose phases of our basis (by multiplying by right $e^{iphi}$), so all $b_0$ and $c_0$ are real.
Now we want to rotate basis $V'$ around $v'_3$ by angle $theta$, obtaining new orthonomal basis $U(theta)$:
$$
U(theta)^TAU(theta)=begin{pmatrix}
lambda_1(theta)&a'(theta)&0\
a(theta)&lambda_2(theta)&0\
b(theta)&c(theta)&lambda\
end{pmatrix}
$$
Particularly, $c(theta)=c_0costheta-b_0sintheta$. It means there is such $theta$, that $c(theta)=0$.
Why the basis is still orthonomal after we rotate $v'_3$?
– Lau
Dec 7 '18 at 0:32
We rotate around $v'_3$. Rotations keep angles between vectors.
– Vasily Mitch
Dec 7 '18 at 12:32
add a comment |
I will expand on PSG's case 3.
First, by permutations of last 2 rows and cols we can search for form
$$
begin{pmatrix}
*&*&0\
*&*&0\
*&0&*\
end{pmatrix}
$$
Jordan chain of vectors $V=(v_1, v_2, v_3)$ gives us the following form:
$$
V^TAV=begin{pmatrix}
lambda&0&0\
1&lambda&0\
0&1&lambda\
end{pmatrix}
$$
When we apply standard orthonormalization we will obtain orthonormal basis $V'=(v_1', v_2', v_3')$:
$$
V'^TAV'=begin{pmatrix}
lambda&0&0\
a_0&lambda&0\
b_0&c_0&lambda\
end{pmatrix}
$$
Notably, we can always choose phases of our basis (by multiplying by right $e^{iphi}$), so all $b_0$ and $c_0$ are real.
Now we want to rotate basis $V'$ around $v'_3$ by angle $theta$, obtaining new orthonomal basis $U(theta)$:
$$
U(theta)^TAU(theta)=begin{pmatrix}
lambda_1(theta)&a'(theta)&0\
a(theta)&lambda_2(theta)&0\
b(theta)&c(theta)&lambda\
end{pmatrix}
$$
Particularly, $c(theta)=c_0costheta-b_0sintheta$. It means there is such $theta$, that $c(theta)=0$.
I will expand on PSG's case 3.
First, by permutations of last 2 rows and cols we can search for form
$$
begin{pmatrix}
*&*&0\
*&*&0\
*&0&*\
end{pmatrix}
$$
Jordan chain of vectors $V=(v_1, v_2, v_3)$ gives us the following form:
$$
V^TAV=begin{pmatrix}
lambda&0&0\
1&lambda&0\
0&1&lambda\
end{pmatrix}
$$
When we apply standard orthonormalization we will obtain orthonormal basis $V'=(v_1', v_2', v_3')$:
$$
V'^TAV'=begin{pmatrix}
lambda&0&0\
a_0&lambda&0\
b_0&c_0&lambda\
end{pmatrix}
$$
Notably, we can always choose phases of our basis (by multiplying by right $e^{iphi}$), so all $b_0$ and $c_0$ are real.
Now we want to rotate basis $V'$ around $v'_3$ by angle $theta$, obtaining new orthonomal basis $U(theta)$:
$$
U(theta)^TAU(theta)=begin{pmatrix}
lambda_1(theta)&a'(theta)&0\
a(theta)&lambda_2(theta)&0\
b(theta)&c(theta)&lambda\
end{pmatrix}
$$
Particularly, $c(theta)=c_0costheta-b_0sintheta$. It means there is such $theta$, that $c(theta)=0$.
answered Dec 6 '18 at 16:17
Vasily MitchVasily Mitch
1,33837
1,33837
Why the basis is still orthonomal after we rotate $v'_3$?
– Lau
Dec 7 '18 at 0:32
We rotate around $v'_3$. Rotations keep angles between vectors.
– Vasily Mitch
Dec 7 '18 at 12:32
add a comment |
Why the basis is still orthonomal after we rotate $v'_3$?
– Lau
Dec 7 '18 at 0:32
We rotate around $v'_3$. Rotations keep angles between vectors.
– Vasily Mitch
Dec 7 '18 at 12:32
Why the basis is still orthonomal after we rotate $v'_3$?
– Lau
Dec 7 '18 at 0:32
Why the basis is still orthonomal after we rotate $v'_3$?
– Lau
Dec 7 '18 at 0:32
We rotate around $v'_3$. Rotations keep angles between vectors.
– Vasily Mitch
Dec 7 '18 at 12:32
We rotate around $v'_3$. Rotations keep angles between vectors.
– Vasily Mitch
Dec 7 '18 at 12:32
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%2f3026551%2fprove-that-any-complex-3-times-3-matrix-is-similar-to-a-given-form-via-a-3-ti%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