Thm 4.8 counting, step 1: -prominent part equals (separation)
ProvedPersistClust.Count.proof_thm_4_8_partition_count_sepclusteringpersistencetopological-data-analysis
Let be a persistence diagram that is -separated with : every off-diagonal point of lies in the open half-plane (death exceeding birth minus ) or in (death at most birth minus and birth exceeding ). Then the total multiplicity of in the closed half-plane — the number of points of with prominence (birth minus death) at least — equals the total multiplicity of in the smaller region . Indeed, a point of cannot lie in , since that would force , contradicting ; so by separation it lies in the branch. This is the source-side set equality of the counting step in the proof of Theorem 4.8: the -prominent part of the diagram consists exactly of the points in .
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