Soundness of consecutive even Goldbach certificates
ProvedGoldbachCertificate.block_soundLet be a finite prime dictionary, natural numbers, and an ordered list of prime-pair candidates. If the dictionary primality check succeeds and every row check succeeds, then every even natural number
has a representation with both and prime and .
The proof establishes the primality test by the square-root divisor criterion, proves soundness of dictionary lookup by structural induction, and then proves coverage of the entire even interval by induction on the row list. The half-open endpoint depends on the exact list length: a missing row cannot certify an extra case. Equal primes are allowed, including .
This is a reusable computational-certificate soundness theorem. It assumes successful checks, not Goldbach or any prime-distribution estimate. All proof dependencies are standard Lean foundations. It is not a claim of a new result about the infinite Goldbach problem.
import Definitions.Def_GoldbachCertificate import Mathlib.Algebra.Ring.Parity set_option autoImplicit false
theorem GoldbachCertificate.block_sound (first smallBound : ℕ) (tree : GoldbachCertificate.PrimeTree)
(rows : List (ℕ × ℕ)) (ht : tree.check = true)
(hr : GoldbachCertificate.checkRows first smallBound tree rows = true)
(n : ℕ) (hlo : 2 * first ≤ n) (hhi : n < 2 * (first + rows.length))
(he : Even n) :
∃ p q : ℕ, p.Prime ∧ q.Prime ∧ p ≤ smallBound ∧ n = p + q := by sorry