Finite interval modules and rank recovery
Consulted manifestations, attribution and rights: CCDS14-v1.
The discrete interval module in Chazal, Crawley-Boevey, and de Silva, §1.1, assigns k to
indices in a closed interval [p,q] and zero elsewhere, with identity maps between active
stages. Their four-rank formula recovers the multiplicity of each interval from the ranks of
the structure maps. For this library's finite index set Fin N, the Lean interval [b,d) is
the same convention with p = b and q = d - 1; thus d = N means the last observed stage
N - 1 is alive. It does not encode an infinite lifetime.
For an explicitly supplied finite multiset B of these intervals, the range dimension of the
map M_B(i → j) is the number of occurrences with b ≤ i and j < d. Extending this
table to integers with the left sentinel r(-1,j) = 0 and right sentinel r(i,N) = 0, the
finite difference is
multiplicity_B(b,d) = r(b,d-1) - r(b-1,d-1) - r(b,d) + r(b-1,d).
The predecessor is taken in ℤ, so b = 0 uses -1 without truncated natural subtraction.
The extension is auxiliary outside valid ordered index pairs; there it is not a structure-map
rank. The inversion proves uniqueness of the multiset for these constructed realizations. It
does not prove an interval decomposition for arbitrary persistence modules.
API map
- Intervals and realizations: Import
TDA.Persistence.FiniteBarcodeand open namespaceTDA.Persistence.FiniteInterval Nstores natural endpointsbirth < death ≤ N;intervalModulerealizes one interval (Interval.lean).barcodeModulerealizes a supplied finite multisetBover fieldkwith one coordinate per occurrence, so repeated intervals remain distinct. Supply(k := k)when the coefficient field cannot be inferred fromBalone. - Ranks and multiplicities: For
i j : Fin Nwithi ≤ j,rank_barcodeMapgives the structure-map rank ofbarcodeModule (k := k) Bas the count of intervals withbirth ≤ i.valandj.val < death.barcodeRankInteger (k := k) Bextends this table to integer pairs and is zero unless0 ≤ i ≤ j < (N : ℤ); outside this range it is not a structure-map rank.barcodeMultiplicity B b dcounts inℕ. For natural endpointsb < d ≤ N,multiplicity_eq_rank_differencecasts that count toℤand states the four-rank identity inℤ, not truncated natural subtraction. - Inversion and module decomposition:
barcodeRankInteger_injectiverecovers equality of supplied multisets when their extended tables agree at every integer pair. It concerns explicit barcode realizations and does not construct a decomposition of an arbitrary module. For the separate existence theorem for finite-chain modules over a field with pointwise finite-dimensional fibers, see finite interval decomposition.
Source: Chazal–Crawley-Boevey–de Silva, The observable structure of persistence modules, §1.1, p.1.