Professional Documents
Culture Documents
DE-QI ZHANG
(Professor of Mathematics; Office: S17-0608)
iii
1 Assessment: Test, HW Schedules; Syllabus; Texts 1
• Reference book1:
London, Chapman & Hall, 1970 (1991 Reprinted). QA251 Har (Sci)
• Reference book2:
• Prerequisites:
Department’s description:
Lecturer’s description:
• Syllabus
Department’s description:
The objective of this module is to provide the essentials of ring theory and
module theory. Major topics: rings, ring isomorphism theorems, prime and
maximal ideals, integral domains, field of fractions, factorization, unique fac-
torization domains, principal ideal domains, Euclidean domains, factorization
in polynomial domains, modules, module isomorphism theorems, cyclic mod-
ules, free modules of finite rank, finitely generated modules, finitely generated
modules over a principal ideal domain.
• Assessment:
(1) 30% from 60-minute common test which will be held (covering Lecture
Notes §1 - §9 and Tutorials 1 - 5) at S16-0304 during the lecture
time on Mon 4:10pm - 5:10pm, 18th Mar 2019. Students who are
absent from the test without an MC will be given 0 mark for the test.
A makeup test will be arranged for students with MC, but will be on
different topics/sections. The makeup test will be in reading week.
(2) 10% from 5 home works in tutorial weeks 2, 4, 6, 8, 10. Due day:
Monday 6pm of the respective weeks. HW should be slipped inside my
office. Write your Tutorial group number on your script!
(3) The remaining 60% from the final exam in April/May 2019.
2 Revision of Group Theory 3
A1 ⊂ A.
Z = {· · · , −2, −1, 0, 1, 2, 3, · · · }
(the set of integers)
Z≥0 = {0, 1, 2, 3, . . . }
(the set of nonnegative integers)
N = {1, 2, 3, · · · }
(the set of natural numbers or positive integers)
Q = {m
n
| m, n are integers, n 6= 0}
(the set of rational numbers)
(s1 , s2 ) 7→ s1 ∗ s2 .
So we denote by s1 ∗ s2 the image ∗(s1 , s2 ). We use (S, ∗) to signify that S is a set
with a binary operation ∗.
g ∗ eG = g = eG ∗ g, for every g ∈ G.
4 2 Revision of Group Theory
g 0 ∗ g = eG = g ∗ g 0 .
if ϕ is bijective.
G1 ∼
= G2 , or G1 ' G2 ,
∼
if there is an isomorphism ϕ : G1 → G2 .
g1 ∗ g2 ∗ g3
(2) If two groups G1 , G2 are isomorphic to each other, we may ‘identify’ them.
2 Revision of Group Theory 5
g1 ∗ g2 = g2 ∗ g1 , for all gi ∈ G.
(2) When ∗ is denoted as +, as in the case (Z, +), (G, +) is usually called an
additive group; we use
−g
(2)
h1 ∗ h2 ∈ H, ∀h1 , ∀h2 ∈ H, and
h−1 ∈ H, ∀h ∈ H.
(3)
h1 ∗ h−1
2 ∈ H, ∀h1 , ∀h2 ∈ H.
Here h−1
2 is the inverse of h2 regarded as an element of G.
(1) Denote
hgi := {g n | n ∈ Z}.
Exercise. Show that hgi is a subgroup of G, and will be called the subgroup
generated by g (cf. Exercise below, or 1-generator subgroup theorem ??).
Exercise. Show that hSi is a subgroup of G, and will be called the subgroup
generated by the subset S.
hgi = {ng | n ∈ Z}
Definition 2.11. (Subgroup and its generating subset) Let (G, ∗) be a group,
H ≤ G (a subgroup) and S ⊆ G a nonempty subset. We say that H is generated
by S, and S is a generating set of H if H = hSi, i.e., if
ord(g), or o(g).
(2) Suppose that ord(g) = n ∈ N. Show that g s = eG if and and only if n|s.
8 2 Revision of Group Theory
(3) Suppose that ord(g) = n ∈ N and b|n. Show that ord(g b ) = n/b.
(4) Suppose that ord(g) = ∞. Show that the map below is bijective
ϕ : Z −→ hgi
s 7→ ϕ(s) := g s .
(5) Suppose that ord(h) = n ∈ N. Show that the map below is well defined
(meaning here that the result ψ(s̄) depends only on the class s̄, but not on the
choice of the representative s of the class) and bijective
ψ : Z/(n) −→ hhi
s̄ 7→ ψ(s̄) := hs .
(6) (difficult) The cyclic group (hgi, ∗) can be ‘identified’ with additive group
(Z, +) (when o(g) = ∞), or (Z/(n), +) (when o(g) = n), because the bijective
maps in (4) and (5) ‘preserve’ operations (so they are isomorphisms; cf. Def.
2.3).
(2) If c ∈ N and c|n then G has exactly one subgroup Hc of order c; to be precise,
Hc = hg n/c i.
Then σ(D) = sgn(σ)D with sgn(σ) = 1 or −1. We call sgn(σ) the signature of σ.
σ is an even permutation if sgn(σ) = 1.
σ is an odd permutation if sgn(σ) = −1.
(1) g ∈ H,
(2) gH = H,
(3) Hg = H,
(4) gH ⊆ H,
(5) gH ⊇ H,
(6) Hg ⊆ H,
(7) Hg ⊇ H.
|G : H|
|G| = |G : H||H|
which holds even when |G| = ∞ (by the proof of Theorem 2.22).
2 Revision of Group Theory 11
N G
if
gng −1 ∈ N, for all n ∈ N, g ∈ G.
(1) N G, i.e.,
Z(G) := {z ∈ G | gz = zg, ∀ g ∈ G}
Theorem 2.27. (Index-2 subgroup being normal theorem) Suppose the index
|G : H| = 2. Then H G.
(2)
NG (H) := {g ∈ G | gHg −1 = H}
(1) NG (H) ≤ G.
(2) H NG (H).
Definition 2.30. (Set of left cosets) Let H (G, ∗). So gH = Hg for all g ∈ G
(cf. Equivalent definitions of normal subgroup 2.25). Denote the left (and also right)
coset
ḡ := gH.
Denote
G/H := {ḡ | g ∈ G}
(g1 , g2 ) 7→ g1 ∗ g2 := g1 g2 .
(g1 , g2 ) 7→ g1 + g2 := g1 + g2 .
2 Revision of Group Theory 13
Z/nZ = {s + nZ | 0 ≤ s ≤ n − 1}
= {[s]n | 0 ≤ s ≤ n − 1}.
s = [s]n = s + nZ.
ϕ(G1 ) = {ϕ(g) | g ∈ G1 }.
ϕ 7→ f (ϕ) := Ker(ϕ).
|H| |K|
|HK| = .
|H ∩ K|
2 Revision of Group Theory 15
γ : G → G/N
f : Σ1 → Σ2
H1 7→ H1 /N.
2.41. (Commutator subgroup [G, G]; derived series) For a group G and gi ∈ G,
we call [g1 , g2 ] = g1−1 g2−1 g1 g2 a commutator. The commutator subgroup below is
the subgroup generated by commutators:
[G, G] := hg1−1 g2−1 g1 g2 ; gi ∈ Gi = {[g1 , g10 ]n1 . . . [gs , gs0 ]ns ; gi , gi0 ∈ G, s ≥ 1, ni ∈ Z}.
Define G(1) = [G, G], G(i+1) = [G(i) , G(i) ] so that we have the derived series:
G ⊇ G(1) ⊇ G(2) ⊇ · · · .
(a) Show that a group G is solvable if and only if G(s) = 1 for some s > 0. Here
G(1) := [G, G] and G(i+1) := [G(i) , G(i) ] inductively.
(b) Show that S4 is solvable but S5 is not solvable. In general, it is known that Sn
(n ≥ 5) is not solvable. This is related to Galois’ result: a general polynomial
of degree ≥ 5 can not be solved by taking radicals.
(a) The centre of G/Z(G) can be written as Z(G/Z(G)) = Z2 /Z(G) for some
Z2 G.
(b) Let Z0 = {eG }, Z1 = Z(G), and inductively define Zi+1 such that Z(G/Zi ) =
Zi+1 /Zi . Show that Zi+1 G. We obtained the so called upper central
series of G, where Zi (G) = Zi and Z1 (G) = Z1 = Z(G):
(d) One can show that every finite p-group is nilpotent. Hint: Show that Z(G) 6=
1.
and construct the so called lower central series (usually denoting Γi (G) := Γi ):
(g) It is known that Zs (G) = G for some (minimal) s ≥ 0 if and only if Γs (G) =
{eG } for some (minimal) s ≥ 0. Precisely, if c ≥ 0 is minimal such that
Γc (G) = {eG }, one can show by induction
(d) One can show that the map below is a well defined bijection
Theorem 2.46. (Class equation) Let G be a finite group with Z(G) the centre.
Then there exists {xj | j ∈ J} ⊆ G such that the centralizers CG (xj ) = {y ∈ G | yxj =
6 G, and
xj y} =
X
|G| = |Z(G)| + |G : CG (xj )|.
j∈J
(a) If p is a prime number such that p | |G| then G contains an element of order
p.
2.49. (Simple group) A group G is called simple if 1 and G are the only normal
subgroups of G. Show that A5 is a simple group. In general, it is known that An (n ≥
5) is a simple group. Finite simple groups are classified in the book called ”ATLAS
of Finite Group Representations”. See: http://for.mat.bham.ac.uk/atlas/v2.0/
as follows:
(g1 , g2 ) ∗ (g10 , g20 ) = (g1 ∗1 g10 , g2 ∗2 g20 ).
Prove that (G1 × G2 , ∗) is a group, called the direct product of the groups G1 and
G2 .
2 Revision of Group Theory 19
G := G1 × · · · × Gs
(called the direct product of the groups G1 , . . . , Gs ) with the binary operation ∗
given as:
(g1 , . . . , gs ) ∗ (g10 , . . . , gs0 ) = (g1 ∗1 g10 , . . . , gs ∗s gs0 ).
Let
Hi = {eG1 } × · · · × {eGi−1 } × {eGi+1 } × · · · {eGs }.
Gi ∼
= Hi .
Remark 2.51. Final remarks for further study in group theory: Sylow
theorems; structure theorem for finitely generated abelian group)
(1) Let G be a finite group and p a prime factor of |G|. Write
|G| = pr q
with r ≥ 1 and gcd(p, q) = 1. Then there is at least one subgroup H ≤ G such that
|H| = pr .
np | |G|, np = 1 + kp
20 2 Revision of Group Theory
for some integer k ≥ 0. The above results form the so called Sylow’s Theorem.
(2) Exercsie. Find all Sylow p-subgroups for Sn , An (n = 3, 4, 5).
(3) Fundamental Theorem for finitely generated abelian group G. This
is important. It says that if G = hg1 , . . . , gs i is abelian and finitely generated (by s
elements) then
G∼
= Z × · · · × Z × Z/(pn1 1 ) × · · · × Z/(pnr r )
246.320.59.76.112.133.17.19.23.29.31.41.47.59.71
∼ 8 × 1053
and
|B| = 241.313.56.72.11.13.17.19.23.31.47
∼ 4 × 1033 .
see:
http://en.wikipedia.org/wiki/Sporadic group
or
http://web.mat.bham.ac.uk/atlas/v2.0/
There is one copy of the giant book ”ATLAS of Finite Group Representa-
tions” in Math Dept library (LKC centre). See also the recent update by Michael
Aschbacher ‘The status of the classification of the finite simple groups,’ in: No-
tices of the American Mathematical Society, Vol 51, yr 2004, no. 7, pp.
736–740.
3 Rings: basics and examples (Tutorial 1; Lecture 1-2) 21
(1) A ring R, or more precisely, (R, +, ×), is a set R together with two binary
operations + (addition) and × (multiplication) satisfying the following axioms.
(a × b) × c = a × (b × c), ∀ a, b, c ∈ R.
(a + b) × c = (a × c) + (b × c), a × (b + c) = (a × b) + (a × c), ∀ a, b, c ∈ R.
a × b = b × a, ∀ a, b ∈ R.
1 × a = a = a × 1, ∀ a ∈ R.
a − b := a + (−b).
(∗) a1 + a2 + a3 .
a1 + · · · + an
(1b) 1 6= 0, and
(1c) every nonzero element a ∈ R \{0} has a multiplicative inverse a0 in the sense:
aa0 = 1 = a0 a.
R× := R \ {0}.
Thus, if R is a division ring (resp. field) then (R× , ×) is a multiplicative group (resp.
commutative multiplicative group).
Remark 3.5.
a, b ∈ E ⇒ ab ∈ E,
(3) 1F ∈ E, and
(2) The set Z of integers with the natural arithmetic operations +, ×, is a com-
mutative ring with 1 but it is neither a division ring nor a field. We call Z the
integer ring.
24 3 Rings: basics and examples (Tutorial 1; Lecture 1-2)
(4) The sets Q of rational numbers, R of real numbers, and C of complex numbers,
with the natural arithmetic operations +, ×, are fields. They are respectively
called the field of rational numbers, the field of real numbers, and
the field of complex numbers.
When n = 0,
Z/nZ = Z/{0} ∼
= Z.
Z/nZ = Z/(−n)Z.
When n = 1,
Z/nZ = Z/Z = {0}
(a trivial group).
So
Z/nZ = {[0]n , [1]n , . . . , [n − 1]n },
or in another way:
Z/nZ = {0, 1, . . . , n − 1}.
s1 × s2 := s1 × s2 .
3 Rings: basics and examples (Tutorial 1; Lecture 1-2) 25
If we define
√
√ a+b D √
Q( D) := { √ | a, b, c, d ∈ Q, c + d D 6= 0}
c+d D
√ √
then one can show that Q( D) = Q[ D]. Indeed, more generally, for a field
F , we have
Q(F ) := {α/β := αβ −1 | α, β ∈ F, β 6= 0} = F
Let
H = R + Ri + Rj + Rk = {a + bi + cj + dk | a, b, c, d ∈ R}
be a 4-dimensional vector space over R with an R-basis {1, i, j, k}. Define the
multiplication
Extend the multiplication linearly by the distributive law, we get a well defined
multiplication × on H. Then (H, +, ×) is a division ring, but not a field. We
call H the real Quaternion Ring.
Similarly,
HQ = Q + Qi + Qj + Rk == {a + bi + cj + dk | a, b, c, d ∈ Q}
is a division ring, but not a field. We call HQ the rational Hamilton Quater-
nion ring.
RV [x] := {f : R → R}
be the set of all real-valued functions (in one variable x). For a scalar or
constant c ∈ R, we have the constant function c given below:
c: R → R
x 7→ c(x) := c.
f +g : R → R
f ×g : R → R
(9) (Ring R-valued functions) (cf. Tutorial 1) More generally, let X be a set
and R a ring. Let
Xto R := {f : X → R}
be the set of all maps between X and R. Then for f, g ∈ Xto R, there are
natural addition f + g and multiplication f g (x 7→ f (x) g(x), which is not the
composition) as in the previous example, such that
(Xto R, +, ×)
3 Rings: basics and examples (Tutorial 1; Lecture 1-2) 27
c: X → R
x 7→ c(x) = c.
When n ≥ 1, define
n a = a + · · · + a (n times).
0R a = 0R = a 0R , (∀ a ∈ R).
(2) Recall that −a is the additive inverse of a (so that a + (−a) = 0). Then
(3)
(−a) (−b) = ab, (∀ a, b ∈ R).
28 3 Rings: basics and examples (Tutorial 1; Lecture 1-2)
(a − b) c = ac − bc, a (b − c) = ab − ac.
uu0 = 1 = u0 u.
Example 3.12. Suppose that R is a division ring. Then U (R) = R \ {0}, which is
a multiplicative group.
U (R) is a commutative (= abelian) multiplicative group if (and only if) R is a
field.
(2) uv = 1.
3 Rings: basics and examples (Tutorial 1; Lecture 1-2) 29
(3) vu = 1.
Here
ϕ(n) = |{1 ≤ s ≤ n | gcd(s, n) = 1}|
for ∀ a, b ∈ R, ab = 0 =⇒ a = 0 or b = 0;
or equivalently,
for ∀ a, b ∈ R, a 6= 0, b 6= 0 =⇒ ab 6= 0.
For ∀ a, b, c ∈ R, c 6= 0, ca = cb =⇒ a = b.
(2) More generally, assume R is an integral domain. Then the polynomial ring
R[x1 , . . . , xn ] in n variables x1 , . . . , xn over R is an integral domain. Especially,
R[x1 ] is an integral domain.
(3) n is a prime.
a, b ∈ S =⇒ ab ∈ S.
(1) S is a subring of R.
a, b ∈ S =⇒ ab ∈ S; a − b = a + (−b) ∈ S.
Remark 3.24.
3 Rings: basics and examples (Tutorial 1; Lecture 1-2) 31
Z ⊂ Q ⊂ R ⊂ C.
Example 3.26. (cf. Tutorial 1) the integral Hamilton Quaternion Ring below
HZ := Z + Zi + Zj + Zk = {a + bi + cj + dk | a, b, c, d ∈ Z}
Example 3.27. Let R be a commutative ring. Let S := R[x] be the polynomial ring
over R. Then R is a subring of S which consists of constant polynomial functions.
[Hint. Multiplications and subtractions of constant functions are still constant
functions.]
mZ = {ms | s ∈ Z}
Example 3.29. Let R[x] be the set of real polynomials in one variable x. Every such
polynomial f (x) is a real-valued function. Hence R[x] is a subset of the real-valued
function ring (as in Example 3.7)
RV [x] = {f : R → R}.
∩α∈Σ Rα
is a subring of R.
In general, the union of subrings may not be a subring [e.g. 2Z ∪ 3Z ⊂ Z], but
we have:
R1 ⊆ R2 ⊆ · · ·
∪∞
i=1 Ri
is a subring of R.
A + B := {a + b | a ∈ A, b ∈ B}.
When A = {a}
a + B := {a + b | b ∈ B}.
A + b := {a + b | a ∈ A}.
A1 + · · · + An = {a1 + · · · + an | ai ∈ Ai }.
for subsets Ai ⊆ R.
One can prove the associativity:
(A + B) + C = A + (B + C).
3 Rings: basics and examples (Tutorial 1; Lecture 1-2) 33
is not in R1 + R2 .
(2) Conversely, one can show that every integral domain R is a subring of some
field Q(R) (the so called fraction field of R; cf. §8).
R := R1 × · · · × Rn
34 3 Rings: basics and examples (Tutorial 1; Lecture 1-2)
(called the direct product of the rings R1 , . . . , Rn ) with the binary operation
+ and × given as:
More generally and similarly, one can define the direct product
Y
Rα
α∈Σ
(2) Let
Si := {0R1 } × · · · × {0Ri−1 } × Ri × {0Ri+1 } × · · · × {0Rn }.
Si ∼
= Ri .
(3) We have
0R = (0R1 , . . . , 0Rn ).
1R = (1R1 , . . . , 1Rn ).
deg 0 = −∞.
(5) (Addition and multiplication) There are natural addition and multiplica-
tion operations for polynomials
r
X s
X
i
g(x) = ai x , h(x) = bi x i
i=0 i=0
defined as X
g(x) + h(x) = (ai + bi )xi
i≥0
X
g(x)h(x) = ck x k
k≥0
36 4 Polynomial rings; Matrix rings; Group rings (Tutorial 2; Lecture 3-4)
where
X
ck = ai bj = ak b0 + ak−1 b1 + · · · + a1 bk−1 + a0 bk ,
i+j=k
such that
(R[x], +, ×)
(6) As an illustration, if
= 2x3 + 3x2 + 2x + 1,
Remark 4.2. Let R be a commutative ring with 1. Let S := R[x] be the polynomial
ring over R.
(2) 0S = 0R .
R[x1 , x2 , . . . , xm ]?
4 Polynomial rings; Matrix rings; Group rings (Tutorial 2; Lecture 3-4) 37
Proposition 4.4. (Polynomial ring over integral domain) (cf. Tutorial 2 for
(3)) Let R be an integral domain. Let f (x), g(x) ∈ R[x]. Then
(1)
deg(f (x)g(x)) = deg f (x) + deg g(x).
(2) We have
U (R[x]) = U (R).
and
AB := (cij )
38 4 Polynomial rings; Matrix rings; Group rings (Tutorial 2; Lecture 3-4)
where
n
X
cij = aik bkj
k=1
A = (aij ) = (aij )
(6) The set S := Mn (R) together with the matrix addition and multiplication just
defined, becomes a ring. We call Mn (R) the matrix ring of n × n square
matrices with entries in the ring R.
Remark 4.6. Let R be a ring and S = Mn (R) the matrix ring with entries in R.
Then
(1)
0S = (aij )
1S = Diag[1R , . . . , 1R ].
R∼
= Scn (R).
Dn (R) ∼
= Rn := R × · · · × R (n times).
Similarly, the set LTn (R) of all lower triangular matrices in Mn (R), is a subring
of Mn (R).
(1) We set
GLn (R) := U (Mn (R))
the set of all units in Mn (R). This GLn (R) is a multiplicative group and called
the general linear group of degree n over R.
(2) Assume that R is a commutative ring with 1. We can define the determinant
det(A) = |A| in a usual way. Let
the set of all matrices in Mn (R) which have determinants equal to 1. This
SLn (R) is a multiplicative subgroup of GLn (R) and called the special linear
group of degree n over R.
Definition 4.8. (Group rings R[G]) Let R be a commutative ring with 1 6= 0. Let
G = {g1 , . . . , gn } be a finite multiplicative group of order n. Consider the following
formal sums
where
X
ck = ai bj
gi gj =gk
R → R[G],
r 7→ reG .
G → U (R[G]),
g 7→ 1R g.
Tr : R[G] → R
n
X n
X
ai gi 7→ ai
i=1 i=1
P
Thus, whenever y = j bj gj ∈ T we have
X X X
Tr(gi y) = Tr( bj gi gj ) = Tr( bj gj0 ) = bj = Tr(y) = 0.
j j
P P P
Hence for any ai gi ∈ R[G] we have Tr(( ai gi ) y) = i ai Tr(gi y) = 0, so
P
( ai gi )y ∈ T .
Remark 4.11. When R is a division ring or a field, then R[G] (as an additive group),
is a vector space over R of dimension equal to |G|, with a basis {g1 , . . . , gn } = G.
Hence
R[G] = Rg1 + · · · + Rgn = Rg1 ⊕ · · · ⊕ Rgn ,
H = R + Ri + Rj + Rk
Then
R[Q8 ] = Rg1 + · · · + Rg8 .
4 Polynomial rings; Matrix rings; Group rings (Tutorial 2; Lecture 3-4) 43
H = R + Ri + Rj + Rk = R ⊕ Ri ⊕ Rj ⊕ Rk
(1) A map
ϕ:R→S
(1a)
ϕ(a + b) = ϕ(a) + ϕ(b), ∀ a, b ∈ R, and
(1b)
ϕ(a b) = ϕ(a) ϕ(b), ∀ a, b ∈ R.
(3) A map ϕ : R → S between two rings is called a ring isomorphism (or simply
an isomorphism) if it is a (ring) homomorphism and bijective. In this case, we
denote
∼
ϕ : R → S.
R∼
= S, or R ' S,
∼
if there is a (ring) isomorphism ϕ : R → S.
5 Ring homomorphisms; Ideals; Quotient rings (Tutorial 3; Lecture 5-6) 45
Example 5.2.
R → S
a → 0
a 7→ a
is a ring homomorphism.
Z → Z/nZ
s 7→ s = [s]n
between additive groups (Z, +) and (Z/nZ, +), is actually a ring homomor-
phism between rings (Z, +, ×) and (Z/nZ, +, ×).
Xto R = {f : X → R}
f 7→ Ec (f ) := f (c)
is a ring homomorphism, and called the Evaluation at c.
for subsets Ai ⊆ R.
In other words, we remark that:
(*) A1 · · · An is the the smallest subset of (R, +) which contains
{a1 . . . an | ai ∈ Ai }
An := A · · · A (n times).
So
s
X
n
A ={ a1 (j) · · · an (j) | ai (j) ∈ A, s ≥ 1}.
j=1
5 Ring homomorphisms; Ideals; Quotient rings (Tutorial 3; Lecture 5-6) 47
(1)
(A1 A2 )A3 = A1 (A2 A3 ).
of R1 is a subring of S.
(2b) I is closed under left multiplication by elements from R: rI ⊆ I (∀r ∈ R), i.e.
(with (2a) assumed)
R I ⊆ I.
Similarly,
R I ⊆ I, and, I R ⊆ I.
Remark 5.9. Results for right ideals are parallel to results for left ideals. So from
now on, we consider only left ideals and 2-sided ideals.
(2)
∀r ∈ R; ∀a, b ∈ I =⇒ ra, ar, a − b ∈ I.
∀r ∈ R; ∀a, b ∈ I =⇒ ra, a − b ∈ I.
∀r ∈ R; ∀a, b ∈ I =⇒ a + rb ∈ I.
5 Ring homomorphisms; Ideals; Quotient rings (Tutorial 3; Lecture 5-6) 49
∩α∈Σ Jα
∩α∈Σ Rα .
∩α∈Σ Jα
(X) = ∩α∈Σ Jα .
(X) = (r1 , . . . , rn ).
(X ∪ Y ) = (X) + (Y ).
(3)
(r1 , . . . , rn ) = (r1 ) + · · · + (rn ).
(1)
s
X
RB = { ri bi | ri ∈ R, bi ∈ B, s ≥ 1}
i=1
(2) In particular,
R a = {r a | r ∈ R},
or more generally,
Xn
R{a1 , . . . , an } = R a1 + · · · + R an = { ri ai | ri ∈ R}
i=1
(a) = Z a + a R + R a + R a R.
Here
Z a = {m a | m ∈ Z}.
where m ∈ Z; r, r0 , ri , ri0 ∈ R; n ≥ 1.
where ri , ri0 ∈ R; n ≥ 1.
(a) = a R = R a = {r a | r ∈ R}.
ra
where r ∈ R.
52 5 Ring homomorphisms; Ideals; Quotient rings (Tutorial 3; Lecture 5-6)
(1) I = R.
(2) 1 ∈ I.
Example 5.18. For the integer ring Z, and for n ∈ Z, the principal ideal
(n) = nZ = {n s | s ∈ Z}.
Thus we have different notations for the same quotient ring (to be defined late on):
Z/nZ = Z/(n).
which is a left (resp. 2-sided) ideal of R, and the smallest among those of R con-
taining all Jα (cf. Proposition 5.13).
If Σ is finite then
X
R(∪α∈Σ Jα ) = Jα .
α∈Σ
Exercise 5.21. Let J, J1 , . . . , Jn be ideals of a ring. Then we have the equality (cf.
Notation 5.4)
k
X
J1 · · · Jn = { a1 (`) · · · an (`) | ai (`) ∈ Ji , k ≥ 1}
`=1
and it is an ideal of R.
In particular, we have the equality
k
X
n
J = J ···J = { a1 (`) · · · an (`) | ai (`) ∈ J, k ≥ 1}
`=1
and it is an ideal of R.
(2) Show that if ϕ is surjective then ϕ(I) is a left (resp. 2-sided) ideal of S.
R/I = {r = r + I | r ∈ R}.
r + s := r + s.
r × s := r s
Definition 5.27. (Quotient ring) Let R be a ring and I ⊆ R an ideal. Then the
ring (R/I, +, ×) in Theorem 5.26 is called the quotient ring of R by I.
Remark 5.28. Let R be a ring and (I, +) a subgroup of the additive group (R, +).
Then I is an ideal of R if and only if the multiplication × on the additive quotient
group (R/I, +) given in Theorem 5.26 (1) is well-defined so that (R/I, +, ×) is a
ring.
Exercise 5.29. For the quotient ring R/I, take a, ai ∈ R/I (1 ≤ i ≤ n). Show by
induction that a1 · · · an = a1 · · · an and an = an .
5 Ring homomorphisms; Ideals; Quotient rings (Tutorial 3; Lecture 5-6) 55
γ : R → R/I
r 7→ r = r + I
from the additive group (R, +) to the additive group (R/I, +) as in §2, is in fact a
ring homomorphism such that
Ker γ = I.
Definition 5.32. (cf. Tutorial 3 for (1) - (3)) (Nilpotent element, Nilradical,
Radical, Jacobson radical) Let R be a commutative ring and I an ideal.
Jac(I) = ∩M :max, M ⊇I M
Example 5.33.
(1) Let R be a commutative ring and I an ideal. Then nil(R/I n ) ⊇ I/I n , and
rad(I n ) ⊇ I (the inclusions might be strict).
(2) For the polynomial ring F [x] over a field F , if we let I = (x) the principal ideal
generated by x, then I n = (xn ). Hence nil(F [x]/I n ) = I/I n and rad(I n ) = I.
(3) The Jacobson radical of Z/12Z is 6Z/12Z which is inclued in the intersection
(of two maximal ideals)
(2Z/12Z) ∩ (3Z/12Z).
The Jacobson radical of the polynomial ring F [x] over a field F is 0 which is
contained in the intersection (of two maximal ideals)
(x) ∩ (x − 1).
6 Ring isomorphism theorems (Tutorial 4; Lecture 7) 57
ϕ:R→S
ϕ=ϕ◦γ
where
γ : R → R/K
ϕ : R/K → ϕ(R),
r 7→ ϕ(r) := ϕ(r)
Proof. This almost follows from the first isomorphism theorem for groups. We
only need to observe that γ is a ring homomorphism (which is not just a group
homomorphism of additive groups, i.e., which also respects the product).
Example 6.2. (1) (Proper ideal; Zero ideal) Let R be a ring. Then R and
{0R } are ideals of R. An ideal I of R is proper if I 6= R. The ideal {0} is
called the zero or trivial ideal and denoted by 0.
(2) For any integer n, the subset nZ ⊆ Z is an ideal of the integer ring Z.
The map
γ : Z → Z/nZ
s 7→ [s]n = s
58 6 Ring isomorphism theorems (Tutorial 4; Lecture 7)
is the (surjective) quotient ring homomorphism, and Z/nZ is in fact the quo-
tient ring of Z by nZ.
where
n
X
I[x] = { ai xi | ai ∈ I, n ≥ 1}
i=1
is the polynomial ring with coefficients in I. Further, I[x] = I R[x] (cf. Nota-
tion 5.4).
ϕn : Mn (R) → Mn (S)
(5) Let R be a ring, J an ideal (2-sided) of R and Mn (R) the matrix ring over R.
Then Mn (J) is an ideal (2-sided) of Mn (R). The quotient ring homomorphism
γ : R → R/J induces a ring homomorphism
γJ : Mn (R) → Mn (R/J)
Tr : R[G] → R
n
X n
X
ri gi 7→ ri
i=1 i=1
is a ring homomorphism.
(7) (One-sided ideals) Let n ≥ 2 and Mn (R) a matrix ring over a ring R. Let
Similarly, let
Then Lk1 ,...,kr is a left ideal of Mn (R), but not a right ideal of Mn (R).
Let
Rk1 ,...,kr = {A = (aij ) ∈ Mn (R) | aij = 0, ∀ i 6∈ {k1 , . . . , kr }}.
Then Rk1 ,...,kr is a right ideal of Mn (R), but not a left ideal of Mn (R).
(1) R1 + J is a subring of R.
(2) R1 ∩ J is an ideal of R1 .
∼
ϕ : R1 /(R1 ∩ J) → (R1 + J)/J,
r = r + (R1 ∩ J) 7→ ϕ(r) := r = r + J.
Proof. This almost follows from the second isomorphism theorem for groups. We
only need to observe that ϕ is a ring homomorphism (which is not just a group
homomorphism of additive groups, i.e., which also respects the product).
60 6 Ring isomorphism theorems (Tutorial 4; Lecture 7)
Theorem 6.4. (Third isomorphism theorem for rings) Let R be a ring, and
let I ⊆ J be ideals of R. Then
ϕ : R/J ∼
= (R/I)/(J/I),
r = r + J 7→ r + J/I = (r + I) + J/I
Proof. This almost follows from the third isomorphism theorem for groups. We only
need to observe that ϕ is a ring homomorphism (not just a group homomorphism
of additive groups).
f : Σ1 → Σ2
R1 7→ R1 /I.
Proof. This almost follows from the correspondence theorem for groups. We only
need to observe that γ is a ring homomorphism (which is not just a group homo-
morphism of additive groups, i.e., which also respects the product).
7 Prime ideals; Maximal ideals (Tutorial 4) 61
(2) Assume R is commutative. Then R is a field if and only if R has only two
ideals: 0 and R.
(1)
M 6= S; and
we have J = M or J = S.
(1)
P 6= R; and
(2)
a b ∈ P =⇒ a ∈ P, or b ∈ P.
Corollary 7.10. Assume the ring R is commutative with 1. Then every maximal
ideal is a prime ideal.
(1) The principal ideal (x) is a prime ideal of Z[x] but it is not a maximal ideal.
This is because
Z[x]/(x) ∼
= Z.
Z[x]/(p, x) ∼
= Z/pZ.
Example 7.13. Consider the polynomial ring F [x] over a field F . The principal
ideal (x) is a maximal ideal of F [x]. This is because the isomorphism below (via the
evaluation map f (x) 7→ f (0)):
F [x]/(x) ∼
= F.
Example 7.14. Consider the polynomial ring F [x, y] in two variables x, y over a
field F . The principal ideal (x) is a prime ideal of F [x, y], but it is not a maximal
ideal of F [x, y]. This is because the isomorphism below (via the evaluation map
f (x, y) 7→ f (0, y)):
F [x, y]/(x) ∼
= F [y].
Remark 8.2.
r
:= r d−1 =: r/d.
d
for any d ∈ D.
R → D−1 R
r 7→ rd/d
(1) The ring Q = D−1 R in Theorem 5.26 is called the ring of fractions of D
with respect to R.
Corollary 8.4.
(1) Suppose that R is a subring of a field F . Then the fraction field Q(R) of R is
the subfield of F generated by R. Namely,
r1
Q(R) = {α ∈ F | α = , ri ∈ R, r2 6= 0}.
r2
(2) More generally, suppose R is an integral domain and Q = Q(R) its fraction
field. If σ : R → F is an injective ring homomorphism to a field F , then σ
extends to an injective homomorphism
σ(r1 )
σ 0 : Q(R) → E =: {α ∈ F | α = , ri ∈ R, r2 6= 0} ⊆ F.
σ(r2 )
Here E = Q(σ(R)) is the fraction field of the integral domain σ(R) and is the
subfield of F generated by σ(R).
Example 8.6.
R = {m/n | m, n ∈ Z; 2 6 |n}
is a subring of Z.
M = (2)
RP := D−1 R
P RP = {a/d | a ∈ P, d 6∈ P }
is the only maximal ideal in RP so that RP is a local ring. Here note that d ∈ D if
and only if d 6∈ P .
For instance, if R = F [x] is the polynomial ring over a field F and P = (x), then
RP = {f (x)/g(x) | g(0) 6= 0}
and
P RP = xRP = {f (x)/g(x) | f (0) = 0, g(0) 6= 0}.
char R := p
and call it the characteristic of R; it turns out that such p is a prime number.
If no such n ≥ 1 exists, we set
char R := 0.
(x + y)p = xp + y p
holds for any x, y ∈ F . This is by binomial expansion of left hand side and noting
that p = 0 in F .
68 9 Chinese remainder theorem (Tutorial 5; Lecture 9)
I + J = R.
r 7→ (r = r + J1 , . . . , r = r + Jn )
is a ring homomorphism with
Ker ϕ = J1 ∩ · · · ∩ Jn .
(2) Suppose that Ji , Jj are comaximal for all i 6= j. Then ϕ is surjective and
J1 ∩ · · · ∩ Jn = J1 · · · Jn .
n = pr11 · · · prt t
s 7→ (s, . . . , s).
9 Chinese remainder theorem (Tutorial 5; Lecture 9) 69
U (Z/nZ) ∼
= U (Z/pr11 Z)) × · · · × U (Z/prt t Z).
on R such that for any two elements a, b ∈ R with b 6= 0, there exist element q ∈ R
(called the quotient) and r ∈ R (the remainder) such that
a = qb+r
where
r = 0, or, N (r) < N (b).
10.2. For a, b in a Euclidean domain R with b 6= 0, one can apply the Division
Algorithm:
a = q 0 b + r0 ,
b = q1 r0 + r1 ,
r0 = q2 r1 + r2 ,
···
rn−2 = qn rn−1 + rn ,
rn−1 = qn+1 rn ,
where rn is the last nonzero remainder. Such an rn exists since
(1) Every field F is a Euclidean domain with respect to any function N : F → Z≥0 .
(2) The integer ring Z is a Euclidean domain with the modulus as the norm
function:
N (s) := |s|, s ∈ Z.
(3) The polynomial ring F [x] over a field F is a Euclidean domain where
Z[i] := Z + Zi = {a + bi | a, b ∈ Z} ⊂ C
is a Euclidean domain where the norm function is just the square of the usual
modulus of complex number:
x = y(s + ti) + r
Z[ζ3 ] = Z + Zζ3
√
where ζ3 = (−1 + −3)/2 is a primitive cubic root of unity: ζ3n = 1 if and
only if 3 | n. The norm function is just the square of the usual modulus:
Example 10.6. (cf. Tutorial) Consider the polynomial ring Z[x]. The ideal
Example 10.7. (cf. [Dummit and Foote, §8.1, the Example after Proposition 1])
√
The quadratic integer ring Z[ −5] is not a P.I.D. Indeed, the ideal
√
I = (3, 2 + −5)
is not principal. Alternatively, one shows that 3 is an irreducible element but not a
prime element in the quadratic integer ring, and use Proposition 11.3
See [Dummit and Foote, §7.1] and Wiki-Quadratic Integers for other examples
of quadratic integer rings which are (or are not) Euclidean domain, or PID, or UFD.
a = bc
d = gcd(a, b)
if
(2a)
d | a, and, d | b; and
(2b)
d0 | a, and d0 | b =⇒ d0 | d.
(2c) Inductively, for ai ∈ R \ {0} (1 ≤ i ≤ n), we can define their greatest common
divisor as:
gcd(a1 , . . . , an ) := gcd(gcd(a1 , . . . , an−1 ), an ).
(a, b) = (d)
d = gcd(a, b).
(a1 , . . . , an ) = (d)
d = gcd(a1 , . . . , an ).
(1)
d = gcd(a, b).
(2)
d = (a, b).
In particular
d = ax + by
for some x, y ∈ R.
Then
(1)
d = gcd(a, b).
(2)
d = ax + by
for some x, y ∈ R.
Then
(1)
d = gcd(a, b).
(2)
d = ax + by
for some x, y ∈ R.
Exercise 10.15. More generally, assume that R is a PID. Let ai be nonzero ele-
ments. Let d ∈ R such that
(d) = (a1 , . . . , an ).
Then
(1)
d = gcd(a1 , . . . , an ).
(2)
d = a1 x 1 + · · · + an x n
for some xi ∈ R.
Corollary 10.17. Let R be a commutative ring such that the polynomial ring R[x]
is a PID. Then R is a field. [Hint. Consider the quotient ring R[x]/)(x).]
11 Unique Factorisation Domains = UFD (Tutorial 6; Lecture 11) 77
(1a) r 6= 0,
(1c)
r = ab =⇒ a or b is a unit in R.
r = ab
(3) A nonzero element p ∈ R is called prime in R if the ideal (p) is a prime ideal,
or equivalently if
p | ab =⇒ p | a, or p | b.
a = ub
(1) (Factorisation)
r = p1 . . . pn
r = q 1 . . . qm
Example 11.5.
Proposition 11.7. Assume that R is a UFD and a, b are nonzero elements. Then
b = vpf11 · · · pfnn
where pi ’s are prime, u and v are units, and ei ≥ 0, fi ≥ 0. Then
min(e1 ,f1 )
gcd(a, b) = p1 · · · pnmin(en ,fn ) .
gcd(c, a) = 1, c | ab =⇒ c | b.
Theorem 11.9.
Proof. We remain to show that every PID is UFD. Assume now R is PID · · · .
are two distinct (even up to associates) factorisations into irreducibles. See [Dummit
- Foote, §8.3, Example (5) and Exercise 8, for details].
(1)
a | c, b | c, and,
(2)
a | c0 , b | c0 =⇒ c | c0 .
Proposition 11.13. Assume that R is a UFD and a, b are nonzero elements. Then
b = vpf11 · · · pfnn
where pi ’s are prime, u and v are units, and ei ≥ 0, fi ≥ 0. Then
max(e1 ,f1 )
lcm(a, b) = p1 · · · pnmax(en ,fn ) .
Exercise 11.14. Use the fact that a prime ideal of a PID is a maximal ideal, or
otherwise, to show:
(2) The polynomial ring F [x, y] in two variables x, y over a field F , is a UFD, but
is not a PID.
(3) Let f (x) be a nonconstant polynomial over a field F . Then the quotient ring
F (x)/(f (x)) is a field if and only if f (x) is an irreducible polynomial in F [x].
N (a + bi) = a2 + b2 .
(π) ∩ Z = p Z.
11 Unique Factorisation Domains = UFD (Tutorial 6; Lecture 11) 81
It follows that either N (π) = p2 and π 0 is a unit (so that p is prime in R), or
N (π) = p = N (π 0 ). In the latter case, both π and π 0 are irreducible, and if we write
π = ap + bp i then we have
1 ± i, q, ap ± bp i
where prime number q = 3 (mod 4), where prime number p = 1 (mod 4) so that
p = (ap + bp i)(ap − bp i) (the solution (ap , bp ) to the equation (*) above is not unique
for a given p).
Using Chinese remainder theorem for rings and that in a PID, an irreducible
element is a prime element which generates a nonzero prime and hence maximal
ideal, one can show (cf. Tutorial):
R/2R ∼
= (R/(1 + i)R) × (R/(1 − i)R) ∼
= (Z/(2Z) × (Z/2Z),
R/pR ∼
= (R/(ap + bp i)) × (R/(ap − bp i)) ∼
= Z/(p) × Z/(p), and
deg 0 = −∞.
defined as X
g(x) + h(x) = (ai + bi )xi
i≥0
X
g(x)h(x) = ck x k
k≥0
where
X
ck = ai bj = ak b0 + ak−1 b1 + · · · + a1 bk−1 + a0 bk ,
i+j=k
such that
(R[x], +, ×)
12 Polynomial rings again: basics (Tutorial 7; Lecture 12) 83
U (R[x]) = U (R).
Proposition 12.2. Let I be an ideal of R and let (I) = I[x] be the ideal of R[x]
generated by I. Then
(1)
R[x]/I[x] ∼
= (R/I)[x].
R[x]/aR[x] ∼
= (R/aR)[x].
Example 12.4. Consider the integer ring Z and its ideal nZ. We have
Z[x]/nZ[x] ∼
= (Z/nZ)[x].
axd11 · · · xdnn
where a ∈ R (the coefficient of the term) and the di are nonnegative integers. A
monic term xd11 · · · xdnn is called simply a monomial and is the monomial part of the
term axd11 · · · xdnn . The exponent di is called the degree in xi of the term and the
sum
d = d1 + d2 + · · · + dn
(d1 , d2 , . . . , dn )
f = f0 + f1 + · · · + fd
Theorem 12.7. Let F be a field. Then the polynomial ring F [x] is a Euclidean
domain with the norm function N : F [x] → Z≥0 given as: N (f ) = deg f .
Corollary 12.8. The polynomial ring F [x] over a field F is a PID and also UFD.
13 Polynomial rings which are UFD; Gauss lemmas (Tutorial 7) 85
so that c(f ) ∈ R \ {0} and gcd of coefficients of f1 (x) is 1. This c(f ) is unique
up to a unit factor of R, and called the content of f .
such that c(g) ∈ F × and g1 (x) ∈ R[x] is a primitive prolynomial. This c(g) is
unique up to a unit factor of R, and also called the content of g.
Remark 13.2. Let R be a UFD and F = Q(R) its fraction field. For nonconstant
g(x) ∈ F [x], as above, write
g(x) = c(g)g1 (x)
with c(g) ∈ F the content of g(x), and g1 (x) ∈ R[x] a primitive polynomial. Then
g(x) ∈ R[x] if and only if the content c(g) ∈ R.
Proposition 13.3. (Gauss lemma 1) Let R be a UFD and f (x), g(x) ∈ R[x]
primitive polynomials. Then f (x) g(x) ∈ R[x] is still a primitive polynomial.
86 13 Polynomial rings which are UFD; Gauss lemmas (Tutorial 7)
Corollary 13.4. (Contents relation) Let R be a UFD with F = Q(R) its frac-
tion field, and f (x), g(x) ∈ F [x] nonconstant polynomials. Then we have contents
relation:
c(f g) = c(f ) c(g).
Exercise 13.5. Let R be a UFD with F = Q(R) its fraction field. Let f (x) ∈ R[x]
be a noncontant monic polynomial such that f (x) = g(x) h(x) for some nonconstant
monic polynomials g, h ∈ F [x]. Show that g, h ∈ R[x].
Exercise 13.6. Let f (x), g(x) ∈ Q[x] such that the product f g ∈ Z[x]. Show that
the product of any coefficient of g with any coefficient of f is an integer.
Corollary 13.7. (Gauss lemma 2) Assume R is UFD with F = Q(R) its fraction
field and f (x) ∈ R[x]. If f (x) is reducible in F [x] then f (x) is reducible in R[x].
More precisely, if
f (x) = g(x)h(x)
for some nonconstant polynomials g(x), h(x) ∈ F [x], and write g(x) = c(g) g1 (x), h(x) =
c(h) h1 (x) then c(g) c(h) = c(f ) ∈ R and
Corollary 13.8. (Gauss lemma 3) Let R be a UFD with F its fraction field and
let p(x) ∈ R[x]. Then
(1) Suppose p(x) is a primitive polynomial. Then p(x) is irreducible in R[x] if and
only if it is irreducible in F [x].
(2) Suppose p(x) is a monic polynomial. Then p(x) is irreducible in R[x] if and
only if it is irreducible in F [x].
Theorem 13.9. The ring R is a UFD if and only if the polynomial ring R[x] is a
UFD.
13 Polynomial rings which are UFD; Gauss lemmas (Tutorial 7) 87
Corollary 13.10. Assume that R is a UFD. Then the polynomial ring R[x1 , . . . , xn ]
is also a UFD for any n ≥ 1.
Example 13.12. The polynomial ring F [x1 , . . . , xn ] over a field F is a UFD for any
n ≥ 1.
88 14 Polynomial irreducibility criteria (Tutorial 8; Lecture 13)
Proposition 14.1. Let F be a field and f ∈ F [x]. Then f has a factor of degree 1
in F [x] if and only if f has a root in F (i.e., there is an α ∈ F such that f (α) = 0).
Proposition 14.3. Assume f (x) = an xn +an−1 xn−1 +· · ·+a0 ∈ Z[x] has deg f = n.
Assume r/s (with r, s ∈ Z co-prime) is a rational root of f (x). Then
r | a0 , s | an .
In particular, if f (x) ∈ Z[x] is a monic polynomial and f (d) 6= 0 for all integers
d dividing the constant term of f (x), then f (x) has no roots in Q.
Exercise 14.4.
ai ∈ P (0 ≤ i ≤ n − 1), a0 6∈ P 2 .
Remark 14.8. (Eisenstein criterion over UFD) The same proof as in Proposi-
tion 14.7 shows:
Let R be a UFD with F = Q(R) its fraction field, P a prime ideal of R and
an 6∈ P, ai ∈ P (0 ≤ i ≤ n − 1), a0 6∈ P 2 .
Corollary 14.9. (Eisenstein criterion for Z[x]) Let p be a prime in Z and let
p | ai (0 ≤ i ≤ n − 1), p2 6 | a0 .
Example 14.10. Let p ∈ Z be any prime number and let integer n ≥ 2. Then the
polynomial
f (x) = xn − p
√
is irreducible in Q[x] and hence p
n is not a rational number.
Indeed, by a Gauss lemma, equivalently, we need to show the irreducibility claim
of f (x) in Z[x]. For the latter claim, just apply Eisenstein criterion.
Proposition 14.11. Let F [x] be the polynomial ring over a field F and f (x) a
non-constant polynomial. Then the following are equivalent.
Proof. This follows from Propositions 10.16 and 11.3 and Corollary 12.8.
Proposition 14.12. Let F [x] be the polynomial ring over a field F and g(x) a
non-constant polynomial such that
where c is a nonzero constant, the fi are distinct irreducible polynomials in F [x] and
the ni ≥ 1. Then
F [x]/(g) ∼ n
= (F [x]/(f1n1 )) × · · · × (F [x]/(fk k )).
Proof. This follows from Chinese remainder theorem for rings. Indeed, note that,
for i 6= j, we have
n n
1 = gcd(fini , fj j ) = h1 fini + h2 fj j
n
for some h1 , h2 ∈ F [x], by Propositions 10.14 and 11.13. So (fini )+(fj j ) = F [x].
14 Polynomial irreducibility criteria (Tutorial 8; Lecture 13) 91
Definition 14.13. (Multiplicity of a root) Let F [x] be the polynomial ring over
a field F and f (x) a non-constant polynomial. Recall that α ∈ F is a root of f (x)
(i.e., f (α) = 0) if and only if
(x − α) | f (x).
Proposition 14.14. Let F [x] be the polynomial ring over a field F and f (x) a non-
constant polynomial such that αi ∈ F (1 ≤ i ≤ k) are all the distinct roots of f (x)
of multiplicity mi ≥ 1. Then
(2) If F is a field of characteristic p, say some over field of Z/(p), and a ∈ F , then
whenever β ∈ F is a root of f (x) (so that 0 = f (β) = β p − a) it is a multiple
root of multiplicity p. Indeed, we have (cf. Exercise 8.10)
Proposition 14.16.
Exercise 14.18. (cf. [Dummit-Foote, §9.5, Corollary 20]) Factor n ≥ 2 into product
of prime powers:
n = pα1 1 · · · pαk k
(1)
U (Z/(n)) ∼ α
= U (Z/(pα1 1 )) × U (Z/(pk k )).
(2) U (Z/(2α )) is the product of a cyclic group of order 2 and cyclic group of order
2α−2 , for all α ≥ 2.
(3) U (Z/(pα )) is a cyclic group of order pα−1 (p − 1), for all odd prime p.
(1)
ϕ: F → F
x 7→ ax + b
is a bijection with its inverse given by
ψ: F → F
x 7→ (x − b)/a.
(2) Suppose deg f (x) = n ≥ 1 and let h(x) = xn f (x−1 ) which is called the reverse
of f (x), and which is a polynomial in F [x] with deg h(x) ≤ n. We can recover
f (x) from its reverse via:
f (x) = xn h(x−1 ).
Further, f (x) is irreducible in F [x] if and only if its reverse h(x) is irreducible.
14 Polynomial irreducibility criteria (Tutorial 8; Lecture 13) 93
R×M → M
(r, m) 7→ rm
satisfying
(rs)m = r(sm), ∀ r, s ∈ R; ∀ m ∈ M.
1R m = m, ∀ m ∈ M.
(2) A left R-module is called unital if R has 1 and axiom (2c) holds.
15 Module theory: basics (Tutorial 8; Lecture 14-15) 95
(4) When R is field (or a division ring), a left module over R is just a vector space
over R.
(5) Due to the similarity, in the sequel, we will mainly consider left R-
modules.
Exercise 15.3. Let R be a ring with 1 and M a (unital) left R-module. Show that
0R m = 0M , (−1R ) m = −m, ∀ m ∈ M.
Z×M → M
(n, m) 7→ nm.
R × M → M,
(r, m) 7→ rm.
(Left R-submodules (to be defined below) of M = R are just left ideals of R.)
Similarly, M = R is naturally a right R-module.
r ∈ R, n ∈ N =⇒ r n ∈ N.
Rn := {(a1 , . . . , an ) | ai ∈ R}.
Define addition
+ : Rn × Rn → Rn ,
Define R-action :
R × Rn → Rn ,
.
(r, Y = (y1 , . . . , yn )) 7→ rY := (ry1 , . . . , ryn ).
Then Rn is a left R-module, and called the free left module of rank n over R.
15 Module theory: basics (Tutorial 8; Lecture 14-15) 97
Example 15.10. Let Rn be the free left R-module of rank n over R as defined in
Example 15.9.
I1 × · · · × In := (a1 , . . . , an ) | ai ∈ I}
is a left R-submodule of Rn .
(2)
n
X
{(x1 , . . . , xn ) | xi ∈ R, xi = 0}
i=1
is a left R-submodule of Rn .
α1 T1 + α2 T2 : V → V
α1 T1 + · · · + αk Tk
we define
n
X
f (T ) = ai T i = a0 IV + a1 T + · · · + an T n ,
i=0
98 15 Module theory: basics (Tutorial 8; Lecture 14-15)
Here
T 0 = IV : V → V
v 7→ IV (v) := v
is the identity map, and the compositions below are linear transformations:
T 2 := T ◦ T ; T 3 = T ◦ T ◦ T ; . . . ; T n = T ◦ · · · ◦ T (n times)
T (W ) ⊆ W
(2)
∀ r ∈ R, ∀ x, y ∈ N =⇒ x + ry ∈ N.
is a left R-submodule of M .
15 Module theory: basics (Tutorial 8; Lecture 14-15) 99
(2) Let
N1 ⊆ N2 ⊆ · · ·
∪∞
i=1 Ni
is a left R-submodule of M .
Definition 15.17. (Centre of a ring) Let R be a ring. The centre Z(R) of the
ring R is defined and denoted as
Z(R) := {z ∈ R | z r = r z, ∀ r ∈ R}.
100 15 Module theory: basics (Tutorial 8; Lecture 14-15)
Remark 15.18.
z M := {z m | m ∈ M }
is a left R-submodule of M .
f: R → A
such that
f (1R ) = 1A , and
f (R) ⊆ Z(A).
We have
r a = a r; r (a b) = (r a) b = a (r b) = a (b r) = (a b) r, ∀ r ∈ R; ∀ a, b ∈ A.
(r, a) 7→ r a;
A×R → A
(a, r) 7→ a r = r a.
15 Module theory: basics (Tutorial 8; Lecture 14-15) 101
such that
ϕ(1A ) = 1B , and
ϕ(r a) = r ϕ(a), ∀ r ∈ R, ∀ a ∈ A.
(∗) r (a b) = (r a) b = a (r b), ∀ r ∈ R; ∀ a, b ∈ A.
r 7→ r 1A .
Sometimes, we use the condition (*) as defining axiom for A to be an R-algebra.
102 16 Quotient modules; Module homomorphisms (Tutorial 9; Lecture 16)
(1) A map
ϕ : M 7→ N
(1a)
ϕ(x + y) = ϕ(x) + ϕ(y), ∀ x, y ∈ M, and
(1b)
ϕ(rx) = rϕ(x), ∀ r ∈ R, ∀ x ∈ M.
∼
ϕ : M → N, or
M∼
= N, or M ' N.
n 7→ n
is a homomorphism of left R-modules.
(1) A map
ϕ:M →N
α1 ϕ1 + α2 ϕ2 : M → N,
In particular,
(ϕ1 , ϕ2 ) 7→ ϕ1 + ϕ2
(α, ϕ) 7→ αϕ
we get a left R-module structure on the additive group (HomR (M, N ), +).
ψ ◦ ϕ ∈ HomR (L, N ).
(HomR (M, M ), +, ◦)
on the set HomR (M, M ), where the addition + is as defined above, and ◦ is
the composition (Caution: ϕ ◦ ψ is not ϕ × ψ). The identity map
IM : M → M
m 7→ IM (m) := m.
αIM : M → M
m 7→ αm.
16 Quotient modules; Module homomorphisms (Tutorial 9; Lecture 16) 105
The map
f : R → HomR (M, M ),
α 7→ αIM
is a ring homomorphism with
(r, m = m + N ) 7→ rm
is well defined and makes M/N into a left R-module, called the quotient left
R-module of M by N .
m 7→ m = m + N
is a left R-module surjective homomorphism with
Ker γ = N.
A + B := {a + b | a ∈ A, b ∈ B}.
ϕ: M → N
M/(Ker ϕ) ∼
= ϕ(M ).
M/B ∼
= (M/A)/(M/B).
A ←→ A/N
for all A ⊇ N .
This correspondence commutes with the processes of taking additions and inter-
sections.
N = Ra = {ra | r ∈ R}.
108 17 Generation of modules; Direct sums; Free modules (Tut 9; Lect 17)
Example 17.2.
(1) Let R = Z and M any R-module, i.e., any additive abelian group. If a ∈ M ,
then Ra is just the subgroup of M generated by a. If A ⊆ M , then RA is just
the subgroup of M generated by A.
(2) Let R be a ring. Then M = R is naturally a left R-module (cf. Example 15.5).
(3) Let R be a ring with 1 and M = Rn the free left module of rank n over R as
defined in Example 15.9. Let
Then
M = Re1 + · · · + Ren
M := M1 × · · · × Mk := {(m1 , . . . , mk ) | mi ∈ Mi }
+ : M × M → M,
Define R-action :
R × M → M,
.
(r, Y = (y1 , . . . , yk )) 7→ rY := (ry1 , . . . , ryk ).
(a1 , . . . , ak ) 7→ a1 + · · · + ak
is an isomorphism (of left R-modules). Namely,
N1 × · · · × Nk ∼
= N1 + · · · + Nk .
(2)
Nj ∩ (N1 + · · · + Nj−1 + Nj+1 + · · · + Nk ) = 0, (∀ 1 ≤ j ≤ k).
r = a1 + · · · + ak
with ai ∈ Ni .
M := M1 × · · · × Mk := {(m1 , . . . , mk ) |, mi ∈ Mi }
Then Mi ∼
= Ni (as left R-module) and
M = N1 ⊕ · · · ⊕ Nn .
M = M1 ⊕ · · · ⊕ Mn .
M1 ⊕ · · · ⊕ Mn
and
M/(A1 . . . Ak )M ∼
= (M/(A1 M ) × · · · × (M/(Ak M ).
and unique
a1 , . . . , a n ∈ A
17 Generation of modules; Direct sums; Free modules (Tut 9; Lect 17) 111
such that
x = r1 a1 + · · · + rn an .
Theorem 17.9.
(1) For any set A there is a free left R-module F (A) on the set A and F (A)
satisfies the universal property:
ϕ:A→M
Φ : F (A) → M
such that
ϕ=Φ◦ι
where
ι : A → F (A)
Corollary 17.10.
(1) If F1 , F2 are free left R-modules on the same set A, then there is a unique
isomorphism
ϕ : F1 → F2
112 17 Generation of modules; Direct sums; Free modules (Tut 9; Lect 17)
idA : A → A
a 7→ idA (a) = a.
F ∼
= F (A)
ϕ0 : A1 → A2
ϕ : F (A1 ) → F (A2 )
such that
ϕ|A1 = ϕ0 .
disjoint union).
Remark 17.13.
(1) If F is a free left R-module with basis A, we shall often define left R-module
homomorphism
ϕ:F →N
17 Generation of modules; Direct sums; Free modules (Tut 9; Lect 17) 113
from F into other left R-module N by simply specifying their ϕ-values on the
elements of A and then saying “extend by linearity” (applying Theorem 17.9
to F = F (A)).
(2) When R = Z, the free module on a set A is called the free abelian group
on A. If |A| = n, we call F (A) the free abelian group of rank n; we have
F (A) ∼
= Z × · · · × Z (n times).
114 18 Modules over PID (Tutorial 10; Lecture 18-19)
M1 ⊆ M2 ⊆ M3 ⊆ · · ·
Theorem 18.2. Let R be a ring and M a left R-module. Then the following are
equivalent.
(2) Every nonempty set of submodules of M contains a maximal element under in-
clusion.
r1 y1 + · · · + rn+1 yn+1 = 0.
18 Modules over PID (Tutorial 10; Lecture 18-19) 115
of M such that
{a1 y1 , . . . , am ym }
γ: R → C
r 7→ ra
116 18 Modules over PID (Tutorial 10; Lecture 18-19)
induces an isomorphism
R/ Ker γ ∼
= C.
Conversely, for every left ideal I of R, the quotient ring R/I is a cyclic left
R-module since R/I = R 1R with 1R = 1R + I ∈ R/I.
Definition 18.9. (cf. Tutorial) (Torsion module; Torsion free module) Let M
be a left R-module.
Denote by
(4) If R is an integral domain, then one can show that Tor(M ) is a left R-
submodule of M .
(1)
M∼
= Rr ⊕ R/(a1 ) ⊕ · · · ⊕ R/(am )
a1 | a2 | · · · | am .
Tor(M ) ∼
= R/(a1 ) ⊕ · · · ⊕ R/(am ).
am M = 0.
a1 , . . . , a m ∈ R
M∼
= Rr ⊕ R/(pα1 1 ) ⊕ · · · ⊕ R/(pαt t )
where r ≥ 0 is an integer and pα1 1 , . . . , pαt t are positive powers of (not necessarily
distinct or non-associate) primes in R.
pα1 1 , . . . , pαt t
(1) Two finitely generated R-modules M1 and M2 are isomorphic if and only if
they have the same free rank and the same list of invariant factors.
(2) Two finitely generated R-modules M1 and M2 are isomorphic if and only if
they have the same free rank and the same list of elementary divisors.
118 18 Modules over PID (Tutorial 10; Lecture 18-19)
Applying Theorem 18.10, 18.12 and 18.14 to R = Z and finitely generated abelian
group G (as R-module) we get the two theorems below.
(1)
G∼
= Zr × Z/(n1 ) × · · · × Z/(nu )
G∼
= Zt × Z/(m1 ) × · · · × Z/(mv )
Definition 18.16. (Free rank; Invariant factor for f.g. abelian group) The
integer r in Theorem 18.15 is called the free rank or Betti number of G and the
integers n1 , . . . , nu are called the invariant factors of G. The description of G in
Theorem 18.15 is called the invariant factor decomposition of G.
Theorem 18.17. Let G be an abelian group of order n > 1 and let the unique
factorization of n into distinct prime powers be
n = pα1 1 · · · pαk k .
Then
(1)
G∼
= A1 × · · · × Ak
A∼
= Z/(pβ1 ) × · · · × Z/(pβt )
with
1 ≤ β1 ≤ · · · ≤ βt
and
β1 + · · · + βt = α
G∼
= B1 × · · · × B`
Definition 18.18. (Elementary divisors for f.g. abelian group) The inte-
gers integers pβj described in Theorem 18.17 are called the elementary divisors
of G. The description of G in Theorem 18.17 is called the elementary divisor
decomposition of G.