Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 8 — stationary coupling attains d̄

Proved
StochIneqPO.DBar.dbar_attained

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

optimal-couplingornstein-distancep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stationary-process

Let P,QP,QP,Q be stationary laws of real-valued two-sided processes, with integrable time-zero coordinates. There exists a stationary coupling ν\nuν of P,QP,QP,Q that attains the defining infimum:

dˉ(P,Q)=∫∣ω10−ω20∣ ν(dω1,dω2).\bar d(P,Q)=\int|\omega_1^0-\omega_2^0|\,\nu(d\omega_1,d\omega_2).dˉ(P,Q)=∫∣ω10​−ω20​∣ν(dω1​,dω2​).

This is the attainment claim stated in the proof of Theorem 8. It makes the lower-law construction applicable to an optimal coupling.

Preamble
import Mathlib
import Definitions.Def_StochIneqPO_DBar_IsShiftInvariant
import Definitions.Def_StochIneqPO_DBar_dbar
Formal statement
namespace StochIneqPO.DBar

open MeasureTheory

/-- The attainment display in the proof of Theorem 8, pp. 910–911. -/
theorem dbar_attained
    (P Q : Measure (ℤ → ℝ))
    (hP : IsShiftInvariant P) (hQ : IsShiftInvariant Q)
    (hPi : Integrable (fun ω : ℤ → ℝ => ω 0) P)
    (hQi : Integrable (fun ω : ℤ → ℝ => ω 0) Q) :
    ∃ ν : Measure ((ℤ → ℝ) × (ℤ → ℝ)),
      IsPairShiftInvariant ν ∧ ν.map Prod.fst = P ∧ ν.map Prod.snd = Q ∧
      dbar P Q = ∫ z, |z.1 0 - z.2 0| ∂ν := by sorry

end StochIneqPO.DBar
Source
Kamae, Krengel, O'Brien, Stochastic Inequalities on Partially Ordered Spaces, Ann. Probab. 5 (1977), proof of Theorem 8, pp. 910–911 (PDF pp. 12–13), attainment display
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