T2 finiteness: the multiplicity diagram of a tame module has finite support
ProvedPersistClust.Count.tame_mult_support_finitecountfiniteistamemodulemultpersistclustpersistencesupport-tool
For a tame module (IsTameModule), the support of the multiplicity functional - the set of extended-plane points where mult (rankFn stage J) is nonzero - is FINITE. The proof goes through the thread identity: the multiplicity agrees, off the degenerate diagonal edges, with the finitely-many-threads census functional (a finite sum over the critical-set-indexed component threads), so the support is a subset of that finite thread set.
Preamble
import Mathlib import Definitions.Def_PersistClust_Count_Setting import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_FiltrationLaw import Definitions.Def_PersistClust_Count_MatchingCensus open PersistClust.Count open scoped ENNReal
Formal statement
namespace PersistClust.Count
theorem tame_mult_support_finite {ι : Type*} {stage : ℝ → Set ι} {J : ℝ → ι → ι → Prop}
(hLaw : FiltrationLaw stage J) (hTame : IsTameModule stage J) :
{p : EReal × EReal | mult (rankFn stage J) p ≠ 0}.Finite
:= by sorrySource
T2 support tool of the persistence-clustering deliverable (RR-6968, Theorem 4.5 cluster): the finiteness of the tame multiplicity diagram, the structural input behind tameness transfer and the q-tameness hypotheses of the matching gate. Transcribed GREEN (exit 0, sorry-free) from the ORCH-verified matching-gate lane working copy.