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(X1)exp(X2)=exp(X1+X2) for all X1,X2∈π”₯. 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=π”₯/kerexp .

  3. Then we will identify kerexpβŠ‚π”₯ 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 v1,…,vk and take all possible integer linear combinations of them to get a subgroup Ξ›={kβˆ‘i=1aivi:aiβˆˆπ™}βŠ‚π‘n. A subgroup of this form is called a lattice of rank k in 𝐑n .

Example:

𝐙nβŠ‚π‘n is a lattice, taking vi to be the i th standard basis vector.

Lemma:

kerexpβŠ‚π”₯ 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 vi s. This identifies π”₯ with 𝐑n in such a way that kerexp is identified with 𝐙n . Therefore H=π”₯/kerexp is isomorphic to 𝐑n/𝐙n=(𝐑/𝐙)n=U(1)n .

Remark:

Note that U(1)=𝐑/𝐙 because we have a surjective homomorphism 𝐑→U(1) , θ↦e2Ο€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 kerexp 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 kerexp 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:

kerexp is a discrete subgroup of π”₯ .

Proof:

The origin 0∈π”₯ is in kerexp , so let's start by finding a ball BβŠ‚π”₯ such that B∩kerexp={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 kerexp∩U={0} (i.e. 0 is the only possible preimage of the identity in this neighbourhood).

For a general X∈kerexp , we will take B={X+Y:Y∈U} . This works because B∩kerexp={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∈kerexp , so we deduce that Y∈kerexp . Since Y∈U , this implies Y=0 . Therefore B∩kerexp={X}.

Summary

This final lemma shows that kerexp 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=π”₯/kerexp is isomorphic to U(1)n as required.