Optional: Compact connected abelian groups are tori

Compact connected abelian groups are tori

This video is optional.

Proposition:

A path-connected compact abelian matrix group H is a torus (i.e. it's isomorphic to U ( 1 ) n for some n ).

Proof

Since H is abelian, we have exp ( X 1 ) exp ( X 2 ) = exp ( X 1 + X 2 )  for all  X 1 , X 2 𝔥 . Therefore the exponential map is a group homomorphism exp : 𝔥 H where we think of 𝔥 as 𝐑 n with addition.

Here's how the proof will go:

  1. We'll prove that exp is surjective.

  2. The first isomorphism theorem for groups will then show that H = 𝔥 / ker exp .

  3. Then we will identify ker exp 𝔥 with 𝐙 n 𝐑 n .

Why is exp surjective? Because H is path-connected, we know from an earlier exercise that H is generated by any neighbourhood of the identity matrix. In particular, H is generated by the image of an exponential chart. We can always add generators to a generating set to get a bigger generating set, so H is generated by exp ( 𝔥 ) . But exp ( 𝔥 ) is a subgroup, as we saw in the last video, so the subgroup generated by exp ( 𝔥 ) is exp ( 𝔥 ) itself, therefore H = exp ( 𝔥 ) , and the exponential map is surjective.

We now identify the kernel of the exponential map.

Definition:

Take k linearly independent vectors v 1 , , v k and take all possible integer linear combinations of them to get a subgroup Λ = { i = 1 k a i v i : a i 𝐙 } 𝐑 n . A subgroup of this form is called a lattice of rank k in 𝐑 n .

Example:

𝐙 n 𝐑 n is a lattice, taking v i to be the i th standard basis vector.

Lemma:

ker exp 𝔥 is a lattice of rank n (where n = dim 𝔥 ).

Once we have established this, we are done. To see why, consider the basis of 𝔥 given by the v i s. This identifies 𝔥 with 𝐑 n in such a way that ker exp is identified with 𝐙 n . Therefore H = 𝔥 / ker exp is isomorphic to 𝐑 n / 𝐙 n = ( 𝐑 / 𝐙 ) n = U ( 1 ) n .

Remark:

Note that U ( 1 ) = 𝐑 / 𝐙 because we have a surjective homomorphism 𝐑 U ( 1 ) , θ e 2 π i θ , with kernel 𝐙 , so the first isomorphism theorem tells us U ( 1 ) 𝐑 / 𝐙 .

Remark:

The fact that the rank must be n is easy to see once you know that ker exp is a lattice. If the rank were strictly less than n then we would get H ( 𝐑 / 𝐙 ) k × 𝐑 n - k , so H would fail to be compact because 𝐑 n - k is not compact unless k = n .

We will need to assume the following lemma:

Lemma:

A discrete subgroup of 𝐑 n is a lattice.

The proof of this lemma would take us too far away from the main business of the course. You can find it in Arnold's book "Mathematical Methods of Classical Mechanics" (on page 276 in my version of the book, where he is proving the (Arnold)-Liouville theorem on integrable systems).

We will just define discrete subgroups and prove that ker exp is discrete.

Definition:

A subgroup Γ 𝐑 n is discrete if, for every X Γ , there exists a Euclidean ball B 𝐑 n such that B Γ = { X } .

In other words, the points of Γ are sufficiently spaced out that you can separate them by balls.

Example:

An example of something that is not discrete would be 𝐐 𝐑 : any ball (interval) contains infinitely many rational numbers.

By constrast, the integers 𝐙 𝐑 are discrete: an interval of length ϵ < 1 containing an integer contains only one integer.

Lemma:

ker exp is a discrete subgroup of 𝔥 .

Proof:

The origin 0 𝔥 is in ker exp , so let's start by finding a ball B 𝔥 such that B ker exp = { 0 } . We can take B to be the domain of an exponential chart.

Remember that we have the exponential map exp : 𝔥 H and that we can find neighbourhoods U 𝔥 of the origin and V H of the identity such that exp | U : U V is bijective. In particular, exp | U is injective, so ker exp U = { 0 } (i.e. 0 is the only possible preimage of the identity in this neighbourhood).

For a general X ker exp , we will take B = { X + Y : Y U } . This works because B ker exp = { X + Y : Y U  and  exp ( X + Y ) = I } , but exp ( X + Y ) = exp ( X ) exp ( Y ) = exp ( Y ) because H is abelian and X ker exp , so we deduce that Y ker exp . Since Y U , this implies Y = 0 . Therefore B ker exp = { X } .

Summary

This final lemma shows that ker exp is a discrete subgroup of 𝔥 , so by the previous (unproven) lemma, it is a lattice (which we saw has rank n ). This implies that H = 𝔥 / ker exp is isomorphic to U ( 1 ) n as required.