Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4.26, p. 14 — (2.3i) and (4.25) force g to be discontinuous on all of C₀[0,1]

Proved
GlynnSTS.NoAttain.C0_subset_D

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

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

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 g:C[0,1]→Rg: C[0,1]\to\mathbb Rg:C[0,1]→R be positively homogeneous, g(ax)=a g(x)g(ax)=a\,g(x)g(ax)=ag(x) for a>0a>0a>0 (condition (2.3i)), and suppose that for some σ>0\sigma>0σ>0 and α>0\alpha>0α>0

P{g(σB)=ασ}=1(4.25).P\{g(\sigma B)=\alpha\sigma\}=1 \qquad (4.25).P{g(σB)=ασ}=1(4.25).

Then ggg is discontinuous at every point of C0[0,1]={x∈C[0,1]:x(0)=0}C_0[0,1]=\{x\in C[0,1]: x(0)=0\}C0​[0,1]={x∈C[0,1]:x(0)=0}:

C0[0,1]⊆D(g).C_0[0,1]\subseteq D(g).C0​[0,1]⊆D(g).

Since B∈C0[0,1]B\in C_0[0,1]B∈C0​[0,1] almost surely, this gives P{B∈D(g)}=1P\{B\in D(g)\}=1P{B∈D(g)}=1, contradicting (2.3iv); this is the "something stronger" announced at the start of the proof of Proposition 4.26.

Formalization Note The paper concludes "D(g)=C0[0,1]D(g)=C_0[0,1]D(g)=C0​[0,1]", but its argument proves only the inclusion C0[0,1]⊆D(g)C_0[0,1]\subseteq D(g)C0​[0,1]⊆D(g) (D(g)D(g)D(g) may also contain paths with x(0)≠0x(0)\ne0x(0)=0); the inclusion is what is stated, and it suffices for the contradiction. Only (2.3i) is assumed; the remaining conditions of M\mathcal MM are not needed, which makes the statement stronger.

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

open MeasureTheory ProbabilityTheory

/-- The conclusion of the proof of Proposition 4.26, p. 14, in the form the argument proves:
if `g` satisfies (2.3i) and (4.25) `P{g(σB) = ασ} = 1` for some `σ > 0` and `α > 0`, then `g`
is discontinuous at every point of `C₀[0,1]`. -/
theorem C0_subset_D {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (B : Ω → C(unitInterval, ℝ)) (hB : GlynnSTS.Limit.IsStdBMC P B)
    (g : C(unitInterval, ℝ) → ℝ)
    (hhom : ∀ a : ℝ, 0 < a → ∀ x, g (a • x) = a * g x)
    (σ α : ℝ) (hσ : 0 < σ) (hα : 0 < α)
    (h425 : ∀ᵐ ω ∂P, g (σ • B ω) = α * σ) :
    C0 ⊆ GlynnSTS.Limit.D g := by sorry

end GlynnSTS.NoAttain
Source
Glynn & Iglehart, Simulation output analysis using standardized time series, Math. Oper. Res. 15 (1990), p. 14, proof of Proposition 4.26 ("D(g) = C₀[0, 1]")
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