How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Galois Correspondence
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- The Fundamental Theorem of Finite Abelian Groups
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Finite extensions, splitting fields, embeddings into algebraic closures, normality, and separability provide the field-theoretic background. Separable degree bounds the number of relative automorphisms, while the sign homomorphism and symmetric-polynomial theorem control the Vandermonde product, discriminant, and quartic resolvent. The tower law and quotient-group isomorphism theorem supply the degree and restriction calculations.
Relative automorphism groups and fixed fields lead through Dedekind independence to Artin's fixed-field theorem. The equivalent Galois conditions then support the inclusion-reversing subgroup-field correspondence, its normality and quotient clause, translation, and compositum formulas. Finally the action on roots relates irreducibility to transitivity; discriminants classify monic separable irreducible cubics in characteristic not two, and the resolvent gives the possible transitive quartic Galois groups under the same characteristic hypothesis.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Relative field automorphisms and
Definition
Let be a field extension. An -automorphism of is an -isomorphism . This is the relative-automorphism case of -homomorphisms and -embeddings of field extensions.
The set of all -automorphisms of is denoted
Composition is the proposed operation. That it makes this set a group, and the basic finite-extension bound on its order, are proved in is a group and ↗.
is a group and
Statement
For every field extension , composition makes a group. If is finite, then
In particular the relative automorphism group is finite.
Facts & Assumptions
Given: A field extension ; for the inequalities, a finite extension, an algebraic closure of , and the Axiom of Choice used by the embedding-extension theorem.
An -automorphism of is an -isomorphism (Relative field automorphisms and ).
Assuming the Axiom of Choice, an embedding extends across the algebraic extension to an -embedding (Assuming Choice, a base-field embedding extends across every algebraic extension); the separable degree is the number of -embeddings (The separable degree as a count of embeddings into an algebraic closure).
For every finite field extension , one has (For a finite extension, ).
Proof
The identity map is an -automorphism, the composite of two -automorphisms is an -automorphism, and the inverse of an -isomorphism is again an -isomorphism fixing ; associativity is inherited from composition. Thus is a group. Every such map fixes and , so no zero case is excluded.
For finite , choose as in [A1]. The map sends into the set of -embeddings and is injective, because and injectivity of imply .
Step 1.2 and the definition of separable degree give , while [L1] gives . If , all three numbers are , so this includes the degree-one endpoint.
The fixed field of a group of field automorphisms
Definition
Let be a field and let be a subgroup of its automorphism group. The fixed field of is
This is a subfield of . Every field automorphism fixes and , so these elements lie in . If and , then and ; if also , then . Thus is closed under subtraction, multiplication, and inverses of nonzero elements. In particular, when (Relative field automorphisms and ), one has .
Dedekind's linear independence theorem for distinct characters
Statement
Let be a group and a field. Every finite family of distinct group homomorphisms is linearly independent over as a family of functions.
Facts & Assumptions
Given: A finite family of pairwise distinct characters , where character means group homomorphism (Monoid homomorphism and group homomorphism), and linear independence has the function-space meaning of Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent.
For every character , one has , and every value lies in and is nonzero.
Proof
The empty family is independent vacuously, and a singleton is independent because its character never vanishes. Suppose, for contradiction, that some finite distinct family is dependent; among all nonzero relations choose one with the least support, relabel its supported characters as , and divide by the first nonzero coefficient to write for every , where and .
Since , choose with . Evaluate the relation of step 1.1 at and subtract times its value at to obtain for every .
The new relation has support smaller than but is nonzero because its -coefficient is . This contradicts the minimality in step 1.1, so no nontrivial relation exists and the characters are linearly independent.
Artin's fixed-field lower bound
Statement
If is a finite group of automorphisms of , then .
Facts & Assumptions
Given: A field , a finite group of automorphisms of , and its fixed field (The fixed field of a group of field automorphisms).
Every finite family of distinct group homomorphisms is linearly independent over as a family of functions (Dedekind's linear independence theorem for distinct characters).
Proof
Restricted to , the distinct automorphisms are distinct characters , so [L1] makes them linearly independent as functions. Hence their evaluation vectors span : otherwise a nonzero linear functional on their span would give a nontrivial -linear relation among the . Choose nonzero such that the evaluation matrix is invertible. For , one may take .
Suppose satisfy . Applying each and using gives , so invertibility of forces every . Thus are linearly independent over .
A -linearly independent family of elements of gives .
Artin's fixed-field upper bound
Statement
If is a finite group of automorphisms of , then .
Facts & Assumptions
Given: A field , a finite group of automorphisms of with the identity, and arbitrary elements .
If is linear and is finite-dimensional, then (Rank-nullity: ).
Proof
Define the -linear map by . Since the domain has dimension and the codomain dimension , [L1] gives a nonzero vector in .
Among nonzero vectors in , choose with least support and scale it so its first supported coordinate is . For , applying to all equations and reindexing the rows by shows that also lies in . The vector has a zero in the normalized coordinate and support strictly smaller than that of unless it vanishes; minimality therefore gives for every and every , so all lie in .
The identity row of is , a nontrivial -linear dependence among the arbitrary elements. Thus no elements of are linearly independent over , and . This includes and also covers repeated or zero .
Artin's fixed-field theorem: and
Statement
If is a finite group of automorphisms of , then and .
Facts & Assumptions
Given: A field , a finite automorphism group , and the fixed field .
If is a finite group of automorphisms of , then (Artin's fixed-field lower bound ).
If is a finite group of automorphisms of , then (Artin's fixed-field upper bound ).
For a finite extension , one has ( is a group and ).
Proof
The opposing bounds [L1] and [L2] give . In particular is finite. For this says and the degree is .
Every fixes , so . By [L3] and step 1.1, ; a finite set containing and having at most its cardinality equals .
Distinct finite automorphism groups have distinct fixed fields
Statement
For a field , the assignment is injective on finite groups of automorphisms of . Equivalently, distinct finite automorphism groups have distinct fixed fields.
Facts & Assumptions
Given: Finite groups of automorphisms of one field .
If is a finite group of automorphisms of , then and (Artin's fixed-field theorem: and ).
Proof
If , then [L1] applied to each group gives . Thus equal fixed fields force equal groups, including when either group is trivial.
Step 1.1 is precisely injectivity of ; its contrapositive says that distinct finite automorphism groups have distinct fixed fields.
For a finite extension, divides
Statement
If is a finite extension, then divides .
Facts & Assumptions
Given: A finite extension , the finite group supplied by is a group and , and its fixed field (The fixed field of a group of field automorphisms).
If is a finite group of automorphisms of , then and (Artin's fixed-field theorem: and ).
If and both successive extensions are finite, then (Tower law for finite extensions: ).
Proof
Artin's theorem gives .
The tower formula gives , proving the divisibility. Degree one and a trivial automorphism group both give divisor .
Finite Galois extensions and
Definition
A finite extension is Galois when it is normal (A normal algebraic extension is one in which every minimal polynomial with a root in the extension splits there) and separable (Separable algebraic elements and separable extensions). Its Galois group is
with the group operation supplied by Relative field automorphisms and . The notation is reserved here for an extension already known to be finite Galois; for an arbitrary extension the notation remains .
Equivalent characterizations of a finite Galois extension
Statement
Let be a finite extension and put . The following conditions are equivalent:
- is Galois, that is, normal and separable.
- is the splitting field over of a separable polynomial.
- .
- .
In particular, a finite extension is Galois if and only if it is the splitting field of a separable polynomial.
Facts & Assumptions
Given: A finite extension and ; splitting fields as in Polynomials that split and splitting fields of a polynomial or a family of polynomials; the facts that endomorphisms of a splitting field permute its roots (Every -endomorphism of a splitting field permutes the distinct roots and is an automorphism), is separable exactly when (A finite extension is separable if and only if ), and finite degrees multiply in towers (Tower law for finite extensions: ); the separable degree is the number of -embeddings of into an algebraic closure of (The separable degree as a count of embeddings into an algebraic closure).
If is a finite group of automorphisms of a field , then and (Artin's fixed-field theorem: and ).
If is normal and , then is the splitting field of the product of the minimal polynomials of the generators; for the product is and (A normal extension generated by finitely many elements is the splitting field of the product of their minimal polynomials).
If is algebraic and for a set of elements separable over , then is separable (An algebraic extension generated by separable elements is separable).
For every field extension composition makes a group, and if is finite then ; in particular the relative automorphism group is finite ( is a group and ).
Proof
For the implication from condition 1 to condition 2, choose a finite generating family for . By [L2], normality makes the splitting field of the product of their distinct minimal polynomials; separability makes each factor separable, so their distinct product is separable. If , the empty product has splitting field .
For the implication from condition 2 to condition 3, let be the splitting field of the separable . Then is generated over by the roots of , and the minimal polynomial of each root divides and therefore has no repeated root, so every generator is separable over ; by [L3], is separable and the full-degree criterion in the Given gives . Every -embedding of into an algebraic closure permutes the roots of and hence maps onto itself, so the embeddings are precisely the elements of and .
For the implication from condition 3 to condition 4, [L1] gives . Since , the tower law forces , hence .
For the implication from condition 4 to condition 1, [L4] makes finite, so [L1] applies to and gives ; with this reads . The bound in [L4] then gives , so and the full-degree criterion in the Given makes separable. For , the orbit polynomial has distinct roots in and coefficients fixed by , hence in . The minimal polynomial of divides , while every orbit element is one of its roots; separability makes divide that minimal polynomial. They are therefore equal, so every minimal polynomial over splits in and is normal. This also covers and the degree-one extension.
A finite Galois extension is Galois over every intermediate field
Statement
If is finite Galois and , then is finite Galois.
Facts & Assumptions
Given: A finite normal and separable extension (Finite Galois extensions and ) and an intermediate field ; separability means every element has a separable minimal polynomial (Separable algebraic elements and separable extensions), and a finite -basis of also spans over .
If is a normal algebraic extension and , then is a normal algebraic extension (If is normal and , then is normal).
Proof
Normality of descends through the intermediate field, so is normal.
For , its minimal polynomial over divides its separable minimal polynomial over , since the latter lies in and vanishes at . A divisor of a separable polynomial is separable, so is separable. This includes .
The extension is finite because a finite -basis spans it over ; together with steps 1.1 and 1.2 this makes finite Galois. Both endpoints are included: recovers the hypothesis and gives the degree-one extension.
Remarks
The conclusion concerns . The extension need not be normal; the normal-subgroup criterion identifies exactly when it is.
The Galois closure of a finite separable extension
Definition
Let be a finite separable extension embedded in a fixed algebraic closure of . Its Galois closure in is the normal closure of The normal closure of an algebraic extension inside a fixed algebraic closure.
Equivalently, it is the least subfield of containing for which is finite Galois (Finite Galois extensions and ). The existence, finiteness, separability, and leastness asserted by this terminology are established in Finite separable extensions have finite minimal Galois closures ↗.
Finite separable extensions have finite minimal Galois closures
Statement
Let be a finite separable extension inside an algebraic closure of . Its Galois closure exists, is finite Galois over , and is contained in every subfield of that contains and is Galois over .
Facts & Assumptions
Given: A finite separable extension , the Galois-closure definition of The Galois closure of a finite separable extension, the fact that an algebraic extension generated by separable elements is separable (An algebraic extension generated by separable elements is separable), and the equivalence between finite Galois extensions and separable splitting fields (Equivalent characterizations of a finite Galois extension).
The normal closure in of a finite extension is finite over and is the splitting field of the product of the minimal polynomials of a finite generating family (The normal closure of a finite extension exists and is finite).
Proof
Choose a finite generating family . By [L1], the normal closure is finite over and is the splitting field of the product of the minimal polynomials of the generators. If , then and . Repeated minimal polynomials may be removed from the product.
Each generator is separable over , so every root of its minimal polynomial is separable over . The field is generated by those roots, hence is separable; it is normal by construction, so it is finite Galois.
If is a subfield of containing and Galois over , then is normal. The normal closure is the intersection of all normal subextensions containing , so . Thus is the required minimal Galois overfield.
The fundamental theorem of finite Galois theory
Statement
Let be finite Galois and let . The assignments and are mutually inverse inclusion-reversing bijections between subgroups and intermediate fields . Moreover,
Facts & Assumptions
Given: A finite Galois extension , its finite group , the fact that is finite Galois for every intermediate field (A finite Galois extension is Galois over every intermediate field), the tower law (Tower law for finite extensions: ), and the finite-group formula (Lagrange's theorem: for every subgroup of a finite group ).
If is a finite group of automorphisms of , then and (Artin's fixed-field theorem: and ).
For a finite extension with , being Galois, being the splitting field of a separable polynomial, , and are equivalent (Equivalent characterizations of a finite Galois extension).
Proof
For the subgroup-to-field-to-subgroup direction, Artin applied to gives . This includes , whose fixed field is , and .
For the field-to-subgroup-to-field direction, put . Since is finite Galois, [L2] gives . Artin gives , while ; the tower law forces . This includes and .
If , then every element fixed by is fixed by , so ; the reverse map is likewise inclusion-reversing. Artin gives , while [L2] applied to gives , so the tower and Lagrange formulas give . Together with steps 1.1 and 1.2 these statements prove the claimed bijections and degree formulas.
Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence
Statement
Let be finite Galois, let , let , and put . For every ,
An intermediate field is Galois exactly when its corresponding subgroup is normal. In that case restriction gives a surjective homomorphism with kernel , and hence
Facts & Assumptions
Given: The finite Galois correspondence; normal subgroups and quotient groups (Normal subgroup: invariance under conjugation, The quotient group and coset product ); the characterization of a normal algebraic extension by stability of conjugates (A normal algebraic extension is one in which every minimal polynomial with a root in the extension splits there); the Axiom of Choice and algebraic embedding extension (Assuming Choice, a base-field embedding extends across every algebraic extension); and the first isomorphism theorem for groups (First isomorphism theorem for groups: ).
The assignments and are mutually inverse inclusion-reversing bijections (The fundamental theorem of finite Galois theory).
A subgroup is normal exactly when it is invariant under conjugation (Equivalent characterisations of a normal subgroup by conjugates and left and right cosets).
Proof
For , the element is fixed by exactly when is fixed by , exactly when , and exactly when . Thus , and [L1] gives .
For the forward direction, if , then step 1.1 gives for every ; every -conjugate of an element of is obtained by extending its embedding to and hence lies in , so is normal, and it is separable as a subextension of the separable extension , hence Galois. For the reverse direction, if is Galois, normality gives for every , so step 1.1 and [L1] give and [F1] gives .
In the normal case, restriction is defined by step 2.1. Every -automorphism of extends to an embedding of in an algebraic closure; normality of makes the extension an element of , so is surjective. Its kernel consists exactly of the automorphisms fixing , namely by [L1]. The first isomorphism theorem therefore gives ; for and this yields the two endpoint quotients.
A finite Galois extension has finitely many intermediate fields
Statement
A finite Galois extension has only finitely many intermediate fields.
Facts & Assumptions
Given: A finite Galois extension and its finite Galois group .
The assignments and are mutually inverse inclusion-reversing bijections (The fundamental theorem of finite Galois theory).
Proof
A finite group has a finite power set, and its subgroups form a subcollection of that power set; hence has finitely many subgroups.
By [L1], the intermediate fields are in bijection with those subgroups, so there are finitely many. When , both collections have one member, and the base and top endpoints coincide.
Remarks
The library proves more than this elsewhere: A finite separable extension has only finitely many intermediate fields drops normality and keeps the conclusion, by the Steinitz primitive-element route rather than by the correspondence. The corollary here is recorded because it is what the Galois correspondence gives immediately, not because the separable statement is unavailable.
The Galois correspondence exchanges composita with subgroup intersections and field intersections with generated subgroups
Statement
Let be finite Galois, and let correspond to subgroups for . Then
and
Facts & Assumptions
Given: The compositum , the generated subgroup of The subgroup generated by a subset, the cyclic subgroup , and cyclic groups, and the subgroup intersection of The intersection of a nonempty family of subgroups of is a subgroup of .
The assignments and are mutually inverse inclusion-reversing bijections (The fundamental theorem of finite Galois theory).
Proof
An automorphism of fixes exactly when it fixes every element of both and , exactly when it belongs to both and . Therefore .
An element of is fixed by exactly when it is fixed by every element of both generating subgroups, so . Applying [L1] gives the second formula. These membership equivalences also cover equal fields, the base and top fields, and trivial or full subgroups.
The Galois translation theorem
Statement
Let be finite Galois and let be a field extension inside a common overfield. Then is finite Galois, and restriction gives
Facts & Assumptions
Given: The compositum and intersection inside the common overfield.
A finite extension is Galois if and only if it is the splitting field of a separable polynomial, and for a finite Galois extension the fixed field of the full Galois group is the base field (Equivalent characterizations of a finite Galois extension).
If is a finite group of automorphisms of a field , then and (Artin's fixed-field theorem: and ).
Proof
By [L1], is the splitting field over of a separable polynomial . The same polynomial over remains separable and has splitting field , so [L1] makes finite Galois.
An element of permutes the roots of , hence preserves , and its restriction to fixes . Restriction therefore defines a homomorphism into ; it is injective because is generated by and .
Let be the restriction image. By [L1], an element of is fixed by exactly when it is fixed by every automorphism of , exactly when it lies in ; thus . By [L2], , so restriction is surjective and hence an isomorphism. If , both groups are trivial; if or , the displayed formula specializes directly.
The Galois group of a compositum is a fibre product of Galois groups
Statement
Let and be finite Galois extensions inside a common overfield, and put . Then is finite Galois and restriction identifies its Galois group with the fibre product
This image is the full direct product exactly when .
Facts & Assumptions
Given: Finite Galois extensions and ; writing for a separable polynomial with splitting field , their compositum is the splitting field over of the product of the distinct irreducible factors of , a polynomial with the same roots as and no repeated one, so the compositum is Galois by Equivalent characterizations of a finite Galois extension; restriction from a Galois extension onto a Galois intermediate field is surjective by Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence; and the fixed field of a full finite Galois group is the base field by The fundamental theorem of finite Galois theory.
For finite Galois and any extension , restriction gives (The Galois translation theorem).
Proof
Restriction sends injectively into the product of the two relative Galois groups, since is generated by and . Both restrictions agree on , so the image lies in the displayed fibre product.
Conversely, let have equal restrictions to . Extend to some using surjectivity of restriction. Then fixes , and [L1] supplies with . The automorphism restricts to and , proving that every compatible pair is in the image.
For the forward implication of the last assertion, if then compatibility is automatic and step 2.1 gives the full product. For the reverse implication, if the image is the full product, every pair is compatible, so every fixes ; its fixed field is , hence . If , the fibre product is instead the diagonal subgroup, as the formula requires.
The Galois group of a separable polynomial
Definition
Let be separable, and let be a splitting field of (Polynomials that split and splitting fields of a polynomial or a family of polynomials). By Equivalent characterizations of a finite Galois extension, the extension is finite Galois. The Galois group of over is
An ordering of the roots identifies with a permutation group. A different ordering conjugates that subgroup in the corresponding symmetric group. Isomorphisms between splitting fields exist by A base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials and conjugate their automorphism groups. Thus the abstract group, and its root action up to relabelling, do not depend on the chosen splitting field.
A polynomial Galois group acts faithfully on its roots
Statement
Let be separable, let be its splitting field, and let be its set of roots in . The natural action of on is faithful, so it embeds in the symmetric group . After ordering , this gives a subgroup of ; changing the ordering conjugates the subgroup.
Facts & Assumptions
Given: The polynomial Galois group of The Galois group of a separable polynomial and the fact that a splitting field is generated over by its roots (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Every field homomorphism fixing maps the finite set of distinct roots of bijectively to itself (Every -endomorphism of a splitting field permutes the distinct roots and is an automorphism).
Proof
By [L1], each element of gives a permutation of , and composition of automorphisms gives composition of permutations.
If an automorphism induces the identity permutation, it fixes every root of and fixes ; because those roots generate , it fixes all of . Thus the action homomorphism has trivial kernel and is faithful. For a nonzero constant polynomial, is empty, , and both groups are trivial; a linear polynomial gives the singleton case.
If two orderings of differ by , then the two permutation representatives of every are related by . Hence the embedded subgroup changes only by conjugation.
A positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots
Statement
A positive-degree separable polynomial is irreducible if and only if its Galois group acts transitively on its roots.
Facts & Assumptions
Given: A positive-degree separable polynomial , its splitting field , and the faithful root action of A polynomial Galois group acts faithfully on its roots; the minimal-polynomial correspondence for a simple algebraic extension (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
An isomorphism between base fields taking one polynomial to another extends to an isomorphism between their splitting fields (A base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials).
Proof
For the forward direction, suppose is irreducible and let be roots. The rule sending to gives an -isomorphism because both have minimal polynomial associated to ; by [L1] it extends to an -automorphism of . Thus some Galois element sends any chosen root to any other, so the action is transitive. This includes degree one.
For the reverse direction, suppose the action is transitive and let be a monic irreducible factor of containing one root . For every , the coefficients of are fixed, so . Transitivity puts every root of among the roots of ; since is separable, has the full degree of , so is a scalar multiple of and is irreducible. A root equal to zero causes no exception.
The Vandermonde product transforms by the sign of the root permutation
Statement
Let be separable of degree , order its roots as , and put
For in the Galois group, let the same symbol denote its induced root permutation. Then for the Vandermonde product of an ordered root list. Consequently is fixed by the Galois group.
Facts & Assumptions
Given: The faithful root permutation action of A polynomial Galois group acts faithfully on its roots and the Vandermonde product of The Vandermonde polynomial .
The sign of is the integer , where counts the pairs with (Inversions, inversion number, the sign , and even and odd permutations).
For every natural , the function is a group homomorphism (The sign is a homomorphism , surjective exactly when ).
Every permutation of a finite set is a product of transpositions, and the identity is represented by the empty product (Every finite permutation is a product of transpositions, so the transpositions generate ).
If is any factorisation of a finite permutation into transpositions, then (Every transposition factorisation of has parity ).
Proof
Swapping two entries of the ordered root list reverses the factor belonging to that pair, while the remaining affected factors exchange in pairs; hence a transposition multiplies by .
Taking the one-factor factorisation in [L3] gives , so for every transposition by [F1].
By [L2] write as a product of transpositions, and apply step 1.1 once for each factor: each application multiplies the current Vandermonde product by , so .
By [L1] and step 1.2, , so step 2.1 gives . For or the factorisation is empty by [L2], the product defining is likewise empty and equals , and the sign is , so the identity holds there as .
Squaring the identity of step 3.1 removes the sign, so for every . A root equal to zero creates no exception; separability ensures distinct roots and hence .
For a monic separable polynomial in characteristic not two, the Galois group lies in exactly when the discriminant is a square
Statement
Let be a monic separable polynomial of degree , where . The Galois group lies in exactly when the discriminant is a square in the base field.
Facts & Assumptions
Given: A splitting field , an ordered root list, the discriminant definition of The discriminant of a monic polynomial as the coefficient expression of , the root formula and the fact that separability makes it nonzero (The discriminant is and vanishes exactly when a monic polynomial has a repeated root), the definition (The alternating group of even permutations), and the finite Galois correspondence, which gives (The fundamental theorem of finite Galois theory).
For the Vandermonde product, for every Galois automorphism (The Vandermonde product transforms by the sign of the root permutation).
Proof
For the forward direction, suppose the Galois group lies in . Then every sign is , so [L1] shows that every automorphism fixes . The fixed field is , hence and is a square in . This also covers and , when .
For the reverse direction, suppose for some . Since , the field law gives or , so . Thus every automorphism fixes , and [L1] gives . Separability gives , so cancellation and in characteristic not two force . Therefore every Galois permutation lies in .
Remarks
The characteristic hypothesis is essential to this argument: in characteristic two the two signs have the same scalar action, so the Vandermonde equation cannot detect parity.
A monic irreducible separable cubic in characteristic not two has Galois group or according to its discriminant
Statement
Let be a monic irreducible separable cubic over a field of characteristic not two. Then its Galois group is when its discriminant is a square and when its discriminant is not a square.
Facts & Assumptions
Given: The orbit-stabilizer cardinality formula (Orbit-stabiliser cardinality: whenever either side is finite, and for finite ), Lagrange's divisibility theorem (Lagrange's theorem: for every subgroup of a finite group ), and the alternating group of The alternating group of even permutations.
A positive-degree separable polynomial is irreducible if and only if its Galois group acts transitively on its roots (A positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots).
For a monic separable polynomial in characteristic not two, the Galois group lies in exactly when the discriminant is a square in the base field (For a monic separable polynomial in characteristic not two, the Galois group lies in exactly when the discriminant is a square).
Proof
By [L1], the Galois group acts transitively on three roots. Orbit-stabilizer makes divide , while Lagrange makes divide ; hence is or . In the first case every nonidentity element is a three-cycle and , while in the second .
If the discriminant is a square, [L2] gives , so step 1.1 forces . If it is not a square, [L2] gives , so step 1.1 forces . The two square classes are exhaustive, and separability remains an explicit hypothesis in characteristic three.
The resolvent cubic of a monic quartic
Definition
Let
be monic, and let be its roots in a splitting field (Polynomials that split and splitting fields of a polynomial or a family of polynomials). Put
The resolvent cubic of is
Permuting the four roots permutes the set of pairings, so the coefficients are symmetric expressions in the roots and lie in by A symmetric polynomial in the roots of a monic polynomial is a polynomial in its coefficients and lies in the base ring. The explicit coefficient formula and its discriminant identity are proved in The coefficient formula and discriminant of the quartic resolvent ↗.
The coefficient formula and discriminant of the quartic resolvent
Statement
For
the resolvent of The resolvent cubic of a monic quartic is
A monic quartic and its resolvent cubic have the same discriminant.
Facts & Assumptions
Given: Four roots in a splitting field, their elementary symmetric functions , , , , and the discriminant convention of The discriminant of a monic polynomial as the coefficient expression of .
Every symmetric polynomial has a unique expression (Fundamental theorem of symmetric polynomials: unique expression as a polynomial in ).
Proof
For the three pairing roots , direct expansion gives , , and . These are symmetric identities licensed by [L1], and substitution in gives the displayed formula.
The differences factor as , , and .
Multiplying the squares of the three identities in step 1.2 uses each of the six differences exactly once. The root-product formulas for the two discriminants therefore give . The identity remains valid when coefficients or root differences vanish.
The transitive subgroups of and their action on the three pairings
Statement
Up to conjugacy, the transitive subgroups of are , and , with the stated action on the three pairings. If
then the action on the three partitions of into two unordered pairs has kernel . The corresponding data are:
| image on pairings | |||
|---|---|---|---|
| no | |||
| yes | |||
| no | |||
| no | |||
| trivial | yes |
Facts & Assumptions
Given: The natural action of on four symbols; orbit-stabilizer cardinality (Orbit-stabiliser cardinality: whenever either side is finite, and for finite ); Lagrange's theorem (Lagrange's theorem: for every subgroup of a finite group ); conjugacy of Sylow subgroups (Sylow II: in a finite group every -subgroup lies in a conjugate of any Sylow -subgroup, and the Sylow -subgroups form a single conjugacy class); and kernels as normal subgroups with quotient image (Normal subgroup: invariance under conjugation, The quotient group and coset product ).
Thus consists exactly of the even permutations (The alternating group of even permutations).
Proof
Acting on the explicitly listed pairings gives a homomorphism . A permutation fixes all three pairings exactly when it is the identity or one of the three double transpositions, so .
If is transitive on four symbols, orbit-stabilizer makes divide and Lagrange makes divide , so . Order gives . An order- subgroup has index two and is normal; if it contained an odd permutation, the conjugates of that transposition or four-cycle would generate , so it is . An order- subgroup is Sylow and hence conjugate to the standard . For order the action is regular; an element of order four gives , and otherwise all nonidentity elements have order two and give .
Intersecting representatives with the kernel in step 1.1 gives the second column of the table, and the quotient orders give the pairing images. By [L1], contain odd permutations, whereas and do not. These invariants give the displayed rows; only and share the same nontrivial intransitive pairing image, and their different kernel orders distinguish them.
The five-case resolvent classification of an irreducible quartic Galois group
Statement
Let be a monic irreducible separable quartic over a field of characteristic not two, let be its resolvent cubic, let be the splitting field of , and let . Exactly one row applies:
- An irreducible separable quartic with irreducible resolvent and nonsquare discriminant has Galois group .
- An irreducible separable quartic with irreducible resolvent and square discriminant has Galois group .
- If splits completely over , then the group is .
- If has exactly one root in and remains irreducible over , then the group is .
- If has exactly one root in and is reducible over , then the group is .
In the unique-root resolvent branch, irreducibility over the resolvent splitting field distinguishes from .
Facts & Assumptions
Given: The three pairing roots of The resolvent cubic of a monic quartic, the finite Galois correspondence (The fundamental theorem of finite Galois theory), the discriminant square criterion (For a monic separable polynomial in characteristic not two, the Galois group lies in exactly when the discriminant is a square), and the equivalence between irreducibility and transitivity (A positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots).
The transitive subgroups of are , and , with the stated action on the three pairings (The transitive subgroups of and their action on the three pairings).
A monic quartic and its resolvent cubic have the same discriminant (The coefficient formula and discriminant of the quartic resolvent).
Proof
Let be the splitting field of and . Irreducibility makes transitive. The kernel of its action on the three pairing roots is by [L1]. The field generated by those roots is , so the Galois correspondence identifies .
If is irreducible, its pairing action is transitive, so [L1] leaves or ; by [L2] and the discriminant criterion, nonsquare gives and square gives . If splits completely, the pairing action is trivial and transitivity on four roots forces . If has exactly one root in , its other two roots form one orbit, so the pairing image is and [L1] leaves or . A cubic cannot have exactly two roots in , and [L2] plus separability makes the resolvent separable, so these branches are exhaustive.
In the unique-root branch, . For this intersection is , which acts transitively on the four roots, so remains irreducible over . For the intersection has order two and two root orbits, so factors over . The transitivity criterion proves both implications and completes the five-case classification.
5 · Examples, counterexamples and false statements
None yet.
Sources
- J. S. Milne, Fields and Galois Theory, v5.10, Chapter 3
- K. Conrad, The Galois Correspondence, Section 4
- J. S. Milne, Fields and Galois Theory, v5.10, Section 3
- K. Conrad, The Galois Correspondence, Sections 4-5
- J. S. Milne, Fields and Galois Theory, v5.10, Theorem 5.14
- J. S. Milne, Fields and Galois Theory, v5.10, Theorem 3.4
- K. Conrad, The Galois Correspondence, Section 5
- J. S. Milne, Fields and Galois Theory, v5.10, Theorem 3.4 and Corollary 3.5
- K. Conrad, The Galois Correspondence, Theorems 5.2-5.3
- J. S. Milne, Fields and Galois Theory, v5.10, Corollary 3.5
- K. Conrad, The Galois Correspondence, Theorem 5.3
- K. Conrad, The Galois Correspondence, Corollary 4.2
- J. S. Milne, Fields and Galois Theory, v5.10, Definition 3.9
- K. Conrad, The Galois Correspondence, Definition 4.4
- J. S. Milne, Fields and Galois Theory, v5.10, Theorem 3.10
- K. Conrad, The Galois Correspondence, Theorem 4.1
- J. S. Milne, Fields and Galois Theory, v5.10, Corollary 3.13
- J. S. Milne, Fields and Galois Theory, v5.10, Remark 3.18
- J. S. Milne, Fields and Galois Theory, v5.10, Corollary 3.12 and Remark 3.18
- K. Conrad, The Galois Correspondence, Theorem 4.8
- J. S. Milne, Fields and Galois Theory, v5.10, Theorem 3.17
- K. Conrad, The Galois Correspondence, Theorem 5.6
- K. Conrad, The Galois Correspondence, Theorem 5.13
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 3.19
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 3.21
- J. S. Milne, Fields and Galois Theory, v5.10, The Galois group of a polynomial
- K. Conrad, Galois Groups of Cubics and Quartics, Section 1
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 4.5
- K. Conrad, Galois Groups of Cubics and Quartics, Theorem 1.1
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 4.1
- J. S. Milne, Fields and Galois Theory, v5.10, Corollary 4.2
- K. Conrad, Galois Groups of Cubics and Quartics, Theorem 1.3
- J. S. Milne, Fields and Galois Theory, v5.10, Example 4.7
- K. Conrad, Galois Groups of Cubics and Quartics, Theorem 2.1
- K. Conrad, Galois Groups of Cubics and Quartics, Definition 3.1
- J. S. Milne, Fields and Galois Theory, v5.10, Quartic polynomials
- J. S. Milne, Fields and Galois Theory, v5.10, Lemma 4.9
- K. Conrad, Galois Groups of Cubics and Quartics, Theorem 3.4
- K. Conrad, Galois Groups of Cubics and Quartics, Table 3
- K. Conrad, Galois Groups of Cubics and Quartics, Theorem 3.6 and Corollary 3.8