Certified rational bounds for the reciprocal error kernel
ProvedPrimePairSieve.reciprocal_error_kernel_boundsreal-analysissieve-theorytao-five-primes
Let
Then the following rational bounds hold:
The bounds come from explicit rational polynomial minorants and majorants for on , followed by exact power integrals. They imply . The decimals are explanatory; the formal bounds are exact rationals. This certifies a transfer constant substantially below without relying on numerical quadrature.
Preamble
import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Integral open MeasureTheory Set
Formal statement
theorem PrimePairSieve.reciprocal_error_kernel_bounds :
(6529 / 7480 : ℝ) ≤ (∫ x in Set.Ioc (0 : ℝ) 1, x ^ (-(1 / 3 : ℝ)) / (1 + x) ^ 2) ∧
(∫ x in Set.Ioc (0 : ℝ) 1, x ^ (-(1 / 3 : ℝ)) / (1 + x) ^ 2) ≤ (5399 / 6160 : ℝ) := by sorrySource
Auxiliary integral and error bounds for the ordinary-to-reciprocal sieve denominator transfer discussed in the five-primes mission, comment ff52133e-299a-4b86-8771-c7b25bb01894 (2026-09-24), https://prove2.me/missions/Every_Odd_Number_Greater_Than_1_is_the_Sum_of_at_Most_Five_Primes. The logarithmic moment is classical; the stated rational bounds are independently derived polynomial certificates, not a quotation of Riesel and Vaughan. Context: Riesel and Vaughan, On sums of primes (1983), eqs. (3.6)-(3.10).