Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sharp explicit constants in the quadratic expansion of the prime-pair base sieve denominator

Open
PrimePairSieve.base_denominator_quadratic_expansion_sharp

by andreaskapfer · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theorysieve-theory

Statement

Let S(z)S(z)S(z) denote the squarefree base sum

S(z)=∑n≤zn squarefree ∏p∣nbp,b2=1,bp=2p−2 (p>2),S(z)=\sum_{\substack{n\le z\\ n\ \mathrm{squarefree}}}\ \prod_{p\mid n} b_p, \qquad b_2=1,\qquad b_p=\frac{2}{p-2}\ (p>2),S(z)=n≤zn squarefree​∑​ p∣n∏​bp​,b2​=1,bp​=p−22​ (p>2),

put

P=∑plog⁡pp(p−1),G=∑p8p2−10p+4p2(p−1)2 log⁡2p,P=\sum_{p}\frac{\log p}{p(p-1)},\qquad G=\sum_{p}\frac{8p^2-10p+4}{p^2(p-1)^2}\,\log^2 p,P=p∑​p(p−1)logp​,G=p∑​p2(p−1)28p2−10p+4​log2p,

let γ\gammaγ be Euler's constant, and let CCC be the twin-prime singular constant, normalized so that the Hardy--Littlewood prime-pair prediction is

C∏p∣d, p>2p−1p−2⋅xlog⁡2x.C\prod_{p\mid d,\ p>2}\frac{p-1}{p-2}\cdot\frac{x}{\log^2 x}.Cp∣d, p>2∏​p−2p−1​⋅log2xx​.

The theorem states that there exist real numbers BBB and EEE with

0≤E≤103,B ≥ 1.11,0\le E\le \tfrac{10}{3},\qquad B\ \ge\ 1.11,0≤E≤310​,B ≥ 1.11,

such that for every real z>0z>0z>0

∣ S(z)−log⁡2z+(4γ+4P+log⁡2)log⁡z+B2C ∣ ≤ E z−1/3.\Bigl|\,S(z)-\frac{\log^2 z+(4\gamma+4P+\log 2)\log z+B}{2C}\,\Bigr|\ \le\ E\,z^{-1/3}.​S(z)−2Clog2z+(4γ+4P+log2)logz+B​​ ≤ Ez−1/3.

Meaning of the constants

This is the numerically sharp companion of the platform node PrimePairSieve.base_denominator_quadratic_expansion_explicit (itself the effective form of the quadratic expansion in Riesel--Vaughan, eqs. (3.6)--(3.10)). The centre is the Riesel--Vaughan quadratic asymptotic of the base sieve denominator, with the exact optimal choices of both remaining constants:

  • the expansion constant is the value 2γ2+4γ(2P+log⁡22)+[(2P+log⁡22)2+log⁡224−G]−4γ12\gamma^2+4\gamma\bigl(2P+\tfrac{\log 2}{2}\bigr)+\bigl[\bigl(2P+\tfrac{\log 2}{2}\bigr)^2+\tfrac{\log^2 2}{4}-G\bigr]-4\gamma_12γ2+4γ(2P+2log2​)+[(2P+2log2​)2+4log22​−G]−4γ1​, where γ1\gamma_1γ1​ is the first Stieltjes constant; numerically it is 1.1141292…1.1141292\ldots1.1141292…, so B=1.1141292…≥1.11B=1.1141292\ldots\ge 1.11B=1.1141292…≥1.11 is admissible;
  • the true maximal size of the normalized error ∣S(z)−centre(z)∣ z1/3\bigl|S(z)-\text{centre}(z)\bigr|\,z^{1/3}​S(z)−centre(z)​z1/3 is ≈3.11\approx 3.11≈3.11 (attained near z≈42z\approx 42z≈42), so E=10/3E=10/3E=10/3 is admissible with room to spare.

A direct numerical check confirms that for B=1.1141292…B=1.1141292\ldotsB=1.1141292… one has ∣S(z)−centre(z)∣ z1/3≤3.1051\bigl|S(z)-\text{centre}(z)\bigr|\,z^{1/3}\le 3.1051​S(z)−centre(z)​z1/3≤3.1051 for all integer z≤2⋅106z\le 2\cdot 10^6z≤2⋅106 and on a fine grid for real zzz, while for all zzz below the grid the bound is far smaller.

Route

Together with the pure-analysis transfer lemma

∣∑n≤zb(n)nz+n−2log⁡22Clog⁡z−4γ12C∣ ≤ (12+J) E z−1/3,J=∫01s−1/3(1+s)2 ds≈0.4,\Bigl|\sum_{n\le z}\frac{b(n)n}{z+n}-\frac{2\log 2}{2C}\log z-\frac{4\gamma_1}{2C}\Bigr|\ \le\ \Bigl(\tfrac12+J\Bigr)\,E\,z^{-1/3},\qquad J=\int_0^1\frac{s^{-1/3}}{(1+s)^2}\,ds\approx 0.4,​n≤z∑​z+nb(n)n​−2C2log2​logz−2C4γ1​​​ ≤ (21​+J)Ez−1/3,J=∫01​(1+s)2s−1/3​ds≈0.4,

this statement implies its reciprocal counterpart PrimePairSieve.reciprocal_base_denominator_quadratic_expansion_sharp with E=3E=3E=3, and hence (via the platform node PrimePairSieve_prime_pair_count_base_reciprocal_bound) the target TaoFivePrimes.siebert_prime_pair_bound in the range x≥25600x\ge 25600x≥25600, the remaining finite range being certified separately.

Reference

H. Riesel and R. C. Vaughan, On sums of primes, Arkiv för Matematik 21 (1983), 46--74, eqs. (3.6)--(3.10). Effective sharp version of the platform node PrimePairSieve.base_denominator_quadratic_expansion.

Preamble
import Definitions.Def_TaoFivePrimes_SingularSeries
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Data.Nat.Squarefree
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Algebra.Order.Floor.Semifield
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.NumberTheory.Harmonic.EulerMascheroni
import Mathlib.Topology.Algebra.InfiniteSum.Real

open scoped BigOperators
Formal statement
namespace PrimePairSieve

theorem base_denominator_quadratic_expansion_sharp :
    ∃ B E : ℝ, 0 ≤ E ∧ E ≤ 10 / 3 ∧ (1.11 : ℝ) ≤ B ∧
      (∀ z : ℝ, 0 < z →
        |(∑ n ∈ Finset.Icc 1 ⌊z⌋₊,
          if Squarefree n then
            ∏ p ∈ n.primeFactors, if p = 2 then (1 : ℝ) else 2 / ((p : ℝ) - 2)
          else 0) -
        (Real.log z^2 +
          (4 * Real.eulerMascheroniConstant +
            4 * (∑' p : Nat.Primes,
              Real.log (p : ℝ) / ((p : ℝ) * ((p : ℝ) - 1))) + Real.log 2) *
            Real.log z + B) / (2 * TaoFivePrimes.twinPrimeConstant)| ≤
        E * z ^ (-(1 / 3 : ℝ))) := by sorry

end PrimePairSieve
Source
H. Riesel and R. C. Vaughan, On sums of primes, Ark. Mat. 21 (1983), 46-74, eqs. (3.6)-(3.10); sharp explicit strengthening of platform node PrimePairSieve.base_denominator_quadratic_expansion.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me