BCR race construction from fresh independent Boolean seeds
OpenKServer.bcr_claim13_product_race_constructionFix , an integer , and satisfying
Assume the mission's tight level- chunk invariant. There is a nonnegative-weight chunk certificate on the next-level space, retaining the existing request, filtration, offline-cost, and online-escape axioms, constant initial chunk information, nonempty chunks, nonnegative ceiling , escape price , and Doob-jump bound . Its budgets are
The finite outcome space is identified by a bijection with a Boolean cube of dimension . It has fixed coordinate biases and product weights
There are race steps with state , nonnegative step sizes with positive sum, information labels , branch choices , and selected coordinate . The state starts at zero. The state, step sizes, and selected coordinate are constant on every atom of . The selected bit has bias and branch value
The selected coordinate is fresh: changing only that seed bit leaves the current information label unchanged, for either replacement bit. The next state is the current state plus the left step on the true branch and the current state minus the right step otherwise.
Put , and let be the actual expected total chunk size. The retained local moment budgets and stage accounting are
This is an open sufficient construction interface using finitely many independent biased seeds and an explicit freshness condition. It supplies the probabilistic mechanism for the existing atomwise race frontier; the requests and all numerical budgets remain construction obligations.
Formalization Note Race information labels are separate from the chunk filtration. Biases at the endpoints are permitted because zero-weight outcomes are allowed. The Doob-jump bound is required on positive-weight outcomes. This is a proposed sufficient realization of the platform's tight-price adaptation, not a claim that BCR's unmodified stopping rule meets these numerical constants, or that every arbitrary race certificate already comes with this seed realization.
import Definitions.Def_KServer_bcr_induction_tight import Definitions.Def_KServer_nonneg_chunk_system open KServer
theorem KServer.bcr_claim13_product_race_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 : @NonnegChunkSystemB (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)
(d : ℕ) (p : Fin d → ℝ) (e : C.Ω ≃ (Fin d → Bool)) (I : ℕ → C.Ω → Fin d),
(∀ i, 0 ≤ p i ∧ p i ≤ 1) ∧
(∀ ω, C.P ω = ∏ i, if (e ω) i then p i else 1 - p i) ∧
(∀ ω, 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, ∀ ω ω', H j ω = H j ω' → I j ω = I j ω') ∧
(∀ j < N, ∀ ω, p (I j ω) = R j ω / (L j ω + R j ω)) ∧
(∀ j < N, ∀ ω, B j ω = (e ω) (I j ω)) ∧
(∀ j < N, ∀ ω (b : Bool),
H j (e.symm (Function.update (e ω) (I j ω) b)) = H 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