Corrected Lemma 4.6 child (q-tame): diagrams agree on QNE_alpha after truncation
ProvedPersistClust.Count.theorem_4_5_lemma_4_6_corrected_mult_agree_qtameLet 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 the module is q-tame: every structure rank is finite,
which is the paper's standing assumption on persistence modules of interest (for the superlevel-set filtrations of tame functions it follows from local finiteness of the component counts). 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 q-tame module, the original diagram and its -truncation agree on :
The multiplicity of is defined as the infimum, over , of the bracket , the number of classes born in dying in . For all four probes at small lie strictly above , where Eq. (18) makes the original and truncated ranks coincide; q-tameness makes every bracket -valued, the bracket is nondecreasing in (the probe windows nest, by the window-count monotonicity facts M1–M3 that follow from FiltrationLaw), and an infimum of -valued terms is attained, so both infima agree.
The q-tameness hypothesis cannot be weakened to finiteness of the off-diagonal support : with a single bar carrying countably many classes at some point with born above , the two ranks entering the first bracket pair both become at every scale , so the original bracket collapses by while the truncated one (which loses the below- pair entirely) stays positive, and the support remains finite — the agreement genuinely fails. Q-tameness is exactly what excludes such collapsing bars and makes the diagram faithful.
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. The rank functions take values in , so q-tameness is stated as . This is the Step 2 successor (q-tame form) of the corrected-Lemma-4.6 decomposition of PersistClust.Count.theorem_4_5_lemma_4_6_corrected; it supersedes PersistClust.Count.theorem_4_5_lemma_4_6_corrected_mult_agree, whose finite-support statement is false.
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_qtame
{ι : Type*} (stage : ℝ → Set ι) (J : ℝ → ι → ι → Prop)
(hLaw : FiltrationLaw stage J) (α : ℝ)
(hQ : ∀ s t : ℝ, rankFn stage J s t ≠ ⊤) :
∀ p ∈ QNE α, mult (rankFn stage J) p = mult (truncRank (rankFn stage J) α) p := by sorry
end PersistClust.Count