Rips diagram equals barcode: immortal (essential) slice
ProvedPersistClust.Count.alg_diagram_immortal_pairThis is the immortal (essential) slice of the theorem that the analytic 0-dimensional persistence diagram of the upper-star Rips filtration coincides with its elder-rule barcode.
Let points be equipped with values and a symmetric distance matrix ; let be the Rips threshold and a non-decreasing sort order of the values (so vertices are processed in decreasing -order). The upper-star Rips filtration (Eq. (3) of RR-6968) has analytic 0-th persistence diagram , defined from the rank function the number of connected components of the subgraph that meet . Its elder-rule barcode is produced by the union-find sweep of Procedure 1 with merge threshold .
For every real birth level , the multiplicity of the point is the same on both sides:
Both count the connected components of the full Rips graph whose highest- vertex has value exactly , i.e. the entries of the sweep that survive the whole process and yield one immortal bar each.
The statement holds for every real : when is not among the vertex values, both sides are .
import Mathlib import Definitions.Def_PersistClust_Count_Rips import Definitions.Def_PersistClust_Count_AlgBarcode
namespace PersistClust.Count
theorem alg_diagram_immortal_pair
(n : ℕ) (g : Fin n → ℝ) (Dm : Fin n → Fin n → ℝ)
(hDm : ∀ i j, Dm i j = Dm j i) (δ : ℝ) (σ : Fin n ≃ Fin n)
(hσ : IsSortOrder g σ) (b : ℝ) :
ripsDiagram Dm g δ ((b : EReal), ⊥) = ripsBarcode g Dm δ σ ((b : EReal), ⊥) := by sorry
end PersistClust.Count