Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, proof of Theorem 4.1, p. 79 — Billingsley’s Lemma 1 (cited)

Proved
WhittFLT.Reflection.billingsley_lemma_1

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

cadlagp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1skorohod-space

Let x∈D([c,d],S)x\in D([c,d],S)x∈D([c,d],S) with c<dc<dc<d, and let ε>0\varepsilon>0ε>0. There is a finite partition c=t0<⋯<tn=dc=t_0<\cdots<t_n=dc=t0​<⋯<tn​=d such that the oscillation of xxx on every half-open interval of the partition is below ε\varepsilonε:

sup⁡tj−1≤s1,s2<tjm(x(s1),x(s2))<ε(1≤j≤n).\sup_{t_{j-1}\le s_1,s_2<t_j}m(x(s_1),x(s_2))<\varepsilon\qquad(1\le j\le n).tj−1​≤s1​,s2​<tj​sup​m(x(s1​),x(s2​))<ε(1≤j≤n).

This is the one-path partition fact cited from Billingsley in Whitt’s addition argument.

Formalization Note The path is a total function on R\mathbb RR restricted to [c,d][c,d][c,d]; the oscillation is an extended nonnegative supremum.

Preamble
import Mathlib
import Definitions.Def_WhittFLT_Composition_SkorohodD
Formal statement
namespace WhittFLT.Reflection

open Set Filter Topology
open scoped ENNReal

/-- Billingsley (1968), Lemma 1, p. 110, as cited in Whitt's proof of Theorem 4.1, p. 79. -/
theorem billingsley_lemma_1 {S : Type*} [MetricSpace S] (c d : ℝ) (hcd : c < d)
    (x : ℝ → S) (hx : WhittFLT.Composition.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.Reflection
Source
Whitt, Some Useful Functions for Functional Limit Theorems, Math. Oper. Res. 5(1) (1980), §4, proof of Theorem 4.1, p. 79; citing Billingsley (1968), Lemma 1, p. 110
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me