Algebra Notes
Total Page:16
File Type:pdf, Size:1020Kb
Algebra Notes Ralph Freese and William DeMeo March 10, 2015 Contents I Fall 2010: Universal Algebra & Group Theory 4 1 Universal Algebra 5 1.1 Basic concepts . .5 1.2 Subalgebras and Homomorphisms . .5 1.3 Direct Products . .6 1.4 Relations . .7 1.5 Congruence Relations . .8 1.6 Quotient Algebras . .9 1.7 Direct Products of Algebras . .9 1.8 Lattices . 10 II Rings, Modules and Linear Algebra 12 2 Rings 13 2.1 The ring Mn(R)...................................... 13 2.2 Factorization in Rings . 15 2.3 Rings of Frations . 17 2.4 Euclidean Domain and the Eucidean Algorithm . 17 2.5 Polynomial Rings, Gauss' Lemma . 17 2.6 Irreducibility Tests . 20 3 Modules 21 3.1 Basics . 21 3.2 Finitely Generated Modules over a PID . 23 3.3 Tensor Products . 34 3.3.1 Algebraic Integers . 36 3.4 Projective, Injective and Flat Modules; Exact Sequences . 37 1 CONTENTS CONTENTS III Fields 41 4 Basics 42 A Prerequisites 43 A.1 Relations . 43 A.2 Functions . 43 2 CONTENTS CONTENTS Primary Textbook: Jacobson, Basic Algebra [4]. Supplementary Textbooks: Hungerford, Algebra [3]; Dummitt and Foote. Abstract Algebra [1]; Primary Subject: Classical algebra systems: groups, rings, fields, modules (including vector spaces). Also a little universal algebra and lattice theory. List of Notation • AA, the set of maps from a set A into itself. • Aut(A), the group of automorphisms of an algebra A. • End(A), the set of endomorphisms an algebra A. • Hom(A; B), the set of homomorphism from an algebra A into an algebra B. • Con(A), the set of congruence relations of an algebra A. • ConA, the lattice of congruence relations of an algebra A. • Eq(A), the set of equivalence relations of a set A. • EqA, the lattice of equivalence relations of a set A. • Sub(A), the set of subalgebras of an algebra A. • SubA, the lattice of subalgebras of an algebra A. • SgA(X), the subuniverse generated by a set X ⊆ A. • N = f1; 2;::: g, the set of natural numbers. • Z = f:::; −1; 0; 1;::: g, the ring of integers. • R = (−∞; 1), the real number field. • C, the complex number field. • Q, the rational number field. 3 Part I Fall 2010: Universal Algebra & Group Theory 4 1 UNIVERSAL ALGEBRA 1 Universal Algebra 1.1 Basic concepts A (universal) algebra is a pair A = hA; F i (1.1) where A is a nonempty set and F = ffi : i 2 Ig is a set of finitary operations on A; that is, n fi : A ! A for some n 2 N. A common shorthand notation for (1.1) is hA; fiii2I . The number n is called the arity of the operation fi. Thus, the arity of an operation is the number of operands upon which it acts, and we say that f 2 F is an n-ary operation on A if f maps An into A. An operation is called nullary (or constant) if its arity is zero. Unary, binary, and ternary operations have arities 1, 2, and 3, respectively. Example 1.1. If A = R and f : R × R ! R is the map f(a; b) = a + b, then hA; fi is an algebra with a single binary operation. Many more examples will be given below. An algebra A is called unary if all of its operations are unary. An algebra A is finite if jAj is finite and trivial if jAj = 1. Given two algebras A and B, we say that B is a reduct of A if both algebras have the same universe and A (resp. B) can be obtained from B (resp. A) by adding (resp. removing) operations. A better approach: An operation symbol f is an object that has an associated arity, which we'll denote arity(f). A set of operation symbols F is called a similarity type. An algebra of similarity type F is a pair A = hA; F Ai, where F A = ff A : f 2 F g and f A is an operation on A of arity arity(f). Example 1.2. Consider the set of integers Z with operation sysbols F = f+; ·; −; 0; 1g, which have respective arities f2; 2; 1; 0; 0g. The operation +Z is the usual binary addition, while −Z is negation: a 7! −a. The constants 0Z and 1Z are nullary operations. Of course we usually just write + for +Z, etc. 1.2 Subalgebras and Homomorphisms Suppose A = hA; F Ai is an algebra. We call the nonempty set A the universe of A. If a subset B ⊆ A is closed under all operations in F A, we call B a subuniverse of A. By closed under all A operations we mean the following: for each f 2 F (say f is n-ary), we have f(b0; : : : ; bn−1) 2 B, for all b0; : : : ; bn−1 2 B. A 1 B A If B 6= ; is a subuniverse of hA; F i, and if we let F = ff B : f 2 F g, then the algebra B B = hB; F i is called a subalgebra of A. If B is a subalgebra of A, we denote this fact by B 6 A. Similarly, we write B 6 A if B is a subuniverse of A. We denote the set of all subalgebras of A by Sub(A). Note that universe of an algebra is not allowed to be empty. However, the empty set can be a subuniverse (if A has no nullary operations).. T Theorem 1.3. If Ai 6 A, i 2 I, then Ai is a subuniverse. 1 Here f B denotes restriction of the function f to the set B (see Appendix Sec. A.2). 5 1.3 Direct Products 1 UNIVERSAL ALGEBRA If S is a nonempty subset of A, the subuniverse generated by S, denoted SgA(S) or hSi is the smallest subuniverse of A containing the set S. When hSi = A, we say that S generates A. T Theorem 1.4. If S ⊆ A, then SgA(S) = hSi = fB 6 A : S ⊆ Bg. Define fSig recursively as follows: S0 = S; Si+1 = ff(a1; : : : ; ak): f is a k-ary basic operation of A and ai 2 Sig: S1 Theorem 1.5. SgA(S) = hSi = i=0 Si. A B Let A = hA; F i and B = hB; F i be algebras of the same type F , and let Fn denote the set of n-ary operation symbols in F . Consider a mapping ' : A ! B and operation symbol f 2 Fn, and suppose that for all a0; : : : an−1 2 A the following equation holds: A B '(f (a0; : : : ; an−1)) = f ('(a0);:::;'(an−1)): Then ' is said to respect the interpretation of f. If ' respects the interpretation of every f 2 F , then we call ' a homomorphism from A into B, and we write ' 2 Hom(A; B), or simply, ' : A ! B. 1.3 Direct Products 2 The direct product of two sets A0 and A1, denoted A0 ×A1, is the set of all ordered pairs ha0; a1i such that a0 2 A0 and a1 2 A1. That is, we define A0 × A1 := fha0; a1i : a0 2 A0; a1 2 A1g: th More generally, A0 × · · · × An−1 is the set of all sequences of length n with i element in Ai. That is, A0 × · · · × An−1 := fha0; : : : ; an−1i : a0 2 A0; : : : ; an−1 2 An−1g: Equivalently, A0 × · · · × An−1 it is the set of all functions with domain f0; 1; : : : ; n − 1g and range n−1 S Ai. More generally still, let fAi : i 2 Ig be an indexed family of sets. Then the direct product i=1 of the A is i Y [ Ai := ff j f : I ! Ai with f(i) 2 Aig: i2I i2I 2 n When A0 = A1 = ··· = A, we often use the shorthand notation A := A × A and A := A × · · · × A (n terms). Q 3 Question: How do you know Ai 6= ;, even supposing I 6= ; and Ai 6= ; for all i 2 I. i2I 2For the definition of ordered pair, consult the appendix. 3 Answer: Each f \chooses" an element from each Ai, but when the Ai are all different and I is infinite, we may not be able to do this. The Axiom of Choice (AC) says you can. G¨odelproved that the AC is consistent with the other axioms of set theory. Cohen proved that the negation of the AC is also consistent. 6 1.4 Relations 1 UNIVERSAL ALGEBRA 1.4 Relations A k-ary relation R on a set A is a subset of the cartesian product Ak. Example 1.6. 2 (a) A = R (the line) and R = fa 2 R : a is rationalg. 2 2 2 2 (b) A = R (the plane) and R = f(a; b; c) 2 R × R × R : a, b, c lie on a lineg; i.e. tripples of points which are colinear. 2 2 2 2 2 2 2 (c) A = R and R = f(a; b) 2 R × R : a = (a1; a2); b = (b1; b2); a1 + a2 = b1 + b2g: This is an equivalence relation. The equivalence classes are circles centered at (0; 0). 2 2 2 (d) A = R and R = \6 on each component" = f(a; b) 2 R × R : a1 6 b1; a2 6 b2g. The relation in the last example above is a partial order; that is, 6 satisfies, for all a; b; c, 1. a 6 a (reflexive) 2. a 6 b; b 6 a ) a = b (anti-symmetric) 3. a 6 b; b 6 c ) a 6 c (transitive) A relation R on a set A is an equivalence relation if it satisfies, for all a; b; c, 1.