Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Odd arguments carry weight at most 2 log 2 times theta

Proved
LL_Decomp1526a.sum_rep_odd_le

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

number-theory

For all natural numbers a,ba,ba,b, the sum of r(N)r(N)r(N) over odd NNN with a<N≤ba<N\le ba<N≤b is at most 2log⁡2⋅θ(b)2\log 2\cdot\theta(b)2log2⋅θ(b), where θ\thetaθ is the first Chebyshev function.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1526a_rep

open Finset Real
open scoped Chebyshev Classical
Formal statement
namespace LL_Decomp1526a
theorem sum_rep_odd_le (a b : ℕ) :
    ∑ N ∈ (Ioc a b).filter (fun N => ¬ Even N), rep N ≤ 2 * Real.log 2 * θ (b : ℝ) := by sorry
end LL_Decomp1526a
Source
Elementary; Ramaré 1995, Section 2.3, p. 653.
Read-back

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

Read-back: LL_Decomp1526a.sum_rep_odd_le

For all natural numbers aaa and bbb, with no hypothesis relating them, the following inequality holds:

∑N∈Na<N≤bN oddrep⁡(N)  ≤  2log⁡2⋅θ(b).\sum_{\substack{N \in \mathbb{N} \\ a < N \le b \\ N \text{ odd}}} \operatorname{rep}(N) \;\le\; 2\log 2 \cdot \theta(b).N∈Na<N≤bN odd​∑​rep(N)≤2log2⋅θ(b).

The index set consists of the odd natural numbers NNN with a<N≤ba < N \le ba<N≤b. When a≥ba \ge ba≥b the index set is empty, the left side is the empty sum 000, and the claim reduces to 0≤2log⁡2⋅θ(b)0 \le 2\log 2 \cdot \theta(b)0≤2log2⋅θ(b).

The symbol rep⁡(N)\operatorname{rep}(N)rep(N) is not unfolded here. Its definition lives in an imported file that was outside the scope of this read-back, so it is not stated whether rep⁡(N)\operatorname{rep}(N)rep(N) is a real number or a natural number cast to R\mathbb{R}R, and whether it is nonnegative is not known from this statement.

The symbol θ\thetaθ is taken as the Chebyshev function of the standard Mathlib sense, θ(x)=∑p≤x, p primelog⁡p\theta(x) = \sum_{p \le x,\ p \text{ prime}} \log pθ(x)=∑p≤x, p prime​logp, evaluated at the real number bbb (the natural number bbb is cast to R\mathbb{R}R). The constant log⁡2\log 2log2 is the natural logarithm of 222.

Degenerate cases: for b≤1b \le 1b≤1 we have θ(b)=0\theta(b) = 0θ(b)=0, so the right side is 000. In particular, for a=0a = 0a=0 and b=1b = 1b=1 the index set is {1}\{1\}{1} and the statement says rep⁡(1)≤0\operatorname{rep}(1) \le 0rep(1)≤0. For b≥2b \ge 2b≥2 the right side is strictly positive, and the bound does not depend on aaa, so it is a bound on the odd part of the sum over (a,b](a, b](a,b] alone.

Both sides are real numbers, and the inequality is non-strict.

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