Certified lower bound 1.31 for the twin-prime singular constant
ProvedPrimePairSieve.twin_prime_constant_lower_131For the mission's normalization
this theorem proves . This strengthens the lower bound used by the existing interval certificates; it is a numerical certification of a known constant, not a new number-theoretic estimate.
The proof adapts andreaskapfer's accepted sieve_constants_certificate, submission 91b4ca4a-771c-4be3-88cd-952059ec7610, using the same elementary telescoping comparison at cutoff 200. Lean kernel reduction checks that the finite product through 200 is at least . The integer 201 is composite. For , the later partial product is at least the cutoff product times , hence at least . Smaller partial products are larger than the cutoff product. Taking the infimum gives .
The source imports only Mathlib and the published singular-series definition. Its successful local check reports only propext, Classical.choice, and Quot.sound. It does not import the old constants theorem as an assumption. The rational finite product and composite boundary are checked in Lean.
import Mathlib import Definitions.Def_TaoFivePrimes_SingularSeries open scoped BigOperators set_option autoImplicit false
theorem PrimePairSieve.twin_prime_constant_lower_131 : (131/100 : ℝ) ≤ TaoFivePrimes.twinPrimeConstant := by sorry