Field theory and polynomials Proof
Proof that the Galois group of a finite Galois extension has order equal to the degree
Builds on Galois extensionNormal extensionSeparable extensionSeparable polynomialMinimal polynomial of an algebraic elementThe minimal polynomial is irreducibleThe minimal polynomial divides every polynomial vanishing at the elementDegree of a simple extension is the degree of the minimal polynomialMultiplicity of a rootRepeated roots and the derivativeA polynomial over a field has at most as many roots as its degreeK(a) is isomorphic to K[x] modulo the minimal polynomialRing homomorphismRing homomorphisms from a field are injectiveField generated by adjoining elementsTower lawAn injective endomorphism of a finite-dimensional space is surjectiveGalois group
Proof
We count the homomorphisms that fix , adjoining one generator at a time. Homomorphisms are ring homomorphisms that send to .
- Let be a finite Galois extension, so is normal and separable. Let .
Lemma. Let be a field, let and . Let be a homomorphism with for . Then exactly homomorphisms restrict to on .
- Let be the minimal polynomial of over , of degree . Let be the minimal polynomial of over , of degree . Then by the degree of a simple extension.
- Since and , the polynomial divides . Write with of degree .
- The polynomial is irreducible over and has the root in . As is normal, with .
- As is separable over , is a separable polynomial: for some .
- Suppose for some . Then divides , so has multiplicity at least . So , and evaluating step 5 at gives . So are distinct.
- For , let be obtained by applying to the coefficients. The map respects sums and products. Since is injective, it preserves degrees.
- Since fixes the coefficients of , step 3 gives in , with and .
- Each is a root of or of , since is a field. The polynomial has at most roots in .
- So at least of the distinct are roots of . As has at most roots, it has exactly roots in .
- Let extend . Applying to gives . So is one of the roots of .
- By the structure of simple extensions, every element of is for some . Then , so is determined by .
- Let be a root of in . Define for . If , then divides , so divides , and .
- So is well defined. It respects sums and products by step 7, it extends , and .
- By steps 10 to 14, the extensions correspond to the roots of . So there are exactly of them. This proves the lemma.
Now we count.
- Let be a basis of over . Then . Let and , so and .
- Claim: exactly homomorphisms fix . For , the only one is the inclusion of .
- Let . Each such homomorphism on restricts to one on . By the claim for there are restrictions, and each has exactly extensions by the lemma.
- So there are of them, by the tower law. With , exactly homomorphisms fix .
- Each such is injective, and it is -linear because for . As has finite dimension over , is surjective.
- So these maps are exactly the automorphisms of that fix , that is, the elements of the Galois group. Hence .
Idea
An automorphism is built by choosing the image of one generator at a time. At each stage the image must be a root of a minimal polynomial. Normality puts all these roots in , and separability makes them distinct, so the number of choices is exactly the degree of that stage. The tower law multiplies these counts into .
Reading path
To understand this page from the ground up, read these 193 pages in order. The foundations come first. The path takes the proofs Proof of the Steinitz exchange lemma by induction, Proof of cancellation in an integral domain, Proof that a subspace of full dimension is the whole space, 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 R[x] is an integral domain iff R is, Proof that the degree of a simple extension is the degree of the minimal polynomial, 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 an injective endomorphism of a finite-dimensional space is surjective, Proof that the only ideals of a field are zero and the whole field, Proof that a polynomial over a field has at most as many roots as its degree, Proof of the remainder theorem, Proof that a linear map is injective iff its kernel is trivial, 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 n independent or n spanning vectors in an n-dimensional space form a basis, 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 of the derivative test for repeated roots, Proof that a subspace of a finite-dimensional space has smaller or equal dimension, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof of the factor theorem, Proof of the rank–nullity theorem by extending a basis of the kernel, 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.
- Basis concept
- Definition by recursion concept
- Dimension concept
- Element definition
- Group concept
- Image of a linear map concept
- Kernel of a linear map concept
- Linear combination concept
- Linear independence concept
- Linear map concept
- Linear subspace concept
- Mathematical induction concept
- Natural numbers object
- Nullity concept
- Peano axioms concept
- Proof of Zorn's lemma proof
- Proposition concept
- Rank of a linear map concept
- Spanning set concept
- Vector space definition
- Set definition
- Ring definition
- Proof that a linear map is injective iff its kernel is trivial proof
- Successor function definition
- Disjunction definition
- Implication definition
- Predicate definition
- Linear combination definition
- Linear map 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
- Union definition
- Ideal definition
- Addition of natural numbers definition
- Existential quantifier definition
- Universal quantifier definition
- Linear independence definition
- Image of a linear map definition
- Kernel of a linear map definition
- Linear span definition
- The successor function is injective statement
- Zero is not a successor statement
- Cartesian product definition
- Divisibility in a commutative ring definition
- Degree of a polynomial definition
- Formal derivative 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
- Subset definition
- Ideal generated by a subset definition
- Union of a family of sets definition
- Proof of the commutativity of addition by induction proof
- A linear map is injective iff its kernel is trivial statement
- Maximal ideal definition
- Two-sided ideal definition
- Order on the natural numbers definition
- Uniqueness quantifier definition
- Spanning set definition
- Leading coefficient definition
- Separable polynomial definition
- Evaluation homomorphism definition
- Proof of cancellation in an integral domain proof
- Root of a polynomial definition
- Binary relation definition
- Subfield definition
- Irreducible element definition
- Proof that the only ideals of a field are zero and the whole field proof
- Quotient ring definition
- Euclidean domain definition
- Principal ideal definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Proof of the Steinitz exchange lemma by induction proof
- Basis definition
- Finite-dimensional vector space definition
- Monic polynomial definition
- Proof of the remainder theorem proof
- Multiplicity of a root definition
- Proof of the degree of a product over an integral domain proof
- Split polynomial definition
- Universal property of the polynomial ring statement
- Antisymmetric relation definition
- Irreducible polynomial definition
- Reflexive relation definition
- Transitive relation definition
- Cancellation in an integral domain statement
- Field extension definition
- Proof of the universal property of the quotient ring proof
- The only ideals of a field are zero and the whole field statement
- Proof that R/M is a field iff M is maximal proof
- Principal ideal domain definition
- Function definition
- Strong induction statement
- Dimension theorem for vector spaces statement
- Steinitz exchange lemma statement
- Dimension definition
- Division algorithm for polynomials statement
- Degree of a product statement
- Algebraic element definition
- Galois group definition
- Universal property of the quotient ring statement
- Intermediate field definition
- Preorder definition
- Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
- Degree of a field extension definition
- Proof of the well-ordering principle from strong induction proof
- Image of a set definition
- Preimage of a set definition
- Choice function definition
- Proof that n independent or n spanning vectors in an n-dimensional space form a basis proof
- Codomain definition
- Injective function definition
- Proof that a subspace of a finite-dimensional space has smaller or equal dimension proof
- Rank of a linear map definition
- Nullity definition
- Minimal polynomial of an algebraic element definition
- Remainder theorem statement
- Proof that R[x] is an integral domain iff R is proof
- Partial order definition
- Algebraic extension definition
- Field generated by adjoining elements definition
- Proof that a ring homomorphism is injective iff its kernel is zero proof
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Well-ordering principle statement
- Axiom of choice statement
- Dimension of a subspace statement
- Surjective function definition
- Linearly independent set of the right size is a basis statement
- Separable extension definition
- Proof of the factor theorem proof
- Proof that the minimal polynomial divides every polynomial vanishing at the element proof
- Maximal element definition
- Total order definition
- Upper bound definition
- R[x] is an integral domain iff R is statement
- Proof that the minimal polynomial is irreducible proof
- Normal extension definition
- Simple extension definition
- A ring homomorphism is injective iff its kernel is zero statement
- Proof that Euclidean domains are principal ideal domains proof
- Bijective function definition
- Proof that a subspace of full dimension is the whole space proof
- The minimal polynomial divides every polynomial vanishing at the element statement
- Factor theorem statement
- Chain definition
- Galois extension definition
- Proof that K[x] is a Euclidean domain proof
- The minimal polynomial is irreducible statement
- Proof that ring homomorphisms from a field are injective proof
- Proof of the first isomorphism theorem for rings proof
- Proof of the correspondence theorem for rings proof
- Equinumerous sets definition
- Euclidean domains are principal ideal domains statement
- A subspace of full dimension is the whole space statement
- Proof of the derivative test for repeated roots proof
- Proof that a polynomial over a field has at most as many roots as its degree proof
- K[x] is a Euclidean domain statement
- Ring homomorphisms from a field are injective statement
- Zorn's lemma statement
- First isomorphism theorem for rings statement
- Correspondence theorem for rings statement
- Cardinality definition
- A polynomial over a field has at most as many roots as its degree statement
- Repeated roots and the derivative 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
- R/M is a field iff M is maximal statement
- Proof that K[x]/(f) is a field iff f is irreducible proof
- Every vector space has a basis statement
- Every linearly independent set extends to a basis statement
- K[x]/(f) is a field iff f is irreducible statement
- Proof of the rank–nullity theorem by extending a basis of the kernel proof
- Proof of the tower law proof
- Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
- Tower law statement
- Rank–nullity theorem statement
- K(a) is isomorphic to K[x] modulo the minimal polynomial statement
- Proof that an injective endomorphism of a finite-dimensional space is surjective proof
- An injective endomorphism of a finite-dimensional space is surjective 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 the Galois group of a finite Galois extension has order equal to the degree proof
Where this leads
6 pages build on this one.
Further reading
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)
- a source with a locator (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.