Theta increment at a doubled natural argument
ProvedLL_Decomp1528c.theta_two_mul_sub_lenumber-theory
For every natural number , , including .
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 , the real number is at most , where is the natural logarithm and over primes . The variable has type , and and are cast to before is applied, so the floor is exact. There are no other hypotheses. The subtraction is real, so no truncation occurs. At both terms equal and the claim reads . The statement is not vacuous. The inequality is non-strict.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.