Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — for nondecreasing random sequences, tight ⇔ weakly convergent ⇔ convergent in probability; a.s. convergence is equivalent for all such sequences iff (17)

Proved
StochIneqPO.Monotone.theorem6

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

almost-sure-convergenceconvergence-in-probabilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1partially-ordered-spacestochastic-ordertightnessweak-convergence

Let EEE be a Polish space with metric ddd (a complete separable metric space), endowed with a closed partial ordering ≤\le≤ and its Borel σ\sigmaσ-algebra.

First part. 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 random variables with X1≤X2≤⋯X_1\le X_2\le\cdotsX1​≤X2​≤⋯ (pointwise on Ω\OmegaΩ), with distributions Pi=μ∘Xi−1P_i=\mu\circ X_i^{-1}Pi​=μ∘Xi−1​. Then the following conditions are equivalent:

  1. the family {Pi:i≥1}\{P_i : i\ge1\}{Pi​:i≥1} is tight;
  2. {Pi:i≥1}\{P_i : i\ge1\}{Pi​:i≥1} converges weakly to a probability measure;
  3. {Xi:i≥1}\{X_i : i\ge1\}{Xi​:i≥1} converges in probability.

Second part. The condition

  1. {Xi:i≥1}\{X_i : i\ge 1\}{Xi​:i≥1} converges almost surely

is also equivalent (to 3, and hence to 1 and 2) for all nondecreasing sequences {Xi}\{X_i\}{Xi​} on all probability spaces if and only if EEE satisfies condition (17):

xn≤yn≤xn+1 (n≥1),xn→z∈E⟹yn→z.x_n\le y_n\le x_{n+1}\ (n\ge1),\quad x_n\to z\in E\quad\Longrightarrow\quad y_n\to z .xn​≤yn​≤xn+1​ (n≥1),xn​→z∈E⟹yn​→z.

The theorem says that for monotone sequences in an ordered Polish space the weak and the in-probability modes of convergence coincide, so that tightness of the marginal laws alone already yields a limiting random variable; and it characterises, by an intrinsic property of the ordered space, when the strongest mode, almost sure convergence, joins them.

Formalization Note The closed partial ordering is Mathlib's OrderClosedTopology; separability is second countability. The modes (i)–(iv) are those of the definition file ConvergenceModes (weak convergence through integrals of bounded continuous functions against a probability-measure limit; convergence in probability to a measurable limit). The first part is stated for probability spaces in an arbitrary universe; in the second part the quantifier over probability spaces ranges over Type, and "(iv) is also equivalent" is encoded as "(iv) ⇔\Leftrightarrow⇔ (iii)" for every pointwise nondecreasing sequence of measurable maps on every such space; the quantifier over all sequences is essential, since for one fixed sequence the "only if" direction is false. Sequences are indexed from 000.

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

open MeasureTheory

universe u

theorem theorem6 {E : Type*} [MetricSpace E] [CompleteSpace E]
    [SecondCountableTopology E] [MeasurableSpace E] [BorelSpace E]
    [PartialOrder E] [OrderClosedTopology E] :
    (∀ (Ω : Type u) [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
        (X : ℕ → Ω → E), (∀ i, Measurable (X i)) → (∀ ω, Monotone fun i => X i ω) →
        List.TFAE [LawsTight μ X, LawsConvergeWeakly μ X, ConvergesInProbability μ X]) ∧
    (Regular17 E ↔
      ∀ (Ω : Type) [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
        (X : ℕ → Ω → E), (∀ i, Measurable (X i)) → (∀ ω, Monotone fun i => X i ω) →
        (ConvergesAS μ X ↔ ConvergesInProbability μ X)) := by sorry

end StochIneqPO.Monotone
Source
Kamae, Krengel, O'Brien, Stochastic Inequalities on Partially Ordered Spaces, Ann. Probab. 5 (1977), Theorem 6 (with condition (17)), 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