Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — no two disjoint closed sets

Proved
SmithHitAndRun.SymMixing.lemma_2_indecomposable

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

indecomposabilitymarkov-chainsmcmcp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let VVV be finite nonzero content on SSS and PPP a Markov kernel with a jointly measurable symmetric density f(y∣x)f(y\mid x)f(y∣x) relative to VVV. Assume f(y∣x)>0f(y\mid x)>0f(y∣x)>0 for every x,y∈Sx,y\in Sx,y∈S. A set AAA is closed when it is nonempty and measurable and P(x,A)=1P(x,A)=1P(x,A)=1 for every x∈Ax\in Ax∈A. Then

∄A1,A2⊆S: A1∩A2=∅ and both A1,A2 are closed.\nexists A_1,A_2\subseteq S:\ A_1\cap A_2=\varnothing\ \text{and both }A_1,A_2\text{ are closed}.∄A1​,A2​⊆S: A1​∩A2​=∅ and both A1​,A2​ are closed.

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
  • 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