Maths Olympiad Prep

Library / /17 of 23

Algebra Difficulty 6.7 National Olympiad Prove it Romania

a) Let A,BMn(C)A, B \in \mathcal{M}_n(\mathbb{C}) be two matrices such that A2B=AA^2B = A. Prove that
(ABBA)2=On. (AB - BA)^2 = O_n.

b) Show that, for any natural number kn/2k \le n/2, there are two matrices AA, BMn(C)B \in \mathcal{M}_n(\mathbb{C}) with the property A2B=AA^2B = A, such that rank(ABBA)=k\mathrm{rank}(AB - BA) = k.

Solution

a) If AA is invertible or A=OnA = O_n then clearly ABBA=OnAB - BA = O_n. Assume AOnA \ne O_n, with det(A)=0\det(A) = 0. Let PC[X]P \in \mathbb{C}[X] be the minimal polynomial of the matrix AA. Since P(0)=0P(0) = 0 and PXP \ne X, the polynomial PP has the form P=Xk+ak1Xk1++a1XP = X^k + a_{k-1}X^{k-1} + \dots + a_1X, where 2kn2 \le k \le n. From the relation P(A)B=OnP(A)B = O_n and the hypothesis, we obtain
Ak1+ak1Ak2++a2A+a1AB=On.(1) A^{k-1} + a_{k-1}A^{k-2} + \dots + a_2A + a_1AB = O_n. \quad (1)
Since PP is minimal, we have a10a_1 \ne 0 and AB=1a1(Ak1+ak1Ak2++a2A)AB = -\frac{1}{a_1}(A^{k-1} + a_{k-1}A^{k-2} + \dots + a_2A). So ABAB commutes with AA. Therefore A=A2B=A(AB)=ABAA = A^2B = A(AB) = ABA. Then, by multiplying with BABA the relation (1) to the right, we obtain
Ak1+ak1Ak2++a2A+a1AB2A=On.(2) A^{k-1} + a_{k-1}A^{k-2} + \dots + a_2A + a_1AB^2A = O_n. \quad (2)
From (1) and (2) it results a1(AB2AAB)=Ona_1(AB^2A - AB) = O_n. Since a10a_1 \ne 0, we get AB2A=ABAB^2A = AB. Thus, (ABBA)2=(ABA)BAB2AB(A2B)+B(ABA)=ABABBA+BA=On(AB - BA)^2 = (ABA)B - AB^2A - B(A^2B) + B(ABA) = AB - AB - BA + BA = O_n.

Alternative solution.

a) From rank(A)=rank(A2)rank(A2)rank(A)\mathrm{rank}(A) = \mathrm{rank}(A^2) \le \mathrm{rank}(A^2) \le \mathrm{rank}(A), we obtain rank(A)=rank(A2)\mathrm{rank}(A) = \mathrm{rank}(A^2). Denote r=rank(A)r = \mathrm{rank}(A). There are the matrices XMn,r(C)X \in \mathcal{M}_{n,r}(\mathbb{C}) and YMr,n(C)Y \in \mathcal{M}_{r,n}(\mathbb{C}), with rank(X)=rank(Y)=r\mathrm{rank}(X) = \mathrm{rank}(Y) = r, such that A=XYA = XY. We have YXMr(C)YX \in \mathcal{M}_r(\mathbb{C}) and
r=rank(A)=rank(A2)=rank((XY)2)=rank(X(YX)Y)rank(YX). r = \mathrm{rank}(A) = \mathrm{rank}(A^2) = \mathrm{rank}((XY)^2) = \mathrm{rank}(X(YX)Y) \le \mathrm{rank}(YX).
Hence YXYX is an invertible matrix and from the relation A2B=AA^2B = A we find YBX=IrYBX = I_r. Therefore ABA=(XY)B(XY)=X(YBX)Y=XY=AABA = (XY)B(XY) = X(YBX)Y = XY = A. From the relations A2B=AA^2B = A and ABA=AABA = A, we get
(ABBA)2=(AB)2+(BA)2AB2ABA2B=(ABA)B+B(ABA)AB2AB(A2B)=AB+BAAB2ABA=AB(InBA) \begin{aligned} (AB - BA)^2 &= (AB)^2 + (BA)^2 - AB^2A - BA^2B \\ &= (ABA)B + B(ABA) - AB^2A - B(A^2B) \\ &= AB + BA - AB^2A - BA = AB(I_n - BA) \end{aligned}
and
(ABBA)3=AB(InBA)(ABBA)=AB(ABBABA2B+(BA)2)=AB(ABBAB(A2B)+B(ABA))=AB(ABBABA+BA)=AB(ABBA)=(ABA)BAB2A=AB(AB)(BA)=AB(InBA). \begin{aligned} (AB - BA)^3 &= AB(I_n - BA)(AB - BA) \\ &= AB(AB - BA - BA^2B + (BA)^2) \\ &= AB(AB - BA - B(A^2B) + B(ABA)) \\ &= AB(AB - BA - BA + BA) = AB(AB - BA) \\ &= (ABA)B - AB^2A = AB - (AB)(BA) = AB(I_n - BA). \end{aligned}
Thus, (ABBA)3=(ABBA)2(AB - BA)^3 = (AB - BA)^2. It follows that, if λC\lambda \in \mathbb{C} is an eigenvalue of the matrix ABBAAB - BA, then λ3=λ2\lambda^3 = \lambda^2, hence λ{0,1}\lambda \in \{0, 1\}. But Tr(ABBA)=0\text{Tr}(AB - BA) = 0. Then all the eigenvalues of the matrix ABBAAB - BA are 0. Therefore (ABBA)n=On(AB - BA)^n = O_n. From the proved relation (ABBA)3=(ABBA)2(AB - BA)^3 = (AB - BA)^2 we deduce (ABBA)2=On(AB - BA)^2 = O_n.

b) Let us define the matrices A=(OnkOnk,kOk,nkIk)A = \begin{pmatrix} O_{n-k} & O_{n-k,k} \\ O_{k,n-k} & I_k \end{pmatrix}, B=(OnkCOk,nkIk)B = \begin{pmatrix} O_{n-k} & C \\ O_{k,n-k} & I_k \end{pmatrix}, where CMnk,k(C)C \in \mathcal{M}_{n-k,k}(\mathbb{C}) is an arbitrary matrix with rank(C)=knk\mathrm{rank}(C) = k \le n-k (for k=0k=0, we define A=B=OnA = B = O_n). We have A2B=AB=AA^2B = AB = A, BA=BBA = B and ABBA=AB=(OnkCOk,nkOk)AB - BA = A - B = \begin{pmatrix} O_{n-k} & -C \\ O_{k,n-k} & O_k \end{pmatrix}, so rank(ABBA)=k\mathrm{rank}(AB - BA) = k.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.