uniolympiads Ελληνικά

IMC 2019, Day 2, Problem 9

Determine all positive integers nn for which there exist n×nn \times n real invertible matrices AA and BB that satisfy AB−BA=B2AAB - BA = B^2A.

Original from the official PDFDetermine all positive integers n for which there exist n × n real invertible matrices A and B that satisfy AB − BA = B 2 A. Problem 9.

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 Karen Keryan, Yerevan State University & American University of Armenia, Yerevan

Solution. We prove that there exist such matrices AA and BB inf and only if nn is even.

I. Assume that nn is odd and some invertible n×nn\times n matrices A,BA, B satisfy AB−BA=B2AAB - BA = B^2A. Hence B=A−1(B2+B)AB = A^{-1}(B^2 + B)A, so the matrices BB and B2+BB^2 + B are similar and therefore have the same eigenvalues. Since nn is odd, the matrix BB has a real eigenvalue, denote it by λ1\lambda_1. Therefore λ2:=λ12+λ1\lambda_2 := \lambda_1^2 + \lambda_1 is an eigenvalue of B2+BB^2 + B, hence an eigenvalue of BB. Similarly, λ3:=λ22+λ2\lambda_3 := \lambda_2^2 + \lambda_2 is an eigenvalue of B2+BB^2 + B, hence an eigenvalue of BB. Repeating this process and taking into account that the number of eigenvalues of BB is finite we will get there exist numbers k≤lk \le l so that λl+1=λk\lambda_{l+1} = \lambda_k. Hence

λk+1=λk2+λkλk+2=λk+12+λk+1⋯⋯⋯λl=λl−12+λl−1λk=λl2+λl.\begin{aligned} \lambda_{k+1} &= \lambda_k^2 + \lambda_k \\ \lambda_{k+2} &= \lambda_{k+1}^2 + \lambda_{k+1} \\ &\cdots\cdots\cdots \\ \lambda_l &= \lambda_{l-1}^2 + \lambda_{l-1} \\ \lambda_k &= \lambda_l^2 + \lambda_l. \end{aligned}

Adding this equations we get λk2+λk+12+…+λl2=0\lambda_k^2 + \lambda_{k+1}^2 + \ldots + \lambda_l^2 = 0. Taking into account that all λi\lambda_i's are real (as λ1\lambda_1 is real), we have λk=…=λl=0\lambda_k = \ldots = \lambda_l = 0, which implies that BB is not invertible, contradiction.

II. Now we construct such matrices A,BA, B for even nn. Let A2=[0110]A_2 = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} and B2=[−11−1−1]B_2 = \begin{bmatrix} -1 & 1 \\ -1 & -1 \end{bmatrix}. It is easy to check that the matrices A2,B2A_2, B_2 are invertible and satisfy the condition. For n=2kn = 2k the n×nn\times n block matrices

A=[A20…00A2…0⋮⋮⋱⋮00…A2],B=[B20…00B2…0⋮⋮⋱⋮00…B2]A = \begin{bmatrix} A_2 & 0 & \ldots & 0 \\ 0 & A_2 & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & A_2 \end{bmatrix}, \quad B = \begin{bmatrix} B_2 & 0 & \ldots & 0 \\ 0 & B_2 & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & B_2 \end{bmatrix}
are also invertible and satisfy the condition.

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?