Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Canonical guard deletion preserves the sharp full-valuation profile

Proved
Erdos390.WholePaper.BankPaperRealization.exists_uniform_guardedRawCell_valuation_mean_profiles_paperRate_compact

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, sn=n/log⁡ns_n=n/\log nsn​=n/logn, yn=⌊n2/9⌋y_n=\lfloor n^{2/9}\rflooryn​=⌊n2/9⌋, 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​}. For a prime p∈Pn,Wp\in\mathcal P_{n,W}p∈Pn,W​ put kp=⌊log⁡p(yn4)⌋k_p=\lfloor\log_p(y_n^4)\rfloorkp​=⌊logp​(yn4​)⌋ and Vn(p)=∑j=1kpMn(pj)V_n(p)=\sum_{j=1}^{k_p}M_n(p^j)Vn​(p)=∑j=1kp​​Mn​(pj), where Mn(D)M_n(D)Mn​(D) is the paper Dickman divisibility main term. Fix a nonempty finite family of head patterns, physical intervals, a guard ledger with fixed promotion and bank parameters, and W>1W>1W>1 containing all head primes. There are Cv>0C_v>0Cv​>0 and N0N_0N0​ such that for every n≥N0n\ge N_0n≥N0​, every band prime ppp, every head/physical cell ccc, and every witness that its raw cell minus the guards is nonempty,

∣EUnif(rawCellc∖Gn)vp(m)−Vn(p)∣≤CvpLn.\left|\mathbb E_{\mathrm{Unif}(\mathrm{rawCell}_c\setminus G_n)}v_p(m)-V_n(p)\right|\le\frac{C_v}{pL_n}.​EUnif(rawCellc​∖Gn​)​vp​(m)−Vn​(p)​≤pLn​Cv​​.

The statement is uniform over the finite cell family and controls the full valuation, not only prime-divisibility indicators.

Preamble
import Definitions.Def_erdos390_remaining_analytic_propositions_007

universe u_1
Formal statement
theorem Erdos390.WholePaper.BankPaperRealization.exists_uniform_guardedRawCell_valuation_mean_profiles_paperRate_compact : Erdos390.RemainingAnalyticGoal007_005.{u_1} := by sorry
Source
https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/lean/Erdos390/WholePaper/BankPaperCanonicalSmoothSourceGuardedSharpValuationRateClosure.lean#L574-L803

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