Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.27), p. 13 — P{ρ(σB, x) < ε} > 0 for every x ∈ C₀[0,1] and ε > 0

Proved
GlynnSTS.NoAttain.display_4_27

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

brownian-motionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1standardized-time-seriessupport

Let BBB be a standard Brownian motion on [0,1][0,1][0,1], regarded as a random element of C[0,1]C[0,1]C[0,1], let σ>0\sigma>0σ>0, and let ρ\rhoρ be the uniform metric on C[0,1]C[0,1]C[0,1]. For every x∈C0[0,1]={x∈C[0,1]:x(0)=0}x\in C_0[0,1]=\{x\in C[0,1]: x(0)=0\}x∈C0​[0,1]={x∈C[0,1]:x(0)=0} and every ε>0\varepsilon>0ε>0,

P{ρ(σB,x)<ε}>0.P\{\rho(\sigma B,x)<\varepsilon\}>0.P{ρ(σB,x)<ε}>0.

In words, every continuous path starting at 000 lies in the topological support of the law of σB\sigma BσB on C[0,1]C[0,1]C[0,1]. This is the first step of the proof of Proposition 4.26.

Formalization Note ρ\rhoρ is the distance of the sup norm on C(unitInterval, ℝ).

Preamble
import Mathlib
import Definitions.Def_GlynnSTS_NoAttain_Setting
Formal statement
namespace GlynnSTS.NoAttain

open MeasureTheory ProbabilityTheory

/-- Display (4.27), p. 13: for every `σ > 0`, every `x ∈ C₀[0,1]` and every `ε > 0`,
`P{ρ(σB, x) < ε} > 0`, where `ρ` is the uniform metric on `C[0,1]`. -/
theorem display_4_27 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (B : Ω → C(unitInterval, ℝ)) (hB : GlynnSTS.Limit.IsStdBMC P B)
    (σ : ℝ) (hσ : 0 < σ) :
    ∀ x ∈ C0, ∀ ε : ℝ, 0 < ε → 0 < P {ω | dist (σ • B ω) x < ε} := by sorry

end GlynnSTS.NoAttain
Source
Glynn & Iglehart, Simulation output analysis using standardized time series, Math. Oper. Res. 15 (1990), p. 13, (4.27) (proof of Proposition 4.26)
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