Interval Multiplicities of Persistence Modules
Abstract
For any persistence module over a finite poset , and any interval of , we give a formula for the multiplicity of the interval module in the indecomposable decomposition of in terms of the ranks of matrices consisting of structure linear maps of . This generalizes the corresponding formula for 1-dimensional persistence modules. As applications, the formula enables us to compute the maximal interval-decomposable direct summand of , to decide whether is interval-decomposable, and to detect properties determined by prescribed interval summands without decomposing . We also give criteria, in terms of top and socle supports along minimal projective resolutions and injective coresolutions of , restricting the intervals that can occur as direct summands of and thereby reduce the number of intervals to be computed in practice. Moreover, the formula tells us which morphisms of are essential to compute . This leads to the notion of an order-preserving map essentially covering , for which the multiplicity is preserved under the induced restriction functor . When is of Dynkin type , also known as a zigzag poset, this allows the multiplicity to be computed more efficiently from the filtration level of topological spaces, without computing all structure linear maps of . Finally, we give a formula for in terms of a projective (or injective) (co)presentation of . In the 2D-grid case, this is more practical since such resolutions can be computed from the filtration level of topological spaces.
Cite
@article{arxiv.2411.11594,
title = {Interval Multiplicities of Persistence Modules},
author = {Hideto Asashiba and Enhao Liu},
journal= {arXiv preprint arXiv:2411.11594},
year = {2026}
}
Comments
81 pages, 6 figures. Updated version: revised the abstract and introduction, clarified criteria for reducing candidate interval summands via minimal projective resolutions and injective coresolutions, and corrected typos