Interval Replacements of Persistence Modules
Abstract
We define two notions. The first one is a rank\ compression\ system for a finite poset P that assigns each interval subposet I to an order-preserving map I I 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 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 = tot, the value of I-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.
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.