Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 (ii) — first entrance times into an increasing set: P(Nx<n)≤P(Ny<n)P(N_x < n) \le P(N_y < n)P(Nx​<n)≤P(Ny​<n)

Proved
StochIneqPO.Comparison.corollary1_ii

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

comparison-theoremhitting-timesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-order

In the setting of Corollary 1 (i) — E1=E2=⋯=EE_1 = E_2 = \cdots = EE1​=E2​=⋯=E a partially ordered Polish space, P1≺Q1P_1 \prec Q_1P1​≺Q1​, kernels satisfying (4), and random sequences (Xn)(X_n)(Xn​), (Yn)(Y_n)(Yn​) with the corresponding initial and conditional laws — let A⊆EA \subseteq EA⊆E be an increasing measurable set and let

Nx=min⁡{n≥1:Xn∈A}(=∞ if Xn∉A for all n),N_x = \min\{n \ge 1 : X_n \in A\} \quad (= \infty \text{ if } X_n \notin A \text{ for all } n),Nx​=min{n≥1:Xn​∈A}(=∞ if Xn​∈/A for all n),

and define NyN_yNy​ likewise from (Yn)(Y_n)(Yn​). Then

P(Nx<n)≤P(Ny<n),n=1,2,…, and n=∞.P(N_x < n) \le P(N_y < n), \qquad n = 1, 2, \dots, \text{ and } n = \infty.P(Nx​<n)≤P(Ny​<n),n=1,2,…, and n=∞.

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 {Nx<n}\{N_x < n\}{Nx​<n} for n=m+1n = m + 1n=m+1 is {∃ i<m:xi∈A}\{\exists\, i < m : x_i \in A\}{∃i<m:xi​∈A}, so the first conjunct is stated for all m : ℕ (covering n=1,2,…n = 1, 2, \dotsn=1,2,…), and the event {Nx<∞}\{N_x < \infty\}{Nx​<∞} is {∃ i:xi∈A}\{\exists\, i : x_i \in A\}{∃i:xi​∈A} (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
  • 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