riemann

The Lean code claims a proof of the Riemann Hypothesis. This site has not checked the claim yet. See what is checked.

CM curves, the invariant derivation and divisibility

Four steps of the timeline speak about CM curves, the invariant derivation, divisibility by powers of a prime, norms from Chowla-Selberg and a gcd. The Lean code has a declaration for each of these words. But the declarations are smaller and more scattered than the steps suggest, and some of them do other jobs. This page follows each one and says what it really proves.

draft

Result

This page is about four steps of the timeline.

  • Step 2: Dp≡0D^p \equiv 0 on a CM curve for pp inert in KK, where DD is the invariant derivation. This gives a divisibility of Daθ(0)/ΩaD^a\theta(0)/\Omega^a by a power of pp.
  • Step 9: the norms of the lifts and the level, with divisibility from Chowla-Selberg, Weyl and the Siegel mass.
  • Step 10: a lower bound on the divisibility of the mm-fold lift that is sufficient.
  • Step 15: glue an integral structure across the Hecke characters to get a gcd.

The Lean code has these results that are close to the steps. All of them are proved in the code. None of them is a cut point in the literature inputs.

  1. cmCurveGoodOutsidePrime. For each prime p>3p > 3 with p≡3(mod4)p \equiv 3 \pmod 4, there is an elliptic curve AA over the number field F=ℚ(j)F = \mathbb{Q}(j), with CM by the integers of ℚ(−p)\mathbb{Q}(\sqrt{-p}), with good reduction outside pp and with minimal discriminant −p3-p^3.
  2. constantCoeff_pIterate_invariantDerivation_coord. For a lift μ\mu of a formal group law, the constant term of Dp(Xj)D^p(X_j) is ∑iciuip\sum_i c_i u_i^p modulo ker⁡θ+(p)\ker\theta + (p). Here DD is the invariant derivation in direction uu, and cic_i comes from the coefficient of XipX_i^p in a quasi-logarithm. This is a Hasse-Witt type formula.
  3. JetInt. Iterated derivatives at 00 of an Eisenstein lattice sum, divided by powers of periods aia_i with ai/Ωa_i/\Omega of known ll-adic size, have a bounded ll-adic size.
  4. chowla_selberg_discriminant. For an imaginary quadratic field KK of discriminant −d-d with d>4d > 4, the class group mean of log⁡(N(𝔞c)6 ∣Δ(Lc)∣)\log\big(N(\mathfrak a_c)^6\,|\Delta(L_c)|\big) is 12log⁡2π−6log⁡d+6γ−6 L′(1,χ)/L(1,χ)12\log 2\pi - 6\log d + 6\gamma - 6\,L'(1,\chi)/L(1,\chi).
  5. betaArch_of_transport. The norm of an algebraic number β\beta, made from a Hecke L-value at a CM point, is bounded. The proof uses the Chowla-Selberg mean.
  6. flatProductDepthPeriodic_gcd. If a product of local test functions is periodic with periods kk and k′k', then it is periodic with period gcd⁡(k,k′)\gcd(k,k').

Idea

The steps of the timeline tell one story: a derivative on a CM curve kills pp-th powers, so derivatives of theta values are divisible by pp; the divisibility is then measured by norms through Chowla-Selberg, bounded from below, and combined into a gcd. The Lean code does not tell this story in one chain. The pieces live in different branches of the proof tree.

  • The CM curve is a literature input. It is used once, to build the field data FieldDat of a host field. It is not used to compute derivatives.
  • The formula for DpD^p is about any lift of a formal group law. It is used to show that a dual Frobenius matrix is nilpotent, inside the proof of a prismatic Dieudonné statement. It does not mention a CM curve or theta.
  • The divisibility of derivatives over periods is the statement JetInt. Its proof uses bounds on values of Hilbert Eisenstein series at CM points, not the formula for DpD^p.
  • The norm bound and the gcd are two small lemmas under the unitary hypotheses.

So the page has one section per piece, and it says at each point where the timeline and the code differ.

Before you read

