ATCGCTMar 23

Interval Decomposition of Infinite Persistence Modules over a Principal Ideal Domain

arXiv:2511.0761426.51 citationsh-index: 4
AI Analysis

This provides theoretical foundations for topological data analysis, generalizing prior finite-index results to infinite settings, which is incremental but important for mathematical rigor.

The paper tackles the problem of determining when persistence modules over a principal ideal domain admit interval decompositions, showing this occurs if and only if every structure map has free cokernel, and in torsion-free settings, it relates to invariance of persistence diagrams under coefficient field changes.

We study pointwise free and finitely-generated persistence modules over a principal ideal domain, indexed by a (possibly infinite) totally-ordered poset category. We show that such persistence modules admit interval decompositions if and only if every structure map has free cokernel. We also show that, in torsion-free settings, the integer persistent homology module of a filtration of topological spaces admits an interval decomposition if and only if the associated persistence diagram is invariant to the choice of coefficient field. These results generalize prior work where the indexing category is finite.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes