Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Alternating groups are realizable over Q(t)\mathbb{Q}(t)Q(t)

Open
InverseGalois.regular_inverse_galois_alternating

by burkh4rt · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebragalois-theorygroup-theorynumber-theory

For every natural number nnn, the alternating group AnA_nAn​ is the Galois group of a Galois extension of the rational function field Q(t)\mathbb{Q}(t)Q(t). A realization of a group over Q(t)\mathbb{Q}(t)Q(t) is called regular.

This is the geometric half of Hilbert's theorem that AnA_nAn​ is realizable over Q\mathbb{Q}Q; combined with the specialization step supplied by Hilbert's irreducibility theorem (InverseGalois.inverse_galois_problem_hilbert_descent), it yields realizability of AnA_nAn​ over Q\mathbb{Q}Q itself.

Unlike the symmetric case, AnA_nAn​ is not the Galois group of the generic polynomial of degree nnn, and the fundamental theorem of symmetric functions gives no purchase: the field of AnA_nAn​-invariant rational functions in nnn variables is Q(e1,…,en)(δ)\mathbb{Q}(e_1,\dots,e_n)(\delta)Q(e1​,…,en​)(δ), where e1,…,ene_1,\dots,e_ne1​,…,en​ are the elementary symmetric polynomials and δ=∏i<j(xi−xj)\delta = \prod_{i<j}(x_i-x_j)δ=∏i<j​(xi​−xj​), and whether that field is purely transcendental over Q\mathbb{Q}Q is Noether's problem for AnA_nAn​, settled affirmatively only for n≤5n \le 5n≤5 and open for n≥6n \ge 6n≥6. Hilbert's construction therefore proceeds not through invariants of the natural permutation action but through an explicitly chosen one-parameter family.

The construction of the source. Normalize the trinomial family as

g(y,t)  =  yn−nty+(n−1)t.g(y,t) \;=\; y^n - nty + (n-1)t .g(y,t)=yn−nty+(n−1)t.

Its Galois group over Q(t)\mathbb{Q}(t)Q(t) is the full symmetric group SnS_nSn​: the family is irreducible over Q(t)\mathbb{Q}(t)Q(t), its group is doubly transitive, and specializing at t=1t = 1t=1 — where ggg acquires a double root at y=1y = 1y=1 and n−2n-2n−2 simple roots — exhibits a transposition; a finite doubly transitive permutation group containing a transposition is the full symmetric group. The discriminant is

disc⁡yg(y,t)  =  (−1)n(n−1)2 nn(n−1)n−1 tn−1(1−t),\operatorname{disc}_y g(y,t) \;=\; (-1)^{\frac{n(n-1)}{2}}\, n^n (n-1)^{n-1}\, t^{n-1}(1-t),discy​g(y,t)=(−1)2n(n−1)​nn(n−1)n−1tn−1(1−t),

which is not in general a square, consistent with the group being SnS_nSn​ rather than AnA_nAn​.

The subextension fixed by AnA_nAn​ is the quadratic extension of Q(t)\mathbb{Q}(t)Q(t) obtained by adjoining a square root of this discriminant, and the content of the construction is that this quadratic extension is again a rational function field. It is exhibited by a substitution depending on the parity of nnn.

Odd degree. Put t=1−(−1)n(n−1)2nu2t = 1 - (-1)^{\frac{n(n-1)}{2}} n u^2t=1−(−1)2n(n−1)​nu2. The discriminant becomes

nn+1(n−1)n−1tn−1u2,n^{n+1}(n-1)^{n-1} t^{n-1} u^2,nn+1(n−1)n−1tn−1u2,

a square when nnn is odd, since then n+1n+1n+1, n−1n-1n−1 and n−1n-1n−1 are all even.

Even degree. Put t=(1+(−1)n(n−1)2(n−1)u2)−1t = \bigl(1 + (-1)^{\frac{n(n-1)}{2}}(n-1)u^2\bigr)^{-1}t=(1+(−1)2n(n−1)​(n−1)u2)−1. The discriminant becomes

nn(n−1)ntnu2,n^n (n-1)^n t^n u^2,nn(n−1)ntnu2,

a square when nnn is even.

In either case ttt is a rational function of uuu of degree two, so Q(u)\mathbb{Q}(u)Q(u) is a quadratic extension of Q(t)\mathbb{Q}(t)Q(t); and in either case the square root of the discriminant equals uuu times an element of Q(t)\mathbb{Q}(t)Q(t), so that quadratic extension is exactly Q(t)(disc⁡)=Q(u)\mathbb{Q}(t)(\sqrt{\operatorname{disc}}) = \mathbb{Q}(u)Q(t)(disc​)=Q(u). By the Galois correspondence the group of ggg over Q(u)\mathbb{Q}(u)Q(u) is the index-two subgroup of SnS_nSn​ fixing disc⁡\sqrt{\operatorname{disc}}disc​, namely AnA_nAn​. Hence AnA_nAn​ is regularly realized over the rational function field Q(u)\mathbb{Q}(u)Q(u), which is the assertion.

Small nnn is included: for n≤2n \le 2n≤2 the group AnA_nAn​ is trivial, and for n=3n = 3n=3 it is cyclic of order three.

Preamble
import Mathlib
import Definitions.Def_InverseGalois_realizability
Formal statement
namespace InverseGalois

theorem regular_inverse_galois_alternating (n : ℕ) :
    IsRealizable (RatFunc ℚ) (alternatingGroup (Fin n)) := by sorry

end InverseGalois
Source
Inverse Galois problem, Wikipedia, https://en.wikipedia.org/wiki/Inverse_Galois_problem (revision of 13 September 2026), sections 'Symmetric and alternating groups' and 'Alternating groups' (the family g(y,t) = y^n - nty + (n-1)t, its discriminant (-1)^(n(n-1)/2) n^n (n-1)^(n-1) t^(n-1)(1-t), and the odd- and even-degree substitutions t = 1 - (-1)^(n(n-1)/2) n u^2 and t = 1/(1 + (-1)^(n(n-1)/2)(n-1)u^2)); Hilbert's irreducibility theorem and regular realizations as in Serre, Topics in Galois Theory, ch. 3; Noether's problem for A_n as in Maeda, 'Noether's problem for A_5', J. Algebra 125 (1989), 418-430

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me