Lecturer’s version
Dr E. Cheng
J24 Hicks Building
Semester 2, 2012–13
http://cheng.staff.shef.ac.uk/mas276/
Contents
Introduction 4
I Rings 8
1 Introduction to rings 8
1.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
1.2 Subrings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
2 Division 19
2.1 Units . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
2.2 Zero-divisors . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
2.3 Integral domains . . . . . . . . . . . . . . . . . . . . . . . . . 31
3 Factorisation 38
3.1 Unique factorisation . . . . . . . . . . . . . . . . . . . . . . . 38
3.2 Euclidean domains . . . . . . . . . . . . . . . . . . . . . . . . 48
2 CONTENTS
II Groups 55
4 Revision 55
4.1 Definitions and examples . . . . . . . . . . . . . . . . . . . . . 55
4.2 Basic theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
4.3 Homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . 62
5 Quotient groups 63
5.1 Subgroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
5.2 Cosets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
5.3 Quotient groups . . . . . . . . . . . . . . . . . . . . . . . . . 70
6 Conjugacy 72
6.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
6.2 The class equation . . . . . . . . . . . . . . . . . . . . . . . . 79
7 Homomorphisms 89
7.1 Kernels and images . . . . . . . . . . . . . . . . . . . . . . . . 89
7.2 Quotient groups revisited . . . . . . . . . . . . . . . . . . . . 97
7.3 First isomorphism theorem . . . . . . . . . . . . . . . . . . . 103
Information
Please see the course webpage for answers to some Frequently Asked Ques-
tions on matters such as what to do if you miss a lecture. If you email me
with a question that is already answered in the FAQ, I will not reply.
• Homework is due every week whether or not you have a tutorial. There
is also tutorial work for every week whether or not you have a tutorial.
These exercises and instructions are at the back of the booklet.
• There will be an online test each week. These will count for
...........................................
...........................................
• There will be “office hours” each week when you can come and ask for
extra help with any lecture material or exercises. These are at
...........................................
• In week #n should should do tutorial sheet #n, which will help you
with
• For this course you have two hours of lectures per week and one hour
of tutorial per fortnight. We expect you to do at least three hours of
private study per course per week as well. If you do not do this
amount, you are likely to find that there is too much material
to learn all at once before the exams.
4 Introduction
Introduction
Groups are sets of things where those things interact with each other in
nice ways.
• similarly Q, R, C
But in the cases apart from symmetries, saying something is a group simply
doesn’t capture everything that’s going on. It’s a bit like saying
• multiplication
• prime numbers
• modular arithmetic
What we’re going to do now is find out what basic properties about Z
enabled us to do all that.
It’s like saying: Why might we want to know how a car/computer works?
• sheer curiosity
But also, there are other number-like situations where it would be nice to be
able to use all the techniques we know about integers—so we have to know
whether that will work or not. Will everything go horribly wrong??
Groups +, −, 0
• Z Q R C
Part I
Rings
1 Introduction to rings
1.1 Definitions
• add
• subtract
• multiply
1. associativity of + ∀a, b, c ∈ R (a + b) + c = a + (b + c)
2. additive identity ∃0 ∈ R s.t. ∀a ∈ R a+0=a=0+a
3. additive inverse ∀a ∈ R ∃(−a) ∈ R s.t. a + (−a) = 0
4. commutativity of + ∀a, b ∈ R a+b = b+a
these four say R is an Abelian group under +
5. associativity of × ∀a, b, c ∈ R (ab)c = a(bc)
6. multiplicative identity ∃1 ∈ R s.t. ∀a ∈ R a.1 = a = 1.a
these two say R is a monoid under ×
7. distributive law ∀a, b, c ∈ R a(b + c) = ab + ac
∀a, b, c ∈ R (b + c)a = ba + ca
z
1.1 Definitions 9
1, 1112
Z⊂Q⊂R⊂C
Note that in this case we can drop some parts of the axioms—which?
Remarks 1.1.4. Here are some remarks about the definition which are
boring, but it would be somehow wrong not to mention them.
2. Many of the most obvious things we think are true are not actually
axioms—we have to prove them from scratch.
Then u = u′ .
Proof.
Putting x = u′ in (1) gives u + u′ = u′ .
Putting x = u in (2) gives u′ + u = u.
So we have
u′ = u + u′
= u′ + u by commutativity of +
= u
as required. 2
Since identities are unique we can “name this baby”. We name it 0, and
then any element satisfying this property must be 0.
1. x + a = 0 i.e. a is inverse to x
1.1 Definitions 11
2. x + b = 0 i.e. b is inverse to x
Then a = b.
Proof.
x + b = 0 =⇒ a + (x + b) = a + 0
= a by definition of 0
But also
associativity of +
a + (x + b) = (a + x) + b by .................................................
commutativity of +
= (x + a) + b by .................................................
assumption 1
= 0+b by .................................................
definition of 0
= b by .................................................
Thus a = a + (x + b) = b as required. 2
So, like with the identities, we can “name this baby”. We call it −x, and
anything satisfying this property must be −x.
Note 1.1.8.
a − b is defined to be a + (−b).
Proof.
distributive law
0x + 0x = (0 + 0)x by .................................................
definition of 0
= 0x by .................................................
(0x + 0x) − 0x = 0x − 0x
definition of −
= 0 by .................................................
12 Section 1. Introduction to rings
But
associativity of +
(0x + 0x) − 0x = 0x + (0x − 0x) by .................................................
definition of −
= 0x + 0 by .................................................
definition of 0
= 0x by .................................................
Thus
0x = (0x + 0x) − 0x
= 0
as required. 2
−(−x) = x
x + (−x) = 0.
This is like Cinderella. Incidentally (and irrelevantly), did you know that
in the original, her slipper wasn’t made of glass at all?
(−a)b = −(ab).
(−1)a = −a.
Proof.
(−1)a = −(1.a) by Lemma 1.1.11
= −a by definition of 1. 2
• + is addition mod n
• × is multiplication mod n z
[x] + [y] = [x + y]
This is a ring.
Given
f = a0 + a1 x + a2 x2 + · · · + an xn
g = b0 + b1 x + b2 x 2 + · · · + b m x m
we define
X
f +g = (ak + bk )xk
k
X X
f.g = ( ai bj )xk
k i+j=k
This is a ring with with the usual matrix addition and multiplication.
0 0 1 0
0 and 1 are: and
0 0 0 1
1.2 Subrings 15
do not commute:
1 1 0 0 0 1
=
0 1 0 1 0 1
but
0 0 1 1 0 0
=
0 1 0 1 0 1
z
2, 1112
1.2 Subrings
a+b ∈S
−a ∈S
0 ∈ S —automatic, but it’s good to remember it
those say that S is a subgroup of R
ab ∈S
1 ∈S z
2. Is Z2 a subring of Z?
No: eg 1 + 1 = 0 ∈ Z2 but 1 + 1 = 2 ∈ Z.
Compare with: Zn is not a subgroup of Z. It is a quotient group.
16 Section 1. Introduction to rings
3. Is Z2 a subring of Z4 ?
No: same counterexample.
6. Define R = { ab ∈ Q | b is odd }.
This is a subring of Q.
Given ab , dc ∈ R we can check:
a c ad + bc
• + =
b d bd
odd × odd = odd
which is in R because . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
a b is odd
• − is in R because . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
b
a c ac
• . =
b d bd
odd × odd = odd
which is in R because . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1
• 1= 1 which is in R because 1 is odd.
10. Given a ring R and a natural number n, let S be the subset of R[x]
consisting of polynomicals of degree at most n. Is this a subring of
R[x]?
Only if n is 0, otherwise it won’t be closed under multiplication.
1.2 Subrings 17
√
Definition 1.2.3. Z[ d] BRING YOGHURT
√
Given d ∈ Z, the ring Z[ d] is defined to be all numbers of the form
√
a+b d
√ √ √
• a1 + b1 d + a2 + b2 d = (a1 + a2 ) + (b1 + b2 ) d
√ √ √
• (a1 + b1 d)(a2 + b2 d) = (a1 a2 + b1 b2 d) + (b1 a2 + a1 b2 ) d
√ √
• −(a1 + b1 d) = −a − b d
√
• 1 = 1 + 0. d
d|a2 ⇒ d|a.
18 Section 1. Introduction to rings
√
Lemma 1.2.6. Let d 6= 1 and square-free. Then d 6∈ Q.
This should remind you of a basis for a vector space. It is very similar. It is
very different from the situation with polynomials—with polynomials, none
of the fruit gets stirred back in.
Proof. By contradiction.
√ √
Suppose a1 + b1 d = a2 + b2 d with b1 6= b2 .
Then
√
a1 − a2 = (b2 − b1 ) d
√ a1 − a2
⇒ d = since b1 6= b2
b2 − b1
√
⇒ d is rational # contradicts Lemma 1.2.6
Finally here’s a definition that we won’t use, but it’s here for completeness.
3. f (1) = 1
z
19
Remarks 1.2.10.
2 Division
1
But given x 6= 0 ∈ Q we definitely have x ∈Q
and likewise for R, C.
Now x1 is “number such that when you multiply it by x you get 1” —and
then we can “divide by x” by multiplying by x1 .
2.1 Units
Examples 2.1.2.
(y −1 x−1 )(xy) = 1
(xy)(y −1 x−1 ) = 1
This theorem gives us a way of not only finding if something has an inverse
in Zn , but of actually finding it.
157 = 3.47 + 16
47 = 2.16 + 15
16 = 1.15 + 1
15 = 15.1 + 0
1
So hcf (157, 47) = ......... and 47 is/is not* a unit in Z157 .
Line 2: 15 = 47 − 2.16
= 47 − 2.(157 − 3.47)
= 7.47 − 2.157
Line 3: 1 = 16 − 1.15
= (157 − 3.47) − (7.47 − 2.157)
= 3.157 − 10.47
is Lemma 2.1.3
1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
x−1 .x = 1 = x.x−1
by definition of x−1 . 2
Examples 2.1.7.
{ 1, -1}
1. In Z we have U(Z) =........... which is a group, isomorphic to C2 , the
cyclic group of order 2.
3. In Z8 the units are {1, 3, 5, 7}. Every element (except 1) has order 2.
2.2 Zero-divisors
x2 + 3x + 2 = 0 as in HW # 1
(x + 1)(x + 2) = 0
⇒ x + 1 = 0 or x + 2 = 0
⇒ x = −1, −2
2.2 Zero-divisors 23
(x + 1)(x + 2) = 0 ⇒ 1. x + 1 = 0 i.e. x = 5
or 2. x + 2 = 0 i.e. x = 4
or 3. {x + 1, x + 2} = {2, 3} i.e. x = 1
or 4. {x + 1, x + 2} = {3, 4} i.e. x = 2
Z9 3,3,
x + 1, x + 2 x
x+1=0 8
x+2=0 7
Z12 2,2,3
x + 1, x + 2 x
x+1=0 11
x+2=0 10
3, 4 2
8, 9 7
Z30 2,3,5
24 Section 2. Division
x + 1, x + 2 x
x+1=0 29
x+2=0 28
5, 6 4
9, 10 8
14, 15 13
15, 16 14
20, 12 19
24, 25 23
The moral is that our methods for solving quadratics are rather more com-
plicated if we have more options for ab = 0. In this example the problem
was caused by the fact that 2.3 = 0 and also 3.4 = 0.
2x ≡ 4 (mod 6)
x ≡ 2, 5
has two solutions: .........................
or more simply
2x ≡ 0 (mod 6)
x ≡ 0, 3
has two solutions: .........................
3a ≡ 3b (mod 6)
∃s 6= 0 ∈ R s.t. rs = 0.
∃s 6= 0 ∈ R s.t. sr = 0.
In this course almost all the rings we deal with will be commutative. The
main exception is matrix rings.
Examples 2.2.2.
We will see that there are some rings with elements that are neither a unit
or a zero-divisor, but it is impossible to be both a unit and a zero-divisor.
That example was easy enough to do just by staring, but for bigger numbers
this technique is much more efficient than staring.
2.2 Zero-divisors 27
201 = 3.67
63 = 3.3.7
3
So hcf (63, 201) = ................ so we expect 63 to be a zero-divisor in Z201 .
So can we find b such that 63b ≡ 0? We have
r = a−1 .ar
= a−1 .0
= 0
so a is not a zero-divisor. 2
2. Write hcf (a, n) = d > 1 and seek b 6= 0 such that ab ≡ 0 (mod n).
Now
n a a n
n = .d, a = .d d, d ∈Z
d d
28 Section 2. Division
n n a
Put b = . Then ab = a. = .n ≡ 0 (mod n).
d d d
a
since d ∈ Z. Finally we must check b 6= 0. Now
n
0< <n
d
since d > 1, so
n
6 0 (mod n).
≡
d
For the converse we need to show that if a is a zero-divisor then
hcf (a, n) 6= 1.
(1 + 3x)(a0 + a1 x + a2 x2 + · · · an xn ) = 1 ∈ Z6 [x]
Now 3a0 + a1 ≡ 0 =⇒ 3 + a1 ≡ 0 =⇒ a1 ≡ 3.
Similarly 3a1 + a2 ≡ 0 =⇒ 3 + a2 ≡ 0 =⇒ a2 ≡ 3.
Similarly ai ≡ 3 for all 0 < i ≤ n.
But also 3an ≡ 0 #.
(1 + 3x)(a0 + a1 x + a2 x2 + · · · an xn ) = 0 ∈ Z6 [x]
2.2 Zero-divisors 29
Now 3a0 + a1 ≡ 0 =⇒ a1 ≡ 0.
Similarly 3a1 + a2 ≡ 0 =⇒ a2 ≡ 0.
Similarly ai ≡ 0 for all 0 < i ≤ n.
rs = 0 =⇒ s = 0.
units zero-divisors
units zero-divisors
30 Section 2. Division
units
units
3a ≡ 3b (mod 6)
Can we deduce
a ≡ b (mod 6) ?
Proof. ra = rb ⇒ ra − rb = 0
⇒ r(a − b) = 0
⇒ a − b = 0 since r is not a zero-divisor
⇒ a = b
Remember how in Numbers and Proofs you solved things like 2x ≡ 4 (mod 6) ?
—You had to start by taking the hcf of 2 and 6. Effectively, that was to see
if 2 was a zero-divisor or not (although they didn’t tell you at the time).
We have seen that zero-divisors are a bit annoying. In the next section,
we imagine we’re in a glorious world in which there are no zero-divisors.
Such a world is called an integral domain.
We have been studying various things that go a bit pear-shaped if you have
zero-divisors e.g. solving all kinds of equations. If we want to exclude that
possibility we go into “integral domains”.
Note that from this point on, all our rings are commutative.
Examples 2.3.2.
1. Z is an ID. So are Q, R, C.
√
2. Z[ d] ⊂ C and we will see that this means it must be an ID.
In the case of Zn it is nice and easy to tell whether or not we have an ID.
32 Section 2. Division
Zn is ID ⇔ ∀ 1 ≤ a ≤ n − 1, a is not a zero-divisor
⇔ ∀ 1 ≤ a ≤ n − 1, hcf (a, n) = 1 by Theorem 2.2.3
⇔ n is prime 2
Proof.
Let a 6= 0, b 6= 0 ∈ S.
Then a 6= 0, b 6= 0 ∈ R so ab 6= 0 ∈ R
Then a 6= 0, b 6= 0 ∈ R so ab 6= 0 ∈ S
since S has the same multiplication as R.
Examples 2.3.6.
√
1. Z[ d] is a subring of C so is always an ID.
The converse of that second part is more profound, and harder to prove:
2.3 Integral domains 33
Proof.
“⇐=” is by Lemma 2.3.5 since R is a subring of R[x].
“=⇒”
Suppose R is ID.
Let f, g 6= 0 ∈ R[x]. We need to show f g 6= 0.
So write f (x) = a0 + · · · + am xm
g(x) = b0 + · · · + bn xn
So f g 6= 0. 2
Now we turn our attention to finding out what the units are in various IDs.
Theorem 2.3.8. Units in polynomial rings.
Let R be an ID.
Then the units in R[x] are just the units in R (so in particular they are all
constants).
f (x) = a0 + · · · + am xm
g(x) = b0 + · · · + bn xn
so in particular am , bn 6= 0.
So we must have m + n = 0.
But m + n = 0 =⇒ m = 0 and n = 0.
√
Next we investigate units in Z[ d]. These are not very obvious at first sight.
To help with this we introduce something called a “norm”, which is a bit
√
like a way of measuring how “big” elements of Z[ d] are. Eventually we’ll
show that the units are precisely those elements of norm 1, but it will take
us a few more lemmas to get there.
√
Definition 2.3.9. Norm in Z[ d].
√ √
Let d 6= 1 be a square-free integer, and let r = a + b d ∈ Z[ d].
We define the norm of r as
√ √
N(r) = |a2 − db2 | = |(a + b d)(a − b d)|.
Proof. boring
2.3 Integral domains 35
i.e. |a2 − b2 d| = 0
so a2 = b2 d. (1)
√ a
If b 6= 0 we have d=± ∈Q#
b
since d is square-free (Lemma 1.2.6).
So b = 0, and by (1) we then get a = 0.
So r = 0 as required. 2
√ √
2. We simply calculate: Put r = a1 + b1 d, s = a2 + b2 d. Then
√
N(rs) = N (a1 a2 + b1 b2 d) + (a1 b2 + b1 a2 ) d
= |(a1 a2 + b1 b2 d)2 − (a1 b2 + b1 a2 )2 d|
= |a21 a22 + 2a1 a2 b1 b2 d + b21 b22 d2 − a21 b22 d − 2a1 a2 b1 b2 d − b21 a22 d|
We can now prove that the norm really does tell us which elements are units.
√
Theorem 2.3.11. Let d 6= 1 be a square-free integer and r ∈ Z[ d]. Then
√ N(r)=1
r is a unit in Z[ d] ⇐⇒ ................................
Proof.
“⇐=”
√
Consider r = a + b d with N(r) = 1.
√ √
Then N(r) = |(a + b d)(a − b d)| = 1
√
so r.(a − b d) = ±1
36 Section 2. Division
√ √
(a − b d) −(a − b d)
so either ....................... or ....................... is an inverse for r,
i.e. r is a unit.
“=⇒”
Conversely suppose r is a unit in R. Then
N(rr −1 )
N(r)N(r −1 ) = ....................... by Lemma 2.3.10
N(1)
= ..........................
1
= .........................
Now N(r) and N(r −1 ) are both non-negative integers so must both be 1
so in particular N(r) = 1 as required. 2
6, 1112
√ √
1. Consider Z[ 2], r = 7 + 5 2. Then N(r) = |49 − 25.2| = 1
√
√ −(7 − 5 2)
so 7 + 5 2 isn’t a unit / is a unit* with inverse . . . . . . . . . . . . . . . . . . . .
√ √
2. Consider Z[ 3], r = 4 + 7 3. Then N(r) = |16 − 49.3| = 131 6= 1
√ not a unit
so 4 + 7 3 isn’t a unit / is a unit* with inverse . . . . . . . . . . . . . . . . . . . .
√ √
3. Consider Z[ 3], r = 7 + 4 3. Then N(r) = |49 − 16.3| = 1
√
√ 7−4 3
so 7 + 4 3 isn’t a unit / is a unit* with inverse . . . . . . . . . . . . . . . . . . . .
*delete as appropriate
Note that this does give us a way of testing if a given element is a unit, but
it doesn’t give us a way of actuallly finding all the units. In fact, finding all
the units is hard in general—the following theorem tells us when it’s easy
and when it’s hard.
√
Theorem 2.3.13. Units in Z[ d]. Let d 6= 1 be a square-free integer.
2.3 Integral domains 37
√
1. If d < −1 then U(Z[ d]) = {1, −1}.
√
2. If d = −1 then U(Z[ d]) = {1, −1, i, −i}.
√
3. If d > 1 then U(Z[ d]) is infinite.
Proof.
2. (Gaussian integers)
N(a + bi) = |a2 − b2 .(−1)| = a2 + b2 .
dummy text ⇒ r = ±1 or ± i 2
Note that to make the proof of part (3) work for any other value of d, we
√
just have to find one unit in Z[ d] other than ±1.
Proof.
An element a 6= 0 ∈ Zn is a unit if and only if hcf (a, n) = 1 (Theorem 2.1.4).
This is true for all a 6= 0 ∈ Zn if and only if hcf (a, n) = 1 for all 1 < a < n
i.e. if and only if n is prime. 2
3 Factorisation
Now that we know a bit about dividing, we can think about factorisation.
One of the most crucial things about the integers is unique prime factorisa-
tion, that is:
Question: What does “unique” mean? What about these different factori-
sations of 30
30 = 2 × 3 × 5 = (−2) × (−3) × 5 = 5 × 3 × 2?
There could be some ±1 floating around, and we could change the order of
things, but that doesn’t count as genuinely different.
We’ll see that we have to be even more careful about this in rings with many
units. But first we have to make sure we know what “prime” means in an
arbitrary ring. The crucial property we want is that a prime number can’t
be factorised any more. This is actually called “irreducibility”.
3.1 Unique factorisation 39
r = st =⇒ s is a unit or t is a unit.
1,-1
1. −3 is not a unit because the units in Z are just ................
4,6,8,10,14,...
24 = 6.4 = 3.8
Remarks 3.1.4.
2. The condition saying r is not a unit is like the fact that 1 is not
considered to be a prime number.
This property is called being prime. This is not the same as being
irreducible in general, but in Z the notions happen to coincide. This
is not true in all rings!
√
Theorem 3.1.5. Criterion for irreducibility in Z[ d].
√
Let d 6= 1 be a square-free integer, and r ∈ Z[ d]. Then
√
N(r) is prime =⇒ r is irreducible in Z[ d].
Proof.
√
Let r ∈ Z[ d] with N(r) not prime.
So certainly N(r) 6= 1 so r is not a unit, by Theorem 2.3.11.
Note that this condition is sufficient but not necessary, that is, the con-
verse of the theorem is not true. i.e.
√
There exists a square-free integer d and r ∈ Z[ d] such that r is irreducible
√
in Z[ d] but N(r) is not prime.
7, 1112
Examples 3.1.6.
√ √ |4 + 7| = 11
1. In Z[ −7], N(2 + −7) = ................................................. which is
prime
√ √
so 2 + −7 is irreducible in Z[ −7].
√
2. In Z[ −7] there is no element of norm 2:
3.1 Unique factorisation 41
One moral of this is that a number can be irreducible in one ring but
not another, so it is important to say what ring we’re working in when
we’re talking about irreducibles.
Now we need to think about what “uniqueness” means for unique factori-
sations. We know that changing the order of the factors shouldn’t count
as genuinely different, but here’s something else that might confuse us es-
pecially if we’re in a ring with many units.
r = p.q
r = (pu).(u−1 q).
However the following example has genuinely different factors: check irr
√ √
6 = 2 × 3 = (1 + −5)(1 − −5)
Examples 3.1.8. It follows that associates are easiest to spot in rings with
obvious units:
2. In Z, the only units are ±1, so the only associates of r are ±r.
√
This is also the case in Z[ d] when d < −1.
3.1 Unique factorisation 43
−a − bi
−b + ai
b − ai
√
4. In Z[ d] with d > 1 there are infinitely many units, so every element
has infinitely many associates.
√
5. In Z[ d], if s and t are associates then they have the same norm,
because:
Now p = st means ur = st
⇒ r = u−1 st = (u−1 s).t
⇒ u−1 s is a unit or t is a unit (since r is irreducible)
44 Section 3. Factorisation
s = p1 p2 · · · pk
s = pq = (pu).(u−1 q).
√
Example 3.1.10. In this example we’ll work in Z[ 3] and find two factori-
√
sations of 20+7 3 that look different, but are actually related by associates.
That is, we’ll find irreducibles p1 , p2 , q1 , q2 with
√
p1 p2 = q1 q2 = 20 + 7 3
√
• N(1 + 2 3) = 1 − 4.3 = 11
√
N(1 + 2 3) = ................................. ........................
√
• N(2 + 3 3) = 4 − 9.3 = 23
√
N(2 + 3 3) = ................................. ........................
√ √
so 1 + 2 3 and 2 + 3 3 are both irreducible
11 and 23 are both prime (Theorem 3.1.5)
because ..........................................................................................
√
Now we pick a unit u = 7 + 4 3. First we check it is a unit:
√
N(7 + 4 3) = .............1
3.1 Unique factorisation 45
√
7−4 3
√
so 7 + 4 3 is a unit, with inverse u−1 = ........................................
Now consider
√
31 + 18 3
√ √
q1 = p1 u = (1 + 2 3)(7 + 4 3) = ...............................
√ √
7−4 3 −22 + 13 3
√
q2 = u−1 p2 = (...................)(2 + 3 3) = ...............................
√
20 + 7 3
Now check q1 q2 = .............................................
√
20+7 3 = (........................)(........................) = (........................)(........................)
We make this notion of “not really different factorisations” precise with the
following definition of “equivalence” of factorisations.
Examples 3.1.13.
46 Section 3. Factorisation
4. Z[i] is a UFD.
To show something isn’t, we only have to exhibit one thing with non-unique
factorisations. To show something is, we have to work much harder.
√ √
Z[ −11] and Z[ −13] are on the homework and tutorial sheets.
√
Now we will do Z[ −5].
√
Example 3.1.14. Z[ −5] is not a UFD since we have
√ √
6 = 2.3 = (1 + −5)(1 − −5).
√ √ √
We have to check that 2, 3, (1+ −5), (1− −5) are irreducible in Z[ −5],
and are not associates. So we take norms:
N(2) = 4
N(3) = 9
√ √
N(1 + −5) = N(1 − −5) = 1 + 5 = 6
√
• Now we show that in Z[ −5] there are no elements of norm 2 or 3:
Example 3.1.15.
Does the above example exhibit C as a non-UFD?
No, because those elements are not irreducibles in C—they are units.
√
Z[ −5] is a subring of C which is (vacuously) a UFD.
.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
48 Section 3. Factorisation
This means that when we do the algorithm, the r’s will get smaller and
smaller and will eventually have to become 0.
We’ll see that this does enable us to do Euclid’s algorithm on the Gaussian
integers.
We won’t prove these, but we’ll look at some examples. The point is that in
an ED we can use Euclid’s algorithm to find highest common factors, and
do that ar + bs = h thing which is kind of fiddly and annoying but useful.
Remarks 3.2.4.
in C in Z[i] in Z[i]
So hcf is −1 − i or indeed 1 + i.
Have you any idea how long it took to type that one example?
two and a half hours.
Answer: .................................
One of the main points is to show that if we have Euclid’s algorithm then
we have a UFD. In order to do this we need to know:
Theorem 3.2.7.
Let R be a Euclidean Domain, p irreducible in R, a ∈ R.
Then either 1 or p is an hcf of a and p.
Proof.
so a = k1 k2−1 p
and thus p|a # so k2 is not a unit.
Proof.
Suppose p|ab and p ∤ a. We need to show p|b.
Now, by Theorem 3.2.7 we know 1 must be an hcf of a and p.
So we have ar + ps = 1 for some r, s ∈ R.
Note that the definition gives us ≤ immediately, but we want strictly <.
Proof.
Since R is ED we have
If r = 0 then s = qst
=⇒ qt = 1
=⇒ t is a unit #
Theorem 3.2.11.
R is ED =⇒ R is UFD.
Proof.
First we show that every non-zero non-unit a has a factorisation into irre-
ducibles a = p1 p2 · · · pn .
r = r1 r2 · · · rk
s = s1 s2 · · · sl
a = p1 p2 · · · pn = q 1 q 2 · · · q m
Now pn |q1 q2 · · · qm
so by Theorem 3.2.8 pn must divide one of the qi .
Wlog pn |qm .
Part II
Groups
4 Revision
z
Definition 4.1.2. Abelian group
A group G is called Abelian if for all g, h ∈ G we have gh = hg. z
Definition 4.1.3. Order
z
Examples 4.1.4. Permutation groups
Sn is the group of permutations of n elements.
56 Section 4. Revision
• two-row notation
1 2 3 4 5 6
2 4 5 1 3 6
(12)(24)(35)
|An | = n!
2 HHH
(12)(23) = (123)
(23)(12) = (132)
4.1 Definitions and examples 57
1, a, a2 , . . . an−1
with an = 1.
α
2
This group can be generated from one reflection and all the rotations.
58 Section 4. Revision
4. Note that
D1 ∼
= C2 ∼
= S2
∼
D3 = S3
|D3 | = 6 HHH
Examples 4.2.2.
n
What is the order of am in Cn ? explain!! HHH
hcf (m, n)
lcm(m,n) n
m = hcf (m,n)
aH = {ah | h ∈ H}
Ha = {ha | h ∈ H}.
aH = bH ⇐⇒ a ∈ bH or equivalently b ∈ aH
⇐⇒ ∃h ∈ H s.t. a = bh or equivalently b = ah
⇐⇒ b−1 a ∈ H compare b − a ∈ nZ for Zn
z
Do we have aH = Ha? In general no HHH If it’s equal for all a then it’s
a normal subgroup.
Example 4.2.4.
Let G = S3 , H = A3 ⊂ S3 .
How many left cosets are there? 2 HHH
60 Section 4. Revision
Note:
• a ∈ bH ⇐⇒ aH = bH.
So if |G| is finite, the cosets form a partition of G into equal sized sets, which
gives us Lagrange’s Theorem:
|H| | |G|.
Corollary 4.2.6.
Given any g ∈ G, the order of g divides |G|
since the order of g is the order of hgi ⊂ G.
Corollary 4.2.7.
If |G| is prime then G must be cyclic.
Proof.
Let |G| = p prime and let g be any non-identity element.
Then by Corollary 4.2.6 we know that the order of g must divide p
so must be 1 or p since p is prime.
X −→ X
x 7→ g∗x
4.2 Basic theory 61
Note that
orb (x) = orb (y) ⇐⇒ x ∈ orb (y)
so we get an equivalence relation ∼ on X
3 2
4 1
Then orb (1) = {1, 2, 3, 4} HHH
stab (1) = {e, ref13 } HHH
4.2 = 8 = |D4 |
So we can check the orbit-stabiliser theorem holds: . . . . . . . . . . . . . . . . . . . . . .
62 Section 4. Revision
Note that there is a more delicate version of this theorem which also works
for infinite groups. It involves cosets. Cosets are traditionally unpopular
among students.
∼
orb (x) −→ cosets of stab (x)
y 7→ {g ∈ G | g ∗ x = y} “all ways of sending x to y”
4.3 Homomorphisms
θ : G −→ H
θ(xy) = θ(x).θ(y)
φ ◦ θ = idH
θ ◦ φ = idG . z
11, 1112
Examples 4.3.3.
Z −→ Zn
a 7→ a (mod n) ?
63
Zn −→ Z
a (mod n) 7→ a?
No—just like in the ring case, because addition isn’t the same
eg (n − 1) + 1 = 0
G −→ H
g 7→ e
5 Quotient groups
We’re going to see that we can sort of multiply and divide groups under the
right circumstances.
5.1 Subgroups
2. e ∈ H, and
Examples 5.1.2.
1. Z ⊂ Q ⊂ R ⊂ C under addition
3. An ⊂ Sn
Cn ⊆ S n
Dn ⊆ Sn
Cn ⊆ Dn
Dn ⊆ O2
4. Is D3 ⊆ D4 ? No: 6 ∤ 8
Is S3 ⊆ S4 ? Yes: always for n < m, Sn ⊂ Sm
5. SLn (F ) ⊆ GLn (F )
5.2 Cosets
Example 5.2.2.
Consider the cyclic group C12 with elements {e, a, a2 , a3 , . . . a11 }
so a12 = a0 = e.
Let H = ha4 i
so H has elements ............................................ e, a4 , a8
eH = a4 H = a8 H
aH = a5 H = a9 H
a2 H = a6 H = a10 H
aH = a7 H = a11 H
66 Section 5. Quotient groups
1 3
We have elements: e, a, a2 , b1 , b2 , b3
Note b2 = ab1
b3 = a2 b1 .
eH = {e, b1 }
aH = {a, ab1 } = {a, b2 }
a2 H = {a2 , a2 b1 } = {a2 , b3 }
b1 H = {b1 , e}
b2 H = {b2 , b2 b1 } = {b2 , a}
b3 H = {b3 , b3 b1 } = {b3 , a2 }
H = b1 H
aH = b2 H
a2 H = b3 H
Lemma 5.2.4.
Let H be a subgroup of G and a ∈ G.
Then the coset aH has the same number of elements as H.
Proof.
Certainly aH can’t have more elements that H.
It can only have fewer if ah = ah′ for some h 6= h′ ∈ H.
But ah = ah′ =⇒ h = h′ . 2
Lemma 5.2.5.
Let H be a subgroup of G.
If there is an element x ∈ G such that x ∈ aH and x ∈ bH
then aH = bH.
Proof.
x ∈ aH so x = ah1 , say.
x ∈ bH so x = bh2 , say.
Similarly bH ⊆ aH
so aH = bH as required. 2
12, 1112
68 Section 5. Quotient groups
• b ∈ aH • a ∈ bH
• ∃ h ∈ H s.t. b = ah • ∃ h ∈ H s.t. a = bh
• a−1 b ∈ H • b−1 a ∈ H
a ∼ b ⇐⇒ aH = bH.
Note that for right cosets it’s all the other way round:
• b ∈ Ha • a ∈ Hb
• ∃ h ∈ H s.t. b = ha • ∃ h ∈ H s.t. a = hb
• ba−1 ∈ H • ab−1 ∈ H
4+H = H
5+H = 1+H
5.2 Cosets 69
So 1 + H = 5 + H = 9 + H = 13 + H = · · ·
So a ∼ b ⇐⇒ a+H =b+H
⇐⇒ b−a∈H
⇐⇒ 4 | b−a
⇐⇒ a ≡ b (mod 4)
13, 1112
So we can achieve modular arithmetic by faffing around with cosets. Of
course, that’s a bit over the top for modular arithmetic, but it shows us how
we can generalise the idea of modular arithmetic to other (less obvious)
groups. This is called quotient groups. In the above example we started
with Z and “quotiented” (divided) by 4Z. In general we can quotient by
any normal subgroup.
∀ a ∈ G aH = Ha
∀ a ∈ G, h ∈ H aha−1 ∈ H.
We write H G. z
Examples 5.2.9.
use b1 a = b3 , b1 a2 = b2
eH = {e, b1 } He = {e, b1 }
So the left cosets do not equal the right cosets, so H is not a normal
subgroup.
The point is that if we have a normal subgroup H G then the cosets form
a group. Later we’ll see how to think of this as an equivalence relation.
|G|
|G/H| =
|H|
(aH).(bH) = (ab)H
= b−1 −1 −1
2 (a2 a1 ) b2 . b2 b1 trick
| {z } | {z }
∈H ∈H
| {z }
∈H
Examples 5.3.2.
1. nZ = { nk | k ∈ Z }
This is a normal subgroup of Z since Z is abelian.
We formed the quotient group before: Z/nZ = Zn
2. Sn /An ∼
= C2
Dn /Cn ∼
= C2 .
Here’s something else we won’t really be using, but it’s included for com-
pleteness. It’ll be very important in the future.
6 Conjugacy
6.1 Definitions
Examples 6.1.2.
Lemma 6.1.3.
Given a, g ∈ G, the order of gag −1 equals the order of a.
Proof.
Suppose the order of a is n, so n is the smallest natural number such that
an = e.
so ak = g−1 g
= e # contradicts the order of a being n
= { gag −1 | g ∈ G }
The centraliser of a in G is
centG (a) = “all those elements that commute with a”
= { g ∈ G | gag −1 = a } z
In particular
|conjG (a)| | |G|
and we can partition G into conjugacy classes. not all equal sizes
Proof.
eae−1
1.∀a ∈ G : e ∗ a = ...............................
= a tick
g ∗ (hah−1 )
2.∀g, h, a ∈ G : g ∗ (h ∗ a) = ............................... substitute definition of h∗
g(hah−1 )g−1
= ............................... substitute definition of g∗
(gh).a.(gh)−1
= ............................... re-associate, and
use definition of (gh)−1
= (gh) ∗ a
2
76 Section 6. Conjugacy
We won’t quite prove it, but we will show how to “do” it.
Example 6.1.7.
In S6 consider a = (123)(45).
The conjugacy class is all elements of cycle type 3, 2.
(213)(36), (314)(25), . . .
E.g. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6.5.4
. 3 = 120
3
6! 6!
|centS6 (a)| = = = 3.2 = 6
120 6.5.4
(9247)(658)(31)
967534182
(19264537)
i) Write θ in cycle notation: .........................................
(73546291)
ii) Write θ −1 in cycle notation: .........................................
4
3
2
In D4 we have elements e, a, a2 , a3 , b1 , b2 , b3 , b4
a is rot anticlockwise, bi is ref in the line i
{a, a3 }
So the conjugacy class of a is . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
{a2 }
So the conjugacy class of a2 is . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
eb1 e = b1 b1 b1 b1 = b1
ab1 a−1 = b3 b2 b1 b2 = b3
a2 b1 a−2 = b1 b3 b1 b3 = b1
a3 b1 a−3 = b3 b4 b1 b4 = b3
{b1 , b3 }
So the conjugacy class of b1 is . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6.2 The class equation 79
{b2 , b4 }
• It follows that the remaining conjugacy class is . . . . . . . . . . . . . . . . . . . . .
How do we know? What sort of elements are in conjugacy classes of
their own? —only those that commute with everything, and we know
that reflections don’t commute with rotations.
1, 1, 2, 2, 2 total elements = 8
1+1+2+2+2 = 8
C1 , C2 , . . . , Ck .
1+2+3=6
So in S3 we have class equation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Cycle types in S5 :
5 (12345) = (12)(23)(34)(45) 5!
5 24 2 2
X
4, 1 (1234) = (12)(23)(34) 5!
5 30 2
X 2
3, 2 (123)(45) = (12)(23)(45) 5.4.3.2
4 20 2
X 2
3, 1, 1 (123) = (12)(23) 5.4.3 2.1
3 . 2 20 2 2
X
2, 2, 1 (12)(34) 5.4 3.2 1
2 . 2 .2 15 2 2
X
2, 1, 1, 1 (12) 5.4
2 10 2
X 2
1, 1, 1, 1 e 1 2 2
X
60
5! = 120 Total even = ............
1 + 10 + 15 + 20 + 20 + 30 + 24 = 120
Example 6.2.4.
Suppose |G| = 7.
Then the class equation must be:
1+1+1+1+1+1+1= 7
Example 6.2.5.
Suppose |G| = 8.
Then the possibilities are:
11111111
1111112
111122
11114
11222 ←− this one is D4
1124
Question: What do those 1’s tell us? That is, what kind of element is in
a conjugacy class of its own?
∀g ∈ G gag −1 = a
i.e. ga = ag
Z(G) = { a ∈ G | ∀g ∈ G ga = ag }
= { a ∈ G | ∀g ∈ G a ∈ centG (g) }
\
= centG (g)
g
z
∀g ∈ G, ga = ag ∀g ∈ G, gag −1 = a
Proposition 6.2.8.
For any group G, Z(G) is a normal subgroup of G. Z(G) G
Proof.
g.e.g−1 = e
Also the identity is in Z(G) because ......................................
Finally if a ∈ Z(G) then a−1 ∈ Z(G) because
g.a−1 .g−1 = (g −1 .a.g)−1 = a−1
Note that looking at the class equation, we see Z(G) appearing in the form
of all the 1’s.
1+1+2+2+2=8
1 + 1}+2 + 2 + 2 = 8
| {z
centre
1 + 10 + 15 + 20 + 20 + 30 + 24 = 120
trivial
so the centre is . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3. Let |G| = 8. We saw all the possible class equations in Example 6.2.5.
We deduce that the centre must be non-trivial.
84 Section 6. Conjugacy
Proposition 6.2.10.
Let G be a group of order pk where p is prime.
Then Z(G) must be non-trivial.
Proof.
The only possible numbers in the class equation are:
Theorem 6.2.11.
Let G be a group and H a subgroup.
Then H is normal if and only if it is a union of conjugacy classes.
1 + 1 + 2 + 2 + 2
e a2 {a, a3 } {b1 , b3 } {b2 , b4 }
1,2,4,8
.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
by . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Theorem Lagrange’s
17, 1112
.....................................................................
.....................................................................
• Conversely suppose H G.
Given h ∈ H we want to show conjG (h) ⊆ H.
β θ s.t. θαθ −1 = β θ
ODD EVEN
(123) e 2 2
X
(132) (23) 2
X 2
(124) (34) 2
X 2
(142) (243) 2 2
X
(134) (234) 2 2
X
(143) (24) 2
X 2
(234) (1234) 2
X 2
(243) (124) 2 2
X
This conjugacy class splits into two classes in A4 :
7 Homomorphisms
multiply in G multiply in H
xy θ(xy)
do θ
• θ(e) = e
• θ(a−1 ) = (θ(a))−1
= { g ∈ G | θ(g) = e }
= { θ(g) | g ∈ G }
Lemma 7.1.2.
Let θ : G −→ H be a homomorphism. Then
1. Ker θ is a subgroup of G.
2. Im θ is a subgroup of H.
Proof.
θ(a)θ(b)
θ(ab) = ................................... by definition of group homomorphism
e.e
= ........................ since a, b ∈ Ker θ
e
= ........................ by definition of e.
7.1 Kernels and images 91
(θ(a))−1
θ(a−1 ) = ................................... by standard result for group homomorphisms
e−1
= ........................ since a ∈ Ker θ
e
= ........................ by definition of e.
θ(a)θ(b)
xy = ................................... (substitute)
θ(ab)
= ........................ by definition of group homomorphism
So xy ∈ Im θ as required.
• Given x ∈ Im θ we show x−1 ∈ Im θ:
Put x = θ(a), say.
Then
(θ(a))−1
x−1 = ................................... (substitution)
θ(a−1 )
= ........................ by standard result for group homomorphisms
So x−1 ∈ Im θ as required. 2
Example 7.1.3.
Let G = GLn (R), the group of invertible real n × n matrices.
Let H = R \ {0} under multiplication.
θ(A) = det A.
92 Section 7. Homomorphisms
• Im θ = H
Example 7.1.4.
D3 acts on the vertices of an equilateral triangle giving a homomorphism
D3 −→ S3 .
• Ker θ = {e}
G −→ Sn .
18, 1112
7.1 Kernels and images 93
Example 7.1.5.
Consider the following polynomials in x1 , x2 , x3 , x4 :
p 1 = x1 x2 + x3 x4
p 2 = x1 x3 + x2 x4
p 3 = x1 x4 + x2 x3
Then as S4 permutes x1 , x2 , x3 , x4
it also permutes p1 , p2 , p3
p3
x2 x3 + x1 x4 ......... p1 p2
(14)(23) : x1 x2 + x3 x4 p1 p2 p3
x4 x3 + x2 x1 p1 p2 p3
............................ ......... ......... .........
θ : S4 −→ S3
The kernel and image are intimately related to injectivity and surjectivity.
In fact, they basically are injectivity and surjectivity.
94 Section 7. Homomorphisms
A function f : A −→ B is
f (a1 ) = f (a2 ) =⇒ a1 = a2
• injective if . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
∀b ∈ B ∃a ∈ A s.t. f (a) = b
• surjective if . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
If you can’t remember this then write a 5-step plan for how you’re going to
remember it:
1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof.
“ =⇒ ”
Suppose θ is injective.
Let g ∈ Ker θ, so θ(g) = e.
We need to show g = e:
Now θ(g) = e = θ(e)
but θ is injective so this implies g = e.
7.1 Kernels and images 95
“⇐=”
Conversely suppose Ker θ = 0.
Let g1 , g2 ∈ G with θ(g1 ) = θ(g2 ). (1)
We need to show g1 = g2 :
Now we have
θ(g1 )−1 .θ(g2 ) = θ(g1−1 ).θ(g2 ) standard property of homs
= θ(g1−1 .g2 ) by definition of hom
So θ(g1−1 .g2 ) = e
Lemma 7.1.7.
Let θ : G −→ H be a homomorphism. Then
θ is surjective ⇐⇒ Im θ = H
I’m not sure that even deserves to be called a Lemma, as it’s just the defi-
nition of Im . Oh well, it deserves emphasis.
G ∼
Ker θ = Im θ
This tells us many things e.g.
|G|
|Im θ| =
|Ker θ|
Moreover, it means that to understand “multiple hits” we only have to
understand what gets sent to e.
We’d better recall quotient groups, and also check that Ker θ is a normal
subgroup, so that we can quotient by it.
96 Section 7. Homomorphisms
Proposition 7.1.8.
Let θ : G −→ H be a homomorphism.
Then Ker θ is a normal subgroup of G.
Proof.
We already know Ker θ is a subgroup of G (Lemma 7.1.2).
θ(g).θ(a).θ(g−1 )
Now θ(gag −1 ) = .......................................... since θ is a homomorphism
θ(g).e.θ(g−1 )
= .......................................... since a ∈ Ker θ
θ(g).θ(g−1 )
= .......................................... by definition of e
θ(g.g−1 )
= ........................ since θ is a homomorphism
θ(e)
= ................... by definition of inverse
e
= ............... since θ is a homomorphism
• The first important thing to remember about quotient groups is: what
are the elements?
The elements are the cosets aH
.....................................................................
• The next important thing to remember is: what is the group opera-
tion?
(ab)H
..............................
AB = { ab | a ∈ A, b ∈ B }
Note that some of these elements may be the same as each other, as in the
next example.
{e, a, a2 , . . . , a11 }.
Let A = {a, a2 , a3 }
B = {a4 , a5 , a6 }
{a5 , a6 , a7 , a8 , a9 }
Then AB = . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
98 Section 7. Homomorphisms
a, a5 , a9
A = aH = ......................
a2 , a6 , a10
B = a2 H = ......................
{a3 , a7 , a11 }
Then AB = . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
a3 H
So (aH).(a2 H) is the coset ...........................
This works because
H C12 since C12 is abelian.
.....................................................................
(aH)(bH) = (ab)H
7.2 Quotient groups revisited 99
Example 7.2.2.
Consider the group D3 with multiplication table (with the usual notation):
e a a 2 b1 b2 b3
e e a a 2 b1 b2 b3
a a a2 e b2 b3 b1
a2 a2 e a b3 b1 b2
b1 b1 b3 b2 e a2 a
b2 b2 b1 b3 a e a2
b3 b3 b2 b1 a2 a e
a
ii) The set (eH).(aH) has elements ea = ...........
b2
eb2 = ...........
b4
b1 a = ...........
a2
b1 b2 = ...........
No—wrong number of elements
iii) Is this a coset of H? .............................................
b1 b2 b3
eb1 = ......... ab1 = ......... a2 b1 = .........
b2 b3 b1
eb2 = ......... ab2 = ......... a2 b2 = .........
b3 b1 b2
eb3 = ......... ab3 = ......... a2 b3 = .........
(aH).(bH) = (ab)H
H.(aH) = (aH).H = aH
(aH)(a−1 H) = eH = H
(a−1 H)(aH) = eH = H z
x ∼ y ⇐⇒ y −1 x ∈ H.
[x].[y] = [xy]
[x] = [y] ⇐⇒ xH = yH
Theorem 7.2.4.
Then G is abelian.
Proof.
Write Z = Z(G)
and pick a generator gZ of G/Z. NB g is now fixed.
This means every element of G/Z is of the form (gZ)n = gn Z.
Then ab = gm z1 .gn z2
z1 ∈ Z so commutes with everything
= gm gn z2 z1 since ...............................................
g m gn = gm+n = g n gm
= gn gm z2 z1 since ...............................................
Theorem 7.2.5.
If p is prime then every group of order p2 is abelian.
cyclic
Note we already know that every group of order p is . . . . . . . . . . . . . . . . . . . . .
Proof.
We aim to show Z(G) = G.
We use Proposition 6.2.10 which says that in a group of order pk (with p
prime), the centre must be non-trivial. from class equation
G ∼
Ker θ = Im θ.
If we only had a function of sets, how could we ever tell anything about
anything??
stuff about even covering, e pulling things in
Remarks 7.3.2.
Note that we have some special cases:
G∼
= Im θ.
2. If θ is surjective we have Im θ = H
so the First Isomorphism Theorem says:
G ∼
Ker θ = H.
3. So if θ is an isomorphism
the First Isomorphism Theorem says:
G∼
=H
as expected.
G −→ G/N
Then
hrot 2π i ∼ = Cn
• Ker θ = . . . . . . . n. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
O2 ∼
Cn = O2
.........................................
We can picture the cosets as
• • •
• •
• •
• •
• • •
7.3 First isomorphism theorem 105
Example 7.3.5.
Define θ : R −→ SO2 by
α 7→ rotα
Then
SO2
• Im θ = . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
R ∼
Z = SO2
..................................................
Example 7.3.6.
Define θ : Dn −→ Z2 by
0 if α is a rotation
α 7→
1 if α is a reflection
Then
Z2
• Im θ = . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Dn ∼
Cn = Z 2
..................................................
106 Section 7. Homomorphisms
Example 7.3.7.
D6 acts on the diagonals of the regular hexagon.
3
2
So we get a homomorphism θ : D6 −→ S3 .
Then
{e, rotπ }
• Ker θ = . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
• We can deduce what the image is from the First Isomorphism Theo-
rem, which says:
D6 ∼
= Im θ ⊆ S3
Ker θ
↑ ↑
12
order = 2 =6 order = 6
6
So Im θ has order ....... and is a subgroup of S3 ,
the whole thing.
so must be .................................
7.3 First isomorphism theorem 107
Now aK = bK ⇐⇒ a−1 b ∈ K
=⇒ θ(a−1 b) = e
=⇒ θ(a−1 ).θ(b) = e
=⇒ θ(a)−1 .θ(b) = e
=⇒ θ(a) = θ(b).
so f ((aK)(bK)) = f ((ab)K)
= θ(ab)
= θ(a).θ(b) since θ is a homomorphism
= f (aK).f (bK)
108 Section 7. Homomorphisms
f (x) = f (aK)
= θ(a)
= y.
θ(a) = e =⇒ a ∈ Ker θ
=⇒ aK = K
Part III
• Please make sure you read any hints given in the questions. It’s
extraordinary number of times tutors get asked questions which are in
fact answered in the hints...
• You should always justify all your answers. If a question says “Is 14
a zero-divisor?” don’t just answer yes or no – say how you decided
that was the answer. When you write out your working, include some
explanation about what you did. This is good practice for exams, but
is also useful for the marker so they can understand what you were
doing (and therefore be in a better position to help you if it went
wrong). It’s also useful for you, because when you’re revising you
should be going back over your homework to make sure you understand
it better than you did the first time round.
111
8 Homework questions
Homework #1
This set looks long, but it isn’t actually long. There’s a lot stuff here that isn’t so much
question as some explanation about why these questions are useful things for you to
think about.
1. On the next page is a page of statements I have copied from some Semester One
exams I have marked. Imagine this is work that a student has handed in. Mark it in
the way that you would like to see your homework marked. (Pen or pencil? Marks
out of 10 or a letter grade? Encouragement or criticism? Helpful comments?)
This exercise is partly to help you think about how you should read over your own
work to see if it is correct, partly so I can see what you consider to be useful
feedback on your work, and partly to make sure you won’t ever make any of the
same mistakes listed here.
2. This question is to jog your memory about modular arithmetic. Let n ∈ N and
a ∈ Z.
• Recall that n|a means ∃k ∈ Z s.t. a = kn.
• Recall that “x ≡ y (mod n)” means n|(x − y).
Suppose x ≡ y (mod n). Show that:
i) a + x ≡ a + y (mod n), and
ii) ax ≡ ay (mod n).
3. This question is about attempting to work in Z6 . Taking square roots and solving
quadratic equations don’t necessarily work the way we’re expecting...
i) In a ring R, x is said to be a square root of y when x2 = y. Find the elements
of Z6 that have square roots i.e. find all the elements a ∈ Z6 such that there
exists x ∈ Z6 s.t. x2 with a (mod 6)
You might find it useful to use the multiplication table from the tutorial sheet.
You should find that not all elements have square roots: there are only four
that do. Are you surprised?
ii) Find all solutions of x2 + 3x + 2 = 0 in Z6 . You will probably need to do it
by trial and error, because our usual methods for solving quadratic equations
won’t work here. Why? Note how many solutions there are. Did it surprise
you?
112 Section 8. Homework questions
1 1 1
1. + =
a b a+b
2. (a + b)n = an + bn
2
4. 3x = =⇒ x = 2
3
3
n + n−1
5. 4 = 2(n + n−1 )3
2
1 1
6. e1− 2 = e− 2
3 1 2 2 3 1 2
7. e − + =e −
3 9 27 3 9
9. 3ex + e−3x = 0
Homework #2
1. Match the following informal statements with their formal counterparts. Note that
these are all facts that could be true in a ring R, but aren’t necessarily true about
all rings.
i) The additive inverse of −1 is 1.
ii) The multiplicative inverse of −1 is −1.
iii) 0 has no multiplicative inverse in R.
iv) If x has a multiplicative inverse then so does −x.
v) If x and y are in R it isn’t necessarily true that xy is non-zero.
vi) Every non-zero element of R has a multiplicative inverse.
A) (−1)(−1) = 1
B) ∃x, y ∈ R s.t. xy = 0
C) ∀x 6= 0 ∈ R ∃y ∈ R s.t. xy = yx = 1
D) −(−1) = 1
E) ∀x ∈ R, 0x 6= 1
F) ∃y ∈ R s.t. xy = yx = 1 ⇒ ∃z ∈ R s.t. (−x)z = z(−x) = 1
2. Find all the units in Z10 and fill in a multiplication table for them.
√ √ √
3. Let R = Z[ 7]. Let r = 8 − 3 7 and s = 8 + 3 7. Compute rs and deduce that
r and s are units in R. Hence solve this equation in R:
√
(8 + 3 7)x = 3
This should rather remind you of the process of “rationalising the denominator”.
114 Section 8. Homework questions
Homework #3
1. Match the following statements with their negations. Note that I’m trying to catch
you out.
i) ∀x ∈ R x.0 = 0 A) ∀x ∈ R, x.0 6= 0
iv) ∀x = y ∈ R, xy = 0 D) ∀x 6= y ∈ R, xy 6= 0
Homework #4
1. What does “hence” mean in a maths question? eg “i) Prove this. ii) Hence do
that.” By contrast, what does “hence or otherwise” mean?
You might think this is a silly question, but the reason I’m asking it is that loads
of people always get it wrong in exams.
2. For every element a in Z24 determine whether a is a unit or a zero-divisor. If a is
a unit find its inverse, and if a is a zero-divisor find b 6= 0 such that ab = 0. Write
your answers out in a table, so that it’s easier to read.
3. Is 523 is a unit or a zero-divisor in Z570 ? If it is a unit find its inverse, and if it is
a zero-divisor find b 6= 0 such that 523b = 0.
Homework #5
√
1. Find a unit r ∈ Z[ 11] such that r > 1. Hence show that the group of units of
√
Z[ 11] is infinite.
√
2. This question is about Z[ −13].
√
i) Show that Z[ −13] has no element of norm 2 or 11.
√
ii) Hence show that any element of Z[ −13] with norm 4, 22 or 121 is irreducible
√
in Z[ −13].
√
iii) Calculate the norm of (3 + −13).
√
iv) Hence express 22 as a product of two irreducible factors in Z[ −13] in two
√
different ways, and deduce that Z[ −13] is not a unique factorisation domain.
Hint: copy the procedure on Example 3.1.12. You must show that your two
factorisations are non-equivalent, and that all your factors are irreducible.
3. If R is a unique factorisation domain and S is a subring of R, does it follow that
S is a unique factorisation domain?
116 Section 8. Homework questions
Homework #6
This whole sheet is revision from Groups and Symmetries, so you may need to look things
up from your old notes. I know it’s hard to remember things from previous modules, so
this homework is to help you jog your memory in preparation for the groups part of our
course.
1. Write down the whole multiplication table for D3 , the group of symmetries of the
equilateral triangle. Then look it up on Wikipedia to check your answer.
2. Consider the square with lines of symmetry labelled 1, 2, 3 and 4 as below.
4
3
2
Recall that D4 is the group of symmetries of the square, and observe that it acts
on the lines 1, 2, 3, 4.
i) For each element of D4 , write down the corresponding permutation of 1, 2, 3, 4
in a table like the one below. In this table, e is the identity of the group, a is
π
rotation through anti-clockwise, and bi is reflection in the line i.
2
1 2 3 4
e
a
a2
a3
b1
b2
b3
b4
4
3
2
Are these lines are acted on by O2 (the group of symmetries of the circle) as
for the square above?
118 Section 8. Homework questions
Homework #7
1. Recall that D3 is the group of symmetries of the equilateral triangle. Consider the
equilateral triangle with corners labelled as below.
2 3
1
1 2
1 2 3
e
a
a2
b1
b2
b3
Homework #8
1. Write down all possible cycle types in S6 . For each cycle type, write down a typical
permutation of that type, and calculate the number of permutations of that type.
Please try to lay out your answers nicely so that they’re easy to read.
2. Now consider the symmetric group S9 and let
1 2 3 4 5 6 7 8 9
α= .
9 4 1 8 7 5 2 6 3
Homework #9
Note that Q.2 is just like the last question on Tutorial #9, so you can follow
that model answer through.
1. i) Write down all possible cycle types in S4 , and the number of elements of S4
of each type.
ii) Using your answer to part (i), write down the class equation for S4 .
iii) Identify the conjugacy classes consisting of even permutations. These numbers
cannot give the class equation for A4 . Why?
iv) Recall that A4 is a normal subgroup of S4 . Use the class equation for S4 to
show that if there is another non-trivial normal subgroup of S4 it must have
order 4.
Recall: to be a normal subgroup, its order must both divide 24 and be a sum
of conjugacy class sizes including one class of size 1 for the identity.
v) Write down the four elements that would have to be the four elements of this
group, according to the conjugacy class sizes you found in part (i). Verify that
these elements do in fact form a subgroup of S4 .
2. Let G be a group of order 39 and suppose that the centre of G is {e}.
i) Determine the class equation for G, justifying your answer carefully.
ii) Find the number of elements of order 3 and the number of elements of order
13 in G.
iii) Let h ∈ G be an element of order 13. Let H = hhi, the subgroup generated
by h. Use the class equation to show that H is a normal subgroup of G.
iv) Show that H is the only normal subgroup of G other than the trivial group
{e} and G itself.
121
9 Tutorial questions
Tutorial questions #1
1. We write Zn for the ring of integers mod n. Fill in the following multiplication
tables for Z3 , Z4 , Z5 and Z6 :
× 0 1 2 3 4 5
× 0 1 2 3 4
× 0 1 2 3 0
× 0 1 2 0
0 1
0 1
1 2
1 2
2 3
2 3
3 4
4
5
2. In a ring R, b is said to be a multiplicative inverse for a if ab = ba = 1. Use the
tables you filled in above to find the multiplicative inverses for the elements of Z3 ,
Z4 , Z5 and Z6 if they exist.
3. A field is a ring in which every non-zero element has a multiplicative inverse.
Which of the above rings is a field? State precisely what it means for a ring not
to be a field.
4. An integral domain is a ring in which 1 6= 0 and
a 6= 0 and b 6= 0 ⇒ ab 6= 0.
Which of the above rings is an integral domain? State precisely what it means for
a ring not to be an integral domain.
5. In the Countdown video we watched, the last stage of James Martin’s calculation
was to divide 23,800 by 25. Carol Vorderman vaguely says out loud “Well to do
that you multiply by 4...” which shows she’s using the trick that dividing by 25
is the same as multiplying by 4 and dividing by 100 (both of which are probably
easier to do in your head than dividing by 25 directly). Which ring axiom is she
using here?
6. We will define a binary operation ⊗ on Z by
a ⊗ b = ab + 1.
122 Section 9. Tutorial questions
Show that this operation is not associative. Can you think of a binary operation
on Z that is not commutative?
7. In any ring R, we can prove using only the ring axioms that −(−1) = 1. Is the
following a valid proof?
∀x ∈ R, (−1)x = −x.
Observe that the result is true – but this doesn’t mean the proof is valid. Moreover
observe that all the equalities valid – but this still doesn’t mean the proof is valid.
What is wrong with it? Can you write a valid proof?
If you found the earlier questions easy, see if you can prove that the following are true
in every ring R. You should prove them directly from the ring axioms, without using
any other “facts” that you know to be true, even if they seem very obvious!
1. ∀x ∈ R, 0.x = 0.
2. ∀x, y ∈ R, (−1)x = −x.
3. ∀a, b, c ∈ R, a + b = 0 and a + c = 0 ⇒ b = c.
123
Tutorial questions #2
= (x2 + xy) + (−y).x + (−y).y by ...........................................(2)
= x2 + xy + ((−y).x + (−y).y) by ...........................................(3)
= x2 + (xy + (−y).x) + (−y).y by ...........................................(4)
= x2 + (xy + (−(yx))) + (−y 2 ) by ...........................................(5)
= x2 + (xy + (−(xy))) + (−y 2 ) by ...........................................(6)
= x2 + (0 + (−y 2 )) by ...........................................(7)
= x2 + (−y 2 ) by ...........................................(8)
= x2 − y 2 by definition of subtraction
Note that proofs should always include a justification of how each line of the argu-
ment followed from the previous line.
2. i) Write out a multiplication table for Z8 .
ii) Find the units in Z8 . Recall that the units are those elements with a multi-
plicative inverse.
iii) Now write out a multiplication table just for the units in Z8 . Use this to show
that the units of Z8 form a multiplicative group.
3. If x and y are units is x + y necessarily a unit?
The previous question about the units in Z8 may help you with this.
4. Let R be a commutative ring and x ∈ R. Prove that x has at most one multiplica-
tive inverse, that is, if xa = 1 and xb = 1 then a = b. Just copy the proof of the
result for additive inverses, but make it multiplicative instead.
124 Section 9. Tutorial questions
√
5. This question is to give you some practice with the rings Z[ d], which consists of
√
all numbers of the form a + b d where a, b ∈ Z. We’ll look at the case d = 2.
These might look a bit like polynomial rings but actually they’re a bit different.
i) Let a, b ∈ Z. Calculate (a + bx)(a − bx) ∈ Z[x].
√ √ √
ii) Let a, b ∈ Z. Calculate (a + b 2)(a − b 2) ∈ Z[ 2].
iii) These two situations might not look very different so far. But now do it for
a = 5, b = 3. What happens?
√ √
iv) Can you think of some non-zero values of a and b that give (a+b 2)(a−b 2) =
1?
v) Can you think of some non-zero values of a and b that give (a+bx)(a−bx) = 1?
vi) What’s the point I’m trying to make here??
6. i) Let a, n, r, s be integers such that
ar + ns = 1.
{ a 6= 0 and b 6= 0 } ⇒ ab 6= 0
∃a 6= 0 and b 6= 0 s.t. ab = 0.
Recall also that on the Tutorial Sheet 1 you found that Z3 and Z5 are integral
domains, but Z4 and Z6 are not integral domains.
Show that Zn is not an integral domain for n = 8, 9, 10. Can you guess what
property of n determines whether or not Zn is an integral domain? Can you prove
it?
125
Tutorial questions #3
1. The following are some submitted “proofs” from homework #1. The question
asked you to prove: if x ≡ y (mod n) then ax ≡ ay (mod n). Which of the
following is a valid proof? What is wrong with the others?
• “Proof” A:
ax ≡ ay (mod n) =⇒ n|ax − ay
=⇒ n|a(x − y)
=⇒ n|x − y
=⇒ x ≡ y (mod n)
• “Proof” B
x ≡ y (mod n) so multiplying both sides by a gives
ax ≡ ay (mod n).
• “Proof” C
x≡y (mod n) = n|x − y
= n|a(x − y)
= n|ax − ay
= ax ≡ ay (mod n)
• “Proof” D
v) Did this surprise you? Can you see why it’s true?
To find roots you need to find values of x for which the given formula comes out
to 0.
x2 + 3x + 2 = (x + 1)(x + 2)
(x + 1)(x + 2) = 0 =⇒ x + 1 = 0 or x+2=0
=⇒ x = −1 or x = −2
5. For any integer n > 0, define φ(n) to be the number of integers coprime to n in
the set
{1, 2, 3, . . . , n}.
Fill in the following table. In the second column you should write all the integers
between 1 and n and coprime to n that you will be counting in the third column.
This function φ is called Euler’s Totient Function, and is quite a useful tool. In
the next few questions we’ll see that there are clever ways of calculating φ(n) other
than writing down all the relevant coprime integers and counting them.
127
1 1 1
2 1 1
3 1, 2 2
4 1, 3 2
5 1, 2, 3, 4 4
6
7
8
9
10
11
12
6. Show that if p is prime, φ(p) = p − 1.
7. Show that if p and q are distinct prime numbers
φ(pq) = φ(p)φ(q).
n2 |d ⇒ n2 = 1.
i) Show that if d|a2 then d|a. Hint: think about the prime factors of d.
√
ii) Hence prove that d is irrational.
√
Hint: Copy the proof overleaf that 2 is irrational, but be careful about where
you have to use part (i).
128 Section 9. Tutorial questions
√
Proof that 2 is irrational: by contradiction
√
Suppose 2 is rational.
√ a
Put 2= where a, b ∈ Z and the fraction is in its lowest terms
b
i.e. hcf (a, b) = 1.
a2
Then 2 =
b2
=⇒ 2b2 = a2
=⇒ 2|a2
=⇒ 2|a since 2 is prime
=⇒ a = 2k for some k ∈ Z
=⇒ 2b2 = (2k)2 = 4k2
=⇒ b2 = 2k2
=⇒ 2|b2
=⇒ 2|b since 2 is prime
So 2|a and 2|b # contradicts hcf (a, b) = 1.
√
Hence 2 is irrational as required. 2
129
Tutorial questions #4
1. This question is about the group of units in Zn again, but this time we’ll go a step
further and analyse what the group of units actually is. This is also to jog your
memory a bit about some group stuff from MAS175. “Recall” that a cyclic group
is one in which there is an element a such that every other element of the group is
a power of a. Such an a is called a generator.
i) On homework #2 you found the multiplication table for the unit group of Z10 .
Find an element of the unit group that has order 4. Remember, the order of
an element a is the smallest integer k > 0 such that ak = 1.
ii) Deduce that this group is cyclic.
Oh OK I’ll do it for you: a group of order n is cyclic if and only if it has an
element of order n. In fact any element of order n is a generator.
iii) The above was the boringly efficient way of showing that the unit group in this
case was cyclic. Something a bit more fun is to rewrite the multiplication table.
Take your element of order 4 – let’s call it a. Then reorder your multiplication
table like this:
× 1 a a2 a3
1
a
a2
a3
except that you’ll put the actual numbers in, instead of a, a2 , a3 . Now fill in
the table, and you should see the nice swirly pattern associated with a cyclic
group.
iv) Now, since I practically did that whole thing for you, do the whole thing for
Z9 . Start by writing down the units and their multiplication table, then show
that the group is cyclic, and reorder the table to get the cyclic pattern.
This is called the norm of an element, and we’ll be seeing more of this useful gadget
soon.
Calculate N(r) for the following elements.
√ √
i) 3 + 2 2 ∈ Z[ 2]
√ √
ii) 8 + 3 7 ∈ Z[ 7]
√ √
iii) 17 − 12 2 ∈ Z[ 2]
5. i) Show that all the above elements are units in their respective rings.
ii) What point do you think I’m trying to make here?
6. This question is related to Homework #2, question 3.
a
i) Let R be a ring, and a, b ∈ R. What does mean ?
b
ii) On the homework, you solved the equation
√
(8 + 3 7)x = 3.
This method is the one that some people used in the homework. However
√
here it does not give a solution in Z[ 7], which means that something in the
√
solution method isn’t valid in Z[ 7]. What is it? Hint: part (i) of this question
is supposed to be relevant. The point of this question is to get you to think a
bit more about what division “is”.
√
(10 + 3 7)x = 3
3
x = √
10 + 3 7
√
3 10 − 3 7
= √ . √
10 + 3 7 10 − 3 7
√
30 − 9 7
=
37
iii) Do you think question 5 sheds any light on this matter?
7. Do question 2 again but for Z21 .
132 Section 9. Tutorial questions
Tutorial questions #5
√ √
1. Recall that the norm of a + b d ∈ Z[ d] is |a2 − b2 d|. Find the norm of each the
following elements:
√ √ √ √ √
i) (1 + 2 3), (1 − 2 3), (−1 + 2 3), (−1 − 2 3) ∈ Z[ 3]
√ √ √ √
ii) 3 ∈ Z[ 2], 3 ∈ Z[ 3], 3 ∈ Z[ −7], 3 ∈ Z[ −11]
√ √ √ √ √
iii) (5 + 2 6), (5 − 2 6), (−5 + 2 6), (−5 − 2 6) ∈ Z[ 6]
√ √
iv) 3 + 2 2 ∈ Z[ 2]
√ √ √
v) (5 + 2 −11), (2 + 5 −11) ∈ Z[ −11]
2. Write down three more elements with the same norm as
√
6174952171 + 6174955132 410533
Those are the phone and fax numbers of the Harvard maths department, in case
you were wondering.
3. Which of the elements in Question 1 are units of their respective rings? Write
√
down 4 more units in Z[ 2].
Remember that r is a unit iff N (r) = 1.
√
4. Write a list of all possible norms less than 20 of elements in Z[ −7].
Norms have to be non-negative integers, but not all non-negative integers are valid
norms in all rings. This gives us important information when we’re analysing
those rings, sometimes, as we’ll see later.
5. An element r ∈ R is called irreducible if r is not a unit, and
r = st ⇒ s is a unit or t is a unit.
But it turns out that r can be irreducible even if N (r) is not prime, and this
depends on the fact that not all integers are valid values of N (r), as we saw in
question 4.
√
i) Show that there is no element in Z[ −11] whose norm is 3.
Hint: to get a norm of 3, we’d have to find a, b ∈ Z such that a2 + 11b2 = 3.
Is that possible?
√
ii) Consider s, t ∈ Z[ −11]. Show that if N (st) = 9 then N (s) = 1 or N (t) = 1.
√
iii) Deduce that 3 is irreducible in Z[ −11] even though N (3) is not prime.
√
iv) Is 3 irreducible in Z[ −3]?
7. This question pushes the previous question a bit further and finds some non-unique
√
factorisation in Z[ −11].
√
i) Show that there is no element of norm 23 in Z[ −11].
ii) Show that if N (r) = 69 then r must be irreducible.
Hint: 69 = 3 × 23.
√ √ √
iii) Show that (5+2 −11), (5−2 −11), 3, and 23 are all irreducible in Z[ −11].
√
iv) Write down two different factorisations of 69 into irreducibles in Z[ −11].
That is, find rs = r ′ s′ = 69 where r, s, r ′ , s′ are all irreducible, and r ′ , s′
cannnot be obtained from r, s by multiplying by units. This shows that
√
Z[ −11] is not a UFD.
√
To do the last part you need to remember what the units in Z[ −11] are.
8. This question is about expressing integers as the sum of two squares.
Consider r = (1 + 2i)(3 + 4i) = −5 + 10i ∈ Z[i]. Now N (r) = 52 + 102 = 125 but
also we know that (1 + 2i)(3 − 4i) must have the same norm as r. (Why??) And
(1 + 2i)(3 − 4i) = 11 + 2i
so taking the norm of that, we get 112 + 22 = 125. Expressing things as the sum
of two squares is Interesting, and look! We’ve done it in two different ways.
Now you do it – consider
(2 + 3i)(4 − 5i) = 23 + 2i
and copy the above procedure to express 533 as a the sum of two squares in two
different ways.
134 Section 9. Tutorial questions
Tutorial questions #6
1. This question is to jog your memory about the symmetric groups Sn . We’ll do S9 .
(1 5 3)(2 7).
iii) Let
1 2 3 4 5 6 7 8 9
α=
9 4 1 8 7 5 2 6 3
and
1 2 3 4 5 6 7 8 9
β= .
6 3 1 2 7 4 9 5 8
i) Show that the even permutations form a subgroup of Sn . This is called the
alternating group An .
ii) Do the odd permutations form a subgroup of Sn ?
ii) Pick one reflection and one non-trivial rotation in D3 , and express all the
non-identity elements of D3 in terms of these two.
This means that these two elements “generate” the group.
iii) Find six subgroups of D3 . (This is all the subgroups of D3 ).
4. This question is about cosets. Recall that given a subgroup H of a group G, for
each g ∈ G the left coset gH is the set
{gh : h ∈ H}.
i) Let a ∈ S4 be the permutation (1 2). Write down all the elements of the coset
aH.
ii) Show that (1 4) and (2 3) are in the same left coset of H.
iii) How many different left cosets of H are there?
5. A subgroup H of G is called a normal subgroup if
g ∈ G and h ∈ H ⇒ g −1 hg ∈ H.
ii) Show that O2 has a subgroup isomorphic to D3 . You can do this by algebra
or by geometry.
iii) Write down four other subgroups of O2 other than the trivial group and the
whole group.
137
Tutorial questions #7
1. This question is about the symmetric group S3 , but the analogous result is true
for Sn in general.
i) Write down all the elements of S3 , in cycle notation. (Check you have the
right number of them.)
ii) Write down all the elements of S3 as products of transpositions. Hence, find
the even permutations i.e. the elements of A3 .
iii) Find all the left cosets of A3 in S3 .
iv) Check that, for all α ∈ S3 , αA3 = A3 α. This means that A3 is a normal
subgroup of S3 .
v) When H is a normal subgroup of G then we can make the left cosets of H
into a group called the “quotient group” G/H. What is the quotient group
S3 /A3 ? Hint: what is its order?
2. i) Write 4Z for the subset of Z given by
{k ∈ Z s.t. 4|k}.
Show that 4Z is a subgroup of Z. Remember: Z is a group under addition.
ii) What are all the left cosets of 4Z in Z? Note that since Z is a group under
addition, a left coset of a subgroup H will be written a + H instead of aH.
iii) We can define an operation ⊕ on the cosets of H = 4Z by
(a + H) ⊕ (b + H) = (a + b) + H.
This makes the cosets of H into a group. In what guise have you seen this
group before?
3. i) Consider D6 , the symmetry group of the regular hexagon. What happens if
you conjugate a rotation by a reflection? That is, if a is a rotation and b is a
reflection, what is bab−1 ?
ii) What happens in O2 , the symmetry group of the circle?
4. This question is about cycle types in S5 . The “cycle type” of an element α of Sn
is found as follows: write α in disjoint cycle form, with the cycles in descending
order of length. Then list the lengths of the cycles (including the trivial ones of
length 1 at the end). For example, the element (1 3)(5 2 6) ∈ S6 can be re-written
(5 2 6)(1 3)(4)
138 Section 9. Tutorial questions
and has cycle type (3,2,1). The element (1 6)(2 4) has cycle type (2,2,1,1).
i) Find all the possible cycle types of elements in S5 .
ii) Which ones are odd and which ones are even? Hint: to work this out, you
need to rewrite the cycles as products of tranpositions.
iii) How many elements of each cycle type are there?
5. Conjugate the element (1 2 3)(4 5) by the following elements. What do you notice
about the resulting cycle types?
i) (3 4) ii) (1 4 5) iii) (1 2 3 4)
139
Tutorial questions #8
1 2 3 4 5 6 7 8 9
1. Calculate θαθ −1 where θ = and α = (1 9 6 3)(2 4 8)(5 7).
4 1 9 6 5 2 3 7 8
2. For each of the following elements α of S9 , find the number of elements of S9 of
the same cycle type.
i) (1 2)
ii) (1 2 3)
iii) (1 2 3 4)
iv) (1 2 3 4 5)
v) (1 2 3 4)(5 6 7)
vi) (1 9 6 3)(2 4 8)(5 7)
vii) (1 2)(3 4)
3. For each of the elements α in question 2, find |conjS9 (α)| and |centS9 (α)|. Re-
member:
• In Sn , the elements conjugate to an element α are those with the same cycle
type.
• In any finite group G, |conjG (α)|.|cent G (α)| = |G|.
4. Let A, B be the following matrices with entries in Z7 :
1 2 4 4
A= , B = .
3 4 2 6
i) Find the determinant of each of these matrices, to check that A ∈ GL2 (Z7 )
and B ∈ GL2 (Z7 ).
Recall that GL2 (Z7 ) is the group of invertible 2 × 2 matrices with entries in
Z7 .
ii) Show that
5 1
A−1 = .
5 3
• The order of each conjugacy class must divide |G|, the order of the group G.
• Every element is in precisely one conjugacy class, so orders of the conjugacy
classes must add up to |G|. So for a group of order 12, for example, we could
have 1, 3, 4, 4 or 1, 2, 3, 6 or 1, 2, 3, 3, 3 but not 1, 3, 3, 3.
i) What is the order of the conjugacy class of the identity e in any group? Hint:
how many elements b, g can you find such that g = beb−1 ?
ii) In a group of order 6, is it possible to have three conjugacy classes of order 2?
Is it possible to have two conjugacy classes of order 3? What are the possible
combinations of conjugacy class orders?
iii) What are the possible combinations for a group of order 8?
iv) What are the possible combinations for a group of order 10?
141
Tutorial questions #9
i) Let
A = {a2 , a3 , a4 }
B = {a3 , a4 , a5 }.
p2 = (x1 + x3 )(x2 + x4 )
p3 = (x1 + x4 )(x2 + x3 ).
This definition of how the symmetric group acts on the polynomials is very formal
and a bit impenetrable. So in this question we’re going to sit down and fiddle
around with it to see what it actually does
i) The element (2 3) acts on each polynomial by switching 2 and 3, so in effect
x2 becomes x3 and x3 becomes x2 . Write down the result of doing this to the
polynomial
(x1 + x2 )(x3 + x4 ).
144 Section 9. Tutorial questions
ii) What you have just done is apply the element (2 3) to the polynomial p1 .
Which of p1 , p2 , p3 was the result?
iii) Now apply (2 3) to p2 and to p3 and see which polynomial results in each case.
iv) This means that the element (2 3) has permuted the polynomials {p1 , p2 , p3 }.
So we have produced a permutation in S3 . Which one?
v) Now try it for the element (1 2)(3 4). What happens if you apply this to each
of p1 , p2 , p3 ?
vi) So, what permutation of S3 have you produced from (1 2)(3 4)?
vii) Find all the permutations in S4 that leave p1 fixed. This is the stabiliser of
p1 .
viii) Find all the permutations that fix each of p1 , p2 , p3 .
ix) The above method gives a homomorphism f : S4 −→ S3 . What is its kernel?
x) What does the First Isomorphism Theorem tell us about this situation?