Section 13 · PDF pages 825–828
The short-interval norm-prime input for the analytic host
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
13 The short-interval norm-prime input for the analytic host
The analytic host also needs primes represented by the principal ray class of an imaginary quadratic field. This is a separate input from the progression count in the analytic-engine section. We retain the source’s shrinking interval and its uniformity in both the quadratic discriminant and the ray modulus.
Definition 13.1 (The family of ray-class coefficient functions). The source’s family consists of a finite abelian group G, numbers B ≥4 and B^{−1}≤κ ≤4, and nonnegative real coefficients a_{g}(n), λ_{g}(n), with |G| ≤B. Their exact requirements are
Selectable PDF notation • transcription unchecked
a_{g}(0) = 0|||||| , a_{0}(1) = 1||||||, a_{g}(1) = 0 (g ̸= 0),
∑ a_{g}(n) −κx ≤10^{√}x (x ≥1),
|||||| 1≤n≤x ||||||
∑a_{g}(n)e^{−tn}−^{κ} ≤B^{10}t (0 < t ≤1),
∑ n≥0^{t} ∑ ∑λ_{g}(n) ≤2Λ(n), a_{g}(n) log n = λ_{h}(u)a_{g−h}(v).
Selectable PDF notation • transcription unchecked
g h∈Guv=n
For every quadratic character χ it further requires
Selectable PDF notation • transcription unchecked
∑ ∑ ) ∑ ) ∑
b_{χ}(n) := a_{g}(u) χ(g)a_{g}(v) ≥0, a_{g}(n) ≤b_{χ}(n^{2}). (NP.1)
Selectable PDF notation • transcription unchecked
uv=n g g g
Here “quadratic” includes the trivial character; the values are real ±1. Put
Selectable PDF notation • transcription unchecked
∑∑
ψ_{χ}(x) = χ(g)λ_{g}(n), ℓ(t) = log(B(|t| + 2)).
Selectable PDF notation • transcription unchecked
n≤x g
The analytic function F_{χ} is the continuation of the corresponding Dirichlet series, multiplied by s −1 for the trivial character. In the source it is defined directly by the Mellin integral of the error in the displayed counting estimate, so this continuation is initially available on ℜs > 1/2.
Source: Development/AbelianVarietyTheory/Definitions/GlobalTwisting/LamIdealOfNotPrimePow.lean:12--69.
We isolate the analytic assertions at precisely the point where the source uses them. Their constants must be absolute for this family. There are positive c_{0}, A, c_{9}, c_{7}, C, with c_{0} ≤ 1/20 and c_{9} ≤ 1, such that the
following hold. In ℜs ≥1 −c_{0}/ℓ(ℑs), all zeros of all the F_{χ} together consist of at most one simple real zero β, belonging to a quadratic character, with
Selectable PDF notation • transcription unchecked
3
≤β < 1, 1 −β ≥c_{9}B^{−A}. (NP.2)
Selectable PDF notation • transcription unchecked
4
Writing Z_{χ} = {β} for that character and Z_{χ} = ∅ for the others, the second assertion is
Selectable PDF notation • transcription unchecked
|||||| ∑ u^{β}|||||| √ψ_{χ}(u) − 1_{χ=1}u + ≤Cu exp(−c_{7} log u) (NP.3)
Selectable PDF notation • transcription unchecked
√ β∈Zχ^{β}for u ≥2 and log B ≤ log u. The lower bound below is proved from these exact assertions, including the possible exceptional term; it does not require eliminating a possible exceptional zero.
Proposition 13.2 (The native principal-class interval estimate). Assume (NP.2)–(NP.3) for the family in Def-inition 13.1. Set
Selectable PDF notation • transcription unchecked
(^{c}7 7^{c}9)c = min 1, , c > 0.
Selectable PDF notation • transcription unchecked
√ 2(A + 2) 24C
If X ≥1, log B ≤c log X and e^{−c√log X} ≤h ≤1, then
Selectable PDF notation • transcription unchecked
∑ c_{9}hXλ_{0}(n) ≥_{A+1} . (NP.4)
Selectable PDF notation • transcription unchecked
X<n≤X(1+h)^{4B}All constants are chosen before the family, X and h.
Source: Development/AbelianVarietyTheory/Proofs/GlobalInterpolation/TrivialClassShortInterval.lean:20--280.
Selectable PDF notation • transcription unchecked
√
Proof. Write L = log X, Y = X(1 + h) and δ = c_{9}B^{−A}. Since log B ≥1 and c ≤1, the range implies log X ≥1, so X ≥e and X ≤Y ≤2X. Character orthogonality gives, for each u,
Selectable PDF notation • transcription unchecked
∑ ∑
ψ_{χ}(u) = |G| λ_{0}(n). (NP.5)
Selectable PDF notation • transcription unchecked
χ n≤u
This follows by interchanging the two finite sums and using ∑_{χ}χ(g) = |G| for g = 0 and 0 otherwise. Summing (NP.3) and using |G| ≤ B therefore bounds the error in (NP.5), after subtracting the principal
main term and adding the exceptional terms, by BCue^{−c7√log u}.
Subtract the estimates at X and Y . The combined error is at most 3BCXe^{−c7L}, because Y ≤2X and log Y ≥ log X. There is at most one exceptional term in the whole character sum. Its increment satisfies
Selectable PDF notation • transcription unchecked
Y^{β}−X^{β}≤hX^{β}≤hX(1 −δ/2). (NP.6)
Selectable PDF notation • transcription unchecked
β
For the first inequality use concavity (1 + h)^{β} ≤1 + βh, valid for 0 < β ≤1 and h ≥0. For the second, (NP.2) and log X ≥1 give X^{β−1}≤e^{−δ}. Since 0 < δ ≤1, e^{−δ}≤(1 + δ)^{−1}≤1 −δ/2. If no exceptional zero exists its increment is zero, which is bounded by the same nonnegative expression.
We check the error absorption explicitly. The two range inequalities imply B ≤ e^{cL}, B^{A} ≤ e^{AcL}, h ≥e^{−cL} and cL ≥1. The choice c ≤c_{7}c_{9}/(24C) gives c_{7}L/2 ≥12C/c_{9}, hence 12C ≤c_{9}e^{c7L/2}, by e^{t}≥t for t ≥0. Consequently
Selectable PDF notation • transcription unchecked
_{12CB}A+1_{e}−c_{7}L_{≤c9e}((A+1)c−c_{7}/2)L_{≤c9e}−cL_{≤c9h.}The middle inequality uses (A + 2)c ≤c_{7}/2. Dividing by 4B^{A} proves 3BCe^{−c7L}≤hδ/4. Now subtract (NP.6) from the main increment hX and this error from what remains. We obtain
Selectable PDF notation • transcription unchecked
|G| ∑ λ_{0}(n) ≥hXδ/4.
X<n≤YThe coefficient sum is nonnegative, so replacing |G| by B only increases its left side. Dividing by B gives (NP.4). The integer interval is exactly (⌊X⌋, ⌊Y ⌋]; no prime or integer at an endpoint is lost in this subtraction.
Proposition 13.3 (From ideal coefficients to the host’s rational primes). Let d ≥100 be prime with d ≡3 (mod 4), and let M ≥3. Put B = 4dM^{2}. Suppose that the ray family has (NP.2)–(NP.3). Then there are absolute positive constants A^{′}, c^{′}, e^{′} such that, whenever
Selectable PDF notation • transcription unchecked
_{′}√X ≥1, log(4dM^{2}) ≤c^{′}√log X, e^{−clog X} ≤h ≤1,
Selectable PDF notation • transcription unchecked
{ } e^{′}hXa^{2}+ db^{2}= 4p for some a, b ∈ℤ, # p prime : X < p ≤X(1 + h), ≥ . (NP.7)
Selectable PDF notation • transcription unchecked
M | b, 2M | a −2 −b
(4dM^{2})^{A′} log X
This is the precise ShortNorm conclusion consumed by the host.
Source: Development/AbelianVarietyTheory/Proofs/GlobalInterpolation/NormPrimesImagQuadShortIntervalLowerBound.lean:10--147; Development/AbelianVarietyTheory/Definitions/Foundations/RayPrimes.lean:40--46.
Selectable PDF notation • transcription unchecked
√ √
Proof. The quadratic field is K = ℚ( −d), with ring of integers ℤ[ω], ω = (1+ −d)/2, and discriminant −d. Use its ray class group modulo M𝒪_{K}. The coefficient λ_{0}(p) sums the ideal von Mangoldt weights of prime ideals in its trivial ray class with norm_{√} p. Such an ideal is generated by an integral α ≡1 (mod M𝒪_{K}). Write α = (a + b −d)/2 = (a −b)/2 + bω. Its norm is (a^{2}+ db^{2})/4 = p; its ray congruence says exactly M | b and 2M | a −2 −b. Conversely those equations give such a generator. Thus every prime carrying nonzero weight belongs to the set in (NP.7).
For all n the family bound is λ_{0}(n) ≤ 2Λ(n). On primes p ≤ Y = X(1 + h) it is therefore at most 2 log Y . On the remaining prime powers, its sum is at most 2(ψ(Y ) −ϑ(Y )). Consequently, if N denotes the number of primes in (NP.7),
Selectable PDF notation • transcription unchecked
∑
λ_{0}(n) ≤2 log Y N + 2(ψ(Y ) −ϑ(Y )). (NP.8)
Selectable PDF notation • transcription unchecked
X<n≤Y
Use the established Chebyshev prime-power bound ψ(u) −ϑ(u) ≤C_{0}^{√}u for u ≥1, in the same form used in the analytic section. Set C_{1} = |C_{0}| + 1. If (NP.4) is written S ≥ehX/B^{A′}, shrink its constant c^{′} further so that, with K_{0} = 8C_{1}/e,
c^{′}≤{2(1 + A^{′}) + 2 + K_{0}}^{−1}. (NP.9)
Selectable PDF notation • transcription unchecked
√
Here is the source’s absorption calculation. Put s = log X and T = 2(1 + A^{′}) + 2 + K_{0}. Since 1 ≤ log B ≤ c^{′}s and c^{′}T ≤ 1, we have s ≥ T. Also c^{′} ≤ 1, so B^{A′} ≤ e^{A′s} and h ≥ e^{−s}. The inequality s ≥2(1 + A^{′}) + 2 + K_{0} gives s^{2}/2 −(1 + A^{′})s ≥K_{0}; therefore
Selectable PDF notation • transcription unchecked
K_{0}^{√}X B^{A′}≤e^{s2/2−(1+A′)s}e^{s2/2}e^{A′s}= e^{−s}X ≤hX.
√ √ √It follows that 4C_{1} X ≤ ehX/(2B^{A′}). Since Y ≤ 2X, Y ≤ 2 X; and since log X ≥ 1, log Y ≤ log X + log 2 ≤2 log X. Combining these inequalities with (NP.8) leaves
Selectable PDF notation • transcription unchecked
ehX
_{2BA′} ≤4 log X N.
Division gives (NP.7), with e^{′}= e/8. All changes were minima of positive absolute constants, so the same constants work for every allowed d, M, X, h.
The source producers for the family and its analytic estimates are ExistsLFamRay.lean:73--128, RayClassLFunctionZeroFreeRegion.lean, RayClassLFunctionUniqueSimpleExceptionalZero.lean, RayClassFamilyPsiWithExceptionalZero.lean and ExistsRayClassLFunctionRealZeroFarFromOne.lean:47--75. Their arguments and the concrete family conversion are proved in the following subsections; the complete assembly is
Theorem 13.16.