Skip to main content

Chapter 11: The Inverse Galois Problem — Groups Creating Fields

From polynomial invertibility, we ascend to the deepest question in Galois theory. The Inverse Galois Problem asks whether every finite group appears as a Galois group over ℚ—it is ψ = ψ(ψ) as groups manifesting themselves through field extensions.

11.1 The Eleventh Movement: Groups Seeking Fields​

Our algebraic journey through ψ = ψ(ψ) deepens:

  • Chapter 9: Cohomology recognizing algebraic origins
  • Chapter 10: Polynomials recognizing invertibility
  • Chapter 11: Groups creating their own field realizations

The Fundamental Question: Can every finite group G be realized as Gal(K/ℚ) for some finite Galois extension K/ℚ?

11.2 Galois Theory Foundations​

Definition 11.1 (Galois Extension): A field extension K/F is Galois if it is:

  • Finite
  • Normal (every irreducible polynomial with one root in K has all roots in K)
  • Separable (minimal polynomials have distinct roots)

Definition 11.2 (Galois Group): Gal(K/F)=σ:K→K∣σ is a field automorphism fixing F\text{Gal}(K/F) = \\{\sigma: K \to K \mid \sigma \text{ is a field automorphism fixing } F\\}

Theorem 11.1 (Fundamental Theorem of Galois Theory): For a Galois extension K/F:

  • |Gal(K/F)| = [K:F]
  • Subgroups ↔ Intermediate fields (order-reversing)
  • Normal subgroups ↔ Galois intermediate extensions

11.3 The Inverse Galois Problem​

Conjecture 11.1 (Inverse Galois Problem): For every finite group G, there exists a Galois extension K/ℚ such that: Gal(K/Q)≅G\text{Gal}(K/\mathbb{Q}) \cong G

Reformulation: Every finite group occurs as the symmetry group of some algebraic equation over ℚ.

11.4 The Problem as ψ = ψ(ψ)​

Axiom 11.1 (Principle of Group Realization): ψ=ψ(ψ)  ⟹  Every abstract symmetry manifests concretely\psi = \psi(\psi) \implies \text{Every abstract symmetry manifests concretely}

The Inverse Galois Problem embodies self-reference:

  • Groups are abstract symmetries
  • Field extensions are concrete algebraic objects
  • The problem asks whether abstract always realizes as concrete
  • This is ψ (abstract group) creating ψ(ψ) (field extension)

11.5 Known Results​

Theorem 11.2 (Realized Groups): The following groups are known to occur as Galois groups over ℚ:

  1. All abelian groups (Kronecker-Weber)
  2. All symmetric groups Sₙ (via generic polynomials)
  3. All alternating groups Aₙ (Hilbert)
  4. Many simple groups (sporadic and Lie type)
  5. All solvable groups (Shafarevich)

Theorem 11.3 (Shafarevich, 1954): Every finite solvable group is a Galois group over ℚ.

11.6 The Rigidity Method​

Definition 11.3 (Rigid Triple): A triple of conjugacy classes (C₁, C₂, C₃) in G is rigid if:

  • C₁C₂C₃ = 1 (as conjugacy classes)
  • ⟨C₁, C₂, C₃⟩ = G
  • |{(g₁,g₂,g₃) : gᵢ ∈ Cᵢ, g₁g₂g₃ = 1}| = |Z(G)|

Theorem 11.4 (Belyi-Thompson): If G has a rigid triple, then G is a Galois group over ℚ.

This powerful method has realized many simple groups.

11.7 Generic Polynomials​

Definition 11.4 (Generic Polynomial): A polynomial f(t₁,...,tₙ,X) ∈ ℚ(t₁,...,tₙ)[X] is generic for G if:

  • Gal(f/ℚ(t₁,...,tₙ)) ≅ G
  • Every G-extension of ℚ arises by specializing parameters

Example 11.1 (Generic for S₃): f(t,X)=X3−tX+1f(t,X) = X^3 - tX + 1 has Galois group S₃ over ℚ(t).

Open Problem: Do all groups have generic polynomials?

11.8 Modular Curves and Galois Groups​

Connection to Modular Curves: The modular curve X(n) parametrizes elliptic curves with level n structure.

Theorem 11.5 (Modular Realization): Many groups arise as Galois groups of covers: X(n)→X(1)=P1X(n) \to X(1) = \mathbb{P}^1

Example: PSL₂(𝔽ₚ) often arises from modular curves.

