Proof of Theorem 6, p. 908 — a tight nondecreasing random sequence converges in probability
ProvedStochIneqPO.Monotone.tight_imp_tendstoInMeasureLet be a complete separable metric space (a Polish space with metric ) endowed with a closed partial ordering (the set is closed in ) and its Borel -algebra. Let be a probability space and let be measurable with
If the family of distributions is tight, then converges in probability: there is a measurable with
This is the implication (i) (iii) of Theorem 6, the substantial step of its first part; together with the standard implications (iii) (ii) (i) it gives the equivalence of tightness, weak convergence and convergence in probability for monotone sequences.
Formalization Note The closed partial ordering is Mathlib's OrderClosedTopology. Separability is stated as second countability, which is equivalent for metric spaces. The monotonicity is required for every , as in the paper; an almost sure version is equivalent after modifying the on a null set. The sequence index starts at in Lean.
import Mathlib import Definitions.Def_StochIneqPO_Monotone_Regular17 import Definitions.Def_StochIneqPO_Monotone_ConvergenceModes
namespace StochIneqPO.Monotone
open MeasureTheory
theorem tight_imp_tendstoInMeasure {E : Type*} [MetricSpace E] [CompleteSpace E]
[SecondCountableTopology E] [MeasurableSpace E] [BorelSpace E]
[PartialOrder E] [OrderClosedTopology E]
{Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
(X : ℕ → Ω → E) (hX : ∀ i, Measurable (X i)) (hmono : ∀ ω, Monotone fun i => X i ω)
(htight : LawsTight μ X) :
ConvergesInProbability μ X := by sorry
end StochIneqPO.Monotone
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.