A path-connected compact abelian matrix group H is a torus (i.e. it's isomorphic to U(1)n for some n ).
Optional: Compact connected abelian groups are tori
Compact connected abelian groups are tori
This video is optional.
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:
-
We'll prove that exp is surjective.
-
The first isomorphism theorem for groups will then show that H=π₯/kerexp .
-
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.
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
πnβπn is a lattice, taking vi to be the i th standard basis vector.
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 .
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)β π/π .
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:
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.
A subgroup Ξβπn
is
In other words, the points of Ξ are sufficiently spaced out that you can separate them by balls.
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.
kerexp is a discrete subgroup of π₯ .
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.