8
$\begingroup$

Here's the problem I've been stuck on for some time now.

Let $A,B \in M_n(\mathbb{R})$. Let $C= \begin{bmatrix} A & B \\ -B & A \\ \end{bmatrix} $ be a real $2n \times 2n$ matrix. Prove $\det(C) \geq 0$.

What I've tried so far are:

  1. First I tried to write determinant of $C$ as the sum of $2^{2n}$ matrix determinants by expanding all rows of $C$ such that for each binary sequence of length $2n$ like $a = (a_1, a_2, ..., a_{2n})$, if $a_i = 0$ then the first $n$ entries of $i$-th row are zero and if $a_i = 1$ then the second $n$ entries of $i$-th row are zero. But couldn't come close to any answer.
  2. Second we know that determinant is the product of eigenvalues. The characteristic polynomial of $C$ has real coefficients hence its complex roots come in conjugate pairs and have positive product. What remains is to prove that each negative eigenvalue has even multiplicity which I couldn't prove.

Any sort of hints and/or ideas are appreciated.

$\endgroup$

2 Answers 2

10
$\begingroup$

Hint. Start with $$\det{\begin{bmatrix}A & B \\-B & A\end{bmatrix}}=\det{\begin{bmatrix}A-iB& B+iA \\-B & A\end{bmatrix}}.$$

$\endgroup$
2
  • $\begingroup$ Can you plz explain more? $\endgroup$
    – F.K
    May 16, 2016 at 9:30
  • 1
    $\begingroup$ $B+iA=i(A-iB)$. $\endgroup$
    – user26857
    May 16, 2016 at 9:35
4
$\begingroup$

Let $\left( \begin{matrix} x \\ y \end{matrix} \right) \in \mathbb{R}^{2n}$ be an eigenvector with eigenvalue $\lambda$.
Then $\left( \begin{matrix} -y \\x \end{matrix} \right)$ is also an eigenvector with eigenvalue $\lambda$, so all eigenvalues have an even number of linear independent eigenvectors.

$\endgroup$
2
  • $\begingroup$ I don't see how you can conclude without accounting for Jordan blocks. $\endgroup$ May 16, 2016 at 15:47
  • $\begingroup$ @FedericoPoloni A generalized eigenvector of rank $2$ has an associated eigenvector of rank $1$, and you can switch $x$ and $y$ in both eigenvectors, to obtain a generalized an associated eigenvector of the same eigenvalue, thus still keeping an even number of eigenvalues. And the same for eigenvectors of higher rank. $\endgroup$
    – Hetebrij
    May 16, 2016 at 18:57

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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