Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.4, p. 3 β€” P{ΟƒB ∈ D(h)} = 0 for g ∈ π“œ

Proved
GlynnSTS.Limit.sigmaB_mem_D_hmap_null

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

brownian-motioncontinuous-mappingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1standardized-time-series

Let BBB be a standard Brownian motion in C[0,1]C[0,1]C[0,1] on (Ξ©,F,P)(\Omega,\mathcal F,P)(Ξ©,F,P), let g∈Mg \in \mathcal Mg∈M (the class of (2.3)), and let h(x)=x(1)/g(x)h(x) = x(1)/g(x)h(x)=x(1)/g(x) for g(x)β‰ 0g(x) \ne 0g(x)ξ€ =0 and h(x)=0h(x) = 0h(x)=0 otherwise. For every Οƒ>0\sigma > 0Οƒ>0,

P{ΟƒB∈D(h)}=0,P\{\sigma B \in D(h)\} = 0,P{ΟƒB∈D(h)}=0,

where D(h)D(h)D(h) is the set of discontinuity points of hhh.

This is the hypothesis of the continuous mapping theorem in the proof of Theorem 2.4: it shows that hhh is almost surely continuous at the limit σB\sigma BσB of Assumption (2.1).

Formalization Note PPP of the set {Ο‰:ΟƒB(Ο‰)∈D(h)}\{\omega : \sigma B(\omega) \in D(h)\}{Ο‰:ΟƒB(Ο‰)∈D(h)} is its outer measure, so no measurability of D(h)D(h)D(h) is assumed.

Preamble
import Mathlib
import Definitions.Def_GlynnSTS_Limit_Setting

open MeasureTheory ProbabilityTheory Filter Topology
open scoped NNReal ENNReal
Formal statement
namespace GlynnSTS.Limit

theorem sigmaB_mem_D_hmap_null {Ξ© : Type*} [MeasurableSpace Ξ©] (P : Measure Ξ©)
    [IsProbabilityMeasure P] (B : Ξ© β†’ C(unitInterval, ℝ)) (hB : IsStdBMC P B)
    (g : C(unitInterval, ℝ) β†’ ℝ) (hg : ClassM P B g) (Οƒ : ℝ) (hΟƒ : 0 < Οƒ) :
    P {Ο‰ | Οƒ β€’ B Ο‰ ∈ D (hmap g)} = 0 := by sorry

end GlynnSTS.Limit
Source
Glynn & Iglehart, Simulation output analysis using standardized time series, Math. Oper. Res. 15 (1990), p. 3, proof of Theorem 2.4
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