Reading OpenAI’s proof side by side with a Lean formalization

A quasi-Riemann Hypothesis in \(\Re(s)>11/12\)

We seek cancellation in Möbius over \(\mathbb Q\): \(\displaystyle \sum_{n\asymp X}\mu(n)\) It is well known that a power savings here is equivalent to quasi-RH. But over \(\mathbb Q\) there are not enough harmonics. We therefore lift to the Eisenstein field \(K=\mathbb Q(\omega)\): \(\displaystyle M(X):=\sum_{\substack{n\in\mathcal O\\\mathcal N(n)\asymp X}}\mu_K(n),\) and aim to prove that \(M(X) \ll_\varepsilon X^{11/12+\varepsilon}\) for every \(\varepsilon>0\). Since \(\zeta_K(s)=\zeta(s)L(s,\chi_{-3})\), nonvanishing of \(\zeta_K\) forces nonvanishing of both factors. We deform the Eisenstein Möbius sum by sextic characters: \(\displaystyle M_h(X):=\sum_{\substack{n\in\mathcal O\\ n\asymp X}}\mu_K(n)\chi_x(h)\) and take a second moment: \begin{equation}\label{eq:mean-square} S(X,H):=\sum_{\substack{h\in\mathcal O\\ h\asymp H}}|M_h(X)|^2 \end{equation} We seek roughly square-root cancellation on average: \(\displaystyle S(X,H)\ll XH,\) ignoring epsilons. By itself, that is not enough, because \(M(X)\) only appears once in \(S(X,H)\). In the application, \(H=X^{1+\epsilon}\) will be a hair larger than \(X\), so even with square-root cancellation on average, dropping all but one term only shows the trivial bound: \(|M(X)|^2\le S(X,H)\ll X H \), which implies \(M(X)\ll (XH)^{1/2}\); this is epsilon worse than trivial - but in Sarnak's terminology, "pregnant". ("You have to be pregnant to deliver!") But sixth powers act as an amplifier. They recover (almost) the original sum: \(\displaystyle |M_{p^6}(X)-M(X)|\ll XH^{-1/6}\quad\bigl(p\text{ prime},\ \mathcal N(p^6)\asymp H\bigr)\). Since there are very roughly \(H^{1/6}\) (again, ignoring epsilons) such, we get, roughly, that \(H^{1/6}|M(X)|^2\le S(X,H)\ll X H \), and hence \(M(X)\ll X^{1/2}H^{5/12}\), which gives the main result.

Opening the square in (1), first separate the diagonal \(n_1=n_2\): its contribution is \(O(HX)\), already of the required size. To see the mechanism off the diagonal, ignore all but the other extreme, \((n_1,n_2)=1\). Reversing orders and applying Poisson in \(h\) (write \(L=X^2/H\) for the dual length) gives schematically \(\displaystyle S(X,H)\approx \frac1L\sum_{\ell\asymp L}\sum_{\substack{n_1,n_2\asymp X\\(n_1,n_2)=1}}\mu_K(n_1)\mu_K(n_2)\,\mathcal G_{n_1,n_2}(\ell),\) where the unnormalized sextic Gauss factor has the shape \(\displaystyle \mathcal G_{n_1,n_2}(\ell)=\sum_{a\bmod n_1 n_2}\overline{\chi_{n_2}(a)}\chi_{n_1}(a)\,e_K\!\left(\frac{\ell a}{n_1 n_2}\right).\) The Gauss–Jacobi identity absorbs the Möbius signs into the Gauss factors on both sides, leaving cubic Gauss sums and explicit phase factors. Write the resulting normalized cubic-Gauss coefficient as \(\displaystyle c_3(n):=\widetilde g_3(n)\,\overline{\frac{n}{|n|}}.\) Here \(\widetilde g_3(n)\) is the cubic Gauss sum normalized by the square root of the norm, and \(n\) is the chosen primary generator. After rearranging the phases, the \(n_1\)- and \(n_2\)-sums recombine heuristically into an absolute square: \(\displaystyle \begin{aligned} S(X,H)&\approx\frac{X}{L}\sum_{\ell\asymp L}\sum_{n_1,n_2\asymp X}\overline{\chi_{n_2}(\ell)c_3(n_2)}\,\chi_{n_1}(\ell)c_3(n_1)\\&=\frac{X}{L}\sum_{\ell\asymp L}\left|\sum_{n\asymp X}\chi_x(\ell)c_3(n)\right|^2.\end{aligned}\) Coprimality restrictions and the remaining phase separation are suppressed in this schematic. Normalizing the two Gauss factors contributes a factor \(X\), changing the prefactor \(1/L\) to \(X/L=H/X\). We now recognize \(c_3(n)\) as the squarefree Fourier coefficients of Kubota’s cubic theta series.

