Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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 general polynomial of degree n has Galois group Sn

Statement

Let F be a field and let X1,…,Xn be algebraically independent over F. Write e1,…,en for the elementary symmetric polynomials in the Xi, let

E:=F(e1,…,en)⊆L:=F(X1,…,Xn),

and let

g(t):=∏i=1n(t−Xi)=tn−e1tn−1+⋯+(−1)nen∈E[t].

Then L is the splitting field of g over E, and

Gal⁡(L/E)≅Sn.

Facts & Assumptions

Given: The field F, the indeterminates X1,…,Xn, the rational function field L=F(X1,…,Xn), the subfield E=F(e1,…,en), and the polynomial g(t) above.

[L1]

Every symmetric polynomial is uniquely a polynomial in the elementary symmetric polynomials (Fundamental theorem of symmetric polynomials: unique expression as a polynomial in e1,…,en).

[L2]

For every field A, the one-variable rational function field A(t) is the field of fractions of A[t] (For a field F, F(t)=Frac⁡(F[t]) is its rational function field; in particular R(t)=Frac⁡(R[t])).

[L3]

Artin's fixed-field theorem says that if a finite automorphism group G acts on a field L, then [L:LG]=∣G∣ and Aut⁡(L/LG)=G (Artin's fixed-field theorem: [K:KG]=∣G∣ and Aut⁡(K/KG)=G).

[L4]

A finite extension is Galois exactly when it is the splitting field of a separable polynomial (Equivalent characterizations of a finite Galois extension).

Proof

technique · direct
1.1givenalgebra

The polynomial g(t) belongs to E[t] by construction and splits in L with roots X1,…,Xn. Since L is generated over F by the Xi, it is generated over E by those same roots, so L is the splitting field of g over E.

1.2L1algebra

Every permutation π∈Sn acts on L by π(Xi)=Xπ(i). Because each ej is symmetric, [L1] makes every ej fixed by this action, so Sn≤Aut⁡(L/E).

2.1L1L2L3algebra

Conversely, let h∈LSn. Iterating [L2] and clearing coefficient denominators writes h=f/g with f,g∈F[X1,…,Xn] and g≠0. Put D:=∏π∈Snπ(g). Then D is a nonzero symmetric polynomial, and hD=f∏π∈Snπ≠1π(g) is also a polynomial. Both h and D are fixed by Sn, so hD is symmetric as well. By [L1], both D and hD are polynomials in e1,…,en, hence h=(hD)/D∈F(e1,…,en)=E. The reverse inclusion is already in step 1.2, so LSn=E. Now [L3] yields [L:E]=∣Sn∣=n! and Aut⁡(L/E)=Sn.

3.1step 1.1step 2.1L4∎

Step 1.1 makes L/E the splitting field of g, and step 2.1 identifies its full automorphism group with Sn. Therefore Gal⁡(L/E)≅Sn.

Depends on

Used by

Dependency tree · two levels

24 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources