Lemma 4.6 (corrected), stability step with tameness: box expansion for truncated ranks of tame modules yields an ε-multi-bijection of the truncated diagrams
OpenPersistClust.Count.theorem_4_5_lemma_4_6_corrected_stability_tameThis is the tameness-corrected form of the stability step of Lemma 4.6 of the paper (p. 21; proof in Appendix A), the algebraic-stability ingredient of Theorem 4.5.
Let and be tame 0-dimensional persistence modules, encoded by stage families decreasing in the threshold, and component relations . Tameness means that the stages eventually vanish: . Write and for the rank functions, and , for their -truncations (the rank functions restricted to the quadrant ).
Assume the persistence diagrams of and have finite support, and that the truncated rank functions satisfy the box-expansion inequalities with no -guard: for all with ,
Then there exists a multi-bijection between the copies of the two truncated diagrams and that moves every point by at most in the norm, in both coordinates and both directions.
The tameness hypothesis is necessary: without it, -born classes are invisible to the diagram (the off-diagonal multiplicity guard discards points with infinite birth coordinate) while still inflating the truncated rank functions, so the box inequalities can hold for rank functions whose truncated diagrams are fundamentally incomparable (one empty, the other not) — a machine-checked counterexample exists for the untamed sibling statement. With tameness (satisfied by the superlevel and Rips modules appearing in Theorem 4.5), the Extended-Stability argument of Appendix A applies.
import Mathlib import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_FiltrationLaw import Definitions.Def_PersistClust_Count_TruncRank
namespace PersistClust.Count
theorem theorem_4_5_lemma_4_6_corrected_stability_tame
{ιX : Type*} (stageX : ℝ → Set ιX) (JX : ℝ → ιX → ιX → Prop)
{ιY : Type*} (stageY : ℝ → Set ιY) (JY : ℝ → ιY → ιY → Prop)
(α ε : ℝ) (hε : 0 ≤ ε)
(hLawX : FiltrationLaw stageX JX) (hLawY : FiltrationLaw stageY JY)
(hTameX : ∃ s₀ : ℝ, ∀ s ≥ s₀, stageX s = ∅)
(hTameY : ∃ s₀ : ℝ, ∀ s ≥ s₀, stageY s = ∅)
(hbox : ∀ s t : ℝ, t + 2 * ε ≤ s →
truncRank (rankFn stageX JX) α s t ≤ truncRank (rankFn stageY JY) α (s - ε) (t + ε) ∧
truncRank (rankFn stageY JY) α s t ≤ truncRank (rankFn stageX JX) α (s - ε) (t + ε))
(hDiagX : IsDiagramLike (mult (rankFn stageX JX)))
(hDiagY : IsDiagramLike (mult (rankFn stageY JY)))
(hFinX : {p : EReal × EReal | (mult (rankFn stageX JX)) p ≠ 0}.Finite)
(hFinY : {p : EReal × EReal | (mult (rankFn stageY JY)) p ≠ 0}.Finite) :
∃ δ : Copies (mult (truncRank (rankFn stageX JX) α))
≃ Copies (mult (truncRank (rankFn stageY JY) α)),
(∀ a, closeE (pt a).1 (pt (δ a)).1 ε ∧ closeE (pt a).2 (pt (δ a)).2 ε) ∧
(∀ b, closeE (pt (δ.symm b)).1 (pt b).1 ε ∧ closeE (pt (δ.symm b)).2 (pt b).2 ε) := by sorry
end PersistClust.Count