Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted count bounded by unweighted count

Proved
LL_Decomp1526a.rep_le_log_sq_mul_gcount

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

number-theory

For every natural number NNN, r(N)≤(log⁡N)2 g(N)r(N)\le(\log N)^2\,g(N)r(N)≤(logN)2g(N), where g(N)g(N)g(N) is the number of primes p≤Np\le Np≤N with N−pN-pN−p prime, cast to the reals.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1526a_rep
import Definitions.Def_LL_Decomp1526a_gcount

open Finset Real
open scoped Chebyshev Classical
Formal statement
namespace LL_Decomp1526a
theorem rep_le_log_sq_mul_gcount (N : ℕ) : rep N ≤ Real.log N ^ 2 * gcount N := by sorry
end LL_Decomp1526a
Source
Halberstam and Richert, Sieve Methods, Ch. 3, passage from weighted to unweighted counts.
Read-back

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

Read-back: LL_Decomp1526a.rep_le_log_sq_mul_gcount

Statement. For every natural number NNN, with no further hypotheses, the following holds:

rep(N)≤(log⁡N)2⋅gcount(N)\mathrm{rep}(N) \le (\log N)^2 \cdot \mathrm{gcount}(N)rep(N)≤(logN)2⋅gcount(N)

Symbols.

  • NNN ranges over all natural numbers, including 000 and 111.
  • log⁡N\log NlogN is the real natural logarithm of NNN, and (log⁡N)2(\log N)^2(logN)2 is its square.
  • rep(N)\mathrm{rep}(N)rep(N) and gcount(N)\mathrm{gcount}(N)gcount(N) are functions of NNN defined in the imported bundle files. Their definitions are not expanded here, so their values, signs and types are not stated. Both are compared with a real number, so both are taken to be real-valued.

Quantifiers and connectives. There is one universal quantifier, over NNN. The only connective is a single ≤\le≤. The statement asserts no existence and no uniqueness. It assumes nothing about rep\mathrm{rep}rep or gcount\mathrm{gcount}gcount, such as nonnegativity, monotonicity or finiteness.

Edge cases.

  • Under the real logarithm convention log⁡0=0\log 0 = 0log0=0 and log⁡1=0\log 1 = 0log1=0. At N=0N = 0N=0 and N=1N = 1N=1 the right-hand side is therefore 000, whatever gcount\mathrm{gcount}gcount is. The statement there reads rep(0)≤0\mathrm{rep}(0) \le 0rep(0)≤0 and rep(1)≤0\mathrm{rep}(1) \le 0rep(1)≤0.
  • For N≥2N \ge 2N≥2, log⁡N>0\log N > 0logN>0, and the bound reads rep(N)≤(log⁡N)2 gcount(N)\mathrm{rep}(N) \le (\log N)^2\,\mathrm{gcount}(N)rep(N)≤(logN)2gcount(N). If gcount(N)≤0\mathrm{gcount}(N) \le 0gcount(N)≤0 the bound forces rep(N)≤0\mathrm{rep}(N) \le 0rep(N)≤0.
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 30, 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