Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — six equivalent characterizations of P1≺P2P_1 \prec P_2P1​≺P2​ (Strassen)

Proved
StochIneqPO.Comparison.theorem1_tfae

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

couplingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1partially-ordered-spacestochastic-orderstrassen-theorem

Let EEE be a partially ordered Polish space: a Polish space with a closed partial order ≤\le≤ and its Borel σ\sigmaσ-algebra. Let P1,P2P_1, P_2P1​,P2​ be probability measures on EEE. The following six conditions are equivalent.

  1. P1≺P2P_1 \prec P_2P1​≺P2​.
  2. There is a probability measure λ\lambdaλ on E×EE \times EE×E with support in K={(x,y):x≤y}K = \{(x,y) : x \le y\}K={(x,y):x≤y}, first marginal P1P_1P1​ and second marginal P2P_2P2​.
  3. There are a real random variable ZZZ (on some probability space) and measurable maps f,g:R→Ef, g : \mathbb R \to Ef,g:R→E with f(t)≤g(t)f(t) \le g(t)f(t)≤g(t) for all ttt, such that f(Z)f(Z)f(Z) has law P1P_1P1​ and g(Z)g(Z)g(Z) has law P2P_2P2​.
  4. There are EEE-valued random variables X1,X2X_1, X_2X1​,X2​ on a common probability space with X1≤X2X_1 \le X_2X1​≤X2​ almost surely and Xi∼PiX_i \sim P_iXi​∼Pi​ (i=1,2i = 1, 2i=1,2).
  5. There is an upward stochastic kernel kkk on E×EE \times EE×E with P2=P1kP_2 = P_1^{k}P2​=P1k​, the second marginal of P1∗kP_1 * kP1​∗k.
  6. P1(B)≤P2(B)P_1(B) \le P_2(B)P1​(B)≤P2​(B) for every closed increasing set B⊆EB \subseteq EB⊆E.

The equivalence (i) ⇔\Leftrightarrow⇔ (iv) is the monotone coupling characterization of the stochastic order; (i) ⇒\Rightarrow⇒ (ii) is a special case of Strassen's theorem (1965). Every comparison result of the paper reduces to this theorem. The platform item PalmQueueing.Ordering.strassen_st is the special case (i) ⇔\Leftrightarrow⇔ (iv) for E=RnE = \mathbb R^nE=Rn with the coordinatewise order.

Formalization Note "Partially ordered Polish space" is [PolishSpace E] [BorelSpace E] [PartialOrder E] [OrderClosedTopology E] (the order's graph is closed). Random variables live on some probability space Ω : Type. "Support in KKK" is λ(Kc)=0\lambda(K^{\mathrm c}) = 0λ(Kc)=0; "f≤gf \le gf≤g" is pointwise on all of R\mathbb RR; P1kP_1^kP1k​ is (P₁ ⊗ₘ k).snd; the kernel in (v) is a Markov kernel. A closed set is Borel, so (vi) needs no separate measurability hypothesis.

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

open MeasureTheory ProbabilityTheory

theorem theorem1_tfae {E : Type*} [TopologicalSpace E] [PolishSpace E] [MeasurableSpace E]
    [BorelSpace E] [PartialOrder E] [OrderClosedTopology E]
    (P₁ P₂ : Measure E) [IsProbabilityMeasure P₁] [IsProbabilityMeasure P₂] :
    List.TFAE
      [ -- (i)
        StochLE P₁ P₂,
        -- (ii)
        ∃ lam : Measure (E × E), IsProbabilityMeasure lam ∧ lam {z : E × E | z.1 ≤ z.2}ᶜ = 0 ∧
          lam.map Prod.fst = P₁ ∧ lam.map Prod.snd = P₂,
        -- (iii)
        ∃ (Ω : Type) (_ : MeasurableSpace Ω) (μ : Measure Ω), IsProbabilityMeasure μ ∧
          ∃ (Z : Ω → ℝ) (f g : ℝ → E), Measurable Z ∧ Measurable f ∧ Measurable g ∧
            (∀ t, f t ≤ g t) ∧ μ.map (fun ω => f (Z ω)) = P₁ ∧ μ.map (fun ω => g (Z ω)) = P₂,
        -- (iv)
        ∃ (Ω : Type) (_ : MeasurableSpace Ω) (μ : Measure Ω), IsProbabilityMeasure μ ∧
          ∃ X₁ X₂ : Ω → E, Measurable X₁ ∧ Measurable X₂ ∧ (∀ᵐ ω ∂μ, X₁ ω ≤ X₂ ω) ∧
            μ.map X₁ = P₁ ∧ μ.map X₂ = P₂,
        -- (v)
        ∃ k : Kernel E E, IsMarkovKernel k ∧ IsUpward k ∧ P₂ = (P₁ ⊗ₘ k).snd,
        -- (vi)
        ∀ B : Set E, IsClosed B → IsUpperSet B → P₁ B ≤ P₂ B ] := by sorry

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

  • Endorsed by iris · Nov 12, 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