Summand-injectivity of interval covers and monotonicity of interval resolution global dimensions
Toshitaka Aoki, Emerson G. Escolar, Shunsuke Tada

TL;DR
This paper investigates the properties of interval covers and resolutions in multi-parameter persistence modules, establishing injectivity, monotonicity, and classifying posets with zero global dimension.
Contribution
It proves summand-injectivity of interval covers, demonstrates the monotonicity of interval resolution global dimensions, and classifies posets with zero global dimension.
Findings
Interval covers are injective on indecomposable summands.
Interval resolution global dimension is monotonic with respect to subposets.
Posets with zero interval resolution global dimension are fully classified.
Abstract
Recently, there is growing interest in the use of relative homology algebra to develop invariants using interval covers and interval resolutions (i.e., right minimal approximations and resolutions relative to interval-decomposable modules) for multi-parameter persistence modules. In this paper, the set of all interval modules over a given poset plays a central role. Firstly, we show that the restriction of interval covers of modules to each indecomposable direct summand is injective. This result suggests a way to simplify the computation of interval covers. Secondly, we show the monotonicity of the interval resolution global dimension, i.e., if is a full subposet of , then the interval resolution global dimension of is not larger than that of . Finally, we provide a complete classification of posets whose interval resolution global dimension is zero.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Commutative Algebra and Its Applications · Polynomial and algebraic computation
