Idea. Any rotation is a product of commuting rotations in orthogonal planes, and each can be "turned back" to the identity continuously.
Step 1: normal form. Let U∈O(n). Then there are Q∈O(n) and angles θ1,…,θp∈(0,π) such that
U=Qdiag(R(θ1),…,R(θp),Ia,−Ib)QT,R(θ)=(cosθsinθ−sinθcosθ),
with 2p+a+b=n. (Derivation: U is a normal matrix, so it is unitarily diagonalisable over C with eigenvalues of modulus 1. Real eigenvalues are ±1 and non-real ones come in conjugate pairs e±iθ. For an eigenvector v=x+iy of eiθ, the real vectors x,y span a U-invariant plane on which U acts as a rotation by θ, in an orthonormal basis of that plane. Eigenspaces for distinct eigenvalues are orthogonal, which gives an orthonormal basis of Rn.)
Step 2: for U∈SO(n), the multiplicity b of −1 is even. detU=detR(θ1)⋯detR(θp)⋅1a(−1)b=(−1)b, because each detR(θj)=1. So detU=1 forces b even, say b=2m.
Step 3: write −I2m as rotations. −I2=R(π), so −I2m=diag(R(π),…,R(π)). We obtain U=QBQT with
B=diag(R(θ1),…,R(θp),R(π),…,R(π),Ia)=diag(R(φ1),…,R(φq),Ia),q=p+m.
Step 4: the path. Let Bt=diag(R(tφ1),…,R(tφq),Ia), t∈[0,1]. It is continuous in t, Bt is orthogonal with detBt=1, B0=I and B1=B. Then
γ(t)=QBtQT
is a continuous path from I to U. It stays in SO(n): γ(t) is orthogonal and detγ(t)=detBt=1. (Note that Q∈O(n) may have determinant −1; conjugation does not change the determinant.)
Conclusion. Every element of SO(n) is joined to I in SO(n), so SO(n) is path connected.
Remark. The proof also shows that exp:so(n)→SO(n) is onto: γ(t)=exp(tX) with X=Qdiag(φ1J,…,φqJ,0)QT, J=(01−10) (Problem 8 of the exponential chapter). Compare with SO(n) being compact and connected.