Abstract Algebra
Table of Contents
Rings ................................................................................................................................................... 3 Rings ............................................................................................................................................... 3 Subrings and Ideals ......................................................................................................................... 4 Homomorphisms .............................................................................................................................. 4 Fraction Fields ................................................................................................................................. 5 Integers ............................................................................................................................................ 5 Factoring ............................................................................................................................................. 7 Factoring .......................................................................................................................................... 7 UFDs, PIDs, and Euclidean Domains .............................................................................................. 7 Algebraic Integers ............................................................................................................................ 8 Quadratic Rings ............................................................................................................................... 8 Gaussian Integers ............................................................................................................................ 9 Factoring Ideals ............................................................................................................................... 9 Ideal Classes ................................................................................................................................. 10 Real Quadratic Rings ..................................................................................................................... 11 Polynomials ....................................................................................................................................... 12 Polynomials ................................................................................................................................... 12 [] ............................................................................................................................................... 12 Irreducible Polynomials .................................................................................................................. 13 Cyclotomic Polynomials ................................................................................................................. 14 Varieties ......................................................................................................................................... 14 Nullstellensatz................................................................................................................................ 15 Fields................................................................................................................................................. 17 Fundamental Theorem of Algebra .................................................................................................. 17 Algebraic Elements ........................................................................................................................ 17 Degree of a Field Extension ........................................................................................................... 17 Finite Fields ................................................................................................................................... 19 Modules ............................................................................................................................................. 21 Modules ......................................................................................................................................... 21 Structure Theorem ......................................................................................................................... 22 Noetherian and Artinian Rings ....................................................................................................... 23 Application 1: Abelian Groups ........................................................................................................ 23 Application 2: Linear Operators ...................................................................................................... 24 Polynomial Rings in Several Variables ........................................................................................... 25 Tensor Products ............................................................................................................................ 25 Galois Theory .................................................................................................................................... 27 Symmetric Polynomials .................................................................................................................. 27 Discriminant ................................................................................................................................... 27 Galois Group .................................................................................................................................. 27 Fixed Fields ................................................................................................................................... 28 Galois Extensions and Splitting Fields ........................................................................................... 28 Fundamental Theorem ................................................................................................................... 29 Roots of Unity ................................................................................................................................ 29 Cubic Equations ............................................................................................................................. 30 Quartic Equations .......................................................................................................................... 30 Quintic Equations and the Impossibility Theorem ........................................................................... 31
Transcendence Theory .................................................................................................................. 32 Algebras ............................................................................................................................................ 33 Division Algebras ........................................................................................................................... 33 References ........................................................................................................................................ 34
1
11
Rings
Rings
A ring is a set with the operations of addition (+) and multiplication () satisfying: 1. R is an abelian group + under addition. 2. Multiplication is associative. In a commutative ring, multiplication is commutative. A ring with identity has a multiplicative identity 1. 3. Distributive law: + = + , + = + A left/ right zero divisor is an element so that there exists 0 with = 0, = 0, respectively. A commutative ring without zero divisors is an integral domain. A ring is a division ring if {0} is a multiplicative group under multiplication (inverses exist). A division ring is a field if the multiplicative group is abelian. Ex. of Rings: , [] (the ring of polynomials in x, where R is a ring), [1 , , ] Group G
Commutative ring
Division ring
Integral domain
Field F
Principal ideal domain (PID) Euclidean domain Note: A field is a UFD, though not a very interesting one. Basic properties: 1. 0 = 0 = 0 2. = = () 3. The multiplicative identity 1 is unique (if it exists). 4. A multiplicative inverse is unique if it exists. 5. If R is not the zero ring {0}, then 1 0.
6. If R is an integral domain, the cancellation law holds. Conversely, if the left (right) cancellation law holds, then R has no left (right) zero divisors. 7. A field is a division ring, and any finite integral domain is a field. From here on rings are assumed to be commutative with identity unless otherwise specified. A unit is an element with a multiplicative inverse. The characteristic of a ring is the smallest > 0 so that 1 + + 1 = 0. If this is never true,
the characteristic is 0.
12
13
Homomorphisms
A ring homomorphism : is compatible with addition and multiplication: 1. + = + () 2. = () 3. 1 = 1 An isomorphism is a bijective homomorphism and an automorphism is an isomorphism from R to itself. The kernel is {  = 0}, and it is an ideal.
14
Mapping Property: Let : be a ring homomorphism with kernel K and let be an ideal. Let : / = be the canonical map. There is a unique homomorphism : so that = . = / First Isomorphism Theorem: If f is surjective and = then is an automorphism. Correspondence Theorem: If f is surjective with kernel K, There is a bijective correspondence between ideals of and ideals of that contain . A subgroup of G containing K is associated with its image. If corresponds to , / /. Corollary: Introducing relations one at a time (killing , then ) or together (killing , ) gives the same ring. Useful in polynomial rings. The product ring is the product set with componentwise addition and multiplication. 1. The additive identity is (0,0) and the multiplicative identity is (1,1). 2. The projections , = , , = are ring homomorphisms to , . 3. 1,0 , (0,1) are idempotent elements elements such that 2 = 1. Let e be an idempotent element of a ring S. 1. = 1 is idempotent, and = 0. 2. is a ring (but not a subring of S unless e=1) with identity e, and multiplication by e is a ring homomorphism . 3. .
15
Fraction Fields
Every integral domain can be embedded as a subring of its fraction field F. Its elements are , , 0 , where 1 = 2 1 2 = 2 1 . Addition and multiplication are defined as in arithmetic: + = , = , and = . The field of fractions of the polynomial 1 ring [], K a field, is the field of rational functions (). Mapping Property: Let R be an integral domain with field of fractions F, and let : be an injective homomorphism from to a field . can be extended uniquely to an injective homomorphism : by letting = 1 .
+
1 2
16
Integers
Peanos Axioms for : 1. 1 2. Successor function: The map : sends an integer to the next integer = (); 1 = 2, 2 = 3 is injective, and 1 for any (i.e. 1 is the first element). 3. Induction axiom: Let S be a subset of having the following properties: a. 1 b. If then . Then = . (Counting runs through all the natural numbers.)
Inductive/ Recursive Definition: By induction, if an object 1 is defined, and a rule for determining = +1 from is given, then the sequence is determined uniquely. Recursive definition of 1. Addition: + 1 = , + = ( + ) (i.e. + + 1 = + + 1) 2. Multiplication: 1 = , = + (i.e. + 1 = + ) From these, the associative, distributive, and distributive laws can be verified. (Peano playing) The integers can be developed from by introducing an additive inverse for every element.
2
21
Factoring
Factoring
Vocabulary u is a unit a divides b a properly divides b a and b are relatively prime a and b are associates a is irreducible if has a multiplicative inverse in R if = for some if = for some and neither nor are units and have no common divisor except units. if each divides the other, or if = , u a unit if a is not a unit and has no proper divisor (its only divisors are units and associates) if is not a unit, and whenever divides , divides or divides . = (1) () 1 = 1 = 1 , and there is no principal ideal () such that (1). or ()
p is a prime element
5 .
22
Unique Integral domain where factorization Factoring terminates domain (UFD) Factorization unique or equivalently, every irreducible element is prime. Principal Ideal All ideals generated Domain (PID) by one element
For equivalence: If every irreducible element prime, and there are two factorizations, an element on the left divides an element on the right; they are associates and can be canceled. A PID is a UFD: 1 Irreducible element prime: = + Bezouts identity. Irreducible element prime since , 1 = + = + 2 Factoring terminates: If 1 2 then = () is a principal ideal; ( ) for some j.
Irreducible element prime GCD exists (factor and look at common prime divisors)
Maximal ideals generated by irreducible elements
Euclidean domain
A Euclidean Domain is a UFD: The element of smallest size in an ideal generates it.
23
Algebraic Integers
An algebraic number is the root of an integer polynomial equation. It is an algebraic integer if it is the root of a monic integer polynomial equation. Equivalently, its irreducible polynomial over is monic. A rational number is an algebraic integer iff it is an integer.
24
Quadratic Rings
is a quadratic number field when is not a square. The algebraic integers in , = , d squarefree, have the form = + , where If 2,3(mod 4) then a and b are integers. 1 If 1(mod 4) then and b are both integers or halfintegers ( + 2). In other words, they have the form + , = 2 1 + ; , . The algebraic integers in form the ring of integers R in the field, [] or []. Complex quadratic rings can be represented by a lattice in the complex plane. The norm is defined by = . The norm is a multiplicative function, and = (). Hence ,   . An element is an unit iff its norm is 1. If = 3, 2, 1,2,3,5 then R is an Euclidean domain, and hence a UFD. The only other values of d where R is a complex UFD are 7, 11, 19, 43, 67, and 163. d Units Is 2 prime? 3 Yes 1 3 1, 2 2 2 No 1, 1
1
1 No 1, 2 Infinitely many No 3 Infinitely many No 5 Infinitely many Yes 2 All primes in R have norm p or . If the integer prime is odd and is a perfect square modulo p, then p is the product of 2 conjugate primes of norm p. is not a perfect square modulo p, then p is prime in R. Some Theorems 1. Chinese Remainder: Given pairwise coprime and any , there exists a unique number modulo such that (mod ). 2. / has () elements. It is a field iff is prime. (Pf. If N()=p then 1,p are the distinct residues. If () = 2 then = ; take + , 1 , . Use induction on the number of prime factors of .) 3. Fermats Little Theorem: (mod ). 4. Eulers Theorem: 1(mod ). 1 5. Totient: = . =1 =1 6. Wilsons Theorem: If is prime, the product of all nonzero residues modulo is congruent to 1 modulo . 7. There are finitely many pairwise nonassociated numbers with given norm.
25
Gaussian Integers
[] is the ring of Gaussian integers. 1. If is a Gauss prime, then is an integer prime or the square of an integer prime. 2. Each integer prime is a Gauss prime or the product where is a Gauss prime. 3. Primes congruent to 3 modulo 4 are Gauss primes. (They are not the sum of two squares.) 4. Primes congruent to 1 modulo 4, and 2, are the product of complex conjugate Gauss primes. Pf. (34) p is a Gauss prime iff () is a maximal ideal in [], iff = () = ( 2 + 1) is a field, iff 2 + 1 is irreducible (doesnt have a zero) in []. 1 is a square modulo iff = 2 or 1 (mod 4).
26
Factoring Ideals
If A and B are ideals, then = , . is the unit ideal since = for any R. Let R be a complex quadratic ring. Then = = for some n; i.e. the product is a principal ideal. (Pf. Let , , (, ) be lattice bases for A, B. Let = gcd(, , + ); then () . Show n divides the four generators , , , , by showing
Cancellation Law: Let A, B, C be nonzero ideals. = iff = . .  . Note that if A divides B, then A is larger than B it contains more elements; upon multiplication, many of the elements disappear.
1. / is an integral domain. 2. , and or . 3. , and if A, B are ideals of R, or . Any maximal ideal is prime. If P is prime and not zero, and , then  or . Letting R be a complex quadratic ring, and B be a nonzero ideal, 1. B has finite index in R. 2. Finitely many ideals in R contain B. (Pf. Look at lattice) 3. B is in a maximal ideal. 4. B is prime iff it is maximal. (Pf. / is a field.) Every proper ideal of a complex quadratic ring R factors uniquely into a product of prime ideals (up to ordering).1 (Pf. Use 2 and cancellation law.) Warning: Most rings do not have unique ideal factorization since . The complex quadratic ring R is a UFD iff it is a PID. (Pf. If P is prime, P contains a prime divisor of some element in P. Then = ().) Below, P is nonzero and prime, p is an integer prime, and is a Gauss prime. 1. If = () then = or 2 for some p. 2. () is a prime ideal (p remains prime), or = (p splits; if = then p ramifies). 3. If 2,3(mod 4), then p generates a prime ideal iff d is not a square modulo p, iff 2 is irreducible in []. [Pf. by diagram] 4. If 1 mod 4 , then p generates a prime ideal iff 2 + 4 is irreducible in []. Random: For nonzero ideals A, B, C, : = : . (Show for prime ideal A, split into 2 cases based on (2).)
1
27
Ideal Classes
Ideals A and B are similar if = for some . (The lattices are similar and oriented the same.) Similarity classes of ideals are ideal classes; the ideal class of A is denoted by . The class of the unit ideal consists of the principal ideals. The ideal classes form the (abelian) class group C of R, with = . (Note 1 = .) The class number  tells how badly unique factorization of elements fails. Measuring the size of an ideal: Norm: = , where () = . Multiplicative function. Index [: ] of A in R. (), the area of the parallelogram spanned by a lattice basis. Minimal norm of nonzero elements of A. Relationships: = : = 2 If has minimal nonzero norm, , =
2 3 3 3
())
1. Every ideal class contains an ideal A with norm . (Pf. Choose nonzero
1
A Dedekind domain is a Noetherian, integrally closed integral domain with every nonzero prime ideal maximal (such as the complex quadratic rings). Integrally closed means that the ring contains all algebraic integers that are in its ring of fractions. Prime factorization of ideals holds in any Dedekind domain. See Algebraic Number Theory.
element with minimal norm, = for some C, , = , = .) 2. The class group C is generated by , for prime ideals P with prime norm . (Pf. Factor. Either () = or = ().) 3. The class group is finite. (Pf. There are at most 2 prime ideals with norms a given integer since = () has unique factorization; use multiplicativity of norm.) Computing the Class Group of = [ ] . 1. List the primes . 2. For each p, determine whether p splits in R by checking whether 2 2,3mod4, 2+14 1mod4 are reducible. 3. If = splits in R, include in the list of generators. 4. Compute the norm of some small elements (with prime divisors in the list found above), like + . . Factor () to factor = ; match factors using unique factorization. Note = = = 1. As long as is not divisible by one of the prime factors of (), this amounts to replacing each prime in the factorization of by one of its corresponding ideals in (3) and setting equal to 1. Repeat until there are enough relations to determine the group. [This works since if = 1, = then there is an element , = .] 5. For the prime 2, a. If 2,3(mod 4), 2 ramifies: 2 = . has order 2 for 1, 2. b. If 2(mod 4), = 2, . c. If 3 mod 4 , = 2,1 + .
28
2 3
}. For
any lattice with determinant , 1 contains a nonzero lattice point (take the point nearest the origin and use geometry). , = (, ) is an areapreserving map; by applying to the lattice, we get that every has a nonzero lattice point. These points have bounded norm; one norm is hit an infinite number of times. The ratios of these quadratic integers are units.
3
31
Polynomials
Polynomials
A polynomial with coefficients in R is a finite combination of nonnegative powers of the variable x. The polynomial ring over R is
=
=0
with X a formal variable and addition and multiplication defined by: ( = , = ) 1. + = + 2. = + R is a subring of R[X] when identified with the constant polynomials in R. The ring of formal series [ ] is defined similarly but combinations need not be finite. Iterating, the ring of polynomials with variables 1 , 2 , , is [1 , 2 , , ]. (Formally, use the substitution principle below to show we can identify with [, ].) Basic vocab: monomial, degree, constant, leading coefficient, monic Division with Remainder: Let , [] with the leading coefficient of a unit. There are unique polynomials , [] (the quotient and remainder) so that = + , deg < deg Substitution Principle: Let : be a ring homomorphism. Given 1 , , , there is a unique homomorphism : 1 , , which agrees with the map on constant polynomials, and sends . For = , this map is just substituting for the variable and evaluating the polynomial. A characterization of the GCD: The greatest common divisor of , = [] is the monic polynomial defined by any of the following equivalent conditions: 1. = + 2. Of all polynomials dividing f and g, has the greatest degree. 3. If , then . From (1), there exist , so = + . Adjoining Elements Suppose is an element satisfying no relation other than that implied by = 0 where [] and has degree n. Then /() is the ring extension. If f is monic, its distinct elements are the polynomials in (with coefficients in R) of degree less than n, with (1, , , 1 ) a basis. A polynomial in is equivalent to its remainder upon division by f. can be identified with a subring of [] as long as no constant polynomial is identified with 0.
32
[]
Tools for factoring in []: 1. Inclusion in []. 2. Reduction modulo prime p: : [].
A polynomial in [] is primitive if the greatest common divisor of its coefficients is 1, it is not constant, and the leading coefficient is positive. Gausss lemma: The product of primitive polynomials is primitive. Pf. Any prime in is prime in [], and a prime divides a polynomial iff it divides every coefficient. Every nonconstant polynomial [] can be written uniquely as = 0 , and 0 () primitive. If 0 is primitive and 0  [] in [], then 0  in []. If two polynomials have a common nonconstant factor in [] , they have a common nonconstant factor in []. An element of [] is irreducible iff it is a prime integer or a primitive irreducible polynomial in [], so every irreducible element of [] is prime. Hence [] is a UFD, and each nonzero polynomial can be written uniquely (up to ordering) as ( primes, primitive irreducible polynomials) = 1 1 () This technique can be generalized: replace with a UFD R, and with the field of fractions of R. By induction, if R is a UFD, then [1 , , ] is a UFD.
Rational Roots Theorem: Let = + + 0 , 0. 0 (in reduced form) is a root iff 1 + 0 divides f; if 1 + 0 divides f then 1  and 0 0 .
33
Irreducible Polynomials
The derivative of a polynomial is formally defined (without calculus) as
=0
=
=1
1 .
is a multiple root of iff is a root of both () and . appears as a root exactly times if = 0 for 0 < but 0. , have a common factor other than 1 iff there is a field extension where f has a multiple root. If f is irreducible, and 0, then f has no multiple root (in any field extension). If F has characteristic 0, then f has no multiple root (in any field extension).
If = + + 0 [], , and the residue of f modulo p is irreducible in [], then f is irreducible in []. Irreducible polynomials in [] can be found using the sieve method. Eisenstein Criterion: If = + + 0 , , 1 , , 0 , 2 0 , then f is irreducible in []. Pf. Factor and take it modulo p; get = ( ). But if , 0, 2 0 . Extended Eisensteins Criterion Schnemanns Criterion: Suppose = + , 1, prime, , [] deg > deg ()
primitive is irreducible in []
. Then k is irreducible in []. Cohns Criterion: Let 2 and let p be a prime number. Write = + + 1 + 0 in base b. Then = + + 1 + 0 is irreducible in []. Capellis Theorem: Let K be a subfield of and , []. Let be a complex root of f and assume that f is irreducible in [] and is irreducible in []. Then is irreducible in []. [Add proof sketches.]
34
Cyclotomic Polynomials
A primitive nth root of unity satisfies = 1, but 1 for , 0 < < . The nth cyclotomic polynomial is =
primitive nth root
( ).
The cyclotomic polynomial is an irreducible polynomial in [] of degree (). Each polynomial 1 is a product of cyclotomic polynomials: 1 = () = ,<

