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

IMC / 2006 / Problems / Day 2, P12

IMC 2006 · Day 2 · P12

killer
linear algebraworth 20 pts

Let Ai,Bi,SiA_i, B_i, S_i (i=1,2,3i = 1, 2, 3) be invertible real 2×22 \times 2 matrices such that

(1) not all AiA_i have a common real eigenvector;

(2) Ai=Si1BiSiA_i = S_i^{-1} B_i S_i for all i=1,2,3i = 1, 2, 3;

(3) A1A2A3=B1B2B3=(1001)A_1 A_2 A_3 = B_1 B_2 B_3 = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}.

Prove that there is an invertible real 2×22 \times 2 matrix SS such that Ai=S1BiSA_i = S^{-1} B_i S for all i=1,2,3i = 1, 2, 3.

Solution (official)

We note that the problem is trivial if Aj=λIA_j = \lambda I for some jj, so suppose this is not the case. Consider then first the situation where some AjA_j, say A3A_3, has two distinct real eigenvalues. We may assume that A3=B3=(λμ)A_3 = B_3 = \begin{pmatrix} \lambda & \\ & \mu \end{pmatrix} by conjugating both sides. Let A2=(abcd)A_2 = \begin{pmatrix} a & b \\ c & d \end{pmatrix} and B2=(abcd)B_2 = \begin{pmatrix} a' & b' \\ c' & d' \end{pmatrix}. Then a+d=TrA2=TrB2=a+daλ+dμ=Tr(A2A3)=TrA11=TrB11=Tr(B2B3)=aλ+dμ.\begin{align*} a + d &= \operatorname{Tr} A_2 = \operatorname{Tr} B_2 = a' + d' \\ a \lambda + d \mu &= \operatorname{Tr}(A_2 A_3) = \operatorname{Tr} A_1^{-1} = \operatorname{Tr} B_1^{-1} = \operatorname{Tr}(B_2 B_3) = a' \lambda + d' \mu. \end{align*} Hence a=aa = a' and d=dd = d' and so also bc=bcbc = b'c'. Now we cannot have c=0c = 0 or b=0b = 0, for then (1,0)(1, 0)^\top or (0,1)(0, 1)^\top would be a common eigenvector of all AjA_j. The matrix S=(cc1)S = \begin{pmatrix} \frac{c'}{c} & \\ & 1 \end{pmatrix} conjugates A2=S1B2SA_2 = S^{-1} B_2 S, and as SS commutes with A3=B3A_3 = B_3, it follows that Aj=S1BjSA_j = S^{-1} B_j S for all jj.

If the distinct eigenvalues of A3=B3A_3 = B_3 are not real, we know from above that Aj=S1BjSA_j = S^{-1} B_j S for some SGL2CS \in GL_2 \mathbb{C} unless all AjA_j have a common eigenvector over C\mathbb{C}. Even if they do, say Ajv=λjvA_j v = \lambda_j v, by taking the conjugate square root it follows that AjA_j's can be simultaneously diagonalized. If A2=(ad)A_2 = \begin{pmatrix} a & \\ & d \end{pmatrix} and B2=(abcd)B_2 = \begin{pmatrix} a' & b' \\ c' & d' \end{pmatrix}, it follows as above that a=aa = a', d=dd = d' and so bc=0b' c' = 0. Now B2B_2 and B3B_3 (and hence B1B_1 too) have a common eigenvector over C\mathbb{C} so they too can be simultaneously diagonalized. And so SAj=BjSS A_j = B_j S for some SGL2CS \in GL_2 \mathbb{C} in either case. Let S0=ReSS_0 = \operatorname{Re} S and S1=ImSS_1 = \operatorname{Im} S. By separating the real and imaginary components, we are done if either S0S_0 or S1S_1 is invertible. If not, S0S_0 may be conjugated to some T1S0T=(x0y0)T^{-1} S_0 T = \begin{pmatrix} x & 0 \\ y & 0 \end{pmatrix}, with (x,y)(0,0)(x, y)^\top \ne (0, 0)^\top, and it follows that all AjA_j have a common eigenvector T(0,1)T (0, 1)^\top, a contradiction.

We are left with the case when no AjA_j has distinct eigenvalues; then these eigenvalues by necessity are real. By conjugation and division by scalars we may assume that A3=(1b1)A_3 = \begin{pmatrix} 1 & b \\ & 1 \end{pmatrix} and b0b \ne 0. By further conjugation by upper-triangular matrices (which preserves the shape of A3A_3 up to the value of bb) we can also assume that A2=(0u1v)A_2 = \begin{pmatrix} 0 & u \\ 1 & v \end{pmatrix}. Here v2=Tr2A2=4detA2=4uv^2 = \operatorname{Tr}^2 A_2 = 4 \det A_2 = -4u. Now A1=A31A21=((b+v)/u11/u0)A_1 = A_3^{-1} A_2^{-1} = \begin{pmatrix} -(b+v)/u & 1 \\ 1/u & 0 \end{pmatrix}, and hence (b+v)2/u2=Tr2A1=4detA1=4/u(b+v)^2/u^2 = \operatorname{Tr}^2 A_1 = 4 \det A_1 = -4/u. Comparing these two it follows that b=2vb = -2v.

What we have done is simultaneously reduced all AjA_j to matrices whose all entries depend on uu and vv (=detA2= -\det A_2 and TrA2\operatorname{Tr} A_2, respectively) only, but these themselves are invariant under similarity. So BjB_j's can be simultaneously reduced to the very same matrices.

How the field did

contestants scored
237
average (of 20)
0.09
solved (≥ 80%)
0.4%
near-0 (≤ 10%)
99.2%
discrimination
0.16

Score distribution (field cohort)

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

Similar problems

IMC 2004 · Day 2 · P12killeravg 0.2/10 · solved 1% · near-0 97% · disc 0.13
IMC 2016 · Day 2 · P10killeravg 0.1/10 · solved 1% · near-0 99% · disc 0.16
IMC 2021 · Day 2 · P8killeravg 0.0/10 · solved 0% · near-0 99% · disc 0.08
IMC 2009 · Day 2 · P10killeravg 0.0/10 · solved 0% · near-0 99% · disc 0.19