Maths Olympiad Prep

Track / Stage 8 / 6 of 180 #1706 of 1964

Problem 1706

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.0 Prove it

Let A∈Mn(R∗)A\in \mathcal{M}_n(\mathbb{R}^*). If A⋅ tA=InA\cdot\ ^t A=I_n, prove that:

a)∣Tr(A)∣≤n|\text{Tr}(A)|\le n;

b)If nn is odd, then det⁡(A2−In)=0\det(A^2-I_n)=0.

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

### Part (a)
1. Given that A∈Mn(R∗) A \in \mathcal{M}_n(\mathbb{R}^*) and A⋅AT=In A \cdot A^T = I_n , we know that A A is an orthogonal matrix.
2. The eigenvalues of an orthogonal matrix A A lie on the unit circle in the complex plane, meaning if λi \lambda_i is an eigenvalue of A A , then ∣λi∣=1 |\lambda_i| = 1 .
3. The trace of A A , denoted Tr(A) \text{Tr}(A) , is the sum of its eigenvalues: Tr(A)=∑i=1nλi \text{Tr}(A) = \sum_{i=1}^n \lambda_i .
4. Using the triangle inequality, we have:
∣Tr(A)∣=∣∑i=1nλi∣≤∑i=1n∣λi∣=∑i=1n1=n. |\text{Tr}(A)| = \left| \sum_{i=1}^n \lambda_i \right| \leq \sum_{i=1}^n |\lambda_i| = \sum_{i=1}^n 1 = n.
5. Therefore, we conclude that:
∣Tr(A)∣≤n. |\text{Tr}(A)| \leq n.

### Part (b)
1. Given that n n is odd, we need to show that det⁡(A2−In)=0 \det(A^2 - I_n) = 0 .
2. Since A A is orthogonal, its eigenvalues λi \lambda_i satisfy ∣λi∣=1 |\lambda_i| = 1 . Therefore, the eigenvalues of A A are either 1 1 , −1 -1 , or complex numbers of unit modulus.
3. For an orthogonal matrix A A with odd dimension n n , there must be at least one real eigenvalue. This is because the complex eigenvalues of A A come in conjugate pairs, and since n n is odd, there must be an unpaired eigenvalue which must be real.
4. The real eigenvalues of A A can only be 1 1 or −1 -1 because ∣λi∣=1 |\lambda_i| = 1 .
5. Therefore, A A must have at least one eigenvalue equal to 1 1 or −1 -1 .
6. If λ=1 \lambda = 1 is an eigenvalue of A A , then λ2−1=0 \lambda^2 - 1 = 0 . Similarly, if λ=−1 \lambda = -1 is an eigenvalue of A A , then λ2−1=0 \lambda^2 - 1 = 0 .
7. This implies that A2−In A^2 - I_n has at least one zero eigenvalue, making det⁡(A2−In)=0 \det(A^2 - I_n) = 0 .

Proof 1:
1. Since n n is odd, A A must have at least one real eigenvalue, which is either 1 1 or −1 -1 .
2. Therefore, at least one of the matrices A−I A - I or A+I A + I is singular.
3. We observe that:
det⁡(A2−I)=det⁡((A−I)(A+I)). \det(A^2 - I) = \det((A - I)(A + I)).
4. Since at least one of A−I A - I or A+I A + I is singular, their product is also singular, implying:
det⁡(A2−I)=0. \det(A^2 - I) = 0.

Proof 2:
1. We start with:
det⁡(A2−I)=det⁡((A−I)(A+I)). \det(A^2 - I) = \det((A - I)(A + I)).
2. Using the property of determinants and the fact that A A is orthogonal (AT=A−1 A^T = A^{-1} ), we have:
det⁡(A2−I)=det⁡(A−I)⋅det⁡(A+I). \det(A^2 - I) = \det(A - I) \cdot \det(A + I).
3. Since A A is orthogonal, AT=A−1 A^T = A^{-1} , and thus:
det⁡(A+I)=det⁡(AT+I)=det⁡(I+A−AT−I)=det⁡(A−AT). \det(A + I) = \det(A^T + I) = \det(I + A - A^T - I) = \det(A - A^T).
4. On one hand, det⁡(A−AT)=det⁡(AT−A) \det(A - A^T) = \det(A^T - A) .
5. On the other hand, since det⁡(A−AT)=(−1)ndet⁡(AT−A) \det(A - A^T) = (-1)^n \det(A^T - A) and n n is odd, we have:
det⁡(A−AT)=−det⁡(AT−A). \det(A - A^T) = -\det(A^T - A).
6. This implies:
det⁡(A−AT)=0. \det(A - A^T) = 0.
7. Therefore, we conclude that:
det⁡(A2−I)=0. \det(A^2 - I) = 0.

The final answer is ∣Tr(A)∣≤n \boxed{ |\text{Tr}(A)| \le n } and det⁡(A2−In)=0 \det(A^2 - I_n) = 0 if n n is odd.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.