Rips diagram equals barcode: finite-persistence (death) slice
ProvedPersistClust.Count.alg_diagram_death_pairThis is the finite-persistence (death) slice of the theorem that the analytic 0-dimensional persistence diagram of the upper-star Rips filtration coincides with its elder-rule barcode.
Under the same setup as the immortal slice — values , symmetric , Rips threshold , decreasing sort order , upper-star Rips filtration (Eq. (3) of RR-6968), analytic diagram , and elder-rule barcode from Procedure 1 with — for all real levels the multiplicity of the off-diagonal point agrees:
Both count the elder-rule merge events in which a component whose highest- vertex has value is absorbed at level into an older (higher-) component — the persistence pairs with birth and death .
The statement holds for all real : when or is not a vertex value, both sides are .
import Mathlib import Definitions.Def_PersistClust_Count_Rips import Definitions.Def_PersistClust_Count_AlgBarcode
namespace PersistClust.Count
theorem alg_diagram_death_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 d : ℝ) (hbd : d < b) :
ripsDiagram Dm g δ ((b : EReal), (d : EReal)) =
ripsBarcode g Dm δ σ ((b : EReal), (d : EReal)) := by sorry
end PersistClust.Count