Explicit conditional bounds for the residue of a Dedekind zeta-function at $s=1$

This paper establishes new, concrete, and explicitly numerical conditional bounds for the residue at $s=1$ of the Dedekind zeta-function associated with a number field.

The Gist

Imagine you are a detective trying to solve a mystery about the hidden architecture of numbers. In the world of mathematics, there is a special object called a Number Field. Think of a Number Field as a vast, intricate city built from numbers. Every city has a unique "fingerprint" called its Discriminant ($\Delta_K$). The bigger the city, the more complex its fingerprint.

In the center of every city stands a giant, glowing lighthouse called the Dedekind Zeta-Function. This lighthouse shines a beam of light that reveals the city's most important secret: its Residue ($\kappa_K$). This residue is like the city's "population density" or "economic health." It tells mathematicians how many unique ways the city can be organized (related to something called the "class number").

The Problem: How Bright is the Light?

For a long time, mathematicians knew that the brightness of this lighthouse ($\kappa_K$) depends on the size of the city's fingerprint ($\Delta_K$). Specifically, they knew it grows roughly like the "double logarithm" of the city's size.

However, the old maps were fuzzy. They said, "The light is somewhere between this and that," but the numbers were vague. They used terms like "plus a tiny bit" ($o(1)$), which is like saying, "The treasure is buried somewhere in this forest, plus or minus a few miles." That's not very helpful if you want to find the exact spot.

The New Discovery: A Precision GPS

This paper, written by Garcia, Grenié, Lee, and Molteni, is like upgrading from a fuzzy paper map to a high-precision GPS.

The authors have calculated exact, concrete numbers for the upper and lower limits of the lighthouse's brightness. They didn't just say "it's around this value"; they said, "It is definitely no brighter than 2.47 times this factor, and no dimmer than 0.5 times that factor."

The Big Assumption: The "Riemann Hypothesis"

To get these precise numbers, the authors had to make a massive assumption. They assumed the Generalized Riemann Hypothesis (GRH) is true.

• The Analogy: Imagine trying to predict the weather. If you assume the atmosphere behaves perfectly predictably (no chaotic storms), you can make a very accurate forecast. The Riemann Hypothesis is the mathematical equivalent of assuming the "atmosphere" of numbers is perfectly orderly.
• If this assumption holds true (which most mathematicians believe it does), then the authors' new GPS coordinates are 100% correct.

How They Did It: The "Smoothing" Technique

The paper is full of complex formulas, but the core idea is clever.

1. The Rough Sketch: They started with a rough estimate of the lighthouse's brightness by counting prime numbers (the "bricks" of the number cities).
2. The Smoothing: The old methods were like trying to measure a bumpy road with a ruler; the bumps made the measurement inaccurate. The authors used a "smoothing technique." Imagine pouring sand over the bumpy road to make it flat, then measuring the smooth surface. This allowed them to get a much cleaner, more accurate reading of the lighthouse's true power.
3. The Result: They proved that the brightness ($\kappa_K$) is trapped between two very specific walls:
   • Upper Wall: It can't be too bright.
   • Lower Wall: It can't be too dim.

Why Should You Care?

You might ask, "Who cares about the brightness of a mathematical lighthouse?"

1. It's a Fundamental Limit: Just as physicists want to know the speed of light, mathematicians want to know the limits of these number functions. Knowing the exact bounds helps us understand the fundamental laws of the universe of numbers.
2. Better Security: Number fields are the backbone of modern cryptography (the codes that keep your bank account safe). Understanding the "shape" and "limits" of these number systems helps cryptographers build stronger locks and detect weaker ones.
3. Solving Old Puzzles: This paper improves on work done by other mathematicians (like Cho and Kim) by removing the "vague" parts. It turns a "maybe" into a "definitely."

The Bottom Line

Think of this paper as the final, detailed blueprint for a specific part of the mathematical universe. Before, we had a sketch that said, "The building is tall." Now, thanks to these authors, we have a blueprint that says, "The building is exactly 19 stories high, give or take a fraction of an inch, if the laws of physics (the Riemann Hypothesis) hold true."

It's a triumph of precision, turning a blurry guess into a sharp, undeniable fact.

Technical Summary

Here is a detailed technical summary of the paper "Explicit Conditional Bounds for the Residue of a Dedekind Zeta-Function at $s = 1$" by Garcia, Grenié, Lee, and Molteni.

1. Problem Statement

The paper addresses the problem of establishing explicit, conditional bounds for the residue $\kappa_K$ of the Dedekind zeta-function $\zeta_K(s)$ at $s=1$, associated with a number field $K$ (where $K \neq \mathbb{Q}$).

• Context: The residue $\kappa_K$ is a fundamental arithmetic invariant linked to the class number formula. It encodes information about the class number, regulator, and number of roots of unity in $K$.
• The Challenge: While asymptotic bounds for $\kappa_K$ exist under the Generalized Riemann Hypothesis (GRH), previous results often lacked explicit numerical constants or relied on $o(1)$ terms that were not computable.
• Goal: The authors aim to prove bounds of the form:
  $$c_- (\ln \ln |\Delta_K|) \leq \kappa_K \leq c_+ (\ln \ln |\Delta_K|)^{n_K-1}$$
  where $c_-$ and $c_+$ are explicit functions of the degree $n_K$ and discriminant $|\Delta_K|$, with all constants fully specified.

2. Methodology

The proof relies on a combination of analytic number theory techniques, specifically focusing on the relationship between $\zeta_K(s)$ and Artin $L$-functions. The methodology is divided into four main stages:

