Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thm 4.8 counting, step 1: d2d_2d2​-prominent part equals Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​ (separation)

Proved
PersistClust.Count.proof_thm_4_8_partition_count_sep

by fabianroll · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

clusteringpersistencetopological-data-analysis

Let D:E2→N∪{∞}D : \mathbb{E}^2 \to \mathbb{N} \cup \{\infty\}D:E2→N∪{∞} be a persistence diagram that is (d1,d2)(d_1, d_2)(d1​,d2​)-separated with d1<d2d_1 < d_2d1​<d2​: every off-diagonal point of DDD lies in the open half-plane Δd1N\Delta^N_{d_1}Δd1​N​ (death exceeding birth minus d1d_1d1​) or in Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​ (death at most birth minus d2d_2d2​ and birth exceeding d2d_2d2​). Then the total multiplicity of DDD in the closed half-plane Δd2S\Delta^S_{d_2}Δd2​S​ — the number prominentCount(D,d2)\mathrm{prominentCount}(D, d_2)prominentCount(D,d2​) of points of DDD with prominence (birth minus death) at least d2d_2d2​ — equals the total multiplicity of DDD in the smaller region Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​. Indeed, a point of Δd2S\Delta^S_{d_2}Δd2​S​ cannot lie in Δd1N\Delta^N_{d_1}Δd1​N​, since that would force d2<d1d_2 < d_1d2​<d1​, contradicting d1<d2d_1 < d_2d1​<d2​; so by separation it lies in the Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​ branch. This is the source-side set equality of the counting step in the proof of Theorem 4.8: the d2d_2d2​-prominent part D2D_2D2​ of the diagram consists exactly of the points in Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​.

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

theorem proof_thm_4_8_partition_count_sep
    (D : EReal × EReal → ℕ∞) (hD : IsDiagramLike D)
    (d₁ d₂ : ℝ) (hd₁ : 0 ≤ d₁) (hsep : IsSeparated D d₁ d₂) (hd12 : d₁ < d₂) :
    prominentCount D d₂ =
      {q : (EReal × EReal) × ℕ | (q.2 : ℕ∞) < D q.1 ∧ q.1 ∈ DeltaS d₂ ∩ LamE d₂}.encard := by sorry

end PersistClust.Count
Source
Chazal, Guibas, Oudot, Skraba: Persistence-Based Clustering in Riemannian Manifolds, INRIA Research Report RR-6968, 2009, p. 22, proof of Theorem 4.8 (counting part); https://hal.inria.fr/inria-00389390

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