Professional Documents
Culture Documents
Summer 2016
Group theory, like Elvis, is everywhere. Part of the idea of the presentations is to give you an idea
of the breadth of applications of group theory. (We also hope that youll enjoy both the chance
to dive deeper into a single topic and the opportunity to share what you learn with your fellow
students.) This handout is meant both to give you a feel for how group theory appears throughout
math (and outside of math as well!). Its also meant as an introduction to topics for presentations.
Ill try to give a brief introduction to each topic, so you can gauge your own interest.
Note: Generally the links provided below will be to Wikipedia articles. You can find much more
by Googling and the library will have some wonderful texts. I can help you find resources if you
have any trouble.
You should have a good idea what the dihedral groups are from our discussions in class. One
approach to delve deeper is to think of these groups as the symmetry group of an object in the
plane. For example, the regular pentagon (with 5 sides) has a symmetry group of order 10, given
by five rotations (including the identity) and five reflections (shown here each with the appropriate
line of reflection):
More generally, the dihedral group of order 2n is the symmetry of the regular n-sided polygon (also
called a regular n-gon). This is often called Dn in geometry (to emphasize the n-gon) and D2n in
group theory (to emphasize the order of the group).
Symmetry and Platonic Solids
There are natural symmetry groups associated with the Platonic solids. Because of duality, there
are really only three of these polyhedral groups. The symmetric nature of the platonic solids makes
these reasonably large groups (orders 12, 24 and 60 or double that if one includes reflections).
(This can be found in many introductory books on group theory. One thats freely available is
Frederick M. Goodmans Algebra: Abstract and Concrete.)
Another collection of finite multiplicative groups
Let Z0n = {1, 2, 3, . . . , n 1}. If n is an odd prime, then 2Z0n is a group where the operation is
1
a2 +
1
a3 + a +
4
To simplify things, this example is often written as [a1 ; a2 , a3 , a4 , ]). There are some cool
examples. For example, the golden ratio is = [1; 1, 1, 1, 1, ], the square root of two 2 =
[1; 2, 2, 2, 2, 2, ], and even e = [2; 1, 2, 1, 1, 4, 1, 1, 6, 1, 1, 8, 1, 1, 10, ]. See the Wikipedia link for
more examples and other cool properties.
and
t24 s3 t4 s2 t7 .
If the set S of generators is finite, we say (naturally) that the group is finitely generated. These
groups are infinite, but we can add relations among the generators to make the group finite or more
complicated. For example, with one generator s and one relation sn = e, the resulting group is
isomorphic to Zn . We usually write this as hs | sn i. A slightly more complicated familiar group is
the dihedral group D2n of order 2n, which we can write as
D2n
= r, f | rn , f 2 , rf rf ,
where r is a rotation and f is a reflection (a flip). This is called the presentation of a group.
Here are some questions you can ask: Given a group by its presentation, can you tell if the group is
finite? Can you find the the order of the group? Can we tell if two presented groups are isomorphic?
Elements of order two
What are the properties of the set of elements in a group that have order two? Here are some
questions that could be asked (and answered, and shown with examples and non-examples):
Lie Groups
A Lie group is a group that is also a differentiable manifold (essentially a smooth surface). Examples
include the matrix groups we saw earlier in the summer and the circle S 1 (with the operation as
addition of angles).
Galois theory
This is a fairly advanced topic, but there are several avenues that are approachable for entry-level
students of group theory. The Wikipedia article has some good explanations. One interesting
consequence for us is a proof of the Abel-Ruffini Theorem: there is no analog of the quadratic
formula that will work for all quintics. (This is called the unsolvability of the quintic equation.)
Sylow theorems
This is a small collection of theorems all dealing with the subgroups of a particular order of a given
finite group. More specifically, if pn is the highest power of a prime p that divides the order of G,
then there is subgroup of G of order pn . (And, in fact, if there is more than one such subgroup, the
two subgroups are conjugate. That is, if H and K are such subgroups, then K = gHg 1 for some
element g of G.)
Quadratic reciprocity
y 2 = x3 3x + 1
y 2 = x3 3x + 2
y 2 = x3 3x + 3
Each point on the elliptic curve is an element of the group (also the point at infinity is used as
the identity element), with the group operation described geometrically. For points P and Q on
an elliptic curve, define P + Q by the line through P and Q. In general this line will intersect the
curve in a third point call it R then define P + Q to be the reflection of R across the x-axis
(see Figure ??). (There are details to figure out: What if the line is tangent to the curve? What if
the line doesnt intersect the curve a third time? And how does one prove associativity? See the
Wikipedia link or any number of references.)
Some applications:
Elliptic curve cryptography
These were used by Wiles in the proof of Fermats Last Theorem
The congruent number problem: which rational numbers can be the area of a right triangle
with rational sides?
RSA Encryption
The grandfather of all public key cryptosystems, this algorithm was devised (and patented!) in 1977
Q
x
P
P +Q