Interval Replacements of Persistence Modules
Abstract
We define two notions. The first one is a for a finite poset that assigns each interval subposet to an order-preserving map satisfying some conditions, where is a connected finite poset. An example is given by the compression system that assigns each to the inclusion of into . The second one is an - of a persistence module under , the family of which is called the of under . A compression system makes it possible to define the (also called the interval-decomposable approximation) not only for 2D persistence modules but also for any persistence modules over any finite poset. We will show that the forming of the interval replacement preserves the interval rank invariant, which is a stronger property than the preservation of the usual rank invariant. Moreover, to know what is preserved by the replacement explicitly, we will give a formula of the -rank of under in terms of the structure linear maps of for any compression system . The formula leads us to a concept of essential cover, which gives us a sufficient condition for the -rank of under to coincide with that under another compression system . This is applied to the case where , the value of -rank under which is equal to the generalized rank invariant introduced by Kim--M\'emoli, to give an alternative proof of the Dey--Kim--M\'emoli theorem computing the generalized rank invariant by using a zigzag path.
Keywords
Cite
@article{arxiv.2403.08308,
title = {Interval Replacements of Persistence Modules},
author = {Hideto Asashiba and Etienne Gauthier and Enhao Liu},
journal= {arXiv preprint arXiv:2403.08308},
year = {2026}
}
Comments
Major updates: (1) a general formula for computing interval multiplicity (resp. rank) invariants of persistence modules under any (resp. rank) compression system $\xi$; (2) clearer definition of essential covers (relative to $\xi$); (3) added GitHub link for interval rank invariant and replacement computations (under tot and ss); (4) fixed typos and refined notions