Skip to main content
added some backticks so that I could read the question in Chrome/Safari
Source Link
deleted 16 characters in body; added 1 characters in body; deleted 1 characters in body
Source Link
Sunni
  • 1.9k
  • 1
  • 19
  • 30

We consider $n\times n$ complex matrices. Let $i_+(A), i_-(A), i_0(A)$ be the number of eigenvalues of $A$ with positive real part, negative real part and pure imaginary. It is well known if two Hermitian matrices $A$ and $B$ are $*-$congruent, then $$(i_+(A), i_-(A), i_0(A))=(i_+(B), i_-(B), i_0(B)).\qquad{(1)}$$ If two general matrices $A$ and $B$ are $*-$congruent, (1) may not hold. But I have come up a counterexample for this (can you provide an example?). Moreover, whether a matrix and its transpose are always $*-$congruent?

We consider $n\times n$ complex matrices. Let $i_+(A), i_-(A), i_0(A)$ be the number of eigenvalues of $A$ with positive real part, negative real part and pure imaginary. It is well known if two Hermitian matrices $A$ and $B$ are $*-$congruent, then $$(i_+(A), i_-(A), i_0(A))=(i_+(B), i_-(B), i_0(B)).\qquad{(1)}$$ If two general matrices $A$ and $B$ are $*-$congruent, (1) may not hold. But I have come up a counterexample for this. Moreover, whether a matrix and its transpose are always $*-$congruent?

We consider $n\times n$ complex matrices. Let $i_+(A), i_-(A), i_0(A)$ be the number of eigenvalues of $A$ with positive real part, negative real part and pure imaginary. It is well known if two Hermitian matrices $A$ and $B$ are $*-$congruent, then $$(i_+(A), i_-(A), i_0(A))=(i_+(B), i_-(B), i_0(B)).\qquad{(1)}$$ If two general matrices $A$ and $B$ are $*-$congruent, (1) may not hold (can you provide an example?). Moreover, whether a matrix and its transpose are always $*-$congruent?

fixed latex
Source Link
Yemon Choi
  • 25.8k
  • 9
  • 69
  • 156

We consider $n\times n$ complex matrices. Let $i_+(A), i_-(A), i_0(A)$ be the number of eigenvalues of $A$ with positive real part, negative real part and pure imaginary. It is well known if two Hermitian matrices $A$ and $B$ are $*-$congruent, then $$(i_+(A), i_-(A), i_0(A))=(i_+(B), i_-(B), i_0(B)).\eqno(1)$$$$(i_+(A), i_-(A), i_0(A))=(i_+(B), i_-(B), i_0(B)).\qquad{(1)}$$ If two general matrices $A$ and $B$ are $*-$congruent, (1) may not hold. But I have come up a counterexample for this. Moreover, whether a matrix and its transpose are always $*-$congruent?

We consider $n\times n$ complex matrices. Let $i_+(A), i_-(A), i_0(A)$ be the number of eigenvalues of $A$ with positive real part, negative real part and pure imaginary. It is well known if two Hermitian matrices $A$ and $B$ are $*-$congruent, then $$(i_+(A), i_-(A), i_0(A))=(i_+(B), i_-(B), i_0(B)).\eqno(1)$$ If two general matrices $A$ and $B$ are $*-$congruent, (1) may not hold. But I have come up a counterexample for this. Moreover, whether a matrix and its transpose are always $*-$congruent?

We consider $n\times n$ complex matrices. Let $i_+(A), i_-(A), i_0(A)$ be the number of eigenvalues of $A$ with positive real part, negative real part and pure imaginary. It is well known if two Hermitian matrices $A$ and $B$ are $*-$congruent, then $$(i_+(A), i_-(A), i_0(A))=(i_+(B), i_-(B), i_0(B)).\qquad{(1)}$$ If two general matrices $A$ and $B$ are $*-$congruent, (1) may not hold. But I have come up a counterexample for this. Moreover, whether a matrix and its transpose are always $*-$congruent?

Source Link
Sunni
  • 1.9k
  • 1
  • 19
  • 30
Loading