Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theta increment at a doubled natural argument

Proved
LL_Decomp1528c.theta_two_mul_sub_le

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

number-theory

For every natural number nnn, θ(2n)−θ(n)≤nlog⁡4\theta(2n)-\theta(n)\le n\log4θ(2n)−θ(n)≤nlog4, including n=0n=0n=0.

Preamble
import Mathlib

open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528c
theorem theta_two_mul_sub_le (n : ℕ) : θ (2 * n) - θ n ≤ n * log 4 := by sorry
end LL_Decomp1528c
Source
Lab unit U-1528, classical Chebyshev bounds; source context: P. J. Campbell 2026, https://arxiv.org/abs/2608.09488v1. Chebyshev 1852; Hardy and Wright, Theorem 415 proof, as cited in the lab.
Read-back

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

For every natural number nnn, the real number θ(2n)−θ(n)\theta(2n) - \theta(n)θ(2n)−θ(n) is at most nlog⁡4n \log 4nlog4, where log⁡\loglog is the natural logarithm and θ(x)=∑p≤⌊x⌋log⁡p\theta(x) = \sum_{p \le \lfloor x \rfloor} \log pθ(x)=∑p≤⌊x⌋​logp over primes ppp. The variable nnn has type N\mathbb{N}N, and 2n2n2n and nnn are cast to R\mathbb{R}R before θ\thetaθ is applied, so the floor is exact. There are no other hypotheses. The subtraction is real, so no truncation occurs. At n=0n = 0n=0 both terms equal θ(0)=0\theta(0) = 0θ(0)=0 and the claim reads 0≤00 \le 00≤0. The statement is not vacuous. The inequality is non-strict.

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