Soundness of squarefree sieve-weight mass tables
ProvedPrimePairSieve.reciprocal_mass_certificate_soundLet be a positive integer. Each finite certificate consists of a bucket and a strictly increasing list of positive indices , each accompanied by distinct prime factors and exact integers representing its literal squarefree sieve weight . Assume every row passes the published factor-and-weight checker, every index lies in its bucket, and the claimed mass satisfies
Then each bucket has the certified mass lower bound
Integer division rounds each selected weight downward, strict ordering excludes duplicates, and omitted weights are nonnegative. No completeness of the selected rows is assumed. Buckets may overlap in this theorem: a subsequent aggregation theorem requires disjointness before adding their bounds.
This packages the previously checked single-bucket mass argument into a reusable table certificate. The proof includes its factorization and rounding lemmas and imports only Mathlib and published definitions. It uses no unproved theorem mirror. The mathematical source is the finite-subset lower-bound argument of the accepted batch checker, applied to the weight in the original reciprocal threshold.
import Definitions.Def_PrimePairSieve_ReciprocalMass open scoped BigOperators open PrimePairSieve set_option autoImplicit false
theorem PrimePairSieve.reciprocal_mass_certificate_sound (scale : ℕ) (hs : 0 < scale)
(certs : List (ReciprocalMass.Bucket × List ReciprocalBatch.Row))
(hrows : (certs.flatMap Prod.snd).all ReciprocalBatch.rowCheck = true)
(hchecks : certs.all (ReciprocalMass.massCheck scale) = true) :
ReciprocalMass.Valid scale (certs.map Prod.fst).toFinset := by sorry