Corrected Lemma 4.6 child: surgery composition yielding SatisfiesIIV
DisprovedPersistClust.Count.theorem_4_5_lemma_4_6_corrected_surgery⚠️ REFUTED — machine-checked counterexample. Do not attempt to prove this statement as published. At the explicit instance of two genuine 3-point merge-tree filtrations — X with barcode , Y with barcode , at , — every hypothesis holds: the -truncated diagrams are vs (Y's bar , dying far below , clamps to the -row), so the truncated-pair bijection hypothesis holds (an explicit 1-close bijection both ways), as do the agreement, tameness, diagram-like and finite-support hypotheses. But the conclusion is impossible: assertion (i) demands a partner 1-close in BOTH coordinates for X's north-east point ; Y's (death away), (birth away) and the diagonal () all fail, so no multi-bijection exists. Root cause: the truncated-pair hypothesis is blind to deaths below ; the paper's Lemma 4.6 assumes the modules themselves are -interleaved (structure maps), which this instance violates (bottleneck ). A complete Lean counterexample (both modules, every hypothesis proven, the no-partner contradiction) is attached to the refutation submission on this theorem's qtame sibling — see its file and explanation. The same instance refutes the qtame sibling and the parent theorem_4_5_lemma_4_6_corrected.
Let and be two genuine -dimensional persistence modules (FiltrationLaw) with finite diagrams, , . Write , for the original diagrams and , for the -truncated diagrams. Assume:
(a) the original and truncated diagrams agree on the closed north-east quadrant ( for , for each module); and
(b) a multi-bijection of the truncated diagrams with - control (both coordinates, both directions).
Then there is a multi-bijection of the ORIGINAL diagrams satisfying assertions (i)–(iv) of Theorem 4.5 at threshold and radius (SatisfiesIIV γ α ε): on both coordinates of the matched point are -close (both directions); on only the first coordinate is guaranteed -close (both directions).
The construction is the SURGERY of Appendix A: fixes and moves points only vertically within (the vertical half-line multiplicities of the original and truncated diagrams coincide, Eqs. (21)–(22), via the -grid and Eq. (18)), and similarly ; one composes . Death-crossing subtlety: the naive composite can violate assertion (i) when moves a point whose death lies in to death (the truncated diagram clamps deaths to ) and then moves it vertically below ; the resolution is to choose the vertical per-birth matching -proximally — match each vertical half-line of the truncated diagram to the original within vertical distance , which is possible because truncation only clamps deaths downward to .
Formalization Note. Copies, pt, closeE, SatisfiesIIV, QNE are in Definitions.Def_PersistClust_Count_Diagram (namespace PersistClust.Count); truncRank is the shared Definition Definitions.Def_PersistClust_Count_TruncRank. This is Step 5 of the corrected-Lemma-4.6 decomposition of PersistClust.Count.theorem_4_5_lemma_4_6_corrected.
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_surgery
{ι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)
(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)
(hAgree : ∀ p ∈ QNE α, mult (rankFn stageX JX) p = mult (truncRank (rankFn stageX JX) α) p ∧
mult (rankFn stageY JY) p = mult (truncRank (rankFn stageY JY) α) p)
(hδ : ∃ δ : 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 ε)) :
∃ γ : Copies (mult (rankFn stageX JX)) ≃ Copies (mult (rankFn stageY JY)),
SatisfiesIIV γ α ε := by sorry
end PersistClust.Count