Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6, p. 908 — a tight nondecreasing random sequence converges in probability

Proved
StochIneqPO.Monotone.tight_imp_tendstoInMeasure

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

convergence-in-probabilitymonotone-sequencep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1partially-ordered-spacetightness

Let EEE be a complete separable metric space (a Polish space with metric ddd) endowed with a closed partial ordering ≤\le≤ (the set {(x,y):x≤y}\{(x,y): x\le y\}{(x,y):x≤y} is closed in E×EE\times EE×E) and its Borel σ\sigmaσ-algebra. Let (Ω,F,μ)(\Omega,\mathcal F,\mu)(Ω,F,μ) be a probability space and let X1,X2,⋯:Ω→EX_1,X_2,\dots:\Omega\to EX1​,X2​,⋯:Ω→E be measurable with

X1(ω)≤X2(ω)≤⋯for every ω∈Ω.X_1(\omega)\le X_2(\omega)\le\cdots\qquad\text{for every }\omega\in\Omega .X1​(ω)≤X2​(ω)≤⋯for every ω∈Ω.

If the family of distributions {Pi=μ∘Xi−1:i≥1}\{P_i=\mu\circ X_i^{-1} : i\ge1\}{Pi​=μ∘Xi−1​:i≥1} is tight, then (Xi)(X_i)(Xi​) converges in probability: there is a measurable Y:Ω→EY:\Omega\to EY:Ω→E with

μ{ω:d(Xi(ω),Y(ω))≥ε}  ⟶  0(i→∞)for every ε>0.\mu\{\omega : d(X_i(\omega),Y(\omega))\ge\varepsilon\}\;\longrightarrow\;0\qquad(i\to\infty)\quad\text{for every }\varepsilon>0 .μ{ω:d(Xi​(ω),Y(ω))≥ε}⟶0(i→∞)for every ε>0.

This is the implication (i) ⇒\Rightarrow⇒ (iii) of Theorem 6, the substantial step of its first part; together with the standard implications (iii) ⇒\Rightarrow⇒ (ii) ⇒\Rightarrow⇒ (i) it gives the equivalence of tightness, weak convergence and convergence in probability for monotone sequences.

Formalization Note The closed partial ordering is Mathlib's OrderClosedTopology. Separability is stated as second countability, which is equivalent for metric spaces. The monotonicity X1≤X2≤⋯X_1\le X_2\le\cdotsX1​≤X2​≤⋯ is required for every ω\omegaω, as in the paper; an almost sure version is equivalent after modifying the XiX_iXi​ on a null set. The sequence index starts at 000 in Lean.

Preamble
import Mathlib
import Definitions.Def_StochIneqPO_Monotone_Regular17
import Definitions.Def_StochIneqPO_Monotone_ConvergenceModes
Formal statement
namespace StochIneqPO.Monotone

open MeasureTheory

theorem tight_imp_tendstoInMeasure {E : Type*} [MetricSpace E] [CompleteSpace E]
    [SecondCountableTopology E] [MeasurableSpace E] [BorelSpace E]
    [PartialOrder E] [OrderClosedTopology E]
    {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    (X : ℕ → Ω → E) (hX : ∀ i, Measurable (X i)) (hmono : ∀ ω, Monotone fun i => X i ω)
    (htight : LawsTight μ X) :
    ConvergesInProbability μ X := by sorry

end StochIneqPO.Monotone
Source
Kamae, Krengel, O'Brien, Stochastic Inequalities on Partially Ordered Spaces, Ann. Probab. 5 (1977), Proof of Theorem 6, (i) ⇒ (iii), p. 908 (PDF p. 10)
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