🔢 mathematics

Simple Lie Groups of type An as Galois groups over Q

This paper utilizes previous results on mod $p$ monodromy of cyclic coverings to construct the first fully explicit infinite series of Galois extensions over $\mathbb{Q}$ with groups $PSL(n, q)$ and $PSU(n, q)$ that simultaneously have arbitrarily large degrees and are distinct from $PGL(n, q)$ and $PGU(n, q)$ .

Original authors: Stepan Nesterov

Published 2026-05-01

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Stepan Nesterov

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: The "Inverse Galois Problem"

Imagine you have a massive library of all possible "symmetry puzzles" (mathematical groups). The Inverse Galois Problem is a challenge that asks: "For every single one of these puzzles, can we build a specific mathematical structure (a field extension of the rational numbers, $\mathbb{Q}$ ) that has exactly that puzzle as its set of symmetries?"

For some easy puzzles (like shuffling a deck of cards), mathematicians have known the answer for a long time. For others, it's been a mystery. This paper solves the mystery for a huge, previously unreachable family of complex puzzles called Simple Lie Groups (specifically types $PSL$ and $PSU$).

The Main Achievement

Before this paper, mathematicians could only build these specific symmetry puzzles if the "ingredients" (the size of the number system, $q$ ) were small or if the puzzle size ( $n$ ) was small.

Nesterov's breakthrough is like finding a master key that opens a door to an infinite hallway. He proves that you can build these puzzles where:

The puzzle is arbitrarily large (you can make the group as complex as you want).
The ingredients are arbitrarily complex (the number system can be huge).
The rules for building them are explicit. He doesn't just say "it's possible somewhere"; he gives you the exact recipe (congruence conditions) to bake the cake.

The Recipe: How It Works

To build these symmetries, the author uses a method involving curves (shapes) and coverings (layers).

1. The Base Layer: The Projective Line

Think of the "Projective Line" ( $\mathbb{P}^1$ ) as a simple, infinite rubber band or a circle. It's the simplest shape in this context.

2. The Cyclic Covering: The Spiral Staircase

Imagine taking that rubber band and wrapping a spiral staircase around it.

The staircase has $l$ steps (where $l$ is a specific prime number).
At certain points on the rubber band (called "branch points"), the staircase twists and connects back to itself.
This creates a new, more complex shape (a curve) sitting on top of the original rubber band.

3. The Deck Transformation: The Rotating Handle

The staircase has a special property: if you rotate the whole structure by one step, it looks exactly the same. This rotation is called a deck transformation.

In the past, if you tried to build this staircase using only rational numbers (fractions), the rotation wouldn't work properly; the staircase would look "broken" or asymmetrical.
Nesterov's trick: He carefully chooses the locations of the "twist points" (branch points) so that the entire staircase, including the rotation mechanism, is perfectly defined using only rational numbers. This is called Galois descent.

4. The Cohomology: The Fingerprint

Once the staircase is built, the author looks at its "fingerprint" (mathematically, its etale cohomology).

Think of the fingerprint as a pattern of holes and loops in the shape.
Because of the rotation mechanism, this fingerprint organizes itself into a grid (a vector space).
The symmetries of the rational numbers (the Galois Group) act on this fingerprint. The author proves that this action creates the exact complex puzzle (the group $PSL$ or $PSU$) he wanted to find.

The Hurdles and Solutions

There were two main problems to solve to make this work:

Problem A: The "Broken" Symmetry
Usually, when you build these shapes over rational numbers, the symmetry group you get is slightly "too big" or "too messy." It includes extra rotations that shouldn't be there.

The Fix: The author had to prove that the "messy" parts (specifically the determinant of the transformation) cancel out perfectly under certain conditions. He used a technique called degeneration.
The Analogy: Imagine trying to prove a rule works for a complex, twisting staircase. Instead of analyzing the twist directly, he imagines the staircase collapsing into a simple chain of straight lines (rational curves). If the rule holds for the collapsed version, and the transition is smooth, it must hold for the complex version too. He used a specific, well-known mathematical object (related to modular forms) to prove this "collapse" works.

Problem B: The "Size" Mismatch
The author had to ensure that the size of the puzzle ( $n$ ) and the size of the number system ( $q$ ) fit together perfectly.

The Fix: He derived a set of strict "congruence conditions" (mathematical rules about remainders). For example, if you pick a prime number $p$ and a prime $l$ , you can only build the puzzle if $n$ and $p$ satisfy specific relationships (like $n$ not being divisible by 3, or $p$ being of the form $12k+7$ ).

The Result: A New Infinite Series

The paper concludes with a list of "recipes." For example:

If you pick a prime $p$ that is 1 more than a multiple of 3 ( $p = 3k+1$ ), and you pick a dimension $n$ that isn't divisible by 3, you can build the group $PSL(2n, p)$.
If you pick a prime $p$ that is 1 less than a multiple of 5 ( $p = 5k-1$ ) and $n$ is odd, you can build $PSL(2n, p^2)$ .

These recipes allow mathematicians to generate an infinite number of these complex symmetry groups, all defined over the rational numbers, with sizes and complexities that can be as large as they desire.

Summary

In short, Stepan Nesterov found a way to construct an infinite family of incredibly complex mathematical symmetry puzzles using only rational numbers. He did this by building special "spiral staircases" over a circle, ensuring the stairs rotate perfectly, and proving that the resulting pattern of holes matches the specific puzzle he wanted. This solves a long-standing piece of the Inverse Galois Problem for a class of groups that was previously out of reach.

1. Problem Statement

