🔢 mathematics

A note on Galois groups of linearized polynomials

This paper settles an open conjecture by providing a unified proof, based on Hensel's Lemma, that the Galois group of $L(X)/X-t$ over $F_q(t)$ is $GL_n(q)$ for any monic $q$ -linearized polynomial $L(X)$ of degree $q^n$ (where $n$ is an odd prime) and any prime power $q$ , including the previously unresolved case of even $q$ .

Original authors: Peter Müller

Published 2026-05-19

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Peter Müller

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

Imagine you are a mathematician trying to solve a giant, complex puzzle. In this specific puzzle, the pieces are numbers and equations, and the goal is to understand the hidden "symmetry" or "structure" of a particular type of equation.

This paper, written by Peter Müller, is about solving a specific riddle regarding linearized polynomials. Here is the story of what he did, explained without the heavy math jargon.

The Main Character: The Polynomial

Think of a polynomial as a machine that takes a number, does some math to it, and spits out a new number.

The author is looking at a special kind of machine called a $q$ -linearized polynomial.
These machines have a very specific rule: they only work with powers of $q$ (like $x$ , $x^q$ , $x^{q^2}$ , etc.).
The author is interested in a machine of a specific size, determined by a number $n$ .

The Mystery: The Galois Group

When you feed this machine a random number (let's call it $t$ ), it usually produces a list of answers (roots). The Galois group is like a "symmetry group" for these answers. It describes all the different ways you can shuffle these answers around without breaking the rules of the equation.

The Big Question: What does this symmetry group look like?
The Previous Discovery: In 2023, two other mathematicians (Gow and McGuire) proved that for most of these machines, the symmetry group is the biggest, most chaotic group possible (called $GL_n(q)$ ).
The Catch: They could only prove this when the number $q$ was an "odd" power. They were stuck on the "even" powers. They guessed the rule held true for even powers too, but they couldn't prove it.

The Solution: A Unified Key

Peter Müller steps in and says, "I can prove it for all cases, odd and even, using a single, elegant tool."

His tool is called Hensel's Lemma.

The Analogy: Imagine you are trying to open a locked door (the equation). You know the door is locked, but you have a master key (Hensel's Lemma) that lets you peek through a tiny crack in the door to see the mechanism inside.
Instead of trying to force the whole door open at once, Müller uses this lemma to look at the equation in a "zoomed-in" world (using something called power series).
In this zoomed-in world, the complex equation breaks apart into simpler pieces. He shows that these pieces have specific "weights" or "multiplicities" (how many times a root appears).

The "Aha!" Moment

Müller uses a clever trick involving divisibility (like checking if one number fits perfectly into another).

He proves a general rule (Proposition 2): If your polynomial has certain "heavy" roots, the symmetry group must be large enough to hold them.
He then applies this to the specific problem. He shows that if the symmetry group wasn't the biggest possible group, the numbers wouldn't add up. The math would force a contradiction (like trying to fit a square peg in a round hole).
The only way the math works is if the symmetry group is indeed the massive, chaotic one ( $GL_n(q)$ ), unless the machine is a very boring, simple one (just $X^{q^n}$ ).

The Takeaway

Before this paper, we knew the rule worked for odd numbers and guessed it worked for even ones.
This paper confirms the guess.

Müller didn't just solve the "even" case; he found a unified proof that covers every single possibility at once. He used a mathematical "microscope" (Hensel's Lemma) to look at the roots of the equation, counted their properties, and showed that the only logical conclusion is that the symmetry group is as big as it possibly can be.

In short: The paper closes a door that was left slightly ajar, proving that for a wide class of mathematical machines, the internal symmetry is always as wild and complex as we hoped, provided the machine isn't a trivial exception.

Technical Summary: A Note on Galois Groups of Linearized Polynomials

Problem Statement
The paper addresses the determination of the Galois group of the polynomial $L(X) - t$ over the field of rational functions $\mathbb{F}_q(t)$ , where $L(X)$ is a monic $q$ -linearized polynomial of $q$ -degree $n$ . A $q$ -linearized polynomial is defined as $L(X) = \sum_{i=0}^n a_i X^{q^i}$ with coefficients in $\mathbb{F}_q$ and $a_n \neq 0$ .

Previous work by Gow and McGuire [2] established that if $q$ is an odd prime power and $n$ is an odd prime, the Galois group is the general linear group $\text{GL}_n(q)$ , except in the trivial case where $L(X) = X^{q^n}$ . However, the case where $q$ is an even prime power remained open, though it was conjectured that the result holds generally. The specific challenge is to determine the Galois group for all prime powers $q$ under the condition that $n$ is an odd prime.

Methodology
The author employs a unified approach utilizing Hensel's Lemma and the Eisenstein irreducibility criterion within the context of formal power series rings. The core of the methodology involves:

Reduction to Divisibility: Instead of directly computing the Galois group, the proof focuses on establishing specific divisibility properties of the group's order.
Hensel's Lemma Application: The paper introduces a lemma (Lemma 3) concerning the factorization of $f(X) - g(y)$ over a field of formal Laurent series $E((z))$ . By analyzing roots of multiplicity $a$ and $b$ (where $\gcd(a,b)=1$ ) for polynomials $f$ and $g$ , the author demonstrates that the degree $a$ divides the order of the Galois group of $f(X) - g(y)$ .
Newton Polygons (Alternative View): Remark 4 notes that the same result can be derived using Newton polygons, specifically analyzing the valuation of roots to determine irreducibility over the relevant field.
Group Theoretic Classification: The proof relies on a classification result for subgroups of $\text{GL}_n(q)$ containing a Singer cycle (an element permuting non-zero elements of $\mathbb{F}_q^n$ cyclically). This result, originally cited from [2] and [3], states that such a subgroup $G$ must satisfy $\text{GL}_{n/d}(q^d) \le G \le \Gamma\text{L}_{n/d}(q^d)$ for some divisor $d$ of $n$ .

Key Contributions and Results

Proposition 2 (Divisibility Result): The paper proves a general divisibility result for the order of the Galois group. For a polynomial $L(X) = \sum_{i=m}^n a_i X^{q^i}$ with $1 \le m \le n-1$ , $a_m, a_n \neq 0$ , the order of the Galois group of $L(X) - t$ over $\mathbb{F}_q(t)$ is divisible by $q^m \cdot (q^m - 1) \cdot (q^n - 1)$ . This result holds for any prime power $q$ and positive integer $n$ , without requiring $n$ to be prime or odd.
Theorem 1 (Main Result): By combining Proposition 2 with the group theoretic classification, the author settles the conjecture for all prime powers $q$ $q$ .
- Statement: Let $q$ be a prime power and $n$ an odd prime. If $L(X)$ is a monic $q$ -linearized polynomial of $q$ -degree $n$ , the Galois group of $L(X) - t$ over $\mathbb{F}_q(t)$ is $\text{GL}_n(q)$ , unless $L(X) = X^{q^n}$ .
- Proof Logic: The Galois group $G$ is known to be a subgroup of $\text{GL}_n(q)$ containing a cyclic regular subgroup of order $q^n - 1$ . Group theory dictates $G = \text{GL}_n(q)$ or $G \le \Gamma\text{L}_1(q^n)$ . If $G \neq \text{GL}_n(q)$ , the divisibility condition from Proposition 2 implies $q^m \mid n$ . Since $n$ is prime, this forces $m=1$ and $q=n$ . However, this leads to a contradiction ( $n-1 \mid 1$ ), proving that no such intermediate term $a_m$ exists, thus $L(X)$ must be the excluded monomial case.

Significance
The paper claims to settle the open case of even $q$ for the theorem originally proposed by Gow and McGuire. The primary significance lies in providing a unified proof for all prime powers $q$ using Hensel's Lemma, rather than relying on case-specific arguments. The author explicitly notes that while the group theoretic classification used in the final step depends on the classification of finite simple groups (or specific results by Kantor [3] avoiding it), the core algebraic machinery (Proposition 2) is self-contained and applies broadly to the structure of linearized polynomials. The work extends the known scope of the Galois group behavior of these polynomials from odd prime powers to the complete set of prime powers.