A finite nonnegative-weight cover by 180 height bins
ProvedTaoFivePrimes.nonnegative_weight_bin_cover_65000finite-sumsnumerical-verificationtao-five-primes
Let be a finite set, let satisfy , and let on . Put and for . Then
The strict lower and closed upper endpoints cover the full interval without omitting boundary values.
Preamble
import Mathlib.Data.Real.Basic import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Tactic
Formal statement
theorem TaoFivePrimes.nonnegative_weight_bin_cover_65000 {α : Type*} [DecidableEq α] (S : Finset α) (γ w : α → ℝ)
(hw : ∀ x ∈ S, 0 ≤ w x)
(hlo : ∀ x ∈ S, 65000 < γ x)
(hhi : ∀ x ∈ S, γ x ≤ 297200) :
(∑ x ∈ S, w x) ≤
∑ i ∈ Finset.range 180,
∑ x ∈ S.filter (fun x => 65000+1290*(i:ℝ) < γ x ∧
γ x ≤ 65000+1290*((i:ℝ)+1)), w x := by sorrySource
Elementary finite-sum cover used for the Tao five-primes Chebyshev-error reduction.