$XA=A^TX$ prove $X$ symmetric matrix The 2019 Stack Overflow Developer Survey Results Are InJordan block and cyclic vector spacesWhich polynomials are characteristic polynomials of a symmetric matrix?Besides being symmetric, when will a matrix have ONLY real eigenvalues?Symmetric Matrices with trace zerofinding two conditions so that for two polynomials, there exists exactly one matrixSignificance of symmetric characteristic polynomials?Cayley-Hamilton equation for a given matrix $A$ and other matricesFind all $4 times 4$ real matrices such that $A^3=I$Testing if given linear space of symmetric matrices contains matrix with given eigenspectrum?Determinant of a symmetric banded matrix (4 diagonals)
Manuscript was "unsubmitted" because the manuscript was deposited in Arxiv Preprints
Are there any other methods to apply to solving simultaneous equations?
How to deal with fear of taking dependencies
I see my dog run
What do the Banks children have against barley water?
Lethal sonic weapons
Where to refill my bottle in India?
How do you say "canon" as in "official for a story universe"?
Why is Grand Jury testimony secret?
Deadlock Graph and Interpretation, solution to avoid
Pristine Bit Checking
Unbreakable Formation vs. Cry of the Carnarium
Is bread bad for ducks?
Is flight data recorder erased after every flight?
Protecting Dualbooting Windows from dangerous code (like rm -rf)
Why do UK politicians seemingly ignore opinion polls on Brexit?
If the Wish spell is used to duplicate the effect of Simulacrum, are existing duplicates destroyed?
Could JWST stay at L2 "forever"?
Monty Hall variation
How to reverse every other sublist of a list?
"To split hairs" vs "To be pedantic"
How to create dashed lines/arrows in Illustrator
Falsification in Math vs Science
JSON.serialize: is it possible to suppress null values of a map?
$XA=A^TX$ prove $X$ symmetric matrix
The 2019 Stack Overflow Developer Survey Results Are InJordan block and cyclic vector spacesWhich polynomials are characteristic polynomials of a symmetric matrix?Besides being symmetric, when will a matrix have ONLY real eigenvalues?Symmetric Matrices with trace zerofinding two conditions so that for two polynomials, there exists exactly one matrixSignificance of symmetric characteristic polynomials?Cayley-Hamilton equation for a given matrix $A$ and other matricesFind all $4 times 4$ real matrices such that $A^3=I$Testing if given linear space of symmetric matrices contains matrix with given eigenspectrum?Determinant of a symmetric banded matrix (4 diagonals)
$begingroup$
Let $A$ be a nonderogatory matrix. This means the characteristic polynomial and the minimal polynomial of $A$ are coincide. Or, equivalently, every matrix $X$ that satisfies $XA=AX$ can be written as a polynomial of $A$. If $AX=XA$ and $XA=A^TX$, prove that $X$ is a symmetric (complex) matrix.
So since $X=f(A)$ for some complex polynomial $f(x)$, from $XA=A^TX$ we can deduce $X^2=X^TX$, but only when $X$ is a real matrix, we can have $X$ is symmetric. I wonder if the original question is wrong, that we should add $X$ being a real matrix? I also check some low order nonderogatory matrices but fail to find a counterexample. Can anyone help me? Thanks!
linear-algebra matrices symmetric-matrices
$endgroup$
add a comment |
$begingroup$
Let $A$ be a nonderogatory matrix. This means the characteristic polynomial and the minimal polynomial of $A$ are coincide. Or, equivalently, every matrix $X$ that satisfies $XA=AX$ can be written as a polynomial of $A$. If $AX=XA$ and $XA=A^TX$, prove that $X$ is a symmetric (complex) matrix.
So since $X=f(A)$ for some complex polynomial $f(x)$, from $XA=A^TX$ we can deduce $X^2=X^TX$, but only when $X$ is a real matrix, we can have $X$ is symmetric. I wonder if the original question is wrong, that we should add $X$ being a real matrix? I also check some low order nonderogatory matrices but fail to find a counterexample. Can anyone help me? Thanks!
linear-algebra matrices symmetric-matrices
$endgroup$
1
$begingroup$
So you have $AX = XA = A^T X$? I'm asking because the first part is missing in the question title, but is mentioned in the body.
$endgroup$
– M. Vinay
Mar 23 at 8:00
add a comment |
$begingroup$
Let $A$ be a nonderogatory matrix. This means the characteristic polynomial and the minimal polynomial of $A$ are coincide. Or, equivalently, every matrix $X$ that satisfies $XA=AX$ can be written as a polynomial of $A$. If $AX=XA$ and $XA=A^TX$, prove that $X$ is a symmetric (complex) matrix.
So since $X=f(A)$ for some complex polynomial $f(x)$, from $XA=A^TX$ we can deduce $X^2=X^TX$, but only when $X$ is a real matrix, we can have $X$ is symmetric. I wonder if the original question is wrong, that we should add $X$ being a real matrix? I also check some low order nonderogatory matrices but fail to find a counterexample. Can anyone help me? Thanks!
linear-algebra matrices symmetric-matrices
$endgroup$
Let $A$ be a nonderogatory matrix. This means the characteristic polynomial and the minimal polynomial of $A$ are coincide. Or, equivalently, every matrix $X$ that satisfies $XA=AX$ can be written as a polynomial of $A$. If $AX=XA$ and $XA=A^TX$, prove that $X$ is a symmetric (complex) matrix.
So since $X=f(A)$ for some complex polynomial $f(x)$, from $XA=A^TX$ we can deduce $X^2=X^TX$, but only when $X$ is a real matrix, we can have $X$ is symmetric. I wonder if the original question is wrong, that we should add $X$ being a real matrix? I also check some low order nonderogatory matrices but fail to find a counterexample. Can anyone help me? Thanks!
linear-algebra matrices symmetric-matrices
linear-algebra matrices symmetric-matrices
edited Mar 23 at 6:33
Rodrigo de Azevedo
13.2k41962
13.2k41962
asked Mar 23 at 5:52
IdeleIdele
1,020410
1,020410
1
$begingroup$
So you have $AX = XA = A^T X$? I'm asking because the first part is missing in the question title, but is mentioned in the body.
$endgroup$
– M. Vinay
Mar 23 at 8:00
add a comment |
1
$begingroup$
So you have $AX = XA = A^T X$? I'm asking because the first part is missing in the question title, but is mentioned in the body.
$endgroup$
– M. Vinay
Mar 23 at 8:00
1
1
$begingroup$
So you have $AX = XA = A^T X$? I'm asking because the first part is missing in the question title, but is mentioned in the body.
$endgroup$
– M. Vinay
Mar 23 at 8:00
$begingroup$
So you have $AX = XA = A^T X$? I'm asking because the first part is missing in the question title, but is mentioned in the body.
$endgroup$
– M. Vinay
Mar 23 at 8:00
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The hypothesis is that $A=SDS^-1$ with $D$ diagonal and all its diagonal entries distinct. From $AX=XA$, it follows that $X=SES^-1$ with $E$ diagonal.
The equality $XA=A^TX$ can be written as
$$
SEDS^-1=S^-TDS^TSES^-1.
$$
Multiplying on the left by $S^T$ and on the right by $S$, we get
$$
S^TSED=DS^TSE.
$$
For any $k$ such that $E_kkne0$, the entries in the above equality give us
$$
(S^TS)_kj D_jj=(S^T)_kjD_kk.
$$
So, $E_kkne0$ and $kne j$ imply $(S^TS)_kj=0$.
Now, if $E_kkne0$ or $E_jjne0$,
$$
(ES^TS)_kj=E_kk(S^TS)_kj=delta_kjE_kk(S^TS)_kk
$$
$$
(S^TSE)_kj=(S^T)_kjE_jj=delta_kj(S^TS)_kkE_jj
$$
and then $(ES^TS)_kj=(S^TSE)_kj$. If $E_kk=E_jj=0$, we also get $(ES^TS)_kj=(S^TSE)_kj$. So
$$
ES^TS=S^TSE.
$$
Multiply by $S^-1$ on the right, and by $S^-T$ on the left, to get
$$
X^T=S^-TES^T=SES^-1=X.
$$
$endgroup$
$begingroup$
Yes, but you proved a special case. Consider any Jordan block, it is a nonderogatory matirx but can't similar to diagonal matrix :(
$endgroup$
– Idele
Apr 5 at 4:41
$begingroup$
You are right, but I think the argument survives even if $D $ is a Jordan form with distinct eigenvalues in each block. I'll check sometime tomorrow.
$endgroup$
– Martin Argerami
Apr 5 at 6:18
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%2f3158996%2fxa-atx-prove-x-symmetric-matrix%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The hypothesis is that $A=SDS^-1$ with $D$ diagonal and all its diagonal entries distinct. From $AX=XA$, it follows that $X=SES^-1$ with $E$ diagonal.
The equality $XA=A^TX$ can be written as
$$
SEDS^-1=S^-TDS^TSES^-1.
$$
Multiplying on the left by $S^T$ and on the right by $S$, we get
$$
S^TSED=DS^TSE.
$$
For any $k$ such that $E_kkne0$, the entries in the above equality give us
$$
(S^TS)_kj D_jj=(S^T)_kjD_kk.
$$
So, $E_kkne0$ and $kne j$ imply $(S^TS)_kj=0$.
Now, if $E_kkne0$ or $E_jjne0$,
$$
(ES^TS)_kj=E_kk(S^TS)_kj=delta_kjE_kk(S^TS)_kk
$$
$$
(S^TSE)_kj=(S^T)_kjE_jj=delta_kj(S^TS)_kkE_jj
$$
and then $(ES^TS)_kj=(S^TSE)_kj$. If $E_kk=E_jj=0$, we also get $(ES^TS)_kj=(S^TSE)_kj$. So
$$
ES^TS=S^TSE.
$$
Multiply by $S^-1$ on the right, and by $S^-T$ on the left, to get
$$
X^T=S^-TES^T=SES^-1=X.
$$
$endgroup$
$begingroup$
Yes, but you proved a special case. Consider any Jordan block, it is a nonderogatory matirx but can't similar to diagonal matrix :(
$endgroup$
– Idele
Apr 5 at 4:41
$begingroup$
You are right, but I think the argument survives even if $D $ is a Jordan form with distinct eigenvalues in each block. I'll check sometime tomorrow.
$endgroup$
– Martin Argerami
Apr 5 at 6:18
add a comment |
$begingroup$
The hypothesis is that $A=SDS^-1$ with $D$ diagonal and all its diagonal entries distinct. From $AX=XA$, it follows that $X=SES^-1$ with $E$ diagonal.
The equality $XA=A^TX$ can be written as
$$
SEDS^-1=S^-TDS^TSES^-1.
$$
Multiplying on the left by $S^T$ and on the right by $S$, we get
$$
S^TSED=DS^TSE.
$$
For any $k$ such that $E_kkne0$, the entries in the above equality give us
$$
(S^TS)_kj D_jj=(S^T)_kjD_kk.
$$
So, $E_kkne0$ and $kne j$ imply $(S^TS)_kj=0$.
Now, if $E_kkne0$ or $E_jjne0$,
$$
(ES^TS)_kj=E_kk(S^TS)_kj=delta_kjE_kk(S^TS)_kk
$$
$$
(S^TSE)_kj=(S^T)_kjE_jj=delta_kj(S^TS)_kkE_jj
$$
and then $(ES^TS)_kj=(S^TSE)_kj$. If $E_kk=E_jj=0$, we also get $(ES^TS)_kj=(S^TSE)_kj$. So
$$
ES^TS=S^TSE.
$$
Multiply by $S^-1$ on the right, and by $S^-T$ on the left, to get
$$
X^T=S^-TES^T=SES^-1=X.
$$
$endgroup$
$begingroup$
Yes, but you proved a special case. Consider any Jordan block, it is a nonderogatory matirx but can't similar to diagonal matrix :(
$endgroup$
– Idele
Apr 5 at 4:41
$begingroup$
You are right, but I think the argument survives even if $D $ is a Jordan form with distinct eigenvalues in each block. I'll check sometime tomorrow.
$endgroup$
– Martin Argerami
Apr 5 at 6:18
add a comment |
$begingroup$
The hypothesis is that $A=SDS^-1$ with $D$ diagonal and all its diagonal entries distinct. From $AX=XA$, it follows that $X=SES^-1$ with $E$ diagonal.
The equality $XA=A^TX$ can be written as
$$
SEDS^-1=S^-TDS^TSES^-1.
$$
Multiplying on the left by $S^T$ and on the right by $S$, we get
$$
S^TSED=DS^TSE.
$$
For any $k$ such that $E_kkne0$, the entries in the above equality give us
$$
(S^TS)_kj D_jj=(S^T)_kjD_kk.
$$
So, $E_kkne0$ and $kne j$ imply $(S^TS)_kj=0$.
Now, if $E_kkne0$ or $E_jjne0$,
$$
(ES^TS)_kj=E_kk(S^TS)_kj=delta_kjE_kk(S^TS)_kk
$$
$$
(S^TSE)_kj=(S^T)_kjE_jj=delta_kj(S^TS)_kkE_jj
$$
and then $(ES^TS)_kj=(S^TSE)_kj$. If $E_kk=E_jj=0$, we also get $(ES^TS)_kj=(S^TSE)_kj$. So
$$
ES^TS=S^TSE.
$$
Multiply by $S^-1$ on the right, and by $S^-T$ on the left, to get
$$
X^T=S^-TES^T=SES^-1=X.
$$
$endgroup$
The hypothesis is that $A=SDS^-1$ with $D$ diagonal and all its diagonal entries distinct. From $AX=XA$, it follows that $X=SES^-1$ with $E$ diagonal.
The equality $XA=A^TX$ can be written as
$$
SEDS^-1=S^-TDS^TSES^-1.
$$
Multiplying on the left by $S^T$ and on the right by $S$, we get
$$
S^TSED=DS^TSE.
$$
For any $k$ such that $E_kkne0$, the entries in the above equality give us
$$
(S^TS)_kj D_jj=(S^T)_kjD_kk.
$$
So, $E_kkne0$ and $kne j$ imply $(S^TS)_kj=0$.
Now, if $E_kkne0$ or $E_jjne0$,
$$
(ES^TS)_kj=E_kk(S^TS)_kj=delta_kjE_kk(S^TS)_kk
$$
$$
(S^TSE)_kj=(S^T)_kjE_jj=delta_kj(S^TS)_kkE_jj
$$
and then $(ES^TS)_kj=(S^TSE)_kj$. If $E_kk=E_jj=0$, we also get $(ES^TS)_kj=(S^TSE)_kj$. So
$$
ES^TS=S^TSE.
$$
Multiply by $S^-1$ on the right, and by $S^-T$ on the left, to get
$$
X^T=S^-TES^T=SES^-1=X.
$$
answered Mar 24 at 6:56
Martin ArgeramiMartin Argerami
129k1184185
129k1184185
$begingroup$
Yes, but you proved a special case. Consider any Jordan block, it is a nonderogatory matirx but can't similar to diagonal matrix :(
$endgroup$
– Idele
Apr 5 at 4:41
$begingroup$
You are right, but I think the argument survives even if $D $ is a Jordan form with distinct eigenvalues in each block. I'll check sometime tomorrow.
$endgroup$
– Martin Argerami
Apr 5 at 6:18
add a comment |
$begingroup$
Yes, but you proved a special case. Consider any Jordan block, it is a nonderogatory matirx but can't similar to diagonal matrix :(
$endgroup$
– Idele
Apr 5 at 4:41
$begingroup$
You are right, but I think the argument survives even if $D $ is a Jordan form with distinct eigenvalues in each block. I'll check sometime tomorrow.
$endgroup$
– Martin Argerami
Apr 5 at 6:18
$begingroup$
Yes, but you proved a special case. Consider any Jordan block, it is a nonderogatory matirx but can't similar to diagonal matrix :(
$endgroup$
– Idele
Apr 5 at 4:41
$begingroup$
Yes, but you proved a special case. Consider any Jordan block, it is a nonderogatory matirx but can't similar to diagonal matrix :(
$endgroup$
– Idele
Apr 5 at 4:41
$begingroup$
You are right, but I think the argument survives even if $D $ is a Jordan form with distinct eigenvalues in each block. I'll check sometime tomorrow.
$endgroup$
– Martin Argerami
Apr 5 at 6:18
$begingroup$
You are right, but I think the argument survives even if $D $ is a Jordan form with distinct eigenvalues in each block. I'll check sometime tomorrow.
$endgroup$
– Martin Argerami
Apr 5 at 6:18
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%2f3158996%2fxa-atx-prove-x-symmetric-matrix%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
1
$begingroup$
So you have $AX = XA = A^T X$? I'm asking because the first part is missing in the question title, but is mentioned in the body.
$endgroup$
– M. Vinay
Mar 23 at 8:00