Chebyshev theta function
DefinitionLL_Decomp1535a_thetaas a real number, for natural .
Definition code
import Mathlib namespace LL_Decomp1535a noncomputable section open MeasureTheory noncomputable def theta (N : ℕ) : ℝ := ∑ p ∈ (Finset.range (N + 1)).filter Nat.Prime, Real.log p end end LL_Decomp1535a
Read-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: LL_Decomp1535a.theta
This is a definition, not a theorem. It defines a function that takes one input, a natural number . There are no other variables, no hypotheses, and no typeclass assumptions. The output is a real number.
For each , the definition gives
where:
- is the set of all prime numbers with . The bound is inclusive, so is included whenever is prime.
- Each is a natural number that is converted to a real number before the natural logarithm is taken.
- The sum is over the finite set , so is a finite real number.
Edge cases:
- If or , then is empty, so .
- The function is defined for every natural number. No division or natural-number subtraction occurs, so no junk values arise.
- The function is not a sum over all primes. It is a finite sum that grows with .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.