For each fixed \(\ell\), restore the cube multiples \(mj^3\) to obtain the completed twisted theta coefficients, which we denote schematically by \(\displaystyle \tau_\ell(n):=\sum_{\substack{mj^3=n\\m\ {\rm squarefree}}}\chi_m(\ell)c_3(m)\,w_\ell(j).\) The cube weights \(w_\ell(j)\) include the required twists and normalizations. Completion replaces the inner squarefree sum by \(\sum_{n\asymp X}\tau_\ell(n)\); Möbius inversion in the cube factor recovers the original sum. Thus the completed sums enter our second moment in the schematic form \(\displaystyle S(X,H)\approx\frac{H}{X}\sum_{\ell\asymp L}\left|\sum_{n\asymp X}\tau_\ell(n)\right|^2,\) with the cube-inversion sums and their scale changes left implicit. The theta series is constructed as the residue of a metaplectic Eisenstein series, whose meromorphic continuation is obtained by Selberg’s resolvent/Fredholm method. Taking the residue preserves its automorphic transformation law, giving the theta series its modularity. This classical construction is an important component of the formalization. Modularity of the completed theta series gives a Voronoi-type summation identity, whose main shape in this normalization is \(\displaystyle \sum_{n\asymp X}\tau_\ell(n)\ \approx\ \frac{X}{L}\sum_{y\asymp Y}\tau^\vee_\ell(y),\qquad Y=\frac{L^2}{X},\quad \ell\asymp L.\) Here \(\tau^\vee_\ell(y)\) denotes the normalized coefficients at the reflected cusps; the cusp sums and transformed smooth weights are implicit. The reflection kernel has scale \(X/\mathcal N(\ell)^2\), giving the dual norm length \(Y\). Substituting this transformation into the second moment gives \(\displaystyle S(X,H)\approx\frac{H}{X}\frac{X^2}{L^2}\sum_{\ell\asymp L}\left|\sum_{y\asymp Y}\tau^\vee_\ell(y)\right|^2.\) We then reopen the cube completion and separate the phases. The resulting quadratic energies have the schematic form \(\displaystyle S(X,H)\ \approx\ \frac{H}{X}\frac{X^2}{L^2}\sum_{\ell\asymp L}^{*}\left|\sum_{y\asymp Y}^{*}a_y\,\overline{\chi_y(\ell)}^{\,3}\right|^2,\qquad Y=\frac{L^2}{X}.\) The stars indicate admissible squarefree rows and columns; \(a_y\) are fixed coefficients within each block, with \(|a_y|\le1\). The sextic characters now occur cubed, so they are quadratic! The sharp quadratic large sieve gives, ignoring epsilon losses, \(\displaystyle \sum_{\ell\asymp L}^{*}\left|\sum_{y\asymp Y}^{*}a_y\,\overline{\chi_y(\ell)}^{\,3}\right|^2\ll(L+Y)\sum_y^{*}|a_y|^2\ll(L+Y)Y.\) Consequently, this heuristic gives \(\displaystyle S(X,H)\ll\frac{HX}{L^2}(L+Y)Y=H(L+Y)\ll HX,\) since \(1\le Y\le L\le X\) when \(H\) is just above \(X\). This explains the target bound. The full proof organizes the extra phases, common divisors, cube scales, and non-squarefree rows through a second Poisson passage and finite descent, obtaining \(S(X,H)\ll_\varepsilon XH\,X^\varepsilon\) in the required range. Sixth-power amplification then yields \(M(X)\ll_\varepsilon X^{11/12+\varepsilon}\).

Public endpoint11/12 < Re s → riemannZeta s ≠ 0
Proof objectsThe linked declarations compile; proof bodies remain in source

Historical remarks

The ingredients have several distinct lineages. The comparisons below distinguish direct inputs from methodological analogies; “new here” describes the particular assembly, not a claim that every related idea first appears here.

The Eisenstein lift

Lineage. The Eisenstein setting begins with Eisenstein’s 1844 work on cubic reciprocity; the ideal and \(L\)-function language comes from Dedekind and Hecke. The factorization \(\zeta_K(s)=\zeta(s)L(s,\chi_{-3})\) is classical. Specific to this proof. The Eisenstein lift is the entrance to this \(11/12\) argument.

Families and amplification

Lineage. Deforming a problem in a family has a geometric analogy in Deligne’s proof of the Weil Riemann hypothesis, through a Lefschetz pencil and monodromy; that is an analogy, not an input here. The modern amplification line runs through Iwaniec, Duke–Friedlander–Iwaniec, and Iwaniec–Sarnak. New here. The specific sextic deformation and sixth-power rows that recover the original sum belong to this argument.

Prime sums and automorphic precedents

Precedents. Duke–Iwaniec (1990) pass from Poisson summation to Gauss–Ramanujan sums and bilinear estimates for half-integral-weight coefficients. Their 1993 cubic exponential/Kloosterman identity is another nearby precursor, but not an input here. A complementary automorphic model is Selberg’s Eisenstein-series proof of the prime number theorem: in the formulation recorded by Sarnak, the index-1 Ramanujan coefficient is \(c_q(1)=\mu(q)\). Selberg originated that argument; Sarnak’s contribution is its effective version and quantitative zero-free region.

Duke–Iwaniec’s prime-sum cancellation. Bill Duke’s result here was joint with Henryk Iwaniec: their 1990 paper proves, under its hypotheses on a fixed holomorphic half-integral-weight cusp form, a power saving for its normalized Fourier coefficients at primes: \[ \sum_{p\le T} a_f(p)\ll_{f,\varepsilon}T^{155/156+\varepsilon}. \] Here \(a_f(n)=n^{-(k-1)/2}\widehat f(n)\) for weight \(k\). Their argument uses Vaughan’s identity and bilinear estimates, then Poincaré series, Kloosterman sums, Poisson summation, and Gauss–Ramanujan sums. They explicitly compare their result to Heath-Brown–Patterson’s cubic Gauss sums at primes, while distinguishing the techniques. Their 1991 exposition also discusses a hoped-for sharp mean-square estimate analogous to the quadratic large sieve. This suggests a genuine methodological resemblance here: automorphic coefficients, bilinear or second-moment estimates, and Gauss-sum transforms. It is not a direct input to this proof, nor does it supply this argument’s sextic deformation and sixth-power amplifier.

Gauss–Jacobi algebra

Lineage. The local cubic Gauss-sum algebra goes back to Hasse’s 1950 treatment, in the form foregrounded by equation (2) of Heath-Brown’s 2000 cubic work. New here. This proof derives the exact mixed sextic/cubic identity that absorbs the Möbius factor.

Cubic theta and completion

Lineage. Kubota created the metaplectic framework and constructed theta functions as residues of metaplectic Eisenstein series. Patterson made the cubic theta series explicit and computed its cubic-Gauss-sum Fourier coefficients; Heath-Brown–Patterson used this connection for Kummer sums. The precise completion and cube-factor reopening used here follow Dunn–Radziwiłł, with precedents in Patterson and Heath-Brown.

Modularity and Voronoi

Lineage. Meromorphic continuation uses Selberg’s 1956 resolvent/Fredholm method. Kubota applied that machinery metaplectically; Patterson computed the cubic coefficients and cusps; Yoshimoto developed the twisted functional equations. The explicit level-aspect cubic Voronoi transformation used here is Dunn–Radziwiłł’s extension of Patterson and Yoshimoto.

The quadratic large sieve

Lineage. The large sieve originates with Linnik (1941). Heath-Brown proved the sharp self-dual quadratic-character inequality over \(\mathbb Q\), and Goldmakher–Louvel proved the number-field form used here over \(\mathbb Q(\omega)\).

Finite descent

Lineage. The finite descent draws on Heath-Brown’s quadratic and cubic work, the number-field development of Goldmakher–Louvel, and the higher-order methods of Blomer–Goldmakher–Louvel. New at \(11/12\). The formal assembly makes the descent reserve arbitrarily small.

The 11/12 assembly

