Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.4, p. 3 — for g ∈ 𝓜, (ÈČₙ(1) − ÎŒ)/g(ÈČₙ) ⇒ B(1)/g(B) under Assumption (2.1)

Proved
GlynnSTS.Limit.theorem_2_4

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

confidence-intervalp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simulation-output-analysisstandardized-time-seriesweak-convergence

Let Y={Y(t):t≄0}Y = \{Y(t) : t \ge 0\}Y={Y(t):t≄0} be a real-valued measurable process, Yˉn(t)=1n∫0ntY(s) ds\bar Y_n(t) = \frac1n\int_0^{nt}Y(s)\,dsYˉn​(t)=n1​∫0nt​Y(s)ds for 0≀t≀10 \le t \le 10≀t≀1, and suppose Assumption (2.1) holds: for finite constants ÎŒ\muÎŒ and σ>0\sigma > 0σ>0, Xn=n1/2(Yˉn−Όk)⇒σBX_n = n^{1/2}(\bar Y_n - \mu k) \Rightarrow \sigma BXn​=n1/2(Yˉn​−Όk)⇒σB in C[0,1]C[0,1]C[0,1], where BBB is a standard Brownian motion and k(t)=tk(t) = tk(t)=t. Let g∈Mg \in \mathcal Mg∈M, i.e. g:C[0,1]→Rg : C[0,1] \to \mathbb Rg:C[0,1]→R is measurable and (i) g(αx)=αg(x)g(\alpha x) = \alpha g(x)g(αx)=αg(x) for α>0\alpha > 0α>0; (ii) g(x−ÎČk)=g(x)g(x - \beta k) = g(x)g(x−ÎČk)=g(x) for ÎČ∈R\beta \in \mathbb RÎČ∈R; (iii) P{g(B)>0}=1P\{g(B) > 0\} = 1P{g(B)>0}=1; (iv) P{B∈D(g)}=0P\{B \in D(g)\} = 0P{B∈D(g)}=0. Then

Yˉn(1)−Όg(Yˉn)⇒B(1)g(B)(n→∞).\frac{\bar Y_n(1) - \mu}{g(\bar Y_n)} \Rightarrow \frac{B(1)}{g(B)}\qquad (n \to \infty).g(Yˉn​)Yˉn​(1)−Ό​⇒g(B)B(1)​(n→∞).

This is display (2.5), the basic limit theorem of the method of standardized time series. The unknown variance constant σ\sigmaσ does not appear in the limit, so quantiles of B(1)/g(B)B(1)/g(B)B(1)/g(B) give asymptotic confidence intervals for the steady-state mean ÎŒ\muÎŒ without estimating σ\sigmaσ.

Formalization Note Convergence in distribution is Mathlib's TendstoInDistribution. Division by zero returns 000 in Lean; this affects only the event {g(Yˉn)=0}\{g(\bar Y_n) = 0\}{g(Yˉn​)=0} and, in the limit, the null event {g(B)=0}\{g(B) = 0\}{g(B)=0}, and matches the paper's convention for hhh in the proof.

Preamble
import Mathlib
import Definitions.Def_GlynnSTS_Limit_Setting

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

theorem theorem_2_4 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (B : Ω → C(unitInterval, ℝ)) (hB : IsStdBMC P B)
    (Y : ℝ → Ω → ℝ) (Ybar : ℕ → Ω → C(unitInterval, ℝ)) (ÎŒ σ : ℝ)
    (h21 : Assumption21 P Y Ybar ÎŒ σ B)
    (g : C(unitInterval, ℝ) → ℝ) (hg : ClassM P B g) :
    TendstoInDistribution (fun (n : ℕ) ω => (Ybar n ω 1 - ÎŒ) / g (Ybar n ω)) atTop
      (fun ω => B ω 1 / g (B ω)) (fun _ => P) P := by sorry

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