Exercise Solutions
Exercise 1
Consider the set .
Convince yourself that multiplication is a binary operation on . Show that is a group.
Exercise 1 Solution
To convince ourselves that multiplication is a binary operation on
, let’s check that the
multiplication of any two elements of is again an element of . Indeed, this is true since:
To show that
is a group we
need to check that the 3 group axioms hold. Let’s go through each
axiom:
Axiom 1: It doesn’t matter what order we multiply
numbers in. So, associativity holds.
Axiom 2: The identity element is because the multiplication of with any number is that number again.
In particular,
Axiom 3: The inverse of is since . The inverse of is since . This shows that every
element in has an
inverse.
Exercise 2
In Example 4 we saw that is a group. Now consider
multiplication on . Convince yourself that is a binary operation on . Is a group?
Exercise 2 Solution
We know that if
and , then . So,
multiplication is a binary operation on . Although multiplication is a
binary operation on ,
is
not a group. To show that is not a group, we
need to show that at least one of the 3 group axioms does not hold.
Axiom 1 is satisfied because it doesn’t matter what order we multiply
numbers in. And Axiom 2 is satisfied because is the identity element.
We claim that Axiom 3 does not hold. To show that Axiom 3 does not hold,
we need to find at least one element of that does not have an inverse.
The element does not
have an inverse because times any
number is , not 1. That is, for
any , which is not
the identity element . So, does not have an inverse. This shows
that Axiom 3 does not hold and hence is not a group. In
fact, the only element in that has an inverse is . Can you show that any satisfying does not have an
inverse?
Exercise 3
Recall that a rational number is of the form where and is not zero. Let be the set of all rational
numbers. And let be
the set but with removed. Recall that we multiply two
rational numbers by Convince
yourself that multiplication
is a binary operation on . Is a group?
Exercise 3 Solution
Let and
. By
definition of ,
and are not zero and so is not zero. Thus, the
multiplication is in since and is not zero. It remains to show
that the multiplication of with
is not zero. Well,
since these elements are not zero, and are not zero. Then is not zero, and so is not zero. So, . We
conclude that multiplication is a binary operation on . We claim that is a group.
Let’s go through each group axiom:
Axiom 1: It doesn’t matter what order we multiply
numbers in. So, associativity holds.
Axiom 2: The identity element is because the multiplication of with any number is that number again.
In particular, for any , we have that
Axiom 3: We need to show that every element in has an inverse. So, let
. Because
and are not zero, the element is also in . We compute that and similarly This
shows that is the inverse of
. So, every element in has an inverse.
Exercise 4
An equilateral triangle is a triangle whose 3 sides all have the same
length. The triangle in Example 6 is an equilateral triangle. Write down
all of the symmetries of an equilateral triangle
Exercise 4 Solution
The complete list of symmetries of an equilateral triangle are as
follows:
In words, these symmetries are:
The "do nothing symmetry", which is the same as rotation by degrees. This is labelled as the
"identity symmetry" because it is the identity element of the group
, where is an equilateral triangle (we will see
this in Exercise 5).
Counter clockwise rotation by degrees
Counter clockwise rotation by degress.
Reflection in the axis that goes through the center and top tip
of the triangle.
Reflection in the axis that goes through the center and left tip
of the triangle.
Reflection in the axis that goes through the center and right tip
of the triangle.
Note that clockwise rotations by multiples of degrees are also symmetries. However,
these symmetries are already in the above list. For example, rotation
clockwise by degrees is the
same as counter clockwise rotation by degrees. If you prefer, you can
replace "counter clockwise" with "clockwise" in the above list, it
doesn’t matter at all. Also note that rotations by degrees with are symmetries. Again, they are
already in the above list. For example, counter clockwise rotation by
degrees is the same as counter
clockwise rotation by
degrees.
Exercise 5
Let be an equilateral
triangle. In Exercise 4 you computed . Convince yourself that
is a
group.
Exercise 5 Solution
We need to convince ourselves that the 3 group axioms hold for with composition. Let’s go
through each axiom:
Axiom 1: For all , we need to be the same symmetry
as . Proving this
is a bit tough given our current tools, so let’s do a concrete example
to see why it works.
Let be counter clockwise
rotation by degrees, let be reflection in the axis that goes
through the center and top tip of the triangle, and let be counter clockwise rotation by degrees. These symmetries are
illustrated as follows:
The compositions and
are computed to be:
We see that these two compositions are the same symmetry, and they
are equal to the symmetry that reflects in the axis going through the
center and right tip of the triangle. Using these compositions, we
compute and :
We see that , as desired. They are equal to the symmetry that
reflects in the axis going through the center and left tip of the
triangle:
Axiom 2: The identity element in is the "do nothing"
symmetry. Here is an illustration of the identity element:
Let be any symmetry of . If you do nothing to and then apply , it’s the same as just applying to . Similarly, if you apply to and then do nothing, it’s the same as
just applying to . So indeed, this is the identity
element .
Let’s do a concrete example where is chosen to be counter clockwise
rotation by degrees. Here is
the composition :
We see that this composition is just . Here is the composition :
Again, we see that this composition is just .
Axiom 3: We need to show that every element in has an inverse. For this,
it will be helpful to recall the elements of from Exercise 4.
First consider the symmetries that are reflections. The inverse of a
reflection is itself. In other words, if is a reflection then
the inverse of is , that is . This is because if we reflect
in the same axis twice, it’s the same as doing nothing. Here is a
concrete example:
We see that this composition is just . Next, consider
symmetries that are rotations. If is a rotation, then by
Exercise 4, it’s counter clockwise rotation by degrees for some . The inverse of counter
clockwise rotation by degrees
is the symmetry that reverses this rotation, which is clockwise rotation
by degrees. Note that
clockwise rotation by degrees
is the same symmetry has counter clockwise rotation by degrees. Here is a concrete
example where we take :
We see that these two compositions are just .
Exercise 6
Consider the benzene molecule below and denote it by . The benzene molecule is a shape, and
so is a
group. Chemists study the symmetries of molecules such as , and classify molecules according to
their symmetry group. The study of such symmetries can be used to
predict or explain chemical properties of a molecule.
Write down the symmetry group of the benzene molecule . In other words, write down the
elements of .
Exercise 6 Solution
The complete list of symmetries of the benzene molecule are as
follows:
There are 6 counter clockwise rotations by multiples of 60 degrees. And there are 6 reflections in axes shown above.
Problem Set
Solutions
In Example 4 we saw that is a group. Now consider
subtraction on . Convince yourself that
subtraction is a binary operation on . Show that subtraction on
is not associative and
use this to conclude that is not a group.
Solution:
We know that if , then . So, subtraction is a
binary operation on .
Next, let’s show that subtraction on is not associative. To do
this, we need to find integers such that Here the
symbol means "not equal". If
, then and But , so This shows that subtraction on is not associative, and so
Axiom 1 of the group axioms is not satisfied. So is not a group.
Note: It is true that for any as long as . Can you show this?
Consider the set of natural numbers , which is the
set containing all non-negative whole numbers. Addition is a binary
operation on . Show that
is not a group.
Solution:
To show that is
not a group, we need to show that at least one of the 3 group axioms
does not hold. Axiom 1 holds because it doesn’t matter what order we add
numbers in. We see that Axiom 2 holds because for any , and so is the identity element for with addition.
We claim that Axiom 3 does not hold. To show that Axiom 3 does not hold,
we need to find at least one element of that does not have an inverse.
It turns out that every element of , aside from , does not have an inverse. To see this,
let and assume that
is not zero. If had an inverse, say , then we would have that and so . So, if had an inverse then it would have to be
. However, since is not zero, we have that . This implies that , which means that is a negative integer, and so . But remember that by
definition of inverse, if had an
inverse it would have to be an element of . So, this shows that does not have an inverse.
Consider the set of even integers Convince yourself that
addition is a binary operation on . Show that is a group.
Solution:
To convince ourselves that addition is a binary operation on , let’s check that the
addition of any two elements of is again an element of . So, let . We know that the
addition of two integers is again an integer, so is an integer. It remains to show
that is even. Since and are even, we can write for
some . Then
which shows that is even. We
conclude that ,
and so addition is a binary operation on . To show that is a group we need to
check that the 3 group axioms hold. Let’s go through each axiom:
Axiom 1: It doesn’t matter what order we add numbers
in. So, associativity holds.
Axiom 2: The identity element is because the addition of with any number is that number again.
In particular, for any ,
Axiom 3: We need to show that every element of has an inverse. So, let . Note that because the negative of
an even integer is still an even integer. Then This
shows that is the inverse of
. So, every element in has an inverse.
Suppose we are given a group . Axiom 2 of the group axioms
says that has an
identity element, which we denote by . Show that the identity
element is unique. In
other words, show that there is exactly one element of that satisfies the property: for every
, .
Hint: If satisfies
the above property, try to show that .
Solution:
Suppose there exists such
that for every , Since this
equation holds for every element , it holds for . So We
know satisfies the same
property as . That is, for every
, Since this equation holds for every element , it holds for . So Together, Equations (1) and (2) tell us
that This shows that is the only element of the
group that satisfies the above property.
Consider the following triangle:
Write down the symmetries of this triangle and compare them with the
symmetries of the equilateral triangle from Exercise 4.
Solution:
The complete list of symmetries of the above triangle are as
follows:
In words, these symmetries are the "do nothing symmetry" (which is
the same as rotation by
degrees) and reflection in the axis that goes through the center and top
tip of the triangle. The symmetries of this triangle are symmetries of
the equilateral triangle in Exercise 4. However, the equilateral
triangle in Exercise 4 has way more symmetries than this triangle. So,
the sets of symmetries are different.
Consider the following hexagon:
Write down the symmetries of this hexagon. Then compare the
symmetries of this hexagon with the symmetries of the benzene molecule,
which were found in Exercise 6. Are they the same in some sense? Or are
they different?
Solution:
The complete list of symmetries of a hexagon are as follows:
There are counter clockwise
rotations by multiples of
degrees. And there are
reflections in the axes shown above. If you compare these symmetries, with the symmetries of the benzene molecule,
then we see that they are exactly the same! This is because the benzene
molecule has a similar structure to that of the hexagon. You can think
of the benzene molecule as a hexagon but with 6 arms sticking out, and
these arms do not affect the symmetries.
Consider the following shapes.
These shapes are examples of regular polygons. A polygon is called regular if all of its sides have the same length and all of its angels are the same. For example, an equilateral triangle is a regular polygon. Write down the symmetry group of an arbitrary regular polygon.
Hint: Let be a regular
polygon with sides. The goal is
to write down the elements of . In Exercise 4 you
computed , and in
Problem 6 you computed . If you compute for small , say , do you see a
pattern?
Solution:
Let be a regular polygon
with sides. We want to find the
elements of .
In Exercise 4, we saw that consists of 3 counter
clockwise rotations and 3 reflections. The rotations are by multiplies
of . And for each tip of
the triangle, there is an axis of reflection that goes through the tip
and the center of the triangle.
Next, consider the square :
The square has 4 rotations that are symmetries. These are counter
clockwise rotations by (or ), , , and degrees. There are reflections of the square which are
symmetries. These are depicted in the following photo:
Reflection in each of these
axes is a symmetry. To conclude, consists of rotations which are by multiplies of
degrees and reflections.
For another example, consider the pentagon :
The pentagon has rotations
that are symmetries. These are counter clockwise rotations by (or ), , , , and degrees. There are reflections of the pentagon which are
symmetries. These are depicted in the following photo:
Reflection in each of these
axes is a symmetry. To conclude, consists of rotations which are by multiplies of
degrees and reflections.
Given these examples, we expect
that consists of
counter clockwise rotations by
multiples of degrees
and reflections. And indeed, this
is true. We do not have the tools to prove this yet, but hopefully the
above examples convince you that it is a reasonable expectation.