New at \(11/12\). The proof couples that movable descent scale to an all-element sixth-power amplifier; its totient density is then removed by an exact Euler correction.

The zero-free endpoint

Classical endpoint principle. The passage from smoothed Möbius cancellation to zero-free regions follows the criterion of Littlewood (1912); here it is applied to the corrected Hecke \(L\)-function product.

The whole route

setup → Poisson → theta transformation → quadratic large sieve → amplification → analytic continuation

Set up
01Set up

Fix the Eisenstein arithmetic

Lift the Möbius sum to the Eisenstein integers \(\mathcal O=\mathbb Z[\omega]\). We write the sum over primary generators, so that each admissible ideal appears once; \(\mu_K(n)\) means the Möbius coefficient of the principal ideal \((n)\).

\[ \mathcal N(n)=\mathcal N((n)),\qquad \mu_K(n)=\mu_K((n)),\qquad n\text{ primary}\iff n\equiv1\pmod{3}. \]

For elements coprime to \(3\), the primary condition selects exactly one representative among the six unit associates.

Definitions

The public arithmetic vocabulary

02Set up

Build \(M_h(X)\) and its finite second moment

Now make every ingredient visible in the summand: primaryness, Möbius, the actual sextic twist, and a smooth cutoff supported in \([1/2,1]\). Thus only \(X/2\leq \mathcal N(n)\leq X\) contributes.

\[ M_h(X)=\sum_{\substack{n\ {\rm primary}\\\mathcal N(n)\le X}} \mu_K(n)\chi_x(h)W\!\left(\frac{\mathcal N(n)}X\right), \quad S(X,H)=\sum_{\mathcal N(h)\le H}V\!\left(\frac{\mathcal N(h)}H\right)|M_h(X)|^2. \]

The public \(S\) is deliberately a finite sum. At the precise boundary where Poisson is needed, compact support proves it equal to a whole-lattice tsum.

This makes the intro’s dyadic notation precise. The target is square-root cancellation on average, \(S(X,H)\ll_\varepsilon XH X^\varepsilon\), with \(H\) a little larger than \(X\).

Definitions + bridge

Finite first, tsum at Poisson

Checked interface in ZetaFamily.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

Underlying general-purpose interface
The exact element-to-ideal and finite-to-lattice statements

These theorems certify the readable \(M_h(X)\) and \(S(X,H)\) notation. The analytic assembly starts from the equal idealRowSum expression rather than invoking the public wrappers again.

Transform
03Transform

Open the square and apply the first Poisson summation

Expand \(|M_h(X)|^2\) and separate the diagonal, which already contributes only \(O(HX)\). For the remaining pairs, reverse the row and column sums and run Poisson summation in \(h\). The coprime pairs illustrate the mechanism; common divisors and coprimality masks are retained in the full argument.

\[ \sum_{h\in\mathcal O}W_h\,\overline{\chi_I(h)}\chi_J(h) \quad\stackrel{\rm Poisson}{\longrightarrow}\quad \sum_{D\mid{\rm mask}}\frac{\mu_K(D)}{\mathcal N(D)} \sum_{\ell\in\mathcal O}\mathcal K_{I,J,D}(\ell). \]

For coprime columns of norm about \(X\), the modulus has norm about \(X^2\). Thus Poisson gives dual norm length \(L=X^2/H\) and prefactor \(H/X^2=1/L\) when the Gauss sums are unnormalized. The displayed kernel \(\mathcal K\) includes the Fourier weight and its normalization; zero frequencies and tails are tracked separately.

First transform

Masked radial Poisson, pair by pair

Checked interface in ZetaFamily.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

