Weighted count bounded by unweighted count
ProvedLL_Decomp1526a.rep_le_log_sq_mul_gcountnumber-theory
For every natural number , , where is the number of primes with prime, cast to the reals.
Preamble
import Mathlib import Definitions.Def_LL_Decomp1526a_rep import Definitions.Def_LL_Decomp1526a_gcount open Finset Real open scoped Chebyshev Classical
Formal statement
namespace LL_Decomp1526a theorem rep_le_log_sq_mul_gcount (N : ℕ) : rep N ≤ Real.log N ^ 2 * gcount N := by sorry end LL_Decomp1526a
Source
Halberstam and Richert, Sieve Methods, Ch. 3, passage from weighted to unweighted counts.
Read-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: LL_Decomp1526a.rep_le_log_sq_mul_gcount
Statement. For every natural number , with no further hypotheses, the following holds:
Symbols.
- ranges over all natural numbers, including and .
- is the real natural logarithm of , and is its square.
- and are functions of defined in the imported bundle files. Their definitions are not expanded here, so their values, signs and types are not stated. Both are compared with a real number, so both are taken to be real-valued.
Quantifiers and connectives. There is one universal quantifier, over . The only connective is a single . The statement asserts no existence and no uniqueness. It assumes nothing about or , such as nonnegativity, monotonicity or finiteness.
Edge cases.
- Under the real logarithm convention and . At and the right-hand side is therefore , whatever is. The statement there reads and .
- For , , and the bound reads . If the bound forces .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.