so () has integer coefficients. Pf. of irreducibility: Lemma if is a primitive nth root of unity and a zero of [] then is a root for . Proof Suppose = , = 0, h irreducible (the minimal polynomial of ). is also a zero of . Suppose it is a zero of . Then is a zero of ( ), so = . Mod p, = , so g and h have a root in cogmmon, contradicting that 1 [] has no multiple root (derivative has no common factors with 1). Hence is a zero of h. Take powers to different primes to show that all primitive nth roots of unity divide h. Then = is irreducible.
35
Varieties
1. The set of ntuples in a field K is the affine nspace. 2. If S is a set of polynomials in 1 , , then = = 0 for all is a (affine) variety. 3. For , define the ideal of X to be = 1 , , vanishes on Note 1 , , , , , 1 , , . 4. The radical of the ideal I in a ring T is the ideal = {  for some } can be made into a topology (the Zariski topology) by taking varieties as closed sets (14 below).
Properties: 1. = where I is the ideal generated by S. 2. = ( ) 3. If = ( ) then =1 = ( 1 , 1 ). 4. = 0 , = (1) 5. (), () 6. , () 7. = , = () 8. 0 = [1 , , ] 9. If K is an infinite field, = {0}. a. For n=1, a nonzero polynomial only has finitely many zeros. Extend by induction. 10. 1 , , = (1 1 , , ) (the ideal generated by ) a. Use division with remainder. 11. If 1 , then = (1 1 , , ) is a maximal ideal. a. Apply the division algorithm to \. 12. ()
36
Nullstellensatz
Hilbert Basis Theorem: If R is Noetherian, then [] is Noetherian. Thus so is [1 , , ]. In particular, this holds for = or a field F. Pf. For [] an ideal, the set whose elements are the leading coefficients of the polynomials in I (including 0) forms the ideal of leading coefficients in R. Take generators for this ideal and polynomials with those leading coefficients, multiplying by x as necessary so they have the same degree n. The polynomials with degree less than n form a free, Noetherian Rmodule P with basis (1, , 1 ). has a finite generating set. Put the two generating sets together. The ring of formal power series [ ] is also Noetherian. Noether Normalization Lemma: Let A be a finitely generated Kalgebra. There exists a subset 1 , , of A such that the are algebraically independent over K and A is integral over [1 , , ] (all elements of A are algebraic integers over [1 , , ]). Pf. Induct on n; n=1 trivial. Take a maximally algebraically independent subset 1 , , {1 , , }; assume > . By algebraic dependency, there exists 1 , , so that 1 , , = 0. Lexicographically order the monomials, and choose weights to match the lexicographic order. Set = + . Then we get a polynomial in , where term with the highest power of is uncancelled. is integral over [1 , , 1 ]; finish by induction. Cor. If B is a finitely generated Kalgebra, and I is a maximal ideal, then is a finite extension of K (K is embedded via + .): In the above, we must have = 0; B/I is algebraic over K. Hilberts Nullstellensatz: For any field K and , the following are equivalent: 1. K is algebraically closed. 2. (Maximal Ideal Theorem) The maximal ideals of [1 , , ] are the ideals of the form (1 1 , , ). 3. (Weak Nullstellensatz) If I is a proper ideal of [1 , , ], then () is not empty. 4. (Strong Nullstellensatz) If I is an ideal of [1 , , ] then = . (2)(3): For I a proper ideal, let J be a maximal ideal containing it. Then () so = (1 1 , , ), ().
(3)(4): Rabinowitsch Trick: 1. Let . Let 1 , , be a generating set for [1 , , , ]. Let be the ideal generated by 1 , , , 1 . 2. = a. If 1 , , , +1 +1 and 1 , , , then 1 , , , +1 ( ) since it is not a zero of 1 . b. If 1 , , then 1 , , , +1 ( ) (an even weaker statement). 3. Using the weak Nullstellensatz (see below), we can write
1=
=1
+ 1
=
=1
1 , , 1 ,
(4)(3): The radical of an ideal is the intersection of all prime ideals containing I. I is in a maximal, prime ideal P; so is , so is proper. () is proper by (4), so . (3)(2): For I maximal, there is (). Since I is maximal, it must be in (1 1 , , ). (1)(2): Let I be a maximal ideal. K can be imbedded via + in 1 , , ; by the corollary to Noether Normalization Lemma, this is a finite extension of K so must be K (since it is algebraically closed). Then + = + , 1 1 , , , with equality since the LHS is maximal. (2)(1): If f is a nonconstant polynomial in [1 ] with no root in K, regard it as a polynomial in [1 , , ] with no root in . Then I is in a maximal ideal (1 1 , , ), so has root 1 = 1 . Combinatorial Nullstellensatz: Let F be a field, [1 , , ] and let 1 , , be nonempty subsets of F. 1. If 1 , , = 0 for all 1 , , 1 (i.e. (1 )) then lies in the ideal generated by the polynomials = ( ). The polynomials 1 , , satisfying = 1 1 + + can be chosen so that deg deg deg ) for all i. If 1 , , [1 , , ] ( for some subring , we can choose [1 , , ]. a. The are all zeros of of degree   so by subtracting multiples of 1 every in f can be replaced with a linear combination of 1, , . Then by counting zeros the result is actually 0; i.e. f is in the form above. 2. If deg = 1 + + where are nonnegative integers with <  , and if the coefficient of 11 is not 0, then there exist so that 1 , , 0, i.e. (1 ).
Fields
Examples of Fields An extension K of a field F (also denoted /) is a field containing F. Number field: subfield of Finite field: finitely many elements Function field: Extensions of () of rational functions
41
42
Algebraic Elements
Let K be an extension, and be an element of K. is algebraic over F if it is the zero of a polynomial in [], and transcendental otherwise. is transcendental iff the substitution homomorphism : is injective. is the smallest subfield of K that contains F and . The irreducible polynomial of over F is the monic polynomial of lowest degree in [] having as a zero. Any polynomial in [] having as a zero divides . /() is an extension field of F with a root of = 0. The substitution map /() [] is an isomorphism, so /() (). [*] For every polynomial in F[x], there is an extension field in which it splits (factors) completely, i.e. every polynomial has a splitting field. If f has degree then () is a vector space with dimension and basis (1, , , 1 ). Let , be elements of /, / algebraic over F. There is an isomorphism of fields () sending iff , have the same irreducible polynomial. Let , be extensions of F. A Fisomorphism is an isomorphism : that restricts to the identity on F. Then K and L are isomorphic as field extensions. If is a zero of in , then () is a zero of .
43
If : = 2 then K can be obtained by adjoining a square root of an element in F: 2 Multiplicative property: If , then : = : [: ]. o If K is a finite extension of F, and , then the degree of divides [: ]. o If is algebraic over F, it is algebraic over with degree less than or equal to its degree over . o A field extension generated by finitely many algebraic elements is a finite extension. o The set of elements of K that are algebraic over F is a subfield of K. Let L be an extension field of F, and let , be subfields of L that are finite extensions of F. Let : = , : = , : = . Then m and n divide N, and .
Finding the Irreducible Polynomial of (The dum way) Compute powers of , and find a relation between them. (The smart way) 1. If = 1 + + , 1 where each 1 is algebraic (for example a nth root), then its conjugates (other zeros of the irreducible polynomial) are in the form 1 + + , 1 , respectively where is a conjugate of . (Not all these may be conjugates.) 2. The irreducible polynomial is conjugate of ( ). [Note: This gives an elementary proof of the fact that the algebraic numbers/ integers form a field/ ring. For , algebraic, expand the product ( ), , running over the conjugates of , , and use the Fundamental Theorem on Symmetric Polynomials.]
44
Application: Constructions!
Rules: 1. Two points (0,0) and (1,0) are given (constructed). 2. If P, Q have been constructed, we can draw (construct) a. the line through them b. a circle with center at P and passing through Q. 3. Points of intersection of constructed lines and circles are constructed. 4. A number is constructible if (a,0) is constructible. Finding all constructible numbers: 1. If = 0 , 1 , = (0 , 1 ) have coordinates in F, then the line in (2a) is defined by a linear equation with coefficients in F, while the circle in (2b) is defined by a quadratic equation with coefficients in F. 2. The point of intersection of two lines/ circles whose equations have coefficients in F has coordinates in a real quadratic extension of F. 3. Let P be a constructible point. There is a chain of fields = 0 1 = such that a. K is a subfield of . b. The coordinates of P are in . c. +1 : = 2, and : = 2 .
Thus a constructible number has degree over a power of 2. 4. Conversely, if a chain of fields satisfies the conditions above, then every element of K is constructible. Examples: 1. Trisecting the angle with compass and straightedge is impossible. cos 20 is not constructible. 2. For p prime, a regular pgon can be constructed iff = 2 + 1.
45
Finite Fields
A finite field is a vector space over for some prime p, so has order = . The (unique) field of order q is denoted by . 1. The elements in a field of order q are roots of = 0 (everything is modulo p). a. The multiplicative group of nonzero elements has order 1. The order of any element divides 1 so 1 = 0 for any . 2. is a cyclic group of order 1. a. By the Structure Theorem for Abelian Groups, is a direct product of cyclic subgroups of orders 1   , and the group has exponent . 1 = 0 has at most roots, so = 1, = 1. 3. There exists a unique field of order q (up to isomorphism). a. Existence: Take a field extension where splits completely. If , are roots of = 0 then + = + . Since 1 is a root, is a root. The roots form a field. b. Uniqueness: Suppose , have order . Let be a generator of ; = (). The irreducible polynomial [] with root divides . splits completely in both , , so f has a root . Then /() ( ) = . 4. A field of order contains a subfield of order iff . (Note this is a relation between the exponents, not the orders.) a. : Multiplicative property of the degree. b. : 1 1. Cyclic contains a cyclic group of order . Including 0, they are the roots of = 0 and thus form a field by 3a. 5. The irreducible factors of over are the irreducible polynomials in [] whose degrees divide r. a. : Multiplicative property b. : Let be a root of g. If , by (4), contains a subfield isomorphic to (). has a root in so divides . 6. For every r there is an irreducible polynomial of degree r over . a. ( = ) has degree r over , and has a cyclic multiplicative group generated by an element . () has degree r over . To compute in , take a root of the irreducible factor of of degree r; (1, , , 1 ) is a basis. Let () be the number of irreducible monic polynomials of degree d in . Then by (2), =

().
By Mbius inversion,
Primitive elements Let K be a field extension of F. An element such that = () is a primitive element for the extension. Primitive Element Theorem: Every finite extension of a field F contains a primitive element. Proof when F has characteristic 0: Show that if = (, ) with , then = + is a primitive element for K over F. Let , be the irreducible polynomials of , , and , be the conjugates of , . For all but finitely many , the numbers + are all distinct. For such a value of , to show that = + is a primitive element, consider = (). gcd , = by choice of c, so () as desired.
Modules
More structure More complex No division Ring Module Algebra Division Field Vector Space Division Algebra
51
Modules
A left/right Rmodule / over the ring R is an abelian group (M,+) with addition and scalar multiplication ( or ) defined so that for all , and , , Left Right 1. Distributive + = + + = + 2. Distributive + = + + = + 3. Associative = () = 4. Identity 1 = 1 = A (S,R)bimodule has both the structure of a left Smodule and right Rmodules. Modules are generalizations of vector spaces. All results for vector spaces hold except ones depending on division (existence of inverse in R). is linearly dependent if there exist 1 , , such that 0 and 1 1 + + = 0. Again, a basis is a linearly independent set that generates the module. Note that if elements are linearly independent, it is not necessary that one element is a linear combination of the others, and bases do not always exist. Every basis for V (if it exists) contains the same number of elements. V is finitely generated if it contains a finite subset spanning V. The rank is the size of the smallest generating set. A submodule of a Rmodule is a nonempty subset closed under addition and scalar multiplication. Viewing R as an Rmodule, the submodules of R are the ideals in R. In , submodules correspond to lattices, with the area/volume of a fundamental parallelogram/parallelepiped equal to the determinant. A free module with n generators has a basis with n elements. It is isomorphic to . An isomorphism preserves addition and scalar multiplication. Unlike vector spaces, not all finitely generated modules are isomorphic to some . Basic Theorems: 1. If W is a submodule of V, the quotient module / is a Rmodule, and the canonical map : / is a homomorphism. 2. Mapping Property: Let : be a homomorphism of Rmodules with kernel containing W. There is a unique homomorphism with = . V'
V G 3. First Isomorphism Theorem: If is surjective with kernel W, is an isomorphism. 4. Correspondence Theorem: Let : be a surjective homomorphism. There is a bijective correspondence between submodules of V' and submodules of V that containing ker = : with is associated with (); / /().
5. Second Isomorphism Theorem: Let and be submodules of , and let + = + , . Then + and are submodules of and + 6. Third Isomorphism Theorem: Let be modules. Then / (/)/(/).
52
Structure Theorem
Matrices, invertible matrices, the general linear group, the determinant, and change of bases matrices all generalize to a ring R. However, a Rmatrix A is invertible iff its determinant is a unit. Properties of matrices in a field such as det() = det det continue to hold in a ring, because they are polynomial identities. Smith Normal Form For a matrix over an Euclidean domain R [*] (such as or []), elementary row/ column operations correspond to left and right multiplication by elementary matrices and include: (1) Interchanging 2 rows/ columns (2) Multiplying any row/ column by a unit (3) Adding any multiple of a row/ column to another row/ column However, note arbitrary division in R is illegal. A matrix is in Smith (or Hermite) normal form if 1. It is diagonal. 2. The entries 1 , , on the main diagonal satisfy +1 , 1 < min ). (Ones (, at the end may be 0.) Every matrix is equivalent to a unique matrix N in normal form. For a matrix A, follow this algorithm to find it: 0 1. Make the first column . 0 a. Choose the nonzero entry in the first column that has the least norm. b. For each other nonzero entry , use division to write = + , where is the remainder upon division. Subtract times the row with from the row with . c. Repeat a and b until there is (at most) one nonzero entry. Switch the first row with that row if necessary. 2. Put the first row in the form 0 0 by following the steps above but exchanging the words rows and columns. 3. Repeat 1 and 2 until the first entry is the only nonzero entry in its row and column. (This process terminates because the least degree decreases at each step.) 4. If does not divide every entry of A, find the first column with an entry not divisible by g and add it to column 1, and repeat 14; the degree of g will decrease. Else, go to the next step. 5. Repeat with the 1 ( 1) matrix obtained by removing the first row and column. Solving = in R: 1. Write = 1 , where is in normal form. Suppose the nonzero diagonal entries are 1 , 2 , , . 2. The solutions of the homogeneous system = 0 are the vectors whose first k coordinates are 0.
1 1 4. The equation has a solution iff is in the form , = . Use linear algebra to 0 find a particular solution . (The condition guarantees that the entries are in R.) Then the solutions are + , for a homogeneous solution. Structure Theorem:
(a.k.a. Fundamental Decomposition Theorem)
Let M be a finitely generated module over the PID R (such as or []). Then M is a direct sum of cyclic modules and a free module 1 , where /( ). The cyclic modules can be chosen to satisfy either of the following conditions: 1. 1 2  2. Each is the power of an irreducible element.
53
54
generalizing linear algebra for modules helps us study abelian groups. If W is a free abelian group of rank m, and U is a subgroup, then U is a free abelian group of rank at most . Pf. Choose a (finite) set of generators = (1 , , ) for U and a basis = (1 , , ) for W. Write = . Then left multiplication by A is an surjective homomorphism . Diagonalizing A, we can find an explicit basis for U with at most elements.
U W L Generators and Relations Let A be a matrix, and let denote the image of under left multiplication by . The module = / is presented by the matrix A. An abelian group G with n generators 1 , , can be identified with a quotient module of . The set of 1 , , such that
= 0 forms a submodule of . They are the relations in G, and form the kernel of the map . If 1 , , generate this submodule, letting A be the matrix with these rows, 1 = 0 = for some =1 Then G corresponds to the module / ; G is presented by A. An abelian group that is presented by a matrix needs only satisfy the relations implied (through linearity) by the relations given by the columns of A. To determine a group from its presentation: 1. Use elementary row and column operations to write A in normal form. 2. Delete any columns of 0s (trivial relations). 3. If 1 is the only nonzero entry in its column, delete that row and column. (This is a relation of the form = 0.) 4. If the diagonal entries are 1 , , , and there are zero rows, then the group is isomorphic to 1 1 . Structure Theorem for Finitely Generated Abelian Groups:
a.k.a Unicity Theorem for Abelian Group Decomposition, Basis Theorem
=1
A finitely generated abelian group V is the direct sum of cyclic subgroups and a free abelian group: = 1 . The orders can be chosen uniquely to satisfy either of the following two conditions: 1. 1 < 1 2  2. All the are prime power orders. (Uniqueness follows from counting orders in pgroups.)
55
is unique under the condition +1  for each 1 < . The companion matrix of the monic polynomial = 0 + 1 + + 1 1 + is 0 0 0 0 1 0 0 1 () = 0 1 0 2 because the characteristic polynomial of C(p) is 1 (). 1 1 0 0 The product of the invariant factors is the characteristic polynomial of T.
56
57
Tensor Products
Commutative Rings: The tensor product of Rmodules M and N is the (unique) Rmodule T (along with a bilinear map : ) satisfying the Universal Mapping Property: for any bilinear map : , there is a unique Rhomomorphism : such that = . One way to construct it is as follows: Let F be the free module with basis , and let be the submodule generated by + , , ( , ), , + , (, ), , (, ), , (, ) for all , ; , , . Then = /; denotes , + . The relations make linear: 1. + = + 2. + = + 3. = = Note that in general, an element of is a sum (linear combination) of elements in the form . Basic properties (prove using UMP) 1. 2. ( ) 3. ( ) 4. , where means the direct sum of m copies of A. 5. = . The tensor product 1 2 of homomorphisms 1 : 1 1 , 2 : 2 2 is the map : 1 2 1 2 such that 1 2 = 1 1 2 (2 ). Note that 1 2 1 2 = 1 1 (2 2 ). When applied to the linear transformations corresponding to the homomorphisms, the tensor (Kronecker) product of matrix A and matrix B is
11 = 1
For the tensor product of algebras, multiplication is given by = . Noncommutative rings: The tensor product of right Rmodule and left Rmodule is an abelian group T (along with a bilinear map : ) satisfying the Universal Mapping Property: for any biadditive, Rbalanced map : 1. + , = , + , , , + = , + , 2. , = (, ) there is a unique abelian group homomorphism : such that = . One way to construct it is as follows: Let F be the free module with basis , and let be the submodule generated by + , , ( , ), , + , (, ), , (, ) for all , ; , , . Then = /; denotes , + . The relations make biadditive and Rbalanced: 1. + = + 2. + = + 3. = If M is a (S,R) bimodule and N is a (R,T) module, then is a ST bimodule. Definitions generalize to more modules with multiadditive balanced maps. The above properties all hold except for commutativity; (2) is replaced by ( ).
6
61
Galois Theory
Symmetric Polynomials
Symmetric Polynomials A symmetric polynomial is fixed by every permutation of the variables. The elementary symmetric polynomial in n variables 1 , , of degree k is =
1(1)<<()
1 = + 1 1 + +
Fundamental Theorem of Symmetric Polynomials: Every symmetric polynomial in [] can be written in a unique way as a polynomial in the elementary symmetric polynomials. The polynomial will be in []. Pf. Introduce a lexicographic ordering of the monomials and use induction. Corollaries: 1. If [] has roots 1 , , in , and 1 , , [1 , , ] is a symmetric polynomial, then 1 , , . 2. If 1 , , is the orbit of 1 for the operation of the symmetric group on the variables, and (1 , , ) is a symmetric polynomial, then (1 , , ) is a symmetric polynomial.
62
Discriminant
If = + 1 1 + + has roots 1 , , , then the discriminant of P is =
1<
Since D is a symmetric polynomial in the , it can be written in terms of the elementary symmetric polynomials. (It can always be defined in terms of whether or not P splits completely.) 1 , , = 1 , , = (1 , , 1 ) Ex. 1. 2 + + = 2 4. 2. 3 + + = 43 272 .
63
Galois Group
Assume fields have characteristic 0. The Fautomorphisms of an extension K form the Galois group (/) of K over F. / is a Galois extension3 if (/) = [: ]. Ex. (/) = {, conjugation}. Any two splitting fields of over F are isomorphic.
In general (when K is not necessarily a finite extension) a Galois extension is defined as a normal, separable field extension. A separable polynomial has no repeated roots in a splitting field; n element is separable over F if its minimal polynomial is separable; a separable field extension has every element separable over F.
Pf. (a) An extension field contains at most one splitting field of over F. (b) Suppose 1 , 2 are 2 splitting fields. Take a primitive element 1 with irreducible polynomial . Choose an extension L of 2 so that g has a root . Then use (a).
64
Fixed Fields
Let H be a group of automorphisms of a field K. The fixed field of H, , is the set of elements of K fixed by every group element. = = Fixed Field Theorem: 1. : = : The degree of K over is equal to the order of the group. 2. = (/ ): K is a Galois extension of with Galois group H. Pf. 1. Let 1 with Horbit 1 , , . For any , there is with 1 = . Thus . Since = 1 [] by symmetry, is the irreducible polynomial for 1 over . r divides the order of H. 2. If : = , there exist elements in K whose degrees over F are arbitrarily large. 3. By (1), / is algebraic, so by (2), [: ] is finite. The stabilizer of a primitive element is trivial, so the orbit has order = . By (1), has degree over . Then : = . 4. Let = (/ ). Then . By definition, every element of G acts as the identity on so . Lroths Theorem: Let be a subfield of the field () of rational functions. Then is a field () of rational functions.
65
3. is a splitting field over F. Pf. (1)(2): By the Fixed Field Theorem, = [: ]. (1)(3): Let 1 be a primitive element for K, with irreducible polynomial . Let 1 , , be the roots of in K. There is a unique Fautomorphism sending 1 for each i, and these make up the group ( ). Thus the order of ( ) is equal to the number of conjugates of 1 in K. So Galois = = : (degree r) splits completely in K K is a splitting field. If is a Galois extension, and [] splits completely in K with roots 1 , , , then G operates on the set of roots { }. G operates faithfully if K is a splitting field of over . G operates transitively if is irreducible over F. If K is the splitting field of irreducible , then G embeds as a transitive subgroup of .
66
Fundamental Theorem
Fundamental Theorem of Galois Theory: Let K be a Galois extension of a field F, and let = (/). Then there is a bijection between subgroups of G and intermediate fields, defined by ( ) Let = (the fixed field of a subgroup H of G). is a Galois extension iff H is a normal subgroup of G. If so, . = ( ) operates on K fixing F.
} normal: operates here. F Pf. Let 1 be a primitive element for and let be the irreducible polynomial for 1 over F. Let the roots of in be 1 , , . For , 1 = , the stabilizer of is 1 . Thus 1 = = . H is normalAll Galois. Restricting to L gives a homomorphism : ( ) with kernel H.
K L
} = ( ) operates on K fixing L.
67
Roots of Unity
Let = . ( ) is a cyclotomic field. For p prime, the Galois group of ( ) is isomorphic to , of order 1. Ex. For = 2 + 1, G is cyclic of order 2 . Let be a primitive root modulo , and = . The degree of each extension in the following chain is 2: =
2
2 2
= . cos
generates
2 1
KroneckerWeber Theorem: Every Galois extension of whose Galois group is abelian is contained in a cyclotomic field ( ). Ex. If p is prime and L is the unique quadratic extension of in ( ), 1. If 1 (mod 4) then = ( ). 2. If 3 (mod 4) then = ( ). Show this by letting be a generator as before, take the orbit sums of the roots for 2 . Kummer Extensions
Let be a subfield of containing = 2 , and let be a Galois extension of degree p. Then K is obtained by adjoining a pth root (some with ). Pf. 1. For , = is either irreducible in F, or splits completely in F. (Take ( ); then = for some 0, so G operates transitively on the roots of .) 2. K is a vector space over F; each is a linear operator. Choose a generator . = implies that the matrix is diagonalizable and all eigenvalues are powers of . Let be an eigenvector with eigenvalue 1; then = = , but , so = .
68
Cubic Equations
Let K be the splitting field of an irreducible cubic polynomial over F with roots 1 , 2 , 3 , let D be the discriminant of , and let = . If Chain Proper intermediate fields : 3 None is not a square 3 3 1 = in F 1 , 2 , 3 , () is a square in F 6 3 1 1 , 2 = Pf. Let = 1 2 1 3 2 3 = . fixed by every element of G only even permutations in G. In general, for an irreducible polynomial of any degree, = G contains only even permutations. Cubic Formula To solve 3 + 2 2 + 1 + 0 = 0 first substitute = 2 /3 (Tschirnhausen transformation) to put it in the form 3 + + = 0. For roots 1 , , , = 1 + 2 + 2 3 , = 1 + 2 2 + 3 are eigenvectors for 3 2 2 = (123). Let = cyc 1 , = cyc 1 2 , = cyc 1 2 . Then = . Express , + in terms of elementary symmetric polynomials, apply Vietas formula, and solve for , , . Find 3 , then take the cube root:
3
3 2 3 + + + 2 27 4 2
3 2 + 27 4
69
Quartic Equations
Let [] be an irreducible quartic polynomial. Let 1 = 1 2 + 3 4 , 2 = 1 3 + 2 4 , 3 = 1 4 + 2 3 . = 1 2 ( 3 ) is the resolvent cubic of . What is = (/)? D square D not square reducible 2 ( splits completely) 4 or 4 ( has 1 root in F) irreducible 4 4 2 = {, 12 34 , 13 24 , 14 23 } For the ambiguous case, let = 1 2 3 4 , = 1 + 2 3 4 . or is a square in F iff = 4 .
Pf. The are distinct since 1 2 = 1 4 (2 3 ). 4 operates on = { }, giving : 4 3 . If irreducible, G operates transitively on B, so 3 . Special case: = 4 + 2 + = 0. Then the roots are 1 , 2 =
2 4 2
3 = 1 , and 4 = 2 , so 4 . Look at expressions such as 1 2 . Quartics are solvable in the following way: 1. Adjoin = . 2. Use Cardanos formula to solve for a root of the resolvent cubic () and adjoin it. 3. The Galois group over the field extension K is a subgroup of 2 . At most 2 more square root extensions suffice.
610
a. A subgroup of 5 containing a 5cycle and transposition is the whole group. b. If is a quintic irreducible polynomial with exactly 3 real roots, then the Galois group is 5 by (a). c. Example: 5 + 16 + 2. In general, a polynomial equation over a field of characteristic 0 is solvable by radicals iff its Galois group is a solvable group. In (4) above, the Galois group after adjoining an element is a subgroup of the previous one, with factor group prime cyclic.
611
Transcendence Theory
LindemannWeierstrass Theorem: If 1 , . . . , are algebraic numbers linearly independent over the rational numbers , then 1 , . . . , are algebraically independent over ; in other words the extension field 1 , . . . , has transcendence degree n over . [Incomplete]
Algebras
An algebra over a ring R is a module over R with multiplication defined so that for all , , , , 1. Associative = 2. Distributive + = + , + = + 3. = = () If there is an element 1 so that 1 = 1 = , then 1 is the identity element. is commutative if = . is a division algebra if each element has an inverse ( 1 = 1).
71
Division Algebras
Frobenius Theorem: The only finitedimensional division algebras D over the real numbers are (the real numbers), (the complex numbers) and (the quaternions). Pf. Associate with each the linear transformation = . 1. Lemma: The set V of all such that 2 , 2 0 forms a subspace of codimension 1 (i.e. dim (/) = 1). Proof: Let be the characteristic polynomial of . By CayleyHamilton, = 0. Since there are no zero factors in D, one irreducible real factor of must be 0 at . If the factor is linear ( ), then , = 0. If the factor is irreducible quadratic ( 2 2 + 2 ), then this is the minimal polynomial. Since the minimal polynomial has the same factors as the characteristic polynomial, = 2 2 + 2 . Since our minimal polynomial has no repeated complex root, is diagonalizable over (see Linear Algebra notes, 82). 2 a. If trace = 0, then the eigenvalues are pure imaginary , and is 2 diagonalizable with eigenvalues 2 . Thus = 2 2 = 2 0. 2 2 2 b. Conversely, if 0, then = for some , and the eigenvalues of can only be . Then trace = 0. c. Hence = { trace 0}. : trace ) is a linear operator with range ( (dimension 1). Since V is the kernel, V has codimension 1. 2. From (1), = . Since 2 = { 2  } gives the reals in (, 0], 4 gives the reals in [0, ) and V generates D as an algebra. 3. Let , = 2 = . From the definition of V, B is an inner product 2 (positive definite, symmetric). Choose a minimal subspace W of V generating D as an algebra, and let 1 be an orthonormal basis with respect to B. Then i 2 = 1, ii = ( ). a. If = 0, . 2 b. If = 1, . (1 = 1) c. If = 2, . (Check the relations.) d. If > 2, then using then from (ii) 1 2 2 = 1 1 2 = 1 = 1 2 . So span 1 1 with basis 1 1 also generates D as an algebra, contradicting minimality.
2 + 2 + 2
References
[A] Algebra by Michael Artin [EoAA] Elements of Abstract Algebra by Richard Dean [PftB] Proofs from the Book by Titu Andreescu and Gabriel Dospinescu [TBGY] Abstract Algebra: The Basic Graduate Year, by Robert Ash Wikipedia
Гораздо больше, чем просто документы.
Откройте для себя все, что может предложить Scribd, включая книги и аудиокниги от крупных издательств.
Отменить можно в любой момент.