Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4 — P1≺P2≺⋯P_1 \prec P_2 \prec \cdotsP1​≺P2​≺⋯ iff a.s. nondecreasing random elements with these laws exist

Proved
StochIneqPO.Comparison.prop4_tfae

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

couplingmonotone-sequencesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-order

Let EEE be a partially ordered Polish space and (P1,P2,… )(P_1, P_2, \dots)(P1​,P2​,…) a sequence of probability measures on EEE. The following are equivalent.

  1. P1≺P2≺P3≺⋯P_1 \prec P_2 \prec P_3 \prec \cdotsP1​≺P2​≺P3​≺⋯.
  2. There are random elements X1,X2,…X_1, X_2, \dotsX1​,X2​,… in EEE defined on a common probability space such that X1≤X2≤⋯X_1 \le X_2 \le \cdotsX1​≤X2​≤⋯ almost surely and XiX_iXi​ has law PiP_iPi​ for every iii.
  3. There are a real random variable ZZZ and measurable maps fi:R→Ef_i : \mathbb R \to Efi​:R→E with f1≤f2≤⋯f_1 \le f_2 \le \cdotsf1​≤f2​≤⋯ (pointwise) such that PiP_iPi​ is the law of fi(Z)f_i(Z)fi​(Z) for every iii.

This extends Theorem 1 from a pair of measures to a whole chain.

Formalization Note The sequence is indexed from 000. "X1≤X2≤⋯X_1 \le X_2 \le \cdotsX1​≤X2​≤⋯ a.s." is a single almost-sure event on which Xi≤Xi+1X_i \le X_{i+1}Xi​≤Xi+1​ for all iii. Measurability of the fif_ifi​ is the paper's standing convention (Sec. 1). The probability space is some Ω : Type.

Preamble
import Mathlib
import Definitions.Def_StochIneqPO_Comparison_StochLE
Formal statement
namespace StochIneqPO.Comparison

open MeasureTheory ProbabilityTheory

theorem prop4_tfae {E : Type*} [TopologicalSpace E] [PolishSpace E] [MeasurableSpace E]
    [BorelSpace E] [PartialOrder E] [OrderClosedTopology E]
    (P : ℕ → Measure E) [∀ i, IsProbabilityMeasure (P i)] :
    List.TFAE
      [ -- (i)
        ∀ i, StochLE (P i) (P (i + 1)),
        -- (ii)
        ∃ (Ω : Type) (_ : MeasurableSpace Ω) (μ : Measure Ω), IsProbabilityMeasure μ ∧
          ∃ X : ℕ → Ω → E, (∀ i, Measurable (X i)) ∧ (∀ᵐ ω ∂μ, ∀ i, X i ω ≤ X (i + 1) ω) ∧
            ∀ i, μ.map (X i) = P i,
        -- (iii)
        ∃ (Ω : Type) (_ : MeasurableSpace Ω) (μ : Measure Ω), IsProbabilityMeasure μ ∧
          ∃ (Z : Ω → ℝ) (f : ℕ → ℝ → E), Measurable Z ∧ (∀ i, Measurable (f i)) ∧
            (∀ i t, f i t ≤ f (i + 1) t) ∧ ∀ i, μ.map (fun ω => f i (Z ω)) = P i ] := by sorry

end StochIneqPO.Comparison
Source
Kamae, Krengel, O'Brien, Stochastic Inequalities on Partially Ordered Spaces, Ann. Probab. 5 (1977), Proposition 4, p. 907 (PDF p. 9)
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