Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 — stationary monotone coupling

Proved
StochIneqPO.DBar.theorem7_stationary_coupling

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

couplingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stationary-processstochastic-order

Let EEE be a partially ordered Polish space with a closed order and Borel measurable structure. Let P,QP,QP,Q be stationary probability laws on EZE^{\mathbb Z}EZ, with its coordinatewise order, and suppose P≺QP\prec QP≺Q. Then there is a stationary probability law ν\nuν on pairs of paths whose marginals are P,QP,QP,Q and which concentrates on ordered pairs:

ν{(ω1,ω2):ω1≤ω2}=1.\nu\{(\omega_1,\omega_2):\omega_1\leq\omega_2\}=1.ν{(ω1​,ω2​):ω1​≤ω2​}=1.

This supplies the ordered stationary coupling used in Lemma 3. The paper derives it from its general coupling characterization, Theorem 1(ii).

Preamble
import Mathlib
import Definitions.Def_StochIneqPO_Comparison_StochLE
import Definitions.Def_StochIneqPO_DBar_IsShiftInvariant
import Definitions.Def_StochIneqPO_DBar_IsPairShiftInvariant
Formal statement
namespace StochIneqPO.DBar

open MeasureTheory

/-- Theorem 7, p. 909: stationary laws ordered stochastically admit a stationary monotone coupling. -/
theorem theorem7_stationary_coupling
    {E : Type*} [TopologicalSpace E] [PolishSpace E]
    [MeasurableSpace E] [BorelSpace E] [PartialOrder E] [OrderClosedTopology E]
    (P Q : Measure (ℤ → E))
    (hP : IsShiftInvariant P) (hQ : IsShiftInvariant Q)
    (hPQ : StochIneqPO.Comparison.StochLE P Q) :
    ∃ ν : Measure ((ℤ → E) × (ℤ → E)),
      IsPairShiftInvariant ν ∧ ν.map Prod.fst = P ∧ ν.map Prod.snd = Q ∧
      (∀ᵐ z ∂ν, z.1 ≤ z.2) := by sorry

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