Riemann existence: a surjection from gives a Galois extension of
OpenInverseGalois.riemann_existence_realizable_complexLet be a finite set, let be a point of , let be a finite group, and suppose there is a surjective group homomorphism
Then is the Galois group of a Galois extension of the rational function field .
This is the function-field form of the Riemann existence theorem, and it is the unconditional geometric input to the whole inverse Galois problem. The kernel of has finite index , so covering space theory produces a connected covering of degree whose group of deck transformations is . The Riemann existence theorem says that this purely topological covering of a smooth affine complex curve carries a unique structure of smooth affine algebraic curve over for which the covering map is algebraic; equivalently, every finite topological covering of is the analytification of an algebraic one. Passing to function fields, is a finite Galois extension of whose Galois group is the deck group .
What the statement does not provide is any control over the field of constants. The extension produced is an extension of , and descending the constants from to — the step that Hilbert's irreducibility theorem performs once the constants are already rational — is exactly what separates this theorem from the inverse Galois problem over .
Degenerate cases are included: for the plane is simply connected, so the hypothesis forces to be trivial, and the trivial group is realized by the extension .
Formalization Note. The punctured plane is presented as the subtype of consisting of the points lying outside the finite set , carrying its subspace topology. The hypothesis is a surjection of abstract groups; since is finite, its kernel automatically has finite index, which is all the argument uses.
import Mathlib import Definitions.Def_InverseGalois_realizability
namespace InverseGalois
theorem riemann_existence_realizable_complex
{G : Type*} [Fintype G] [Group G]
(S : Finset ℂ) (x : ℂ) (hx : x ∉ (S : Set ℂ))
(φ : FundamentalGroup {z : ℂ // z ∉ (S : Set ℂ)} ⟨x, hx⟩ →* G)
(hφ : Function.Surjective φ) :
IsRealizable (RatFunc ℂ) G := by sorry
end InverseGalois