From a sieve witness p + q with q a survivor to a genuine Goldbach partition
ProvedTaoFivePrimes.goldbach_sieve_witness_to_primesSuppose where is a prime with , , and is a survivor of sieving by the primes up to : every prime dividing equals itself. Then is a sum of two primes.
This is the bridge between the certificate language of Richstein2001.segmented_sieve_coverage (membership in GoldbachSieve.pairSums with survivor sets defined by a no-small-prime-divisor condition) and the conclusion needed by TaoFivePrimes.even_goldbach_verified. The survivor predicate is restated inline in self-contained form; the bound is the maximal smaller prime reported in Richstein's abstract. The proof is the square-root completeness argument: a composite would have a prime divisor with , contradicting the survivor condition, so itself is prime and is the required partition.
import Mathlib set_option autoImplicit false
namespace TaoFivePrimes
theorem goldbach_sieve_witness_to_primes (n p q : ℕ)
(hp : p.Prime) (hp5569 : p ≤ 5569) (hsum : p + q = n)
(hq2 : 2 ≤ q) (hqN : q ≤ 4 * 10 ^ 14)
(hsurv : ∀ r : ℕ, r.Prime → r ≤ 20000000 → r ∣ q → r = q) :
∃ p' q' : ℕ, p'.Prime ∧ q'.Prime ∧ p' + q' = n := by sorry
end TaoFivePrimes