Field theory and polynomials Proof
Proof of the uniqueness of the algebraic closure
Builds on FieldAlgebraic closureAlgebraic extensionAlgebraic elementAlgebraically closed fieldSubfieldField generated by adjoining elementsRing homomorphismMinimal polynomial of an algebraic elementThe minimal polynomial is irreducibleRoot of a polynomialUniversal property of the polynomial ringKernel of a ring homomorphismK[x] is a Euclidean domainEuclidean domains are principal ideal domainsIn a PID a nonzero element is irreducible iff it generates a maximal idealMaximal idealFirst isomorphism theorem for ringsK(a) is isomorphic to K[x] modulo the minimal polynomialPartial orderChainUpper boundZorn's lemmaMaximal elementProof by contradictionRing homomorphisms from a field are injectiveFactor theoremMathematical induction
Proof
Let and be algebraic closures of the field . First we extend embeddings by one element.
- Let be a subfield of containing , and a ring homomorphism with for . Let .
- Since is algebraic, some nonzero has . As , is algebraic over .
- Let be the minimal polynomial of over . It is irreducible in , so .
- Let be the polynomial obtained by applying to the coefficients of . It is monic of degree .
- Since is algebraically closed, has a root .
- By the universal property of the polynomial ring, , , is a ring homomorphism. Its kernel contains , so it contains .
- The kernel is not , since . The ring is a Euclidean domain, hence a PID.
- Since is irreducible, is a maximal ideal by the theorem on principal ideal domains. So the kernel of equals .
- By the first isomorphism theorem, is an injective ring homomorphism .
- By the structure of simple extensions, is a ring isomorphism , where is the generated field.
- Composing, , , is a ring homomorphism. On constants it gives , so extends .
Now we apply Zorn's lemma.
- Let be the set of pairs as in Step 1. Write when and restricts to on .
- This relation is reflexive, antisymmetric and transitive, so is a partially ordered set. It is nonempty, since it contains with its inclusion map into .
- Let be a chain in . If is empty, then with its inclusion map is an upper bound. Assume is nonempty, and let be the union of the fields with .
- Any two elements of lie in a common from , since is a chain. So is a subfield of containing .
- For , set for any with . Two such pairs are comparable, so does not depend on the pair.
- Any two elements of lie in one from , so preserves sums and products. So , and it is an upper bound of .
- By Zorn's lemma, has a maximal element .
- Suppose , for contradiction, and pick . Steps 1 to 11 give above and different from it. This contradicts maximality, so .
Finally we show that is an isomorphism.
- The map is injective, so it is a ring isomorphism from onto the subfield of . Also for every .
- The field is algebraically closed. Indeed, let with . Applying to its coefficients gives of the same degree.
- Then has a root , and applying to gives .
- Every nonzero is a product of a constant and factors with . This follows by induction on from Steps 21 and 22 and the factor theorem.
- Let . Since is algebraic, has a minimal polynomial , and .
- By Step 23, with , since is monic. Evaluating at in the field gives .
- So for some , and . Thus is surjective, and is a ring isomorphism fixing .
Idea
An embedding of a subfield of into over extends to one more element, by sending it to a root of the image of its minimal polynomial. Zorn's lemma gives an embedding of all of . Its image is algebraically closed, and every element of is a root of a polynomial that splits over the image, so the embedding is onto.
Reading path
To understand this page from the ground up, read these 145 pages in order. The foundations come first. The path takes the proofs Proof of cancellation in an integral domain, Proof that ring homomorphisms from a field are injective, Proof of the commutativity of addition by induction, Proof of the universal property of the polynomial ring, Proof that R[x] is an integral domain iff R is, Proof of the double negation law by a truth table, Proof of the first isomorphism theorem for rings, Proof that a ring homomorphism is injective iff its kernel is zero, Proof of the degree of a product over an integral domain, Proof of strong induction from ordinary induction, Proof of the correspondence theorem for rings, Proof that R/M is a field iff M is maximal, Proof that the only ideals of a field are zero and the whole field, Proof of the remainder theorem, Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial, Proof of Zorn's lemma, Proof of the well-ordering principle from strong induction, Proof that the minimal polynomial is irreducible, Proof that the minimal polynomial divides every polynomial vanishing at the element, Proof that K[x]/(f) is a field iff f is irreducible, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof of the factor theorem, Proof that Euclidean domains are principal ideal domains, Proof of the universal property of the quotient ring, Proof that K[x] is a Euclidean domain.
- Definition by recursion concept
- Element definition
- Group concept
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Proof of Zorn's lemma proof
- Proposition concept
- Set definition
- Ring definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Predicate definition
- Family of sets definition
- Ordered pair definition
- Commutative ring definition
- Polynomial ring definition
- Ring homomorphism definition
- Subring definition
- Unit of a ring definition
- Zero divisor definition
- Ideal definition
- Union definition
- Addition of natural numbers definition
- The successor function is injective statement
- Zero is not a successor statement
- Biconditional definition
- Truth table concept
- Modus ponens concept
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Divisibility in a commutative ring definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Proof of the universal property of the polynomial ring proof
- Field definition
- Kernel of a ring homomorphism definition
- Ring isomorphism definition
- Integral domain definition
- Ideal generated by a subset definition
- Proof of the commutativity of addition by induction proof
- Subset definition
- Propositional logic concept
- Order on the natural numbers definition
- Maximal ideal definition
- Two-sided ideal definition
- Union of a family of sets definition
- Mathematical proof concept
- Uniqueness quantifier definition
- Leading coefficient definition
- Root of a polynomial definition
- Evaluation homomorphism definition
- Proof of cancellation in an integral domain proof
- Subfield definition
- Binary relation definition
- Proof that the only ideals of a field are zero and the whole field proof
- Irreducible element definition
- Commutativity of addition statement
- Euclidean domain definition
- Quotient ring definition
- Proof of strong induction from ordinary induction proof
- Principal ideal definition
- Tautology definition
- Monic polynomial definition
- Split polynomial definition
- Proof of the remainder theorem proof
- Proof of the degree of a product over an integral domain proof
- Universal property of the polynomial ring statement
- Field extension definition
- Antisymmetric relation definition
- Irreducible polynomial definition
- Reflexive relation definition
- Transitive relation definition
- Cancellation in an integral domain statement
- The only ideals of a field are zero and the whole field statement
- Proof of the universal property of the quotient ring proof
- Proof that R/M is a field iff M is maximal proof
- Strong induction statement
- Principal ideal domain definition
- Function definition
- Logical equivalence definition
- Division algorithm for polynomials statement
- Algebraic element definition
- Degree of a product statement
- Algebraically closed field definition
- Intermediate field definition
- Universal property of the quotient ring statement
- Proof of the well-ordering principle from strong induction proof
- Preorder definition
- Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
- Proof of the double negation law by a truth table proof
- Image of a set definition
- Preimage of a set definition
- Choice function definition
- Codomain definition
- Injective function definition
- Minimal polynomial of an algebraic element definition
- Remainder theorem statement
- Algebraic extension definition
- Proof that R[x] is an integral domain iff R is proof
- Field generated by adjoining elements definition
- Partial order definition
- Well-ordering principle statement
- Proof that a ring homomorphism is injective iff its kernel is zero proof
- Double negation law statement
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Axiom of choice statement
- Surjective function definition
- Proof that the minimal polynomial divides every polynomial vanishing at the element proof
- Proof of the factor theorem proof
- Algebraic closure definition
- Proof that the minimal polynomial is irreducible proof
- R[x] is an integral domain iff R is statement
- Simple extension definition
- Maximal element definition
- Total order definition
- Upper bound definition
- A ring homomorphism is injective iff its kernel is zero statement
- Proof that Euclidean domains are principal ideal domains proof
- Proof by contradiction concept
- Bijective function definition
- The minimal polynomial divides every polynomial vanishing at the element statement
- Factor theorem statement
- The minimal polynomial is irreducible statement
- Proof that K[x] is a Euclidean domain proof
- Proof that ring homomorphisms from a field are injective proof
- Chain definition
- Proof of the first isomorphism theorem for rings proof
- Proof of the correspondence theorem for rings proof
- Euclidean domains are principal ideal domains statement
- K[x] is a Euclidean domain statement
- Ring homomorphisms from a field are injective statement
- First isomorphism theorem for rings statement
- Zorn's lemma statement
- Correspondence theorem for rings statement
- R/M is a field iff M is maximal statement
- Proof that K[x]/(f) is a field iff f is irreducible proof
- K[x]/(f) is a field iff f is irreducible statement
- Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
- K(a) is isomorphic to K[x] modulo the minimal polynomial statement
- Proof of the uniqueness of the algebraic closure proof
Where this leads
4 pages build on this one.
Further reading
- Web https://www.jmilne.org/math/CourseNotes/FT.pdf, Theorem 6.6
About this page
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.