30 The Modular Group and Representations of Abelian Groups
Last time, we discussed presentations of groups by generators and relations, and the Cayley graph.
and
One more example:
Proposition 30.1.
Proof. Given
- If
, then , and is either or . - Now assume
, and repeatedly apply the following algorithm to modify :- if
, use Euclidean division to write , . Then This decreases . - if
, brings us back to .
- if
After finitely many steps we find that the product of
- There is a different, geometric proof, based on the fact that
acts on the upper half plane by Now acts by and by .
The region
Since the regions immediately adjacent to
- Other generators: instead of
and , we could use and . These have finite order! . and . These are conjugates! .- The images of these matrices in
also generate .
Theorem 30.2.
Proof.
Mapping
Observe:
- If it starts and ends with
, we get a shorter word by conjugating by : since , . - If it starts with
, conjugate it to get another word that doesn’t: .
Iterating, we eventually get some word
But
Observe: when multiplying a matrix with entries
So we can’t get
- This presentation can be rewritten in terms of other generators:
with in the first presentation and in the second; and
(And to connect two strands of our discussion: the center of the braid group
Representation theory
Next topic (through the end of the semester): representation theory (
Representation theory = the study of group actions on vector spaces, i.e. homomorphisms
Historically, groups first arose as geometric symmetries, so in the 19th century groups were mostly thought of as subgroups of
We’ll focus on representations of finite groups, but the problem is also interesting for discrete infinite groups (e.g.
Notes not reached in this lecture, covered at the start of {{LINK:L31}}
Definition 30.3. A representation of a group
Equivalently: a homomorphism
Definition 30.4.
- A subrepresentation is a subspace
which is invariant under , i.e. for all . - A representation is irreducible if it has no nontrivial subrepresentations.
Example 30.5. If
Return briefly to linear algebra:
Lemma 30.6. Let
Proof. This is because the minimal polynomial of
Explicitly: over
Since
Returning to
Now, if
is a -representation of a finite abelian group , , with , the -action is equivalent to the data of such that and which pairwise commute, (then , with the generators of the factors ).By the lemma each
is diagonalizable, and by the homework, commuting diagonalizable operators are simultaneously diagonalizable. In fact: the eigenspaces of are invariant under all , and the restriction of to an eigenspace of is of finite order, hence diagonalizable by the lemma. Proceed by induction on .This shows that
splits into a of 1-dimensional subrepresentations. Those now correspond to homomorphisms .
Definition 30.7. For
This is an abelian group using pointwise multiplication: if
Concretely, for
Similarly,
This completes the classification of (complex) representations of finite abelian groups!