BCR Lemma 15 in situ: construction of a finite-horizon regrouping certificate
OpenKServer.bcr_lemma15_finite_certificateFix α > 0, an integer β ≥ 2, and a level w with α(w+1)² > 1. Assume the mission's BCRInductiveSubchunks predicate at level w. On the same next-level metric space, there is a finite-horizon chunk certificate with constant initial information, size window
required expected total, escape price, and minimum chunk count respectively
The certificate supplies a finite sample space, adapted chunks and sizes, a refining filtration, the original terminal-request and offline-cost bounds, and a common request horizon H. Its conditional online cost inequalities are checked against bounded tables of serving positions and bailout decisions. On this finite metric space there are finitely many such tables for each fixed H.
This is the remaining regrouping construction in a finite-horizon verification interface. No extra Doob-jump, slow-decrement, or bounded-surprise hypothesis is imposed on the input. Existence of the required certificate remains an open construction problem.
import Definitions.Def_KServer_bcr_induction import Definitions.Def_KServer_finite_chunk_certificates open KServer
theorem KServer.bcr_lemma15_finite_certificate (α : ℝ) (hα : 0 < α) (β : ℕ) (hβ : 0 < β)
(hβ2 : 2 ≤ β) (w : ℕ) (hw : 1 < α * ((w + 1 : ℕ) : ℝ) ^ 2)
(h : KServer.BCRInductiveSubchunks α β hβ w) :
∃ C : @FiniteChunkSystemB (bcrLevel2 β hβ (w + 1)).carrier
(bcrLevel2 β hβ (w + 1)).metric
(bcrLevel2 β hβ (w + 1)).s (bcrLevel2 β hβ (w + 1)).t
((3 : ℝ) ^ (w + 1) / 2) (3 * (3 : ℝ) ^ (w + 1) / 2)
((α * β * ((w + 1 : ℕ) : ℝ) ^ 2) * 3 ^ (w + 1))
(2 * β * (3 : ℝ) ^ (w + 1)) ⌈α * β * ((w + 1 : ℕ) : ℝ) ^ 2⌉₊,
∀ ω₁ ω₂ : C.Ω, C.hist 0 ω₁ = C.hist 0 ω₂ := by sorry