uniolympiads Ελληνικά

IMC 2005, Day 2, Problem 3

In the linear space of all real n×nn \times n matrices, find the maximum possible dimension of a linear subspace VV such that

∀X,Y∈Vtrace⁡(XY)=0.\forall X, Y \in V \quad \operatorname{trace}(XY) = 0.

(The trace of a matrix is the sum of the diagonal entries.)

Original from the official PDFIn the linear space of all real n × n matrices, find the maximum possible dimension of a linear subspace V such that ∀X, Y ∈ V trace(XY ) = 0. (The trace of a matrix is the sum of the diagonal entries.)

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

Solution. If AA is a nonzero symmetric matrix, then trace⁡(A2)=trace⁡(AtA)\operatorname{trace}(A^2)=\operatorname{trace}(A^tA) is the sum of the squared entries of AA which is positive. So VV cannot contain any symmetric matrix but 0.

Denote by SS the linear space of all real n×nn\times n symmetric matrices; dim⁡V=n(n+1)2\dim V=\frac{n(n+1)}{2}. Since V∩S={0}V\cap S=\{0\}, we have dim⁡V+dim⁡S≤n2\dim V+\dim S\le n^2 and thus dim⁡V≤n2−n(n+1)2=n(n−1)2\dim V\le n^2-\frac{n(n+1)}{2}=\frac{n(n-1)}{2}.

The space of strictly upper triangular matrices has dimension n(n−1)2\frac{n(n-1)}{2} and satisfies the condition of the problem.

Therefore the maximum dimension of VV is n(n−1)2\frac{n(n-1)}{2}.

Transcribed from the official solutions, page 2. 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?