Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cutoff and obstruction conditions for halved prime gaps

Open
Gilbreath.halved_prime_gap_conditions

by caleb · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsconjecturegilbreathnumber-theory

Let b:N→Nb : \mathbb{N} \to \mathbb{N}b:N→N satisfy d1(n+1)=2bnd^1(n+1) = 2b_nd1(n+1)=2bn​ for all nnn, where d1d^1d1 is the prime-gap row of the Gilbreath triangle. Then there is a finite cutoff N0N_0N0​ such that the bottom entry of every bbb-triangle of length at most N0N_0N0​ is 000 or 111, and for every larger length NNN one can choose parameters N′,M,LN', M, LN′,M,L and scales RRR satisfying the inequalities of the Chase--Hunter--Tao deterministic criterion, under which the initial entries of bbb are bounded by 2M2^M2M, no row of the bbb-triangle contains LLL consecutive zeros in range, and the specified right-hand region contains no long block taking only the values 000 and ddd.

This is the open combinatorial core of the prime-gap finite-criterion conditions: it is what remains after the (proved) positive normalization of the prime-gap tail supplies the sequence bbb. Together with the proved finite criterion, these conditions imply that every bbb-triangle bottom is 000 or 111.

Formalization Note Extracted verbatim from the second half of Gilbreath.prime_gap_finite_criterion_conditions for use in a proof-sketch decomposition: it is the conclusion of the parent for an arbitrary sequence satisfying the normalization hypothesis. Like its parent, this is a new conjecture motivated by the paper below, not a claim made there.

Preamble
import Definitions.Def_gilbreath_triangle
Formal statement
namespace Gilbreath
theorem halved_prime_gap_conditions (b : ℕ → ℕ)
    (hb : ∀ n, d 1 (n + 1) = 2 * b n) :
    ∃ N₀ : ℕ,
      (∀ N, 1 ≤ N → N ≤ N₀ →
        iterAbsDiff b (N - 1) 0 = 0 ∨
        iterAbsDiff b (N - 1) 0 = 1) ∧
      (∀ N, N₀ < N →
        ∃ N' M L : ℕ, ∃ R : ℕ → ℕ,
          (1 ≤ N' ∧ N' ≤ N ∧ 1 ≤ M ∧ 1 ≤ L ∧
            1 < R 0 ∧
            (∀ m, m < M → R m < R (m + 1)) ∧
            2 * R M + N' < N ∧
            (∀ m, 1 ≤ m → m ≤ M → 4 * R (m - 1) ≤ R m) ∧
            100 * L * 8 ^ M ≤ R 0) ∧
          (∀ j < N, b j ≤ 2 ^ M) ∧
          (¬ ∃ i j : ℕ,
            i + L ≤ N ∧ j + i + L ≤ N ∧
            ∀ t < L, iterAbsDiff b i (j + t) = 0) ∧
          (¬ ∃ m d' i k j : ℕ,
            1 ≤ m ∧ m ≤ M ∧
            2 ^ (M - m) < d' ∧ d' ≤ 2 ^ (M - m + 1) ∧
            i ≤ 2 * R (m - 1) ∧
            R m ≤ k + 3 * R (m - 1) ∧
            N' ≤ j + 1 ∧ j + i + k + 1 ≤ N ∧
            ∀ t < k, iterAbsDiff b i (j + t) = 0 ∨
              iterAbsDiff b i (j + t) = d')) := by sorry
end Gilbreath
Source
Open core extracted from Gilbreath.prime_gap_finite_criterion_conditions (itself a new conjecture formulated for Prove2Me decomposition by EvanLLL); motivated by Z. Chase, Z. Hunter, T. Tao, Gilbreath's conjecture: a Cramer random model and a deterministic analysis, arXiv:2607.08712v1, pp. 7-8, Theorem 1.6, equations (1.6)-(1.8), https://arxiv.org/pdf/2607.08712v1. The paper calls the obstruction exclusions plausible but does not assert this prime-specific quantified conjecture.

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