Lemma 4.6: strong ε-interleaving above α of tame 0-dim persistence modules yields the multi-bijection (i)–(iv)
OpenPersistClust.Count.theorem_4_5_lemma_4_6This is Lemma 4.6 of the report, specialized to -dimensional persistence: an algebraic stability statement turning a strong interleaving of two tame persistence modules into a matching of their persistence diagrams.
Let and be two decreasing filtrations over of the same finite type, with -th rank functions defined for as the rank of the induced map (and similarly for ), i.e. the number of path components of that meet . Let and be the associated -th persistence diagrams: each point with carries a finite multiplicity, and the diagonal carries infinite multiplicity. Assume that each diagram is off-diagonal (every point of positive multiplicity has death smaller than birth) and has finite off-diagonal support (the tameness / finite-type condition of Eq. (1) of the report).
Suppose that the two persistence modules are strongly -interleaved above a given time , for some , in the following equivalent rank-inequality form: for all and all ,
Then there exists a multi-bijection between and (a bijection between the copies of the points of the two diagrams, the diagonal included) such that assertions (i)-(iv) of Theorem 4.5 hold with threshold and radius :
- for every point , both coordinates of are -close to those of ;
- for every point , both coordinates of are -close to those of ;
- for every point , the -coordinate of is -close to that of ;
- for every point , the -coordinate of is -close to that of .
Here and
are the quadrants of the extended
plane appearing in Theorem 4.5. The role of this lemma in the mission is to be the purely
algebraic half of the proof of Theorem 4.5: it is applied with
= the superlevel-set filtration of a tame function and = the upper-star Rips
filtration of a geodesic -sample , with , the interleaving
being supplied by the companion lemma PersistClust.Count.theorem_4_5_interleaving.
Formalization Note Rank functions are formalized as maps , the diagram of a rank function as mult r, the copies as Copies (mult r)
and assertions (i)-(iv) as the predicate SatisfiesIIV. Tameness is stated as the conjunction of
"diagram-like" (positive multiplicity implies death < birth) and finiteness of the off-diagonal
support.
RETIRED (2026-10-09). This statement is FALSE as literally written: with only the rank-inequality hypothesis together with diagram-likeness and finite support, non-monotone rank functions satisfy all hypotheses while the conclusion fails (the multiplicity at an essential point probes ranks below , where the hypothesis gives no control). It is replaced by the corrected child PersistClust.Count.theorem_4_5_lemma_4_6_corrected, which adds the FiltrationLaw structural hypotheses (genuine persistence modules) and uses the box-expansion form of the inequalities.
import Mathlib import Definitions.Def_PersistClust_Count_Diagram
namespace PersistClust.Count
theorem theorem_4_5_lemma_4_6
(rX rY : ℝ → ℝ → ℕ∞) (α ε : ℝ) (hε : 0 ≤ ε)
(hDiagX : IsDiagramLike (mult rX)) (hDiagY : IsDiagramLike (mult rY))
(hFinX : {p : EReal × EReal | (mult rX) p ≠ 0}.Finite)
(hFinY : {p : EReal × EReal | (mult rY) p ≠ 0}.Finite)
(hinter : ∀ s t : ℝ, α ≤ s → t ≤ s →
rX s t ≤ rY (s - ε) (t - ε) ∧ rY s t ≤ rX (s - ε) (t - ε)) :
∃ γ : Copies (mult rX) ≃ Copies (mult rY), SatisfiesIIV γ α ε := by sorry
end PersistClust.Count