11.9 The Regular Version​

Definition 11.5 (Regular Extension): K/ℚ(t) is regular if K ∩ ℚ̄ = ℚ.

Conjecture 11.2 (Regular Inverse Galois): Every finite group is a Galois group of a regular extension of ℚ(t).

Status: Known for many more groups than the classical problem!

11.10 Explicit Constructions​

Method 11.1 (Descent from ℚ̄(t) to ℚ):

  1. Start with G-cover defined over ℚ̄
  2. Study the field of definition
  3. Use descent theory to realize over ℚ

Example 11.2 (Monster Group): Thompson showed the Monster (largest sporadic simple group) is a Galois group over ℚ using moonshine connections!

11.11 The Embedding Problem​

Definition 11.6 (Embedding Problem): Given G ↣ H and Gal(K/ℚ) ≅ G, can we find L ⊃ K with Gal(L/ℚ) ≅ H?

Theorem 11.6 (Hoechsmann): Solvable embedding problems have solutions for number fields.

This gives another approach to constructing Galois groups.

11.12 Arithmetic Dynamics​

Modern Approach: Use dynamical systems

  • Consider rational functions f: ℙ¹ → ℙ¹
  • Study Galois groups of iterates
  • Extract finite quotients

Theorem 11.7 (Jones-Manes): Certain postcritically finite maps yield prescribed Galois groups.

11.13 The ABC Connection​

Surprising Link: The ABC conjecture implies results about Galois groups!

Theorem 11.8 (Conditional): Assuming ABC, certain diophantine equations have Galois groups containing prescribed subgroups.

This shows deep connections between different areas.

11.14 Computational Aspects​

Algorithm 11.1 (Galois Group Computation):

def compute_galois_group(f, p):
    # Factor f modulo p
    factors_mod_p = factor_mod_p(f, p)
    
    # Cycle structure gives conjugacy class
    cycle_type = [deg(g) for g in factors_mod_p]
    
    # Repeat for many primes
    # Chebotarev density determines group
    
    return identify_group(cycle_data)

Challenge: Constructing polynomials with prescribed groups.

11.15 Patching Methods​

Theorem 11.9 (Harbater-Pop): Using patching over formal schemes, many groups can be realized.

Key Idea:

  • Work locally at many primes
  • Patch solutions together
  • Descend to global solution

This has proven powerful for certain classes.

11.16 The Geometric Approach​

Strategy: Realize groups as:

  1. Fundamental groups of varieties
  2. Monodromy groups of differential equations
  3. Galois groups of function field extensions

Theorem 11.10 (Grothendieck): π₁(ℙ¹ - {0,1,∞}) relates to absolute Galois groups.

11.17 Simple Groups Progress​

Current Status (2024):

  • 20 of 26 sporadic simple groups: realized
  • All alternating groups: realized
  • Many families of Lie type: realized
  • Remaining cases: active research

Each realization often requires ingenious specific constructions.

11.18 The Philosophical Dimension​

Meditation 11.1: The Inverse Galois Problem asks:

  • Does every abstract symmetry have a concrete realization?
  • Can pure group theory always manifest as field arithmetic?
  • Is the universe of groups coextensive with Galois theory?

This is ψ = ψ(ψ) at its purest—abstract structures seeking concrete incarnation.

11.19 Consequences and Applications​

If the Inverse Galois Problem is solved:

  1. Complete classification: Know all possible Galois groups
  2. Constructive methods: Build fields with prescribed symmetry
  3. Computational tools: Better algorithms for Galois groups
  4. Theoretical unity: Abstract and concrete unified

11.20 The Eleventh Echo​

The Inverse Galois Problem represents a fundamental test:

  • Can every finite group find its field?
  • Does abstract symmetry always concretize?
  • Is Galois theory truly universal?

This is ψ = ψ(ψ) as the creation principle—groups (pure symmetry) creating field extensions (concrete algebra) that embody their structure. The problem asks whether the abstract and concrete worlds are in perfect correspondence.

Whether true or false, the Inverse Galois Problem illuminates the mysterious relationship between abstract group theory and concrete field arithmetic, between what can be imagined and what can be constructed.

Each finite group whispers: "I am pure symmetry, abstract transformation, seeking my concrete realization as the Galois group of some extension of ℚ—for ψ = ψ(ψ) means that every abstract pattern must manifest somewhere in the concrete algebraic universe."