Symplectic equivalent of commuting matrices The 2019 Stack Overflow Developer Survey Results Are InProving “almost all matrices over C are diagonalizable”.Polar decomposition for quaternionic matrices?Characterizing symplectic matrices relative to a partial Iwasawa decompositionApproximating commuting matrices by commuting diagonalizable matricesSymplectic block-diagonalization of a real symmetric Hamiltonian matrixDo skew symmetric matrices ever naturally represent linear transformations?Constant symplectic structureCenter of matricesDiagonalization of real symmetric matrices with symplectic matricesIs every stable matrix orthogonally similar to a $D$-skew-symmetric matrix?
Multi tool use
Symplectic equivalent of commuting matrices
The 2019 Stack Overflow Developer Survey Results Are InProving “almost all matrices over C are diagonalizable”.Polar decomposition for quaternionic matrices?Characterizing symplectic matrices relative to a partial Iwasawa decompositionApproximating commuting matrices by commuting diagonalizable matricesSymplectic block-diagonalization of a real symmetric Hamiltonian matrixDo skew symmetric matrices ever naturally represent linear transformations?Constant symplectic structureCenter of matricesDiagonalization of real symmetric matrices with symplectic matricesIs every stable matrix orthogonally similar to a $D$-skew-symmetric matrix?
$begingroup$
It is well known what happens if two real symmetric matrices commute, i.e. if we have two matrices $A$ and $B$ such that $A=A^T$, $B=B^T$ and $AB=BA$. The answer is given in terms of diagonalization: there is a unitary matrix $M$ such that $A$ and $B$ are transformed into $A'=M^TAM$ and $B'=M^TBM$, and both $A'$ and $B'$ are diagonal.
Here I'm asking if any analogous property holds in the following case.
$A$ and $B$ are symmetric, i.e. $A=A^T$ and $B=B^T$. The following property holds:
$$AOmega B=BOmega A$$ (1)
where $Omega$ is the matrix defining the symplectic bilinear form (skew-symmetric, nonsingular, and hollow), e.g.:
$$Omega = beginbmatrix0 & 0 & 1 & 0\0 & 0 & 0 & 1\
-1 & 0 & 0 & 0 \ 0 & -1 & 0 & 0 endbmatrix$$
The allowed transformations are the symplectic matrices $M$, i.e. matrices for which the following holds:
$$M^TOmega M=Omega$$
The transformed matrices are $A'=M^TAM$ and $B'=M^TBM$.
My question is if there is a form into which $A'$ and $B'$ can be put, by means of a suitable $M$, provided that Eq.1 holds.
linear-algebra sg.symplectic-geometry
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
It is well known what happens if two real symmetric matrices commute, i.e. if we have two matrices $A$ and $B$ such that $A=A^T$, $B=B^T$ and $AB=BA$. The answer is given in terms of diagonalization: there is a unitary matrix $M$ such that $A$ and $B$ are transformed into $A'=M^TAM$ and $B'=M^TBM$, and both $A'$ and $B'$ are diagonal.
Here I'm asking if any analogous property holds in the following case.
$A$ and $B$ are symmetric, i.e. $A=A^T$ and $B=B^T$. The following property holds:
$$AOmega B=BOmega A$$ (1)
where $Omega$ is the matrix defining the symplectic bilinear form (skew-symmetric, nonsingular, and hollow), e.g.:
$$Omega = beginbmatrix0 & 0 & 1 & 0\0 & 0 & 0 & 1\
-1 & 0 & 0 & 0 \ 0 & -1 & 0 & 0 endbmatrix$$
The allowed transformations are the symplectic matrices $M$, i.e. matrices for which the following holds:
$$M^TOmega M=Omega$$
The transformed matrices are $A'=M^TAM$ and $B'=M^TBM$.
My question is if there is a form into which $A'$ and $B'$ can be put, by means of a suitable $M$, provided that Eq.1 holds.
linear-algebra sg.symplectic-geometry
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
2
$begingroup$
No idea, but a comment, a bit unrelated: for many computations with such things it's better to write $Omega$ as $diag(M,ldots,M)$ where $M=(^0_-1 ^1_0)$. Of course, in practice, it doesn't make that much of a difference.
$endgroup$
– Teo Banica
Apr 7 at 17:24
1
$begingroup$
For $n=2$, there's the formula $Omega AOmega = (det A) A^-1T$ ($=(det A) A^-1$ here), so if $det A=det B$, then (1) says that $A^-1B=B^-1A$, and in general, there's an extra constant. Of course, all this is a far cry from the full question, but it might give a hint.
$endgroup$
– Christian Remling
Apr 7 at 18:09
3
$begingroup$
If $A$ and $B$ are complex matrices for which $Omega A$ and $Omega B$ are (anti)symmetric and commute (the latter is equivalent to condition $(1)$), then there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal by Lemma 17 in the paper Carlo posted. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$.
$endgroup$
– MTyson
Apr 8 at 0:18
$begingroup$
Interesting! Could you please make this an answer, and maybe extend it a bit? For example, I still do not understand if this applies when $A$ is symmetric, i.e. $A=A^T$.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:52
2
$begingroup$
@DorianoBrogioli --- the symmetry of $A$ ensures that $Omega A$ is Hamiltonian (symplectic skew-symmetric), which is the condition needed for Lemma 17 mentioned by MTyson to apply.
$endgroup$
– Carlo Beenakker
Apr 8 at 10:09
add a comment |
$begingroup$
It is well known what happens if two real symmetric matrices commute, i.e. if we have two matrices $A$ and $B$ such that $A=A^T$, $B=B^T$ and $AB=BA$. The answer is given in terms of diagonalization: there is a unitary matrix $M$ such that $A$ and $B$ are transformed into $A'=M^TAM$ and $B'=M^TBM$, and both $A'$ and $B'$ are diagonal.
Here I'm asking if any analogous property holds in the following case.
$A$ and $B$ are symmetric, i.e. $A=A^T$ and $B=B^T$. The following property holds:
$$AOmega B=BOmega A$$ (1)
where $Omega$ is the matrix defining the symplectic bilinear form (skew-symmetric, nonsingular, and hollow), e.g.:
$$Omega = beginbmatrix0 & 0 & 1 & 0\0 & 0 & 0 & 1\
-1 & 0 & 0 & 0 \ 0 & -1 & 0 & 0 endbmatrix$$
The allowed transformations are the symplectic matrices $M$, i.e. matrices for which the following holds:
$$M^TOmega M=Omega$$
The transformed matrices are $A'=M^TAM$ and $B'=M^TBM$.
My question is if there is a form into which $A'$ and $B'$ can be put, by means of a suitable $M$, provided that Eq.1 holds.
linear-algebra sg.symplectic-geometry
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
It is well known what happens if two real symmetric matrices commute, i.e. if we have two matrices $A$ and $B$ such that $A=A^T$, $B=B^T$ and $AB=BA$. The answer is given in terms of diagonalization: there is a unitary matrix $M$ such that $A$ and $B$ are transformed into $A'=M^TAM$ and $B'=M^TBM$, and both $A'$ and $B'$ are diagonal.
Here I'm asking if any analogous property holds in the following case.
$A$ and $B$ are symmetric, i.e. $A=A^T$ and $B=B^T$. The following property holds:
$$AOmega B=BOmega A$$ (1)
where $Omega$ is the matrix defining the symplectic bilinear form (skew-symmetric, nonsingular, and hollow), e.g.:
$$Omega = beginbmatrix0 & 0 & 1 & 0\0 & 0 & 0 & 1\
-1 & 0 & 0 & 0 \ 0 & -1 & 0 & 0 endbmatrix$$
The allowed transformations are the symplectic matrices $M$, i.e. matrices for which the following holds:
$$M^TOmega M=Omega$$
The transformed matrices are $A'=M^TAM$ and $B'=M^TBM$.
My question is if there is a form into which $A'$ and $B'$ can be put, by means of a suitable $M$, provided that Eq.1 holds.
linear-algebra sg.symplectic-geometry
linear-algebra sg.symplectic-geometry
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
asked Apr 7 at 17:05
Doriano BrogioliDoriano Brogioli
483
483
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Doriano Brogioli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
2
$begingroup$
No idea, but a comment, a bit unrelated: for many computations with such things it's better to write $Omega$ as $diag(M,ldots,M)$ where $M=(^0_-1 ^1_0)$. Of course, in practice, it doesn't make that much of a difference.
$endgroup$
– Teo Banica
Apr 7 at 17:24
1
$begingroup$
For $n=2$, there's the formula $Omega AOmega = (det A) A^-1T$ ($=(det A) A^-1$ here), so if $det A=det B$, then (1) says that $A^-1B=B^-1A$, and in general, there's an extra constant. Of course, all this is a far cry from the full question, but it might give a hint.
$endgroup$
– Christian Remling
Apr 7 at 18:09
3
$begingroup$
If $A$ and $B$ are complex matrices for which $Omega A$ and $Omega B$ are (anti)symmetric and commute (the latter is equivalent to condition $(1)$), then there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal by Lemma 17 in the paper Carlo posted. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$.
$endgroup$
– MTyson
Apr 8 at 0:18
$begingroup$
Interesting! Could you please make this an answer, and maybe extend it a bit? For example, I still do not understand if this applies when $A$ is symmetric, i.e. $A=A^T$.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:52
2
$begingroup$
@DorianoBrogioli --- the symmetry of $A$ ensures that $Omega A$ is Hamiltonian (symplectic skew-symmetric), which is the condition needed for Lemma 17 mentioned by MTyson to apply.
$endgroup$
– Carlo Beenakker
Apr 8 at 10:09
add a comment |
2
$begingroup$
No idea, but a comment, a bit unrelated: for many computations with such things it's better to write $Omega$ as $diag(M,ldots,M)$ where $M=(^0_-1 ^1_0)$. Of course, in practice, it doesn't make that much of a difference.
$endgroup$
– Teo Banica
Apr 7 at 17:24
1
$begingroup$
For $n=2$, there's the formula $Omega AOmega = (det A) A^-1T$ ($=(det A) A^-1$ here), so if $det A=det B$, then (1) says that $A^-1B=B^-1A$, and in general, there's an extra constant. Of course, all this is a far cry from the full question, but it might give a hint.
$endgroup$
– Christian Remling
Apr 7 at 18:09
3
$begingroup$
If $A$ and $B$ are complex matrices for which $Omega A$ and $Omega B$ are (anti)symmetric and commute (the latter is equivalent to condition $(1)$), then there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal by Lemma 17 in the paper Carlo posted. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$.
$endgroup$
– MTyson
Apr 8 at 0:18
$begingroup$
Interesting! Could you please make this an answer, and maybe extend it a bit? For example, I still do not understand if this applies when $A$ is symmetric, i.e. $A=A^T$.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:52
2
$begingroup$
@DorianoBrogioli --- the symmetry of $A$ ensures that $Omega A$ is Hamiltonian (symplectic skew-symmetric), which is the condition needed for Lemma 17 mentioned by MTyson to apply.
$endgroup$
– Carlo Beenakker
Apr 8 at 10:09
2
2
$begingroup$
No idea, but a comment, a bit unrelated: for many computations with such things it's better to write $Omega$ as $diag(M,ldots,M)$ where $M=(^0_-1 ^1_0)$. Of course, in practice, it doesn't make that much of a difference.
$endgroup$
– Teo Banica
Apr 7 at 17:24
$begingroup$
No idea, but a comment, a bit unrelated: for many computations with such things it's better to write $Omega$ as $diag(M,ldots,M)$ where $M=(^0_-1 ^1_0)$. Of course, in practice, it doesn't make that much of a difference.
$endgroup$
– Teo Banica
Apr 7 at 17:24
1
1
$begingroup$
For $n=2$, there's the formula $Omega AOmega = (det A) A^-1T$ ($=(det A) A^-1$ here), so if $det A=det B$, then (1) says that $A^-1B=B^-1A$, and in general, there's an extra constant. Of course, all this is a far cry from the full question, but it might give a hint.
$endgroup$
– Christian Remling
Apr 7 at 18:09
$begingroup$
For $n=2$, there's the formula $Omega AOmega = (det A) A^-1T$ ($=(det A) A^-1$ here), so if $det A=det B$, then (1) says that $A^-1B=B^-1A$, and in general, there's an extra constant. Of course, all this is a far cry from the full question, but it might give a hint.
$endgroup$
– Christian Remling
Apr 7 at 18:09
3
3
$begingroup$
If $A$ and $B$ are complex matrices for which $Omega A$ and $Omega B$ are (anti)symmetric and commute (the latter is equivalent to condition $(1)$), then there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal by Lemma 17 in the paper Carlo posted. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$.
$endgroup$
– MTyson
Apr 8 at 0:18
$begingroup$
If $A$ and $B$ are complex matrices for which $Omega A$ and $Omega B$ are (anti)symmetric and commute (the latter is equivalent to condition $(1)$), then there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal by Lemma 17 in the paper Carlo posted. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$.
$endgroup$
– MTyson
Apr 8 at 0:18
$begingroup$
Interesting! Could you please make this an answer, and maybe extend it a bit? For example, I still do not understand if this applies when $A$ is symmetric, i.e. $A=A^T$.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:52
$begingroup$
Interesting! Could you please make this an answer, and maybe extend it a bit? For example, I still do not understand if this applies when $A$ is symmetric, i.e. $A=A^T$.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:52
2
2
$begingroup$
@DorianoBrogioli --- the symmetry of $A$ ensures that $Omega A$ is Hamiltonian (symplectic skew-symmetric), which is the condition needed for Lemma 17 mentioned by MTyson to apply.
$endgroup$
– Carlo Beenakker
Apr 8 at 10:09
$begingroup$
@DorianoBrogioli --- the symmetry of $A$ ensures that $Omega A$ is Hamiltonian (symplectic skew-symmetric), which is the condition needed for Lemma 17 mentioned by MTyson to apply.
$endgroup$
– Carlo Beenakker
Apr 8 at 10:09
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Let $A$ and $B$ be complex symmetric matrices of even dimension which satisfy condition $(1)$ and for which $Omega A$ and $Omega B$ are diagonalizable. Then $Omega A$ and $Omega B$ are Hamiltonian (not (anti)symmetric as my comment said):
$$Omega^top (Omega A)^top Omega=-Omega A^topOmega^topOmega=-Omega A.$$
Condition $(1)$ means that $Omega A$ and $Omega B$ commute. By Lemma 17 in the paper in Carlo's answer, there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$ are of the same form.
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
$endgroup$
$begingroup$
Very useful and complete. Could you please comment on the requisite that $Omega A$ and $Omega B$ are diagonalizable? Can be expressed as a more explicit condition on $A$ and $B$? And what happens if they are not diagonalizable?
$endgroup$
– Doriano Brogioli
Apr 8 at 20:59
1
$begingroup$
@DorianoBrogioli If $S^top AS=-Omega D$ then $S^-1Omega AS=D$, so this is a necessary condition. I don't know any equivalent conditions on $A$ nor if there's a Jordan-like form that the matrices can always be put into.
$endgroup$
– MTyson
Apr 8 at 21:58
1
$begingroup$
There is a symplectic version of the Jordan normal form (of a single matrix). Have a look at the paper Conjugacy classes in linear groups.
$endgroup$
– Tobias Diez
yesterday
add a comment |
$begingroup$
The symplectic counterpart of the fact that a family of commuting diagonalizable matrices is simultaneously diagonalizable is discussed in section 3.1 of On the diagonalizability of a matrix by a symplectic equivalence, similarity or congruence transformation
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
$endgroup$
2
$begingroup$
I don't think this paper ever considers condition (1) of the OP; "commuting" there just means commuting.
$endgroup$
– Christian Remling
Apr 7 at 20:27
$begingroup$
I agree. As far as I can understand, the paper has to do with the topic but does not directly contain the answer, and further elaboration and work is needed. Maybe the comment of MTyson (to the question) can help.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:54
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: "504"
;
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
);
);
Doriano Brogioli is a new contributor. Be nice, and check out our Code of Conduct.
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%2fmathoverflow.net%2fquestions%2f327421%2fsymplectic-equivalent-of-commuting-matrices%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $A$ and $B$ be complex symmetric matrices of even dimension which satisfy condition $(1)$ and for which $Omega A$ and $Omega B$ are diagonalizable. Then $Omega A$ and $Omega B$ are Hamiltonian (not (anti)symmetric as my comment said):
$$Omega^top (Omega A)^top Omega=-Omega A^topOmega^topOmega=-Omega A.$$
Condition $(1)$ means that $Omega A$ and $Omega B$ commute. By Lemma 17 in the paper in Carlo's answer, there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$ are of the same form.
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
$endgroup$
$begingroup$
Very useful and complete. Could you please comment on the requisite that $Omega A$ and $Omega B$ are diagonalizable? Can be expressed as a more explicit condition on $A$ and $B$? And what happens if they are not diagonalizable?
$endgroup$
– Doriano Brogioli
Apr 8 at 20:59
1
$begingroup$
@DorianoBrogioli If $S^top AS=-Omega D$ then $S^-1Omega AS=D$, so this is a necessary condition. I don't know any equivalent conditions on $A$ nor if there's a Jordan-like form that the matrices can always be put into.
$endgroup$
– MTyson
Apr 8 at 21:58
1
$begingroup$
There is a symplectic version of the Jordan normal form (of a single matrix). Have a look at the paper Conjugacy classes in linear groups.
$endgroup$
– Tobias Diez
yesterday
add a comment |
$begingroup$
Let $A$ and $B$ be complex symmetric matrices of even dimension which satisfy condition $(1)$ and for which $Omega A$ and $Omega B$ are diagonalizable. Then $Omega A$ and $Omega B$ are Hamiltonian (not (anti)symmetric as my comment said):
$$Omega^top (Omega A)^top Omega=-Omega A^topOmega^topOmega=-Omega A.$$
Condition $(1)$ means that $Omega A$ and $Omega B$ commute. By Lemma 17 in the paper in Carlo's answer, there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$ are of the same form.
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
$endgroup$
$begingroup$
Very useful and complete. Could you please comment on the requisite that $Omega A$ and $Omega B$ are diagonalizable? Can be expressed as a more explicit condition on $A$ and $B$? And what happens if they are not diagonalizable?
$endgroup$
– Doriano Brogioli
Apr 8 at 20:59
1
$begingroup$
@DorianoBrogioli If $S^top AS=-Omega D$ then $S^-1Omega AS=D$, so this is a necessary condition. I don't know any equivalent conditions on $A$ nor if there's a Jordan-like form that the matrices can always be put into.
$endgroup$
– MTyson
Apr 8 at 21:58
1
$begingroup$
There is a symplectic version of the Jordan normal form (of a single matrix). Have a look at the paper Conjugacy classes in linear groups.
$endgroup$
– Tobias Diez
yesterday
add a comment |
$begingroup$
Let $A$ and $B$ be complex symmetric matrices of even dimension which satisfy condition $(1)$ and for which $Omega A$ and $Omega B$ are diagonalizable. Then $Omega A$ and $Omega B$ are Hamiltonian (not (anti)symmetric as my comment said):
$$Omega^top (Omega A)^top Omega=-Omega A^topOmega^topOmega=-Omega A.$$
Condition $(1)$ means that $Omega A$ and $Omega B$ commute. By Lemma 17 in the paper in Carlo's answer, there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$ are of the same form.
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
$endgroup$
Let $A$ and $B$ be complex symmetric matrices of even dimension which satisfy condition $(1)$ and for which $Omega A$ and $Omega B$ are diagonalizable. Then $Omega A$ and $Omega B$ are Hamiltonian (not (anti)symmetric as my comment said):
$$Omega^top (Omega A)^top Omega=-Omega A^topOmega^topOmega=-Omega A.$$
Condition $(1)$ means that $Omega A$ and $Omega B$ commute. By Lemma 17 in the paper in Carlo's answer, there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$ are of the same form.
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
edited Apr 8 at 13:24
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
answered Apr 8 at 13:04
MTysonMTyson
1,4061611
1,4061611
$begingroup$
Very useful and complete. Could you please comment on the requisite that $Omega A$ and $Omega B$ are diagonalizable? Can be expressed as a more explicit condition on $A$ and $B$? And what happens if they are not diagonalizable?
$endgroup$
– Doriano Brogioli
Apr 8 at 20:59
1
$begingroup$
@DorianoBrogioli If $S^top AS=-Omega D$ then $S^-1Omega AS=D$, so this is a necessary condition. I don't know any equivalent conditions on $A$ nor if there's a Jordan-like form that the matrices can always be put into.
$endgroup$
– MTyson
Apr 8 at 21:58
1
$begingroup$
There is a symplectic version of the Jordan normal form (of a single matrix). Have a look at the paper Conjugacy classes in linear groups.
$endgroup$
– Tobias Diez
yesterday
add a comment |
$begingroup$
Very useful and complete. Could you please comment on the requisite that $Omega A$ and $Omega B$ are diagonalizable? Can be expressed as a more explicit condition on $A$ and $B$? And what happens if they are not diagonalizable?
$endgroup$
– Doriano Brogioli
Apr 8 at 20:59
1
$begingroup$
@DorianoBrogioli If $S^top AS=-Omega D$ then $S^-1Omega AS=D$, so this is a necessary condition. I don't know any equivalent conditions on $A$ nor if there's a Jordan-like form that the matrices can always be put into.
$endgroup$
– MTyson
Apr 8 at 21:58
1
$begingroup$
There is a symplectic version of the Jordan normal form (of a single matrix). Have a look at the paper Conjugacy classes in linear groups.
$endgroup$
– Tobias Diez
yesterday
$begingroup$
Very useful and complete. Could you please comment on the requisite that $Omega A$ and $Omega B$ are diagonalizable? Can be expressed as a more explicit condition on $A$ and $B$? And what happens if they are not diagonalizable?
$endgroup$
– Doriano Brogioli
Apr 8 at 20:59
$begingroup$
Very useful and complete. Could you please comment on the requisite that $Omega A$ and $Omega B$ are diagonalizable? Can be expressed as a more explicit condition on $A$ and $B$? And what happens if they are not diagonalizable?
$endgroup$
– Doriano Brogioli
Apr 8 at 20:59
1
1
$begingroup$
@DorianoBrogioli If $S^top AS=-Omega D$ then $S^-1Omega AS=D$, so this is a necessary condition. I don't know any equivalent conditions on $A$ nor if there's a Jordan-like form that the matrices can always be put into.
$endgroup$
– MTyson
Apr 8 at 21:58
$begingroup$
@DorianoBrogioli If $S^top AS=-Omega D$ then $S^-1Omega AS=D$, so this is a necessary condition. I don't know any equivalent conditions on $A$ nor if there's a Jordan-like form that the matrices can always be put into.
$endgroup$
– MTyson
Apr 8 at 21:58
1
1
$begingroup$
There is a symplectic version of the Jordan normal form (of a single matrix). Have a look at the paper Conjugacy classes in linear groups.
$endgroup$
– Tobias Diez
yesterday
$begingroup$
There is a symplectic version of the Jordan normal form (of a single matrix). Have a look at the paper Conjugacy classes in linear groups.
$endgroup$
– Tobias Diez
yesterday
add a comment |
$begingroup$
The symplectic counterpart of the fact that a family of commuting diagonalizable matrices is simultaneously diagonalizable is discussed in section 3.1 of On the diagonalizability of a matrix by a symplectic equivalence, similarity or congruence transformation
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
$endgroup$
2
$begingroup$
I don't think this paper ever considers condition (1) of the OP; "commuting" there just means commuting.
$endgroup$
– Christian Remling
Apr 7 at 20:27
$begingroup$
I agree. As far as I can understand, the paper has to do with the topic but does not directly contain the answer, and further elaboration and work is needed. Maybe the comment of MTyson (to the question) can help.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:54
add a comment |
$begingroup$
The symplectic counterpart of the fact that a family of commuting diagonalizable matrices is simultaneously diagonalizable is discussed in section 3.1 of On the diagonalizability of a matrix by a symplectic equivalence, similarity or congruence transformation
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
$endgroup$
2
$begingroup$
I don't think this paper ever considers condition (1) of the OP; "commuting" there just means commuting.
$endgroup$
– Christian Remling
Apr 7 at 20:27
$begingroup$
I agree. As far as I can understand, the paper has to do with the topic but does not directly contain the answer, and further elaboration and work is needed. Maybe the comment of MTyson (to the question) can help.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:54
add a comment |
$begingroup$
The symplectic counterpart of the fact that a family of commuting diagonalizable matrices is simultaneously diagonalizable is discussed in section 3.1 of On the diagonalizability of a matrix by a symplectic equivalence, similarity or congruence transformation
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
$endgroup$
The symplectic counterpart of the fact that a family of commuting diagonalizable matrices is simultaneously diagonalizable is discussed in section 3.1 of On the diagonalizability of a matrix by a symplectic equivalence, similarity or congruence transformation
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
answered Apr 7 at 19:41
Carlo BeenakkerCarlo Beenakker
80.3k9193295
80.3k9193295
2
$begingroup$
I don't think this paper ever considers condition (1) of the OP; "commuting" there just means commuting.
$endgroup$
– Christian Remling
Apr 7 at 20:27
$begingroup$
I agree. As far as I can understand, the paper has to do with the topic but does not directly contain the answer, and further elaboration and work is needed. Maybe the comment of MTyson (to the question) can help.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:54
add a comment |
2
$begingroup$
I don't think this paper ever considers condition (1) of the OP; "commuting" there just means commuting.
$endgroup$
– Christian Remling
Apr 7 at 20:27
$begingroup$
I agree. As far as I can understand, the paper has to do with the topic but does not directly contain the answer, and further elaboration and work is needed. Maybe the comment of MTyson (to the question) can help.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:54
2
2
$begingroup$
I don't think this paper ever considers condition (1) of the OP; "commuting" there just means commuting.
$endgroup$
– Christian Remling
Apr 7 at 20:27
$begingroup$
I don't think this paper ever considers condition (1) of the OP; "commuting" there just means commuting.
$endgroup$
– Christian Remling
Apr 7 at 20:27
$begingroup$
I agree. As far as I can understand, the paper has to do with the topic but does not directly contain the answer, and further elaboration and work is needed. Maybe the comment of MTyson (to the question) can help.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:54
$begingroup$
I agree. As far as I can understand, the paper has to do with the topic but does not directly contain the answer, and further elaboration and work is needed. Maybe the comment of MTyson (to the question) can help.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:54
add a comment |
Doriano Brogioli is a new contributor. Be nice, and check out our Code of Conduct.
Doriano Brogioli is a new contributor. Be nice, and check out our Code of Conduct.
Doriano Brogioli is a new contributor. Be nice, and check out our Code of Conduct.
Doriano Brogioli is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to MathOverflow!
- 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%2fmathoverflow.net%2fquestions%2f327421%2fsymplectic-equivalent-of-commuting-matrices%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
w E6lNm2b8RFn,FKqVgb5iP4Hpi6jBQJ4K74KyZdq,0L8,hviKroM1ulePxx3P9le10PxIJ h,wUrp6LykqZ,6,v
2
$begingroup$
No idea, but a comment, a bit unrelated: for many computations with such things it's better to write $Omega$ as $diag(M,ldots,M)$ where $M=(^0_-1 ^1_0)$. Of course, in practice, it doesn't make that much of a difference.
$endgroup$
– Teo Banica
Apr 7 at 17:24
1
$begingroup$
For $n=2$, there's the formula $Omega AOmega = (det A) A^-1T$ ($=(det A) A^-1$ here), so if $det A=det B$, then (1) says that $A^-1B=B^-1A$, and in general, there's an extra constant. Of course, all this is a far cry from the full question, but it might give a hint.
$endgroup$
– Christian Remling
Apr 7 at 18:09
3
$begingroup$
If $A$ and $B$ are complex matrices for which $Omega A$ and $Omega B$ are (anti)symmetric and commute (the latter is equivalent to condition $(1)$), then there's a symplectic $S$ such that $S^-1Omega AS=D$ and $S^-1Omega BS=E$ are diagonal by Lemma 17 in the paper Carlo posted. Hence $S^top AS=-Omega D$ and $S^top BS=-Omega E$.
$endgroup$
– MTyson
Apr 8 at 0:18
$begingroup$
Interesting! Could you please make this an answer, and maybe extend it a bit? For example, I still do not understand if this applies when $A$ is symmetric, i.e. $A=A^T$.
$endgroup$
– Doriano Brogioli
Apr 8 at 9:52
2
$begingroup$
@DorianoBrogioli --- the symmetry of $A$ ensures that $Omega A$ is Hamiltonian (symplectic skew-symmetric), which is the condition needed for Lemma 17 mentioned by MTyson to apply.
$endgroup$
– Carlo Beenakker
Apr 8 at 10:09