mobiusWeight · full Lean source ↗def mobiusWeight (W : SmoothDyadicWeight ℂ) (X : ℕ) (n : 𝒪) : ℂ := if primary n then (μ_K n : ℂ) * W ((𝒩 n : ℝ) / X) else 0
S_open_square · full Lean source ↗theorem S_open_square (W : SmoothDyadicWeight ℂ) (V : SmoothDyadicCutoff) (X H : ℕ) : (S W V X H : ℂ) = ∑ n₁ ∈ columns X, ∑ n₂ ∈ columns X, mobiusWeight W X n₁ * star (mobiusWeight W X n₂) * ∑ h ∈ rows H, (V ((𝒩 h : ℝ) / H) : ℂ) * sexticTwist X n₁ h * star (sexticTwist X n₂ h)
S_eq_tsum · full Lean source ↗theorem S_eq_tsum (W : SmoothDyadicWeight ℂ) (V : SmoothDyadicCutoff) (X H : ℕ) : S W V X H = ∑' h : 𝒪, V ((𝒩 h : ℝ) / H) * ‖M W h X‖ ^ 2
Underlying general-purpose interface
canonicalPair_first_poisson · full Lean source ↗theorem canonicalPair_first_poisson (hinj : Function.Injective (fun i => Ideal.span {p i})) (hc : ∀i,ringChar (O⧸Ideal.span {p i})≠2) (M N P B : Finset ι) (v : ι→ℕ) (ε₁ ε₂ : ι→Bool) (C₁ C₂ : Finset ι→ℂ) (W : 𝓢(ℝ,ℂ)) (V₁ V₂ : ℝ→ℂ) (X₁ X₂ K : ℝ) (hK : 0<K) : (V₁ (columnLog p X₁ N)*V₂ (columnLog p X₂ P))* (star (columnCoefficient p hp hcop hg N*C₁ N)*(columnCoefficient p hp hcop hg P*C₂ P))* (∑'z:O,rowCoprimeMask (fun i=>Ideal.span {p i}) M z* blockRow p hg ((N∪P)∪cubeActiveSupport B v ε₁ ε₂) (threeBlockExponent N P v ε₁ ε₂) z*W (‖eisEmbedding z‖^2/K)) = ∑D∈M.powerset,(UniqueFactorizationMonoid.moebius (∏i∈D,Ideal.span {p i}):ℂ)/ (primeProductNorm p D:ℂ)* ∑'h:O,canonicalPairMode p hp hcop hg N P B v ε₁ ε₂ C₁ C₂ W V₁ V₂ X₁ X₂ K (primeSubsetGenerator (fun i=>Ideal.span {p i}) D) h

The wrapper outside_mean_square_source connects this equality to the original idealRowSum second moment and isolates zero, truncated, and tail terms.

04Transform

Use Gauss–Jacobi identities to expose cubic coefficients

The first Poisson summation produces sextic Gauss sums. The Gauss–Jacobi identity absorbs the squarefree Möbius signs on both sides into cubic Gauss coefficients. Explicit local phases and cross-character factors remain and must be separated.

Write \(c_3(n)=\widetilde g_3(n)\overline{n/|n|}\), where \(\widetilde g_3(n)\) is normalized by \(\sqrt{\mathcal N(n)}\). These are the squarefree cubic-theta coefficients. As in the intro, the separated \(n_1,n_2\) sums are modeled by an absolute square with inner sum \(\sum_{n\asymp X}\chi_x(\ell)c_3(n)\). Normalizing the two Gauss factors changes the outside factor from \(1/L\) to \(X/L=H/X\).

\[ \mu_K\!\left(\prod p_i\right) G\!\left(\prod \chi_{p_i}^{\,e_i}\right) =\left(\prod_{i\ne j}\chi_{p_i}^{\,e_i}(p_j)\right) \prod_i G_i^{\rm converted}. \]

Local arithmetic

Möbius–Gauss conversion

moebius_mixed_gauss_conversion · full Lean source ↗theorem moebius_mixed_gauss_conversion {ι : Type*} [Fintype ι] (p : ι → O) (hp : ∀ i, p i ≠ 0) [∀ i, (Ideal.span {p i}).IsMaximal] (hcop : Pairwise (Function.onFun IsCoprime (fun i => Ideal.span {p i}))) (hgood : ∀ i, lambda ∉ Ideal.span {p i}) (hchar : ∀ i, ringChar (O ⧸ Ideal.span {p i}) ≠ 2) (hprimary : ∀ i, lambda ^ 2 ∣ p i - 1) (inverse : ι → Bool) : (UniqueFactorizationMonoid.moebius (Ideal.span {∏ i, p i}) : ℂ) * canonicalProductGauss p hp hcop hgood (fun i => if inverse i then 5 else 1) = (∏ i, ∏ k ∈ Finset.univ.erase i, (canonicalSextic (Ideal.span {p i}) (hgood i) ^ (if inverse i then 5 else 1)) (Ideal.Quotient.mk (Ideal.span {p i}) (p k))) * ∏ i, convertedLocal (p i) (hp i) (hgood i) (inverse i)
05Transform

Complete to the full cubic theta series

For each fixed \(\ell\), restore the cube multiples \(n=mj^3\) to the inner squarefree sum. This produces the completed twisted coefficients \(\tau_\ell(n)\) from the intro. The exact object is written over ideals, with the twist denoted by \(\Psi\):

\[ T_\Psi(W,X)=\sum_{I}\sum_J \frac{c_\Psi(I)}{\sqrt{\mathcal N(I)}}\,w_\Psi(J)\, V^\ast\!\left(\frac{\mathcal N(I)\mathcal N(J)^3}{X}\right). \]

Here \(c_\Psi(I)\) is the twisted squarefree coefficient and \(V^\ast(y)=\sqrt y\,W(y)\). The original squarefree sum \(\mathcal C_\Psi(W,X)=\sum_I c_\Psi(I)W(\mathcal N(I)/X)\) is recovered by the exact cube-inversion formula

\[ X^{-1/2}\mathcal C_\Psi(W,X) =\sum_J\mu_K(J)w_\Psi(J)\, T_\Psi\!\left(W,\frac{X}{\mathcal N(J)^3}\right). \]

Thus completion enters \(S(X,H)\) through a weighted family of completed sums at cube-divided scales. The intro suppresses this family to show the main transformation; its scales and weights are retained in the estimates.

Completion

The object that is reflected

Checked interface in ThetaSums.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

Underlying general-purpose interface
cubeWeight · full Lean source ↗def cubeWeight (Ψ : O →* ℂ) : Ideal O →* ℂ where toFun I := star (FiniteGaussPhase.angularFactor (primaryGenerator I)) ^ 3 * Ψ (primaryGenerator I) ^ 3 / (Ideal.absNorm I : ℂ) map_one' := Ψ:O →* ℂ⊢ star (FiniteGaussPhase.angularFactor (primaryGenerator 1)) ^ 3 * Ψ (primaryGenerator 1) ^ 3 / ↑(absNorm 1) = 1 All goals completed! 🐙 map_mul' I J := Ψ:O →* ℂI:Ideal OJ:Ideal O⊢ star (FiniteGaussPhase.angularFactor (primaryGenerator (I * J))) ^ 3 * Ψ (primaryGenerator (I * J)) ^ 3 / ↑(absNorm (I * J)) = star (FiniteGaussPhase.angularFactor (primaryGenerator I)) ^ 3 * Ψ (primaryGenerator I) ^ 3 / ↑(absNorm I) * (star (FiniteGaussPhase.angularFactor (primaryGenerator J)) ^ 3 * Ψ (primaryGenerator J) ^ 3 / ↑(absNorm J)) Ψ:O →* ℂI:Ideal OJ:Ideal O⊢ star (FiniteGaussPhase.angularFactor (primaryGenerator J)) ^ 3 * star (FiniteGaussPhase.angularFactor (primaryGenerator I)) ^ 3 * (Ψ (primaryGenerator I) ^ 3 * Ψ (primaryGenerator J) ^ 3) / (↑(absNorm I) * ↑(absNorm J)) = star (FiniteGaussPhase.angularFactor (primaryGenerator I)) ^ 3 * Ψ (primaryGenerator I) ^ 3 / ↑(absNorm I) * (star (FiniteGaussPhase.angularFactor (primaryGenerator J)) ^ 3 * Ψ (primaryGenerator J) ^ 3 / ↑(absNorm J)) All goals completed! 🐙
Vstar · full Lean source ↗def Vstar (W : ℝ → ℂ) (y : ℝ) : ℂ := (Real.sqrt y : ℂ) * W y
summand · full Lean source ↗def summand (Ψ : O →* ℂ) (W : ℝ → ℂ) (X : ℝ) (I J : Ideal O) : ℂ := columnWeight Ψ I / (Real.sqrt (Ideal.absNorm I : ℝ) : ℂ) * cubeWeight Ψ J * Vstar W ((Ideal.absNorm I : ℝ) * (Ideal.absNorm J : ℝ) ^ 3 / X)
completedT · full Lean source ↗def completedT (Ψ : O →* ℂ) (W : ℝ → ℂ) (X : ℝ) : ℂ := ∑' I : Ideal O, ∑' J : Ideal O, summand Ψ W X I J
weighted_completedT_reopen · full Lean source ↗theorem weighted_completedT_reopen (Ψ : O →* ℂ) (W : ℝ → ℂ) (X : ℝ) (H : Ideal O) : (UniqueFactorizationMonoid.moebius H : ℂ) * cubeWeight Ψ H * completedT Ψ W (X / (Ideal.absNorm H : ℝ) ^ 3) = ∑' I : Ideal O, ∑' J : Ideal O, expandedTerm Ψ W X I H J
06Transform

Prove modularity and reflect the cubic theta series

The cubic theta series is obtained as a residue of a metaplectic Eisenstein series. Selberg’s resolvent/Fredholm method supplies meromorphic continuation, and the residue inherits the automorphic transformation law. Its modularity then exchanges the completed coefficient sum for dual sums at reflected cusps.

In the intro’s normalization, with \(\ell\asymp L\), the reflection kernel has scale \(X/\mathcal N(\ell)^2\). The basic dual length is \(Y=L^2/X\), and the squared transformation factor is \(X^2/L^2\). Thus the completed \(\tau_\ell\)-energy becomes a reflected \(\tau^\vee_\ell\)-energy with prefactor \(HX/L^2\). Individual branches also carry cusp, divisor, and cube scales.

The formal statement below packages this transformation for each fixed shell and twist. Its reflected fiber collects the cusp branches, weights, and local factors suppressed in the intro. The branch-decoding results supply this identity to the mean-square argument.

\[ T_{\Psi_{\rm row}}(W,X)= \bigl(4\,\Theta'^{-1}c_{\rm rad}\bigr)\, \operatorname{ReflectedFiber}(W,X). \]

Dependency boundary. ActualFixedShellModels.lean imports only BranchDecoding; this layer proves a model identity, not a nonvanishing conclusion.

Theta transformation

Actual fixed-shell models

Checked interface in Voronoi.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

Shared context · full Lean source ↗variable (m : O) (hm : m ≠ 0) (rows : Finset (Ideal O)) (R F : Ideal O) (hR : R ≠ 0) (hF : Squarefree F) (hrows : ∀ I ∈ rows, I ≠ 0) (v : Oˣ)
theta_voronoi · full Lean source ↗theorem theta_voronoi (Ψ : O →* ℂ) (hperiod : FactorsModulo (fixedBaseConductor 1) Ψ) (hΨ : ∀ n, ‖Ψ n‖ ≤ 1) (L : ℝ) (hshell : ∀ I ∈ rows, L / 2 ≤ (Ideal.absNorm I : ℝ) ∧ (Ideal.absNorm I : ℝ) ≤ L) (ℓ : RowIndex 1 m rows R F) (W : SmoothDyadicWeight ℂ) (X : ℝ) (hX : 0 < X) : thetaSum (rowTwist Ψ (maskElement 1 m) (OAI.ConcretePrimeRowBridge.idealGenerator F) (v.val * OAI.ConcretePrimeRowBridge.idealGenerator ℓ.val)) W X = ActualFixedShellModels.actualReflectionScale * (reflectedFiber 1 (m:Ohm:m ≠ 0rows:Finset (Ideal O)R:Ideal OF:Ideal OhR:R ≠ 0hF:Squarefree Fhrows:∀ I ∈ rows, I ≠ 0v:OˣΨ:O →* ℂhperiod:FactorsModulo (fixedBaseConductor 1) ΨhΨ:∀ (n : O), ‖Ψ n‖ ≤ 1L:ℝhshell:∀ I ∈ rows, L / 2 ≤ ↑(Ideal.absNorm I) ∧ ↑(Ideal.absNorm I) ≤ Lℓ:↥(RowIndex 1 m rows R F)W:SmoothDyadicWeight ℂX:ℝhX:0 < X⊢ 1 ≠ 0 All goals completed! 🐙) m hm rows R F hR hF hrows v L Ψ hΨ).idealValue W X 1 completedRamifiedStep (rowResidualPart ℓ.val (maskIdeal 1 m F))
Underlying general-purpose interface
The model interface supplied by that identity
07Transform

Read off the quadratic characters

The explicit reflected coefficients contain cubes of the sextic characters. After reopening the cube completion and separating the remaining factors, the intro illustrates the resulting quadratic energies by

\[ \overline{\chi_y(\ell)}^{\,3}=\chi_{2,y}(\ell),\qquad \sum_{\ell\asymp L}^{*} \left|\sum_{y\asymp Y}^{*}a_y\chi_{2,y}(\ell)\right|^2, \qquad Y=\frac{L^2}{X}. \]

The stars indicate admissible squarefree indices. The coefficients must be fixed with respect to the row variable \(\ell\) within each sieve application. The reflected coefficient formulas already exhibit quadratic characters; the second Poisson summation is a separate operation on squared row sums in the sieve and descent argument.

Character identity

Sextic cubes become quadratic rows

Checked interface in ThetaSums.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

quadraticEnergy · full Lean source ↗def quadraticEnergy (rows cols : Finset (Ideal O)) (a : Ideal O → ℂ) : ℝ := ∑ ℓ ∈ rows, ‖∑ y ∈ cols, a y * χ₂ y (primaryGenerator ℓ)‖ ^ 2
Underlying general-purpose interface
Auxiliary Poisson identity used in the formal sieve argument

The repository also proves masked_pair_second_poisson, used in ChildTransfer.lean. This masked-pair identity is distinct from the elementary sextic-cube identity above.

masked_pair_second_poisson · full Lean source ↗theorem masked_pair_second_poisson {ι : Type*} [DecidableEq ι] (p : ι → O) (hp : ∀ i, p i ≠ 0) [∀ i, (Ideal.span {p i}).IsMaximal] (hinj : Function.Injective (fun i => Ideal.span {p i})) (hg : ∀ i, lambda ∉ Ideal.span {p i}) (hc : ∀ i, ringChar (O ⧸ Ideal.span {p i}) ≠ 2) (M S T : Finset ι) (hd : Disjoint S T) (W : 𝓢(ℝ, ℂ)) (Y : ℝ) (hY : 0 < Y) : let n := ∏ i : activeSupport T S, p i.val (∑' y : O, rowCoprimeMask (fun i => Ideal.span {p i}) M y * (star (finiteSquarefreeRow (fun i => Ideal.span {p i}) hg T y) * finiteSquarefreeRow (fun i => Ideal.span {p i}) hg S y) * W (‖eisEmbedding y‖ ^ 2 / Y)) = ((Y : ℂ) / (‖eisEmbedding n‖ : ℂ)) * ∑ E ∈ M.powerset, let e := primeSubsetGenerator (fun i => Ideal.span {p i}) E ((UniqueFactorizationMonoid.moebius (∏ i ∈ E, Ideal.span {p i}) : ℂ) / (‖eisEmbedding e‖ ^ 2 : ℝ)) * ∑' k : O, paperRadialFourier W (Y * ‖eisEmbedding k‖ ^ 2 / (‖eisEmbedding e‖ ^ 2 * ‖eisEmbedding n‖ ^ 2)) * activeGaussRowFactor p hp hinj hg T S e k
08Transform

Use the quadratic large sieve

For admissible squarefree rows of norm about \(L\) and columns of norm about \(Y\), the sharp quadratic large sieve gives

\[ \sum_{\ell\asymp L}^{*} \left|\sum_{y\asymp Y}^{*}a_y\chi_{2,y}(\ell)\right|^2 \ \ll_\varepsilon\ (LY)^\varepsilon(L+Y)\sum_y^{*}|a_y|^2. \]

For \(|a_y|\le1\), the intro’s heuristic therefore gives \(S(X,H)\ll (HX/L^2)(L+Y)Y=H(L+Y)\ll HX\), ignoring epsilon losses. The full proof must sum the separate blocks with their weights and restrictions.

The adjacent Lean statement now gives the sharp \(L+Y\) bound for the displayed finite quadratic energy. It is proved from finite_family_quadratic_large_sieve; the initial \(M+N^2\) estimate remains available in the expandable implementation details.

Large sieve

The sharp quadratic energy bound

Checked interface in ThetaSums.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

Admissible · full Lean source ↗def Admissible (I : Ideal O) : Prop := I ≠ 0 ∧ Squarefree I ∧ ∀ P ∈ UniqueFactorizationMonoid.normalizedFactors I, lambda ∉ P ∧ ringChar (O ⧸ P) ≠ 2
quadratic_large_sieve · full Lean source ↗theorem quadratic_large_sieve (ε : ℝ) (hε : 0 < ε) : ∃ C : ℝ, 0 < C ∧ ∀ L Y : ℝ, 1 ≤ L → 1 ≤ Y → ∀ rows cols : Finset (Ideal O), (∀ ℓ ∈ rows, Admissible ℓ ∧ (Ideal.absNorm ℓ : ℝ) ≤ L) → (∀ y ∈ cols, Admissible y ∧ (Ideal.absNorm y : ℝ) ≤ Y) → ∀ a : Ideal O → ℂ, quadraticEnergy rows cols a ≤ C * (L * Y) ^ ε * (L + Y) * ∑ y ∈ cols, ‖a y‖ ^ 2
Underlying general-purpose interface
ideal_initial_quadratic_sieve · full Lean source ↗theorem ideal_initial_quadratic_sieve (F : Finset (Ideal O)) (hFpos : ∀ I ∈ F, I ≠ ⊥) (hFgood : ∀ I ∈ F, ∀ P ∈ UniqueFactorizationMonoid.normalizedFactors I, goodLambda ∉ P) (hsq : ∀ I ∈ F, Squarefree I) (hchar : ∀ i : primePool F, ringChar (O ⧸ i.val) ≠ 2) (N : ℕ) (hN : 1 ≤ N) (hnorm : ∀ I ∈ F, Ideal.absNorm I ≤ N) (a : Ideal O → ℂ) (M : ℝ) (hM : 1 ≤ M) (R : Finset O) (hR : ∀ z ∈ R, ‖eisEmbedding z‖ ^ 2 ≤ M) : (∑ z ∈ R, ‖∑ I ∈ F, a I * (idealSexticRow F hFpos hFgood I z) ^ 3‖ ^ 2) ≤ initialSieveConstant * (M + (N : ℝ) ^ 2) * ∑ I ∈ F, ‖a I‖ ^ 2
Close
09Close

Close the mean square at every positive radius

The preceding displays explain the gain on a typical block. To bound the full moment, the proof organizes the common divisors, cube scales, phases, and remaining rows through further Poisson estimates and a finite descent. Its reserve can be arbitrarily small: for any \(\theta>0\), the formal argument uses CanonicalDescentScale.ofReserve (θ / 2).

\[ \sum_{\substack{h\in T\\\mathcal N(h)\le X^{1+\theta}}}|M_h(X)|^2 \ \ll_{\theta,\varepsilon}\ X\cdot X^{1+\theta}\cdot X^\varepsilon. \]

The checked interfaces below bound both finite sets of nonzero rows and the actual smooth moment \(S\), with \(0\le V\le1\). For \(H\) comparable to \(X^{1+\theta}\), this is the intro’s target \(S(X,H)\ll XH X^\varepsilon\). The bound is not asserted uniformly for arbitrarily small \(H\). Taking \(\theta\) arbitrarily small lets amplification reach \(11/12+\varepsilon\).

Density closure

A movable descent scale

Checked interface in ZetaFamily.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

row_mean_square · full Lean source ↗theorem row_mean_square (W : SmoothDyadicWeight ℂ) (θ ε : ℝ) (hθ : 0 < θ) (hε : 0 < ε) : ∃ C : ℝ, 0 < C ∧ ∀ X : ℕ, 1 ≤ X → ∀ T : Finset 𝒪, (∀ h ∈ T, (𝒩 h : ℝ) ≤ (X : ℝ) ^ (1 + θ)) → (∀ h ∈ T, h ≠ 0) → (∑ h ∈ T, ‖M W h X‖ ^ 2) ≤ C * X * (X : ℝ) ^ (1 + θ) * (X : ℝ) ^ ε
mean_square_dyadic · full Lean source ↗theorem mean_square_dyadic (W : SmoothDyadicWeight ℂ) (V : SmoothDyadicCutoff) (hV : ∀ t, V t ≤ 1) (θ ε : ℝ) (hθ : 0 < θ) (hε : 0 < ε) : ∃ C : ℝ, 0 < C ∧ ∀ X H : ℕ, 1 ≤ X → (H : ℝ) ≤ (X : ℝ) ^ (1 + θ) → (X : ℝ) ^ (1 + θ) ≤ 2 * H → S W V X H ≤ C * X * H * (X : ℝ) ^ ε
Underlying general-purpose interface
CanonicalDescentScale · full Lean source ↗class CanonicalDescentScale where denominator : ℕ denominator_pos : 0 < denominator reserve : ℝ reserve_pos : 0 < reserve short_budget : 50 ≤ reserve * denominator
ofReserve · full Lean source ↗Definition `OAI.CanonicalDescentScale.ofReserve` of class type is semireducible. Most type class instances should be instance-reducible, so consider marking this definition with `@[instance_reducible]`. If it is intentionally semireducible, this warning can be disabled with `set_option warn.classDefReducibility false`. def ofReserve (κ : ℝ) (hκ : 0 < κ) : CanonicalDescentScale where denominator := ⌈50 / κ⌉₊ + 1 denominator_pos := κ:ℝhκ:0 < κ⊢ 0 < ⌈50 / κ⌉₊ + 1 All goals completed! 🐙 reserve := κ reserve_pos := hκ short_budget := κ:ℝhκ:0 < κ⊢ 50 ≤ κ * ↑(⌈50 / κ⌉₊ + 1) κ:ℝhκ:0 < κhceil:50 / κ ≤ ↑⌈50 / κ⌉₊⊢ 50 ≤ κ * ↑(⌈50 / κ⌉₊ + 1) κ:ℝhκ:0 < κhceil:50 / κ ≤ ↑⌈50 / κ⌉₊hadd:↑⌈50 / κ⌉₊ ≤ ↑(⌈50 / κ⌉₊ + 1)⊢ 50 ≤ κ * ↑(⌈50 / κ⌉₊ + 1) κ:ℝhκ:0 < κhceil:50 / κ ≤ ↑⌈50 / κ⌉₊hadd:↑⌈50 / κ⌉₊ ≤ ↑(⌈50 / κ⌉₊ + 1)hdiv:50 / κ ≤ ↑(⌈50 / κ⌉₊ + 1)⊢ 50 ≤ κ * ↑(⌈50 / κ⌉₊ + 1) κ:ℝhκ:0 < κhceil:50 / κ ≤ ↑⌈50 / κ⌉₊hadd:↑⌈50 / κ⌉₊ ≤ ↑(⌈50 / κ⌉₊ + 1)hdiv:50 / κ ≤ ↑(⌈50 / κ⌉₊ + 1)this:50 ≤ ↑(⌈50 / κ⌉₊ + 1) * κ⊢ 50 ≤ κ * ↑(⌈50 / κ⌉₊ + 1) κ:ℝhκ:0 < κhceil:50 / κ ≤ ↑⌈50 / κ⌉₊hadd:↑⌈50 / κ⌉₊ ≤ ↑(⌈50 / κ⌉₊ + 1)hdiv:50 / κ ≤ ↑(⌈50 / κ⌉₊ + 1)this:50 ≤ (↑⌈50 / κ⌉₊ + 1) * κ⊢ 50 ≤ κ * (↑⌈50 / κ⌉₊ + 1) All goals completed! 🐙
The arbitrary-positive-radius conclusion
outside_mean_square_of_theta_models_pos · full Lean source ↗theorem outside_mean_square_of_theta_models_pos {q₀ : ℕ} (χ : DirichletCharacter ℂ q₀) (S : Finset (Ideal ActualEisensteinCubic.O)) (hbad : fixedBadPrimes⊆S) (hSp : ∀P∈S,Prime P) (ρ q levelBound : ℝ) (hρ : 0<ρ) (hq : 1<q) (hlevel : 1≤levelBound) (hmodels : HasCanonicalThetaModels S (conjugateMonoid (normCharacter χ)) ρ q levelBound) (W : ℝ→ℂ) (a b : ℝ) (ha : 0<a) (hs : Function.support W⊆Set.Icc a b) (hW : ContDiff ℝ ∞ W) (σ ε : ℝ) (hσ : 0<σ) (hε : 0<ε) : ∃C : ℝ,0<C ∧ ∀(D : ℕ) (Z : ℝ),1≤Z → b*Z≤D → ∀T : Finset ActualEisensteinCubic.O, (∀z∈T,(Ideal.absNorm (Ideal.span {z}):ℝ)≤Z^(1+σ)) → (∀z∈T,z≠0) → (∑z∈T,‖idealRowSum (outsideIdealsUpTo S D) (outsideIdealsUpTo_ne_bot S D) (outside_good S D hbad) χ (fun n=>W (n/Z)) z‖^2)≤C*Z*(Z^(1+σ))*Z^ε
10Close

Amplify with sixth powers and extract \(11/12\)

The intro illustrates amplification with prime sixth powers. The formal assembly uses the same mechanism by averaging all \(h=b^6\) with \(b\) in a smooth norm annulus. A sextic character on such a row is exactly the coprimality indicator. Averaging this indicator produces the density \(d(I)=\prod_{P\mid I}(1-1/\mathcal N(P))\).

\[ \chi_I(b^6)=\mathbf 1_{(b,I)=1},\quad B=X^{(1+\theta)/6},\quad |M_{\rm dens}(X)|\ll X^{(11+5\theta)/12+\eta}. \]

Here \(B\) is the amplifier’s norm scale and \(M_{\rm dens}(X)\) is the smoothed admissible-ideal sum with coefficients \(\mu_K(I)d(I)\). Choose \(\theta=6\varepsilon/5\) and \(\eta=\varepsilon/2\); then \((11+5\theta)/12+\eta=11/12+\varepsilon\). The next step removes the density by an Euler correction.

Amplification

All sixth powers, then the exponent calculation

Checked interface in ZetaFamily.lean. Rendered from checked Lean by Verso. Hover over identifiers for types; click through to definitions and full proofs.

densityM · full Lean source ↗def densityM (W : SmoothDyadicWeight ℂ) (X : ℝ) : ℂ := ∑' n : Ideal 𝒪, if ∀ P ∈ excludedPrimes, ¬ P ∣ n then (UniqueFactorizationMonoid.moebius n : ℂ) * density n * W ((Ideal.absNorm n : ℝ) / X) else 0
densityM_bound · full Lean source ↗theorem densityM_bound (W : SmoothDyadicWeight ℂ) (ε : ℝ) (hε : 0 < ε) : (fun X : ℝ ↦ densityM W X) =O[atTop] (fun X : ℝ ↦ X ^ ((11 / 12 : ℝ) + ε))
Underlying general-purpose interface
outside_totient_moebius_bound_of_mean_square · full Lean source ↗theorem outside_totient_moebius_bound_of_mean_square {q : ℕ} (chi : DirichletCharacter ℂ q) (S : Finset (Ideal OAI.ActualEisensteinCubic.O)) (hbad : OAI.CanonicalQuadraticSieve.fixedBadPrimes ⊆ S) (W : ℝ → ℂ) (a b : ℝ) (_ha : 0 < a) (hsupport : Function.support W ⊆ Set.Icc a b) (hW : ContDiff ℝ ∞ W) (theta epsilon Cmean : ℝ) (htheta : 0 ≤ theta) (hepsilon : 0 < epsilon) (hCmean : 0 < Cmean) (hmean : ∀ (D : ℕ) (X : ℝ), 1 ≤ X → b * X ≤ D → ∀ T : Finset OAI.ActualEisensteinCubic.O, (∀ h ∈ T, (Ideal.absNorm (Ideal.span {h}) : ℝ) ≤ X ^ (1 + theta : ℝ)) → (∀ h ∈ T, h ≠ 0) → (∑ h ∈ T, ‖idealRowSum (outsideIdealsUpTo S D) (outsideIdealsUpTo_ne_bot S D) (outside_good S D hbad) chi (fun n ↦ W (n / X)) h‖ ^ 2) ≤ Cmean * X ^ ((2 + theta : ℝ) + 2 * epsilon)) : ∃ C : ℝ, 0 < C ∧ ∀ (D : ℕ) (X : ℝ), 1 ≤ X → b * X ≤ D → ‖∑ n ∈ outsideIdealsUpTo S D, baseChangeWeight chi n * W ((Ideal.absNorm n : ℝ) / X) * totientDensity n‖ ≤ C * X ^ (((11 + 5 * theta) / 12 : ℝ) + epsilon)
11Close

Use Mellin inversion and restore the Euler factors

The all-sixth-powers amplifier bounds the density-weighted sum \(M_{\rm dens}(X)\). Mellin inversion turns this bound into an analytic function in \(\Re(s)>11/12\). The density totientDensity is then accounted for by an explicit Euler product.

An absolutely convergent eulerCorrection removes the density, while finiteEulerFactor restores the finitely excluded bad primes. The public \([1/2,1]\) convention is converted to the upstream \([1,2]\) Mellin convention by the harmless dilation \(x\mapsto2x\).

\[ (\zeta(s)L(s,\chi_{-3}))\, (E_S(s)E_{\rm dens}(s)\,\mathcal M(s)) =\widehat W(s). \]

Analytic bridge

Weighted Möbius → analytic reciprocal

SmoothedWeightedMobiusBound · full Lean source ↗def SmoothedWeightedMobiusBound {q : ℕ} (chi : DirichletCharacter ℂ q) (S : Finset (Ideal O)) (sigma : ℝ) : Prop := ∀ (W : ℝ → ℂ), ContDiff ℝ ∞ W → Function.support W ⊆ Set.Icc (1 / 2 : ℝ) 1 → ∀ epsilon : ℝ, 0 < epsilon → (fun Z : ℝ ↦ ∑' I : Ideal O, outsideWeight chi S I * W ((Ideal.absNorm I : ℝ) / Z)) =O[atTop] (fun Z : ℝ ↦ Z ^ (sigma + epsilon))
Analytic continuation and the exact corrected identity
weightedCompactMellin_analytic_of_smoothedWeightedMobiusBound · full Lean source ↗theorem weightedCompactMellin_analytic_of_smoothedWeightedMobiusBound {q : ℕ} (chi : DirichletCharacter ℂ q) (S : Finset (Ideal O)) (sigma : ℝ) (hbound : SmoothedWeightedMobiusBound chi S sigma) (W : ℝ → ℂ) (hW : ContDiff ℝ ∞ W) (hsupp : ∀ x, x ≤ 1 ∨ 2 ≤ x → W x = 0) : AnalyticOnNhd ℂ (fun s : ℂ ↦ mellin (fun Z : ℝ ↦ weightedCompactSum chi S W Z⁻¹) (-s)) {s : ℂ | sigma < s.re}
corrected_weighted_mellin_identity · full Lean source ↗theorem corrected_weighted_mellin_identity {q : ℕ} [NeZero q] (χ : DirichletCharacter ℂ q) (S : Finset (Ideal ActualEisensteinCubic.O)) (hS : ∀P∈S,Prime P) (W : ℝ→ℂ) (hW : ContDiff ℝ ∞ W) (hs : ∀x,x≤1 ∨ 2≤x→W x=0) (s : ℂ) (hRe : 2<s.re) : (χ.LFunction s*(baseChangeChar χ).LFunction s)* ((finiteEulerFactor χ S s*SmoothMobiusCorrection.eulerCorrection χ S s)* mellin (fun Z : ℝ=>weightedCompactSum χ S W Z⁻¹) (-s))= mellin W s
12Close

Conclude zeta nonvanishing

Choose a compactly supported Mellin test whose transform is nonzero at the point in question. The corrected identity rules out zeros of \(\zeta_K(s)=\zeta(s)L(s,\chi_{-3})\) in the half-plane, and hence rules out zeros of \(\zeta(s)\), as claimed in the intro.

The reusable formal theorem treats Dirichlet characters more generally. The endpoint here specializes it to the trivial character modulo one; the possible pole at \(s=1\) is handled separately.

\[ \boxed{\ \Re(s)>\frac{11}{12}\quad\Longrightarrow\quad\zeta(s)\ne0\ }. \]

Endpoint

The unconditional theorem

How to read this blueprint

The prose gives the invariant. The Lean gives the contract.

Each right-hand panel shows the definition or theorem boundary that certifies the corresponding mathematical move. Long proof terms are intentionally left in the linked source; no analytic input is hidden behind prose-only notation.

Public layerElevenTwelfths/* fixes notation, the \([1/2,1]\) cutoff, the amplifier, and the final direct assembly.
Reused coreOAI/NumberTheory/DirichletL/* supplies the Poisson, Gauss, theta, descent, and sieve machinery.
Dependency boundaryThe endpoint is assembled from BranchDecoding and lower layers.