Proposition 1 — when and the kernels are ordered
ProvedStochIneqPO.Comparison.prop1_iterProd_leLet be partially ordered Polish spaces, with carrying the product topology and the coordinatewise order. Let be probability measures on with , and for let be stochastic kernels from to such that
Then
as probability measures on the partially ordered Polish space .
This is the finite-horizon comparison of two processes built from ordered initial laws and ordered transition kernels; Theorem 2 passes to the limit .
Formalization Note Indices are 0-based: the paper's is E (i - 1), the paper's kernel () is p (i - 2), and the paper's 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 (Mathlib's Ionescu-Tulcea API); kernels beyond the horizon play no role.
import Mathlib import Definitions.Def_StochIneqPO_Comparison_StochLE import Definitions.Def_StochIneqPO_Comparison_iterProd
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.