Interval Multiplicities of Persistence Modules

Abstract

For any persistence module M over a finite poset P, and any interval I of P, we give a formula for the multiplicity dM(VI) of the interval module VI in the indecomposable decomposition of M in terms of the ranks of matrices consisting of structure linear maps of M. 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 M, to decide whether M is interval-decomposable, and to detect properties determined by prescribed interval summands without decomposing M. We also give criteria, in terms of top and socle supports along minimal projective resolutions and injective coresolutions of M, restricting the intervals that can occur as direct summands of M and thereby reduce the number of intervals to be computed in practice. Moreover, the formula tells us which morphisms of P are essential to compute dM(VI). This leads to the notion of an order-preserving map ζ Z P essentially covering I, for which the multiplicity is preserved under the induced restriction functor R mod P mod Z. When Z is of Dynkin type A, 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 M. Finally, we give a formula for dM(VI) in terms of a projective (or injective) (co)presentation of M. In the 2D-grid case, this is more practical since such resolutions can be computed from the filtration level of topological spaces.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…