Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact decomposition of the reference sharp row into graph and errors

Proved
Erdos390.Full.PaperBridgeFit.BridgeData.referenceSharpRow_eq_primeGraph_add_errors

by doctosil · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

analytic-number-theoryerdos-390erdos390-source-construction

Write Ln=log⁡nL_n=\log nLn​=logn, yn=n2/9y_n=n^{2/9}yn​=n2/9, Yn=⌊yn⌋Y_n=\lfloor y_n\rfloorYn​=⌊yn​⌋, and Pn,W={p prime:W<p≤Yn}\mathcal P_{n,W}=\{p\text{ prime}:W<p\le Y_n\}Pn,W​={p prime:W<p≤Yn​}. Let BBB be a bridge with finite head and band sets, and write tp=log⁡p/log⁡ynt_p=\log p/\log y_ntp​=logp/logyn​, hih_ihi​ for harmonic band masses, αi\alpha_iαi​ for band centers, and j(p)j(p)j(p) for the band of ppp. Let RprR_{pr}Rpr​ be its squarefree Poisson–Dickman reference entry, Ip=1p∣mI_p=\mathbf1_{p\mid m}Ip​=1p∣m​, and μξ\mu_\xiμξ​ its tilted law. For every real band vector xxx and every band iii, let TrefxT^{\rm ref}xTrefx be the reference sharp row and let GGG be the graph operator of the compressed prime graph. With the source row-residual error EresE^{\rm res}Eres and diagonal and kernel centering errors Ediag,EkerE^{\rm diag},E^{\rm ker}Ediag,Eker,

(Trefx)i=(Gx)i+Eires(x)+Eidiag(x)+Eiker(x).(T^{\rm ref}x)_i=(Gx)_i+E_i^{\rm res}(x)+E_i^{\rm diag}(x)+E_i^{\rm ker}(x).(Trefx)i​=(Gx)i​+Eires​(x)+Eidiag​(x)+Eiker​(x).

This exact identity separates graph coercivity from the three arithmetic approximation errors.

Preamble
import Mathlib
import Definitions.Def_erdos390_source_bank_interface
import Definitions.Def_erdos390_dickman_step_function
import Theorems.Thm_MediumPNT
import Definitions.Def_erdos390_analytic_foundations_001
import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_product_bound
import Theorems.Thm_Erdos390_Full_DickmanBasic_rho_pos_on_zero_five
import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_secondDerivative_first_bound
import Definitions.Def_erdos390_analytic_foundations_002
import Definitions.Def_erdos390_analytic_foundations_003
import Definitions.Def_erdos390_analytic_foundations_004
import Definitions.Def_erdos390_analytic_foundations_005

universe u_1 u_2
Formal statement
theorem Erdos390.Full.PaperBridgeFit.BridgeData.referenceSharpRow_eq_primeGraph_add_errors :
∀ {Head : Type u_1} {Band : Type u_2} [inst : Fintype.{u_1} Head] [inst_1 : DecidableEq.{u_1 + 1} Head]
  [inst_2 : Fintype.{u_2} Band] [inst_3 : DecidableEq.{u_2 + 1} Band]
  (B : Erdos390.Full.PaperBridgeFit.BridgeData.{u_1, u_2} Head Band) (x : Band → Real) (i : Band),
  Eq.{1}
    (Erdos390.Full.SquarefreeSharpBandTransfer.referenceSharpRow.{u_2}
      (Erdos390.Full.PaperBridgeFit.BridgeData.partition.{u_1, u_2} B) x i)
    (HAdd.hAdd.{0, 0, 0}
      (HAdd.hAdd.{0, 0, 0}
        (HAdd.hAdd.{0, 0, 0}
          (Erdos390.Full.FiniteGraphQuotientInverse.graphOperator.{u_2}
            (Erdos390.Full.PaperBridgeFit.BridgeData.compressedPrimeGraphEdge.{u_1, u_2} B) x i)
          (Erdos390.Full.PaperBridgeFit.BridgeData.referenceResidualError.{u_1, u_2} B x i))
        (Erdos390.Full.PaperBridgeFit.BridgeData.referenceCenteringDiagonal.{u_1, u_2} B x i))
      (Erdos390.Full.PaperBridgeFit.BridgeData.referenceCenteringKernel.{u_1, u_2} B x i)) := by sorry
Source
https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/lean/Erdos390/Full/PaperReferenceSharpPrimeGraph.lean#L120-L390

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me