You need these ideas.

Plan

  1. State the CM curve and see where the proof uses it.
  2. Define the invariant derivation and state the formula for DpD^p.
  3. See where the formula is used: the nilpotence of a dual Frobenius.
  4. State JetInt: derivatives over periods have bounded ll-adic size.
  5. Turn this into lower bounds on valuations: LatIntRam, LatIntUnr and ToricDenominator.
  6. State the Chowla-Selberg formula of the code.
  7. Bound the norm of β\beta with it: BetaArch.
  8. Get a gcd of depths, and use it for a minimal depth.

The steps

Step 1. The CM curve

The statement is in CmCurveGoodOutsidePrimePremises.lean#L35.

def CMCurveGoodOutsidePrimeSt : Prop :=
  ∀ p : ℕ, p.Prime → p % 4 = 3 → 3 < p →
    ∃ (F : Type) (_ : Field F) (_ : NumberField F) (A : WeierstrassCurve F),
      IsGoodCMCurve p F A ∧ HasMinimalDiscriminant A (-(p : F) ^ 3)

IsGoodCMCurve p F A asks three things. FF is ℚ(j(L))\mathbb{Q}(j(L)), where L⊂ℂL \subset \mathbb{C} is the lattice of algebraic integers of ℚ(−p)\mathbb{Q}(\sqrt{-p}). The jj-invariant of AA is j(L)j(L). And AA has good reduction at each prime of FF that does not divide pp. HasMinimalDiscriminant A D asks that at each prime vv there is a minimal model of AA whose discriminant is a unit times DD. This is a curve of the kind that B. Gross studied.

The proof is CmCurveGoodOutsidePrime.lean#L47. It takes the lattice LL and the fact that j(L)j(L) is an algebraic integer. It scales the lattice, and it takes the twist of the curve y2=x3−g24x−g34y^2 = x^3 - \tfrac{g_2}{4}x - \tfrac{g_3}{4} by dF=1d_F = 1 if p≡3(mod8)p \equiv 3 \pmod 8 and by dF=−pd_F = -p if p≡7(mod8)p \equiv 7 \pmod 8. Then at each prime it finds a local minimal model with discriminant a unit times (−p)3(-p)^3. The proof dominates 169 declarations. The largest part (92) is the computation of the discriminant of the twisted model.

