Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform fixed-head divisor shift for friable counts

Proved
Erdos390.WholePaper.exists_uniform_roughFixedHead_friableCount_shift_bound_compact

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

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

Fix a natural head cutoff WWW, and let PWP_WPW​ be its rough-head modulus. There exist K>0K>0K>0 and Y0∈NY_0\in\mathbb NY0​∈N such that for all natural X,y,dX,y,dX,y,d with y≥Y0y\ge Y_0y≥Y0​, d∣PWd\mid P_Wd∣PW​, d≤Xd\le Xd≤X and log⁡X≤5log⁡y\log X\le5\log ylogX≤5logy,

∣Ψ(⌊X/d⌋,y)−Ψ(X,y)d∣≤KXdlog⁡y+3.\left|\Psi(\lfloor X/d\rfloor,y)-\frac{\Psi(X,y)}d\right|\le\frac{KX}{d\log y}+3.​Ψ(⌊X/d⌋,y)−dΨ(X,y)​​≤dlogyKX​+3.

Here ddd ranges over the positive divisors of PWP_WPW​ and Ψ\PsiΨ counts friable integers. The constants are uniform across the fixed finite divisor family.

Preamble
import Definitions.Def_erdos390_remaining_analytic_propositions_008
Formal statement
theorem Erdos390.WholePaper.exists_uniform_roughFixedHead_friableCount_shift_bound_compact : Erdos390.RemainingAnalyticGoal008_013 := by sorry
Source
https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/lean/Erdos390/WholePaper/RoughFixedHeadFriableShift.lean#L243-L366

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me