Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.8, p. 22, Regions I–II — γ(D₁) ⊆ Δ^N_{d₁+2cδ} ∪ Λ^W_{d₁+2cδ}

Proved
PersistClust.Count.proof_thm_4_8_noise_image

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

extended-planemulti-bijectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1persistence-diagram

Let DDD and D′D'D′ be two diagrams (multisets of off-diagonal points of R‾2\overline{\mathbb R}^2R2 with birth >>> death, plus the diagonal with infinite multiplicity), and let γ\gammaγ be a multi-bijection between them satisfying assertions (i)–(iv) of Theorem 4.5 with threshold α=cδ\alpha=c\deltaα=cδ and radius cδc\deltacδ, where c,δ>0c,\delta>0c,δ>0. Let d1≥0d_1\ge0d1​≥0 and d2d_2d2​ satisfy δ<d2−d15c\delta<\frac{d_2-d_1}{5c}δ<5cd2​−d1​​, and assume DDD is (d1,d2)(d_1,d_2)(d1​,d2​)-separated. Write D1D_1D1​ for the points of DDD in Δd1N\Delta^N_{d_1}Δd1​N​. Then

γ(D1)⊆Δd1+2cδN∪Λd1+2cδW.\gamma(D_1)\subseteq\Delta^N_{d_1+2c\delta}\cup\Lambda^W_{d_1+2c\delta}.γ(D1​)⊆Δd1​+2cδN​∪Λd1​+2cδW​.

This is the analysis of Regions I and II in the proof of the main theorem: the noise points of D0fD_0fD0​f are sent to points of low prominence or low birth.

Formalization Note The statement is abstract: in the main theorem, D=D0fD=D_0fD=D0​f, D′=D0Rδf(L)D'=D_0\mathcal R^f_\delta(L)D′=D0​Rδf​(L) and γ\gammaγ comes from Theorem 4.5 with α=cδ\alpha=c\deltaα=cδ. Every copy of a point of D1D_1D1​ is covered, and the image may be a diagonal copy.

Preamble
import Mathlib
import Definitions.Def_PersistClust_Count_Diagram
Formal statement
namespace PersistClust.Count

theorem proof_thm_4_8_noise_image
    (D D' : EReal × EReal → ℕ∞) (hD : IsDiagramLike D) (hD' : IsDiagramLike D')
    (c δ : ℝ) (hc : 0 < c) (hδ : 0 < δ)
    (γ : Copies D ≃ Copies D') (hγ : SatisfiesIIV γ (c * δ) (c * δ))
    (d₁ d₂ : ℝ) (hd₁ : 0 ≤ d₁) (hδc : δ < (d₂ - d₁) / (5 * c))
    (hsep : IsSeparated D d₁ d₂) :
    ∀ (q : (EReal × EReal) × ℕ) (hq : (q.2 : ℕ∞) < D q.1), q.1 ∈ DeltaN d₁ →
      pt (γ (Sum.inl ⟨q, hq⟩)) ∈ DeltaN (d₁ + 2 * c * δ) ∪ LamW (d₁ + 2 * c * δ) := by sorry

end PersistClust.Count
Source
Chazal, Guibas, Oudot, Skraba, Persistence-Based Clustering in Riemannian Manifolds, INRIA RR-6968 (HAL inria-00389390v1, 2009), p. 22, proof of Theorem 4.8, Regions I and II
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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