Field theory and polynomials Proof
Proof of the existence of an algebraic closure
Builds on FieldAlgebraic closureAlgebraically closed fieldMonic polynomialPolynomials in several variablesIdeal generated by a subsetProof by contradictionEvery polynomial has a root in some extension fieldRoot of a polynomialMathematical inductionUniversal property of the polynomial ringRing homomorphismExistence of maximal idealsR/M is a field iff M is maximalQuotient ringRing homomorphisms from a field are injectiveAlgebraic elementField generated by adjoining elementsDegree of a simple extension is the degree of the minimal polynomialTower lawFinite extensionFinite extensions are algebraicAlgebraic extensionAn algebraic extension of an algebraic extension is algebraicSubfield
Proof
First we show that every field has an extension in which each nonconstant polynomial over has a root, with algebraic.
- Let be the set of monic polynomials with . Take one variable for each .
- Let be the union of the polynomial rings in finitely many of these variables. Two elements of lie in a common such ring, where we add and multiply them. Let be the ideal generated by the elements for .
- We show , by contradiction. Suppose . Then for some distinct and some .
- The involve finitely many variables. So there are distinct with all .
- Set . For , some extension of contains a root of . By induction this gives a field containing and .
- Applying the universal property of the polynomial ring one variable at a time gives a ring homomorphism . It is the identity on , sends to for , and sends to for .
- Applying to Step 3 gives in . This is impossible in a field, so .
- By the existence of maximal ideals, some maximal ideal of contains . Then is a field, because R/M is a field iff M is maximal.
- The map , , is a ring homomorphism into the quotient ring. It is injective, so we identify with its image, a subfield of .
- For let . Then , since . So each has a root in .
- Let with and leading coefficient . Then has a root in , which is also a root of .
- Each is algebraic over , since and .
- Let . Then with , and involves finitely many variables . So lies in the generated field .
- Let and . The element is algebraic over , since its polynomial has coefficients in .
- So is finite by the degree of a simple extension. By the tower law, is a finite extension.
- Finite extensions are algebraic, so is algebraic over . Hence is algebraic.
Now we iterate this construction for the field of the statement.
- Let and , the field built from in Steps 1 to 16. Replacing each by an isomorphic copy, we may assume that is a subfield of .
- Let . Any two elements of lie in a common , since the increase. Define their sum and product in that .
- This does not depend on the choice of , because each is a subfield of the later ones. Each field axiom involves finitely many elements, which lie in a common . So is a field containing .
- By induction on , is algebraic. For , each is a root of . If is algebraic, then is algebraic by Step 16, so is algebraic by transitivity.
- Every element of lies in some , so it is algebraic over . Hence is algebraic.
- Let with . Its finitely many coefficients lie in some . By Step 11 for , has a root in .
- So is algebraically closed. With Step 21, is an algebraic closure of .
Idea
Adjoin a root of every polynomial at once, using one variable per polynomial and a maximal ideal. The ideal of relations is proper because any finite part of it can be solved in a finite extension. One step gives roots for polynomials over the old field. Repeating countably often and taking the union gives a field that is algebraically closed and algebraic over .
Reading path
To understand this page from the ground up, read these 191 pages in order. The foundations come first. The path takes the proofs Proof that in a UFD irreducible elements are prime, 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 of the tower law, Proof that every polynomial has a root in some extension field, Proof that R[x] is an integral domain iff R is, Proof that finite extensions are algebraic, Proof that the degree of a simple extension is the degree of the minimal polynomial, Proof that the product of primitive polynomials is primitive, 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 that every linearly independent set extends to a basis, by Zorn's lemma, 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 of the existence of maximal ideals by Zorn's lemma, Proof of Gauss's lemma on irreducibility over a UFD, Proof that K[x]/(f) is a field iff f is irreducible, Proof that prime elements are irreducible in an integral domain, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof that an algebraic extension of an algebraic extension is algebraic, Proof that every vector space has a basis, by Zorn's lemma, 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
- Linear combination concept
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Proof of Zorn's lemma proof
- Proposition concept
- Spanning set concept
- Vector space definition
- Set definition
- Ring definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Predicate definition
- Linear combination definition
- Linear subspace 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
- Biconditional definition
- The successor function is injective statement
- Zero is not a successor statement
- Truth table concept
- Modus ponens concept
- Existential quantifier definition
- Universal quantifier definition
- Linear independence definition
- Linear span definition
- Cartesian product definition
- Divisibility in a commutative ring definition
- Polynomials in several variables 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
- Spanning set definition
- Leading coefficient definition
- Associate elements definition
- Prime element definition
- Evaluation homomorphism definition
- Proof of cancellation in an integral domain proof
- Root of a polynomial definition
- Subfield definition
- Binary relation definition
- Proof that the only ideals of a field are zero and the whole field proof
- Field of fractions definition
- Irreducible element definition
- Commutativity of addition statement
- Quotient ring definition
- Euclidean domain definition
- Proof of strong induction from ordinary induction proof
- Principal ideal definition
- Tautology definition
- Basis definition
- Finite-dimensional vector space definition
- Monic polynomial definition
- Greatest common divisor in an integral domain definition
- Proof of the degree of a product over an integral domain proof
- Universal property of the polynomial ring statement
- Split polynomial definition
- Field extension definition
- Cancellation in an integral domain statement
- Irreducible polynomial definition
- Unique factorisation domain definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- 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
- Dimension theorem for vector spaces statement
- Dimension definition
- Division algorithm for polynomials statement
- Degree of a product statement
- Algebraic element definition
- Content of a polynomial definition
- Degree of a field extension definition
- Algebraically closed field definition
- Intermediate field definition
- Proof that prime elements are irreducible in an integral domain proof
- 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
- Primitive polynomial definition
- Algebraic extension definition
- Proof that R[x] is an integral domain iff R is proof
- Finite extension definition
- Field generated by adjoining elements definition
- Prime elements are irreducible in an integral domain statement
- Well-ordering principle statement
- Proof that a ring homomorphism is injective iff its kernel is zero proof
- Partial order definition
- 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 that the minimal polynomial is irreducible proof
- Algebraic closure definition
- R[x] is an integral domain iff R is statement
- Simple extension definition
- Proof that in a UFD irreducible elements are prime proof
- A ring homomorphism is injective iff its kernel is zero statement
- Maximal element definition
- Total order definition
- Upper bound definition
- Proof by contradiction concept
- Proof that Euclidean domains are principal ideal domains proof
- Bijective function definition
- The minimal polynomial divides every polynomial vanishing at the element 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
- In a UFD irreducible elements are prime statement
- Proof of the first isomorphism theorem for rings proof
- Chain definition
- Proof of the correspondence theorem for rings proof
- Equinumerous sets definition
- Euclidean domains are principal ideal domains statement
- K[x] is a Euclidean domain statement
- Ring homomorphisms from a field are injective statement
- Proof that the product of primitive polynomials is primitive proof
- Proof of Gauss's lemma on irreducibility over a UFD proof
- Cardinality definition
- First isomorphism theorem for rings statement
- Zorn's lemma statement
- Correspondence theorem for rings statement
- Product of primitive polynomials is primitive statement
- Proof of the existence of maximal ideals by Zorn's lemma proof
- R/M is a field iff M is maximal statement
- Proof that every linearly independent set extends to a basis, by Zorn's lemma proof
- Proof that every vector space has a basis, by Zorn's lemma proof
- Gauss's lemma statement
- Proof that K[x]/(f) is a field iff f is irreducible proof
- Existence of maximal ideals statement
- Every vector space has a basis statement
- Every linearly independent set extends to a basis statement
- Polynomial ring over a UFD is a UFD statement
- K[x]/(f) is a field iff f is irreducible statement
- Proof that finite extensions are algebraic proof
- Proof of the tower law proof
- Finite extensions are algebraic statement
- Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
- Tower law statement
- Adjoining a root of a polynomial definition
- K(a) is isomorphic to K[x] modulo the minimal polynomial statement
- Proof that the degree of a simple extension is the degree of the minimal polynomial proof
- Degree of a simple extension is the degree of the minimal polynomial statement
- Proof that an algebraic extension of an algebraic extension is algebraic proof
- Proof that every polynomial has a root in some extension field proof
- An algebraic extension of an algebraic extension is algebraic statement
- Every polynomial has a root in some extension field statement
- Proof of the existence of an algebraic closure proof
Where this leads
1 page builds on this one.
Further reading
- Web https://www.jmilne.org/math/CourseNotes/FT.pdf, Chapter 6, Third proof of the existence of algebraic closures
- Web https://en.wikipedia.org/wiki/Algebraic_closure, Existence of an algebraic closure and splitting fields
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.