Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chebyshev bound for theta

Proved
LL_Decomp1535a.theta_le

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

number-theory

For every natural number NNN, θ(N)≤log⁡4⋅N\theta(N)\le \log 4\cdot Nθ(N)≤log4⋅N.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1535a_theta

open MeasureTheory
Formal statement
namespace LL_Decomp1535a
theorem theta_le (N : ℕ) : theta N ≤ Real.log 4 * N := by sorry
end LL_Decomp1535a
Source
Liu and Wang 2002, p. 174, a weaker form
Read-back

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

Declaration: LL_Decomp1535a.theta_le

For every natural number NNN (including N=0N = 0N=0), the following holds:

θ(N)≤log⁡4⋅N\theta(N) \le \log 4 \cdot Nθ(N)≤log4⋅N

Symbols and context:

  • NNN is a natural number, universally quantified. The statement has no other binders.
  • θ(N)\theta(N)θ(N) is the function θ\thetaθ evaluated at NNN. Its definition lives in the imported module Definitions.Def_LL_Decomp1535a_theta. That module was not part of the material supplied for this read-back, so its meaning is not expanded here. The statement itself does not state the type of θ(N)\theta(N)θ(N); the comparison is made as real numbers because the right-hand side is real.
  • log⁡4\log 4log4 is the natural logarithm of 444.
  • NNN on the right-hand side is the natural number NNN viewed as a real number.

Hypotheses: none. There are no assumptions on NNN beyond N∈NN \in \mathbb{N}N∈N, and no typeclass or side conditions.

Logical strength: the relation is a non-strict inequality (≤\le≤). The statement asserts only an upper bound on θ(N)\theta(N)θ(N), linear in NNN with constant log⁡4\log 4log4. It asserts no lower bound and no asymptotic claim.

Edge cases: at N=0N = 0N=0 the claim reduces to θ(0)≤0\theta(0) \le 0θ(0)≤0. Whether this holds depends entirely on the unexpanded definition of θ\thetaθ.

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