Algebra I (Math 200) UCSC, Fall 2009 Robert Boltje Contents 1 Semigroups and Monoids 1 2 Groups 4 3 Normal Subgroups and Factor Groups 11 4 Normal and Subnormal Series 17 5 Group Actions 22 6 Symmetric and Alternating Groups 29 7 Direct and Semidirect Products 33 8 Free Groups and Presentations 35 9 Rings, Basic Definitions and Properties 40 10 Homomorphisms, Ideals and Factor Rings 45 11 Divisibility in Integral Domains 55 12 Unique Factorization Domains (UFD), Principal Ideal Do- mains (PID) and Euclidean Domains 60 13 Localization 65 14 Polynomial Rings 69 Chapter I: Groups 1 Semigroups and Monoids 1.1 Definition Let S be a set. (a) A binary operation on S is a map b : S × S ! S. Usually, b(x; y) is abbreviated by xy, x · y, x ∗ y, x • y, x ◦ y, x + y, etc. (b) Let (x; y) 7! x ∗ y be a binary operation on S. (i) ∗ is called associative, if (x ∗ y) ∗ z = x ∗ (y ∗ z) for all x; y; z 2 S. (ii) ∗ is called commutative, if x ∗ y = y ∗ x for all x; y 2 S. (iii) An element e 2 S is called a left (resp. right) identity, if e ∗ x = x (resp. x ∗ e = x) for all x 2 S. It is called an identity element if it is a left and right identity. (c) S together with a binary operation ∗ is called a semigroup, if ∗ is as- sociative. A semigroup (S; ∗) is called a monoid if it has an identity element. 1.2 Examples (a) Addition (resp. multiplication) on N0 = f0; 1; 2;:::g is a binary operation which is associative and commutative. The element 0 (resp. 1) is an identity element. Hence (N0; +) and (N0; ·) are commutative monoids. N := f1; 2;:::g together with addition is a commutative semigroup, but not a monoid. (N; ·) is a commutative monoid. (b) Let X be a set and denote by P(X) the set of its subsets (its power set). Then, (P(X); [) and (P(X); \) are commutative monoids with respective identities ; and X. (c) x∗y := (x+y)=2 defines a binary operation on Q which is commutative but not associative. (Verify!) (d) Let X be a set. Then, composition (f; g) 7! f ◦g is a binary operation on the set F (X; X) of all functions X ! X.(F (X; X); ◦) is a monoid with the identity map idX : X ! X, x 7! x, as identity element. In general it is not commutative. (Verify!) 1.3 Remark Sometimes a binary operation ∗ is given by a table of the form ∗ ··· y ··· . x ··· x ∗ y . 1 For instance, the binary operation \and" on the set ftrue; falseg can be de- picted as ^ true false true true false false false false 1.4 Remark Let (S; ∗) be a semigroup and let x1; : : : ; xn 2 S. One defines x1 ∗ x2 ∗ · · · ∗ xn := x1 ∗ (x2 ∗ (· · · ∗ xn) ··· ). Note that this element equals the element that one obtains by any other choice of setting the parentheses. This can be proved by induction on n using the associativity of ∗. We omit the proof. 1.5 Proposition Let S be a set with a binary operation ∗. If e 2 S is a left identity and f 2 S is a right identity, then e = f. In particular, there exists at most one identity element in S. Proof Since e is a left identity, we have e ∗ f = f. But since f is a right identity, we also have e ∗ f = e. Thus, e = e ∗ f = f. 1.6 Remark Identity elements are usually denoted by 1 (resp. 0), if the binary operation is denoted by ∗, ·, •, ◦ (resp. +). 1.7 Definition Let (M; ∗) be a monoid and let x 2 M. An element y 2 M is called a left (resp. right) inverse of x if y ∗ x = 1 (resp. x ∗ y = 1). If y is a left and right inverse of x, then y is called an inverse of x. If x has an inverse, we call x an invertible element of M. 1.8 Proposition Let (M; ∗) be a monoid and let x 2 M. If y 2 M is a left inverse of x and z 2 M is a right inverse of x, then y = z. In particular, every element of M has at most one inverse. Proof We have y = y ∗ 1 = y ∗ (x ∗ z) = (y ∗ x) ∗ z = 1 ∗ z = z. 1.9 Remark If x is an invertible element in a monoid, then we denote its (unique) inverse by x−1 (resp. −x), if the binary operation is denoted by ∗, ·, •, ◦ (resp. +). 2 1.10 Example Let ! n a b o M := a; b; c 2 : 0 c Z M is a non-commutative monoid under matrix multiplication. The element a b! has an inverse if and only if a; c 2 {±1g. In this case, one has 0 c −1 a b! a −abc! = : 0 c 0 c (Verify!) 1.11 Proposition Let (M; ∗) be a monoid and let x; y 2 M. (a) If x is invertible, then also x−1 is invertible with (x−1)−1 = x. (b) If x and y are invertible, then also x ∗ y is invertible with inverse y−1 ∗ x−1. (c) The identity element 1 is invertible with 1−1 = 1. Proof (a) Since x ∗ x−1 = 1 = x−1 ∗ x, the element x is a left and right inverse of x−1. (b) We have (x∗y)∗(y−1 ∗x−1) = ((x∗y)∗y−1)∗x−1 = (x∗(y∗y−1))∗x−1 = (x ∗ 1) ∗ x−1 = x ∗ x−1 = 1, and similarly, we have (y−1 ∗ x−1) ∗ (x ∗ y) = 1. This implies that y−1 ∗ x−1 is a left and right inverse of x ∗ y. (c) This follows from the equation 1 ∗ 1 = 1. 1.12 Definition In a semigroup S we set xn := x ∗ · · · ∗ x (n factors) for any x 2 S and n 2 N. If S is a monoid we also define x0 := 1 for all x 2 S. If additionally x is invertible, we define x−n := x−1 ∗ · · · ∗ x−1 (n factors) for any n 2 N. 1.13 Remark For an element x in a monoid we have the usual rules: xm ∗ xn = xm+n and (xm)n = xmn ; for all m; n 2 N. If x is invertible, these rules hold for all m; n 2 Z. This can be proved by distinguishing the cases that m; n are positive, negative or equal to 0. Moreover, if x and y are elements in a commutative monoid then n n n (x ∗ y) = x ∗ y for all n 2 Z. 3 2 Groups From now on through the rest of this chapter we will usually write abstract binary operations in the form (x; y) 7! xy. 2.1 Definition A group G is a monoid in which every element is invertible. A group is called abelian if it is commutative. The order of G is the number of elements of G. It is denoted by jGj. 2.2 Remark If G is a semigroup with a left (resp. right) identity e in which every element has a left (resp. right) inverse with respect to e, then G is a group. (cf. Homework.) 2.3 Examples (a) (Z; +), (Q; +), (R; +), (C; +) are abelian groups, but (N0; +) is not. (b) (Qrf0g; ·), (Rrf0g; ·), (Crf0g; ·) are abelian groups, but (Zrf0g; ·) and (Q; ·) are not. (c) (f1g; ·) and (f0g; +) are groups of order 1. A group of order 1 is called a trivial group. (d) For any set X, the set Sym(X) := ff : X ! X j f is bijectiveg is a group under composition. It is called the symmetric group on X. Its elements are called permutations of X. If jXj = n, then jSym(X)j = n!. We write Sym(n) instead of Sym(f1; 2; : : : ; ng) and call Sym(n) the symmetric group of degree n. We use the following notation for π 2 Sym(n): 1 2 ··· n ! 1 2 3! π = ; e:g:; π = 2 Sym(3) : π(1) π(2) ··· π(n) 2 1 3 (e) If G1;G2;:::;Gn are groups, then also their direct product G1 × G2 × · · · × Gn is a group under (x1; : : : ; xn)(y1; : : : ; yn) = (x1y1; : : : ; xnyn) : (f) For every n 2 N, the sets GLn(Q), GLn(R), GLn(C) of invertible ma- trices with entries in Q, R, C, respectively, form groups under multiplication. 2.4 Definition Let G and H be groups. A map f : G ! H is called a homomorphism, if f(xy) = f(x)f(y) for all x; y 2 G. The set of all ho- momorphisms from G to H is denoted by Hom(G; H). A homomorphism f : G ! H is called 4 (a) a monomorphism if f is injective, (b) an epimorphism if f is surjective, (c) an isomorphism if f is bijective, (d) an endomorphism if G = H, (e) an automorphism if G = H and f is bijective. 2.5 Remark Let f : G ! H be a homomorphism between groups G and −1 −1 H. Then f(1G) = 1H and f(x ) = f(x) for all x 2 G. Moreover, if also g : H ! K is a homomorphism between H and a group K, then g◦f : G ! K is a homomorphism. If f : G ! H is an isomorphism, then also its inverse f −1 : H ! G is an isomorphism. The automorphisms f : G ! G form again a group under composition, called the automorphism group of G and denoted by Aut(G).