Maths Olympiad Prep

Library / /28 of 42

Algebra Difficulty 6.6 National olympiad Prove it Romania

Let AMn(C)A \in \mathcal{M}_n(\mathbb{C}) be a matrix with the property AT=AA^T = -A, where ATA^T is the transpose of AA.

a) If AMn(R)A \in \mathcal{M}_n(\mathbb{R}) and A2=OnA^2 = O_n, prove that A=OnA = O_n.

b) If nn is an odd natural number and there is a matrix BMn(C)B \in \mathcal{M}_n(\mathbb{C}) such that AA is the adjoint of BB, prove that A2=OnA^2 = O_n.

Solution

a) Assume A=(aij)1i,jnA = (a_{ij})_{1 \le i,j \le n} and A2=(mij)1i,jnA^2 = (m_{ij})_{1 \le i,j \le n}. The property AT=AA^T = -A leads to the relations aji=aija_{ji} = -a_{ij}, for i,j=1,,ni, j = 1, \dots, n, that is AA is antisymmetric. Then
mii=j=1naijaji=j=1naij2,i=1,,n. m_{ii} = \sum_{j=1}^{n} a_{ij} a_{ji} = - \sum_{j=1}^{n} a_{ij}^2, \quad i = 1, \dots, n.
If A2=OnA^2 = O_n, then mii=0m_{ii} = 0, i=1,,ni = 1, \dots, n. Since AMn(R)A \in \mathcal{M}_n(\mathbb{R}), we obtain aij=0a_{ij} = 0, for i,j=1,,ni, j = 1, \dots, n. So A=OnA = O_n.

b) From the assumption, A=BA = B^*, where BB^* is the adjoint of BB. Since nn is an odd integer number, we obtain det(A)=det(AT)=det(A)=(1)ndet(A)=det(A)\det(A) = \det(A^T) = \det(-A) = (-1)^n \det(A) = -\det(A). Then we obtain det(A)=0\det(A) = 0. Therefore det(BB)=det(B)det(B)=det(B)det(A)=0\det(BB^*) = \det(B) \cdot \det(B^*) = \det(B) \cdot \det(A) = 0. From the relation BB=det(B)InBB^* = \det(B)I_n, we get det(B)=0\det(B) = 0. Hence \rank(B)n1\rank(B) \le n-1 and BB=OnBB^* = O_n.

Case 1. If \rank(B)n2\rank(B) \le n-2, then B=OnB^* = O_n. Thus, A2=(B)2=OnA^2 = (B^*)^2 = O_n.

Case 2. If \rank(B)=n1\rank(B) = n-1, then BOnB^* \ne O_n. From the Sylvester rank inequality, we have \rank(B)\rank(BB)+n\rank(B)=1\rank(B^*) \le \rank(BB^*) + n - \rank(B) = 1. We conclude \rank(B)=1\rank(B^*) = 1 and (B)2=\tr(B)B(B^*)^2 = \tr(B^*)B^*. But \tr(B)=\tr(A)=0\tr(B^*) = \tr(A) = 0 because aii=aiia_{ii} = -a_{ii}, i=1,2,,ni = 1, 2, \dots, n. Finally, we get A2=(B)2=OnA^2 = (B^*)^2 = O_n.

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 and solution reproduced as published; topic and difficulty added by this site.