Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Two-prime restoration numerator bound

Proved
Erdos390.Full.TwoLocalRestorationBound.abs_pairRestoredNumerator_sub_expect_le

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

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

Let ν\nuν be a finite probability law and vvv a natural-valued variable. Fix natural p,q,Ap,Aq,r,sp,q,A_p,A_q,r,sp,q,Ap​,Aq​,r,s and real ηp,ηq,L,G\eta_p,\eta_q,L,Gηp​,ηq​,L,G. Suppose Eν1puqb∣v(ω)≤G/(puqb)\mathbb E_\nu\mathbf1_{p^uq^b\mid v(\omega)}\le G/(p^uq^b)Eν​1puqb∣v(ω)​≤G/(puqb) for every pair of natural exponents u,bu,bu,b. Write Tp(r)T_p(r)Tp​(r) and Tq(s)T_q(s)Tq​(s) for the corresponding coefficient tails, and Nr,sN_{r,s}Nr,s​ for the two-local restored numerator.

∣Nr,s−Eν1prqs∣v(ω)∣≤GTp(r)q−s+Gp−rTq(s)+GTp(r)Tq(s).|N_{r,s}-\mathbb E_\nu\mathbf1_{p^rq^s\mid v(\omega)}|\le G T_p(r)q^{-s}+Gp^{-r}T_q(s)+GT_p(r)T_q(s).∣Nr,s​−Eν​1prqs∣v(ω)​∣≤GTp​(r)q−s+Gp−rTq​(s)+GTp​(r)Tq​(s).

This is the exact finite restoration estimate used before controlling a quotient by its normalizer.

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_004

universe u_1
Formal statement
theorem Erdos390.Full.TwoLocalRestorationBound.abs_pairRestoredNumerator_sub_expect_le :
∀ {Omega : Type u_1} [inst : Fintype.{u_1} Omega] (nu : Erdos390.Full.FiniteProbability.{u_1} Omega)
  (value : Omega → Nat) {p q Ap Aq r s : Nat} {etaP etaQ L G : Real},
  (∀ (u v : Nat),
      LE.le.{0}
        (Erdos390.Full.FiniteProbability.expect.{u_1} nu fun omega =>
          Erdos390.Full.ArithmeticModel.divInd (Erdos390.Full.OmittedTiltPairChamber.pairPower p q u v) (value omega))
        (HDiv.hDiv.{0, 0, 0} G (HMul.hMul.{0, 0, 0} (HPow.hPow.{0, 0, 0} (↑p) u) (HPow.hPow.{0, 0, 0} (↑q) v)))) →
    LE.le.{0}
      (abs.{0}
        (HSub.hSub.{0, 0, 0}
          (Erdos390.Full.TwoLocalRestorationBound.pairRestoredNumerator.{u_1} nu value p q Ap Aq etaP etaQ L r s)
          (Erdos390.Full.FiniteProbability.expect.{u_1} nu fun omega =>
            Erdos390.Full.ArithmeticModel.divInd (Erdos390.Full.OmittedTiltPairChamber.pairPower p q r s)
              (value omega))))
      (Erdos390.Full.TwoLocalRestorationBound.pairRestorationError p q Ap Aq r s etaP etaQ L G) := by sorry
Source
https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/lean/Erdos390/Full/TwoLocalRestorationBound.lean#L109-L260

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