Reciprocal sieve error transfer with a certified rational constant
ProvedPrimePairSieve.reciprocal_error_transfer_boundreal-analysissieve-theorytao-five-primes
Let , , and let be Lebesgue integrable on with
Then
This is the uniform error-transfer estimate for the reciprocal sieve kernel. The coefficient is . It follows from a proved kernel bound and change of variables, and does not assert the sharp reciprocal denominator expansion or its error constant.
Preamble
import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Integral open MeasureTheory Set
Formal statement
theorem PrimePairSieve.reciprocal_error_transfer_bound (f : ℝ → ℝ) (z E : ℝ) (hz : 0 < z) (hE : 0 ≤ E)
(hfint : IntegrableOn f (Set.Ioc 0 z))
(hf : ∀ t ∈ Set.Ioc 0 z, |f t| ≤ E * t ^ (-(1 / 3 : ℝ))) :
|f z / 2 + ∫ t in Set.Ioc 0 z, z / (z + t) ^ 2 * f t| ≤
(8479 / 6160 : ℝ) * E * z ^ (-(1 / 3 : ℝ)) := 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).