Disjoint interval mass certificates for reciprocal sieve sums
DefinitionPrimePairSieve_ReciprocalMassThis interface stores a finite collection of integer intervals and certified lower bounds for their squarefree sieve-weight masses. For the literal weight
a bucket records integers . At positive scale , validity means for every bucket. The interface also defines integer-rounded row masses, structural checks on row lists, and the endpoint integer sum
The definition does not assert validity or disjointness. Separate soundness theorems prove that checked factor data imply valid masses, and that positive, disjoint intervals imply is a lower bound for the original reciprocal sum. This separates one-time weight verification from repeated endpoint evaluation.
Source: the literal weight and reciprocal sum in the registered reciprocal threshold, and the row interface of the accepted batch checker. This is a computational certificate interface, not a new analytic estimate.
import Definitions.Def_PrimePairSieve_ReciprocalBatch
import Mathlib.Order.Interval.Finset.Nat
import Mathlib.Algebra.BigOperators.Group.List.Basic
open scoped BigOperators
set_option autoImplicit false
namespace PrimePairSieve.ReciprocalMass
structure Bucket where
lower : ℕ
upper : ℕ
mass : ℕ
deriving DecidableEq
def roundedMass (scale : ℕ) (rows : List ReciprocalBatch.Row) : ℕ :=
(rows.map (fun r => scale * r.a / r.b)).sum
def massCheck (scale : ℕ) (cert : Bucket × List ReciprocalBatch.Row) : Bool :=
decide ((cert.2.map ReciprocalBatch.Row.n).IsChain (· < ·)) &&
cert.2.all (fun r => decide (cert.1.lower ≤ r.n ∧ r.n ≤ cert.1.upper)) &&
decide (roundedMass scale cert.2 = cert.1.mass)
noncomputable def Valid (scale : ℕ) (buckets : Finset Bucket) : Prop :=
∀ b ∈ buckets, (b.mass : ℝ) / scale ≤
∑ n ∈ Finset.Icc b.lower b.upper, ReciprocalBatch.weight n
def endpointSum (L : ℕ) (buckets : Finset Bucket) : ℕ :=
∑ b ∈ buckets.filter (fun b => b.upper ≤ L), b.mass * L / (L + b.upper)
end PrimePairSieve.ReciprocalMass