Maths Olympiad Prep

Library / /43 of 43

Algebra Difficulty 8.4 Shortlist Find the answer

Determine all rational numbers aa for which the matrix (aa10aa0110aa01aa)\left(\begin{array}{cccc} a & -a & -1 & 0 \\ a & -a & 0 & -1 \\ 1 & 0 & a & -a \\ 0 & 1 & a & -a \end{array}\right) is the square of a matrix with all rational entries.

A number or a short expression. Spacing and $ signs are ignored.

Solution

We will show that the only such number is a=0a=0. Let A=(aa10aa0110aa01aa)A=\left(\begin{array}{cccc} a & -a & -1 & 0 \\ a & -a & 0 & -1 \\ 1 & 0 & a & -a \\ 0 & 1 & a & -a \end{array}\right) and suppose that A=B2A=B^{2}. It is easy to compute the characteristic polynomial of AA, which is pA(x)=det(AxI)=(x2+1)2p_{A}(x)=\operatorname{det}(A-x I)=\left(x^{2}+1\right)^{2}. By the Cayley-Hamilton theorem we have pA(B2)=pA(A)=0p_{A}\left(B^{2}\right)=p_{A}(A)=0. Let μB(x)\mu_{B}(x) be the minimal polynomial of BB. The minimal polynomial divides all polynomials that vanish at BB; in particular μB(x)\mu_{B}(x) must be a divisor of the polynomial pA(x2)=(x4+1)2p_{A}\left(x^{2}\right)=\left(x^{4}+1\right)^{2}. The polynomial μB(x)\mu_{B}(x) has rational coefficients and degree at most 4. On the other hand, the polynomial x4+1x^{4}+1, being the 8th cyclotomic polynomial, is irreducible in Q[x]\mathbb{Q}[x]. Hence the only possibility for μB\mu_{B} is μB(x)=x4+1\mu_{B}(x)=x^{4}+1. Therefore, A2+I=μB(B)=0A^{2}+I=\mu_{B}(B)=0. Since we have A2+I=(002a2a002a2a2a2a002a2a00)A^{2}+I=\left(\begin{array}{cccc} 0 & 0 & -2 a & 2 a \\ 0 & 0 & -2 a & 2 a \\ 2 a & -2 a & 0 & 0 \\ 2 a & -2 a & 0 & 0 \end{array}\right) the relation forces a=0a=0. In case a=0a=0 we have A=(0010000110000100)=(0001100001000010)2A=\left(\begin{array}{cccc} 0 & 0 & -1 & 0 \\ 0 & 0 & 0 & -1 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{array}\right)=\left(\begin{array}{cccc} 0 & 0 & 0 & -1 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \end{array}\right)^{2} hence a=0a=0 satisfies the condition.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.