In the proof of the Riemann Hypothesis the statement enters through cm_curve_good_outside_prime_st_of_literature (EveryCharacterOfLiteratureOfVWin.lean#L277). This is one line: it ignores its argument O and returns cmCurveGoodOutsidePrime. It is a field of the bundle published_results_eigen (3,017).

The statement is used by baseCond_KPx (ExistsPrePin.lean#L30), which dominates 111 declarations.

theorem baseCond_KPx : RayField → PrincipalIdealSt → CMCurveGoodOutsidePrimeSt →
    StandardLattice.SiegelMassRatioCM → BaseCond KPx

Inside it, nonempty_fieldDat applies the statement to p=dp = d, where −d-d is the discriminant of the imaginary quadratic host field and d≡7(mod16)d \equiv 7 \pmod{16}. The curve is stored in the structure FieldDat, and the code defines from it a torsion field and a discriminant field. So the CM curve has CM by the host field itself, and p=dp = d is ramified in that field, not inert. The same theorem takes SiegelMassRatioCM: for an unramified CM field KK and M≥3M \geq 3, the ratio of the masses of the standard Hermitian lattices of ranks MM and M−1M-1 is an explicit value massRatioRightSide K M. The code proves it with massRatio_all_unramified_cmFields. This is the only place on this page where a Siegel mass appears.

Step 2. The invariant derivation and DpD^p

Let μ=(μ1,…,μd)\mu = (\mu_1, \dots, \mu_d) be power series in X1,…,Xd,Y1,…,YdX_1, \dots, X_d, Y_1, \dots, Y_d over a ring BB. For u∈Bdu \in B^d, the code defines (InvDer.lean#L16)

DuF(X)=∑i=1dui ∂∂YiF(μ(X,Y))∣Y=0. D_u F(X) = \sum_{i=1}^{d} u_i \, \frac{\partial}{\partial Y_i} F(\mu(X,Y)) \Big|_{Y=0}.

When μ\mu is a formal group law, DuD_u is the invariant derivation in the direction uu.

The main statement is ConstantCoeffPIterateInvariantDerivationCoordStatement.lean#L8. It works in a "frame" IsFrame p Q θ: a surjection θ:B→O\theta : B \to O, an injection B→QB \to Q where pp is a unit, BB is pp-adically complete, OO has no pp-torsion, and for each x∈ker⁡θx \in \ker\theta we have xp=p yx^p = p\,y with y∈ker⁡θy \in \ker\theta. The series μ\mu is a lift (IsLift θ μ): its image under θ\theta is a commutative formal group law. The series ll over QQ is a quasi-logarithm for μ\mu in coordinate jj: its linear part is the jj-th coordinate, and l(μ(X,Y))−l(X)−l(Y)l(\mu(X,Y)) - l(X) - l(Y) has coefficients in ker⁡θ\ker\theta. Let ci∈Bc_i \in B with ci=p⋅[Xip] lc_i = p \cdot [X_i^p]\,l in QQ. Then the statement is

constant term of Du p(Xj)  ≡  ∑i=1dci ui p(modker⁡θ+pB). \text{constant term of } D_u^{\,p}(X_j) \;\equiv\; \sum_{i=1}^{d} c_i\, u_i^{\,p} \pmod{\ker\theta + pB}.

In words: up to the ideal ker⁡θ+(p)\ker\theta + (p), the pp-th power of the invariant derivation acts on the coordinate XjX_j through a pp-linear map, and the coefficients of this map are read off from the XpX^p terms of the logarithm. When all cic_i are 00 modulo this ideal, the constant term of Du p(Xj)D_u^{\,p}(X_j) is 00 modulo it. This is the general form of "Dp≡0D^p \equiv 0". The proof (constantCoeff_iterate_invDer_X_sub_mem) dominates 29 declarations, and the statement dominates 30.

The statement is about a formal group law in general. It does not mention an elliptic curve, CM, a prime inert in KK, a theta function or a period Ω\Omega.

Step 3. Where the formula is used

The only user in the proof tree is isNil_dual_frobenius (IsNilDualFrobenius.lean#L24), which dominates 77 declarations. Its setting is a pp-divisible group GG over the ring of integers OO of an algebraically closed field CC, a frame built from a primitive system ε\varepsilon in the tilt, and a chart of GG by a formal group law. A basis ee of quasi-logarithms has a Frobenius matrix of the form U⋅blk(p,1)U \cdot \mathrm{blk}(p, 1) with UU invertible. If the dual group G∨G^\vee is connected, the theorem proves that the matrix (UT)−1 blk(1,p)(U^{T})^{-1}\,\mathrm{blk}(1,p) is nilpotent in the sense IsNil. The formula of Step 2 is what makes the dual Frobenius small modulo pp.

This lemma is used in window_matrices (1,206), and that is used in the proof of UpperTheory.Lit.prismaticDieudonneHodge (1,708). The statement PrismaticDieudonneHodge asks for a functor from pp-divisible groups over OO to free modules over Fontaine's ring Ainf⁡A_{\inf}, of rank equal to the height, with a Frobenius and a Hodge filtration 0→ωG→D→Lie(G∨)→00 \to \omega_G \to D \to \mathrm{Lie}(G^\vee) \to 0. It is a literature input that the code proves. So in the code the invariant derivation serves pp-adic Hodge theory, not the divisibility of theta values.

Step 4. Derivatives over periods

The statement closest to "divisibility of Daθ(0)/ΩaD^a\theta(0)/\Omega^a" is JetInt (JetAnalytic.lean#L239).

It is stated for all data AllLat: a CM field EE that is abelian over ℚ\mathbb{Q}, a CM type φ=(φi)i∈I\varphi = (\varphi_i)_{i \in I}, an integer s≥1s \geq 1, values zz of partial zeta functions, a conductor 𝔣\mathfrak f, an integral lattice Λ\Lambda of the imaginary quadratic field of discriminant −d-d, a prime ll and a lattice LL of EE. For each embedding λ\lambda of ℚ‾\overline{\mathbb{Q}} into ℂl\mathbb{C}_l and each Ω\Omega with Ω12=Δ(Λ)\Omega^{12} = \Delta(\Lambda), it asks for nonzero ai,bia_i, b_i with two conditions.

  • ai/Ωa_i/\Omega is algebraic with ∣λ(ai/Ω)∣≤la0|\lambda(a_i/\Omega)| \leq l^{a_0}, and (aibid/2π)−1(a_i b_i \sqrt d/2\pi)^{-1} has a similar bound.
  • For each Eisenstein lattice sum gg of weight 2s2s attached to LL (IsDefSum), and each list uu of directions with κi\kappa_i copies of ii, the number

∂ug(0)⋅∏i∈I(bi/ai)κiai 2s \partial_u g(0) \cdot \prod_{i \in I} \frac{(b_i/a_i)^{\kappa_i}}{a_i^{\,2s}}

is algebraic, and its ll-adic size is at most l e+2s∣I∣c+(∑iκi)cl^{\,e + 2s|I|c + (\sum_i \kappa_i)c}, with ee from the zeta values and c=cvp(𝔣,l)c = c_{v_p}(\mathfrak f, l) from the conductor.

Here Sz l lam r x means that xx is algebraic and ∣λ(x)∣≤lr|\lambda(x)| \leq l^r (TorsTransport.lean#L17). So JetInt says: derivatives of an Eisenstein sum at 00, divided by period powers, have bounded denominators at ll. This is a divisibility statement for derivatives over periods. The derivatives are partial derivatives on ℂI\mathbb{C}^I, not the invariant derivation of Step 2.

The proof is cmLatticeDividedPowerJetIntegrality_of_ellipticCM (CmLatticeDividedPowerJetIntegralityOfPublishedStatement.lean#L9), with 156 declarations. It takes four named inputs: SiegelKlingenDeligneRibet, PartialZetaFunctionalEquation, HilbertClassFieldJ and EllipticMainTheoremCM. The inner proof JetIntElliptic.jetInt starts with fun _ hPZ _ _ =>, so it uses only the functional equation of partial zeta functions. The other three inputs are not used. Its main parts are a bound on Hilbert Eisenstein values at CM points when jj is integral (norm_hilbertEisensteinValue_le_of_integral_j, 58) and a core lemma (66).

Step 5. Lower bounds on valuations

From JetInt the code gets two statements on the ll-adic valuation of β\beta (TorsTransport.lean#L33). The number β\beta is defined in CMVal.beta:

β(Λ,T)=(C0⋅T)12Δ(Λ) wt, \beta(\Lambda, T) = \frac{(C_0 \cdot T)^{12}}{\Delta(\Lambda)^{\,\mathrm{wt}}},

where T=S(0)T = S(0) is the value at 00 of a lattice sum SS (IsLatSum), C0C_0 is an explicit constant and wt\mathrm{wt} is the weight. LatIntRam (for ll that divides the conductor) and LatIntUnr (for ll that does not) both say

vl(β)  ≥  betaBound_vp(d,s,κ,𝔣,z,l). v_l(\beta) \;\geq\; \texttt{betaBound\_vp}(d, s, \kappa, \mathfrak f, z, l).

This is a lower bound on the divisibility of β\beta by ll. The theorem toricDenominator (ToricDenominatorOfZetaDenominators.lean#L39, 32 declarations) combines the two bounds with ZetaDenominators, a bound on the denominators of partial zeta values, into the statement ToricDenominator.

The chain is latIntUnr (20) and latIntRam (9), then toricDenominator (32), then joinOut_of_lat (180), then joinOut_of_jetInt (233), then joinOut_of_five (1,598), then join_out_of_literature (1,604) and published_results_eigen (3,017). The output JoinOut holds, among other things, the statement Transport of Step 7.

The timeline speaks of "the mm-fold lift". The code has no mm-fold lift here. The closest counterpart of step 10 is this lower bound on vl(β)v_l(\beta).

Step 6. The Chowla-Selberg formula

Let KK be an imaginary quadratic field with discriminant −d-d, d>4d > 4, class number hh and character χ\chi. For each ideal class cc pick an ideal 𝔞c\mathfrak a_c in cc and let LcL_c be its lattice in ℂ\mathbb{C}. The code proves (DedekindZetaEqSumRealEisenstein.lean#L259)

1h∑clog⁡ ⁣(N(𝔞c)6 ∣g2(Lc)3−27g3(Lc)2∣)=12log⁡2π−6log⁡d+6γ−6 L′(1,χ)L(1,χ). \frac{1}{h} \sum_{c} \log\!\Big( N(\mathfrak a_c)^6 \, \big|g_2(L_c)^3 - 27 g_3(L_c)^2\big| \Big) = 12\log 2\pi - 6 \log d + 6\gamma - 6\,\frac{L'(1,\chi)}{L(1,\chi)}.

Here γ\gamma is Euler's constant. The left side is a mean over the class group. It does not depend on the choice of 𝔞c\mathfrak a_c, because N(𝔞)6∣Δ∣N(\mathfrak a)^6|\Delta| does not change when the lattice is scaled. The proof uses the Kronecker limit formula for the real analytic Eisenstein series (tendsto_realEisenstein_sub_pole, in TendstoRealEisensteinSubPole.lean of the same folder) and the class number formula L(1,χ)=πh/dL(1,\chi) = \pi h/\sqrt d (LFunction_one_eq_classNumber, in the same file). Both are proved in the code.

The version used by the proof tree is classMean_log_norm_disc_chowlaSelberg (ClassMeanLogNormDiscChowlaSelbergStatement.lean#L9). It is the same formula, written with nrm, latDisc and dlogL D 1 for the host field DD. It dominates 8 declarations.

Step 7. The norm bound

The statement BetaArch (NormSmall.lean#L96) bounds the norm of β\beta. Let yy be the value Λ(s)\Lambda(s) of a Hecke L-function at ss (IsTor), and let Λ\Lambda be an integral lattice. Then

log⁡∣constant coefficient of minpolyℚ(β)∣  ≤  deg⁡(β)⋅12 b, \log \big| \text{constant coefficient of } \mathrm{minpoly}_{\mathbb{Q}}(\beta) \big| \;\leq\; \deg(\beta) \cdot 12 \, b,

where bb is a bound bTH fixed by the data. Up to sign, the constant coefficient of the minimal polynomial is the norm of β\beta from ℚ(β)\mathbb{Q}(\beta) to ℚ\mathbb{Q}.

The proof is betaArch_of_transport (BetaConjugateMeanLogAbsBoundOfTransport.lean#L43), with 70 declarations. It takes four inputs: Transport, FieldDat, LBound and TorEx. The argument has three parts.

  1. Find the imaginary quadratic subfield KK of the field data.
  2. Transport gives each Galois conjugate σ(β)\sigma(\beta) as a value of the same shape, for an ideal 𝔞σ\mathfrak a_\sigma and a lattice Λσ\Lambda_\sigma. This is Shimura reciprocity. With LBound (a bound on log⁡∣Λ(s)∣\log|\Lambda(s)| for Hecke L-functions) it gives log⁡∣σβ∣≤Fσ\log|\sigma\beta| \leq F_\sigma, where FσF_\sigma contains the term −wt⋅log⁡(N(𝔞σ)6∣Δ(Λσ)∣)-\mathrm{wt}\cdot\log\big(N(\mathfrak a_\sigma)^6|\Delta(\Lambda_\sigma)|\big).
  3. Average over the conjugates. They run over the ideal classes of KK, so the mean of the log⁡(N(𝔞)6∣Δ∣)\log(N(\mathfrak a)^6|\Delta|) terms is given by the Chowla-Selberg formula of Step 6.

The chain above it is betaConjugate_mean_logAbs_bound_of_transport (71), then square_top_term_joined_estimates (2,312), then fittedFunction_at_zero_close_alt (4,154), and then the unitary hypotheses. So here "Chowla-Selberg gives divisibility" becomes "Chowla-Selberg controls the archimedean size of the conjugates of β\beta".

Step 8. A gcd of depths

Fix data of a grid: places, local Schwartz test functions Φ\Phi and a family β\beta. The function flatProd is the product over places ww of local factors. DepthOK S t Φ β e K (IsExpansionIff.lean#L20) says two things.

  • If flatProd is not zero at half-integral points x,yx, y, then KxjK x_j and KyiK y_i lie in the given lattices.
  • flatProd is periodic: flatProd(x+Ku,y+Kv)=flatProd(x,y)\mathrm{flatProd}(x + K u, y + K v) = \mathrm{flatProd}(x, y) for lattice vectors u,vu, v.

The statement flatProductDepthPeriodic_gcd (FlatProductDepthPeriodicGcdStatement.lean#L9, 5 declarations) is

DepthOK(k)  ∧  DepthOK(k′)  ⟹  DepthOK(gcd⁡(k,k′)). \mathrm{DepthOK}(k) \;\wedge\; \mathrm{DepthOK}(k') \;\Longrightarrow\; \mathrm{DepthOK}(\gcd(k,k')).

The proof is Bezout: gcd⁡(k,k′) x=A (kx)+B (k′x)\gcd(k,k')\,x = A\,(k x) + B\,(k' x) with integers A,BA, B, and lattices and periods are closed under integer combinations.

The user is depthK_of_hypotheses_alt (DepthOfSumBound.lean#L12), with 49 declarations. Let expDepth be the least valid depth. For any valid KK, the gcd of expDepth and KK is valid, and it is at most expDepth, so it equals expDepth. Hence expDepth divides KK, and vl(expDepth)≤vl(K)v_l(\mathrm{expDepth}) \leq v_l(K) for each prime ll. With a bound on vl(K)v_l(K) this gives DepthK. The chain above it is depthK_of_sumOKK (50), then sum_size_finite_away_archimedean_combined (1,150), then fittedFunction_at_zero_close_alt (4,154).

So the gcd in the code is a gcd of periods of one product of local test functions. It is not a gcd across Hecke characters.

Where it is in the code

Sizes are dominator sizes: the number of declarations that only this node reaches on the way down from the top. All paths are relative to lean/src. DivisorProofs is Development/AbelianVarietyTheory/Proofs/DivisorProofs/.

Declaration Module (file) Size
GlobalTheory.Published.cmCurveGoodOutsidePrime DivisorProofs/CmCurveGoodOutsidePrime.lean 169
UpperTheory.LiteratureTheorems.cm_curve_good_outside_prime_st_of_literature .../ThirdPlaceSeries/EveryCharacterOfLiteratureOfVWin.lean 170
GlobalTheory.Mem.Top.Bl.KPxCond.baseCond_KPx .../IwasawaDecomposition/ExistsPrePin.lean 111
GlobalTheory.T.constantCoeff_pIterate_invariantDerivation_coord DivisorProofs/ConstantCoeffPIterateInvariantDerivationCoordStatement.lean 30
GlobalTheory.DualFrobNil.isNil_dual_frobenius DivisorProofs/IsNilDualFrobenius.lean 77
UpperTheory.Lit.prismaticDieudonneHodge .../PrismaticDieudonne/PrismaticDieudonneHodge.lean 1,708
GlobalTheory.T.cmLatticeDividedPowerJetIntegrality_of_ellipticCM DivisorProofs/CmLatticeDividedPowerJetIntegralityOfPublishedStatement.lean 156
GlobalTheory.ToricDenomRow.toricDenominator DivisorProofs/ToricDenominatorOfZetaDenominators.lean 32
GlobalTheory.JoinFun.joinOut_of_five DivisorProofs/JoinOutOfFive.lean 1,598
GlobalTheory.T.classMean_log_norm_disc_chowlaSelberg DivisorProofs/ClassMeanLogNormDiscChowlaSelbergStatement.lean 8
GlobalTheory.SqTop.betaArch_of_transport DivisorProofs/BetaConjugateMeanLogAbsBoundOfTransport.lean 70
GlobalTheory.T.flatProductDepthPeriodic_gcd DivisorProofs/FlatProductDepthPeriodicGcdStatement.lean 5
GlobalTheory.DepthUnf.depthK_of_hypotheses_alt .../LocalTypeDictionary/DepthOfSumBound.lean 49

JetInt, LatIntRam, LatIntUnr, BetaArch, Transport and DepthOK are definitions, with size 1. The small sizes of classMean_log_norm_disc_chowlaSelberg (8) and chowla_selberg_discriminant (6) mean that most of the Chowla-Selberg proof is shared with other parts of the tree, so it is counted higher up. The whole proof of riemannHypothesis has 757,483 declarations in the spine. The largest node on this page, prismaticDieudonneHodge, has 1,708.

The folder GroundTheory/HeightsAndTheta/Heights/ChowlaSelberg/ (namespace GroundTheory.Heights₂.Heights.ChowlaSelberg) has 58 files and 296 declarations in the index, for example a structure CMFamily and files on the class mean and the Kronecker limit. None of these declarations is in the spine, and no declaration outside the folder uses them. They are not part of the proof of the Riemann Hypothesis.

Notes

  • The code is not reviewed. The site does not claim that the proof is correct. The trust report says what has been checked.
  • Step 2 of the timeline, "Dp≡0D^p \equiv 0 on a CM curve for pp inert": the code has the formula for DpD^p on any formal group lift, and it has a CM curve, but no declaration joins them. The CM curve of the code has CM by ℚ(−p)\mathbb{Q}(\sqrt{-p}) itself, so pp is ramified there, and in the proof pp is the discriminant dd of the host field. No declaration on this page speaks of a prime inert in KK.
  • Step 2, "divisibility of Daθ(0)/ΩaD^a\theta(0)/\Omega^a": the code has no theta function on a CM curve here. The closest statement is JetInt, which is about partial derivatives of Eisenstein lattice sums for a CM field EE, divided by period powers. Its proof does not use the invariant derivation.
  • JetIntElliptic.jetInt takes four published-named inputs and uses only PartialZetaFunctionalEquation. The names SiegelKlingenDeligneRibet, HilbertClassFieldJ and EllipticMainTheoremCM in its type do not do any work there.
  • Step 9, "the norms of the lifts and the level": the norm in the code is the norm of one algebraic number β\beta built from a Hecke L-value, not of a lift. The page does not show how the level enters. "Terms of order mm cancel" has no counterpart on this page. "Weyl" has no counterpart on this page. The Siegel mass appears only as the input SiegelMassRatioCM of baseCond_KPx, next to the CM curve, and not in a divisibility argument.
  • Step 10, "a lower bound on the divisibility of the mm-fold lift": there is no mm-fold lift in these declarations. The closest counterpart is the lower bound vl(β)≥betaBound_vpv_l(\beta) \geq \texttt{betaBound\_vp} of LatIntRam and LatIntUnr. This page does not check that this bound is "sufficient" in the sense of the timeline.
  • Step 15, "glue an integral structure across the Hecke characters to get a gcd": the code has a gcd, but it is the Bezout gcd of two periods of one product of local test functions. There is no integral structure glued across Hecke characters on this page. That idea has no counterpart here.
  • None of the statements on this page has an entry in links/literature.yaml. The CM curve, the prismatic Dieudonné statement and the Chowla-Selberg formula are proved in the code, so they are not cut points.
  • This page does not unfold Transport, FieldDat, LBound, TorEx, ZetaDenominators or the constant betaBound_vp.

The source of this page. Markdown. Something is wrong? Report it.