Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2009 / Problems / Day 2, P8

IMC 2009 · Day 2 · P8

hard

Let A,BMn(C)A, B \in M_n(\mathbb{C}) be two n×nn \times n matrices such that A2B+BA2=2ABA.A^2 B + B A^2 = 2 A B A. Prove that there exists a positive integer kk such that (ABBA)k=0(AB - BA)^k = 0.

Solution 1 of 2 (official)

Let us fix the matrix AMn(C)A \in M_n(\mathbb{C}). For every matrix XMn(C)X \in M_n(\mathbb{C}), let ΔX:=AXXA\Delta X := AX - XA. We need to prove that the matrix ΔB\Delta B is nilpotent.

Observe that the condition A2B+BA2=2ABAA^2 B + B A^2 = 2 A B A is equivalent to Δ2B=Δ(ΔB)=0.(1)\tag{1} \Delta^2 B = \Delta(\Delta B) = 0. Δ\Delta is linear; moreover, it is a derivation, i.e. it satisfies the Leibniz rule: Δ(XY)=(ΔX)Y+X(ΔY),X,YMn(C).\Delta(XY) = (\Delta X) Y + X (\Delta Y), \quad \forall X, Y \in M_n(\mathbb{C}). Using induction, one can easily generalize the above formula to kk factors: Δ(X1Xk)=(ΔX1)X2Xk++X1Xj1(ΔXj)Xj+1Xk++X1Xk1ΔXk,(2)\tag{2} \Delta(X_1 \cdots X_k) = (\Delta X_1) X_2 \cdots X_k + \dots + X_1 \cdots X_{j-1} (\Delta X_j) X_{j+1} \cdots X_k + \dots + X_1 \cdots X_{k-1} \Delta X_k, for any matrices X1,X2,,XkMn(C)X_1, X_2, \dots, X_k \in M_n(\mathbb{C}). Using the identities (1) and (2) we obtain the equation for Δk(Bk)\Delta^k(B^k): Δk(Bk)=k!(ΔB)k,kN.(3)\tag{3} \Delta^k(B^k) = k! (\Delta B)^k, \quad \forall k \in \mathbb{N}. By the last equation it is enough to show that Δn(Bn)=0\Delta^n(B^n) = 0.

To prove this, first we observe that equation (3) together with the fact that Δ2B=0\Delta^2 B = 0 implies that Δk+1Bk=0\Delta^{k+1} B^k = 0, for every kNk \in \mathbb{N}. Hence, we have Δk(Bj)=0,k,jN, j<k.(4)\tag{4} \Delta^k(B^j) = 0, \quad \forall k, j \in \mathbb{N},\ j < k. By the Cayley–Hamilton Theorem, there are scalars α0,α1,,αn1C\alpha_0, \alpha_1, \dots, \alpha_{n-1} \in \mathbb{C} such that Bn=α0I+α1B++αn1Bn1,B^n = \alpha_0 I + \alpha_1 B + \dots + \alpha_{n-1} B^{n-1}, which together with (4) implies that ΔnBn=0\Delta^n B^n = 0.

Solution 2 of 2 (official)

Set X=ABBAX = AB - BA. The matrix XX commutes with AA because AXXA=(A2BABA)(ABABA2)=A2B+BA22ABA=0.AX - XA = (A^2 B - ABA) - (ABA - BA^2) = A^2 B + B A^2 - 2 ABA = 0. Hence for any m0m \ge 0 we have Xm+1=Xm(ABBA)=AXmBXmBA.X^{m+1} = X^m (AB - BA) = A X^m B - X^m B A. Take the trace of both sides: trXm+1=trA(XmB)tr(XmB)A=0\operatorname{tr} X^{m+1} = \operatorname{tr} A (X^m B) - \operatorname{tr} (X^m B) A = 0 (since for any matrices UU and VV, we have trUV=trVU\operatorname{tr} UV = \operatorname{tr} VU). As trXm+1\operatorname{tr} X^{m+1} is the sum of the m+1m+1-st powers of the eigenvalues of XX, the values of trX\operatorname{tr} X, …, trXn\operatorname{tr} X^n determine the eigenvalues of XX uniquely, therefore all of these eigenvalues have to be 0. This implies that XX is nilpotent.

How the field did

contestants scored
336
average (of 10)
2.51
solved (≥ 80%)
15.2%
near-0 (≤ 10%)
60.4%
discrimination
0.33

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2006 · Day 1 · P3hardavg 2.5/10 · solved 16% · near-0 64% · disc 0.39
IMC 2007 · Day 2 · P10hardavg 2.2/10 · solved 17% · near-0 72% · disc 0.47
IMC 2012 · Day 1 · P2hardavg 3.5/10 · solved 18% · near-0 24% · disc 0.58
IMC 2000 · Day 2 · P12hardavg 2.5/10 · solved 18% · near-0 68% · disc 0.52