Lemma 4.6 (corrected): box-expansion interleaving above α of filtration rank functions yields the multi-bijection (i)–(iv)
DisprovedPersistClust.Count.theorem_4_5_lemma_4_6_corrected⚠️ REFUTED — machine-checked counterexample. Do not attempt to prove this statement as published. The rank-interleaving hypothesis (with the guard) is strictly weaker than the paper's strong module interleaving, and the gap is fatal. At the explicit instance — X with barcode , Y with barcode , , — the rank-window inequalities HOLD (both directions: X's thin bar contributes only at windows with , forcing , where Y's bar covers the shifted comparison; the essential-bar corners are excluded by ), and all diagram-like / finite-support hypotheses hold; yet the conclusion fails — X's north-east point has no 1-close partner among Y's copies (deaths/births too far, diagonal window empty). The window with never probes deaths below , so a Y-bar dying far below is invisible to the hypothesis while remaining unmatched in the conclusion. A complete Lean counterexample artifact is attached to the refutation submission on the qtame surgery child of this theorem.
This is the corrected form of Lemma 4.6 of the paper (p. 21; proof in Appendix A), the algebraic-stability ingredient of Theorem 4.5.
Let and be the rank functions of two tame 0-dimensional persistence modules, given in the Lean encoding as and , where the stage families decrease with the threshold parameter and each is the "same component of " equivalence, compatible with the inclusions (the hypothesis FiltrationLaw — exactly the structural law of a genuine filtration). Assume the diagrams , are diagram-like with finite off-diagonal support, and that the modules are strongly -interleaved above the level , expressed in rank form: for all with ,
Then there exists a multi-bijection between the off-diagonal copies of the two diagrams satisfying assertions (i)–(iv) of Theorem 4.5: and displace every point of the quadrant by at most in each coordinate, and every point of the quadrant by at most in its first coordinate.
This is the reusable algebraic-stability lemma for Theorem 4.5; it is consumed by the parent reduction together with the geometric interleaving child that supplies its hypotheses for the superlevel-set and Rips filtrations.
Formalization Note. The FiltrationLaw hypothesis is essential: with only the rank inequalities (even in the box-expansion form) together with diagram-likeness and finite support, the statement is false. The multiplicity at an essential point takes an infimum over all and thereby probes ranks at levels below , where the interleaving imposes no constraint; non-monotone rank functions can satisfy the inequalities while the conclusion fails. FiltrationLaw excludes such pathological functions and is provable for the two rank functions of Theorem 4.5.
import Mathlib import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_FiltrationLaw
namespace PersistClust.Count
theorem theorem_4_5_lemma_4_6_corrected
{ι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)
(hbx : ∀ s t : ℝ, t + 2 * ε ≤ s → α ≤ t →
rankFn stageX JX s t ≤ rankFn stageY JY (s - ε) (t + ε) ∧
rankFn stageY JY s t ≤ 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 (rankFn stageX JX)) ≃ Copies (mult (rankFn stageY JY)),
SatisfiesIIV γ α ε := by sorry
end PersistClust.Count