Maths WorkshopMaths problems with full solutions
Exercise 1439Topology › Topology of Mn(ℝ) › ConnectednessL2Added 7 Nov 2026

Components of the sets of idempotents and involutions

#idempotent#involution#trace#rank#conjugacy orbits

Statement

Show that {P∈Mn(R):P2=P}\{P\in M_n(\mathbb{R}):P^2=P\} has exactly n+1n+1 connected components (indexed by the rank) and that {A∈Mn(R):A2=I}\{A\in M_n(\mathbb{R}):A^2=I\} has exactly n+1n+1 components (indexed by the trace).

Hint

Rank and trace are *integer-valued* continuous invariants on these sets. Then show that each fibre is a single orbit connected through GLn+GL_n^+.

Show solutionHide solution

Solution

Part 1: idempotents.

*Step 1: rank = trace.* If P2=PP^2=P, then PP is conjugate to Ek=diag⁡(Ik,0)E_k=\operatorname{diag}(I_k,0) with k=rank⁡Pk=\operatorname{rank}P (Problem 15), so tr⁡P=k\operatorname{tr}P=k. On the set P\mathcal{P} of idempotents, tr⁡\operatorname{tr} is continuous and integer-valued with values in {0,…,n}\{0,\dots,n\}.

*Step 2: the pieces are clopen.* Pk=P∩tr⁡−1({k})\mathcal{P}_k=\mathcal{P}\cap\operatorname{tr}^{-1}(\{k\}) is closed and open in P\mathcal{P} (as the preimage of an isolated value under a continuous map to Z\mathbb{Z}), and P=⨆k=0nPk\mathcal{P}=\bigsqcup_{k=0}^n\mathcal{P}_k, all non-empty.

*Step 3: each piece is connected.* P0={0}\mathcal{P}_0=\{0\}, Pn={I}\mathcal{P}_n=\{I\}, and for 0<k<n0<k<n, Pk\mathcal{P}_k is path connected (Problem 15).

Hence P\mathcal{P} has exactly n+1n+1 components.

Part 2: involutions.

*Step 1: diagonalisation.* If A2=IA^2=I the minimal polynomial divides x2−1=(x−1)(x+1)x^2-1=(x-1)(x+1), which has simple real roots, so AA is diagonalisable over R\mathbb{R} with eigenvalues ±1\pm1. If pp is the multiplicity of +1+1, AA is conjugate to Fp=diag⁡(Ip,−In−p)F_p=\operatorname{diag}(I_p,-I_{n-p}) and tr⁡A=2p−n\operatorname{tr}A=2p-n. So tr⁡\operatorname{tr} takes the n+1n+1 values −n,−n+2,…,n-n,-n+2,\dots,n on I={A2=I}\mathcal{I}=\{A^2=I\}, and as above the n+1n+1 pieces Ip={A∈I:tr⁡A=2p−n}\mathcal{I}_p=\{A\in\mathcal{I}:\operatorname{tr}A=2p-n\} are clopen in I\mathcal{I}.

*Step 2: each piece is connected.* I0={−I}\mathcal{I}_0=\{-I\} and In={I}\mathcal{I}_n=\{I\}. For 0<p<n0<p<n, Ip={QFpQ−1:Q∈GLn}\mathcal{I}_p=\{QF_pQ^{-1}:Q\in GL_n\}. The matrix D=diag⁡(−1,1,…,1)D=\operatorname{diag}(-1,1,\dots,1) is diagonal so it commutes with FpF_p, and det⁡D=−1\det D=-1. As in Problem 15, replacing QQ by QDQD we may take det⁡Q>0\det Q>0. So Ip\mathcal{I}_p is the continuous image of the path connected GLn+GL_n^+.

Therefore I\mathcal{I} has exactly n+1n+1 components.

Remark. In both cases the invariant (rank, resp. trace) is *discrete*, which is what splits the sets into pieces; the dimension of Pk\mathcal{P}_k is 2k(n−k)2k(n-k), and of Ip\mathcal{I}_p also 2p(n−p)2p(n-p).