Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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?

share|improve this question
    
What do you mean by "But I have come up a counterexample for this"? Counter-example for what? Also, what do you mean by *-congruent? –  Yemon Choi Mar 8 '10 at 2:02
    
Really sorry. I mean I'd like to see a counterexample such that (1) does not hold when $A$ and $B$ are not Hermitian matrices. –  Sunni Mar 8 '10 at 2:14
1  
A and B are $*$-congruent if there is an invertible matrix C such that $B=CAC^*$. –  Jonas Meyer Mar 8 '10 at 2:45
add comment

1 Answer

up vote 3 down vote accepted

An answer to the second question: Yes, a square complex matrix is always $*$-congruent to its transpose, according to a more general result proved by Horn and Sergeichuk in "Congruences of a square matrix and its transpose". They prove the result for all fields with involution in characteristic other than 2.

Added: Here's a counterexample for your first question:

$\left( \begin{matrix} 1 & 0 \\ 1 & 1 \end{matrix} \right) \left( \begin{matrix} 0 & 1 \\ 0 & 0 \end{matrix} \right) \left( \begin{matrix} 1 & 1 \\ 0 & 1 \end{matrix} \right) = \left( \begin{matrix} 0 & 1 \\ 0 & 1 \end{matrix} \right)$.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.