Algebra II
Abstract
A continuation of Math 611. Topics covered will include field theory and Galois theory and commutative algebra. Prequisite: Math 611 or equivalent.
1 Organizational
A webpage (http://people.math.umass.edu/~gunnells/alg/alg.html) exists. There will be homework, one midterm, and a final. This course will cover fields, Galois theory, commutative algebra, and hopefully some homological algebra.
Warning: All jokes and conversations are reproduced as best as I can remember and my transcription is not necessarily faithful. In addition, footnotes and some definitions are based on my understanding of algebra and related topics.
2 Fields
2.1 Lecture 1 (Jan 22)
2.1.1 Basics
Definition 1 (Field).
A field is a commutative ring where every nonzero element is a unit.
Example 2.
are all fields. However, is not a field because it is non-commutative1. In addition, is a field.
Example 3.
For a prime , is a finite field.
Example 4.
The field of fractions of any integral domain is a field. An example is the field of fractions of the polynomial ring over a field . The field of fractions of is , the formal Laurent series over .
Definition 5 (Characteristic).
The characteristic of a field is the (positive) generator of the kernel of the unique ring homomorphism2 . Alternately, it is the minimal positive integer such that in .
Remark 6.
Every field contains a prime field (either or ).
Remark 7.
Fields with positive characteristic are not finite in general. For example, consider .
Definition 8 (Field Extension).
is an extension of is is a subfield. We write for this. Alternately, an extension is just a morphism of fields because every morphism of fields is injective.
Example 9.
, , , and are all field extensions.
Definition 10 (Degree of extension).
If is a field extension, observe that is an -vector space. The degree of the extension is the dimension of over .
Basically, all of algebraic number theory is about stuff like this: number fields and whatnot.
Theorem 11.
Let be a field and irreducible. Then there exists in which has a root.
Proof.
Take . This is an extension of and the class of is a root of . □
Remark 12.
In the above theorem, observe that .
Example 13.
Let and . We see that is irreducible by the rational root theorem. Then is a degree extension of and .
Paul proceeded to calculate the image of in and say “It only took me ten times to get this right.”
Example 14.
Now let and . This is clearly irreducible because neither nor is a root, so is the field with elements.
Paul calculated (half of) the addition and multiplication tables, stumbled over his words, and then proceeded to cite commutativity.
Remark 15.
but as vector spaces over . Also, .
Remark 16.
Any finite field is of the form where is a prime power. Also, there is a unique field of order for any prime power . In addition, is cyclic.
Paul remarked that we don’t have the time to prove the above. However, this is easy to prove. He also said that he felt finite fields were glossed over in his education.
Definition 17 (Subfield generated by elements).
Let be a field extension. Let . Then the field is the smallest subfield of containing and .
Definition 18 (Primitive element).
If for some , then is a simple extension and is a primitive element.
Example 19.
Let , and . Observe that the primitive element is not uniquely determined.3
We had a conversation:
- Paul
-
“Am I supposed to stop now?”
- Suki
-
“12:45.”
- Paul
-
“I guess that was when the leaves were on the trees.”
Example 20.
Consider . This is isomorphic to .4
Theorem 21.
Suppose is an extension and irreducible has a root in . Then .
Proof.
We have a morphism that sends . Observe that the kernel contains , so we get a map . This is nonzero, so it must be injective. However, is in the image, so the map must be surjective. □
During the proof of the last theorem, Paul made a comment about linear transformations and how we all thought it was disgusting even though it was the best part of last semester.
In the last 15 minutes, we will point out interesting things about fields. We’ve shown that contains a root of . In fact, the following remark holds:
Remark 22.
Given any root of , then . However, this field does not contain all the roots of in general. If is finite, then this field will contain all the roots.
“Let’s stick with number fields because they’re easier… we have more to play with with that.”
Example 23.
Let . Then contains both roots of . However, contains only one root of .5
Paul spent a long time discussing the second example and its one real and two complex embeddings.6
Example 24.
contains all roots of . The roots are .
The difference between the two examples are explained by Galois theory. Also, no homework has been assigned now and office hours have not been set.
2.2 Lecture 2 (Jan 24)
Recall the idea of a field extension. Now we define an algebraic extension.
Definition 25 (Algebraic Extension).
Let be an extension. Then let . is an algebraic extension if every element of is algebraic over .
If is not algebraic, it’s called transcendental.
Definition 26 (Minimal Polynomial).
Let be algebraic over . Then the minimal polynomial is the lowest-degree monic polynomial over that has as a root.
Proposition 27.
The minimal polynomial is uniquely determined.
Proof.
Suppose is a minimal degree monic polynomial such that . Clearly must be irreducible. Now suppose is any other polynomial with . Then because is Euclidean, we see that . Then we see that , but by minimality of the degree of , . Therefore, . □
Remark 28.
The minimal polynomial depends on both .
Example 29.
The square root of is algebraic over , while the square root of is algebraic over both with minimal polynomial .
Remark 30.
Consider as an extension. Then we see that is countable, so the set of transcendental real numbers is nonempty (in fact, algebraic numbers have measure zero). For example, is transcendental by Lindemann. Another example is .
Paul gave several more examples, but this one is the important one:
Remark 31.
Finite degree extensions are algebraic.7
Proposition 32.
Let and be extensions. Then .
Proof.
Let be a basis for and be a basis for . Then we will show that is a basis for . To see that the products span , write as a linear combination of the and then write each coefficient as a linear combination of the .
Now we check that the products are linearly independent. Suppose we have . Then we can pull back and get . But then each , so , which means that each . □
Remark 33.
The above proposition is also true if some extensions are infinite-degree.
Definition 34 (Finitely Generated).
Let be an extension. Then is finitely generated if there exits such that .8
Lemma 35.
.
The proof of the above lemma is very long and Paul considers it a waste of time.
Theorem 36.
is finite-degree if and only if it is finitely generated by algebraic elements.
Proof.
Assume is finite. Then take an -basis . Then we see that , so . Thus is algebraic. Then .
Now assume . Then we have a chain . Each inclusion is a finite extension, so must be finite by multiplicativity. □
Definition 37 (Compositum).
Let be subfields. Then the compositum is the smallest subfield of containing both .
Proposition 38.
Suppose we have . Then if are finite over , is also finite and .
Proof.
Suppose , where both expressions are for bases over . Then . □
Remark 39.
Equality holds when the products are linearly independent over or .
2.2.1 Straightedge and Compass
Paul believes that people still learn this in high school9 and remarks that this is what numbers meant to the Greeks.10 He then talked about how to construct numbers and mentioned that high schools lack straightedges and compasses11 and send kids to GeoGebra. He then talked about computer help and joked that there must be a theorem that we need to prove.
There are a few things we can do with straightedge and compass:
- 1.
Draw line between two points;
- 2.
Make parallel lines;
- 3.
Make perpendiculars;
- 4.
If you can make , you can make .
Paul then constructed the lengths from .
We can make any number as long as can be made using field operations and square roots.
“The Greeks had plenty of time. No internet, no TV, no Snapchat or whatever, nice weather, plenty of food.”
Theorem 40.
If is constructible, then .
Remark 41.
The converse of the above theorem is not necessarily true.
2.3 Lecture 3 (Jan 29)
2.3.1 Straightedge and Compass Continued
Last time, we considered straightedge and compass constructions, where we can make all numbers in that can be obtained from using field operations and square roots. For example, to construct a regular -gon, we must construct . In addition, we discussed degrees of field extensions formed from constructible numbers.
Some other classical problems12 in ancient Greece were:
- 1.
Doubling the cube: construct the cube root of . This is impossible because is irreducible.
- 2.
Trisecting any angle: construct . Recall that . This gives a cubic polynomial. If , then this is impossible because our cubic is irreducible.
- 3.
Squaring the circle: given a circle, make a square of the same area, i.e. construct the square root of This is impossible because is transcendental.
Paul says this is a nice application of the things we learned13
2.3.2 Spitting Fields
Definition 42 (Splitting Field).
Let and be an extension. If splits into linear factors over but not over any proper subfield of , then is a splitting field of .14
Example 43.
is the splitting field of , but is not a splitting field for .
“In the math department, we don’t do any group hugging like other departments do.”
Theorem 44.
Given any , there exists a splitting field for it.15
Proof.
WLOG assume is monic and irreducible. Then we know that has at least one root of , . Then in , we have and continue by induction to obtain a field extension where splits. Now take the smallest subfield of over which splits. □
Corollary 45.
If is a splitting field of and , then .
Proof.
By construction and multiplicativity of degrees. □
Example 46.
Let , , , and .16 To construct the splitting field , we must adjoin . Thus . In fact, .
The connection between these subfields is explained by Galois theory. We will be spending a lot of time on Galois theory.
Theorem 47.
Splitting fields are unique up to isomorphism. If , and are two splitting fields, then there exists an isomorphism that fixes .
We need a more general theorem:
Theorem 48.
Let be an isomorphism of fields. Let and be its image under . Let be a splitting field for and be a splitting field for . Then extends to an isomorphism .
Proof.
Let . If splits already in , then does over , so this case is trivial. Now assume the result for all with degree less than .
Let be an irreducible factor of of degree at least and be the corresponding factor of . Let be a root of and a root of . Then there exists an isomorphism (remember that ). Now we let and , so we obtain the following commutative diagram:
By induction, we obtain an isomorphism . □
“It’s better to have an example without a theorem than a theorem without an example.”
2.3.3 Algebraic Closure
Definition 49 (Algebraic Closure).
is the algebraic closure of if every splits completely in and in no smaller extension and is an algebraic extension.
Definition 50 (Algebraically Closed).
If every has at least one root in , then is algebraically closed field.
Example 51.
is algebraically closed but is not the algebraic closure of .
Our goal is to prove that every field has a unique algebraic closure. First we will show that every field is contained in an algebraically closed field and then we will take the smallesy subfield of satisfying the definnition.
Proposition 52.
If is an algebraic closure, then is algebraically closed.
Lemma 53.
If and are algebraic, then is algebraic.
“If you take nothing from this lecture besides the fact that I have terrible sweater-shirt combinations, it should be that the quotient of a ring by a maximal ideal is always a field.”
Theorem 54.
Given any , there exists an algebraically closed field containing .17
2.4 Lecture 4 (Jan 31)
2.4.1 Algebraic Closure Continued
Recall the definitions of algebraically closed and algebraic closure from last time. We continue the proof of Theorem 54 from last time.
Proof of Theorem 54.
Build as a union of fields with . Let , which is a polynomial ring with a variable for each monic, nonconstant . Let be the ideal generated by for all nonconstant monic . We show this is a proper ideal. If not, then there exists an expression . Passing to a finite extension such that each has a root in . Then this implies that .
Now let be a maximal ideal and . Then every monic nonconstant polynomial has a root in . may not be algebraically closed, so continue to form a tower of fields, and then let be their union. We claim that is algebraically closed. To see this, observe that every lives in for some . Then has a root in , so it has a root in . □
Corollary 55.
Let be a field and be algebraically closed. Let be . Then is the algebraic closure of .
Proof.
Let . Then where each . In fact, each because it is algebraic. □
Theorem 56.
Let be a field. Then the algebraic closure is unique up to isomorphism.18
2.4.2 (In)separability
An intuitive way of thinking about this is that separable is nice and inseparable is not nice. Separable always happen in characteristic zero, but does not always happen in positive characteristics. Paul briefly mentioned the number field-function field analogy.
Let be a field and be the splitting field of . In we get a factorization . Then is a simple root if it has multiplicity and is a multiple root otherwise.
Definition 57.
A polynomial is separable if it has no multiple roots in the splitting field of .
Example 58.
Consider . Then the splitting field is and is separable.
Consider . This splits in as , so it is separable.
Example 59.
Consider the polynomial . Then this polynomial is inseparable (this is because ).
How can we check for multiple roots? We take the formal derivative. “We aren’t doing calculus here, but polynomials are really all we do in calculus class anyway.” We define an operator that sends a polynomial to its formal derivative. Then this operator satisfies the usual linearity and product rules.
Proposition 60.
is a multiple root of if and only if it is also a root of . In particular, the minimal polynomial of divides both . Thus is separable if and only if it is coprime with .
Proof.
Write and differentiate. □
Example 61.
is separable in characteristic because it is coprime to . In positive characteristic, if , is separable. Otherwise if , then the derivative is zero and every root is a multiple root.
Example 62.
Consider . Then , so there are no roots of and is separable.
Proposition 63.
Let . Then any irreducible over is separable.
Proof.
Suppose . Then the degree of is . But then is irreducible, so it must be coprime to . □
Remark 64.
Proposition 63 is false in general in positive characteristic, but is true for finite fields. This allows us to distinguish finite fields and infinite fields of positive characteristic.19
Proposition 65.
Let be of characteristic . Then the Frobenius endomorphism is injective.
Proof.
It fixes , so it must be injective. □
Corollary 66.
The Frobenius endomorphism is an automorphism for any finite field .20 In fact, every element of is a -th power.
Definition 67 (Perfect Field).
is a perfect field if either or if every element of is a -th power, where .
Proposition 68.
Every irreducible polynomial over a perfect field is separable.21
2.5 Lecture 5 (Feb 5)
2.5.1 (In)separability Continued
Recall the definition of a perfect field and a separable extension.
Proof of proposition 68.
Assume that is irreducible of degree . Then consider . It can happen that . If we want , then . Therefore for some . Becuase is perfect, every coefficient of is a -th power, which means that must be a -th power, so it is not irreducible. □
2.5.2 Classification of Finite Fields
We will classify finite fields. Consider the splitting field of . This polynomial is separable, so must contains exactly roots. This forms a subfield of (just check the field axioms). Therefore, must be exactly the roots of and has order , so . Therefore there exists a finite field of order any prime power.
Remark 69.
where is irreducible. We can show by a counting argument that such exist for all .
However, note that splits completely over any finite field of order (order of the group of units is ). Therefore, finite fields are unique.
Remark 70.
- 1.
We can perform the same construction starting with for any prime power .
- 2.
We can also show that is cyclic.
- 3.
Any finite division ring is a field.
Proposition 71.
Suppose is irreducible and that has characteristic . Then there exists a unique and a unique irreducible polynomial such that .
Proof.
If is separable, then and . Otherwise, the derivative is zero and . Then if is separable, and . If not, we can continue. However, by well-ordering, this process must terminate with . Now we show that is irreducible. If not, then cannot also be irreducible (just replace with in any factorization). □
Remark 72.
are uniquely determined.
Definition 73 ((In)separable Degree).
The separable degree and the inseparable degree .
We see that . Observe that is separable if and only if .
Definition 74 (Purely Inseparable).
is purely inseparable if .
Definition 75 (Separable Extension).
An algebraic extension is separable if all elements are roots of separable polynomials. Otherwise, the extension is inseparable.
Note that if is perfect, then all algebraic extensions are separable. In general, given algebraic, there exists a subfield such that is the largest separable extension of in . If , then has degree . The extension is called purely inseparable.
Example 76.
Consider the field . Let and . Note that , where . Thus is purely inseparable.
Example 77.
Again let . Let . By Eisenstein, this polynomial is irreducible. Then note where . Then .
2.5.3 Cyclotomic Fields
Fix . Then consider , which is algebraic ove . Let be the subfield of containing and is the primitive -th root of unity. We want to write .
We will define a polynomial and show that , , is irreducible, and .
Define be the group of all -th roots of unity. Then clearly is cyclic generated by . If , then generated by . The other primitive -th roots are . Then . Define . Observe that . By construction, the first and fourth properties are true.
2.6 Lecture 6 (Feb 7)
2.6.1 Cyclotomic Fields Wrap-up
Consider and recall the definition of the cyclotomic polynomial.
Theorem 78.
is irreducible with degree .
Proof.
We proceed using induction. Suppose for all . Write . Then and divides over . Thus . Then by Gauss’s lemma, .
To show that is irreducible, assume not and write where is irreducible. Let be a primitive root that is a root of and choose , so is also a primitive root. Then suppose , so is divisible by . Then we work mod and see that , so and have a common factor in and thus has a multiple root mod . However, this is not possible when . Therefore is a root of and similarly, is a root for any coprime to . Thus . □
3 Galois Theory
3.1 Lecture 6 (cont.)
3.1.1 Basics
The motivation behind Galois theory is to understand the structure of algebraic field extensions. Typical questions are:
- 1.
What subfields can we have?
- 2.
Can we understand invariants of them?
- 3.
Suppose we have . Can we construct it?
Our main tool for studying these questions is group theory.
Definition 79 (Galois Group).
Let be an extension. Then is the group of automorphisms of that fix pointwise.
Example 80.
and similarly for .
Example 81.
Let a root of . Then we see that the automorphism group is isomorphic to generated by .
Example 82.
The automorphism group of is trivial.
Example 83.
The automorphism group of is isomorphic to generated by the Frobenius endomorphism.
Example 84.
Let be the splitting field of . Then we can show that .
Question 85 (Inverse Galois Problem).
Is every finite group the Galois group of an algebraic extension over the rationals?
Proposition 86.
Let be an extension with algebraic over . Then if , then is a rot of the minimal polynomial of .
Proof.
Let the minimal polynomial be . Then . □
Corollary 87.
If is irreducible with roots in , then must permute them.
Remark 88.
may act trivially.
3.1.2 Correspondences
Suppose . Let . Then determines a subset defined by the set of elements fixed by .
We can also produce a subgroup corresponding to each subfield. These correspondences are inclusion-reversing.
Theorem 90.
- 1.
If then .
- 2.
Of then .
The proof of this theorem is straightforward. Ultimately, we will identify a class of “Galois extensions” for which these correspondences behave optimally.
Definition 91 (Galois Extension).
Let be a finite extension. Then is a Galois extension of if .
Example 92.
Quadratic extensions of are Galois. So are the extensions of and .
Example 93.
The extension is not Galois and neither is where .
Example 94.
Splitting fields of separable irreducible polynomials are Galois extensions. Thus the splitting field of any irreducible polynomial over a perfect field is Galois. Conversely, any Galois extension is the splitting field of a separable polynomial.
Proposition 95.
Let be the splitting field of a polynomial . Then and equality holds if is separable.
3.2 Lecture 7 (Feb 12)
3.2.1 Correspondences Continued
Last time, we discussed correspondences between subgroups of and fields between and .
We will prove Proposition 95.
Proof of Proposition 95.
Recall the proof of the uniqueness of splitting fields. We had this commutative diagram:
We will show that the number of suitable is at most . We use induction. Then the number of extensions is . Then let be an irreducible factor of of degree greater than . Then let be the corresponding factor of . Let be a root of . Then . Then if is any isomorphism, we can restrict to an isomorphism . Then the following diagram commutes.
Conversely, given any root of , we can make such a diagram. Then is at most . Use induction on the top half of the diagram and the result follows. □
Eventually we see that is Galois if and only if it is a splitting field of a separable polynomial.
Example 96.
Consider for squarefre. Then is an automorphism and the Galois group of this extension is .
Example 97.
Consider the field . Then the automorphisms and are nontrivial and have order . Thus the Galois group is . Here is the subfield lattice.
Here is the subgroup lattice:
Example 98.
Recall the splitting field of . Let be a root of and be a root of . Then . The total degree of this extension is and thus . But then note that that sends is of order , while that sends . However, , so the automorphism group is . The subfield lattice is somewhere earlier in the notes, so I will just include the subgroup lattice:
Remark 99.
Automorphisms in the previous example that act on take it to itself while automorphisms that are nontrivial on the do not preserve it. We will see that this is because is a normal subgroup of but is not.
Our goal now is to prove the fundamental theorem of Galois theory. The idea is a complete characterization of the subgroup and subfield lattices. Today we will prove some of the technical results that we need.
Definition 100 (Character).
Let be a group and a field. Then a character of with values in is a homomorphism of groups (Note that this is completely governed by the abelianization of the group).
Definition 101 (Linear independence).
A collection is linearly independent if there does not exist a linear relation where and the are not all .
Example 102.
Let . Then we see that and are linearly independent (if not, then is constant for all ).
Remark 103.
Any character23 of is of the form for some fixed and any finite subset if linearly independent.
Theorem 104.
Any finite subset of distinct characters is linearly independent.
Proof.
Take a minimal relation of the form where all . Then for all , we have . Then there exists such that . Therefore, for all , .
Thus, . Then we must have for all . But this is a shorter length expression with not all coefficients zero, which contradicts minimality of the original relation. □
If we have a field homomorphism , then this gives a character of .
Corollary 105.
Any distinct field embeddings are linearly independent.
Corollary 106.
Distinct automorphisms of a field are linearly independent.
3.3 Lecture 8 (Feb 14 )
3.3.1 Towards the Fundamental Theorem of Galois Theory
Our goal is to prove the Fundamental Theorem of Galois Theory. Recall the definition of a character and that any finite set of distinct characters is linearly independent. In particular, note that a collection of distinct field embeddings is linearly independent.
Now suppose . Then any finite set of automorphisms is linearly independent.
Theorem 107.
Let be a subgroup of . Let be the fixed field. Then .
Proof.
First suppose that . Then let be an -basis of . Consider the linear system
where . Because there are fewer euqations than variables, there exists a non-trivial solution . Choose arbitrary elements . Then for all . In the linear system multiply the th equation by and substitute .
Now we have the linear system . Adding the equations together, we obtain
Because the are arbitrary, then we can put any element of inside the . Therefore for all , which is a nontrivial linear dependence on the , which is impossible.
Now we suppose that . Then choose linearly independent over and form a linear system
where . There is a nontrivial solution, so let be the solution. We claim that at least one is in (otherwise we have a linear dependence of the using the as coefficients). Now choose a solution with a minimum number of nonzero elements, say . We can assume that .
We will form a new nontrivial solution with fewer nonzero elements. Assume without loss of generality that . Then the system becomes
We will choose such that . Then note that left multiplication by permutes the . Therefore, we apply to our system and renumber. We now have the system
Taking the difference of our two systems, we have the new equation
Because the first coefficient is nonzero, we now have a nontrivial solution with fewer nonzero elements. □
Corollary 108.
If is finite, then . Then equality happens if and only if is the fixed field of .
Proof.
Let be the fixed field. Then by the theorem, . The desired result holds by multiplicativity. □
Corollary 109.
Let be a finite group of automorphisms of with fixed field . Then and is a Galois extension with Galois group .
Proof.
Our assumptions imply that and . Then recall that . Therefore , so they are all equal. □
Corollary 110.
Let be distinct subgroups of . Let be the fixed fields. Then .
Proof.
Suppose . Then fixes , so . Similarly, . Thus they are equal. □
The consequence of these is that taking fixed fields of different subgroups of gives different subfields of over which is Galois.
Theorem 111.
is Galois if and only if is the splitting field of a separable polynomial over . Furthermore, if this is true then any polynomial over with a root in is separable and has all its roots in .
Proof.
We already showed that Galois is implied by splitting field. Now assume is Galois. Then . Write . Let be irreducible with a root . We show all the roots are in . Consider the list . Assume the distinct elements in the orbit are . It must be that . Then is irreducible with root , so is the minimal polynomial of over . Then in . However, in . Therefore is separable and has all roots in .
Now we prove that is a splitting field. Assume is Galois with group . Then choose a basis of over . Let be the minimal polynomials over of the . We know each is separable and has all its roots in . Take to be the of the . We see that is squarefree, so it is separable. We see that is the splitting field. The roots are all in , so the splitting field is a subfield. The are all roots of , so the splitting field is . □
We have seen that the following are equivalent:
- 1.
is a Galois extension of .
- 2.
is the splitting field of a separable polynomial in ;
- 3.
is an extension of such that is exactly the fixed field of ;
- 4.
is an extension of such that ;
- 5.
is a finite, normal, and separable extension of .
3.4 Lecture 9 (Feb 21)
We will finally get to the Fundamental Theorem of Galois Theory.
Theorem 112.
Let be a Galois extension with group . Then there is an inclusion-reversing bijection between subfields of containing and subgroups of . This correspondence takes a subfield to the subgroup fixing it and a subgroup to its fixed field. The bijection satisfies
- (a)
and ;
- (b)
is Galois with group ;
- (c)
is Galois if and only if . In this case . Even if isn’t normal, the isomorphisms of into an algebraic closure that fix are in bijection with the cosets.
- (d)
If correspond to , then corresponds to the subgroup generated by . The compositum corresponds to the intersection . Therefore we have a correpondence between the subgroup lattice and the subfield lattice.
An example is the lattices for the splitting field of over . These are somewhere earlier in the notes. Note that we have proven most of this theorem already.
Proof of Theorem 112.
We have already shown most of this theorem. For example, we showed that the map from subgroups to subfields is injective. To see that is is surjective, choose a subfield and suppose is the splitting field of . Then is Galois and is the fixed field of .
Now we will show (c). Suppose is the fixed field of . Then for any , take to , isomorphic to fixing . Let be an isomorphism in a fixed algebraic closure fixing . Let have minimial polynomial over . Then is another root of . If is the splitting field of , then it is the splitting field of the same polynomial over . Therefore it is the splitting field of over . But . Then by the uniqueness of splitting fields, we have a commutative diagram:
Therefore, any such comes from . When do give the same ? Then , which happens if and only if determine the same coset of . Then the statement of normality follows. Part (d) is easy and is left to the treatment in D&F. □
3.4.1 Computing Galois Groups
We use the following fact:
Proposition 113.
Let be irreducible of degree . Then define , where is the splitting field of . Then and acts transitively.
For example, if , then the only groups are .
Example 114.
Let . Note that has only one real root (derivative is always positive). Therefore, the two complex roots are conjugate, so there is an element of order in the Galois group. Therefore, the Galois group of is .
Example 115.
Let , where . Note that . Then our candidate polynomial is . This is irreducible by Eisenstein with roots . We need to see whether . We see that and that , so all roots are in . Therefore is the splitting field of . Then we see that either or . Then the automorphism that takes has order , so the group is .
Example 116.
Consider . This is irreducible by Eisenstein. Then take and a primitive twelfth root of unity.We see that the roots are . We determine if is the splitting field. This is true if and only if the field contains , which is true (). Thus the extension has degree and is either or .
3.5 Lecture 10 (Feb 26)
There is an exam on March in the evening. Topics will be announced later.
We finish the computation of the Galois group of . Observe that complex conjugation is an automorphism of the extension. Then there exists another that sends . This has order , so the Galois group is .
Note that if we set , then this problem becomes must harder.
Example 117.
Let and consider . Note that . Then we see that is the splitting field, so the Galois group has order . must have at least three subgroups of order , so it can only be or . We can find an element of order , however (), so .
Now if we try with prime, we get Galois groups:
-
;
-
] ;
- Order
-
;
- Order
-
.
Note that the order group is the almost direct product of .
3.5.1 Finite Fields
Recall that we can construct for all , which is Galois. We will show that is cyclic of order .
Proposition 118.
and is generated by the Frobenius element.
Proof.
Consider orders of the Frobenius element. This is left as an exercise to the reader. □
Now we can consider a subextension where . This has Galois group .
Proposition 119.
is cyclic.
Proof.
This is left as an exercise. Just consider the elements of order dividing for . □
Remark 120.
The fact about roots you need to prove the previous proposition leads to the Miller-Rabin primality test.
Now recall that is simple if it is generated by a primitive element.
Corollary 121.
is simple. This implies that there exists an irreducible polynomial of degree over .
Proof.
Take a generator of the group of units. This generates the field extension. □
Remark 122.
is the product of all irreducible polynomials of degree . This will allow us to count the irreducible polynomials.
3.6 Lecture 11 (Feb 28)
Last time we proved that all finite fields are simple extensions of .
Example 123.
Let . Then and .
To count irreducible polynomials over , we use Möbius inversion. Recall the Möbius function from number theory. Consider on the positive integers. Then suppose .
Theorem 124 (Möbius Inversion).
.
Let be the number of irreducible polynomials of degree over . Then note that . Therefore, , so . We can prove that , but it’s not clear that it is an integer.
Now we consider the algebraic closure , whic is infinite. Note that the subfields are ordered by divisibility.
3.6.1 Primitive Elements
Our goal is now the primitive element theorem:
Theorem 125.
If is finite and separable, then it is simple.
Proposition 126.
Suppose is Galois and let be any extension. Then is Galois with .
Proof.
We see that is the splitting field of . Then and is the splitting field of . Thus is Galois.
Consider the map given by restriction. Then fixes , so it fixes . Note that the kernel is all that restrict to the identity. Then is the identity on and fixes by construction, so is the identity on the composite. Therefore, is injective. Let be the fixed field of the image. Then However, it must be a subfield of , so it must be equal to . □
Corollary 127.
.
Proof.
We know that , so
□
Proposition 128.
Let be Galois extensions of . Then and are Galois. The Galois group of is
Proof.
Suppose is irreducible with a root in . Then all roots of are in both , so is finite, normal, and separable. Now suppose is the splitting field of separable polynomials . Then is the splitting field of the separable polynomial , so it is Galois.
Now consider the map given by the product of the restrictions. First we see that this is injective. This is because anything in the kernel is trivial on both , so it is the identity on the composite. Clearly, the image is in because the restrictions of to agree on . To find the order, we see that . On the other hand, . □
A partial converse is that if , then where is the fixed field of .
Corollary 129.
Let be finite and separable. Then there exists a Galois extension such that any Galois extension of containing is an extension of .
Proof.
Take an -basis of . Take their minimal polynomials and the composite of the splitting fields to take a Galois extension. Then take the intersection of all Galois extensions of containing to get the Galois closure. □
Example 130.
.
3.7 Lecture 12 (Mar 5)
The exam will be in LGRT from - covering everything through section .
From last time, our goal is to prove the primitive element theorem.
Proposition 131.
Suppose is finite. Then if and only if there are only finitely many intermediate fields .
Proof.
Let . Let be the minimal polynomial and be a subfield. Then let be the minimal polynomial of in . Clearly in . Let be the field generated by the coefficients of . Then and the minimal polynomial of over is still . Therefore , so . Therefore subfields of correspond to different monic fractions of , of which there are only finitely many.
Now we assume there are only finitely many intermediate fields. We may also assume is infinite. We show that a primitive element exists for , which is sufficient by induction. Consider the fields . Given that there are only finitely many intermediate fields, there exist such that . Then we see that , so . □
We will now prove the finite element theorem.
Proof of Theorem 125.
Take the Galois closure of . Then is finite, which means there are only finitely many subfields between and . In particular, there must be only finitely many subfields between and . Now use the proposition. □
3.7.1 Cyclotomic Fields
Let be a primitive th root of unity. Then recall the th cyclotomic polynomial , which is irreducible of degree .
We will show that is Galois with . Define a morphism given by . Analyzing this, we see that this is an isomorphism. Paul claims that this is not canonical.
Example 132.
Consider . Then . The subgroups have order . Therefore the subgroup lattice is:
The subfield lattice is:
Now suppose is an odd prime and let . We can define . This is invariant under and generates the fixed field of . Note that this does not in general because the primitive th roots need not be linearly independent over .
Example 133.
Let . Then note that is generated by . Then the fixed field is clearly real. To find the generator, note that . Then recall that . Using these facts, it is easy to see that satisfies .
Also, we can see that . Then it is straightforward to find the minimal polynomial, which is quadratic of discriminant .
Now recall that is multiplicative. Then we will see that is the compositum of the .
Theorem 134 (Kronecker-Weber).
If is Galois with abelian Galois group, there exists such that .
Example 135.
if .
Remark 136.
This theorem is false if is replaced by any other ground field. Find an explicit example is an open problem, but we do have a classification of abelian extensions of a number field.
Remark 137.
- 1.
We can show that any finite abelian group appears as a Galois group over . The proof is to see as a quotient of for some .
- 2.
To construct an -gon, we need to make using our straightedge and compass. This is possible if and only if has order . Then is the top of a tower of a series of quadratic extensions. Therefore is a power of . This means that , which means that where a Fermat prime. Only Fermat primes are known: .
3.8 Lecture 13 (Mar 19)
Recall that the Galois group of a polynomial is the Galois group of its splitting field.
Proposition 138.
Suppose is irreducible and separable of degree . Then acts transitively on the roots.
Proof.
Let be two roots. Then , so if is the splitting field, then this isomorphism extends to an automorphism of . □
This implies that and the image acts transitively on the roots.
Example 139.
If , the possible Galois groups are and .
If , the possible Galois groups are .
Remark 140.
and . For the only normal subgroup of is and is simple for .
Note that if is reducible, then is not -transitive, but injects into a product of symmetric groups corresponding to each irreducible factor.
The general principle is that the generic irreducible over of degree has Galois group . We can’t prove this because we can’t make this notion precise for now.
Let be variables. Then is the generic polynomial of degree . This is a polynomial in . Denote . Recall the elementary symmetric functions. Then . Now consider . Now we have a field extension . Also, is the splitting field of and acts on the and fixes the . Thus the fixed field of contains , so the extension is Galois with Galois group .
Corollary 141.
If is symmetric, then is a rational function in the .
Proof.
, so it must be rational in the . □
Remark 142.
If is symmetric, then . Note that this is not true for the power basis.
Now let be indeterminates and consider . Suppose are roots of .
Proposition 143.
There are no polynomial relations over among the .
Proof.
Suppose . Let . Then is symmetric and . Therefore we obtain a relation on the with -coefficients, which is impossible. □
This shows that if the coefficients of a polynomial are indeterminates, then so are its roots. The converse is also true (proved later in the text).
Theorem 144.
The polynomial is separable with Galois group .
Note this is not enough to say that generically the Galois group is because that statement depends on the base field . For , this works. However, if is finite, this does not work.24
Now consider . Then there is a quadratic extension of corresponding to . Now consider the discriminant and , which is not -invariant but is -invariant.25 Thus (Here we assume ).
Now we can define the discriminant of a polynomial with roots . Then and if , then .
3.9 Lecture 14 (Mar 21)
Last time we discussed the discriminant of a field. We look at . If , then . Then the discriminant is . If is a rational square, is reducible. Thus the Galois group is if and only if is irreducible, and if and only if is reducible.
Let . If is reducible, it factors into either three linear factors or a linear and quadratic factor. The Galois group is either trivial or . Now suppose is irreducible. Then is -transotive, and the Galois group is determined by the discriminant.
Consdier . Take the transformation , which kills the quadratic term. This gives a polynomial . This translation preserves differences of roots, so it preserves the discriminant. We calculate the roots. Note that , and we can compute that this is eaual to .
If is a square, then the Galois group is , otherwise, .
Example 145.
Let . The discriminant is . On the other hand, the discriminant of is .
Now consider . If is reducible, we have the following cases:
- •
linear factors:
- •
quadratic factor, linear factors:
- •
cubic factor and linear factor: or
- •
quadratic factors: or
If is irreducible, the possible groups are:
- •
;
- •
(normal);
- •
;
- •
(normal);
- •
;
We need to be much more clever to compute the discriminant. We can always kill the cubic term by the transformation . Thus we can take . To compute the discriminant, we use the resolvent cubic. Let be the roots of . Set
Each is stabilized by exactly one of the three conjugate . Thus stabilizes all . Also, all elementary symmetric functions of the are fixed by . These are . Define the resolvent cubic to be . We can show that have the same discriminant.
Now we analyze .
- 1.
If is irreducible, then or .
- (a)
If , then and divides the size of . Thus .
- (b)
If , then and divides the order of . Thus .
- (a)
- 2.
is reducible.
- (a)
has linear factors. Then , so and thus .
- (b)
has a linear factor and a quadratic factor. Then (WLOG) is rational. Thus fixes byt not , so and . Then either or . Consider , but . The different intersections reflect the behavior of considered as a polynomial over . If is irreducible, . If is reducible, then .
- (a)
Example 146.
Let . The resolvent cubic is .
Example 147.
For more examples (with examples), go to www.lmfdb.org/NumberField/?degree=4
3.10 Lecture 15 (Mar 26)
There is only about a week and a half left of Galois theory.26 The section concludes with the fundamental theorem of algebra. There is no proof of this fact that does not use topology or analysis. Gunnells says a better proof is the one using Liouville’s theorem.
3.10.1 Solvable and Radical extensions
Recall that is solvable if there exists a chain of subgroups such that is cyclic. IF is solvable, then quotients and subgroups of are solvable. Also, if are solvable, then so is .
Example 148.
is solvable: . Also, is solvable: . Also, any finite abelian group is solvable.
Example 149.
is not solvable for because is simple.
The term “solvable” comes from Galois theory. We will see that a polynomial is solvable in radicals if and only if its Galois group is solvable.
Example 150.
In degrees there are formulas for the roots of in terms of the coefficients.27
Definition 151 (Simple Radical Extension).
is a simple radical extension if for some .
Observe that a simple radical extension is Galois if and only if it is a splitting field of . Therefore must contain the -th roots of unity.
Proposition 152.
Let have characteristic prime to and suppose . Then is cyclic and divides .
Proof.
We know the group is Galois. Then fix a root and let . Therefore . This gives a map . This is clearly a homomorphism, which proves the result. □
Proposition 153.
Any cyclic extension of degree over a field with with is of the form for some .
Proof.
Let be such and extension and . For any and , we define the Lagrange resolvent
We note that . Also, . Therefore . We know that are linearly independent, so . Also . Therefore if is primitive, but not any subfield. Therefore . □
We now assume the characteristic of is .
Definition 154 (Solvability in Radicals).
Let be algebraic over . We say can be solved in radicals if there exists a tower where .
Definition 155.
A polynomial can be solved in radicals if all of its roots can be.
Theorem 156.
can be solved in radicals if and only if is solvable.
Lemma 157.
If is in a root extension, then is contained in a root extension Galois over .
Proof.
Let be the Galois closure of over . If , we get is still a root extension. We will take the compositum of the Galois conjugates of . We need to show that the compositum of two root extensions is a root extension. This follows by induction on each chain of extensions. We conclude that and we can assume that is Galois.
We need successive extensions to be cyclic. Let containing for large enough. Now we take the compositum . We get . Also is Galois because it is the composite of two Galois extensions. We can see that is a root extension. At each step, the Galois groups are cyclic. □
Proof of Theorem 156.
Assume is solvable in radicals. Then make the root extensions, take the Galois closure, and apply the lemma. Then use the fact that quotients of solvable groups are solvable to get that the splitting field of is solvable. □
3.11 Lecture 16 (Mar 28)
We finish the proof of Theorem 156 from last time.
Galois group is solvable implies polynomial is solvable.
Suppose the Galois group is solvable. Then we take the splitting field of and take the fixed fields . We know that is cyclic and set . Then choose a large enough cyclotomic extension, so we take . Therefore is cyclic of degree dividing . Thus the roots of can be solved in radicals. □
Remark 158.
There shows that there do not exist formulas in radicals for an extension with Galois group . However, if we allow things like modular forms, formulas exist. See Felix Klein’s Lectures on the Icosahedron.
We are now almost done with Galois theory, which brings Paul great sadness.
3.11.1 Galois groups over
We will leverage28 the relationship between and . Let be separable of degree . Then let . We know . Then each determines a cycle type (conjugacy class), which is a partition
Now take the discriminant of . If , then , so is not separable mod . Then implies that , so is separable.
Proposition 159.
Suppose when reducing mod . If has degree , then contains an element of cycle type .
This follows from
Theorem 160.
Let not divide the discriminant of . Then .
We vary and consider the collection of cycle types.
Example 161.
Consider .
| cycle type | |
|---|---|
| 2 | 3 |
| 3 | 3 |
| 5 | 2 1 |
We see the Galois group is .
Example 162.
Consider .
| cycle type | |
|---|---|
| 2 | 3 2 |
| 3 | 5 |
| 5 | 5 |
| 7 | 3 2 |
| 11 | 5 |
| 163 | 2 1 1 1 |
We see the Galois group is .
Now there are many possible cycle types that can apear in the list. Do all possible cycle types appear in the list?
Theorem 163.
All possible cycle types appear. The Chebotarev density theorem implies the following: Let be a cycle type in . Let , where and is the number of elements of with cycle type . Then
In other words, the natural density of the cycle type equals the probability that a group element has that cycle type.
We take primes less than , of which there are .
Example 164.
Consider .
| cycle type | frequency | probability |
|---|---|---|
| 1 1 1 | 13032 | 0.16602 |
| 1 2 | 39310 | 0.50078 |
| 3 | 26155 | 0.3332 |
Example 165.
Consider .
| cycle type | frequency |
|---|---|
| 1 1 1 | 26153 |
| 1 2 | 0 |
| 3 | 52344 |
Example 166.
For , the cycle type 1112 appears times, or . For , with irreducible, the only possible groups are .
4 Commutative Algebra
The goal is to develop enough commutative algebra to study algebraic geometry and algebraic number theory. For a better treatment of the algebraic geometry/commutative algebra, see my notes for Jenia’s class.
4.1 Lecture 17 (Apr 02)
Definition 167 (Noetherian Ring).
is a Noetherian ring if it satisfies the ascending chain condition.
Recall that every nonzero chain of ideals contains a maximal ideal. This normally requires Zorn, but becomes automatic for Noetherian rings.
Example 168.
If is Noetherian, then is Noetherian. In particular, If is a field, then is Noetherian.
Theorem 169.
The following are equivalent:
- 1.
is Noetherian.
- 2.
Every nonempty set of ideals ordered by inclusion contains a maximal element.
- 3.
Every ideal is finitely generated.
Definition 170 (-algebra).
is a -algebra if it is a ring and there is an injection to the center of .
Example 171.
Consider the polynomial algebra . This an infinite dimensional vector space but a finite dimensional algebra.
Proposition 172.
is a finitely generated -algebra if and only if there exists a surjective map of -algebras for some .
Proof.
Let be generators. Then consider the map given by . On the other side, if there is a surjective map, the images of the generate . □
Now let be a field and be the affine -space over . Then can be viewed as a -valued function on .
Definition 173.
is the coordinate ring of where each serves as a coordinate function on .
Definition 174.
is an affine algebraic set if there exists such that . We write .
Example 175.
If consists of a quadratic polynomial in variables, the is a quadric surface.
Note that depends on the field, even though might make sense over many fields.
Example 176.
Consider and . Then over we get a line, over we get the plane, and over we get a set of points.
Example 177.
If then is a plane curve. In general if contains element, we call a hypersurface.
We can check the following results:
- 1.
If then ;
- 2.
If generates the ideal , then .
- 3.
.
- 4.
Let be ideals. Then .
- 5.
and .
We now have a map . However, this is not injective.
Example 178.
.
Proposition 179.
is the intersection of finitely many hypersurfaces.
Proof.
for some ideal , which is finitely generated by Noetherianness of . Then is the intersection of the hypersurfaces given by the generators. □
We have a map in the other direction from sending an affine variety to the ideal of all functions that vanish on it. This map is not surjective. We determine the image of . We will answer the question in the case when is algebraically closed.
Definition 180.
Let be an affine variety. Then the quotient is called the coordinate ring of .
Morally, we want to be the set of polynomial functions on . These come from restricting polynomials from to (and the kernel must be ). We see that subsets and quotients are dual notions.29
The next question we want to answer is when two affine varieties are isomorphic. First we need to define what a morphism is.
Definition 181.
A morphism, or regular map, between two affine varieties is a function given by polynomial functions. In other words, there exist polynomials such that .
Now that we have the notion of a morphism, we can define an isomorphism in the usual way. Next time we will prove that two affine varieties are isomorphic if and only if their coordinate rings are isomorphic.
4.2 Lecture 18 (Apr 04)
Last time we discussed some basic algebraic geometry.30 Given two affine varieties , a map induces a pullback . Verifying that this construction is well-defined is omitted from these notes.31 In fact, the pullback is a map of -algebras. The converse to this construction is that for any -algebra homomorphism , we have a corresponding morphism of varieties .32
Theorem 182.
There is a bijection between regular maps and -algebra morphisms given by the pullback. This is a contravariant functor that gives an equivalence of categories between affine varieties and finitely generated -algebras with no nilpotent elements.33
Example 183.
Consider , and let be given by . Then the pullback sends to , so the map is a bijection but not an isomorphism.34
Paul proceeded to talk about the difference between the origins in topologically. For reference, see Milnor’s Singular points on complex hypersurfaces.
4.2.1 Radical ideals
We know we have the correspondence between ideals and affine varieties and the correspondence in the other direction. There are not bijections. In particular, in general. There is a relation between the two ideals though.
Definition 184.
The radical of is the ideal . The radical of is called the nilradical, and is called radical if .
Example 185.
The radical of is .
Example 186.
The nilradical is the set of nilpotent elements of .
Proposition 187.
- 1.
is an ideal contining .
- 2.
descends to the nilradical of .
- 3.
has no nonzero nilpotents if and only if is radical.
4.3 Lecture 19 (Apr 09)
Last time we stated Proposition 187. The proof is obvious (just use the binomial theorem for the first part, and the the other parts follow).
Proposition 188.
where runs over all prime ideals containing .
Proof.
We pass to the quotient and prove the analogous theorem for the nilradical. If is in the nilradical, then , so is in any prime ideal. Now if is not in the nilradical, then consider all ideals not containing any positive power of , which includes the zero ideal. Then contains a maximal element by Zorn (upper bound is union). Then this maximal element is prime. □
Corollary 189.
All prime ideals are radical.
Proposition 190.
Suppose is Noetherian and let be an ideal. then for some , we have . In particular, the nilradical is a nilpotent ideal.
Proof.
Choose generators for the the radical. Then each generator has , so if is large enough, all -ary products of the generators will be in . □
Recall for an affine variety. We see that the nilradical of is trivial because every element of is a function on . Therefore the correspondence has target radical ideals. However, is still not surjective in some cases (for example ). If , then this works.
Theorem 191 (Nullstellensatz).
If is algebraically closed, then is exactly the radical ideals. Equivalently, . We have a bijection between affine varieties and radical ideals.
4.3.1 Zariski Topology
We take for granted the notion of a topology.
Definition 192.
The Zariski topology on is given by defining the closed sets to be affine varieties.
Remark 193.
The Zariski topology is course and not Hausdorff.
Remark 194.
The Zariski topology on an arbitrary affine variety is the subspace topology from the Zariski topology on .
4.4 Lecture 20 (Apr 11)
Recall the Zariski topology from last time. The Zariski topology on any affine variety is the subspace topology inherited from . We also know that regular maps are continuus in the Zariski topology. The Zariski closure and density are defined as usual for topology.
Proposition 195.
Let . Then .
The proof of this is clear.
Proposition 196.
Let be regular and be the pullback. Then
- 1.
;
- 2.
The Zariski closure of is .
For proof of this, see my notes for Jenia’s class.
Define an reducible/irreducible affine algebraic set in the usual way. Then define an algebraic variety to be an irreducible affine variety.35
Proposition 197.
is an algebraic variety precisely when is prime.
Corollary 198.
is a variety if and only if is an integral domain.
Definition 199.
The function field is the field of fractions of .
Note that this is a coarser invariant than the coordinate ring. Also, functions in are not defined on all of .
Recall that for a field extension a subset are algebraically independent over if for all . A transcendence base for is a maximal algebraically independent subset, and the transcendence degree is the cardinality of the transcendence base.
Definition 200.
The dimension of is the transcendence degree of over .
Example 201.
The dimension of is .
4.4.1 Integral elements and Integral Closure
Definition 202.
Let .
- 1.
is integral if it is a root of some monic polynomial over .
- 2.
is integral if every is integral over .
- 3.
The integral closure of in is the subset of all elements integral over .
- 4.
is integrally closed in if it equals its integral closure in . If is an integral domain, it is integrally closed (or normal) if it is integrally closed in its field of fractions.
Example 203.
is integrally closed in .
Example 204.
is the integral closure of in for any number field .
4.5 Lecture 21 (Apr 16)
We continue our discussion of integrality.
Proposition 205.
The following are equivalent:
- 1.
is integral over .
- 2.
is a finitely-generated -module.
- 3.
for a subring that is a finitely generated -module.
Proof.
First we show . Suppose we have a polynomial . We know that is generated by and , so must be finitely generated.
To show , take . Finally, to show , let be a generating set for . Then , so for . Therefore we have a system of linear equations
for . We use Cramer’s rule, and get that the matrix has determinant , which gives a monic polynomial with as a root. □
Corollary 206.
- 1.
If and are integral over , then are integral over .
- 2.
The integral closure of in is a subring.
- 3.
Integrality is transitive.
Proof.
We know are finitely generated, and thus so is . This gives the first two parts.
For the last part, take . Then we can find monic with . Then each coefficient is integral over , so we can take , which is finitely generated. Thus is integral over . □
Corollary 207.
The integral closure of in is integrally closed in .
Definition 208.
Let be a morphism and be ideals.
- 1.
If , then the extension of to is .
- 2.
If , then the contraction to is the ideal .
If is injective, then we know and , but these do not have to be equalities. Also, if is prime, then its preimage is prime in . This is not necessarily true if is maximal. Also, if is prime, is not necessarily prime (for an example, consider splitting of rational primes in number fields).
Theorem 209.
Suppose is an integral extension.
- 1.
Assume is a domain. Then is a field if and only if is a field.
- 2.
Suppose is prime. Then there exists a prime ideal with . Then is maximal if and only if is maximal.
- 3.
(Going up theorem). Suppose we have an ascending chain of prime ideals . Then suppose we have a chain , where are prime and for . Then we can extend the chain to get with .
- 4.
(Going down theorem). This is the same as going-up but with descending chains.
Proof.
- 1.
Suppose is a field and is nonzero. Then . We can write , where . We can assume . Then we can find an inverse for .
Now suppose is a field. Then we know , is integral, so we can wirte . Multiplying by , we see that .
- 2.
This is proven in the text, so we omit the proof. We verify the maximal statement. Consider . Then we induce an integral extension on the quotients, and then use the first part to get the desired result.
- 3.
We check that we can extend by , so consider . Consider . Then is integral and is prime in . By part , there exists, prime with . Lifting to , is lifted to a prime with .
- 4.
This is left as an exercise.
□
Definition 210.
The ring of integers of a number field is the integral closure of in .
Proposition 211.
is in if and onlf if its minimal polynomial of over has coefficients in .36
Proof.
If the minimal polynomial is integral, then clearly . Assume is integral in and let be the minimum degree polynomial with as a root that is monic. If is not irreducible, then and by Gauss. This contradicts the minimality of the degree of , so is irreducible and thus the minimal polynomial. □
Theorem 212.
Let be a number field of degree . Then
- 1.
is Noetherian.
- 2.
is a free -module of rank .
- 3.
Given , there exists such that .
- 4.
If is a -basis of , then there such that are a -basis of a rank free submodule of . Moreover, any -basis of is a -basis of .
4.6 Lecture 22 (Apr 18)
We begin by proving Theorem 212.
Proof of Theorem 212.
We prove the third part. Take and let with a root. Choose large enough to cleaer all denominators, and then multiply both sides by . Rewriting the polynomial in terms of , we see that is integral over .
Now to prove the fourth part, choose and choose large enough such that . Because they are linearly independent over , they must be linearly independent over . Therefore they generate a rank submodule of . To see that is torsion-free we show it is contained in a finitely generated free -module. Let be the Galois closure, so we show that is contained in a finitely generated -module, so let be the -basis of . Clear denominators and we can assume .
Choose and define by . Recall that the trace is a map onto . This is not the zero map, so we have a morphism . This is injective, so every linear form on is a trace. Let be the dual basis. Now choose . We know that because . Thus is contained in a finitely generated -module, which is free. Therefore is free with rank at most . We showed contains a module of rank , so its rank is .
We finally show is Noetherian. Any ideal is a -submodule of a free module of rank , so it is free with finite rank and is thus finitely generated as an ideal. □
Definition 213.
A -basis of is called an integral basis.37
Definition 214.
is monogenic if there exists such that .
Example 215.
Any quadratic number field and any cyclotomic field is monogenic.
Example 216.
The field generated by the polynomial is not monogenic, due to Dedekind.
4.6.1 Nullstellensatz
Recall the and constructions.
Theorem 217.
and are inverse bijections between affine algebraic sets and radical ideals.
Lemma 218 (Noether Normalization Lemma).
Let be a field and a finitely generated -algebra. Then there exist some algebraically independent elements such that is integral over .38
Proof.
If the generators are algebraically independent, we are done. Otherwise, find a polynomial relation among the : where . Consider as a polynomial in with coefficients in . We assume is nonconstant. We take new variables , where is the degree of . Set .
Then we set . We observe that has the form , where .
Now set . Then we know is integral over and we know each is integral over , so is integral over . By induction on , we get the desired result. □
4.7 Lecture 23 (Apr 23)
We continue the proof of Noether normalization in last Thursday’s notes.
Example 219.
Let . Then we have , so . We see , so . We can write . Thus is integral over .
Now we prove the following:
Theorem 220 (Algebraic Nullstellensatz).
An ideal is maximal if and only if .
Proof.
If is maximal, consider , which is a field. Then is generated by the images of the . However, it must be a field, so there are no variable generators by Noether normalization. Then is integral over , so it is an algebraic extension. is algebraically closed, so . Therefore each maps to a constant, so . Thus contains , so it must equal . □
Theorem 221 (Nullstellensatz).
if is algebraically closed. Moreover, give bijections between affine algebraic sets and radical ideals.
Proof.
For proof, see my notes to Jenia’s class. Alternatively, see Reid. □
4.7.1 Localization
Theorem 222.
Let be a commutative ring with identity and be a multiplicative subset. Then there exists a commutative ring and a map such that if is a map of rings and , then there exists a unique map that makes the following diagram commute:
Proof.
Define localization in the usual manner. Define , where if for some . □
Corollary 223.
- 1.
, so is injective if and only if and no zero divisors are in .
- 2.
if and only if if and only if contains nilpotent elements.
Example 224.
The first example is the field of fractions of an integral domain. Also, we can localize at some nonzero ; we write . Note that if is nilpotent, . Additionally, if is not nilpotent, then . We can show . We have an injection is is a domain.
Example 225.
Let be a prime ideal. Then is a multiplicative subset. We write . If , then . On the other hand is the set of all rationals whose denominators are not divisible by .
4.8 Lecture 24 (Apr 25)
There will be no more homeworks because we do not have time to collect and grade it. There will be final exam review on Tuesday. The final exam will be on May 9 at 1 PM in the usual classroom.
We will consider the ideals in a localized ring. Consider ideals . Denote the extension of as and the contraction of as .
Proposition 226.
- 1.
;
- 2.
.
- 3.
Prime ideals not intersecting with are in bijection with prime ideals in given by extension and contraction.
- 4.
If is Noetherian then is Noetherian. The same holds with Noetherian replaced with Artinian.
Why is this called localization? We consider thie geometrically.
Definition 227 (Local Ring).
A commutative ring with a unique maximal ideal is called a local ring.
Consider . By the Nullstellensatz, points in correspond exactly to maximal ideals in . Consider for a prime ideal. Then
- 1.
This is a local ring with unique maximal ideal .
- 2.
The prime ideals in are exactly the prime ideals contained in .
Note that the prime ideals in are exactly the varieties containing , the variety cut out by . Geometrically, corresponds to the functions that do not vanish identically on . If is maximal, then sees all algebraic sets passing through the corresponding point.
4.8.1 Discrete Valuation Rings
Definition 228 (Discrete Valuation).
Let be a field. A discrete valuation on is a map satisfying:
- 1.
is surjective.
- 2.
.
- 3.
.
By convention, the valuation of is .
The valuation ring is .
Example 229.
Let . We fix a prime . We define , where , where does not divide . The valuation is simply .
Example 230.
Consider . The valuation is the highest power of dividing the power series, and the valuation ring is .
A valuation gives rise to a metric on . To do this, choose a real number . Assume . Then define .
Example 231.
For example, consider on . Take .39 We see that are close if their difference is divisible by a large power of .
We can now take the completion of with respect to this distance and we recover , the -adics, which are distinct from , which corresponds to .
Remark 232.
This construction can be done for any prime to construct the -adics. The original valuation extends to , and the valuation ring is , the -adic integers, which were constructed as a limit in the homework last semester.
Theorem 233.
The following are equivalent:40
- 1.
is a DVR.
- 2.
is a PID with a unique nonzero maximal ideal.
- 3.
is a UFD with a unique irreducible element up to units.
- 4.
is a Noetherian local domain with unique maximal ideal nonzero and principal.
- 5.
is a Noetherian local integrally closed domain with a unique nonzero prime ideal.
Proposition 234.
Let be Noetherian integrally closed domain and a minimal nonzero prime. Then is a DVR.