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

IMC / 2026 / Problems / Day 2, P8

IMC 2026 · Day 2 · P8

Let n5n \geq 5, and suppose that A=(aij)A = \left( a_{i j} \right) is a real symmetric n×nn \times n matrix such that aii=0andaij{1,1} for ij.a_{i i} = 0 \quad \text{and} \quad a_{i j} \in \{-1, 1\} \text{ for } i \neq j. Assume that the scalar products of any two distinct rows of AA have the same value. Let λ1,,λn\lambda_{1}, \ldots, \lambda_{n} be the eigenvalues of AA. Prove that i=1nλi2n2\sum_{i=1}^{n} \left| \lambda_{i} \right| \geq 2 n - 2 and determine all matrices for which equality holds.

(proposed by Slobodan Filipovski, University of Primorska, Koper)

Solution (official)

Let cc be the common scalar product of any two distinct rows, and let JJ be the all-ones matrix. Since every row has squared norm n1n-1 and every two distinct rows have scalar product cc, we have A2=(n1c)I+cJ.\begin{equation} A^{2} = (n - 1 - c) I + c J. \tag{1} \end{equation}

The eigenvalues of the right-hand side are (n1)(c+1)andn1c(with multiplicity n1).(n-1)(c+1) \quad \text{and} \quad n - 1 - c \quad \text{(with multiplicity } n-1 \text{)}.

Since AA is real symmetric, the matrix A2A^{2} is positive semidefinite. Hence all eigenvalues of A2A^{2} are nonnegative. Thus c1c \geq -1. Also, for iji \neq j, c=k=1naikajk=ki,jaikajkn2,c = \sum_{k=1}^{n} a_{i k} a_{j k} = \sum_{k \neq i, j} a_{i k} a_{j k} \leq n - 2, since the two omitted terms are zero and each remaining term is at most 1. Therefore 1cn2.-1 \leq c \leq n - 2. Since the eigenvalues of A2A^{2} are λ12,,λn2\lambda_{1}^{2}, \ldots, \lambda_{n}^{2}, we obtain i=1nλi=(n1)(c+1)+(n1)n1c.\begin{equation} \sum_{i=1}^{n} \left| \lambda_{i} \right| = \sqrt{(n-1)(c+1)} + (n-1) \sqrt{n - 1 - c}. \tag{2} \end{equation}

The right-hand side of (2) is a concave function of cc on the interval [1,n2][-1, n-2]. Its minimum is therefore attained at an endpoint. At the two endpoints its values are (n1)nand2n2,(n-1) \sqrt{n} \quad \text{and} \quad 2 n - 2, respectively. Since n5n \geq 5, we have (n1)n>2n2(n-1) \sqrt{n} > 2 n - 2, and hence i=1nλi2n2.\sum_{i=1}^{n} \left| \lambda_{i} \right| \geq 2 n - 2.

Equality can occur only for c=n2c = n - 2. By (1), A2=I+(n2)J.\begin{equation} A^{2} = I + (n-2) J. \tag{3} \end{equation} It follows that AA commutes with JJ. Hence A1=r1A \mathbf{1} = r \mathbf{1} for some real number rr, where 1\mathbf{1} is the all-ones vector. Applying (3) to 1\mathbf{1} gives r21=A21=(n1)21,r^{2} \mathbf{1} = A^{2} \mathbf{1} = (n-1)^{2} \mathbf{1}, so r=±(n1)r = \pm (n-1). Since every row contains exactly n1n-1 entries equal to ±1\pm 1, its sum can equal ±(n1)\pm (n-1) only if all off-diagonal entries in that row are equal. Hence every row consists entirely of 1's or entirely of 1-1's. By symmetry, all rows have the same sign, and therefore A=JIorA=IJ.A = J - I \quad \text{or} \quad A = I - J.

Conversely, these two matrices have spectra {n1,1,,1}and{(n1),1,,1},\{ n-1, -1, \ldots, -1 \} \quad \text{and} \quad \{ -(n-1), 1, \ldots, 1 \}, respectively, and in both cases the sum of the absolute values of the eigenvalues is 2n22 n - 2.

Similar problems

IMC 2002 · Day 1 · P6killeravg 0.2/10 · solved 2% · near-0 98% · disc 0.21
IMC 2014 · Day 2 · P7easyavg 7.3/10 · solved 71% · near-0 21% · disc 0.46