Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit squarefree count on a dyadic block

Open
LL_Decomp1543a.squarefree_dyadic

by sthubbar · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For every natural NNN and real M≥exp⁡(13.066)M\ge\exp(13.066)M≥exp(13.066), ∑t∈T(N,M)∣μ(t)∣≤0.6111M\sum_{t\in T(N,M)}|\mu(t)|\le0.6111M∑t∈T(N,M)​∣μ(t)∣≤0.6111M. Thus the count is restricted to 1≤t≤N1\le t\le N1≤t≤N as well as M<t≤2MM<t\le2MM<t≤2M.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543a_tBlock

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543a
theorem squarefree_dyadic (N : ℕ) (M : ℝ) (hM : exp 13.066 ≤ M) :
    ∑ t ∈ tBlock N M, |(moebius t : ℝ)| ≤ 0.6111 * M := by sorry
end LL_Decomp1543a
Source
M. C. Liu and T. Z. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105, 2002, p. 173, equation 6.20. https://doi.org/10.4064/aa105-2-3
Read-back

What the Lean code literally says, in plain math · claude-haiku

For every natural number NNN (zero allowed) and every real number MMM with M≥e13.066M \ge e^{13.066}M≥e13.066, where e13.066≈4.7×105e^{13.066} \approx 4.7 \times 10^5e13.066≈4.7×105, the declaration asserts

∑t∈tBlock(N,M)∣μ(t)∣≤0.6111 M.\sum_{t \in \mathrm{tBlock}(N,M)} |\mu(t)| \le 0.6111\,M.t∈tBlock(N,M)∑​∣μ(t)∣≤0.6111M.

Here tBlock(N,M)\mathrm{tBlock}(N,M)tBlock(N,M) is a finite set, defined in another item and not shown, whose members ttt are taken to be natural numbers, since μ\muμ is the Möbius function on the naturals with integer values, and ∣μ(t)∣|\mu(t)|∣μ(t)∣ is read in R\mathbb{R}R. The constant 0.61110.61110.6111 equals 6111/100006111/100006111/10000. Because ∣μ(t)∣∈{0,1}|\mu(t)| \in \{0,1\}∣μ(t)∣∈{0,1}, the left side counts the squarefree members of tBlock(N,M)\mathrm{tBlock}(N,M)tBlock(N,M). The value μ(0)\mu(0)μ(0) is 000 by convention, so t=0t=0t=0 contributes nothing. If tBlock(N,M)\mathrm{tBlock}(N,M)tBlock(N,M) is empty for some NNN and MMM, the bound holds trivially. The hypothesis is satisfiable, so it is not vacuous. The proof is left as sorry, so the statement is unproven.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me