Trivial bound for the prime sum
ProvedLL_Decomp1535a.norm_S_lenumber-theory
For every natural number and real , .
Preamble
import Mathlib import Definitions.Def_LL_Decomp1535a_S import Definitions.Def_LL_Decomp1535a_theta open MeasureTheory
Formal statement
namespace LL_Decomp1535a theorem norm_S_le (N : ℕ) (α : ℝ) : ‖S N α‖ ≤ theta N := by sorry end LL_Decomp1535a
Source
Liu and Wang 2002, p. 168, below eq. 6.2
Read-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: LL_Decomp1535a.norm_S_le
Statement. For every natural number and every real number , the norm of is at most :
Symbols and binders.
- ranges over all natural numbers . The case is included.
- ranges over all real numbers.
- is the quantity evaluated at . Its definition lives in the bundle file Def_LL_Decomp1535a_S and is not expanded here, so its exact form and the type it takes values in are not stated by this read-back.
- is the norm on the codomain of .
- is the quantity evaluated at . Its definition lives in Def_LL_Decomp1535a_theta and is not expanded here.
Points the statement makes explicit.
- There are no hypotheses. The claim holds unconditionally for all .
- The inequality is non-strict ().
- The bound is uniform in . The right-hand side depends only on .
- Since a norm is nonnegative and is defined for every , the statement forces for every .
- The declaration body is
sorry, so the statement is currently unproved.
Fault check. No fault in the statement as written. The read-back is incomplete for and because their definitions were not read, per the brief.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.