Positive-support conversion preserves chunk certificates and Doob jumps
ProvedKServer.nonneg_chunk_positive_supportLet be a finite chunk certificate on a metric space, with marked points , size window , expected-total requirement , escape price , and minimum chunk count . Its weights are nonnegative and sum to one. Assume constant initial information, nonempty chunks, and a Doob-jump bound on positive-weight outcomes.
There is a strict positive-weight chunk system with exactly the same parameters and chunk count, together with an injection , such that
for every real function on the original outcome space. The histories agree under the injection, and the actual expected total sizes agree:
The resulting system has constant initial information, nonempty chunks, and the same Doob-jump bound. As a strict chunk system it satisfies all the original conditional online-cost inequalities, terminal-request and offline-cost conditions, and size-window and expected-total requirements.
This permits finite constructions to use zero-weight outcomes, including impossible branches in stopped processes, while producing a certificate in the platform's original positive-weight model. No probabilities are renormalized.
Formalization Note The proof constructs the positive support as a subtype and uses total real division. Weighted sums over every history atom are preserved, so the conditional expected totals and their jumps agree on the retained outcomes.
import Definitions.Def_KServer_nonneg_chunk_system set_option autoImplicit false open KServer open scoped BigOperators
theorem KServer.nonneg_chunk_positive_support {X : Type*} [MetricSpace X] {s t : X}
{cLo cHi total price jb : ℝ} {mLo : ℕ}
(D : NonnegChunkSystemB X s t cLo cHi total price mLo)
(h0 : ∀ ω ω' : D.Ω, D.hist 0 ω = D.hist 0 ω')
(hch : ∀ (ω : D.Ω) (i : Fin D.m), D.chunk ω i ≠ [])
(hjump : D.DoobJumpBound jb) :
∃ (C : ChunkSystemB X s t cLo cHi total price mLo) (e : C.Ω ↪ D.Ω),
C.m = D.m ∧
(∀ ω, C.P ω = D.P (e ω)) ∧
(∀ f : D.Ω → ℝ, (∑ ω, C.P ω * f (e ω)) = ∑ ω, D.P ω * f ω) ∧
(∀ h ω, C.hist h ω = D.hist h (e ω)) ∧
(∑ ω, C.P ω * ∑ i, C.size ω i) = (∑ ω, D.P ω * ∑ i, D.size ω i) ∧
(∀ ω ω' : C.Ω, C.hist 0 ω = C.hist 0 ω') ∧
(∀ (ω : C.Ω) (i : Fin C.m), C.chunk ω i ≠ []) ∧
C.DoobJumpBound jb := by sorry