BCR race construction with transition and local moment budgets
OpenKServer.bcr_claim13_race_kernel_constructionFix , an integer , and with
Assume the mission's tight level- chunk invariant. On the next-level space there is a chunk system satisfying the existing request-feasibility, offline-cost, filtration, and online-escape axioms, with nonnegative ceiling , escape price , and Doob-jump bound , constant initial information, and nonempty chunks. Its budgets are
There are a finite number of race steps and real arrays on the same outcome space, with , nonnegative step sizes, and . For each and every real test function , they satisfy the averaged transition law
Put and let be the actual expected total chunk size. The local budgets and stage accounting are
This is an open construction certificate for the existing frontier. It replaces terminal second- and fourth-moment requirements with an explicit transition law and local accumulated budgets. The random requests, these budgets, and the tight information and escape-price bounds still have to be constructed.
Formalization Note This is a sufficient interface for the platform's tight-price adaptation, not a verbatim theorem proved in BCR's paper. Neither the accumulated budgets nor the Doob-jump bound is inferred from a size window. No claim is made that BCR's unmodified stopping rule satisfies these constants. A stopped path can be kept fixed by setting afterwards.
import Definitions.Def_KServer_bcr_induction_tight import Definitions.Def_KServer_chunk_cond open KServer
theorem KServer.bcr_claim13_race_kernel_construction (α : ℝ) (hα : 0 < α) (hα1 : α ≤ 1)
(β : ℕ) (hβ : 0 < β) (hβ2 : 2 ≤ β) (hsmall : α * (β : ℝ) ≤ 1 / 10 ^ 6)
(w : ℕ) (hw : 1 < α * ((w + 1 : ℕ) : ℝ) ^ 2)
(hC : BCRInductiveChunksTight α β hβ w) :
∃ cB jb pe : ℝ, 0 ≤ cB ∧ 0 ≤ jb ∧ 0 ≤ pe ∧
∃ C : @ChunkSystemB (bcrLevel2 β hβ (w + 1)).carrier
(bcrLevel2 β hβ (w + 1)).metric
(bcrLevel2 β hβ (w + 1)).s (bcrLevel2 β hβ (w + 1)).t
0 cB 0 pe 0,
∃ (N : ℕ) (S L R : ℕ → C.Ω → ℝ),
(∀ ω, S 0 ω = 0) ∧
(∀ j < N, ∀ ω, 0 ≤ L j ω ∧ 0 ≤ R j ω ∧ 0 < L j ω + R j ω) ∧
(∀ j < N, ∀ f : ℝ → ℝ,
(∑ ω, C.P ω * f (S (j + 1) ω)) =
∑ ω, C.P ω * (R j ω / (L j ω + R j ω) * f (S j ω + L j ω) +
L j ω / (L j ω + R j ω) * f (S j ω - R j ω))) ∧
(Real.sqrt (α * β) * (w : ℝ)) ^ 2 / 4 ≤
(∑ j ∈ Finset.range N, ∑ ω, C.P ω * (L j ω * R j ω)) ∧
(∑ j ∈ Finset.range N, ∑ ω, C.P ω *
(L j ω * R j ω * (6 * S j ω ^ 2 + 4 * S j ω * (L j ω - R j ω) +
L j ω ^ 2 - L j ω * R j ω + R j ω ^ 2))) ≤
4 * (Real.sqrt (α * β) * (w : ℝ)) ^ 4 ∧
(3 * (α * β) * (w : ℝ) ^ 2 + (∑ ω, C.P ω * |S N ω|) / 2) * 3 ^ w
≤ (∑ ω, C.P ω * ∑ i, C.size ω i) ∧
pe ≤ (β : ℝ) * 3 ^ w ∧
cB + jb ≤ 11 / 8 * (3 : ℝ) ^ w ∧
(∀ ω₁ ω₂ : C.Ω, C.hist 0 ω₁ = C.hist 0 ω₂) ∧
(∀ (ω : C.Ω) (i : Fin C.m), C.chunk ω i ≠ []) ∧
C.DoobJumpBound jb := by sorry