Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Explicit raw valuation-prefix covariance bound

Proved
Erdos390.Full.PaperRawPrefixValuationRow.exists_uniform_rawCell_valuation_prefix_bound_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, 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​}. For a head pattern PPP, let SP(A,C;n)S_P(A,C;n)SP​(A,C;n) be the positive YnY_nYn​-smooth integers in (⌊An⌋,⌊Cn⌋](\lfloor An\rfloor,\lfloor Cn\rfloor](⌊An⌋,⌊Cn⌋] having exactly the valuations prescribed by PPP. Fix HHH, 0<A<C0<A<C0<A<C with C>0C>0C>0, and W>1W>1W>1 containing every head prime. There exist K,G>0K,G>0K,G>0 and N0N_0N0​ such that for n≥N0n\ge N_0n≥N0​, ⌊An⌋<k≤⌊Cn⌋\lfloor An\rfloor<k\le\lfloor Cn\rfloor⌊An⌋<k≤⌊Cn⌋, p∈Pn,Wp\in\mathcal P_{n,W}p∈Pn,W​, and any nonempty S=SH(A,C;n)S=S_H(A,C;n)S=SH​(A,C;n) with uniform law μ\muμ,

∣Cov⁡μ(vp,1m≤k)∣≤2KpLn+4G(sWLn)2p2Yn2.|\operatorname{Cov}_{\mu}(v_p,\mathbf1_{m\le k})|\le\frac{2K}{pL_n}+\frac{4G(s_W L_n)^2}{p^2Y_n^2}.∣Covμ​(vp​,1m≤k​)∣≤pLn​2K​+p2Yn2​4G(sW​Ln​)2​.

Here sWs_WsW​ is the source prime-power cutoff scale (cutoffScale).

The estimate exposes the beyond-four-prime-power tail separately from the principal reciprocal row bound.

Preamble
import Definitions.Def_erdos390_remaining_analytic_propositions_004
Formal statement
theorem Erdos390.Full.PaperRawPrefixValuationRow.exists_uniform_rawCell_valuation_prefix_bound_compact : Erdos390.RemainingAnalyticGoal004_006 := by sorry
Source
https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/lean/Erdos390/Full/PaperRawPrefixValuationRow.lean#L146-L370

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