Billingsley's small-oscillation partition lemma (cited in Theorem 3.1)
ProvedWhittFLT.Composition.billingsley_lemma_1cadlag-pathsfunctional-limit-theoremsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1skorohod-space
Let , let be a càdlàg path from into a metric space , and let . There is a finite partition such that, on every half-open piece,
This is the compactness property of càdlàg paths used in Whitt's proof of Theorem 3.1(ii). Whitt cites it as Lemma 1 on p. 110 of Billingsley (1968); it is not a numbered theorem of Whitt's paper.
Formalization Note The supremum is taken in the extended nonnegative reals over exactly the half-open intervals printed in the source. The strict inequality includes the positive threshold and guarantees the oscillation is finite.
Preamble
import Mathlib import Definitions.Def_WhittFLT_Composition_SkorohodD
Formal statement
namespace WhittFLT.Composition
open Set Filter Topology
open scoped ENNReal
/-- The finite small-oscillation partition used in §3, proof of Theorem 3.1(ii), p. 75;
Whitt cites Billingsley (1968), Lemma 1, p. 110. -/
theorem billingsley_lemma_1 {S : Type*} [MetricSpace S] (c d : ℝ) (hcd : c < d)
(x : ℝ → S) (hx : IsCadlagOn (Icc c d) x) (ε : ℝ) (hε : 0 < ε) :
∃ (n : ℕ) (t : Fin (n + 1) → ℝ), t 0 = c ∧ t (Fin.last n) = d ∧ StrictMono t ∧
∀ j : Fin n, (⨆ s₁ ∈ Ico (t j.castSucc) (t j.succ), ⨆ s₂ ∈ Ico (t j.castSucc) (t j.succ),
edist (x s₁) (x s₂)) < ENNReal.ofReal ε := by sorry
end WhittFLT.Composition
Source
Whitt, Some Useful Functions for Functional Limit Theorems, Math. Oper. Res. 5(1) (1980), §3, proof of Theorem 3.1(ii), p. 75 (citing Billingsley 1968, Lemma 1, p. 110); https://doi.org/10.1287/moor.5.1.67
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.