BCR race construction with explicit atomwise branch probabilities
OpenKServer.bcr_claim13_race_atom_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, filtration, offline-cost, and online-escape axioms, with nonnegative ceiling , escape price , and Doob-jump bound , constant initial information, and nonempty chunks. Its tight budgets are
On the same finite outcome space there are race steps, arrays , information labels , and Boolean branch choices . The state starts at zero. Step sizes are nonnegative with . The state and both step sizes are constant on each atom of . The next state is
For every and every atom of the race information partition, its true-branch mass is
where the ratio on the right is constant on that atom. Put , and let be the actual expected total chunk size. The quantitative requirements are
This open construction certificate specifies the source's conditional left/right selection rule directly. The averaged transition law for all test functions follows from the independently proved finite mixture lemma, rather than being a separate construction obligation.
Formalization Note The labels describe the race partitions; they are separate from the chunk-system filtration. This is a sufficient interface for the platform's tight-price adaptation, not a verbatim assertion proved in the paper. The numerical moment budgets, the actual requests, and the tight price and jump bounds remain open construction obligations. No claim is made that the paper's unmodified stopping rule satisfies these numerical budgets.
import Definitions.Def_KServer_bcr_induction_tight import Definitions.Def_KServer_chunk_cond open KServer
theorem KServer.bcr_claim13_race_atom_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.Ω → ℝ) (H : ℕ → C.Ω → ℕ) (B : ℕ → C.Ω → Bool),
(∀ ω, S 0 ω = 0) ∧
(∀ j < N, ∀ ω, 0 ≤ L j ω ∧ 0 ≤ R j ω ∧ 0 < L j ω + R j ω) ∧
(∀ j < N, ∀ ω ω', H j ω = H j ω' →
S j ω = S j ω' ∧ L j ω = L j ω' ∧ R j ω = R j ω') ∧
(∀ j < N, ∀ ω, S (j + 1) ω =
if B j ω then S j ω + L j ω else S j ω - R j ω) ∧
(∀ j < N, ∀ ω₀,
(∑ ω ∈ Finset.univ.filter (fun ω => H j ω = H j ω₀ ∧ B j ω = true), C.P ω) =
(R j ω₀ / (L j ω₀ + R j ω₀)) *
(∑ ω ∈ Finset.univ.filter (fun ω => H j ω = H j ω₀), C.P ω)) ∧
(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