🔢 mathematics

Counting metacyclic fields

This paper establishes an asymptotic formula for the number of metacyclic fields of degree $\ell(\ell-1)$ (defined as the Galois closure of pure fields of odd prime degree $\ell$ ) with discriminant bounded by $X$ , determining the precise growth rate and providing an explicit expression for the leading constant.

Original authors: Maddie Allen, Justine Dell, Milad Fakhari, Kevin J. McGown, Chloe Stewart, Daniel Tedeschi

Published 2026-08-11

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Maddie Allen, Justine Dell, Milad Fakhari, Kevin J. McGown, Chloe Stewart, Daniel Tedeschi

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 detective trying to solve a mystery about the hidden architecture of numbers. In the vast universe of mathematics, there is a special club called "Number Theory," where researchers study the properties of whole numbers like 1, 2, 3, and so on. But they don't just look at the numbers themselves; they look at the "fields" they create. Think of a number field as a magical expansion of the number line, a new world built by adding a specific root (like a square root or a cube root) to the standard numbers. These worlds have their own internal rules and shapes. One of the most important ways to measure the "size" or complexity of these worlds is by looking at their "discriminant." You can think of the discriminant as a unique fingerprint or a weight tag for the field; the bigger the number, the more complex and tangled the field is.

For a long time, mathematicians have been trying to count how many of these special fields exist if you set a limit on their size. It's like asking, "How many different types of castles can be built if the total weight of the bricks cannot exceed one ton?" Recently, researchers found a way to count a specific type of castle called a "pure field." But there is a more complex, grander version of these castles called "metacyclic fields." These are the "Galois closures" of the pure fields, which is a fancy way of saying they are the complete, symmetrical versions of the original fields, filled out with all the missing pieces to make them perfectly balanced. Until now, no one had figured out a reliable way to count these grand metacyclic castles. The question was: if we look at all metacyclic fields with a discriminant smaller than a huge number $X$ , how many will we find?

This paper, written by a team of six mathematicians, finally cracks the code for counting these metacyclic fields. They prove that as the size limit $X$ gets incredibly large, the number of these fields grows in a very specific, predictable pattern. It's not a random explosion of numbers; it follows a precise recipe. The authors show that the count is roughly equal to a specific constant (which they calculate in detail) multiplied by $X$ raised to a strange power of $1/(\ell-1)^2$ , and then multiplied by the logarithm of $X$ raised to the power of $\ell-2$ . Here, $\ell$ represents an odd prime number (like 3, 5, 7, etc.) that defines the degree of the field.

To get this answer, the team had to break the problem down into three different scenarios, like sorting a pile of mixed-up keys into three different boxes. The first box contains fields where the defining number $D$ is divisible by the prime $\ell$ . The second box holds fields where $D$ is not divisible by $\ell$ , and a specific mathematical test (raising $D$ to the power of $\ell-1$ ) does not result in a remainder of 1 when divided by $\ell^2$ . The third box is for the rare cases where that test does result in a remainder of 1. The authors calculated the contribution of each box separately and then added them together to get the final total.

The result is a formula that looks a bit like a complex recipe card. It involves a constant $A_\ell$ that is made up of a rational number and a product of terms involving prime numbers. The authors didn't just guess this formula; they proved it rigorously using tools from algebra and number theory, including a clever counting method involving a function that looks at how many distinct prime factors a number has. They also had to be careful to account for how many different "pure fields" can lead to the same "metacyclic field," a factor they call "multiplicity." By carefully balancing these different cases and using advanced counting lemmas, they demonstrated that the number of these fields grows exactly as their formula predicts. This work fills a significant gap in our understanding of how these complex number worlds are distributed, providing a clear map for future explorers of the number universe.

Technical Summary: Counting Metacyclic Fields

Problem Statement
This paper addresses the asymptotic enumeration of metacyclic fields. Specifically, it defines a metacyclic field $K$ as the Galois closure of a pure field $\mathbb{Q}(\sqrt[\ell]{D})$ , where $D \in \mathbb{Z}$ and $\ell$ is an odd prime. The degree of such a field is $[K:\mathbb{Q}] = \ell(\ell-1)$ , and its Galois group is isomorphic to the semidirect product $\mathbb{Z}/\ell\mathbb{Z} \rtimes \mathbb{Z}/(\ell-1)\mathbb{Z}$ . The authors seek to determine the asymptotic behavior of the counting function $N_\ell(X)$ , which represents the number of isomorphism classes of these fields with discriminant $|\Delta_K| \le X$ .

