Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rips diagram equals barcode: finite-persistence (death) slice

Proved
PersistClust.Count.alg_diagram_death_pair

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

combinatoricsfiltrationpersistence

This 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 gig_igi​, symmetric DmDmDm, Rips threshold δ\deltaδ, decreasing sort order σ\sigmaσ, upper-star Rips filtration {Rδ(Lα)}α\{R_\delta(L^\alpha)\}_\alpha{Rδ​(Lα)}α​ (Eq. (3) of RR-6968), analytic diagram mult(ripsRank)\mathrm{mult}(\mathrm{ripsRank})mult(ripsRank), and elder-rule barcode ripsBarcode\mathrm{ripsBarcode}ripsBarcode from Procedure 1 with τ=+∞\tau=+\inftyτ=+∞ — for all real levels d<bd<bd<b the multiplicity of the off-diagonal point (b,d)(b,d)(b,d) agrees:

mult(ripsRank)(b,d)  =  ripsBarcode(g,Dm,δ,σ)(b,d).\mathrm{mult}(\mathrm{ripsRank})(b,d) \;=\; \mathrm{ripsBarcode}(g,Dm,\delta,\sigma)(b,d).mult(ripsRank)(b,d)=ripsBarcode(g,Dm,δ,σ)(b,d).

Both count the elder-rule merge events in which a component whose highest-ggg vertex has value bbb is absorbed at level ddd into an older (higher-ggg) component — the persistence pairs with birth bbb and death ddd.

The statement holds for all real d<bd<bd<b: when bbb or ddd is not a vertex value, both sides are 000.

Preamble
import Mathlib
import Definitions.Def_PersistClust_Count_Rips
import Definitions.Def_PersistClust_Count_AlgBarcode
Formal statement
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
Source
Chazal--Guibas--Oudot--Skraba, RR-6968 (2009), Procedure 1 (τ=+∞ elder-rule sweep) and Eq. (3), standard 'persistence diagram of a finite filtration equals its barcode', finite-interval slice

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