Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Certified interval monotonicity, antitone, peak-envelope, and transition bounds for 4D Buchstab integrals

Proved
buchstab4dt_chaining

by kmehltretter82 · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theorysieve-theory

For any valid parameter tuple p∈Params4DTp \in \mathrm{Params4DT}p∈Params4DT and any Buchstab function ω\omegaω satisfying IsBuchstabCore, this theorem certifies the five interval-chaining rules used to bound

I(φ)=∫ΩA,B,Cω ⁣(φ−∑j=03xjx2)x0x1x22x3 dxI(\varphi) = \int_{\Omega_{A,B,C}} \frac{\omega\!\left(\frac{\varphi - \sum_{j=0}^3 x_j}{x_2}\right)}{x_0 x_1 x_2^2 x_3}\, dxI(φ)=∫ΩA,B,C​​x0​x1​x22​x3​ω(x2​φ−∑j=03​xj​​)​dx

uniformly over φ∈[2,7/2]\varphi \in [2, 7/2]φ∈[2,7/2].

Specifically, using only integer evaluations of evalTree3 and evalTree4, it proves:

  1. Increasing-interval chaining: if evalTree3 (evalMmLeaf p pa pb) has positive part ≤\le≤ negative part, then I(φ)≤I(pb/Dp)I(\varphi) \le I(p_b/D_p)I(φ)≤I(pb​/Dp​) on [pa/Dp,pb/Dp][p_a/D_p, p_b/D_p][pa​/Dp​,pb​/Dp​].
  2. Decreasing-interval chaining: if evalTree3 (evalMpLeaf p pa pb) has positive part ≤\le≤ negative part, then I(φ)≤I(pa/Dp)I(\varphi) \le I(p_a/D_p)I(φ)≤I(pa​/Dp​) on [pa/Dp,pb/Dp][p_a/D_p, p_b/D_p][pa​/Dp​,pb​/Dp​].
  3. Left and right peak envelopes: combining a 4D endpoint bound at ps/Dpp_s/D_pps​/Dp​ with a 3D slope-difference bound yields I(φ)≤bndn/S4I(\varphi) \le \mathrm{bnd}_n / S_4I(φ)≤bndn​/S4​ across the peak neighborhood.
  4. Upper transition bound: for φ≥pa/Dp≥4B+C\varphi \ge p_a/D_p \ge 4B + Cφ≥pa​/Dp​≥4B+C, evalTree4 (eval4TransLeaf p pa) certifies I(φ)≤bndn/S4I(\varphi) \le \mathrm{bnd}_n / S_4I(φ)≤bndn​/S4​.
Preamble
import Mathlib
import Definitions.Def_Buchstab4DT_Core

open Real Set MeasureTheory Buchstab4DT
open scoped Classical
Formal statement
theorem buchstab4dt_chaining :
∀ (p : Params4DT), p.Valid → ∀ {ω : ℝ → ℝ}, IsBuchstabCore ω →
  (∀ {pa_n pb_n : ℕ} {t : BoxTree3},
    pa_n ≤ pb_n → (pb_n : ℝ) / p.D_p ≤ 5 * p.A_R + p.B_R →
    tree3Valid .simp t = true →
    (let r := evalTree3 (evalMmLeaf p pa_n pb_n) .simp t p.A_n p.B_n p.A_n p.B_n p.A_n p.B_n; r.1 ≤ r.2) →
    ∀ {φ : ℝ}, (pa_n : ℝ) / p.D_p ≤ φ → φ ≤ (pb_n : ℝ) / p.D_p →
    I_fn p ω φ ≤ I_fn p ω ((pb_n : ℝ) / p.D_p)) ∧
  (∀ {pa_n pb_n : ℕ} {t : BoxTree3},
    pa_n ≤ pb_n → (pb_n : ℝ) / p.D_p ≤ 5 * p.A_R + p.B_R →
    tree3Valid .simp t = true →
    (let r := evalTree3 (evalMpLeaf p pa_n pb_n) .simp t p.A_n p.B_n p.A_n p.B_n p.A_n p.B_n; r.1 ≤ r.2) →
    ∀ {φ : ℝ}, (pa_n : ℝ) / p.D_p ≤ φ → φ ≤ (pb_n : ℝ) / p.D_p →
    I_fn p ω φ ≤ I_fn p ω ((pa_n : ℝ) / p.D_p)) ∧
  (∀ {bnd_n pa_n ps_n : ℕ} {t3 : BoxTree3} {t4 : BoxTree4},
    pa_n ≤ ps_n → (ps_n : ℝ) / p.D_p ≤ 5 * p.A_R + p.B_R →
    tree3Valid .simp t3 = true → tree4Valid .simp t4 = true →
    (let r := evalTree3 (evalMmLeaf p pa_n ps_n) .simp t3 p.A_n p.B_n p.A_n p.B_n p.A_n p.B_n
     let v := evalTree4 (eval4Leaf p ps_n) .simp t4 p.A_n p.B_n p.A_n p.B_n p.A_n p.B_n p.B_n p.C_n
     v * p.D_p + (r.1 - r.2) * (ps_n - pa_n) * 100 ≤ bnd_n * p.D_p) →
    ∀ {φ : ℝ}, (pa_n : ℝ) / p.D_p ≤ φ → φ ≤ (ps_n : ℝ) / p.D_p →
    I_fn p ω φ ≤ (bnd_n : ℝ) / p.S_4) ∧
  (∀ {bnd_n ps_n pb_n : ℕ} {t3 : BoxTree3} {t4 : BoxTree4},
    ps_n ≤ pb_n → (pb_n : ℝ) / p.D_p ≤ 5 * p.A_R + p.B_R →
    tree3Valid .simp t3 = true → tree4Valid .simp t4 = true →
    (let r := evalTree3 (evalMpLeaf p ps_n pb_n) .simp t3 p.A_n p.B_n p.A_n p.B_n p.A_n p.B_n
     let v := evalTree4 (eval4Leaf p ps_n) .simp t4 p.A_n p.B_n p.A_n p.B_n p.A_n p.B_n p.B_n p.C_n
     v * p.D_p + (r.1 - r.2) * (pb_n - ps_n) * 100 ≤ bnd_n * p.D_p) →
    ∀ {φ : ℝ}, (ps_n : ℝ) / p.D_p ≤ φ → φ ≤ (pb_n : ℝ) / p.D_p →
    I_fn p ω φ ≤ (bnd_n : ℝ) / p.S_4) ∧
  (∀ {bnd_n pa_n : ℕ} {t4 : BoxTree4},
    p.D_p * (4 * p.B_n + p.C_n) ≤ pa_n * p.D_x →
    tree4Valid .simp t4 = true →
    evalTree4 (eval4TransLeaf p pa_n) .simp t4 p.A_n p.B_n p.A_n p.B_n p.A_n p.B_n p.B_n p.C_n ≤ bnd_n →
    ∀ {φ : ℝ}, (pa_n : ℝ) / p.D_p ≤ φ →
    I_fn p ω φ ≤ (bnd_n : ℝ) / p.S_4) := by sorry
Source
Wu (2004), Chen's double sieve, Goldbach's conjecture and the twin prime problem, Acta Arith. 114 (2004), 215-273; reusable 4D Buchstab integral certification framework for LL_Decomp587j.r1j17_short and LL_Decomp587l.r0j17_short.

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