Interval Replacements of Persistence Modules

Abstract

We define two notions. The first one is a $rank\ compression\ system$ $ξ$ for a finite poset $\mathbf{P}$ that assigns each interval subposet $I$ to an order-preserving map $ξ_I \colon I^ξ \to \mathbf{P}$ satisfying some conditions, where $I^ξ$ is a connected finite poset. An example is given by the $total$ compression system that assigns each $I$ to the inclusion of $I$ into $\mathbf{P}$. The second one is an $I$-$rank$ of a persistence module $M$ under $ξ$, the family of which is called the $interval\ rank\ invariant$ of $M$ under $ξ$. A compression system $ξ$ makes it possible to define the $interval\ replacement$ (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 $I$-rank of $M$ under $ξ$ in terms of the structure linear maps of $M$ for any compression system $ξ$. The formula leads us to a concept of essential cover, which gives us a sufficient condition for the $I$-rank of $M$ under $ξ$ to coincide with that under another compression system $ζ$. This is applied to the case where $ξ= \mathrm{tot}$, the value of $I$-rank under which is equal to the generalized rank invariant introduced by Kim--Mémoli, to give an alternative proof of the Dey--Kim--Mémoli theorem computing the generalized rank invariant by using a zigzag path.