Corollary 1 (ii) — first entrance times into an increasing set:
ProvedStochIneqPO.Comparison.corollary1_iicomparison-theoremhitting-timesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-order
In the setting of Corollary 1 (i) — a partially ordered Polish space, , kernels satisfying (4), and random sequences , with the corresponding initial and conditional laws — let be an increasing measurable set and let
and define likewise from . Then
Formalization Note The statement is formulated for the laws Kernel.trajMeasure P₁ p and trajMeasure Q₁ q of the two sequences. With 0-based coordinates, the event for is , so the first conjunct is stated for all m : ℕ (covering ), and the event is (second conjunct).
Preamble
import Mathlib import Definitions.Def_StochIneqPO_Comparison_StochLE
Formal statement
namespace StochIneqPO.Comparison
open MeasureTheory ProbabilityTheory Finset
theorem corollary1_ii {E : Type*} [TopologicalSpace E] [PolishSpace E] [MeasurableSpace E]
[BorelSpace E] [PartialOrder E] [OrderClosedTopology E]
(P₁ Q₁ : Measure E) [IsProbabilityMeasure P₁] [IsProbabilityMeasure Q₁]
(p q : (n : ℕ) → Kernel (Π _ : Iic n, E) E)
[∀ n, IsMarkovKernel (p n)] [∀ n, IsMarkovKernel (q n)]
(hPQ : StochLE P₁ Q₁)
(hpq : ∀ n, ∀ x y : Π _ : Iic n, E, x ≤ y → StochLE (p n x) (q n y))
(A : Set E) (hA : MeasurableSet A) (hAup : IsUpperSet A) :
(∀ m : ℕ, Kernel.trajMeasure (X := fun _ => E) P₁ p {x | ∃ i < m, x i ∈ A} ≤
Kernel.trajMeasure (X := fun _ => E) Q₁ q {x | ∃ i < m, x i ∈ A}) ∧
Kernel.trajMeasure (X := fun _ => E) P₁ p {x | ∃ i, x i ∈ A} ≤
Kernel.trajMeasure (X := fun _ => E) Q₁ q {x | ∃ i, x i ∈ A} := by sorry
end StochIneqPO.Comparison
Source
Kamae, Krengel, O'Brien, Stochastic Inequalities on Partially Ordered Spaces, Ann. Probab. 5 (1977), Corollary 1 (ii), p. 904 (PDF p. 6)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.