John Stillwell - Naive Lie Theory.pdf - Index of
John Stillwell - Naive Lie Theory.pdf - Index of
John Stillwell - Naive Lie Theory.pdf - Index of
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
3.2 The orthogonal and special orthogonal groups 53<br />
Thus a final position A <strong>of</strong> R n can be realized by a “rotation” in the<br />
everyday sense <strong>of</strong> the word only if SO(n) is path-connected.<br />
Path-connectedness <strong>of</strong> SO(n). For any n, SO(n) is path-connected.<br />
Pro<strong>of</strong>. For n = 2 we have the circle SO(2), which is obviously pathconnected<br />
(Figure 3.1). Now suppose that SO(n − 1) is path-connected<br />
and that A ∈ SO(n). It suffices to find a path in SO(n) from 1 to A, because<br />
if there are paths from 1 to A and B then there is a path from A to B.<br />
cos θ + isinθ<br />
θ<br />
1<br />
Figure 3.1: Path-connectedness <strong>of</strong> SO(2).<br />
This amounts to finding a continuous motion taking the basis vectors<br />
e 1 ,e 2 ,...,e n to their final positions Ae 1 ,Ae 2 ,...,Ae n (the columns <strong>of</strong> A).<br />
The vectors e 1 and Ae 1 (if distinct) define a plane P, so, by the pathconnectedness<br />
<strong>of</strong> SO(2), we can move e 1 continuously to the position Ae 1<br />
by a rotation R <strong>of</strong> P. It then suffices to continuously move Re 2 ,...,Re n to<br />
Ae 2 ,...,Ae n , respectively, keeping Ae 1 fixed. Notice that<br />
• Re 2 ,...,Re n are all orthogonal to Re 1 = Ae 1 , because e 2 ,...,e n are<br />
all orthogonal to e 1 and R preserves angles.<br />
• Ae 2 ,...,Ae n are all orthogonal to Ae 1 , because e 2 ,...,e n are all orthogonal<br />
to e 1 and A preserves angles.<br />
Thus the required motion can take place in the R n−1 <strong>of</strong> vectors orthogonal<br />
to Ae 1 , where it exists by the assumption that SO(n−1) is path-connected.<br />
Performing the two motions in succession—taking e 1 to Ae 1 and then<br />
Re 2 ,...,Re n to Ae 2 ,...,Ae n —gives a path from 1 to A in SO(n). □<br />
The idea <strong>of</strong> path-connectedness will be explored further in Sections 3.8<br />
and 8.6. In the meantime, the idea <strong>of</strong> continuous path is used informally in