uniolympiads Ελληνικά

IMC 1996, Day 1, Problem 3

The linear operator AA on the vector space VV is called an involution if A2=EA^2 = E where EE is the identity operator on VV. Let dim⁡V=n<∞\dim V = n < \infty.

(i) Prove that for every involution AA on VV there exists a basis of VV consisting of eigenvectors of AA.

(ii) Find the maximal number of distinct pairwise commuting involutions on VV.

Original from the official PDF(15 points) The linear operator A on the vector space V is called an involution if A 2 = E where E is the identity operator on V . Let dim V = n < ∞. (i) Prove that for every involution A on V there exists a basis of V consisting of eigenvectors of A. (ii) Find the maximal number of distinct pairwise commuting involutions on V .

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.

(i) Let B=12(A+E)B = \dfrac12 (A + E). Then

B2=14(A2+2AE+E)=14(2AE+2E)=12(A+E)=B.B^2 = \frac14 (A^2 + 2AE + E) = \frac14 (2AE + 2E) = \frac12 (A + E) = B.

Hence BB is a projection. Thus there exists a basis of eigenvectors for BB, and the matrix of BB in this basis is of the form diag⁡(1,…,1,0,…,0)\operatorname{diag}(1, \dots, 1, 0, \dots, 0).

Since A=2B−EA = 2B - E the eigenvalues of AA are ±1\pm 1 only.

(ii) Let {Ai:i∈I}\{A_i : i \in I\} be a set of commuting diagonalizable operators on VV, and let A1A_1 be one of these operators. Choose an eigenvalue λ\lambda of A1A_1 and denote Vλ={v∈V:A1v=λv}V_\lambda = \{v \in V : A_1 v = \lambda v\}. Then VλV_\lambda is a subspace of VV, and since A1Ai=AiA1A_1 A_i = A_i A_1 for each i∈Ii \in I we obtain that VλV_\lambda is invariant under each AiA_i. If Vλ=VV_\lambda = V then A1A_1 is either EE or −E-E, and we can start with another operator AiA_i. If Vλ≠VV_\lambda \neq V we proceed by induction on dim⁡V\dim V in order to find a common eigenvector for all AiA_i. Therefore {Ai:i∈I}\{A_i : i \in I\} are simultaneously diagonalizable.

If they are involutions then ∣I∣≤2n|I| \leq 2^n since the diagonal entries may equal 1 or -1 only.

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