Interval Replacements of Persistence Modules
Abstract: We define two notions. The first one is a $compression\ system$ $\xi$ for a finite poset $\mathbf{P}$, which assigns each interval subposet $I$ to a poset morphism $\xi_I \colon Q_I \to \mathbf{P}$ satisfying some conditions, where $Q_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 $\xi$, the family of which is called the $interval\ rank\ invariant$ of $M$ under $\xi$. A compression system $\xi$ 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 explicitly, we will give a formula of the $I$-rank of $M$ under $\xi$ in terms of the structure linear maps of $M$ for any compression system $\xi$, and give a sufficient condition for the $I$-rank of $M$ under $\xi$ to coincide with that under the total compression system, the value of which is equal to the generalized rank invariant introduced by Kim--M\'emoli.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.