Corrected Lemma 4.6 child: diagrams agree on QNE_alpha after truncation
DisprovedPersistClust.Count.theorem_4_5_lemma_4_6_corrected_mult_agreeLet be a genuine -dimensional persistence module given as a filtration of path components: is a decreasing family of sets and is the "same component of " equivalence, compatible with the inclusions for (FiltrationLaw stage J). Its rank function is (the rank of , i.e. the number of components of meeting ), and its persistence diagram is the multiplicity function . Assume has finite off-diagonal support ( is finite). The truncation at is if and , and otherwise (truncRank r α, Eq. (16) of Appendix A), giving the truncated diagram .
is the closed north-east quadrant above . This lemma asserts that, for a genuine module with finite diagram, the original diagram and its -truncation agree on :
The proof uses Eq. (18) — the truncated rank equals the original rank whenever both windows are at or above — together with the -grid of Eqs. (19)–(22) of Appendix A: the multiplicity of a point is an infimum of window-count differences, and for the windows probed at fine offsets lie above where Eq. (18) makes the original and truncated ranks coincide, while the contributions of windows below cancel in pairs (Eqs. (21)–(22)); the two infima are therefore equal. The required rankFn window-count monotonicity facts (antitone in the first argument, etc.) follow from FiltrationLaw.
Formalization Note. All notions live in Definitions.Def_PersistClust_Count_Diagram (namespace PersistClust.Count): rankFn, mult (the diagram of a rank function), QNE. truncRank is the shared Definition PersistClust.Count.truncRank (Definitions.Def_PersistClust_Count_TruncRank). FiltrationLaw is in Definitions.Def_PersistClust_Count_FiltrationLaw. This is Step 2 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_mult_agree
{ι : Type*} (stage : ℝ → Set ι) (J : ℝ → ι → ι → Prop)
(hLaw : FiltrationLaw stage J) (α : ℝ)
(hFin : {p : EReal × EReal | (mult (rankFn stage J)) p ≠ 0}.Finite) :
∀ p ∈ QNE α, mult (rankFn stage J) p = mult (truncRank (rankFn stage J) α) p := by sorry
end PersistClust.Count