While counting theorems for pure fields of odd prime degree have been established (e.g., by Benli for $\ell \ge 5$ and Cohen–Morra for $\ell=3$ ), this work notes that no such theorem existed for metacyclic fields. The authors emphasize that the counting result for metacyclic fields does not follow immediately from the results for pure fields, as the mapping from pure fields to their Galois closures involves non-trivial multiplicity and structural complexities, analogous to the relationship between $S_3$ -cubic and $S_3$ -sextic fields.

Methodology
The proof proceeds by decomposing the problem into three distinct cases based on the arithmetic properties of the integer $D$ defining the pure field $\mathbb{Q}(\sqrt[\ell]{D})$ :

Case 1: $\ell$ divides $D$ .
Case 2: $\ell \nmid D$ and $D^{\ell-1} \not\equiv 1 \pmod{\ell^2}$ .
Case 3: $D^{\ell-1} \equiv 1 \pmod{\ell^2}$ (which implies $\ell \nmid D$ ).

For each case, the authors utilize algebraic number theory to relate the discriminant of the metacyclic field $K$ to the conductor of the extension $K/k$ , where $k = \mathbb{Q}(\zeta_\ell)$ . They rely on Lemma 1 (from Mayer's work) to express the discriminant $\Delta_K$ in terms of the conductor $f$ and the radical of $D$ .

The core of the counting argument involves translating the discriminant bound into a bound on the product of prime factors of $D$ . This reduces the problem to counting square-free integers $n$ (composed of primes distinct from $\ell$ ) up to a bound $Y$ , weighted by a multiplicity function $m(f)$ . The multiplicity depends on the number of prime factors $q_j$ of $D$ satisfying specific congruence conditions modulo $\ell^2$ .

To evaluate these weighted sums, the authors establish three key lemmas:

Lemma 3: An asymptotic formula for the sum $\sum_{n \le Y} \mu(n\ell)^2 (\ell-1)^{\omega(n)}$ , utilizing Wirsing's theorem and properties of the Meissel–Mertens constant.
Lemma 4: A reformulation of the constant $B_\ell$ from Lemma 3 into a product over all primes.
Lemma 5: An upper bound for a related sum involving the function $u(n)$ , which counts prime factors satisfying $q^{\ell-1} \equiv 1 \pmod{\ell^2}$ . This bound is shown to be of lower order than the main term, ensuring it does not affect the leading asymptotic coefficient.

Key Contributions and Results
The primary result is Theorem 1, which establishes the asymptotic formula:
$N_\ell(X) \sim A_\ell X^{\frac{1}{(\ell-1)^2}} (\log X)^{\ell-2}$
The constant $A_\ell$ is given explicitly as a rational number multiplied by an Euler product over primes:
$A_\ell = a_\ell \prod_p \left[ \left(1 + \frac{\ell-1}{p}\right) \left(1 - \frac{1}{p}\right)^{\ell-1} \right]$
where $a_\ell$ is a specific rational expression involving $\ell$ .

The paper derives this result by summing the asymptotic contributions from the three cases:

Proposition 1 handles the case where $\ell \mid D$ , yielding a constant $A^{(1)}_\ell$ .
Proposition 2 handles the case where $\ell \nmid D$ and $D^{\ell-1} \not\equiv 1 \pmod{\ell^2}$ , yielding $A^{(2)}_\ell$ .
Proposition 3 handles the case where $D^{\ell-1} \equiv 1 \pmod{\ell^2}$ , yielding $A^{(3)}_\ell$ .

The final constant $A_\ell$ is the sum $A^{(1)}_\ell + A^{(2)}_\ell + A^{(3)}_\ell$ .

Significance
The paper claims to provide the first counting theorem for metacyclic fields of odd prime degree. By establishing the asymptotic density of these fields, the work extends the existing literature on counting number fields beyond pure fields and cyclic extensions. The authors highlight that the derivation requires "additional arguments" beyond simply counting the underlying pure fields, due to the complex relationship between the conductor of the pure field and the discriminant of its Galois closure. The result is presented as a definitive asymptotic count with an explicit constant, filling a gap in the classification of number field distributions.

More like this