Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform fixed-cutoff bound for residual promotion cost

Proved
Erdos390.WholePaper.residualPromotionCost_fixedCutoff_uniform_bound

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

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

There exists an absolute K>0K>0K>0 such that for every fixed natural q≥2q\ge2q≥2, all sufficiently large nnn satisfy

PromotionCost⁡(n,⌊n/q⌋)≤K1+log⁡qqnlog⁡n.\operatorname{PromotionCost}(n,\lfloor n/q\rfloor)\le K\frac{1+\log q}{q}\frac n{\log n}.PromotionCost(n,⌊n/q⌋)≤Kq1+logq​lognn​.

The constant KKK is independent of qqq, while the eventual threshold may depend on qqq. This allows the promotion cost to be made small by choosing a large fixed cutoff parameter.

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_006

Formal statement
theorem Erdos390.WholePaper.residualPromotionCost_fixedCutoff_uniform_bound :
∃ K,
  And (LT.lt.{0} (0 : Real) K)
    (∀ (q : Nat),
      LE.le.{0} (2 : Nat) q →
        ∀ᶠ (n : Nat) in Filter.atTop.{0},
          LE.le.{0} (↑(Erdos390.WholePaper.residualPromotionCost n (HDiv.hDiv.{0, 0, 0} n q)))
            (HMul.hMul.{0, 0, 0}
              (HDiv.hDiv.{0, 0, 0} (HMul.hMul.{0, 0, 0} K (HAdd.hAdd.{0, 0, 0} (1 : Real) (Real.log ↑q))) ↑q)
              (Erdos390.WholePaper.secondOrderScale n))) := by sorry
Source
https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/lean/Erdos390/WholePaper/CentralPromotionCostAsymptotic.lean#L230-L423

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