Professional Documents
Culture Documents
. ,
.
(1) ,
.
(2) ,
. , .
(3) ,
. ,
.
(4) , ,
. ,
.
Contents
Part I. GROUP
Chapter 1. Group
1.1.
Group
3
3
1.2. Group
1.3.
Subgroup
1.4. subgroup
1.5. subgroups
11
Chapter 2. Group
13
2.1.
13
2.2.
14
Lagranges Theorem
2.3. order
16
2.4.
17
2.5.
Group Homomorphisms
20
2.6. Isomorphism
23
2.7.
27
Correspondence Theorem
Chapter 3. Groups
31
3.1.
Cyclic Groups
31
3.2.
Direct Product
33
3.3.
38
3.4.
46
vii
viii
Contents
Chapter 4. Group
67
4.1.
Group Action
67
4.2.
Cauchys Theorem
70
4.3. p-Group
72
4.4.
75
4.5.
78
4.6.
80
4.7.
Sylow
83
Ring
89
89
5.2. Ring
90
5.3.
92
5.4.
Subring
94
96
101
6.1.
101
6.2.
Subring Ideal
103
6.3.
106
109
112
Chapter 7. Rings
119
7.1.
119
7.2.
123
7.3.
130
7.4.
139
Integral Domain
143
Chapter 8.
8.1.
Divisor
143
8.2.
Euclidean Domain
147
8.3.
148
8.4.
152
Contents
ix
165
9.1.
Field
165
9.2.
Field Characteristic
167
9.3.
171
9.4.
175
Extension Field
179
10.1.
Algebraic Elements
179
10.2.
Algebraic Closure
183
10.3.
Roots of Polynomials
186
10.4.
Finite Fields
189
Part I
GROUP
Chapter 1
Group
group ,
group .
1.1. Group
S
a, b S a b S. closed.
closed, closed.
, a b S
S . .
a b c
a b c (a b) c b c a
a (b c). .
.
a a a a (a a) (a a) a .
a (b c) = (a b) c. a b c d
a (b (c d)), (a b) (c d) ((a b) c) d ,
. a (b c) = (a b) c associative law.
()
. (,
.) semigroup.
semigroup. , .
identity.
e , a, a e e a a.
3
1. Group
e , a,
b a b = b a = e. a
inverse. e a a,
b a , a b inverse.
a1 a inverse.
group.
Definition 1.1.1. G
group.
(GP1): a, b G a b G.
(GP2): a, b, c G (a b) c = a (b c).
(GP3): G e G g g e = e g = g.
(GP4): G g G g 0 g g 0 = g 0 g = e.
Remark 1.1.2. group,
group. Z group,
group. group
G group.
.
group. Z group,
0 identity, n, n inverse. Z
group. 1 identity
inverse, 2 Z 2 1.
Q group. , 0 Q
0 inverse. 0 ,
group. 0
, . (GP1) closed
, 0 0 .
, a b = b a , group
. group.
group abelian group
group nonabelian group.
Definition 1.1.3. G group a, b G a b = b a,
G abelian group.
Group . group
. group .
1.2. Group
1.2. Group
Group ,
. group
(GP1) (GP4) ,
group .
group . .
.
group (GP3) identity,
e . something is wrong.
identity . ,
(GP3) , .
,
.
, .
(GP3) .
, .
,
.
.
.
. e e0 G
identity , e e0
Proposition 1.2.1. G group, G identity
.
Proof. e e0 G identity , e e0 .
e identity e e0 = e0 . e0 identity e e0 = e.
e = e0 , e 6= e0 , G identity.
e e0 , (GP3) identity
a G e a = a ( a e = a) identity
. identity e a = a a e = a.
1. Group
G a, inverse
,
Proposition 1.2.2. G group, G a, G
b a b = b a = e.
Proof. G b b0 a inverse . ab = ba = e
a b0 = b0 a = e.
b = b e = b (a b0 ) = (b a) b0 = e b0 = b0
b 6= b0 , .
a1 b .
a1 b. .
, .
c c0 G a x = b , a c = a c0
a1 (a c) = a1 (a c0 ). a1 (a c) = (a1 a) c = c
a1 (a c0 ) = (a1 a) c0 = c0 c = c0 . c 6= c0 , .
1.3. Subgroup
Theorem 1.2.3
Corollary 1.2.5. G group, G a b,
(a1 )1 = a
and
(a b)1 = b1 a1 .
Proof. (a1 )1 a1 x = e, x = a ,
Theorem 1.2.3 (a1 )1 = a.
(a b)1 (a b) x = e, x = b1 a1 ,
Theorem 1.2.3 (a b)1 = b1 a1 .
1.3. Subgroup
group , ,
. group
, .
, group
. group group .
subgroup. subgroup
group. subgroup .
subgroup .
Definition 1.3.1. group G, G H G
group, H G subgroup.
, G .
subgroup {1, 1}
group, group
subgroup.
group G, subgroup: G ,
identity . subgroup ,
trivial subgroups, subgroup nontrivial proper subgroups.
group nontrivial proper subgroups.
, group H G
subgroup group (GP1) (GP4) .
subgroup H identity G identity.
H a, H identity a x = x a = a. Theorem 1.2.3,
G a x = a ( x a = a), G identity
, H identity G identity. (GP4) H
a H a inverse. Theorem 1.2.3 a H
1. Group
inverse a G inverse.
subgroup .
Definition 1.3.2. group G, G H G
(SGP1): a, b H a b H.
(SGP2): a, b, c H (a b) c = a (b c).
(SGP3): G identity e H.
(SGP4): H h G inverse h1 H.
H G subgroup.
H G subgroup (SGP1) (SGP4)
. G (GP2), H G, H
(SGP2). (SGP3) . H
, H a. (SGP4) a H a1 H
(SGP1) a H a1 H e = a a1 H, (SGP3) (SGP1)
(SGP4) . ,
Lemma 1.3.3. group G, H G . H G
subgroup H G
(1) a, b H a b H.
(2) a H a1 H.
subgroup .
; !
Lemma 1.3.4. group G, H G . H G
subgroup G a, b H, a b1 H.
Proof. ( trivial ) : H G subgroup, a, b H,
b H, (SGP4) b1 H. a H b1 H, (SGP1)
a b1 H. .
() : H a b H
(SGP1) (SGP4) . Lemma 1.3.3 (SGP1)
(SGP4) , (SGP3)
(SGP4) (SGP1). e H: , H
a H, a H b = a , b H.
e = a a1 = a b1 H.
1.4. subgroup
e H, b H a = e H,
a b1 H
a b1 = e b1 = b1 H.
(GP4). c, d H, d1 H.
a = c b = d1 , a, b H. a b1 H.
a b1 = c (d1 )1 = c d H. (SGP1), H G
subgroup.
: H a, b H a1 b H,
H G subgroup.
finite group case. finite group
subgroup .
:
Proposition 1.3.5. finite group G, H G .
H G subgroup G H closed.
Proof. H G closed H G subgroup.
Lemma 1.3.3, H G closed, H G
subgroup a H a1 H . a H,
H G closed, a2 = a a H, a3 = a a2 H, ....
n N, an H. G , H
G , H . {a, a2 , a3 , . . . an , . . . }
H . m n
an = am . , m > n. (an )1 , amn = e.
m n = 1, a = e, a1 = e = a H. m n > 1,
m n 1 N. amn1 H. amn = e amn1 a = a amn1 = e.
a1 = amn1 H.
1.4. subgroup
group subgroup group.
group trivial subgroup subgroup ?
group nontrivial proper subgroup (),
nontrivial proper subgroup .
G group a G, a subgroup.
a2 , a3 , . . . , an , . . . subgroup , a1 , (a2 )1 , . . . , (an )1 , . . .
, e . Corollary 1.2.5, (an )1 = (a1 )n ,
:
hai := {an | n N} {(a1 )m | m N} {e}.
1. Group
10
subgroup
Z(G) = {g G | g x = x g, x G}.
Z(G) G center. C(a) G a
, Z(G) G .
Z(G) =
\
aG
C(a).
1.5. subgroups
11
1.5. subgroups
subgroup. subgroups
subgroups subgroup .
Lemma 1.5.1. H1 , H2 G subgroups, H1 H2 G subgroup.
Proof. . x, y H1 H2 , x, y H1 H1
subgroup, x y H1 . x y H2 . x y H1 H2 .
inverse . x H1 H2 , x H1 H1 subgroup,
x1 H1 . x1 H2 . x1 H1 H2 .
Lemma 1.5.1
. H1 H2 subgroup. Z , 2Z 3Z
subgroups subgroup. 2 2Z 3Z 3 2Z 3Z
2 + 3 = 5 6 2Z 3Z.
Lemma 1.5.1 subgroups subgroup,
subgroups subgroup. subgroups
subgroup. C(a) subgroup Z(G) = aG C(a)
subgroup.
G a subgroup H,
a1 H a = {a1 h a | h H}
( G abelian H = a1 H a).
Lemma 1.5.2. a G H G subgroup, a1 H a G
subgroup. H finite group, |H| = |a1 H a|.
Proof. x1 , x2 a1 H a, h1 , h2 H x1 = a1 h1 a
x2 = a1 h2 a.
x1 x2 = (a1 h1 a) (a1 h2 a) = a1 (h1 h2 ) a.
h1 h2 H, x1 x2 a1 Ha. .
x a1 H a, h H x = a1 h a.
x1 = (a1 h a)1 = a1 h1 (a1 )1 = a1 h1 a.
h1 H x1 a1 H a.
12
1. Group
Chapter 2
Group
2.1.
. ,
; ;
, .
equivalence relation. equivalence relation
.
Definition 2.1.1. S a b a b ,
equivalence relation:
(equiv1): a S, a a (reflexivity).
(equiv2): a b, b a (symmetry).
(equiv3): a b b c, a c (transitivity).
(equiv2) : a b b a.
(equiv3) a a. (equiv1) ? (equiv1)
S a a a. (equiv2) (equiv3),
S a S b a b, a
a a . . equivalence relation
().
equivalence relation ? (equiv1)
. (equiv2) (equiv3)
; b A B , A
a b a b B c b b c.
13
2. Group
14
(equiv2) (equiv3) a c. A B
. A B
? .
Lemma.
Lemma 2.1.2. S , equivalence relation
C1 , . . . , Cn . |S| |Ci | ,
|S| =
n
X
|Ci |.
i=1
15
1-1 onto . a a H,
H a H 1-1 onto . h H,
f (h) = a h. f : H a H H a H
. y a H, h H y = a h.
f (h) = y, f onto. h 6= h0 H , f (h) = a h
f (h0 ) = a h0 a H . a h = a h0 ,
a1 , h = h0 h 6= h0 . f ,
H a H .
2. Group
16
2.3. order
group order . group a,
cyclic group hai order a order. ord(a). G
group a G, Lagranges Theorem ord(a) | |G|. G
order G order , .
Lemma order.
Lemma 2.3.1. a group G , e G identity. n N
an = e, ord(a) = n.
Proof. n an = e hai n .
hai = {e, a, a2 , . . . , an1 }. hai ak , k Z
. : n > 1 , h r k = h n + r,
0 r < n.
ak = ahn+r = (an )h ar = e ar = ar .
an = e hai ar , 0 r < n ,
hai = {e, a, a2 , . . . , an1 }. hai n ,
. 0 i < j < n , ai 6= aj .
n . 0 i < j < n ai = aj , aji = aj ai = e.
j i N n > j i. n an = e . aj 6= ai .
hai order n.
a order n. n an = e m N
am = e, m n. m n .
Lemma 2.3.2. a group G . am = e, ord(a) | m.
Proof. ord(a) = n. , h r, 0 r < n
m = n h + r.
am = anh ar = e ar = ar .
ar = e. r 6= 0, r n ar = e.
Lemma 2.3.1 . r = 0; n m.
17
, am = e n | m n
an = e. Lemma 2.3.1 Lemma 2.3.2, ord(a) = n ,
:
(1) an = e.
(2) am = e n | m.
Proposition ,
order .
Proposition 2.3.3. a group G . ord(a) = n,
i,
n
ord(ai ) =
.
gcd(i, n)
Proof. , d = gcd(i, n). ord(ai ) = n/d,
(ai )n/d = e. d i , i/d . n a
order, an = e. (ai )n/d = (an )i/d = e.
, (ai )m = e (n/d) | m. (ai )m = e, ami = e.
Lemma 2.3.2, n | mi. d n i . n/d
i/d . n | mi (n/d) | m(i/d). n/d i/d ,
(n/d) | m.
2. Group
18
a a0 , b b0 ; a1 a0 = h1 H b1 b0 = h2 H.
a0 b0 = (a h1 ) (b h2 ). a b a0 b0 ?
(a b)1 (a0 b0 ) H?
19
N = a N a1 , a1 N a = N .
group N G normal subgroup , aN a1
N , N G normal , a N a1 = N
. !
N G normal subgroup, : g G,
n N n0 N g n = n0 g ( n00 N n g = g n00 ).
G abelian, n0 = n ( n00 = n) , . :
Lemma 2.4.3. G abelian group , subgroup normal subgroup.
normal subgroup . G
group G. subgroup N
N G ,
G . Lagrange
, G finite group N G |G|/|N | .
|G|/|N | . N G normal subgroup ,
. a a
, b b , a b = a b. (
normal subgroup well defined. a
b a b .)
group . group the quotient group of G by N (
factor group), : G/N .
(GP1): a, b G/N , ab G a b G/N . ab G/N .
(GP2): (a b) c = a (b c).
(a b) c = a b c = (a b) c,
a (b c) = a b c = a (b c)
(a b) c = a (b c) .
(GP3): G/N identity ? e G identity,
a G/N . a e = a e = a. e a = e a = a. e
G/N identity.
(GP4): a G/N a inverse ?
a1 . a a1 = a a1 = e. a1 a = e. a1
a inverse. (a)1 = a1 .
Example 2.4.4. Quotient group .
group quotient group. 5Z Z normal subgroup (
Z abelian). Z/5Z the quotient group of Z by 5Z. Z/5Z
2. Group
20
? 5Z 1 ? n Z
1 (n)1 5Z. ! +, n1
n. 1 1 n 5N. 5 1
. Z/5Z {0, 1, 2, 3, 4} . 0, 5
, identity. congruence.
: ();
( 0 ). group homomorphism
. image; kernel .
21
(a b1 ) = (a) (b)1 = e0 e0 = e0 .
a b1 ker(). im() ker() G0 G
subgroup.
ker() G normal subgroup. :
g G, g ker() g 1 ker(). : a ker(),
g a g 1 ker().
(g a g 1 ) = (g) (a) (g 1 ).
(a) = e0 (g 1 ) = (g)1 ,
(g a g 1 ) = (g) e0 (g)1 = e0 .
g a g 1 ker().
2. Group
22
2.6. Isomorphism
23
: G G0 isomorphic G G0
isomorphism. G G0 homomorphism isomorphism.
G G0 isomorphic ,
G G0 homomorphism 1-1 onto G G0
isomorphism. !
2.6. Isomorphism
G G0 isomorphic ,
isomorphism .
G ' G0 isomorphism. ! ,
. isomorphism .
Theorem 2.6.1 (First Isomorphism Theorem). : G G0 group
homomorphism,
G/ ker() ' im().
Proof. : : G G0 group homomorphism, Lemma
2.5.4 im() G0 subgroup, ker() G normal subgroup.
, G/ ker() quotient group im() group
. group homomorphism, 1-1
onto.
G/ ker() im() ,
? ! .
, :
: G/ ker() im();
a 7 (a), a G/ ker().
a (a) . group
homomorphism. (well defined function) ?
:(1) ;
(2) : . (1)
O.K. . ( G/ ker()) a ,
a G. a (a). (a) im() . (2)
. G/ ker() G
. G a, b a b G/ ker()
. , (a) = (b). a 6= b,
a = b a b ker() subgroup . a b
a1 b ker(). (a1 b) = e0 . group homomorphism
,
(a)1 (b) = (a1 b) = e0 .
2. Group
24
onto. im() = G0 .
:
Corollary 2.6.2. : G G0 group epimorphism,
G/ ker() ' G0 .
First Isomorphism Theorem ? group G, N
normal subgroup. group G0 G/N isomorphic .
G/N G0 isomorphism. G G0
epimorphism, , ker() = N . First Isomorphism Theorem
G/N ' G0 .
isomorphism First Isomorphism Theorem
! group G, H, N G subgroups, :
H N = {h n | h H, n N }.
H N G H N G . G
subgroup ! . H N , h n h0 n0 ,
h, h0 H, n, n0 N . (h n) (h0 n0 ) H
2.6. Isomorphism
25
N . H N G normal subgroup,
H N G subgroup . Lemma !
Lemma 2.6.3. H G subgroup N G normal subgroup.
H N = N H G subgroup.
Proof. N G normal subgroup, H G, h H n N ,
h n h1 N . n0 N h n h1 = n0 . h n = n0 h.
H N N H. N H H N .
, . n00 N
h0 n0 = n00 h0
(h n) (h0 n0 ) = (h n) (n00 h0 ) = h (n n00 ) h0 .
n n00 N , n
N (n n00 ) h0 = h0 n
.
(h n) (h0 n0 ) = (h h0 ) n
H N.
: h n H N ,
(h n)1 = n1 h1 N H.
N H = H N , (h n)1 H N .
isomorphism ?
Theorem 2.6.4 (Second Isomorphism Theorem). H G subgroup N
G normal subgroup. H N H normal subgroup,
H/(H N ) ' (H N )/N.
Proof. H N H normal subgroup, ,
first isomorphism , normal subgroup .
quotient group (H N )/N . group N
H N normal, N H N normal ?
trivial . H identity n N
n = e n H N . N H N . H H N subgroup.
normal? N G normal, g H N G
g N g 1 = N .
first isomorphism ? quotient group
group isomorphism , quotient group normal
subgroup. : (1) H (H N )/N homomorphism;
(2) H N H/(H N ) homomorphism. ? (1) !
(2) H N H normal . H
2. Group
26
27
2. Group
28
(H) = H 0
H/ ker() ' H 0 .
H 0 G0 normal subgroup. H G normal
subgroup.
Proof. H subgroup of G. a, b H, a b H
a1 H. a, b H (a) H 0 (b) H 0 , (a) (b) H 0 .
group homomorphism, (a b) = (a) (b). (a b) H 0 ,
a b H. (a) H 0 (a)1 H 0 , (a1 ) = (a)1 ,
(a1 ) H 0 . a1 H . ( group
homomorphism, onto.)
a ker(), (a) = e0 . e0 G0 identity H 0 G0 subgroup,
e0 H 0 . (a) H 0 , a H. ker() H. (
epimorphism.)
(H) = H 0 . (H) H 0 . (H) (a)
, a H. a H, (a) H 0 . (H) H 0
. H 0 (H) ; .
b H 0 a G (a) = b. onto
. onto b G0 , a G (a) = b.
b H 0 b G0 a G (a) = b. (a) = b H 0 ,
a H . b = (a) (H), H 0 (H).
H 0 = (H).
(H) = H 0 H H onto H 0 .
G group homomorphism, H group
homomorphism. H kernel ?
ker() H . ker() H. ker() H
ker() H = ker(). First Isomorphism Theorem
H/ ker() ' H 0 .
Theorem 2.6.5 : H 0 G0 normal H G normal.
( onto.) a H
g G g a g 1 H. g a g 1 H
H 0 .
(g a g 1 ) = (g) (a) (g)1 .
(g) G0 , (a) H 0 H 0 G0 normal subgroup,
(g) (a) (g)1 H 0 .
(g a g 1 ) H 0 , g a g 1 H. H G normal subgroup.
29
a b = a b = (a) (b).
onto , y G/N y = a, a G
. a G (a) = a = y. epimorphism.
ker() ? a ker() (a) = e, (a) = a.
a = e, a N . a N , (a) = a = e, a ker().
ker() = N .
Correspondence Theorem , Theorem 2.7.1
G/N subgroup H 0 , G subgroup H
N = ker() H (H) = H/N = H 0 .
2. Group
30
Chapter 3
Groups
3. Groups
32
33
n an H. H = han i. an H
han i H. H han i, H (an )h ,
h Z . am H, , h r,
0 r < n m = n h + r.
ar = am (anh )1 .
am H (anh )1 H, ar H. n
an H, 0 r < n, ar H r = 0. H
(an )h .
n
(a, b)nm = ((an )m , (bm )n ) = (em
1 , e2 ) = (e1 , e2 ).
3. Groups
34
Corollary 3.2.3. m, n ,
Z/nZ Z/mZ ' Z/(nm)Z.
Proof. Proposition 3.2.2 Z/nZ Z/mZ cyclic group. Z/nZ
Z/mZ order nm, Theorem 3.1.1 Z/(nm)Z isomorphic.
G = N0 M0
35
G0 (g1 , g2 ) , g1 G1 , g2 G2 . (g1 , e2 ) N 0
(e1 , g2 ) M 0 ,
(g1 , g2 ) = (g1 , e2 ) (e1 , g2 ) N 0 M 0 .
(g1 , g2 ) N 0 M 0 , (g1 , g2 ) N 0 g2 = e2 , (g1 , g2 ) M 0
g1 = e1 . {(e1 , e2 )} = N 0 M 0 .
Theorem 3.2.4. G ' G1 G2 G normal subgroups N M
x G, (x) G1 G2 , G1 G2 = N 0 M 0 ,
(x) = N 0 M 0 . n0 N 0 m0 M 0 (x) = n0 m0 .
onto n N m M (n) = n0 (m) = m0 . :
(x) = (n) (m) = (n m).
x = n m. G n m
, n N , m M .
G = N M.
, x N M , x N (x) N 0 , x M (x) M 0 .
(x) N 0 M 0 . N 0 M 0 G1 G2 identity, x ker().
ker() = {e} x = e.
N M = {e}.
G normal subgroup N M (1), (2), (3).
: G N M : x = nm G, n N m M , (x) = (n, m).
well-defined function? G G = N M ,
n m , ? , x = n m = n0 m0 ,
3. Groups
36
n = m0 m1 .
n0 1 n N m0 m1 M ,
n0
n N M.
N M = {e} n0 1 n = e, n = n0 . m = m0 .
. ! , group
homomorphism. x = n m, x0 = n0 m0 n, n0 N m, m0 M ,
(x x0 ) = (x) (x0 ).
(x) (x0 ) = (n, m) (n0 , m0 ) = (n n0 , m m0 ),
x x0 = (n n0 ) (m m0 ), n n0 N m m0 M ,
(x x0 ) = (n n0 , m m0 ).
(x x0 ) = (x) (x0 ). group homomorphism
(n m) (n0 m0 ) = (n n0 ) (m m0 ).
(n m) (n0 m0 ) = n (m n0 ) m0
(n n0 ) (m m0 ) = n (n0 m) m0 ,
m n0 = n0 m . m n0 = n0 m ?
a = b a b1 = e.
(m n0 ) (n0 m)1 = m n0 m1 n0
m n0 m1 N ( n0 N N G normal subgroup),
m n0 m1 n0
= (m n0 m1 ) n0
N.
M G normal subgroup,
m n0 m1 n0
= m (n0 m1 n0
) M.
(m n0 ) (n0 m)1 N M.
N M = {e} (m n0 ) (n0 m)1 = e, m n0 = n0 m.
1-1 and onto. x ker(), (x) N M identity
(e, e) ( e G identity N M identity). x G
n N , m M x = n m. (x) = (n, m) = (e, e).
n = e m = e, x = e e = e. ker() = {e} .
37
3. Groups
38
ord(a) | ord(a).
ord(a) = ord(a)
N hai = {e}.
Proof. ord(a) = n. an = e an = an = e, Lemma 2.3.2
ord(a) | n.
ord(a) = m. N hai = {e}, am = e am N ,
N hai = {e}. am = e, Lemma 2.3.2 ord(a) = n | m.
am
m | n, n = m: N hai = {e}, ord(a) = ord(a).
abelian groups :
Theorem 3.3.2 (Cauchys Theorem for Abelian Groups). G finite abelian
group, p , p G order, G order p.
Proof. induction . induction ?
finite abelian group order induction.
order p abelian group . order pk
abelian group , order pk abelian group .
G order p, Corollary 2.2.3 G cyclic group, a G
G = hai, ord(a) = p.
39
p , group pn , group
p-group. G pn m, p m , G subgroup H
3. Groups
40
P = {g G | g p = e}
and
M = {g G | g m = e},
G ' P M.
Proof. Lemma 3.3.4 P M G normal subgroups. G ' P M ,
Theorem 3.2.4 G = P M P M = {e} .
pn m .
pn m , r s rpn + sm = 1. a G,
n +sm
a = arp
= asm arp .
41
nm
((asm )p = (ap
)s ,
(asm )p = e;
n
asm P . arp M . G P
M , G = P M .
, g P M , g M , g m = e. Lemma 2.3.2 ord(g) | m.
ord(g) | pn . ord(g) g n m . g n m
, ord(g) = 1; g = e. P M = {e}.
Lemma 3.3.5 P ? G g
g = e order pn . Cauchy
|P | = pn .
pn
P = {g G | g p = e},
P G Sylow p-subgroup, P G Sylow p-subgroup.
Proof. M = {g G | g m = e}, p M order.
p M order, Cauchys Theorem M a
order p, am = e, Lemma 2.3.2 p | m. p - m . p
|M |.
P p-group. p q |P |,
q | pn , p, q . |P | p
, r N |P | = pr .
Lemma 3.3.5 G ' P M , |G| = |P | |M |.
|M | = |G|/|P | = pnr m.
p M , n = r. P G Sylow p-subgroup.
P 0 G Sylow p-subgroup. |P 0 | = pn , Lagrange
n
(Corollary 2.3.4) a P 0 , ap = e. a P . P 0 P .
|P 0 | = |P | = pn , P 0 = P . .
3. Groups
42
pr
= pr .
gcd(pr , i)
43
ps
= ps1 .
gcd(ps , p)
3. Groups
44
. G/B cyclic,
G/B subgroup Q0 G/B ' hai Q0 .
G/B cyclic, Lemma 3.3.8 G/B = hai. G ' hai B.
Theorem 3.2.4 G = A B A B = {e} ( A, B
normal). A B = {e}, G = A B.
x G, x G/B. G/B = hai, i x = ai . x
ai B . (ai )1 x B. j
x = ai bj . G A B ,
G = A B. A B = {e} G ' A B.
G/B cyclic induction G/B subgroup Q0
G/B ' hai Q0 . Theorem 3.2.4 G/B = hai Q0 hai Q0 = {e}.
G , Correspondence (Corollary 2.7.3)
G subgroup Q B Q Q/B = Q0 . G ' hai Q.
G = A Q. x G, x G/B, G/B = hai Q/B,
i q Q
x = ai q = ai q.
(ai q)1 x B. B = hbi, j (ai q)1 x = bj .
x = ai (q bj ). ai A, q bj Q ( B Q).
G = A Q.
A Q = {e}. x A Q, x A = hai i
x = ai . G/B x = ai = ai . a Q G/B x Q/B = Q0 .
x hai Q0 = {e}.
G/B x = e, x B. x A Q,
x A. x A B. A B = {e}, x = e.
A Q = {e}.
45
4=3+1=2+2=2+1+1=1+1+1+1
3. Groups
46
P1 isomorphic to
(1) Z/16Z or (2) Z/8Z Z/2Z or
(4) Z/4Z Z/2Z Z/2Z or
. P3 isomorphic to
(1) Z/9Z or (2) Z/3Z Z/3Z
. 144 abelian groups .
47
, . (a b) = Tab
x G,
Tab (x) = (a b) x.
(a) (b) = Ta Tb , x G,
Ta Tb (x) = Ta (Tb (x)) = Ta (b x) = a (b x).
G x G, Tab (x) = Ta Tb (x). (a b) =
(a) (b).
. group homomorphism, ker() = {e}.
a ker(), (a) A(G) identity IG . , x G
Ta (x) = x. Ta (x) = a x, a = e. G ' im(). Lemma
2.5.4 im() A(G) subgroup, .
3. Groups
48
Sn . S5
1 7 2, 2 7 3, 3 7 1, 4 7 5 5 7 4,
1 2 3 4 5
=
(3.1)
2 3 1 5 4
.
1 2 3 4 5
3 4 5 1 2
(3.2)
1 7 3, 2 7 4, 3 7 5, 4 7 1 5 7 2. ?
1 7 3, 3 7 1 1 7 1. 2 7 4, 4 7 5
2 7 5.
1 2 3 4 5
=
(3.3)
1 5 4 2 3
1 2 3 4 5
4 5 3 2 1
(3.4)
ij+1 , s = ij 1 j k 1;
s = ik ;
i1 ,
(s) =
s 6 {i1 , . . . , ik }.
s,
i1 7 i2 , i2 7 i3 , . . . , ik1 7 ik , ik i1 , i1 , . . . , ik
.
(i1 i2 ik ) k-cycle.
S5 :
1 2 3 4 5
(1 2 3) =
2 3 1 4 5
cycle Sn , Sn cycle.
cycle (). (3.1)
49
cycle . 1 7 2
(1 2
2 7 3
(1 2 3
3 7 1
(1 2 3)
) 3 3 1. 3-cycle. (1 2 3)
, 4 7 5 5 7 4. (4 5) cycle.
(3.1)
= (4 5)(1 2 3).
(1 2 3) S5
1 2 3 4 5
2 3 1 4 5
,
(4 5) =
1 2 3 4 5
1 2 3 5 4
. (3.2) 1 7 3,
(1 3
3 7 5
(1 3 5
5 7 2,
(1 3 5 2
2 7 4,
(1 3 5 2 4
4 1 )
= (1 3 5 2 4).
cycle , 5-cycle.
= (4 5)(1 2 3)(1 3 5 2 4)
? cycles ,
cycle . (1 3 5 2 4) 1 7 3, (1 2 3)
3 7 1, (4 5) 1 1 7 1. cycle
1 . 2: (1 3 5 2 4) 2 7 4, (1 2 3) 4 ,
(4 5) 4 7 5 2 7 5,
(2 5
3. Groups
50
(1 3 5 2 4) 5 7 2, (1 2 3) 2 7 3, (4 5) 3,
5 7 3,
(2 5 3
(1 3 5 2 4) 3 7 5, (1 2 3) 5 , (4 5) 5 7 4
3 7 4,
(2 5 3 4
(1 3 5 2 4) 4 7 1, (1 2 3) 1 7 2, (4 5) 2,
4 2,
= (2 5 3 4).
cycles (i1 ik ) (j1 jl ) {i1 , . . . , ik } {j1 , . . . , jl } =
cycle disjoint cycles. Sn disjoint cycles
( cycle ), disjoint cycle decomposition.
(4 5)(1 2 3) (1 3 5 2 4) disjoint cycle decomposition.
Sn , disjoint cycle decomposition
. , a1 {1, . . . , n} a1
? (a1 ) = a1 , a1 cycle decomposition ,
. (a1 ) = a2 6= a1
(a1 a2
(a2 ) ? . . . ak (ak )
. a1 , . . . , ak (ak ) {a1 , . . . , ak1 }. (ak )
a1 , (ak ) = ai , i > 1, (ai1 ) = ai , 1-1
ak = ai1 a1 , . . . , ak , (ak ) = a1 .
cycle:
(a1 ak ).
{a1 , . . . , ak } b1 , cycle.
{1, . . . , n} , cycles .
1-1 cycles disjoint.
disjoint cycle decomposition .
. (1 2 3) cycle (2 3 1) (3 1 2)
: 1 7 2, 2 7 3, 3 7 1. cycle ( (1 3 2)
cycle). (1 2 3)(4 5) (4 5)(1 2 3)
decomposition.
Lemma 3.4.4. = (a1 a2 ak ) = (b1 b2 bl ) Sn cycles.
(1) k = l a1 = b2 , a2 = b3 , . . . , ak1 = bk , ak = b1 , = .
(2) disjoint, {a1 , . . . , ak } {b1 , . . . , bl } = , = .
51
Proof. , Sn ,
{1, . . . , n} .
(1) x {1, . . . , n} x 6 {a1 , . . . , ak }, (x) = x,
{a1 , . . . , ak } = {b1 , . . . , bl },
x 6 {b1 , . . . , bl }, (x) = x.
x {a1 , . . . , ak }, x = ai , 1 i k 2,
(x) = (ai ) = ai+1 = bi+2 .
ai = bi+1 ,
(x) = (bi+1 ) = bi+2 .
x = ak1 ,
(x) = (ak1 ) = ak = b1 .
ak1 = bk ,
(x) = (bk ) = b1 .
x = ak ,
(x) = (ak ) = a1 = b2 .
ak = b1
(x) = (b1 ) = b2 .
x {1, . . . , n} (x) = (x), = .
(2) disjoint, x {1, . . . , n} : (a)
x 6 {a1 , . . . , ak } {b1 , . . . , bl }; (b) x {a1 , . . . , ak }; (c) x {b1 , . . . , bl }.
x (a) , (x) = (x) = x
( )(x) = ( (x)) = (x) = x,
( )(x) = x.
x (b) , (x) {a1 , . . . , ak } disjoint x (x)
{b1 , . . . , bl } (x) = x ((x)) = (x).
( )(x) = ( (x)) = (x)
3. Groups
52
(3.5)
= 1 s , a1 i , a1 i
i (a1 ) = a1 , ,
(a1 ) = 1 s (a1 ) = a1 .
(3.5) . 1 , . . . , s disjoint, a1 i .
a1 1 ( 1 , . . . , s disjoint
). a1 i , i 2 i s , i (a1 ) = a1 .
(3.6)
53
3. Groups
54
55
(( 1 (x))) = ( 1 (x)) = x,
x 6 { (a1 ), . . . , (ak )}, (x) = x. .
x = (a1 )
(( 1 (x))) = ((a1 )) = (a2 )
(x) = ( (a1 )) = (a2 ). x { (a1 ), . . . , (ak )}, 1
x . Sn .
3. Groups
56
(3.7)
(3.8)
(a b)(a a2 ak )(b b2 bl ) = (a a2 ak b b2 bl )
(3.9)
57
( r s :
2 | r s).
3. Groups
58
Proof. .
: n n A, A A0 ,
det(A0 ) det(A).
Sn A A i (i) .
= (i j) A A i j , j i ,
2 cycle A A . , Sn ,
( ) A A i ( )(i) = ( (i)) . A (i)
A i ( A) A (i) ( (i)) .
( A) A i ( (i)) . ( ) A ,
( ) A = ( A) , Sn .
(3.10)
= 1 2 r = 10 20 s0 , In , In n n
. (3.10)
In = 1 ( (r In )) = 10 ( (s0 In )).
i , j0 2-cycles, ,
det( In ) = (1)r = (1)s .
r s .
59
even;
1,
sgn() =
1, odd.
{1, 1} , 1 identity, Lemma 3.4.17
sgn group homomorphism. ker(sgn) = An , Lemma 2.5.4
An Sn normal subgroup. 2-cycle odd, sgn onto,
First Isomorphism (Corollary 2.6.2) Sn /An ' {1, 1}.
|An | = |Sn |/2.
3. Groups
60
61
: Lemma 3.4.22 H Sn
nontrivial proper subgroup, H = An Sn 3-cycle H
; H normal Lemma 3.4.23 H
3-cycle H = An .
n 5 An Sn nontrivial normal subgroup.
Theorem 3.4.24. n 5 , N Sn nontrivial proper normal subgroup,
N = An .
Proof. Lemma 3.4.23 N 3-cycle, N = An .
N nontrivial, N identity. N
identity. identity, {1 . . . , n} a
b, (a) = b 6= a. N identity ,
. b a a0 ,
cases:
(1) (a) = b, (b) = a;
3. Groups
62
63
. N Sn normal, (a b c) N
(a b c) 1 N , N An normal, An
(a b c) 1 N (: N An normal
N , An 1 N ).
An (a b c) 1 = (a0 b0 c0 ).
, An = . An ?
odd permutation, 2-cycle even
permutation, An . Lemma 3.4.23 ,
n 5. i, j {1, . . . , n} i j {a, b, c}, = (i j).
An
(a b c) 1 = ( (i j)) (a b c) ( (i j))1
= (i j)(a b c)(i j) 1
= (a b c) 1
= (a0 b0 c0 ).
( (a b c) (i j) disjoint)
3. Groups
64
(a b c) N N An normal, (a0 b0 c0 ) N .
: Lemma 3.4.25 n 5 ,
n = 3, 4 , Lemma 3.4.25 .
Theorem 3.4.24 Theorem.
Theorem 3.4.26. n 5 An nontrivial proper normal subgroup.
Proof. , N identity An normal subgroup,
3-cycle N . , Lemma 3.4.25 N = An , .
Theorem 3.4.24 , N identity
, 2-cycle 1 6= . N
identity , ( 1 1 ). N N
Sn normal subgroup, 1 N 1 1 N .
N An normal, 2-cycle An , 1 1 N .
, An .
3-cycle . 3-cycle 1 6= .
N identity, a {1, . . . , n} (a) = b 6= a.
3-cycle, :
(1) (a) = b, (b) = a;
(2) (a) = b, (b) = c (c) = a;
(3) (a) = b, (b) = c (c) = d 6= a.
case 1 , = (a b i), i {1 . . . , n} i 6 {a, b}.
Lemma 3.4.10
1 = (b a (i)).
(a) = b, i 6= a (i) 6= b. a 7 b, 1 a 7 (i)
1 6= .
case 2 , = (a b i), i {1 . . . , n} i 6 {a, b, c} (
n 5 i). Lemma 3.4.10
1 = (b c (i)).
b 7 i, 1 b 7 c, i 6= c 1 6= .
case 3 , = (a b c) .
1 = (b c d),
a 6= d 1 6= .
: N identity ,
3-cycle 1 6= . An , N An normal, 1 N
65
1 1 N . = ( 1 ) 1 identity,
= ( 1 1 ) N . 3-cycle, Lemma 3.4.10
1 3-cycle. = ( 1 ) 1 3-cycle
permutation. : N identity ,
3-cycle .
3-cycles :
: 3-cycles ;
: 3-cycles , ;
: 3-cycles , ;
: 3-cycles .
case , (i j k)(i j k) ( (i j k)(i k j)
identity).
= (i j k)(i j k) = (i k j) N.
N 3-cycle.
case , (i j k)(j i r) (i j k)(i j r). ,
= (i j k)(j i r) = (i r k) N ;
,
= (i j k)(i j r) = (i k)(j r).
n 5, {1, . . . , n} s 6 {i, j, k, r}, = (i k s) N .
N N An normal, 1 N . 1 = (k s)(j r)
1 ( 1 ) = (k j t s i)(s t i j k) = (i t k) N.
, N 3-cycle.
case , (i j k)(r s t).
1 = (j r k)(i s t) N .
= (i j r) An ,
3. Groups
66
Chapter 4
Group
group .
group action. group action ,
group action . , .
group action ,
action, group action
.
4. Group
68
equivalence relation S
, . S , S
[x1 ], . . . , [xr ] r , [xi ] S xi .
Lemma 2.1.2
r
X
|S| =
|[xi ]|.
(4.1)
i=1
[xi ] .
Lemma 4.1.3. (G, S, ) group action, x S.
(1) Gx = {g G | g x = x}, Gx G subgroup.
(2) [x] S x . G S finite,
|G|
|[x]| =
.
|Gx |
Proof. (1) a, b Gx , a x = x b x = x, (Act3)
(a b) x = a (b x) = a x = x,
69
a b Gx .
x = e x = a1 (a x) = a1 x,
a1 Gx . Gx G subgroup.
(2) y [x], a G y = a x. ,
a G, y = a x, y x . [x] = {g x | g G},
[x] g x . a, b G a 6= b
a x = b x. [x] , G
g x . a, b G a x = b x, a1 ,
x = a1 (a x) = a1 (b x) = (a1 b) x.
a1 b Gx . , a1 b Gx a x = b x.
a1 b Gx ! Gx subgroup G , a
x a x. a, b G Gx subgroup
, a x 6= b x. [x] G Gx
. Lagrange (Theorem 2.2.2)
Gx G , G |G|/|Gx | , .
|S| =
r
X
i=1
|[xi ]| = |S0 | +
r
X
i=t+1
|[xi ]|,
4. Group
70
Pr
(mod p).
, Proposition 4.1.4
, group action, S0 .
x = (am , a1 , a2 , . . . , am1 ).
x x ,
, , m 7 1, x x m
.
(H, S, ) group action, (Act3). , H,
x S, x x i (i) ; x
x i (i) . ( x) x
(i) ((i)) . x (i)
x i , ( x) x i
((i)) . ( ) x x i
( )(i) = ((i)) . i {1, . . . , m}
( x) = ( ) x.
71
x S.
(Act2). I H H identity, I(i) = i, i
{1, . . . , m}. I x x i i
. x S, I x = x.
, (H, S, ) group action. S .
|G| = n, S (a1 , . . . , am ) ,
G , S nm . S
a1 a2 am1 am = e. m 1 G
a1 , . . . , am1 m (a1 am1 )1 . S
,
|S| = nm1 .
(4.2)
S0 . x = (a1 , a2 , . . . , am1 , am ) S0 ,
x = x. x = (am , a1 , . . . , am1 ),
am = a1 , a1 = a2 , . . . , am1 = am .
a1 = a2 = = am1 = am .
S0 (a, a, . . . , a) , a G ;
S0 S, (a, a, . . . , a) S am = e.
x = (a, a, . . . , a), am = e, x S0 .
S0 = {(a, a, . . . , a) Gm | a G, am = e}.
(4.3)
em = e, (e, e, . . . , e) S0 . S0 ,
|S0 | 1.
(4.4)
4. Group
72
|S| 0 (mod p)
(4.5)
4.3. p-Group
abelian p-group. p-group.
4.3.1. Conjugation as a group action. x G,
g G, g x g 1 x conjugation. G S = G
group action.
G group. S = G, S . G S
: a G, x S, a x = a x a1 .
(G, S, ) group action. (Act1). a G,
x S, a x = a x a1 . a, x, a1 G G group,
a x a1 G = S. a x S. e x = e x e1 = x, (Act2)
. a, b G, x S,
a (b x) = a (b x b1 ) = a (b x b1 ) a1 ,
(a b) x = (a b) x (a b)1 = (a b) x (b1 a1 ).
a (b x) = (a b) x, (Act3).
4.3. p-Group
73
S0 = Z(G) = {x G | g x = x g, g G}.
(4.6)
e Z(G),
|S0 | 1.
(4.7)
(4.8)
4. Group
74
G ' Z/p2 Z
or
75
a H = {a h | h H}
. a H a , a H
H G left coset. a H = b H
a1 b H. , a H 6= b H, a1 b 6 H.
4. Group
76
(h h0 ) (a H) = ((h h0 ) a) H.
(Act3) .
S H G left coset , S H G
. Lagrange (Theorem 2.2.2)
|G|/|H|,
|G|
|S| =
.
(4.9)
|H|
S0 ? a H S0 , h H h (a H) = a H.
h (a H) = (h a) H,
a H = (h a) H.
a1 h a H. a H S0 h H, a1 h a H.
, a h H, a1 h a H, a H S0 .
S0 = {a H | a1 h a H, h H}.
(4.10)
S0 , a h H,
a1 h a H . a , a1 H a H.
G finite group, Lemma 1.5.2 |a1 H a| = |H|,
a1 H a = H. (4.10)
S0 = {a H | a1 H a = H}.
a1 H a = H a N (H),
N (H) = {a G | a1 H a = H}.
(4.11)
77
|N (H)|
.
|H|
(4.12)
H N (H) subgroup, e H = H .
|S0 | 1.
(4.13)
4. Group
78
(4.14)
(4.15)
79
|G|
.
|P |
(4.16)
S0 ? a P S0 , h H
(h a) P = h (a P ) = a P.
a h a P , a1 h a P .
h H , a1 H a P . a P S0
a1 H a P . , a a1 H a P , a P S0 .
S0 = {a P | a1 H a P }.
(4.17)
( Sylow ).
G a a1 H a P {a G | a1 H a P }.
G subgroup (), P (
H P ). group action |S0 | .
, Second Sylows Theorem |S0 |.
4.5.2. Sylow p-subgroups . Sylow G
Sylow p-subgroup. Sylow Sylow p-subgroup,
G Sylow p-subgroup.
Theorem 4.5.1 (Second Sylows Theorem). p . G finite
group, P G Sylow p-subgroup.
(1) H G p-subgroup, a G
H a P a1 .
(2) P 0 G Sylow p-subgroup, a G
P 0 = a P a1 .
Proof. (1) H S = {a P | a G} group action.
|G| = pn m, p - m. P G Sylow p-subgroup, |P | = pn .
(4.16) |S| = |G|/|P | = m. p - m, p |S|,
|S| 6 0 (mod p).
(4.18)
4. Group
80
81
p-subgroup. a P 0 S. e P 0 = e P 0 e1 = P 0 (Act2) .
a, b G,
(a b) P 0 = (a b) P 0 (a b)1 = (a b) P 0 (b1 a1 ),
a (b P 0 ) = a (b P 0 ) a1 = a (b P 0 b1 ) a1 ,
(a b) P 0 = a (b P 0 ). (Act3).
|S| ? G Sylow p-subgroup .
S0 , group action ,
|S|. ? P1 , P2 S Sylow (Theorem
4.5.1) a G
P2 = a P1 a1 = a P1 .
S , .
P 0 S, (4.1) |S| = |[P 0 ]|. [P 0 ]
. Lemma 4.1.3 |[P 0 ]| = |G|/|GP 0 |, GP 0 = {a G | a P 0 = P 0 }.
GP 0 ? GP 0 a
P 0 = a P 0 = a P 0 a1 .
4.4
P 0 normalizer N (P 0 ). GP 0 = N (P 0 ).
|S| = |[P 0 ]| =
|G|
|N (P 0 )|
(4.19)
x P 0 = x P 0 x1 .
, group . (P, S, )
group action.
S G Sylow p-subgroup .
group , ,
. |S0 |.
S0 ? P 0 S0 , x P ,
x P 0 x1 = x P 0 = P 0 ,
normalizer x N (P 0 ). P 0 S0 P 0
x P x N (P 0 ) . : P 0 S0 , P N (P 0 ).
4. Group
82
, P 0 G Sylow p-subgroup P N (P 0 ), x P ,
x P 0 = P 0 .
S0 = {P 0 S | P N (P 0 )}.
(4.20)
P S Lemma 4.4.1 P N (P ),
P S0 .
(4.21)
r | m;
(2)
r 1 (mod p).
pn m
m
|G|
=
= .
r=
0
n
|N (P )|
p d
d
r | m.
(2) group action (P, S, ) r 1 (mod p). P
p-group, Proposition 4.1.4
r = |S| |S0 | (mod p).
(4.22)
|S0 |. (4.20) P 0 S0 P N (P 0 ).
|N (P 0 )| = pn d, d | m. p - m p - d, |P | = pn P N (P 0 )
Sylow p-subgroup. , Lemma 4.4.1 , P 0 N (P 0 ) normal
subgroup. P 0 N (P 0 ) Sylow p-subgroup. Corollary 4.5.2 P 0
N (P 0 ) Sylow p-subgroup. P = P 0 . S0 P
. (4.21) S0 = {P }, S0 . (4.22)
r 1 (mod p).
(1 2 4),
(1 3 4),
(2 3 4)
4.7. Sylow
83
4.7. Sylow
group . group
Sylow . Sylow ,
, group
, group .
order group, order
group ( order p group cyclic, order p2 group abelian).
.
Proposition 4.7.1. G group |G| = pn q, n 1, p q
p > q. G Sylow p-group G normal subgroup.
Proof. group order, , normal
. Second Sylows Theorem .
G Sylow p-subgroup , Sylow (Corollary
4.5.2) G normal subgroup .
G r Sylow p-subgroup. Sylow (Theorem 4.6.1) r | q
r = pk + 1. r 6= 1, r p + 1 > q, r | q . r = 1,
G Sylow p-group G normal subgroup.
n = 1 .
4. Group
84
q | p 1 ? q = 2 . |G| = 2p,
p . Proposition 4.7.1 , G Sylow p-subgroup P
G normal subgroup. |P | = p, Corollary 2.2.3 a G
ord(a) = p P = hai. 2 |G|, Cauchy (Theorem 4.2.1)
b G ord(b) = 2. (: Lagranges Theorem b 6 P P hbi = {e}.)
P G normal subgroup i N, b a b1 = ai . i
.
2
b (b a b1 ) b1 = b ai b1 = (b a b1 )i = ai .
2
4.7. Sylow
85
or
G ' Dp .
4. Group
86
i2 = j 2 = k 2 = 1 i j = j i = k. Q8 order 4 6
( i, j k), D4 ( a a3 ) Q8 D4 isomorphic.
order 8 nonabelian group .
Proposition 4.7.4. G order 8 nonabelian group,
G ' D4
or
G ' Q8 .
a b = a (a b) (a b) b = b a
G nonabelian . G order 4 .
a G ord(a) = 4. hai order 4 = 22 subgroup
|G| = 8 = 23 , Sylow (Theorem 4.4.2) , G subgroup K
|K| = 22+1 hai K normal subgroup. |K| = |G|, K = G.
hai K normal subgroup.
hai K normal subgroup, b G b 6 hai, i N
b a b1 = ai . i . ord(b a b1 ) = r,
(b a b1 )r = b ar b1 = e,
ar = e. Lemma 2.3.2 4 | r. (b a b1 )4 = b a4 b1 = e r | 4.
ord(b a b1 ) = 4. Lemma 2.3.3 i = 1, 3 ord(ai ) = 4,
b a b1 = ai , i = 1 i = 3. i = 1 b a = a b G
abelian, G nonabelian .
b a = a3 b = a1 b.
b 6 hai, ord(b) = 2 ord(b) = 4. ord(b) = 2
G ' D4 ; ord(b) = 4, G ' Q8 . order 8 nonabelian group
.
: order 11 group ( )?
order 12 ? .
order , . ,
order 16 group 14 , order 32 group 51 .
Part II
RING
Chapter 5
Ring
ring , ring
.
5.1. Ring
Ring Group , . +
. + abelian group,
. , .
(distributive laws) .
Definition 5.1.1. R + ,
ring:
(R1): a, b R a + b R.
(R2): a, b, c R (a + b) + c = a + (b + c).
(R3): R 0 a R a+0 = 0+a = a.
(R4): R a, R b a + b = b + a = 0.
(R5): a, b R a + b = b + a.
(R6): a, b R a b R.
(R7): a, b, c R (a b) c = a (b c).
(R8): a, b, c R a(b+c) = ab+ac (b+c)a = ba+ca.
(R1) (R5) R (+) abelian group. group
. 0 R a + 0 = 0 + a = a
(Proposition 1.2.1), a R b R a+b = b+a = 0
(Proposition 1.2.2). b a. 0
89
5. Ring
90
0, a a inverse,
.
group .
Lemma 5.1.2. R ring, :
(1) a R, (a) = a.
(2) a, b R c R a + c = b.
Proof. Theorem 1.2.3 Corollary 1.2.5.
(a) = a a inverse a,
.
(R6) (R7) R () .
identity . ring identity ,
R group Proposition 1.2.1
identity . 1 identity (:
1 1). ring R
identity , R ring with 1.
(R6) (R7) a b = b a. ring R a, b R
a b = b a, R commutative ring ( :
abelian ring ). commutative
ring with 1 ring.
(R8) ring . ring
, (R8) ring .
ring commutative ring, .
5.2. Ring
ring ( ) .
R ring, identity 0 .
0 0 0 ,
0 . ? a + 0 = 0 a + x = a x = 0
, Lemma !
Lemma 5.2.1. R ring 0 identity, a R
a 0 = 0 a = 0.
Proof. 0 , a 0 ,
Lemma .
5.2. Ring
91
Remark 5.2.2.
a 0 = a (a a) = a a a a = 0
(5.1)
ring, R a (1) a. 1 R
, 1 R . R (1) a .
R ring with 1, Lemma 5.2.3
(1) a = 1 (a) = a
a (1) = (a 1) = a.
Lemma 5.2.3 .
Corollary 5.2.4. R ring a, b R
(a) (b) = a b.
5. Ring
92
93
, ring a 6= 0 a b = a c
b = c, ring zero-divisor. zero-divisor
ring .
Definition 5.3.4. R ring R zero-divisor, R
domain. R commutative ring with 1 domain,
integral domain.
Z ring integral domain.
R ring with 1, R inverse R .
.
Definition 5.3.5. R ring with 1, a R b R
a b = b a = 1, a R unit.
b R unit. Proposition 1.2.2
b R . a unit a1
inverse.
Example 5.3.6. Z/6Z ring 1 Z/6Z 1 ( identity). 55 = 1,
1 5 unit. 0, 2, 3, 4 unit.
5. Ring
94
Unit :
Lemma 5.3.7. R ring with 1 a R unit,
(1) a 0, R zero-divisor.
(2) b R, a x = b y a = b R .
Proof. (1) a = 0, Lemma 5.2.1 a R 0,
b a b = 1. a unit , a 6= 0.
a zero divisor, c 6= 0 a c = 0 c a = 0.
a c = 0, a unit a1 R,
0 = a1 (a c) = c.
c 6= 0 , a zero-divisor. c a = 0 .
(2) b R, a unit a1 R, x = a1 b R
a x = a (a1 b) = b.
x0 R a x0 = b, a x = a x0 , (1) a zero-divisor
Lemma 5.3.3 x = x0 . a x = b R .
y a = b R .
5.4. Subring
group subgroup. ring
subring.
5.4. Subring
95
subring .
Definition 5.4.1. R ring, S R R S
ring, S R subring.
S (R1) (R8) S R subring,
subgroup R (R2) (R7)
. (R5) (R8) R
(R1), (R3), (R4) (R5). S R
subgroup S . .
Lemma 5.4.2. R ring, S R. a, b S a b S
a b S, S R subring.
Proof. Lemma 1.3.4 , a, b S a b S, S
R subgroup. a b S , S R
subring.
2 4 = 2,
4 4 = 4,
5. Ring
96
a b
c d
a, b, c, d R. R ring M2 (R)
, :
0 0
a b
a b
a + a0 b + b0
+
=
c d
c0 d0
c + c0 d + d0
0 0
a b
a b
a a0 + b c0 a b0 + b d0
=
.
c d
c0 d0
c a0 + d c0 c b0 + d d0
R
ringwith 1, M2 (R) ring,
0 0
1 0
0 0
1 0
0 0
=
1 0
0 0
1 0
1 0
0 0
0 0
0 0
=
.
1 0
0 0
(: ring R commutative , a, b R
a b = b a. R noncommutative , a, b R
a b 6= b a .)
0 0
1 0
M2 (R) zero-divisor.
1 0
0 0
noncommutative ring a b = 0
b a 6= 0 .
M2 (R) zero-divisor unit. :
a b
d b
adbc
0
=
.
(5.2)
c d
c a
0
adbc
R commutative
(5.2) . a d b c
a b
,
determinant. A M2 (R)
c d
det(A) determinant. R ring, A M2 (R),
det(A) R. Determinant :
det(A B) = det(A) det(B),
A, B M2 (R).
(5.3)
97
M
? determinant
0
.
2 (R)
zero-divisor
a b
0 0
d b
0 0
, A =
det(A) = 0 ,
6=
6=
,
c d
0 0
c a
0 0
(5.2) A zero-divisor.
zero-divisor ? det(A)
R
, A
zero-divisor
a b
0 0
M2 (R) zero-divisor. A =
det(A) =
6=
c d
0 0
R zero-divisor. 6= 0 R = 0.
:
0
0
, 6= 0,
(1) a , b , c d 0: B =
0 0
B 6=
,
0 0
a b
0
a b
0 0
AB =
=
=
.
c d
0
c d
0 0
, A M2 (R) zero-divisor.
(2) a , b , c d 0:
d b
0
d b
0 0
B=
=
6=
.
c a
0
c a
0 0
AB =
a b
c d
d b
0
,
c a
0
(5.2)
AB =
0
0
0
0 0
=
=
.
0
0
0 0
A M2 (R) zero-divisor.
a b
A =
det(A) = R zero-divisor ?
c d
0 0
a b
0 0
B =
6=
( a0 , b0 , c0 d0 0)
c0 d0
0 0
0 0
d b
AB =
.
C=
, (5.2)
0 0
c a
0 0
a0 b0
0
a b
.
=
(C A) B =
c0 d0
c0 d0
0
0
0
0
zero-divisor a0 , b0 , c0 d0
0, a , b , c
0 0
d0 0. (C A) B 6=
.
0 0
0 0
(C A) B = C (A B) =
0 0
5. Ring
98
0 0
0 0
, B 6=
A B =
.
0 0
0 0
0 0
0 0
B 6=
B A =
. A M2 (R)
0 0
0 0
zero-divisor. :
1 0
AB =BA=
.
0 1
(5.3)
det(A) det(B) = det(B) det(A) = 1.
det(A), det(B) R, det(A) R unit.
a b
, A =
det(A) = R unit,
c d
1 d
1 (b)
B=
.
1 (c)
1 a
1 R, B M2 (R). (5.2),
1 0
AB =BA=
.
0 1
A M2 (R) unit.
(a + bi) (a0 + b0 i) = aa0 + ab0 i + ba0 i + bb0 i2 = (aa0 bb0 ) + (ab0 + ba0 )i.
99
(5.4)
a + bi 6= 0 + 0i ( a 6= 0 b 6= 0),
a
b
(a + bi) ( 2
+ 2
i) = 1 + 0i.
2
a +b
a + b2
C 0 unit, C field.
R C , Hamilton :
H = {a + bi + cj + dk | a, b, c, d R},
i, j, k 6= R, H the Hamilton quaternions. H
: a + bi + cj + dk, a0 + b0 i + c0 j + d0 k H,
(a + bi + cj + dk) + (a0 + b0 i + c0 j + d0 k) = (a + a0 ) + (b + b0 )i + (c + c0 )j + (d + d0 )k.
H i, j k :
(1) i2 = j2 = k2 = 1,
(2) i j = k = j i,
(3) j k = i = k j,
(4) k i = j = i k.
a + bi + cj + dk, a0 + b0 i + c0 j + d0 k H,
i, j, k .
(a + bi + cj + dk) (a0 + b0 i + c0 j + d0 k) = + i + j + k,
H ring with 1, 0 + 0i + 0j + 0k
1 + 0i + 0j + 0k H 0 1. H commutative ring,
(0 + 1i + 0j + 0k) (0 + 0i + 1j + 0k) = 0 + 0i + 0j + 1k
(0 + 0i + 1j + 0k) (0 + 1i + 0j + 0k) = 0 + 0i + 0j 1k
. , H (5.4) :
(a + bi + cj + dk) (a bi cj dk) = (a2 + b2 + c2 + d2 ) + 0i + 0j + 0k.
(5.5)
5. Ring
100
(5.5) , a + bi + cj + dk 6= 0 + 0i + 0j + 0k ( a, b, c, d
0), = a2 + b2 + c2 + d2 ,
a
b
c
d
i j k) = 1 + 0i + 0j + 0k.
ring.
, {1 i, j, k} 4.7
quaternion group Q8 . group
ring, ring group ring.
Chapter 6
Ring
a + b = a + b.
a b = a b.
101
6. Ring
102
. a R/S ,
a0 R a0 6= a a = a0 ( a a0 S ). :
a = a0 b = b0 a b 6= a0 b0 ?
.
S R/S ? r, r0 R
s, s0 S r = r + s r0 = r0 + s0 r r0 = (r + s) (r0 + s0 ) r r0
(r + s) (r0 + s0 ) S . :
(r + s) (r0 + s0 ) r r0 = r s0 + s r0 + s s0 S.
(6.1)
S subring, s s0 S, (6.1)
r, r0 R s, s0 S
r s0 + s r S
(6.2)
s = 0 s0 = 0 (6.2), r R
s S
rsS
s r S.
:
Definition 6.1.1. I R subring r R a I
raI
a r I,
I R ideal.
ring ideal ring, subring
ring , Lemma 5.4.2 ideal .
Lemma 6.1.2. R ring, I R. I , I R ideal:
(1) a, b I a b I.
(2) a I, r R r a I a r I.
Proof. a, b I, b R, (2) a, b I
a b I. (1), Lemma 5.4.2 I R subring.
(2) I R ideal.
a b = a b.
103
R/I + ring.
group , R/I + abelian group,
R/I (R1) (R5) 5 ring . (R6), (R7) (R8)
.
(R6): a, b R/I, a b R a b R/I. a b R/I.
(R7): (a b) c = a (b c).
(a b) c = a b c = (a b) c,
a (b c) = a b c = a (b c)
(a b) c = a (b c) .
(R8): , a (b + c) = a b + a c
a (b + c) = a b + a c.
(b + c) a = b a + c a.
R/I R quotient ring.
6. Ring
104
a b = (s + t) (s0 + t0 ) = s s0 + s t0 + t s0 + t t0 .
S T R subring, s s0 S t t0 T . S R ideal
t, t0 R, s t0 S t s0 S. s s0 + s t0 + t s0 S
(s + t) (s0 + t0 ) S + T . Lemma 5.4.2 S + T R subring.
(2) S T R ideal, r R, s S t T
r s, s r S r t, t r T .
r (s + t) = r s + r t S + T
(s + t) r = s r + t r S + T.
Lemma 6.1.2 S + T R ideal.
S T R ideal, S T R subring.
R ideal ! group subgroup
subgroup, S T R subring, S T R subring.
ring , S, T R subring {s t | s S, t T }
R subring ? s, s0 S, t, t0 T , (s t) (s0 t0 )
s00 t00 , s00 S, t00 T ( R commutative).
R commutative, s t + s0 t0 s00 t00 , s00 S,
105
t00 T . {s t | s S, t T } .
n
X
{
si ti | si S, ti T, for some n N}.
i=1
S T . , S T
S T .
Lemma 6.2.3. R ring, S T R ideal, S T R ideal.
Proof. a = s1 t1 + + sn tn b = s01 t01 + + s0m t0m S T
,
a b = s1 t1 + + sn tn + (s01 ) t01 + + (s0m ) t0m
S T . a b S T .
r R,
ra=r
n
X
i=1
s i ti =
n
X
(r si ) ti .
i=1
si S S R ideal, r si S. r a S
T . r a S T . a r S T . Lemma 6.1.2
S T R ideal.
6. Ring
106
R ring T S R.
(1) S R subring T S subring, T R subring.
(2) S R subring T R ideal , T S ideal.
(3) S R subring T S ideal, T R ideal.
(4) S R ideal T S ideal, T R ideal.
(a b) = (a) (b),
ring homomorphism.
: a, b R, a + b, a b R ;
(a), (b) R0 , (a) + (b), (a) (b) R0 . :
R R0 ring homomorphism, group homomorphism
. group homomorphism
ring homomorphism . Lemma 2.5.2 (0) = 0 ( 0
R 0, 0 R0 0) (a) = (a). (a b)
(a b) = (a + (b)) = (a) + (b) = (a) + ((b)),
(a b) = (a) (b).
group homomorphism image kernel, ring
homomorphism . .
Definition 6.3.2. : R R0 group homomorphism,
im() = {(a) R0 | a R}
image.
ker() = {a R | (a) = 0},
kernel.
kernel 0 R0 identity. group homomorphism
image kernel subgroup normal subgroup.
ring homomorphism !
107
6. Ring
108
(a b) = a b = a b = (a) (b).
onto , y R/I y = a, a R .
a R (a) = a = y. onto.
ker() ? a ker() (a) = 0, (a) = a.
a = 0, a I. a I, (a) = a = 0, a ker(). ker() = I.
109
a 7 (a), a R/ ker().
(a b) = (a b) = (a b).
ring homomorphism,
(a + b) = (a) + (b) = (a) + (b)
6. Ring
110
,
(a + b) = (a) + (b)
(a b) = (a) (b).
onto. im() = R0 .
:
Corollary 6.4.3. : R R0 onto ring homomorphism,
R/ ker() ' R0 .
ring isomorphism . ?
group : group G, H G subgroup N G
normal subgroup. H N H normal subgroup, H/(H N ) ' (H N )/N.
group ring, subgroup subring, normal subgroup ideal,
.
Theorem 6.4.4 (Second Isomorphism Theorem). R ring, S R
subring I R ideal, S I S ideal,
S/(S I) ' (S + I)/I.
Proof. Lemma 6.2.1 S + I R subring, I S + I
I S + I ideal ( 6.2 ). (S + I)/I ring.
group , first isomorphism .
S (S + I)/I . : S (S + I)/I, s S
(s) = s.
ring homomorphism. s, s0 S,
(s + s0 ) = s + s0 = s + s0 = (s) + (s0 )
(s s0 ) = s s0 = s s0 = (s) (s0 ).
111
6. Ring
112
( 1 R ) R na = a. Lemma 6.1.2,
I r R, r a a r . r a = a r (
R commutative ring ), I r a
. r a R ideal,
a ideal .
Lemma 6.5.1. R commutative ring with 1, a R. A =
{r a | r R}, A R ideal. , A R a ideal.
Proof. : I R a ideal, A I.
A R ideal, I = A.
Lemma 6.1.2 A R ideal. A r a r0 a,
r, r0 R. r a r0 a = (r r0 ) a r r0 R, r a r0 a A.
6.5. Ideals
113
R r A r0 a, r0 R. (r0 a) r = r (r0 a) = (r r0 ) a
r r0 R, (r0 a) r = r (r0 a) A. A R ideal.
Lemma 6.5.1 A a .
( ) .
Definition 6.5.2. R commutative ring with 1, a R.
a = {r a | r R}
the principle ideal generated by a in R. I R ideal R
a I = a I R principle ideal.
Example 6.5.3. Z , n Z, n principle
ideal, n = {z n | z Z}.
Z ideal principle ideal, ring
. I principle ideal, I (
n = n ), .
Lemma 6.5.4. R commutative ring with 1. a, b R
unit u R a = u b, a = b .
Proof. a = u b, a b . b ideal a
a ideal, a b . , u R unit, v R
v u = 1. b = (v u) b = v a b a . b b ideal
b a . a = b .
6. Ring
114
6.5. Ideals
115
6. Ring
116
6.5. Ideals
117
Corollary 6.5.13 . Z Z/ 0 ' Z, Z
integral domain field, 0 Z prime ideal maximal
ideal.
Chapter 7
Rings
119
7. Rings
120
121
d a, b common divisor ? d d = a + b ,
m, n Z d = m a + n b. c a, b common divisor,
c | a c | b, r, s Z a = r c b = s c.
d = m (r c) + n (s c) = (m r + n s) c.
c | d. d a, b common divisor .
7. Rings
122
,
. (prime).
Proposition 7.1.7. Z p irreducible element, p prime
element. , p prime element, p irreducible element.
Proof. p irreducible p prime. p
irreducible. p | a b : p | a p | b. p | a b r Z
a b = r p. p | a , p - a
. p, a greatest common divisor d. d | p p
irreducible d = 1 d = p. d p, d p, a
common divisor p = d | a: p - a . d = 1, Corollary 7.1.5
n, m Z 1 = n p + m a. b
b = (n b) p + m (a b) = (n b) p + m (r p) = (n b + m r) p,
p | b.
, p prime element p irreducible.
d | p, d = 1 d = p. d | p r Z p = d r,
p | d r. p prime , p | d p | r. p | d , d | p
d = p. p | r , s Z r = s p. p = d r = d (s p)
d s = 1. d, s Z, d s = 1 d = 1.
.
, .
Theorem 7.1.8. a N a > 1, p1 , . . . , pr , pi prime,
a = pn1 1 pnr r ,
ni N, i {1, . . . , r}.
123
. 2 a 1 .
a prime, , a prime, Proposition 7.1.7
a = a1 b1 a1 , b1 N 1 < a1 < a 1 < b1 < a. a1 b1
prime , a prime .
,
a = pn1 1 pnr r = q1m1 qsms ,
p1 , . . . , pr prime, q1 , . . . , qs prime. p1
prime, p1 | a = q1m1 qsms j {1, . . . , s} p1 | qj .
p1 | q1 . q1 prime, Proposition 7.1.7 q1 irreducible.
, q1 divisor 1 q1 . p1 | q1 p1 = q1 .
a
= pn1 1 1 pnr r = q1m1 1 qsms .
p1
a/p1 < a, r = s p1 = q1 , . . . , pr = qr
n1 = m1 , n2 = m2 , . . . , nr = mr , .
ai F i = 0, . . . , n
F [x]. F [x] :
f (x) = a0 + a1 x + an xn g(x) = b0 + b1 x + + bm xm F [x] ,
f (x) + g(x) = c0 + c1 x + + cr xr , i {1, . . . , r}, ci = ai + bi
r = max{m, n}. f (x) g(x) = d0 + d1 x + + dm+n xm+n ,
i {1, . . . , m + n},
di = a0 bi + a1 bi1 + + ai1 b1 + ai b0 .
, j > n aj = 0 k > m bk = 0.
: ;
.
F [x] commutative ring with 1,
. F [x] ring identity 0 0
7. Rings
124
, 0 ( 0 F 0) . identity 1
1 , 1 ( 1 F 1)
0. F [x] the ring of polynomials in x over F .
ring , zero divisor unit ?
polynomial ring ,
degree.
Definition 7.2.1. f (x) = a0 + a1 x + + an xn F [x] an 6= 0, f (x)
degree n deg(f (x)) = n.
0 , 0
0 , 0 degree 0. 0
degree ( deg(0) = ). degree .
Lemma 7.2.2. f (x) g(x) F [x] 0 ,
deg(f (x) g(x)) = deg(f (x)) + deg(g(x)).
Proof. deg(f (x)) = n deg(g(x)) = m f (x) = a0 + a1 x + + an xn
P
g(x) = b0 +b1 x+ +bm xm , an 6= 0 bm 6= 0. f (x)g(x) = ck xk ,
P
ck = i+j=k ai bj . k > n + m ck = 0. i n j m,
i + j n + m. k > n + m i + j = k, i > n j > m.
ai = 0 bj = 0. k > n + m ck = 0. k = n + m ,
i + j = k i = n j = m ai 6= 0 bj 6= 0.
cn+m = an bm . F field, F zero divisor, an 6= 0
bm 6= 0 cn+m 6= 0. deg(f (x) g(x)) = n + m.
125
polynomial ring .
Theorem 7.2.4 (Euclids Algorithm). F field, polynomials f (x),
g(x) F [x], g(x) 6= 0, h(x), r(x) F [x] f (x) = h(x) g(x) + r(x),
r(x) = 0 deg(r(x)) < deg(g(x)).
Proof. , r(x) 0, 0 degree,
deg(r(x)) < deg(g(x)), r(x) = 0 .
Theorem 7.1.1 W = {f (x) l(x) g(x) | l(x) F [x]}
. 0 W , h(x) F [x] f (x) h(x) g(x) = 0,
r(x) = 0. 0 6 W , r(x) W W degree polynomial.
deg(r(x)) = m deg(g(x)) = n, m < n. m n,
r(x) xm a, g(x) xn b.
b F b 6= 0, s(x) = r(x) ((a b1 )xmn ) g(x) . r(x)
((a b1 )xmn ) g(x) xm a, deg(s(x)) < m = deg(r(x)).
r(x) W l(x) F [x] r(x) = f (x) l(x) g(x).
s(x) = f (x)l(x)g(x)((ab1 )xmn )g(x) = f (x)(l(x)+(ab1 )xmn )g(x) W.
s(x) W r(x) degree polynomial, r(x) W
degree . m < n h(x) F [x]
r(x) = f (x) h(x) g(x) deg(r(x)) < deg(g(x). .
7. Rings
126
F [x] . ,
.
Definition 7.2.7. f (x), g(x) F [x].
(1) d(x) F [x] h(x) F [x] f (x) = h(x) d(x), d(x)
f (x) divisor, d(x) | f (x).
(2) l(x) F [x], l(x) | f (x) l(x) | g(x), l(x) f (x), g(x)
common divisor.
(3) d(x) F [x] f (x), g(x) common divisor degree polynomial, d(x) f (x), g(x) greatest common divisor.
greatest common divisor . greatest common
divisor common divisor degree 1 polynomial,
greatest common divisor .
greatest common divisor
, Theorem 7.2.6 greatest common divisor
.
d(x) = m(x) (r(x) l(x)) + n(x) (s(x) l(x)) = (m(x) r(x) + n(x) s(x)) l(x).
l(x) | d(x). d(x) f (x), g(x) common divisor degree
.
127
Corollary 7.2.9. f (x), g(x) F [x] d(x) f (x), g(x) greatest common
divisor, d(x) :
(1) m(x), n(x) F [x] d(x) = m(x) f (x) + n(x) g(x).
(2) l(x) | f (x) l(x) | g(x), l(x) | d(x).
ring , unit . Z
1 1 . F [x] units 0
(Proposition 7.2.3), divisor.
(irreducible element) .
Definition 7.2.10. F [x] p(x).
(1) d(x) | p(x) d(x) F [x], d(x) = c d(x) = c p(x),
0 6= c F , p(x) irreducible element.
(2) p(x) | f (x) g(x) f (x), g(x) F [x] p(x) | f (x)
p(x) | g(x), p(x) prime element.
irreducible element degree
polynomial . irreducible prime ,
F [x] polynomial .
Proposition 7.2.11. F [x] p(x) irreducible element, p(x)
prime element. , p(x) prime element, p(x) irreducible
element.
Proof. p(x) irreducible p(x) prime. p(x)
irreducible. p(x) | f (x) g(x) : p(x) | f (x) p(x) | g(x).
p(x) | f (x) g(x) r(x) F [x] f (x) g(x) = r(x) p(x). p(x) | f (x)
, p(x) - f (x) .
p(x), f (x) greatest common divisor d(x). d(x) | p(x) p(x)
irreducible d(x) = c d(x) = c p(x), 0 6= c F . d(x)
c p(x), d(x) p(x), f (x) common divisor p(x) = c1 d(x) | f (x)
( c F [x] unit). p(x) - f (x) . d(x) = c, Corollary
7.2.9 n(x), m(x) F [x] c = n(x) p(x) + m(x) f (x).
c1 g(x)
7. Rings
128
r(x) F [x] p(x) = r(x) d(x), p(x) | r(x) d(x). p(x) prime
, p(x) | d(x) p(x) | r(x). p(x) | d(x) , s(x) F [x]
d(x) = s(x) p(x). p(x) = r(x) d(x) d(x) = (s(x) r(x)) d(x).
d(x) (s(x) r(x) 1) = 0, F [x] zero divisor (Proposition 7.2.3)
d(x) 6= 0, s(x) r(x) = 1, s(x) unit. s(x)
c, d(x) = s(x) p(x) = c p(x). p(x) | r(x) , s(x) F [x]
r(x) = s(x) p(x). p(x) = d(x) r(x) = d(x) (s(x) p(x)) d(x) s(x) = 1.
d(x) F [x] unit, d(x) = c.
, Z F [x] .
F [x] Z .
unit , Z . F [x]
d(x) f (x) divisor, h(x) F [x] f (x) = d(x) h(x),
F [x] 0 c F [x] unit, c1 h(x) F [x].
f (x) = (c d(x)) (c1 h(x)) c d(x) f (x) divisor.
0 6= c F , d(x) c d(x) f (x) divisor.
c d(x) f (x) divisor.
c c d(x) 1, .
Definition 7.2.12. f (x) F [x] f (x) 1 f (x)
monic polynomial.
Lemma monic polynomial .
Lemma 7.2.13. p(x), q(x) F [x] monic irreducible element p(x) | q(x),
p(x) = q(x).
Proof. q(x) irreducible, q(x) divisor c c q(x)
. p(x) ( irreducible) p(x) | q(x) c F
p(x) = c q(x). p(x), q(x) monic polynomial,
1. c = 1, p(x) = q(x).
F [x] .
Theorem 7.2.14. f (x) F [x] deg(f (x)) 1, c F
p1 (x), . . . , pr (x), pi (x) monic irreducible elements,
f (x) = c p1 (x)n1 pr (x)nr ,
ni N, i {1, . . . , r}.
129
7. Rings
130
131
Lemma 7.3.2, .
Definition 7.3.3. f (x) Z[x] f (x) = c f (x), c N, f (x) Z[x]
f (x) 1. c f (x) content, c(f ).
f (x) Z[x] c(f ) = 1, f (x) primitive polynomial.
c(f ) f (x) . Lemma 7.3.2
f (x) Z[x] content primitive polynomial.
Lemma 7.3.2 Q[x] .
Proposition 7.3.4. f (x) Q[x] 0 polynomial, f (x)
f (x) = c f (x), c Q, c > 0 f (x) Z[x] primitive polynomial.
Proof. : f (x) = a0 + a1 x + + an xn , ai Q.
m m f (x) Z[x] ( m ai ).
m f (x) Z[x] Lemma 7.3.2 a f (x) Z[x]
7. Rings
132
133
7. Rings
134
135
7. Rings
136
Z[x] ,
ideal principle ideal , Proposition
7.3.12 irreducible element prime . , f (x)
f (x) , polynomial.
Theorem 7.3.13. f (x) Z[x] 0, 1, 1
polynomial, p1 (x), . . . , pr (x) Z[x], pi (x) Z[x]
irreducible elements,
f (x) = p1 (x)n1 pr (x)nr ,
ni N, i {1, . . . , r}.
137
7. Rings
138
p2 - a0 ,
0<r<n
h(x) = ds xs + + d1 x + d0 Z[x],
0 < s < n.
g(x) h(x) c0 d0 = a0 . p | a0 = c0 d0 , p | c0 p | d0 .
p2 - c0 d0 , c0 d0 p . c0 !
p | c0 p - d0 . g(x) h(x) c0 d1 + c1 d0 = a1 .
p | a1 p | c0 p | c1 d0 . p - d0 p | c1 .
p | cr . p | c0 , p | c1 , . . . , p | cr1 ,
p | cr . g(x) h(x) xr
c0 dr + c1 dr1 + + cr1 d1 + cr d0 = ar .
( s < r, ds+1 = = dr = 0) 0 < r < n p | ar ,
p | c0 , . . . , p | cr1 , p | cr d0 . p - d0 , p | cr .
g(x) h(x) ( f (x) xn )
cr ds = 1.
p | cr cr ds = 1. , f (x) Z[x]
irreducible element.
139
a d = c b.
relation , Q a/b
c/d, a, b, c, d Z b 6= 0, d 6= 0, a d = c b .
relation equivalence relation:
(equiv1): (a, b) S, D integral domain commutative, a b = b a. (a, b) (a, b).
(equiv2): (a, b) (c, d), (c, d) (a, b). (a, b) (c, d)
a d = c b . (c, d) (a, b)
c b = a d, , (c, d) (a, b).
(equiv3): (a, b) (c, d) (c, d) (e, f ), (a, b) (e, f ).
ad = cb
(7.1)
cf
(7.2)
= ed
(7.1) (7.2) a f = e b ?
(7.1) f , (a d) f = (c b) f = (c f ) b.
(7.2) (a d) f = (e d) b, d (a f e b) = 0. d 6= 0,
D zero divisor ( D integral domain), a f = e b.
, S equivalence relation, S
. (a, b) S, [a, b] S (a, b)
. Se S . Se [a, b]
, a, b D b 6= 0, (a, b) (c, d), Se [a, b] = [c, d].
e :
Se . [a, b] Se [c, d] S,
[a, b] + [c, d] = [a d + c b, b d]
. well-defined.
[a, b] + [c, d] [a, b] [c, d] Se , b d 6= 0.
b 6= 0 d 6= 0 D integral domain, b d 6= 0.
[a, b] = [a0 , b0 ] [c, d] = [c0 , d0 ], [a, b] + [c, d] = [a0 , b0 ] + [c0 , d0 ]
[a, b] [c, d] = [a0 , b0 ] [c0 , d0 ]. [a, b] + [c, d] = [a0 , b0 ] + [c0 , d0 ]
7. Rings
140
141
7. Rings
142
([a, b] [c, d]) = ([a c, b d]) = (a c) (b d)1 = ([a, b]) ([c, d]),
ring homomorphism.
, ker() = {[0, 1]}. [a, b] ker(),
([a, b]) = (a) (b)1 = 0. (b) (a) = 0.
, a ker() = {0}, a = 0. [a, b] = [0, 1].
.
e
, Se D quotient field, D S,
[a, 1] a. [a, b] Se a/b.
Chapter 8
Integral Domain
ring . ring
integral domain. ,
.
8.1. Divisor
integral domain irreducible
elements prime elements. .
.
Definition 8.1.1. R integral domain a, d R R 0
. r R a = d r, d a R divisor
d | a.
R integral domain d R, d = {d r | r R}
d | a a d . a d , d ideal
r R a r d . a d . a d , a a
a d . a d a d , :
Lemma 8.1.2. R integral domain a, d R \ {0} . d | a
a d .
Lemma 8.1.2 ,
ideal . divisor
, ideal ,
.
143
8. Integral Domain
144
a R a 6= 0, R unit a
divisor. u R unit, u = R (Lemma 6.2.4).
a R = u u | a. u unit , a u a divisor.
a u = a (Lemma 6.5.4) Lemma 8.1.2 . u a u a divisor
a , a trivial divisor. Lemma
a u a trivial divisor a .
Lemma 8.1.3. R integral domain a b R 0
. a b .
(1) u R R unit a = b u.
(2) a = b .
(3) a | b b | a.
Proof. (1) (2): Lemma 6.5.4 a = b .
(2) (3): Lemma 8.1.2 .
(3) (1): a | b r R b = a r, b | a r0 R
a = b r0 .
a = b r0 = (a r) r0 = a (r r0 ).
a (1 r r0 ) = a a (r r0 ) = 0.
a 6= 0 R integral domain, r r0 = 1. r0 R
unit.
, Lemma 8.1.3 .
Definition 8.1.4. a, b R \ {0} u R R unit a = b u,
a b associates. a b.
Lemma 8.1.3 (2) a b a = b ,
equivalence relation.
Z a, b greatest common divisor a, b common
divisor , F [x] f (x), g(x) greatest common divisor
f (x), g(x) common divisor degree . integral domain
degree . greatest common divisor
( Corollary 7.1.5 (2) Corollary 7.2.9 (2)),
integral domain greatest common divisor.
Definition 8.1.5. R integral domain, a1 , . . . , an R 0 .
(1) c R c | ai , i {1, . . . , n} c a1 , . . . , an common
divisor.
8.1. Divisor
145
8. Integral Domain
146
ideal . Lemma
irreducible element prime element principle ideal
.
Lemma 8.1.9. R integral domain, a R a 6= 0.
(1) a irreducible element nontrivial principle ideal
a .
(2) a prime element a prime ideal.
Proof. (1) : a irreducible element, b R a b ,
Lemma 8.1.2 b | a. a irreducible b unit b a.
b = R (Lemma 6.2.4) b = a (Lemma 6.5.4). nontrivial
principle ideal a .
: d | a, a d . nontrivial principle ideal
a , d trivial principle ideal a . d = R d = a .
d = R d = 1 Lemma 8.1.3 d 1, d unit.
d = a Lemma 8.1.3 d a. a irreducible element.
(2) : a prime element. c d a , a | c d. a
prime a | c a | d. c a d a , a
prime ideal.
147
: a prime ideal. c, d R a | c d, c d a .
a prime ideal c a d a . a | c a | d,
a prime element.
8. Integral Domain
148
d I, d I. a I, Euclidean domain
h, r R a = d h + r r = 0 (r) < (d). r 6= 0, r = a d h
a, d I r I. r I \ {0} (r) < (d). (d) T
, r = 0. a = d h, a d . I d .
149
Lemma 8.1.9 a prime element a
prime ideal. .
Proposition 8.3.3. R principle ideal domain, R irreducible
element prime element. , R prime element irreducible element.
Proof. R integral domain, Lemma 8.1.8 R prime element
irreducible element.
, a R irreducible element, Lemma 8.3.2 a R
maximal ideal. Corollary 6.5.13 R maximal ideal prime
ideal, a R prime ideal. Lemma 8.1.9 (2) a
prime element.
8. Integral Domain
150
I R ideal R principle ideal domain, a R a = I.
a a = I m N a Im . a a
ideal (Lemma 6.5.1) I = a Im . I = Im , i > m
Im Ii Ii I I = Im = Ii , i > m.
151
n1 m1
1
pm
pn2 2 pnr r um1 q2m2 qrmr ) = 0.
1 (p1
8. Integral Domain
152
, , R unique factorization
domain.
Theorem 8.3.6 principle ideal domain unique factorization domain. unique factorization domain principle ideal
domain. Z[x] unique factorization domain (Theorem 7.3.13)
2 + x ideal principle ideal (Example 7.3.1).
nr
1
b = v pm
1 pr ,
(8.1)
153
pi associates. c p1 , . . . , pr associates
irreducible divisor, c
c = w ps11 psrr ,
w unit si . i si > ni ,
s1 > n1 ! ps11 | c c | a ps11 | a.
ps11 n1 | pn2 2 pnr r .
s1 n1 1
p1 | pn2 2 pnr r .
p1 prime, p1 p2 , . . . , pr pi associates.
p1 , . . . , pr associates , si ni , i = 1, . . . , r. si mi ,
i = 1, . . . , r. i = 1, . . . , r si min{ni , mi } = ti .
c | d. d a, b greatest common divisor.
R[x] = {an xn + + a1 x + a0 | ai R}
R polynomials polynomial ring unique factorization
domain.
8. Integral Domain
154
155
f (x) = c f (x)
= c0 g(x)
c, c0 R, f (x), g(x) R[x] R[x] primitive polynomials, c c0
f (x) g(x).
Proof. : f (x) = an xn + + a1 x + a0 , c an , . . . , a1 , a0
greatest common divisor. i = 0, 1, . . . , n ai = c bi ,
bi R, b0 , . . . , bn greatest common divisor R unit. f (x) =
bn xn + + b1 x + b0 , f (x) R[x] primitive polynomial f (x) = c f (x).
.
: f (x) = c0 g(x), g(x) R[x] primitive polynomial.
g(x) = a0n xn + + a01 x + a00 , i = 0, 1, . . . , n, ai = c0 a0i .
c0 an , . . . , a0 common divisor. c an , . . . , a0 greatest
common divisor c0 | c. d R c = c0 d. ai = c bi = c0 a0i ,
i = 0, 1, . . . , n,
c0 (d bi ) = (c0 d) bi = c bi = c0 a0i .
c0 6= 0 R integral domain, i = 0, 1, . . . , n, a0i = d bi .
d a0n , . . . , a00 common divisor. a0n , . . . , a00 greatest
common divisor unit, d R unit. c c0 .
f (x) = c f (x) = c0 g(x), R[x] integral domain, d f (x) = g(x).
d R unit R[x] unit, f (x) g(x).
Lemma 8.4.5 , .
Definition 8.4.6. R unique factorization domain. f (x) R[x]
f (x) = c f (x) c R f (x) R[x] primitive polynomial, c
f (x) content, c(f ).
Lemma 8.4.5 f (x) content f (x)
greatest common divisor. f (x) content
, content associates.
content F [x]. F R quotient field,
F a/b , a, b R b 6= 0.
f (x) = rn xn + + r1 x + r0 F [x], i = 0, 1, . . . , n, ri = ai /bi ,
8. Integral Domain
156
ai , bi R, d R d 6= 0 d f (x) R[x] (
d = bn b0 ). Lemma 8.4.5 c R f (x) R[x] R[x]
primitive polynomial d f (x) = c f (x). d 6= 0, f (x)
c
f (x) = f (x).
d
F [x] 0 polynomial f (x) f (x) = r f (x),
r F f (x) R[x] R[x] primitive polynomial. r f (x)
content c(f ).
Corollary 8.4.7. R unique factorization domain, F R quotient
field. f (x) F [x] f (x) 6= 0, c F f (x) R[x] R[x]
primitive polynomial
f (x) = c f (x).
f (x) = c f (x)
= c0 g(x)
c, c0 F , f (x), g(x) R[x] R[x] primitive polynomials, u R
R unit c = u c0 u f (x) = g(x).
Proof. , . c c0 c = a/b
c0 = a0 /b0 , a, a0 , b, b0 R b 6= 0, b0 6= 0. f (x) b b0 ,
(b b0 ) f (x) R[x]
(b b0 ) f (x) = (a b0 ) f (x)
= (a0 b) g(x).
(b b0 ) f (x) R[x] Lemma 8.4.5 (b b0 ) f (x) ,
u R R unit a b0 = u (a0 b). c = u c0 . c0 6= 0
F [x] integral domain u f (x) = g(x).
157
8. Integral Domain
158
159
8. Integral Domain
160
ms
1
= (bm
1 bs ) q1
ms+w
(x) qw
(x),
161
ms
1
an1 1 anr r = u bm
1 bs ,
= q1
ms+w
(x) qw
(x)
162
8. Integral Domain
Part III
FIELD
Chapter 9
Field
field . field
, .
9.1. Field
field .
field commutative ring with 1 0
unit. F field, F + Definition 5.1.1 (R1)
(R8) , :
a, b F a b = b a.
1 F a F a 1 = 1 a = a.
a F a 6= 0, a1 F a a1 = a1 a = 1.
F commutative ring with 1; F 0
unit.
field .
Lemma 9.1.1. F field, F integral domain.
Proof. field F commutative ring with 1,
F zero-divisor . Lemma 5.3.7 ,
.
a F F zero-divisor, a 6= 0 b 6= 0 a b = 0.
b 6= 0 b F unit, b1 F b b1 = 1.
0 = (a b) b1 = a (b b1 ) = a 1 = a.
a 6= 0 , a F zero-divisor.
165
9. Field
166
Example 9.1.3.
Z/5Z = {0, 1, 2, 3, 4}
ring. 5 Z irreducible element Z principle ideal domain
Lemma 8.3.2 5Z = 5 Z maximal ideal. Z/5Z field
(Theorem 6.5.11).
(Z/5Z) = {1, 2, 3, 4}
abelian group.
2
2 = 4,
2 = 3,
2 = 1,
167
(2) homomorphism.
Proof. (1) (1F ) F 0 identity. trivial,
a F (a) 6= 0. (a) = (a 1F ), ring homomorphism
(a) = (a) (1F ). F 0 (a) 1F 0 = (a),
(a) (1F ) = (a) 1F 0 ,
(a) (1F ) 1F 0 = 0.
F 0 integral domain (Lemma 9.1.1) (a) 6= 0, (1F ) = 1F 0 .
(2) ker() = 0 (Lemma 6.3.4).
ker() F ideal (Lemma 6.3.3) F F 0 trivial
ideals (Lemma 6.2.4) ker() = F ker() = 0 . ker() = F ,
a F (a) = 0, trivial ring homomorphism
. ker() = 0 , ring homomorphism.
(9.1)
1 n n, 1 F 1
N 1. 1 Z/5Z 1,
1 + 1 + 1 + 1 + 1 = 0,
N 5 0 . (9.1)
+ a} = n a.
|a + {z
n
, a F n N na a n ,
a
+ a} = na.
| + {z
n
. (9.1)
na = |a + {z
+ a} = (1
+ 1}) a = (n1) a.
| + {z
n
9. Field
168
(n) = |1 + {z
+ 1}
169
p1F 0 = 0.
char(F 0 ) 6= 0. char(F 0 ) = q 6= p, p q ,
m, n Z mp + nq = 1. p1F 0 = q1F 0 = 0
1F 0 = (mp + nq)1F 0 = 0,
. char(F ) = char(F 0 ).
char(F ) = 0, n N n1F 6= 0. Proposition 9.1.5
(2) (n1F ) 6= 0.
(n1F ) = n(1F ) = n1F 0 6= 0,
char(F 0 ) = 0.
char(F ) = p 6= 0 , .
Lemma 9.2.5. F field char(F ) = p 6= 0, a, b F ,
(a + b)p = ap + bp
and
(a b)p = ap bp ,
n N.
9. Field
170
n
p i = 1, . . . , p 1 , pi p , pi (ai bpi ) = 0.
(a + b)p = ap + bp .
(9.2)
n1
n1
(a + b)p
= ap
n1
+ bp
(9.3)
(9.2) (9.3)
n
n1 p
n1
n1
n
n
(a + b)p = (a + b)p
= (ap
+ bp )p = ap + bp .
n
(a b)p = ap bp . char(F ) = 2 , F
+ = 2 = 0, = . p = 2
n
(a b)p = (a + b)p = ap + bp = ap bp .
n
pn
n
n
n
n
n
(a b)p = a + (b)
= ap + (b)p = ap bp .
p
p
p
Lemma 9.2.5 :
Lemma 9.2.6. F field char(F ) = p 6= 0, f (x) =
am xm + + a0 F [x],
n
n N.
a F ,
n
(x a)p = xp ap ,
n N.
9.3.
171
9.3.
,
field .
9.3.1. . vector space, basis
dimension. ,
.
Definition 9.3.1. F field. V vector space over F ,
V + , c F , v V c v V , :
(VS1): V abelian group.
(VS2): c F v1 , v2 V c (v1 + v2 ) = c v1 + c v2 .
(VS3): c1 , c2 F v V (c1 + c2 ) v = c1 v + c2 v
c1 (c2 v) = (c1 c2 ) v.
(VS4): v V 1 v = v, 1 F F identity.
vector space F V , V
. field vector space
F V V . field
vector space .
Definition 9.3.2. F field V vector space over F ,
v1 , . . . , vn V v F c1 , . . . , cn F
v = c1 v1 + + cn vn ,
v1 , . . . , vn span V over F .
vector space v1 , . . . , vn V span V over F , V
finite dimensional vector space over F .
v1 , . . . , vn span V over F , w1 , . . . , wm V span
V over F . v1 , . . . , vn span V over F .
v1 , . . . , vn , vi
vj , span V . .
Definition 9.3.3. F field V vector space over F ,
V v1 , . . . , vn V 0 c1 , . . . , cn F
c1 v1 + + cn vn = 0,
v1 , . . . , vn linearly independent over F .
v1 , . . . , vn F span V linearly independent over F , v1 , . . . , vn
basis of V over F .
9. Field
172
9.3.
173
r(x) = 0 deg(r(x)) < deg(f (x)). g(x) r(x) = f (x) h(x) f (x) ,
quotient ring g(x) = r(x).
c0 = c1 = = cn1 = 0
r(x) = 0, g(x) = 0,
9. Field
174
1F , 1R F R identity, 1F = 1R .
(VS4) a R 1F a = a. 1F = 1R ,
. subring identity ring
identity. R integral domain, .
F 0 c, F , 1F c = c;
R , 1R c = c. : (1F 1R ) c = 0.
R integral domain c 6= 0, 1F = 1R .
R over F vector space, R finite dimensional over
F .
Theorem 9.3.7. R integral domain, F field F R.
R vector space over F finite dimensional over F ,
(1) a R, 0 f (x) F [x] f (a) = 0.
(2) R field.
Proof. dimF (R) = n.
(1) 1, a, a2 , . . . , an n+1 R . linearly independent
over F , Lemma 9.3.4 (2)
n = dimF (R) n + 1,
, 1, a, a2 , . . . , an linearly independent over F .
0 c0 , c1 , . . . , cn F ,
c0 1 + c1 a + + cn an = 0.
f (x) = c0 + c1 x + + cn xn , f (x) 6= 0 f (a) = 0.
(2) R integral domain, R field, R
0 unit. a R a 6= 0, b R
a b = 1. (1) 0 f (x) f (a) = 0.
f (x) = c0 + c1 x + + cm xm F [x]
F [x] 0 f (a) = 0 degree polynomial. degree
, c0 6= 0. c0 = 0,
f (a) = c1 a + + cm am = (c1 + c2 a + + cm am1 ) a = 0
R integral domain g(a) = 0, g(x) = c1 + c2 x + + cm xm1 F [x]
0 deg(g(x)) < deg(f (x)). f (x) degree ,
c0 6= 0. f (a) = 0 c0 ,
(c1 + c2 a + + cm am1 ) a = c0 .
175
9. Field
176
i = 1, . . . , m j = 1, . . . , n
L over F basis. . K L
ai K, bj L ai bj L. ai bj span L over F
linearly independent over F .
{ai bj } span L over F : L, ci,j F
=
m
n X
X
j=1 i=1
ci,j (ai bj ).
177
b1 , . . . , bn span L over K, d1 , . . . , dn K
= d1 b1 + + dn bn .
(9.4)
9. Field
178
Chapter 10
Field
(10.1)
180
10. Field
181
10. Field
182
and
[F (a) : F ] = deg(p(x)).
183
ci F.
a1 = cn an + + c1 a + c0
1 = cn an+1 + + c1 a2 + c0 a.
g(x) = cn xn+1 + + c1 x2 + c0 x 1,
g(a) = 0. g(x) F [x] g(x) 6= 0, a algebraic over F .
10. Field
184
F L algebraic closure.
F algebraic over F , F LF L. L
F finite extension, Lemma 9.4.5 L algebraic over F ,
LF = L.
LF , LF field. ,
a, b LF , b 6= 0, a b a b1 LF (Lemma 9.1.4).
algebraic over F ? polynomial ,
Theorem 10.1.9. Definition 10.1.6.
Definition 10.2.2. F field L F extension. a1 , . . . , an
L, F (a1 , . . . , an ) L F a1 , . . . , an field.
Lemma 10.2.3. F field L F extension. a1 , . . . , an L
algebraic over F , F (a1 , . . . , an ) F finite extension. ,
a1 , . . . , an over F degree m1 , . . . , mn ,
[F (a1 , . . . , an ) : F ] m1 mn .
Proof. ,
K1 = F (a1 ), K2 = K1 (a2 ) = F (a1 , a2 ), . . . , Kn = Kn1 (an ) = F (a1 , . . . , an ).
i, [Ki : Ki1 ] = [Ki1 (ai ) : Ki ] mi . [Ki1 (ai ) : Ki1 ]
mi : Corollary 10.1.7 [Ki1 (ai ) : Ki1 ]
ai over Ki1 minimal polynomial qi (x) Ki1 [x] degree.
185
Lemma 10.2.5 . K F
algebraic extension K algebraic over F . Lemma 10.2.5
K F finite extension, F algebraic extension.
Lemma 10.2.5 K F algebraic extension .
Theorem 10.2.6. F field, L F extension, K L over
F subextension. K F algebraic extension, LF = LK
10. Field
186
L algebraic over LF LF .
Corollary 10.2.7. F field L F extension, a L
a algebraic over LF , a algebraic over F . ,
LLF = LF .
Proof. LF algebraic over F , LF F
algebraic extension. K = LF , K Theorem 10.2.6 ,
LK = LF . a L algebraic over LF = K, a LK . LK = LF
a LF , a algebraic over F .
187
a f (x) , a f (x)
0. , a f (x) a f (x)
. a F a field L ( ring) ,
a f (x) L . f (a) (
L ) . F extension
L, a L F [x] polynomials . :
f (x) F [x] F extension L f (x) L
? . . F
extension field .
10. Field
188
, .
, .
Theorem 10.3.4. F field p(x) F [x] F [x] irreducible
element, field L F finite extension, [L : F ] = deg(p(x))
L a L p(a) = 0.
( L )
= an x n + + a1 x + a0
= p(x) = 0
L p(x) L 0.
Theorem 10.3.4 .
189
10. Field
190
pk
, finite field .
F finite field, F field, Corollary 9.1.2 F = F \ {0}
abelian group. F , F
finite abelian group. F finite group, Lagranges Theorem
.
k
identity). a ap = a, f (a) = 0. a = 0
f (a) = 0, a F f (a) = 0. Theorem 10.3.3
191
, 2 , . . . , q1 , , 2 , . . . , q1
10. Field
192
q = q = (e1 , e2 , . . . , er )
Cn1 Cnr 2q 1 . aq = e1 bq = e2 , 2q 1
i j
(i )q = ( j )q = (e1 , e2 , . . . , er ).
(10.2)
F cyclic a F F ai ,
.
Corollary 10.4.4. F finite field |F | = pk , a F
Fp (a) = F a over Fp degree k.
Proof. a F F F cyclic group. Fp (a) F
a Fp filed, Fp (a) F . b F , b = 0,
b Fp (a); b 6= 0, b F , i N b = ai . Fp (a)
field, b = ai Fp (a). F Fp (a), F = Fp (a).
|F | = pk , Theorem 10.4.1 [Fp (a) : Fp ] = [F : Fp ] = k.
Corollary 10.1.7 a over Fp minimal polynomial degree k,
a over Fp degree k.
finite field , p k N,
finite field F pk . k = 1 Z/ p
p finite filed, filed Fp . Theorem 10.4.1
pk finite filed F , F Fp extension.
k
F = {a L | ap = a},
193
F L xp x .
F filed. Lemma 9.1.4, a, b F
b 6= 0 a b F a/b F . a b a/b L ,
Lemma 9.2.5
k
(a b)p = ap bp
k
and
(a/b)p = ap /bp ,
xp x , a L xp x , Lemma 10.3.1
k
h(x) L[x] xp x = (x a) h(x). h(a) 6= 0, a .
k
k
k
k
Lemma 9.2.6, (x a)p (x a) = xp ap x + a. ap = a
k
( a xp x ),
k
xp x = (x a)p (x a) = (x a) h(x),
k
10. Field
194
195
field , .
Galois Theory, . field
, Galois Theory.