Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.4, p. 3 — by (2.3i), h(σB) = B(1)/g(B)

Proved
GlynnSTS.Limit.hmap_sigmaB

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

homogeneityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1standardized-time-series

Let g:C[0,1]→Rg : C[0,1] \to \mathbb Rg:C[0,1]→R satisfy (2.3i), g(αx)=αg(x)g(\alpha x) = \alpha g(x)g(αx)=αg(x) for all α>0\alpha > 0α>0 and x∈C[0,1]x \in C[0,1]x∈C[0,1], 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, h(x)=0h(x) = 0h(x)=0 otherwise. For every σ>0\sigma > 0σ>0 and every path B(ω)B(\omega)B(ω),

h(σB)=B(1)g(B).h(\sigma B) = \frac{B(1)}{g(B)}.h(σB)=g(B)B(1)​.

This identifies the limit in the continuous-mapping step of the proof of Theorem 2.4: the scale σ\sigmaσ cancels.

Formalization Note Only (2.3i) is assumed, which makes the statement stronger than its use in the paper. The identity holds for every ω\omegaω; where g(B(ω))=0g(B(\omega)) = 0g(B(ω))=0, both sides are 000 (the right-hand side because Lean's division by zero returns 000).

Preamble
import Mathlib
import Definitions.Def_GlynnSTS_Limit_Setting

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

theorem hmap_sigmaB {Ω : Type*} (B : Ω → C(unitInterval, ℝ)) (g : C(unitInterval, ℝ) → ℝ)
    (hhom : ∀ a : ℝ, 0 < a → ∀ x, g (a • x) = a * g x) (σ : ℝ) (hσ : 0 < σ) :
    ∀ ω, hmap g (σ • B ω) = B ω 1 / g (B ω) := 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