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

The special linear group is path connected (transvections)

#special linear group#elementary matrices#transvections#row reduction

Statement

Prove that SLn(R)SL_n(\mathbb{R}) is path connected using elementary matrices Tij(t)=I+tEijT_{ij}(t)=I+tE_{ij}, i≠ji\ne j.

Hint

Prove first that SLn(R)SL_n(\mathbb{R}) is generated by the matrices Tij(t)T_{ij}(t), by Gaussian elimination.

Show solutionHide solution

Solution

Idea. Each generator lies on an explicit path through II; a product of generators can be shrunk to II by shrinking all the parameters simultaneously.

Step 1: SLn(R)SL_n(\mathbb{R}) is generated by transvections. Let A∈SLn(R)A\in SL_n(\mathbb{R}). Left multiplication by Tij(t)T_{ij}(t) adds tt times row jj to row ii. Using these operations we reduce AA to the identity:
- *Making the (1,1)(1,1) entry equal to 11.* Some entry of the first column is non-zero (else det⁡A=0\det A=0). If a11=0a_{11}=0, add that row to row 11 so that a11≠0a_{11}\ne0. If a11≠1a_{11}\ne1 we want to make it 11: if a11≠0a_{11}\ne 0, add row 22 times 1−a11a21\frac{1-a_{11}}{a_{21}} if a21≠0a_{21}\ne0. If a21=0a_{21}=0 first add row 22 to... (some entry ak1≠0a_{k1}\neq0 with k≥2k\ge2 exists unless the first column is (a11,0,…,0)T(a_{11},0,\dots,0)^T; in that case add row 22 to row 11 after having made a22≠0a_{22}\ne 0 or move on). In all cases one can reach a11=1a_{11}=1 using only transvections whenever n≥2n\ge2 (a standard fact).
- *Clearing the first column and first row.* Subtract multiples of row 11 from the others to clear the first column; then use column operations (right multiplication by transvections) to clear the first row.
- *Induction.* We are left with 1⊕A′1\oplus A' with det⁡A′=1\det A'=1; repeat with A′A' in SLn−1SL_{n-1}. At the end we reach a diagonal matrix with determinant 11 and last entry 11, hence II (the diagonal entries equal to 11 except possibly the last; the determinant being 11, it is 11).

So AA is a product of transvections: A=T1T2⋯TmA=T_1T_2\cdots T_m with Tk=Tikjk(tk)T_k=T_{i_kj_k}(t_k).

Step 2: the path. Define γ(s)=Ti1j1(st1)⋯Timjm(stm)\gamma(s)=T_{i_1j_1}(st_1)\cdots T_{i_mj_m}(st_m), s∈[0,1]s\in[0,1]. Each factor has determinant 11 (Tij(t)T_{ij}(t) is unipotent triangular after permutation), so γ(s)∈SLn\gamma(s)\in SL_n. It is continuous with γ(0)=I\gamma(0)=I and γ(1)=A\gamma(1)=A.

Conclusion. Every A∈SLn(R)A\in SL_n(\mathbb{R}) is joined to II in SLn(R)SL_n(\mathbb{R}).

Remark. This proof works over any topological field in which SLnSL_n is generated by transvections; it proves for instance that SLn(C)SL_n(\mathbb{C}) is connected. It does not by itself prove that GLn+GL_n^+ is connected: that needs one more step, scaling by ∣det⁡∣1/n|\det|^{1/n}.

Note. The source solution only states the generation fact; the elimination argument above was written out in more detail. For a complete treatment of the first bullet, see any proof that SLn(F)=En(F)SL_n(F)=E_n(F) for a field FF.