12

$A,B$ are two $2\times 2$ real matrices, then

$$\det(A^2+AB+B^2)\geq\det(AB-BA)$$

The inequality is equivalent to the following problem: Let $X=A+\dfrac{B}{2},Y=-\dfrac{B}{2}$

$$\det[(X-Y)(X+Y)-2(X^2+Y^2)]≥4\det(XY-YX)$$

http://www.artofproblemsolving.com/Forum/viewtopic.php?f=353&t=588819

Clin
  • 2,353
  • With Mathematica you can surely bruteforce it into an inequality with 8 unknowns. If we assume $A$ and $B$ to commute is there a simple argument why the lhs is positive? – Dominic Michaelis May 15 '14 at 08:37
  • At least if $A$ and $B$ commute and are diagonalizable we have on the lhs $(\lambda_1^2 + \lambda_1 \mu_1+\mu_1^2)\cdot (\lambda_2^2 + \lambda_2 \mu_2 + \mu_2^2)$, where the $\lambda,\mu$ are the eigenvalues, if they are real we are done with arithmetic geometric mean and in the complex case the eigenvalues must be complex conjugate s.t. $\lambda_1=\overline{\lambda_2}$ – Dominic Michaelis May 15 '14 at 08:45
  • 1
    Have you seen this post? – Norbert May 15 '14 at 09:00
  • @Norbert Yes! It seems useless – Clin May 15 '14 at 09:04
  • @DominicMichaelis en, if A and B commute , then $\det(A^2+AB+B^2)\geq0$ – Clin May 15 '14 at 09:16
  • @Clin yes this is your inequality in the case they commute. I just want to know if there is an easy arguement why this should be true – Dominic Michaelis May 15 '14 at 09:20
  • 2
    @Clin, it is not, see the answer below – Norbert May 15 '14 at 09:51

3 Answers3

7

$\square$ Since for any $2\times 2$ matrix $M$ one has $$2\operatorname{det}M=\left(\operatorname{Tr}M\right)^2-\operatorname{Tr}M^2,\tag{1}$$ the inequality we want to prove is equivalent to \begin{align}\left(\operatorname{Tr}(A^2+B^2+AB)\right)^2&\geq \operatorname{Tr}\left(\left(A^2+B^2+AB\right)^2-\left(AB-BA\right)^2\right)=\\ &=\operatorname{Tr}\left(A^4+B^4-ABAB+2A^3B+2AB^3+4A^2B^2\right). \tag{2}\end{align} On the other hand, using (1) to rewrite the inequality proved here (mentioned in the comments) and replacing therein $B\rightarrow -B$, we obtain exactly the same inequality (2). $\blacksquare$

Community
  • 1
Start wearing purple
  • 53,234
  • 13
  • 164
  • 223
4

As invertible matrices are dense in the matrix space, we may assume that $A$ is invertible. Left- and right- multiply both sides by $\det(A^{-1})$, the inequality in question becomes $$\det(I + BA^{-1} + A^{-1}B\,BA^{-1}) \ge \det(BA^{-1} - A^{-1}B).\tag{1}$$ So, it suffices to prove that $$\det(I + X + YX) \ge \det(X-Y)\tag{2}$$ for any invertible $X,Y$ that are similar to each other. Let $X=kI+X_0$ and $Y=kI+Y_0$, where $X_0$ and $Y_0$ are two nilpotent matrices. Then $(2)$ can be further rewritten as $$\det\left((1+k+k^2)I + (k+1)X_0 + kY_0 + Y_0X_0\right) \ge \det(X_0-Y_0).\tag{3}$$ If $X_0=Y_0=0$, the inequality is trivial. Suppose $X_0, Y_0$ are nonzero. So, by a change of basis, we may assume that $$ Y_0=\pmatrix{0&1\\ 0&0},\ X_0=\pmatrix{p&-q\\ r&-p}$$ with $qr=p^2$. If one calculates both sides of $(3)$ directly using the entries of $X_0$ and $Y_0$, one will find that the LHS is equal to $(1+k+k^2)^2 + r$ and the RHS is $r$. Now the inequality follows immediately.

user1551
  • 139,064
2

For any two $2\times2$ matrices $A$ and $B$, the following identity holds: $\renewcommand{\tr}{\operatorname{tr}}$ $\renewcommand{\adj}{\operatorname{adj}}$ $$ \det(X+Y) \equiv \det(X) + \det(Y) + \tr(X\adj(Y)).\tag{$\ast$} $$ Therefore, \begin{align} \det(AB-BA) &=2\det(AB) + \tr(AB\adj(-BA))\\ &=2\det(AB) - \tr(AB\adj(A)\adj(B)). \end{align} Write $t=\tr(A\adj(B))=\tr(B\adj(A))$. Then \begin{align} &\det(A^2+AB+B^2)\\ =&\det((A+B)^2 - BA)\\ =&\det((A+B)^2) + \det(-BA) + \tr((A+B)^2\adj(-BA))\quad\text{ by } (\ast)\\ =&\det(A+B)^2 + \det(AB) - \tr((A^2+B^2+AB+BA) \adj(A)\adj(B))\\ =&\det(A+B)^2 + \det(AB) - (\det(A)+\det(B))t - \tr(AB \adj(A)\adj(B)) - 2\det(AB)\\ =&\left(\det(A)+\det(B)+t\right)^2 - 3\det(AB) - (\det(A)+\det(B))t + \det(AB-BA)\\ =&\left(t + \frac{\det(A)+\det(B)}2\right)^2 + \frac34\left(\det(A)-\det(B)\right)^2 + \det(AB-BA)\\ \ge&\det(AB-BA). \end{align}

user1551
  • 139,064