Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6, p. 909 — if (17) fails, some nondecreasing sequence converges in probability but not almost surely

Proved
StochIneqPO.Monotone.exists_counterexample_of_not_regular17

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

almost-sure-convergenceconvergence-in-probabilitycounterexamplemonotone-sequencep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let EEE be a complete separable metric space with a closed partial ordering ≤\le≤ and its Borel σ\sigmaσ-algebra, and suppose that EEE does not satisfy condition (17). Then there exist a probability space (Ω,F,μ)(\Omega,\mathcal F,\mu)(Ω,F,μ) and measurable maps X1,X2,⋯:Ω→EX_1,X_2,\dots:\Omega\to EX1​,X2​,⋯:Ω→E with X1(ω)≤X2(ω)≤⋯X_1(\omega)\le X_2(\omega)\le\cdotsX1​(ω)≤X2​(ω)≤⋯ for every ω\omegaω, such that

  1. (Xn)(X_n)(Xn​) converges in probability to a constant: there is z∈Ez\in Ez∈E with μ{ω:d(Xn(ω),z)≥ε}→0\mu\{\omega : d(X_n(\omega),z)\ge\varepsilon\}\to0μ{ω:d(Xn​(ω),z)≥ε}→0 for every ε>0\varepsilon>0ε>0;
  2. (Xn)(X_n)(Xn​) does not converge almost surely: there is no Y:Ω→EY:\Omega\to EY:Ω→E with Xn(ω)→Y(ω)X_n(\omega)\to Y(\omega)Xn​(ω)→Y(ω) for μ\muμ-almost every ω\omegaω.

This is the "only if" half of the second part of Theorem 6: without (17), almost sure convergence is not equivalent to the other three modes for all nondecreasing sequences.

Formalization Note The paper says "take any probability space" carrying events CiC_iCi​ with μ(Ci)→0\mu(C_i)\to0μ(Ci​)→0 and μ(Ci infinitely often)=1\mu(C_i \text{ infinitely often})=1μ(Ci​ infinitely often)=1; such events do not exist on every probability space (e.g. a one-point space), so the statement asserts the existence of a suitable probability space, which is what the argument establishes. The probability space is taken in Lean's lowest universe Type.

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

open MeasureTheory Filter

theorem exists_counterexample_of_not_regular17 {E : Type*} [MetricSpace E] [CompleteSpace E]
    [SecondCountableTopology E] [MeasurableSpace E] [BorelSpace E]
    [PartialOrder E] [OrderClosedTopology E]
    (h17 : ¬ Regular17 E) :
    ∃ (Ω : Type) (_ : MeasurableSpace Ω) (μ : Measure Ω), IsProbabilityMeasure μ ∧
      ∃ X : ℕ → Ω → E, (∀ i, Measurable (X i)) ∧ (∀ ω, Monotone fun i => X i ω) ∧
        (∃ z : E, TendstoInMeasure μ X atTop (fun _ => z)) ∧ ¬ ConvergesAS μ 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, failure of (17), p. 909 (PDF p. 11)
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