Chebyshev bound for theta
ProvedLL_Decomp1535a.theta_lenumber-theory
For every natural number , .
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 (including ), the following holds:
Symbols and context:
- is a natural number, universally quantified. The statement has no other binders.
- is the function evaluated at . 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 ; the comparison is made as real numbers because the right-hand side is real. - is the natural logarithm of .
- on the right-hand side is the natural number viewed as a real number.
Hypotheses: none. There are no assumptions on beyond , and no typeclass or side conditions.
Logical strength: the relation is a non-strict inequality (). The statement asserts only an upper bound on , linear in with constant . It asserts no lower bound and no asymptotic claim.
Edge cases: at the claim reduces to . Whether this holds depends entirely on the unexpanded definition of .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.