Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2017 / Problems / Day 2, P8

IMC 2017 · Day 2 · P8

easy

Define the sequence A1,A2,A_1, A_2, \dots of matrices by the following recurrence: A1=(0110),An+1=(AnI2nI2nAn)(n=1,2,)A_1 = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \qquad A_{n+1} = \begin{pmatrix} A_n & I_{2^n} \\ I_{2^n} & A_n \end{pmatrix} \quad (n = 1, 2, \dots) where ImI_m is the m×mm \times m identity matrix.

Prove that AnA_n has n+1n + 1 distinct integer eigenvalues λ0<λ1<<λn\lambda_0 < \lambda_1 < \dots < \lambda_n with multiplicities (n0),(n1),,(nn)\binom{n}{0}, \binom{n}{1}, \dots, \binom{n}{n}, respectively.

(Proposed by Snježana Majstorović, University of J. J. Strossmayer in Osijek, Croatia)

Solution (official)

For each nNn \in \mathbb{N}, matrix AnA_n is symmetric 2n×2n2^n \times 2^n matrix with elements from the set {0,1}\{0, 1\}, so that all elements on the main diagonal are equal to zero. We can write An=I2n1A1+An1I2,(1)\tag{1} A_n = I_{2^{n-1}} \otimes A_1 + A_{n-1} \otimes I_2, where \otimes is binary operation over the space of matrices, defined for arbitrary BRn×pB \in \mathbb{R}^{n \times p} and CRm×sC \in \mathbb{R}^{m \times s} as BC:=(b11Cb12Cb1pCb21Cb22Cb2pCbn1Cb12CbnpC)nm×ps.B \otimes C := \begin{pmatrix} b_{11} C & b_{12} C & \dots & b_{1p} C \\ b_{21} C & b_{22} C & \dots & b_{2p} C \\ \vdots \\ b_{n1} C & b_{12} C & \dots & b_{np} C

\end{pmatrix}_{nm \times ps}. Lemma 1. If BRn×nB \in \mathbb{R}^{n \times n} has eigenvalues λi\lambda_i, i=1,,ni = 1, \dots, n and CRm×mC \in \mathbb{R}^{m \times m} has eigenvalues μj\mu_j, j=1,,mj = 1, \dots, m, then BCB \otimes C has eigenvalues λiμj\lambda_i \mu_j, i=1,,ni = 1, \dots, n, j=1,,mj = 1, \dots, m. If BB and CC are diagonalizable, then ABA \otimes B has eigenvectors yizjy_i \otimes z_j, with (λi,yi)(\lambda_i, y_i) and (μj,zj)(\mu_j, z_j) being eigenpairs of BB and CC, respectively.

Proof 1. Let (λ,y)(\lambda, y) be an eigenpair of BB and (μ,z)(\mu, z) an eigenpar of CC. Then (BC)(yz)=ByCz=λyμz=λμ(yz).(B \otimes C)(y \otimes z) = B y \otimes C z = \lambda y \otimes \mu z = \lambda \mu (y \otimes z).

If we take (λ,y)(\lambda, y) to be an eigenpair of A1A_1 and (μ,z)(\mu, z) to be an eigenpair of An1A_{n-1}, then from (1) and Lemma 1 we get An(zy)=(I2n1A1+An1I2)(zy)=(I2n1A1)(zy)+(An1I2)(zy)=(λ+μ)(zy).\begin{align*} A_n (z \otimes y) &= (I_{2^{n-1}} \otimes A_1 + A_{n-1} \otimes I_2)(z \otimes y) \\ &= (I_{2^{n-1}} \otimes A_1)(z \otimes y) + (A_{n-1} \otimes I_2)(z \otimes y) \\ &= (\lambda + \mu)(z \otimes y). \end{align*} So the entire spectrum of AnA_n can be obtained from eigenvalues of An1A_{n-1} and A1A_1: just sum up each eigenvalue of An1A_{n-1} with each eigenvalue of A1A_1. Since the spectrum of A1A_1 is σ(A1)={1,1}\sigma(A_1) = \{-1, 1\}, we get σ(A2)={1+(1),1+1,1+(1),1+1}={2,0(2),2}σ(A3)={1+(2),1+0,1+0,1+2,1+(2),1+0,1+0,1+2}={3,(1)(3),1(3),3}σ(A4)={1+(3),1+(1(3)),1+1(3),1+3,1+(3),1+(1(3)),1+1(3),1+3}={4,(2)(4),0(3),2(4),4}.\begin{gather*} \sigma(A_2) = \{-1+(-1), -1+1, 1+(-1), 1+1\} = \{-2, 0^{(2)}, 2\} \\ \sigma(A_3) = \{-1+(-2), -1+0, -1+0, -1+2, 1+(-2), 1+0, 1+0, 1+2\} = \{-3, (-1)^{(3)}, 1^{(3)}, 3\} \\ \begin{aligned} \sigma(A_4) &= \{-1+(-3), -1+(-1^{(3)}), -1+1^{(3)}, -1+3, 1+(-3), 1+(-1^{(3)}), 1+1^{(3)}, 1+3\} \\ &= \{-4, (-2)^{(4)}, 0^{(3)}, 2^{(4)}, 4\}.

\end{aligned} \end{gather*} Inductively, AnA_n has n+1n + 1 distinct integer eigenvalues n,n+2,n+4,,n4,n2,n-n, -n+2, -n+4, \dots, n-4, n-2, n with multiplicities (n0),(n1),(n2),,(nn)\binom{n}{0}, \binom{n}{1}, \binom{n}{2}, \dots, \binom{n}{n}, respectively.

How the field did

contestants scored
315
average (of 10)
6.16
solved (≥ 80%)
52.1%
near-0 (≤ 10%)
28.3%
discrimination
0.50

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2024 · Day 2 · P7easyavg 6.7/10 · solved 52% · near-0 16% · disc 0.55
IMC 2021 · Day 2 · P5easyavg 5.8/10 · solved 55% · near-0 31% · disc 0.55
IMC 2007 · Day 1 · P2easyavg 7.0/10 · solved 55% · near-0 7% · disc 0.49
IMC 2016 · Day 1 · P2mediumavg 5.9/10 · solved 48% · near-0 10% · disc 0.52