Section 17.1 · PDF pages 967–968
From a connected arithmetic family to zero-freeness
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
17.1 From a connected arithmetic family to zero-freeness
The family and analytic sections give the following mechanism. A primitive character ψ determines a cyclic level and a class 𝒢_{ψ} of admissible arithmetic families. The host existence assertion at a fixed λ > 1 supplies the allowed starting data. The family-selection conclusion gives positive window exponents e_{D}, e_{L} and ε_{1} > 0 such that for every 0 < ε < ε_{1} an admissible family exists on the corresponding window, with those same e_{D}, e_{L}. Its core comparison bounds the logarithmic prime sum, while its pole-data formula and Landau argument exclude an L-zero to the right of 1/2.
Proposition 17.1. Suppose the following three assertions have been established with the definitions and uniform quantifiers of the preceding sections:
(i) Green’s finite-field character parametrization in the project’s polynomial-label form;
(ii) the window bound VWin for every primitive character;
(iii) a nonempty compatible family-selection bundle HypsAlt with its closed two/three local bound and
definite-side condition.
Then ZF, hence EC and ordinary RH, hold.
Source: Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopPlug.lean:12--18; Development/AutomorphicArithmetic/CharacterBoxes/ZeroFreeAllOfTopG.lean:26--34.
Proof. Choose an element of the nonempty bundle in (iii). This use of nonemptiness eliminates into the proposition to be proved; it does not require choosing one element uniformly over all future primitive char-acters. Green’s result in (i) supplies the source’s shape assertion for this bundle. Applying its family-selection implication gives TopG, whose quantifiers are: for every λ > 1 and every family request G, host existence for G and the prescribed eventual V -bound on every family in its class imply connected family selection in that class.
Take λ = 3/2, which satisfies 1 < λ. For each primitive ψ, apply (ii) to ψ and then the source’s host construction supplyChi to obtain host existence for G = 𝒢_{ψ} at this λ. Membership of a family in this class includes the pointwise V -bound; after the threshold Fm.x_{1} + 1 it supplies the eventual hypothesis needed by TopG. Thus TopG gives the window exponents and the families just described for this ψ.
The other class-membership component is the explicit-formula condition EFamC for the cyclic level. Its source constant is 4, with threshold Fm.x_{1}+1; the family’s size identities identify its local scale and exponent with the requested ones. The connected-family witness also supplies the chain tie on that same family. We therefore have every premise of the tied-window zero-freeness criterion, including the core estimate and the pole-data formula, with the original shared window exponents. That criterion gives L(s, χ_{ψ}) ̸= 0 for Re s > 1/2. Since ψ was arbitrary, this is ZF. Propositions 2.4 and 2.3 complete the implication.