BCR race construction with second and fourth moment certificates
OpenKServer.bcr_claim13_race_moment_constructionFix , an integer , and a level such that
Assume the mission's tight level- chunk invariant. There are a filtered chunk system on the next-level space and a real statistic on its finite outcome space. Put
The weights and requests obey all axioms of the existing chunk-system model, the initial information is constant, every chunk is nonempty, and the nonnegative ceiling , escape price , and Doob jump bound satisfy
The statistic and the actual total obey
This is an open construction certificate separating the request construction and information bounds from the scalar moment estimate. The total-mass accounting follows the form of equation (3) in BCR's race analysis.
Formalization Note This is a proposed sufficient construction lemma for the platform's tight-escape-price adaptation. The tight escape price, combined ceiling/jump budget, and explicit moment constants are additional proof obligations, not assertions already established by BCR's paper or by this submission. In particular, no Doob-jump bound is inferred merely from the input size window. The second-moment requirement is part of the certificate; it is not claimed for the paper's unmodified stopping rule.
import Definitions.Def_KServer_bcr_induction_tight import Definitions.Def_KServer_chunk_cond open KServer
theorem KServer.bcr_claim13_race_moment_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,
∃ Z : C.Ω → ℝ,
(Real.sqrt (α * β) * (w : ℝ)) ^ 2 / 4 ≤ (∑ ω, C.P ω * Z ω ^ 2) ∧
(∑ ω, C.P ω * Z ω ^ 4) ≤ 4 * (Real.sqrt (α * β) * (w : ℝ)) ^ 4 ∧
(3 * (α * β) * (w : ℝ) ^ 2 + (∑ ω, C.P ω * |Z ω|) / 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