Quaternions, O4(R), SO4(R), SO3(R), and Conjugacy Classes of SU2
§ Quaternion Inner Product and {O4(R),SO4(R),SO3(R)}
Let's continue our discussion of the quaternions H=R⊕Ri⊕Rj⊕Rk.
Remark. Think of H as the vector space R4 with the additional operation “multiplying two vectors”.
Theorem. (Commutative Real Parts) For any α,β∈H, we have Re[αβ]=Re[βα].
Proof: Say α=α1+α2i+α3j+α4k and β=β1+β2i+β3j+β4k. Then just compute. ■
Definition (Quaternion Inner Product). Given α=α1+α2i+α3j+α4k and β=β1+β2i+β3j+β4k, their inner product is ⟨α,β⟩:=α1β1+α2β2+α3β3+α4β4=Re[αβ]. (Check these are equivalent!)
So H is a four-dimensional Euclidean space. This yields a stronger sense in which H≅R4. In particular…
Observation. The group of inner-product-preserving linear maps f:H→H is isomorphic to O4(R) via the usual isomorphism H↔R4.
In particular, {1,i,j,k} is an orthonormal basis of H under this inner product.
To classify these “orthogonal” linear maps f:H→H, we'll need to work with H and O4(R) simultaneously!
Theorem. (Quaternions in O4(R)) The only inner-product-preserving linear maps f:H→H are f:x↦αxβ or f:x↦αxβ, for α,β∈H satisfying ∣α∣=∣β∣=1.
Proof: To show the proposed f:x↦αxβ works, it suffices to show f maps {1,i,j,k} to an orthonormal basis.
⟨f(1),f(i)⟩=⟨αβ,αiβ⟩=Re[αβαiβ]=Re[αββ(−i)α]=Re[αα(−i)]=0 since αα∈R.✓
(We use Re[αβ]=Re[βα] a lot here!) Checking f:x↦αxβ works analogously.
To show these f account for all inner-product-preserving linear maps, we'll need the H↔R4 observation.
Claim. All of O4(R) is generated by reflections.
Proof: From Problem Set #6, we know every element in O4(R) is the direct sum of two 2×2 orthogonal submatrices. And 2×2 orthogonal matrices are generated by reflections. □
It remains to prove the following about reflections:
Claim. Every reflection in R4 is of the form fα:x↦−αxα for some ∣α∣=1.
Proof: We claim fα is the reflection sending the basis {α,αi,αj,αk} to {−α,αi,αj,αk}. Indeed,
fα(αi)=−ααiα=−α(−i)αα=αi∣α∣2=αi and fα(α)=−ααα=−∣α∣2α=−α.
So fα is a reflection about the hyperplane perpendicular to α. □
Thus, our proposed maps f:x↦αxβ and f:x↦αxβ include all reflections, which generate O4(R); and they are closed under composition, so they are all of O4(R). ■
Remark. Multiplying by elements of H yields “rotations” of R4, whereas conjugation yields “reflections” of R4.
In summary, recalling that {α∈H:∣α∣=1}≅S3, we have the following description of O4(R).
φ:S3×S3→O4(R) via φ:(α,β)↦{(x↦αxβ)(x↦αxβ)
More specifically, one can restrict the above to describe only maps in SO4(R).
φ:S3×S3→SO4(R) via φ:(α,β)↦(x↦αxβ) with kernel kerφ={±(1,1)}.
This makes sense—conjugations yield “reflections”, which have negative determinant. By corollary…
Theorem. (Describing SO3(R)) All rotations of Ri⊕Rj⊕Rk are f:x↦αxα−1 for α∈H with ∣α∣=1.
Proof: Think of SO3(R) as the subset of SO4(R) that fixes 1. The only maps (x↦αxβ) that fix 1 are those for which αβ=1, or β=α−1. This yields:
φ:S3→SO3(R) via φ:α↦(x↦αxα−1) with kernel ker(φ)={±1}.
And that's what we wanted. ■
This is more of a “real-life” application—it implies the following:
Claim. Three-dimensional rotations are parametrized by S3/{±1}.
Parametrization: For any α∈S3, we have a corresponding α∈H with ∣α∣=1. This yields the H→H map defined via x↦αxα−1. Then taking the (i,j,k) components of this H→H map yields a well-defined R3→R3 map in SO3(R).
Three-dimensional computer graphics use quaternions for this reason!
§ Conjugacy Classes of SU2
Recall from last lecture the following interpretations of SU2.
SU2≅{[α−ββα]:α,β∈C and ∣α∣2+∣β∣2=1}≅{v∈R4:∣v∣=1}≅{α∈H:∣α∣=1}≅S3.
To be more precise about these isomorphisms…
The isomorphism SU2≅{v∈R4:∣v∣=1} is via [α−ββα]↦(Re[α],Im[α],Re[β],Im[β])∈R4.
The isomorphism SU2≅{z∈H:∣z∣=1} is via [α−ββα]↦α+βj∈H.
Since SU2≅S3, the previous section showed SU2/{±1}≅SO3(R); that is, SU2 is a double cover of SO3(R).
Theorem. (Conjugacy Classes of SU2) Two matrices in SU2 are conjugate iff they have the same trace.
Proof: To show conjugates always have the same trace, just recall the identity tr(XY)=tr(YX) and compute:
tr(ABA−1)=tr(A−1AB)=tr(B).
(More strongly: conjugate matrices always have the same spectra because they're a change-of-basis apart!)
For the other direction, pick some constant c, and consider anyA∈SU2 with tr(A)=c. We wish to show that the condition tr(A)=c uniquely determines A up to conjugation in SU2.
By the Spectral Theorem, we have A=MΛM−1 for some diagonal matrix Λ and some M∈U2. Well…
Taking M′:=(detM)1/2M, we see A=M′Λ(M′)−1 for some M′∈SU2.
Furthermore, we have the following constraints on Λ=[λ100λ2].
detA=1⟹λ1λ2=1 and tr(A)=c⟹λ1+λ2=c
Thus, {λ1,λ2} is the set of roots {r1,r2} of X2−cX+1=0. In other words, either Λ=[r100r2] or Λ=[r200r1].
Therefore, anyA∈SU2 with tr(A)=c is conjugate in SU2 to either [r100r2] or [r200r1] for fixed constants {r1,r2}. And these two matrices are conjugates, too (obviously!):
Remark. (Reading Comprehension) In the last step, why did we conjugate by [01−10] instead of [0110]?
§ Geometry of SU2: Latitude and Longitude
Trace in SU2 has a nice analogue in H, which you can check by plain computation:
Theorem. (Redefining Trace) Every A=[α−ββα]∈SU2 yields a γ=α+βj∈H. Then tr(A)=2Re[γ].
This inspires the following geometric description of conjugacy classes in SU2.
The diagram above has the following features:
The space SU2≅{α∈H:∣α∣=1}≅S3 is depicted as the blue surface of a sphere.
Technically speaking, this is wrong! Notably, S3 is the surface of the four-dimensional ball B4. But we can't draw B4, so we'll have to settle for using S2 to visually represent S3.
Conjugacy classes—that is, collections of matrices with the same trace—look like green lines of latitude.
Remark. Keep in mind that everything we say about SU2 applies equally well to the subgroup {α∈H:∣α∣=1} of H. In particular, multiplication in SU2 is isomorphic to multiplication in H.
(Reading Comprehension) Convince yourself that the North Pole is {+I2}, and the South Pole is {−I2}.
(Reading Comprehension) Convince yourself that the remaining conjugacy classes of SU2 are isomorphic to S2.
(Reading Comprehension) Convince yourself that i, j, and k live on the equator of S3.
We've interpreted the lines of latitude—what about the lines of longitude?
The diagram above has the following features:
The red equator meets the orange line of longitude at some point x∈S3 with Re[x]=0. (Or equivalently, A∈SU2 with tr(A)=0.)
The line of longitude is parametrized by {1⋅cosθ+x⋅sinθ∣θ∈[0,2π)}.
Theorem. (Longitudinal Subgroups) For any x∈{α∈H:∣α∣=1} with Re[x]=0, the line of longitude Hx:={1⋅cosθ+x⋅sinθ∣θ∈[0,2π)} is a subgroup of H.
Proof: Both x∈H and i∈H lie on the equator, but the equator is a conjugacy class! So x and i are conjugates:
Hx:={1⋅cosθ+x⋅sinθ∣θ∈[0,2π)} is conjugate to Hi:={1⋅cosθ+i⋅sinθ∣θ∈[0,2π)}
But Hi is obviously a subgroup of H—it's literally just {z∈C:∣z∣=1}. ■
§ Geometry of SU2: Normal Subgroups and Simplicity
One last thing: we'll use the results we've established so far to provide a geometrical proof of the following fact!
Claim. The only normal subgroups of SU2 are {1}, {1,−1}, and SU2.
Say G is a normal subgroup of SU2 that is not either {1} or {1,−1}. We wish to show G=SU2.
We may pick some x∈G such that x∈{1,−1}, marked in the diagram below.
The driving principle behind our proof will be the following fact:
Fact. Since G is normal, it is the union of conjugacy classes of SU2.
Let S be the conjugacy class of x, shown as a green latitudinal line.
Since x∈G, and G is normal, we must also have S⊆G.
By closure of groups, we also have x−1S⊆G, shown in orange.
Every conjugacy class (highlighted in green) that intersects with an element of x−1S must also be in G.
Thus, just from assuming x∈G, we've shown G must also contain the entire region highlighted in green!
Now consider any longitudinal subgroup H of SU2. Since G contains the whole region highlighted in green, G must also contain an entire arc of H. And an arc generates all of H, so H⊆G.
But the longitudinal subgroups of SU2 together cover all of SU2. So G contains all of SU2, done. ■
Remark. By corollary, SO3(R)≅SU2/{±1} is simple.