🔢 mathematics

Mertens products in arithmetic progressions over function fields

This paper establishes a function field analogue of Mertens' formula for Euler products over primes in arithmetic progressions within $\mathbb{F}_q[t]$ , demonstrating that Weil's Riemann hypothesis allows for an asymptotic result of GRH-strength without the need for exceptional zero correction terms.

Original authors: Hwanyup Jung

Published 2026-02-06

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Hwanyup Jung

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 trying to count how many "prime" building blocks exist in a vast, infinite city made of polynomials instead of numbers. In the world of regular numbers (like 2, 3, 5, 7), mathematicians have a famous rule called Mertens' Theorem. It tells us exactly how the product of these primes behaves as we look at larger and larger numbers. It's like having a perfect map that predicts the density of trees in a forest as you walk further and further away.

However, this paper tackles a more specific, tricky version of that problem: What happens if we only look at primes that follow a specific pattern?

The Setting: A City of Polynomials

The author, Hwanyup Jung, is working in a mathematical universe called Function Fields. Think of this as a parallel universe where the "numbers" are actually polynomials (expressions like $t^2 + 1$ or $t^3 + t$ ) built over a finite field (a small, closed set of numbers).

In this universe:

Primes are irreducible polynomials (polynomials that can't be broken down further).
Arithmetic Progressions are like saying, "Only count the prime polynomials that leave a remainder of $A_0$ when divided by a specific polynomial $Q$ ." It's like saying, "Only count the trees in the forest that are exactly 3 steps away from a specific path."

The Problem: The "Ghost" in the Machine

In the world of regular integers, when mathematicians try to predict the behavior of primes in these patterns, they run into a ghost. This ghost is called an Exceptional Zero (or Siegel Zero). It's a mysterious, unpredictable glitch in the math that makes the predictions messy. To get a good answer in the regular number world, you often have to assume a famous hypothesis called the Generalized Riemann Hypothesis (GRH) to say, "Okay, let's pretend this ghost doesn't exist," or you have to add a complicated "correction factor" to your formula to account for it.

The Breakthrough: A Perfect World

This paper says: "In our polynomial universe, the ghost doesn't exist."

Thanks to a proof by the mathematician André Weil, we know for a fact that in this polynomial world, the "Riemann Hypothesis" is always true. There are no exceptions, no glitches, and no ghosts.

Because of this, the author can derive a clean, perfect formula for the product of these patterned primes without needing to make any guesses or add messy correction factors. It's the "Gold Standard" version of the prediction that mathematicians usually only dream of achieving in the regular number world.

The Result: A Crystal Clear Formula

The paper provides a specific formula (Theorem 2.1) that predicts the size of this product as you look at larger and larger degrees of polynomials.

The Main Term: It gives a precise value based on the complexity of the pattern (the modulus $Q$ ) and the specific remainder ( $A_0$ ).
The Error Term: It tells us how far off the prediction might be. In the regular number world, this error is often a bit fuzzy. Here, the error shrinks incredibly fast (exponentially) as you go further out. It's like the prediction becomes perfect almost instantly.

The Analogy: The Perfectly Organized Library

Imagine a library where books are arranged by a complex rule.

In the real world (Integers): The librarian tries to count books in a specific aisle. Sometimes, a book is misplaced in a way that breaks the pattern (the "Exceptional Zero"). The librarian has to guess or add a note saying, "Unless there's a misplaced book, the count is X."
In this paper (Function Fields): The librarian is in a library where the rules of physics guarantee that no book is ever misplaced. The shelves are perfectly organized by a law of nature. Therefore, the librarian can give you the exact count with a simple, clean formula, and they know for a fact that there are no hidden surprises lurking in the stacks.

Summary

Hwanyup Jung has successfully translated a famous, difficult problem about prime numbers into a polynomial world where the math is "cleaner." By proving that the chaotic "ghosts" (exceptional zeros) don't exist in this specific setting, the paper provides a definitive, unconditionally true formula for how these prime patterns behave. It's a "best-case scenario" result that mathematicians in the regular number world can only hope to achieve if their biggest unsolved hypothesis turns out to be true.

Technical Summary: Mertens Products in Arithmetic Progressions over Function Fields

Problem Statement
The paper addresses the asymptotic behavior of finite Euler products restricted to prime polynomials within specific arithmetic progressions over the polynomial ring $A = \mathbb{F}_q[t]$ . Specifically, it investigates the product:
$P(n; Q, A_0) := \prod_{\substack{P \in \mathcal{P}_{\le n} \\ P \equiv A_0 \pmod Q}} \left(1 - |P|^{-1}\right)$
as the degree $n \to \infty$ , where $Q$ is a monic polynomial modulus and $A_0$ is a reduced residue class modulo $Q$ . The goal is to establish a Mertens-type asymptotic formula for this product that holds uniformly with respect to the modulus $Q$ (allowing $\deg Q$ to grow with $n$ ) and the residue class $A_0$ .

This problem serves as the function-field analogue to the classical problem in analytic number theory concerning the partial Euler product of the Riemann zeta function restricted to primes in arithmetic progressions. In the integer setting, this problem was systematically treated by Languasco and Zaccagnini, who derived asymptotic formulas involving a main term and a remainder term dependent on the potential existence of exceptional (Siegel) zeros.

Methodology
The author employs a combination of character decomposition and the analytic properties of Dirichlet $L$ -functions over function fields. The methodology proceeds through the following steps:

Character Decomposition: The condition $P \equiv A_0 \pmod Q$ is expressed using the orthogonality of Dirichlet characters modulo $Q$ . This allows the logarithm of the restricted product to be decomposed into a sum over characters $\chi$ :
$\log P(n; Q, A_0) = \frac{1}{\Phi(Q)} \sum_{\chi \pmod Q} \chi(A_0) \sum_{\substack{P \in \mathcal{P}_{\le n}}} \chi(P) \log(1 - |P|^{-1}).$
The contribution of the principal character $\chi_0$ is separated from the nonprincipal characters.
Principal Character Analysis: The contribution of $\chi_0$ corresponds to the unrestricted Euler product over all prime polynomials of degree $\le n$ . This is evaluated using Rosen's generalization of Mertens' theorem for global function fields, which provides the leading term and a baseline error estimate.
Nonprincipal Character Analysis (Square-Root Cancellation): For nonprincipal characters $\chi \neq \chi_0$ , the analysis relies on the associated Dirichlet $L$ -function $L(u, \chi)$ . A crucial feature of the function-field setting is that Weil's Riemann Hypothesis holds unconditionally for these $L$ -functions. Consequently, the reciprocal zeros of $L(u, \chi)$ lie on the circle $|u| = q^{-1/2}$ .
- This property yields strong cancellation in character sums over prime polynomials, specifically $\Theta(n, \chi) = \sum_{P \in \mathcal{P}_{\le n}} \chi(P) \deg P = O(q^{n/2})$ .
- Using this cancellation and partial summation, the author derives uniform tail estimates for the twisted Euler products, showing that the contribution of primes with degree $> n$ is negligible.
Synthesis: The estimates for the principal and nonprincipal contributions are combined. The logarithmic terms are exponentiated to recover the asymptotic formula for the product $P(n; Q, A_0)$ .

Key Contributions and Results
The primary result is Theorem 2.1, which establishes the following asymptotic formula uniformly for all monic moduli $Q$ satisfying $\deg Q \le \eta n$ (for a fixed $0 < \eta < 1$ ) and all reduced residue classes $A_0$ :

$P(n; Q, A_0) = C(Q, A_0) (n \log q)^{-1/\Phi(Q)} \left(1 + O_{q, \eta}(q^{-n/2})\right)$

where $C(Q, A_0) > 0$ is an explicit constant depending only on the arithmetic data of $Q$ and $A_0$ .

Significance and Claims
The paper claims that this result is the direct function-field analogue of the "GRH-strength" form of the arithmetic progression Mertens theorem established by Languasco and Zaccagnini for integers.

The significance of the work lies in the following points:

Unconditional Validity: Unlike the integer setting, where the "GRH-strength" error term (power-saving without exceptional zero corrections) relies on the unproven Generalized Riemann Hypothesis, this result holds unconditionally. This is possible because Weil's Riemann Hypothesis for Dirichlet $L$ -functions over function fields is a proven theorem.
Absence of Exceptional Zeros: The result requires no correction terms for exceptional (Siegel) zeros, as such zeros cannot exist in the function-field setting.
Explicit Constants: The paper provides an explicit Euler product expression for the constant $C(Q, A_0)$ (detailed in the Appendix), mirroring the structure of the constants found in the integer case.
Uniformity: The asymptotic formula is valid uniformly even as the degree of the modulus $Q$ grows linearly with $n$ .

The author notes that the error term $O(q^{-n/2})$ represents a power-saving error, which is the strongest possible form of the asymptotic in this context, achieved without any unproven hypotheses.