A. Decomposition via Artin $L$-functions

The authors utilize the factorization $\zeta_K(s) = \zeta(s)L(s, \rho)$, where $\rho$ is a specific Artin representation of the Galois group of the normal closure of $K$.

• This reduces the problem to analyzing the residue of the Artin $L$-function $L(s, \rho)$ at $s=1$, denoted as $\kappa_K = L(1, \rho)$.
• They assume the GRH for $\zeta_K$ and that the quotient $\zeta_K/\zeta$ is entire (implying $L(s, \rho)$ is entire).

B. Explicit Approximation of $\Psi(x)$ and $\Sigma(x)$

The core of the argument involves estimating sums over prime powers:

1. $\Psi(x)$: An explicit approximation of $\sum_{n \leq x} \frac{\Lambda(n)}{n \ln n}$ is derived using the Riemann Hypothesis (RH) for the Riemann zeta function. The authors refine existing bounds (e.g., by Schoenfeld) to provide explicit error terms.
2. $\Sigma(x)$: They define a weighted sum $\Sigma(x) = \sum_{n \leq x} \frac{\Lambda(n)a_\rho(n)}{n \ln n}$, where $a_\rho(n)$ are coefficients of the Artin $L$-function.
   • Upper Bound: Derived directly from the bound on $\Psi(x)$ and the fact that $|a_\rho(n)| \leq n_K - 1$.
   • Lower Bound: A more complex derivation involving bounds on products over primes and the use of Lemma 2.3 to handle the tail of the Euler product.

C. Smoothing and Contour Integration

To relate the discrete sum $\Sigma(x)$ to the continuous value $\ln \kappa_K$, the authors employ a smoothing technique (Step I–V in Section 3):

• They use a smoothed average of $\Sigma(t)$ over an interval $[x, x+h]$.
• Using Perron's formula and contour integration, they relate this average to $\ln L(1, \rho)$.
• They shift the line of integration to the left (towards $\text{Re}(s) = 1/2$) using the Borel–Carathéodory theorem and explicit bounds on $|L(s, \rho)|$ derived from the GRH.
• This step yields an explicit inequality: $|\ln \kappa_K - \Sigma(x)| \leq \text{Error Terms}$.

D. Optimization of Parameters

The authors select a specific value for $x$ dependent on the discriminant $|\Delta_K|$:
$$x = (\ln |\Delta_K|)^2 M(|\Delta_K|)$$
where $M(t)$ is a slowly growing function. This choice ensures that the error terms (which decay as $x^{-1/2}$) are minimized relative to the main terms, allowing for the tightest possible explicit constants.

3. Key Contributions

1. Fully Explicit Constants: Unlike previous works (e.g., Cho and Kim) which provided asymptotic forms with unspecified $o(1)$ terms, this paper provides concrete numerical values for all constants.
2. Refined Lower Bound: The paper establishes a significantly stronger lower bound than previous conditional results.
   • Previous lower bounds were often of the form $e^{-C(n_K-1)}$.
   • The new lower bound is of the form $\frac{\zeta(n_K)}{2e^\gamma} (\ln \ln |\Delta_K|)^{1 + \frac{19(n_K-1)}{\ln \ln |\Delta_K|}}$.
3. Smoothing Technique: The authors implement a specific smoothing argument in Section 3 that refines the approach used by Cho and Kim, resulting in stronger computational outputs and tighter error control.
4. Verification for Small Discriminants: The authors explicitly verify the bounds for all number fields with $|\Delta_K| < 1.6 \times 10^6$ (which have degree $\leq 8$) using data from the LMFDB, ensuring the theorem holds for all cases, not just asymptotically large ones.

4. Main Results (Theorem 1.1)

Under the assumptions that $K \neq \mathbb{Q}$, $|\Delta_K| \geq 14$, GRH holds for $\zeta_K$, and $\zeta_K/\zeta$ is entire, the residue $\kappa_K$ satisfies:

Upper Bound:
$$\kappa_K \leq \left( 2e^\gamma (\ln \ln |\Delta_K|)^{1 + \frac{19}{\ln \ln |\Delta_K|}} \right)^{n_K-1}$$

Lower Bound:
$$\kappa_K \geq \frac{\zeta(n_K)}{2e^\gamma (\ln \ln |\Delta_K|)^{1 + \frac{19(n_K-1)}{\ln \ln |\Delta_K|}}}$$

Note: The constant 19 is a simplified choice; the authors note it can be refined but prefer the simpler expression.

5. Significance

• Arithmetic Applications: The residue $\kappa_K$ is crucial for the class number formula. Explicit bounds on $\kappa_K$ translate directly into explicit bounds on the class number $h_K$ and the regulator $R_K$, which are central to computational number theory and cryptography.
• Comparison to Prior Work:
  • The new lower bound improves significantly upon previous results (including those by Palojärvi and Simonič), which had weaker exponential factors.
  • The new upper bound is slightly weaker than a recent result by Palojärvi and Simonič (Equation 5 in the paper) but is derived using a different methodology that prioritizes the explicit nature of the lower bound and the smoothing technique.
• Conditional Nature: The results are conditional on the GRH. The paper notes that no method currently exists to produce bounds of this specific shape ($\ln \ln |\Delta_K|$) without assuming GRH.
• Computational Utility: By providing explicit constants and verifying the range for small discriminants, the paper makes these theoretical bounds immediately applicable for numerical verification and algorithmic checks in number field computations.

In summary, this paper bridges the gap between asymptotic analytic number theory and explicit computation, providing the most precise conditional bounds currently available for the residue of Dedekind zeta-functions.