The Inverse Galois Problem asks whether every finite group can be realized as the Galois group of a Galois extension of the rational numbers $\mathbb{Q}$ . While the problem is solved for alternating groups ( $A_n$ ) and symmetric groups ( $S_n$ ), and for many simple groups of Lie type over prime fields ( $\mathbb{F}_p$ ) via the rigidity method, a significant gap remains for simple groups of Lie type over finite fields $\mathbb{F}_q$ where $q$ is a prime power (not a prime).

Specifically, existing methods often fail to provide:

Explicit infinite families where the rank $n$ of the group is arbitrarily large.
Cases where the field of definition $\mathbb{F}_q$ has an arbitrarily large degree over the prime field.
Realizations of groups $PSL(n, q)$ and $PSU(n, q)$ that are distinct from their projective general counterparts ($PGL, PGU$) under these general conditions.

2. Methodology

The author employs a geometric approach utilizing étale cohomology of cyclic coverings of the projective line $\mathbb{P}^1$ . The core strategy involves:

Geometric Construction: Constructing cyclic coverings of $\mathbb{P}^1$ of prime degree $l$ , branched at specific points. The deck transformation group acts on the cohomology of these curves, endowing it with the structure of a vector space over $\mathbb{F}_q$ .
Galois Descent: A critical technical hurdle is ensuring the covering and its deck transformations are defined over $\mathbb{Q}$ . The author uses the action of the absolute Galois group $G_\mathbb{Q}$ on the fundamental group to derive conditions on the branch points (specifically, they must form full Galois orbits of $\mathbb{Q}(\zeta_l)$ ) to ensure the covering descends to $\mathbb{Q}$ .
Monodromy Analysis: The paper leverages previous results on the monodromy of pure braid groups acting on the cohomology of these coverings. Depending on the parity of $\frac{l-1}{\text{ord}_l(p)}$ , the geometric monodromy group is identified as either a subgroup of $SLU(n-1, q)$ (unitary case) or $SL(n-1, q)$ (linear case).
Determinant Analysis: To prove the image is the simple group ($PSL$ or $PSU$) rather than the larger projective group ($PGL$ or $PGU$), the author analyzes the determinant of the Galois representation.
- The determinant is shown to be of the form $\varepsilon^k \psi$ , where $\varepsilon$ is the cyclotomic character and $\psi$ is a finite-order character.
- The author proves that the "error term" $\psi$ has odd order. This is crucial because the obstruction to being in the simple group usually lies in the 2-torsion of the determinant.
Degeneration Technique: To prove the character $\psi$ has odd order without explicit computation for all curves, the author uses a degeneration argument. They degenerate a specific modular curve ( $X_0(l^2)$ ) with known cohomology properties (where the determinant is known to be of odd order) to a singular curve (a union of rational curves). By showing the determinant property is preserved under this degeneration and applying a rigidity lemma (Proposition 11), the result extends to the general family of cyclic coverings.

3. Key Contributions

First Explicit Infinite Series: This is the first work to realize an infinite series of groups $PSL(n, q)$ and $PSU(n, q)$ as Galois groups over $\mathbb{Q}$ where both the rank $n$ and the field degree $[\mathbb{F}_q : \mathbb{F}_p]$ can be arbitrarily large.
Refinement of the Rigidity Method: While the rigidity method works for prime fields, this paper extends the realization to prime power fields $q = p^k$ with explicit congruence conditions.
Determinant Control: The paper provides a rigorous proof that the Galois image lands exactly in the simple group (or an index-2 subgroup) by controlling the determinant character, overcoming a common limitation in geometric Galois realization where the image is often only known to be "large" but not specifically simple.

4. Main Results (Theorem 1)

Let $l$ be an odd prime, $n$ a natural number ( $n \not\equiv -2 \pmod l$ ), and $e = \text{ord}_l(p)$ .

Case A: Linear Groups ($PSL$)
If $\frac{l-1}{e}$ is even, then $PSL((l-1)n - 2, p^e)$ is a Galois group over $\mathbb{Q}$ .

Case B: Unitary Groups ($PSU$)
If $\frac{l-1}{e}$ is odd, and additional congruence conditions are met (specifically related to the 2-adic valuation of $p+1$ and $n$ ), then $PSU((l-1)n - 2, p^{e/2})$ is a Galois group over $\mathbb{Q}$ .

Specific Corollaries:
The paper lists several concrete infinite families derived from these conditions, including:

$PSL(2n, p)$ for $p \equiv 1 \pmod 3$ and $3 \nmid n$ .
$PSL(2n, p^2)$ for $p \equiv 4 \pmod 5$ and $n$ odd.
$PSU(2n, p)$ for $p \equiv 7 \pmod{12}$ and $3 \nmid n$ .
$PSU(l-3, p^{(l-1)/2})$ where $p$ is a primitive root modulo $l$ ( $l \equiv 1 \pmod 4$ ).

5. Significance

Resolution of Open Cases: It solves the Inverse Galois Problem for a vast new class of simple groups of Lie type that were previously inaccessible via standard rigidity or automorphic form methods (which often lack effectiveness regarding the specific field $\mathbb{F}_q$ ).
Explicitness: Unlike results relying on the existence of automorphic forms with full image (which are often non-effective regarding the specific coefficient field), this paper provides explicit congruence conditions on $p, l,$ and $n$ to guarantee the realization.
Methodological Advancement: The combination of Galois descent for cyclic coverings, $p$ -adic Hodge theory (to analyze the determinant), and degeneration techniques from modular curves offers a powerful new toolkit for constructing Galois representations with specific simple images.

In summary, Nesterov successfully bridges the gap between topological monodromy and arithmetic Galois theory to realize complex simple groups over $\mathbb{Q}$ , providing a fully explicit and infinite family of solutions to the Inverse Galois Problem for type $A_n$ groups over non-prime finite fields.