Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — P1∗p2∗⋯∗pn≺Q1∗q2∗⋯∗qnP_1 * p_2 * \cdots * p_n \prec Q_1 * q_2 * \cdots * q_nP1​∗p2​∗⋯∗pn​≺Q1​∗q2​∗⋯∗qn​ when P1≺Q1P_1 \prec Q_1P1​≺Q1​ and the kernels are ordered

Proved
StochIneqPO.Comparison.prop1_iterProd_le

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

kernelp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-measurestochastic-order

Let E1,E2,…,EnE_1, E_2, \dots, E_nE1​,E2​,…,En​ be partially ordered Polish spaces, with Ei=E1×⋯×EiE^{i} = E_1 \times \cdots \times E_iEi=E1​×⋯×Ei​ carrying the product topology and the coordinatewise order. Let P1,Q1P_1, Q_1P1​,Q1​ be probability measures on E1E_1E1​ with P1≺Q1P_1 \prec Q_1P1​≺Q1​, and for i=2,…,ni = 2, \dots, ni=2,…,n let pi,qip_i, q_ipi​,qi​ be stochastic kernels from Ei−1E^{i-1}Ei−1 to EiE_iEi​ such that

pi(xi−1,⋅)≺qi(yi−1,⋅)whenever xi−1≤yi−1.(1)p_i(x^{i-1}, \cdot) \prec q_i(y^{i-1}, \cdot) \qquad \text{whenever } x^{i-1} \le y^{i-1}. \tag{1}pi​(xi−1,⋅)≺qi​(yi−1,⋅)whenever xi−1≤yi−1.(1)

Then

P1∗p2∗⋯∗pn  ≺  Q1∗q2∗⋯∗qn(2)P_1 * p_2 * \cdots * p_n \;\prec\; Q_1 * q_2 * \cdots * q_n \tag{2}P1​∗p2​∗⋯∗pn​≺Q1​∗q2​∗⋯∗qn​(2)

as probability measures on the partially ordered Polish space EnE^{n}En.

This is the finite-horizon comparison of two processes built from ordered initial laws and ordered transition kernels; Theorem 2 passes to the limit n→∞n \to \inftyn→∞.

Formalization Note Indices are 0-based: the paper's EiE_iEi​ is E (i - 1), the paper's kernel pip_ipi​ (i≥2i \ge 2i≥2) is p (i - 2), and the paper's nnn is m + 1, so the conclusion is StochLE (iterProd P₁ p m) (iterProd Q₁ q m). Hypothesis (1) is required exactly for the kernels that enter the product (n < m in Lean), pointwise for all ordered pairs of histories. The kernel families are indexed by all of N\mathbb NN (Mathlib's Ionescu-Tulcea API); kernels beyond the horizon play no role.

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

open MeasureTheory ProbabilityTheory Finset

theorem prop1_iterProd_le {E : ℕ → Type*} [∀ n, TopologicalSpace (E n)] [∀ n, PolishSpace (E n)]
    [∀ n, MeasurableSpace (E n)] [∀ n, BorelSpace (E n)] [∀ n, PartialOrder (E n)]
    [∀ n, OrderClosedTopology (E n)]
    (P₁ Q₁ : Measure (E 0)) [IsProbabilityMeasure P₁] [IsProbabilityMeasure Q₁]
    (p q : (n : ℕ) → Kernel (Π i : Iic n, E i) (E (n + 1)))
    [∀ n, IsMarkovKernel (p n)] [∀ n, IsMarkovKernel (q n)]
    (m : ℕ) (hPQ : StochLE P₁ Q₁)
    (hpq : ∀ n < m, ∀ x y : Π i : Iic n, E i, x ≤ y → StochLE (p n x) (q n y)) :
    StochLE (iterProd P₁ p m) (iterProd Q₁ q m) := by sorry

end StochIneqPO.Comparison
Source
Kamae, Krengel, O'Brien, Stochastic Inequalities on Partially Ordered Spaces, Ann. Probab. 5 (1977), Proposition 1, eqs. (1)–(2), pp. 901–902 (PDF pp. 3–4)
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