uniolympiads Ελληνικά

IMC 2022, Day 1, Problem 2

Let nn be a positive integer. Find all n×nn \times n real matrices AA with only real eigenvalues satisfying

A+Ak=ATA + A^k = A^T

for some integer k≥nk \ge n. (ATA^T denotes the transpose of AA.)

Original from the official PDFLet n be a positive integer. Find all n×n real matrices A with only real eigenvalues satisfying A + A k = A T for some integer k ≥ n. (A T denotes the transpose of A.)

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

(proposed by Camille Mau, Nanyang Technological University)

Hint: Consider the eigenvalues of AA.

Solution 1. Taking the transpose of the matrix equation and substituting we have

AT+(AT)k=A  ⟹  A+Ak+(A+Ak)k=A  ⟹  Ak(I+(I+Ak−1)k)=0.A^T + (A^T)^k = A \implies A + A^k + (A+A^k)^k = A \implies A^k(I + (I + A^{k-1})^k) = 0.

Hence p(x)=xk(1+(1+xk−1)k)p(x) = x^k(1+(1+x^{k-1})^k) is an annihilating polynomial for AA. It follows that all eigenvalues of AA must occur as roots of pp (possibly with different multiplicities). Note that for all x∈Rx \in \mathbb{R} (this can be seen by considering even/odd cases on kk),

(1+xk−1)k≥0,(1+x^{k-1})^k \ge 0,
and we conclude that the only eigenvalue of AA is 00 with multiplicity nn.

Thus AA is nilpotent, and since AA is n×nn \times n, An=0A^n = 0. It follows Ak=0A^k = 0, and A=ATA = A^T. Hence AA can only be the zero matrix: AA is real symmetric and so is orthogonally diagonalizable, and all its eigenvalues are 00.

Remark. It's fairly easy to prove that eigenvalues must occur as roots of any annihilating polynomial. If λ\lambda is an eigenvalue and vv an associated eigenvector, then f(A)v=f(λ)vf(A)v = f(\lambda)v. If ff annihilates AA, then f(λ)v=0f(\lambda)v = 0, and since v≠0v \ne 0, f(λ)=0f(\lambda) = 0.

Solution 2. If λ\lambda is an eigenvalue of AA, then λ+λk\lambda + \lambda^k is an eigenvalue of AT=A+AkA^T = A + A^k, thus of AA too. Now, if kk is odd, then taking λ\lambda with maximal absolute value we get a contradiction unless all eigenvalues are 00. If kk is even, the same contradiction is obtained by comparing the traces of ATA^T and A+AkA + A^k.

Hence all eigenvalues are zero and AA is nilpotent. The hypothesis that k≥nk \ge n ensures A=ATA = A^T. A nilpotent self-adjoint operator is diagonalizable and is necessarily zero.

Transcribed from the official solutions, pages 2–3. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?