Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.8 — lower bound on the expected-scale criterion

Proved
GlynnSTS.Length.theorem_4_8

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

expected-lengthlower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simulation-output-analysisstandardized-time-series

Let BBB be standard Brownian motion, g∈Mg\in\mathcal Mg∈M, and 0<δ<10<\delta<10<δ<1. Let zzz satisfy H(z)=1−δ/2H(z)=1-\delta/2H(z)=1−δ/2, and let ppp satisfy Φ(p)=1−δ/2\Phi(p)=1-\delta/2Φ(p)=1−δ/2 for the standard normal distribution function Φ\PhiΦ. Then

E[g(B)] z≥p=Φ−1(1−δ/2).E[g(B)]\,z\ge p=\Phi^{-1}(1-\delta/2).E[g(B)]z≥p=Φ−1(1−δ/2).

This is the distributional lower bound that controls every STS interval's asymptotic expected width.

Formalization Note The expectation is an extended nonnegative integral; the normal and STS quantiles are specified by equations, avoiding an infimum default value.

Preamble
import Mathlib
import Definitions.Def_GlynnSTS_Length_Setting

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

/-- Theorem 4.8, p. 10: the expected Brownian scale times its upper quantile is at least the normal quantile. -/
theorem theorem_4_8 {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (B : Ω → C(unitInterval, ℝ)) (hB : GlynnSTS.Limit.IsStdBMC P B)
    (g : C(unitInterval, ℝ) → ℝ) (hg : GlynnSTS.Limit.ClassM P B g)
    (δ : ℝ) (hδ0 : 0 < δ) (hδ1 : δ < 1)
    (z : ℝ) (hz : H P B g z = 1 - δ / 2)
    (p : ℝ) (hp : cdf (gaussianReal 0 1) p = 1 - δ / 2) :
    ENNReal.ofReal p ≤
      (∫⁻ ω, ENNReal.ofReal (g (B ω)) ∂P) * ENNReal.ofReal z := by sorry

end GlynnSTS.Length
Source
Glynn & Iglehart, Simulation output analysis using standardized time series, Math. Oper. Res. 15 (1990), p. 10, Theorem 4.8; proof pp. 11–12
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