A replayed Goldbach certificate for every even number from 4 through 16384
ProvedGoldbachCertificate.even_4_16384Every even natural number with has a representation by two primes, with .
The proof replays a literal certificate containing 8,191 consecutive pairs and a shared dictionary of 1,900 prime values. It checks primality, dictionary membership, every exact sum and the left-prime bound. Coverage follows from the proved certificate checker and the exact row count; it is not sampling. The submitted proof contains its own soundness argument, so it does not assume an Open checker theorem.
This is a reproducibility and performance pilot for formal finite Goldbach verification. The numerical range is long known and is far smaller than the finite input used in Tao's five-primes argument. This certificate does not discharge that full input or establish strong Goldbach. Larger scale requires independently verified complete coverage and a credible measured checking cost.
import Definitions.Def_GoldbachCertificate import Mathlib.Algebra.Ring.Parity set_option autoImplicit false
theorem GoldbachCertificate.even_4_16384 (n : ℕ) (hlo : 4 ≤ n) (hhi : n ≤ 16384)
(he : Even n) :
∃ p q : ℕ, p.Prime ∧ q.Prime ∧ p ≤ 5569 ∧ n = p + q := by sorry