Soundness of batched reciprocal sieve certificates
ProvedPrimePairSieve.reciprocal_batch_certificate_soundFor a positive natural scale and endpoint , let a finite list of rows record integers and finite prime-factor sets. Assume the recorded indices are strictly increasing. In every row require that the factors are prime, their product is , and
The checker also requires . Writing for the literal squarefree sieve weight, these premises imply
The factor set contains distinct primes, so its product is squarefree and has exactly those prime factors. Thus the checked fraction equals . Integer division rounds each scaled contribution downward. Strictly increasing indices exclude double counting, and the endpoint filter places all selected indices in . Finally, omitted terms are nonnegative, so adding them preserves the lower bound.
This theorem validates arbitrary finite row lists. Finding such lists and their numerical values remains an untrusted computation; concrete uses must prove that the checker returns true. The proof introduces no execution axiom and has no open mathematical inputs.
import Definitions.Def_PrimePairSieve_ReciprocalBatch import Mathlib.Algebra.BigOperators.Field import Mathlib.Algebra.Order.BigOperators.Group.Finset open scoped BigOperators set_option autoImplicit false
theorem PrimePairSieve.reciprocal_batch_certificate_sound (scale L : ℕ) (hs : 0 < scale) (hL : 0 < L)
(rows : List PrimePairSieve.ReciprocalBatch.Row)
(hchain : (rows.map PrimePairSieve.ReciprocalBatch.Row.n).IsChain (· < ·))
(hrows : rows.all PrimePairSieve.ReciprocalBatch.rowCheck = true) :
(PrimePairSieve.ReciprocalBatch.roundedSum scale L rows : ℝ)/scale ≤
∑ n ∈ Finset.Icc 1 L,
(if Squarefree n then ∏ p ∈ n.primeFactors, if p = 2 then (1:ℝ) else 2/((p:ℝ)-2) else 0)/(1+(n:ℝ)/L) := by sorry