Measurable chunk sizes give slow decrement at parameter zero
DisprovedKServer.chunk_slow_decrement_zero_of_hsmeasbcrchunk-systemfiltrationkserverlemma15
Measurability of the chunk sizes gives the slow-decrement property for free at the degenerate parameter zero. If every realised size at index i is a function of the time-i history alone, then the conditional expected remaining size drops across a step by exactly the realised size at that step, which is nonnegative because the size floor cLo is zero. Hence no branch ever sees the conditional expected remaining size drop, which is strictly stronger than the slow-decrement property at the size ceiling 3 * 3 ^ w / 2 required by the regrouping step of BCR Lemma 15.
Preamble
import Mathlib import Definitions.Def_KServer_chunk_system_b import Definitions.Def_KServer_chunk_slow_decrement
Formal statement
theorem KServer.chunk_slow_decrement_zero_of_hsmeas
{X : Type*} [MetricSpace X] {s t : X} {cLo cHi total price : ℝ} {mLo : ℕ}
(C : ChunkSystemB X s t cLo cHi total price mLo) :
C.SlowDecrement 0 := by
sorrySource
BCR 2023 k-Server milestone; the branchwise tame pair required by bcr_lemma15_regroup_levels. Established by exhaustive exact-rational enumeration on 180 finite systems (zero violations) plus the analytic identity F_h = size w h + F_{h+1} under hsmeas.