Maths Olympiad Prep

Track / Stage 6 / 298 of 400 #1938 of 2604

Problem 1938

National Olympiad, first round
Algebra Difficulty 6.6 Prove it Romanian Mathematical Olympiad · Romania

Let A∈Mn(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 A∈Mn(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 B∈Mn(C)B \in \mathcal{M}_n(\mathbb{C}) such that AA is the adjoint of BB, prove that A2=OnA^2 = O_n.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

a) Assume A=(aij)1≤i,j≤nA = (a_{ij})_{1 \le i,j \le n} and A2=(mij)1≤i,j≤nA^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 A∈Mn(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=B∗A = B^*, where B∗B^* 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 (B) n-1\text{(B) n-1} and BB∗=OnBB^* = O_n.

Case 1. If (B) n-2\text{(B) n-2}, then B∗=OnB^* = O_n. Thus, A2=(B∗)2=OnA^2 = (B^*)^2 = O_n.

Case 2. If (B) = n-1\text{(B) = n-1}, then B∗≠OnB^* \ne O_n. From the Sylvester rank inequality, we have (B *) (BB *) + n - (B) = 1\text{(B *) (BB *) + n - (B) = 1}. We conclude (B *) = 1\text{(B *) = 1} and (B *) 2 = (B *)B *\text{(B *) 2 = (B *)B *}. But (B *) = (A) = 0\text{(B *) = (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.

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