Disjoint mass tables bound reciprocal sieve endpoints
ProvedPrimePairSieve.reciprocal_mass_endpoint_soundLet be positive integers. Let a finite collection of buckets satisfy , pairwise strict separation of their integer intervals, and
where is the literal nonnegative squarefree prime-factor weight of the registered reciprocal threshold. Then
On each included interval, permits replacing its denominator by . Integer division rounds the resulting contribution down. Strict separation prevents double counting; omitted intervals and unselected weights are harmless by nonnegativity. Positivity of the scale, endpoint, and lower indices is explicit. There is no implicit assumption that the buckets cover all indices.
This theorem permits reuse of verified masses at many later endpoints, reducing the repeated computation needed for the original reciprocal threshold. It is an elementary finite-sum certificate theorem, not a new prime-distribution estimate. The submitted proof proves the general nonnegative-weight transfer internally and includes the literal weight's nonnegativity proof.
import Definitions.Def_PrimePairSieve_ReciprocalMass open scoped BigOperators open PrimePairSieve set_option autoImplicit false
theorem PrimePairSieve.reciprocal_mass_endpoint_sound (scale L : ℕ) (hs : 0 < scale) (hL : 0 < L)
(buckets : Finset ReciprocalMass.Bucket)
(hpositive : ∀ b ∈ buckets, 1 ≤ b.lower)
(hdisjoint : ∀ a ∈ buckets, ∀ b ∈ buckets, a ≠ b →
a.upper < b.lower ∨ b.upper < a.lower)
(hmass : ReciprocalMass.Valid scale buckets) :
(ReciprocalMass.endpointSum L buckets : ℝ) / scale ≤
∑ n ∈ Finset.Icc 1 L, ReciprocalBatch.weight n / (1 + (n : ℝ) / L) := by sorry