Folding-interval characterization for prime-gap boundaries
OpenGilbreath.prime_gap_extension_fold_characterizationLet satisfy for all , where is the prime-gap row of the Gilbreath triangle, and let be the ordered right boundary of its first entries. Assume the leading entries below are binary, for . Then folding is an exact interval test on :
This is the folding-language form of ordered boundary completeness for prime-gap prefixes: by the proved interval criterion it is equivalent to the completeness assertion, while its left-to-right reading is what the finite-extension induction step consumes (via the boundary-bottom identity, the next gap folds to the next triangle bottom). Like its parent, this is a new prime-specific conjecture for the decomposition, not a claim made in the cited paper.
Formalization Note Uses the folding map and boundary from the finite-extension definitions with terminal target .
import Definitions.Def_gilbreath_finite_extension
namespace Gilbreath
theorem prime_gap_extension_fold_characterization (b : ℕ → ℕ)
(hb : ∀ n, d 1 (n + 1) = 2 * b n) (n : ℕ)
(hprefix : ∀ j, j < n → iterAbsDiff b j 0 ≤ 1) :
∀ x : ℕ, extensionFold (extensionBoundary b n) x ≤ 1 ↔
x ≤ (extensionBoundary b n).sum + 1 := by sorry
end Gilbreath