Lemma 2 — no two disjoint closed sets
ProvedSmithHitAndRun.SymMixing.lemma_2_indecomposableindecomposabilitymarkov-chainsmcmcp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be finite nonzero content on and a Markov kernel with a jointly measurable symmetric density relative to . Assume for every . A set is closed when it is nonempty and measurable and for every . Then
This is Smith's indecomposability condition. It supplies the one-step condition used in Theorems 1–2.
Preamble
import Mathlib.Probability.Kernel.Invariance import Definitions.Def_SmithHitAndRun_SymMixing_IsSymmetricMixingKernel import Definitions.Def_SmithHitAndRun_SymMixing_IsClosedSet open MeasureTheory ProbabilityTheory
Formal statement
namespace SmithHitAndRun.SymMixing
/-- Smith (1984), Lemma 2, p. 1300: no two disjoint nonempty closed sets. -/
theorem lemma_2_indecomposable {α : Type*} [MeasurableSpace α]
(V : Measure α) [IsFiniteMeasure V] (hV : V ≠ 0)
(P : Kernel α α) [IsMarkovKernel P] (f : α → α → ENNReal)
(h : IsSymmetricMixingKernel V P f) (hpos : ∀ x y, 0 < f y x) :
¬ ∃ A₁ A₂ : Set α,
IsClosedSet P A₁ ∧ IsClosedSet P A₂ ∧ A₁ ∩ A₂ = ∅ := by sorry
end SmithHitAndRun.SymMixing
Source
Smith, Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions, Oper. Res. 32(6) (1984), p. 1300, Lemma 2 and following definition of closed set
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.