Petrow–Young Subconvexity Bound
- The paper establishes a Weyl-type subconvexity bound for Dirichlet L-functions with an exponent of 1/6, surpassing the classical convexity barrier.
- It utilizes innovative analytic and spectral methods, including the approximate functional equation, delta method, and Kuznetsov formula.
- The result leads to improved distribution exponents for divisor functions like d3(n) and d4(n), advancing equidistribution in arithmetic progressions.
The Petrow–Young subconvexity bound is a breakthrough in analytic number theory that establishes a Weyl-type subconvex estimate for Dirichlet -functions of primitive characters, with profound implications for the distribution of divisor functions in arithmetic progressions. The method enables significant improvements on classical “square root barrier” results, enabling new exponents of distribution for and and advancing the study of mean values of arithmetic functions in residue classes.
1. Formal Statement of the Petrow–Young Subconvexity Bound
Let be a primitive Dirichlet character modulo a cube-free integer , and let for . Petrow and Young prove the following Weyl-type subconvexity bound: for every (Parry, 2024, Aydemir et al., 18 Jan 2026).
Equivalently, the "exponent" may be taken in the general form
This subconvex estimate sits strictly below the classical convexity bound with exponent $1/4$, and permits a power-saving improvement crucial to arithmetic equidistribution problems.
2. Outline of the Proof and Main Techniques
The proof proceeds by several innovative analytic and spectral techniques:
- Approximate Functional Equation: The -function is expressed in terms of two dual sums, each of length about .
- Circle/Delta Method: Detection of via a -symbol or spectral trace formula on .
- Reciprocity and Kuznetsov Formula: The sum is analyzed using Kloosterman sums, whose structure is accessed via the Kuznetsov trace formula on .
- Spectral Reciprocity: Introduction of a duality between -twists and sums over Fourier coefficients.
- Amplification and Stationary Phase Analysis: An amplification method (inspired by Duke–Friedlander–Iwaniec) is used to harvest the central values, and oscillatory integrals are bounded by the stationary phase method.
The consequence is a “hybrid” subconvex bound, yielding in both -aspect and -aspect, and thus establishing the stated Weyl-type estimate (Aydemir et al., 18 Jan 2026).
3. Applications to Exponent of Distribution Beyond the Square-Root Barrier
The Petrow–Young bound serves as the analytic foundation for achieving exponents of distribution for divisor functions beyond the $1/2$ barrier in arithmetic progressions:
- Four-fold Divisor Function (): Parry demonstrates that possesses exponent of distribution $4/7$ on average over residue classes, breaking the limit for the first time. The main steps involve smoothing, application of an Ivić multidimensional Voronoi formula, and separation into diagonal/off-diagonal terms. The off-diagonal regime is controlled by employing the Petrow–Young subconvexity in bounding bilinear forms involving -functions, culminating in the second-moment estimate
for prime . This leads to individual error terms of size , confirming equidistribution of up to (Parry, 2024).
- Ternary Divisor Function (): The techniques transfer to , and by similar analysis the exponent of distribution is improved from $2/3$ to $8/11$ after averaging over residue classes modulo a prime . In this context, the Petrow–Young bound is invoked at several points:
- Bounding bilinear sums involving via Dirichlet character orthogonality,
- Employing Perron's formula to express sums over in terms of ,
- Applying hybrid and averaged Weyl-type bounds for -functions within and -aspects.
- The resulting mean square error is
for , thus confirming substantial progress over prior results (Aydemir et al., 18 Jan 2026).
4. Technical Preconditions and Functional Ranges
The subconvexity result and its applications are subject to several precise restrictions:
- The character must be primitive of conductor , with required to be cube-free in Petrow–Young (prime is allowed).
- All bounds are uniform in and for all .
- In distribution problems for , the modulus is required to satisfy , with for , for under averaging, as set by the detailed optimization of second moment bounds.
5. Consequences for Divisor Functions and Related Problems
The principal consequences include:
- Equidistribution: Establishes equidistribution in prime modulus arithmetic progressions beyond the conventional range, achieving power-saving error terms for (Parry, 2024).
- Improvements: Improves the exponent for equidistribution of up to modulus on average (Aydemir et al., 18 Jan 2026).
- Framework for Higher Divisor Functions: The analytic structure provided by Petrow–Young suggests that, for , any suitable subconvex bound for the relevant -functions could yield nontrivial distribution exponents for . This insight shows the generality and reach of the underlying analytic approach.
A table summarizing key exponents:
| Function | Classical Exponent | With P-Y Bound | Modulus Range |
|---|---|---|---|
| $2/3$ | $8/11$ | ||
| $1/2$ | $4/7$ |
6. Key Formulas and Estimate Summary
The following central formulas encapsulate the main analytic advances:
- Petrow–Young Weyl Bound:
- Fourth-Moment Bound (for ):
- Second-Moment for Error Terms:
for , and
for .
These expressions delineate the pathway from the subconvexity bound to explicit equidistribution results in arithmetic progressions.
7. Impact and Future Directions
The Petrow–Young subconvexity bound provides an essential analytic tool for advancing beyond natural convexity-barrier limits in the study of distribution of arithmetic functions. Its hybrid and uniformly sharp nature is indispensable for mean value theorems and divisor distribution problems. A plausible implication is that further enhancements in subconvex bounds for Dirichlet or related automorphic -functions would directly enable stronger exponents for various arithmetic function distribution results, particularly for higher and analogous settings. The method’s paradigm—melding spectral reciprocity, advanced trace formulae, and optimized moment estimates—serves as a blueprint for subsequent progress in analytic number theory and automorphic forms.