A splitting field of over is a field extension in which is a product of linear factors and which is generated over by its roots. The generation condition rules out adjoining unrelated elements.
For existence, induct on the degree of a polynomial. Choose an irreducible polynomial divisor of . The quotient ring is a field because is a maximal ideal; the class of is a root of , hence of . Over this field extension, divide out and apply induction to the remaining polynomial. This gives an extension in which splits. Inside it, the subfield generated by all roots is a splitting field. The induction starts with a linear polynomial, whose splitting field is already . Thus every positive-degree polynomial has a splitting field; being monic is unnecessary for existence.
The roots are and , so the splitting field is . The first adjunction has degree . To see that the second does too, suppose with . Squaring and comparing rational and irrational parts gives and . If , then ; if , then . Neither is a rational square, as follows by comparing prime exponents in numerator and denominator. Thus . The tower law now yieldsA basis is .
Replacing by in the irreducible polynomial from part (i) gives . This substitution is an invertible automorphism of , so it preserves irreducibility. The roots are the primitive eighteenth roots, and the splitting field is . They are all powers of one such root, so its irreducible degree-six polynomial givesIn fact this is the same field as in part (i): and .
The splitting field in is the smallest subfield containing and every root of the polynomial. The sixth roots of unity are powers of , so the splitting field of is .
For , the roots are exactly the primitive ninth roots of unity, all powers of . Thus its splitting field is . The supplied irreducibility makes the displayed degree-six polynomial the minimal polynomial of , giving
The intended hypothesis must be a proper monic factor, with . Without that restriction the printed deduction is false: every polynomial has the displayed trivial factorization with , even when it has no root in .
By part 1, the roots in a splitting field are distinct and have the form . The degree- monic factor is the product of corresponding linear factors. Comparing the coefficient of using Vieta's formulas givesBoth and the sum of prime-field elements lie in . Since , the scalar is nonzero and invertible in . Therefore , and part 1 proves the polynomial splits into distinct linear factors over . In particular an Artin–Schreier polynomial of prime degree is either irreducible or splits completely.
Let be a root in a splitting field. The preceding characteristic- identity gives , so there is only one distinct root. If the polynomial were reducible over , choose a monic proper factor of degree , with . In the splitting field it must be . Its coefficient of is , which belongs to . Since is nonzero and thus invertible in the field , this forces , contradicting the absence of a root there. Therefore is irreducible over .
Suppose a rational function , with nonzero polynomials , had th power . Then , so comparison of degrees would give , impossible modulo . Thus has no root in , and part (b) proves it is irreducible.
In a splitting field containing with ,It has one distinct root with multiplicity , so it is inseparable. This is the purely inseparable polynomial over a rational function field.
A primitive seventh root of unity generates all roots. Its minimal polynomial of an algebraic element is the permitted irreducible cyclotomic polynomial . Hence the splitting field has
The sixth roots of unity all belong to , where . Its minimal polynomial of an algebraic element is , which has no rational root. Thus the splitting field is and
In characteristic two, the binomial theorem gives . The only root is already in , so the splitting field is the original field, despite the repeated root:
Write , where is the characteristic. In a splitting field of over , let be its set of roots. The derivative of this polynomial is , so all roots are distinct. The Frobenius power is additive and multiplicative: and . Thus roots are closed under addition, negatives and multiplication; for a nonzero root, . They include and form a field.
Every satisfies , by Lagrange's theorem on and separately at zero. Iterating gives , so . The constructed field therefore contains and has exactly .
A splitting field of over is an extension field in which factors into linear factors and which is generated over by those roots. The generation requirement excludes unnecessary extra elements.
For existence, induct on the degree. An irreducible factor of gives a field , since an irreducible polynomial generates a maximal ideal in the polynomial ring over a field. The class of is a root of and hence of . By the factor theorem, over , with . Induction gives a splitting field of over . It contains all roots of ; taking the subfield generated by these roots over gives exactly a splitting field of . The degree-one case is immediate. Thus
To show that adjoining doubles the degree, suppose with rational . Squaring and using irrationality of gives . If , then ; if , then . Neither is a rational square, as the prime exponents in a rational square are even. Thus . Its quadratic polynomial remains irreducible over that field, and the tower law givesA basis is .
Pure-power reduction of a monic irreducible polynomial Created 2026-10-05 Updated 2026-10-06
Suppose a Non-Archimedean absolute value extends uniquely to every finite extension. If is monic and irreducible, every root has absolute value at most one: otherwise its leading power dominates all lower terms, contradicting by the ultrametric inequality. In a splitting field, let be the minimal polynomial of an algebraic element of the residue of one root. Lift its coefficients to . The lift has absolute value less than one at that root and hence, by equal absolute values of algebraic conjugates, at every root. Consequently every root residue is a zero of . Since reduction preserves the product of the linear factors with multiplicities, every irreducible factor of is , proving the displayed identity for some .
For even , the roots of form an -dimensional vector space over . Ratios for a nonzero root show that the splitting field contains every . The subgroup fixing that quadratic constant extension is normal of index two and lies in ; applying projective transitivity over makes it contain . It therefore normalizes that special linear group, while the full group acts semilinearly.
For an odd prime , this Eisenstein polynomial generates a totally ramified cubic root field. Its discriminant is . For the unit part is a square exactly when . The splitting field then has cyclic Galois group of order three; otherwise it has symmetric group , with an unramified extension of degree two and inertia group . Both cases are tamely ramified, so all positive ramification groups are trivial.
At , adjoining gives a ramified quadratic subfield, and the splitting field has total ramification index six. A root has normalized valuation two, while has valuation three, so is a uniformizer. The derivative has valuation six, and all distinct root differences have valuation three. A three-cycle fixes , giving . A transposition fixing negates , giving valuation one; conjugation handles the other transpositions. Hence , , and for . The different exponent is seven.
Repeated-root parity-check matrix 2026-10-14
If the generator polynomial of a cyclic code has distinct roots with multiplicities , a word belongs to the code exactly when for , where is its Hasse derivative. The corresponding rows have entries for and zero otherwise. Expansion in a basis of the splitting field gives equations over the original finite field; an independent selection has rank .
For a cyclic code whose generator polynomial has distinct roots in a splitting field , the rows impose precisely the codeword conditions . Expanding each value in a basis of over the original finite field, then discarding dependent equations, gives a parity-check matrix over that field of rank . Alternatively choose one root from each Frobenius conjugate orbit and expand its value in the field it generates.
Schinzel-Tijdeman exponent theorem Created 2026-10-14 Updated 2026-10-20
For a fixed polynomial with at least two distinct complex roots, integer solutions with and have an effectively bounded exponent. Factorization over a splitting field and the fixed differences between distinct roots control common ideal divisors. Outside a fixed set of primes, each factor's valuation is divisible by , where is its root multiplicity. The generalized power-equation estimates from linear forms in logarithms of algebraic numbers, including unit and exceptional-prime factors, give the exponent bound. A single-root polynomial and the values cannot be included: , and for , give infinite exponent families.
Suppose an irreducible monic integral cubic has discriminant for a prime , and let be its splitting field. Its Galois group is and its quadratic subfield is . The extension over that subfield is cyclic cubic and everywhere unramified. Away from , separable reduction and Hensel lemma put the roots in an unramified local extension. At , discriminant valuation one gives a double residue root and a separate simple root; lift the simple root, and the remaining quadratic's discriminant has square class . Its splitting field is already the quadratic subfield's completion. The imaginary quadratic base has no real places.