Checked Goldbach certificates produce sieve witnesses on the whole block
ProvedGoldbachCertificate.sieve_witnesses_soundA successfully checked consecutive-even Goldbach certificate can be used directly in the existing sieve-survivor interface. Let its first even integer be , its row count be , and its left-prime bound be . For an even with , an external sieve interval with and , and any cutoff , the certificate supplies a small prime and a survivor in that interval with .
The certificate soundness proof first supplies actual primes. A prime is a survivor for every sieve cutoff: a prime divisor of must equal , so the forbidden-small-divisor filter is empty. The sum and left-prime bound give the required lower interval bound, and gives the upper bound. No dense survivor set is evaluated.
This bridge targets the existing GoldbachSieve witness format used by the Richstein finite-verification route. It proves an implication from checked certificates; it supplies no certificate for the full range and assumes no prime-distribution estimate. Its local axiom closure contains only standard Lean foundations.
import Definitions.Def_GoldbachCertificate import Definitions.Def_GoldbachSieve import Mathlib.Algebra.Ring.Parity set_option autoImplicit false
theorem GoldbachCertificate.sieve_witnesses_sound (first smallBound lo hi cutoff : ℕ) (tree : GoldbachCertificate.PrimeTree)
(rows : List (ℕ × ℕ)) (ht : tree.check = true)
(hr : GoldbachCertificate.checkRows first smallBound tree rows = true)
(hcover : lo ≤ 2 * first - smallBound)
(n : ℕ) (hlo : 2 * first ≤ n) (hhi : n < 2 * (first + rows.length))
(hnhi : n ≤ hi) (he : Even n) :
∃ p ∈ ((Finset.Icc 2 smallBound).filter Nat.Prime),
∃ q ∈ GoldbachSieve.survivors lo hi cutoff, n = p + q := by sorry