Helfgott–Platt block ladders, group 1 subgroup 4 of 10
OpenWeakGoldbach.helfgott_platt_block_ladders_grp01_sg04Put and . For every integer in the range
$14781 \le b < 19708$,there is a finite increasing sequence of primes satisfying
Role: this is subgroup of consecutive subgroups of WeakGoldbach.helfgott_platt_block_ladders_grp01, which covers block indices (group 1 of 10 of the parent WeakGoldbach.helfgott_platt_block_ladders). Each subgroup has width in the block index . The subgroups meet end to end within group 1.
This isolates the local computational certificate for of the intervals of width reported in Section 4 of the source. The endpoint conditions allow consecutive blocks to be joined without a gap of size .
The hypotheses are . No certificate data are supplied here; the statement is an open certificate obligation for this index range.
Formalization Note The conclusion matches WeakGoldbach.helfgott_platt_block_ladders_grp01 exactly; only the range of is restricted.
import Mathlib.Data.Nat.Prime.Basic
theorem WeakGoldbach.helfgott_platt_block_ladders_grp01_sg04 (b : ℕ) (hb_lo : 14781 ≤ b) (hb_hi : b < 19708) :
∃ (k : ℕ) (p : ℕ → ℕ),
(∀ i, i ≤ k → Nat.Prime (p i)) ∧
(b*18014398509481984000000000 < p 0 ∧
p 0 ≤ b*18014398509481984000000000 + 2*10^18) ∧
(∀ i, i < k → p i < p (i+1) ∧ p (i+1) < p i + 4*10^18) ∧
(p k ≤ (b+1)*18014398509481984000000000 ∧
(b+1)*18014398509481984000000000 < p k + 2*10^18) := by sorry