Matrices of finite order are dense in SO(n)
Statement
Show that the set of all of whose eigenvalues are roots of unity is dense in .
Hint
Use the real normal form of an orthogonal matrix: . Approximate each angle by a rational multiple of .
Show solutionHide solution
Solution
Idea. An orthogonal matrix is a direct sum of plane rotations and identity blocks in a suitable orthonormal basis. The angles are free continuous parameters, so we may replace them by rational multiples of .
Step 1: the normal form. A real orthogonal matrix is normal (), hence unitarily diagonalisable over with eigenvalues of modulus . The real spectral theorem for normal matrices (quoted) gives an orthogonal with
where the blocks correspond to the pairs of non-real eigenvalues and , to the eigenvalues and .
Since , the number of eigenvalues is even. Group them in pairs: a block equals . So, after absorbing them into the rotation blocks, we may assume (this changes but not the form), and
Note that conjugating by any , even with , keeps us inside , because .
Step 2: approximating. Choose rationals with and as , and put
The eigenvalues of are and , all roots of unity. Writing , we get with , so has finite order.
Step 3: convergence. The operator norm is invariant under orthogonal conjugation, and the norm of a block diagonal matrix is the maximum of the norms of the blocks. Hence
Check (numerical). For a random computed with the real Schur form, rounding the two angles to multiples of gave for and .
Remark. The same argument works in : there the normal form has an odd number of eigenvalues , which is kept fixed while the rotation angles are approximated. So the elements of finite order are dense in all of .
Lesson. A normal form with free continuous parameters turns a density question about a group into a density question about (or the torus).