pith. sign in

arxiv: 2402.09190 · v3 · pith:PTKFUITFnew · submitted 2024-02-14 · 🧮 math.AT · math.RT

Invariants of persistence modules defined by order-embeddings

Claire Amiot , Thomas Br\"ustle , Eric J. Hanson This is my paper

Pith reviewed 2026-05-24 04:15 UTC · model grok-4.3

classification 🧮 math.AT math.RT
keywords persistence modulesorder-embeddingsmultiparameter persistenceindecomposable modulessigned barcodesrestriction functorsposet representationstopological data analysis
0
0 comments X

The pith

Order-preserving embeddings of representation-finite posets into P yield invariants for persistence modules by decomposing restrictions into indecomposables.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper investigates invariants for persistence modules over posets by restricting modules to order-embedded subposets of finite representation type. It uses the exact restriction functor and its adjoints to obtain decompositions into indecomposables, providing homological insights and reinterpreting prior work. This method determines bases for the images of these invariants and generalizes signed barcodes. Iterated embeddings of posets with increasing sizes are used to minimize redundancy by focusing on previously unseen indecomposables.

Core claim

Considering general order-preserving embeddings of representation-finite subposets X into P and studying the indecomposables obtained from the restriction of a P-module M to X yields new homological insights, re-interprets previous results, and determines bases of the image of these invariants, generalizing signed barcodes. Iterated embeddings of several posets of increasing sizes, while limiting attention to only some indecomposables, addresses redundancy.

What carries the argument

The restriction functor from mod P to mod X, which is exact and admits left and right adjoint functors (induction and co-induction), enabling the decomposition of restricted modules into indecomposable summands.

If this is right

  • These invariants provide new homological insights into the structure of persistence modules.
  • Previous results on invariants can be re-interpreted through this embedding approach.
  • The images of these invariants have explicitly determinable bases, generalizing signed barcodes.
  • Using iterated embeddings reduces redundancy in the set of obtained indecomposables.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The adjoint functors may connect this approach to broader questions in representation theory of posets.
  • Explicit bases could support new algorithms for computing invariants in multiparameter settings.
  • The method might extend stability results beyond the signed barcode case considered in the literature.

Load-bearing premise

The embedded subposets X are assumed to be of finite representation type, ensuring that modules over X decompose completely into indecomposables.

What would settle it

A counterexample where the multiplicities of indecomposables from an order-embedding do not form a basis for the invariant image or fail to generalize signed barcodes would disprove the central claims.

read the original abstract

One of the main objectives of topological data analysis is the study of discrete invariants for persistence modules, in particular when dealing with multiparameter persistence modules. In many cases, the invariants studied for these non-totally ordered posets $P$ can be obtained from restricting a given module to a subposet $X$ of $P$ that is totally ordered (or more generally, of finite representation type), and then computing the barcode (or the general direct sum decomposition) over $X$. We consider in this paper general order-preserving embeddings of representation-finite subposets $X$ into $P$ and study systematically the invariants obtained by decomposing the restriction of a given $P$-module $M$ to $X$ into its indecomposable summands. The restriction functor from $\mathrm{mod}\ P$ to $\mathrm{mod}\ X$ is well-studied, and it is known to be exact and admits both left and right adjoint functors, known as induction and co-induction functors. This allows us to obtain new homological insights, and also to re-interpret previous results. We use this approach also to determine bases of the image of these invariants, thus generalizing the concept of signed barcodes which is considered in the literature in relation to stability results. It turns out that considering only order-embeddings of one fixed poset $X$ into the poset $P$, and studying the set of all indecomposables obtained from $X$ introduces a lot of redundancy. We therefore also study iterated embeddings of several posets of increasing sizes, while limiting attention to only some indecomposables (that have not been obtained from embedding of smaller posets previously).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper claims that invariants for persistence modules over a poset P can be systematically obtained by restricting a module M to representation-finite subposets X via general order-preserving embeddings, then decomposing the restricted module into indecomposables. It leverages the exactness of the restriction functor and the existence of its left and right adjoints (induction and coinduction) to derive new homological information, reinterpret earlier results, and identify bases for the images of these invariants, thereby generalizing signed barcodes. The paper further proposes studying iterated embeddings of posets of increasing size, restricting attention to previously unseen indecomposables, to mitigate redundancy.

Significance. If the constructions and claims are fully substantiated, the work offers a categorical approach to multiparameter persistence invariants that extends one-parameter barcodes in a controlled way. The explicit use of adjoint functors for homological reinterpretation and the determination of image bases are potentially valuable for stability theory in TDA. The finite-representation-type hypothesis is presented as a deliberate design choice rather than an unverified assumption.

minor comments (2)
  1. Abstract: the phrase 'new homological insights' is stated without a concrete example or theorem reference; adding one would clarify the contribution for readers.
  2. The discussion of iterated embeddings would benefit from an explicit small example showing how redundancy is reduced compared to a single fixed X.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our work and the recommendation of minor revision. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper constructs invariants by restricting P-modules to representation-finite subposets X via order-embeddings and decomposing the restrictions using the exact restriction functor and its adjoints. These are standard facts from the representation theory of posets, applied directly without any reduction of new claims to fitted parameters, self-definitional loops, or load-bearing self-citations. The finite-representation-type hypothesis is an explicit design choice to guarantee direct-sum decompositions into indecomposables, the iterated-embedding refinement follows from the same categorical setup, and the generalization of signed barcodes is presented as an extension of existing literature results rather than a renaming or re-derivation by construction. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The construction rests on standard facts from the representation theory of posets and category theory; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • standard math The restriction functor from mod P to mod X is exact and admits both left and right adjoint functors (induction and co-induction).
    Explicitly stated as well-studied in the abstract.

pith-pipeline@v0.9.0 · 5852 in / 1238 out tokens · 45764 ms · 2026-05-24T04:15:57.773279+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages · 1 internal anchor

  1. [1]

    Asashiba, E

    H. Asashiba, E. G. Escolar, K. Nakashima, and M. Yoshiwaki, Approximation by interval-decomposables and interval resolutions of persistence modules, J. Pure Appl. Alg. 227 (2023), no. 10

    work page 2023

  2. [2]

    Asashiba, E

    H. Asashiba, E. G. Escolar, K. Nakashima, and M. Yoshiwaki, On approximation of 2D persistence modules by interval-decomposables, Journal of Computational Algebra 6-7 (2023)

    work page 2023

  3. [3]

    T. Aoki, E. G. Escolar, and S. Tada, Summand-injectivity of interval covers and monotonicity of interval resolution global dimensions, J. Appl. Comput. Topol. 9 (2025), no. 13

    work page 2025

  4. [4]

    Assem, D

    I. Assem, D. Simson, and A. Skowroński, Elements of the representaiton theory of associative algebras, volume 1: techniques of representation theory, London Math. Soc. Stud. Texts, volume 65, Cambridge University Press, Cambridge, 2006

    work page 2006

  5. [5]

    Auslander and

    M. Auslander and . Solberg, Relative homology and representation theory 1: Relative homology and homologically finite subcategories, Comm. Algebra 21 (1993), no. 9, 2995-3031

    work page 1993

  6. [6]

    Blanchette, T

    B. Blanchette, T. Brüstle, and E.J. Hanson, Exact structures for persistence modules. Preprint, 2023. arViv:2308.01790[math.AT]

    work page arXiv 2023

  7. [7]

    Blanchette, T

    B. Blanchette, T. Brüstle, and E.J. Hanson, Homological approximations in persistence theory. Canad. J. Math. 76 (2024), no. 1, 66-103

    work page 2024

  8. [8]

    M. B. Botnan and W. Crawley-Boevey, Decomposition of persistence modules. Proc. Amer. Math. Soc. 148 (2020), no. 11, 4581-4596

    work page 2020

  9. [9]

    Botnan, V

    M.B. Botnan, V. Lebovici, and S. Oudot. On Rectangle-Decomposable 2-Parameter Persistence Modules. Discrete Comput Geom 68 (2022), 1078–1101

    work page 2022

  10. [10]

    Botnan and M

    M. Botnan and M. Lesnick, Algebraic stability of zigzag persistence modules Algebr. Geom. Topol. 18 (2018), no. 6, 3133–3204

    work page 2018

  11. [11]

    Botnan and M

    M.B. Botnan and M. Lesnick, An introduction to multiparameter persistence. In: (A.B. Buan, H. Krause, and Ø. Solberg, eds.) Representations of Algebras and Related Structures, EMS Ser. Congr. Rep., volume 19, Eur. Math. Soc., Zürich, 2023

    work page 2023

  12. [12]

    M. B. Botnan, S. Oppermann, and S. Oudot, Signed barcodes for multi-parameter persistence via rank decompositions and rank-exact resolutions, Found. Comput. Math. (2024)

    work page 2024

  13. [13]

    M. B. Botnan, S. Oppermann, S. Oudot and L. Scoccola, On the bottleneck stability of rank decompositions of multi-parameter persistence modules, Adv. Math. 451 (2024)

    work page 2024

  14. [14]

    T.Bühler, Exact categories. Expo. Math. 28 (2010), no. 1, 1--69

    work page 2010

  15. [15]

    Carlsson and A

    G. Carlsson and A. Zomorodian. The theory of multidimensional persistence. Discrete Comput. Geom. 42 (2009), no. 1, 71–93

    work page 2009

  16. [16]

    Chachólski, A

    W. Chachólski, A. Guidolin, I. Ren, M. Scolamiero, and F. Tombari, Koszul complexes and relative homological algebra of functors over posets, Found. Comput. Math. (2024)

    work page 2024

  17. [17]

    Chambers and D

    E. Chambers and D. Letscher, Persistent homology over directed acyclic graphs. In (E. Chambers, B. Fasy, and L. Ziegelmeier, editors) Research in Computational Topology , Association for Women in Mathematics Series, volume 13, Springer, Cham, 2018

    work page 2018

  18. [18]

    Chaptal, Objets indécomposables dans certaines catégories de foncteurs

    N. Chaptal, Objets indécomposables dans certaines catégories de foncteurs. C. R. Acad. Sci. Paris Sér. A-B, 268 (1969), A934–A936

    work page 1969

  19. [19]

    T.K. Dey, W. Kim, and F. M\'emoli. Computing generalized rank invariant for 2-parameter persistence modules via zigzag persistence and its applications. Discrete Comput. Geom. 71 (2024), 67-94

    work page 2024

  20. [20]

    Dey and C

    T.K. Dey and C. Xin, Computing bottleneck distance for 2-D interval decomposable modules. In 34th International Symposium on Computational Geometry (SoCG 2018), LIPIcs. Leibniz Int. Proc. Inform., vol. 99, pp. 32:1-32:15, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2018

    work page 2018

  21. [21]

    Dräxler, I

    P. Dräxler, I. Reiten, S.O. Smal , and . Solberg, Exact Categories and Vector Space Categories, Trans. Amer. Math. Soc. 351 (1999)

    work page 1999

  22. [22]

    Gabriel and A.V

    P. Gabriel and A.V. Roĭter, Algebra VIII: Representations of finite-dimensional algebras, Encyclopaedia Math. Sci., vol. 73, Springer, Berlin, 1992, with a chapter by B. Keller

    work page 1992

  23. [23]

    Hiraoka, K

    Y. Hiraoka, K. Nakashima, I. Obayashi, and C. Xu. Refinement of interval approximations for fully comutative quivers. Preprint, 2023. arXiv:2310.03649v2 [math.AT]

    work page arXiv 2023

  24. [24]

    Kim and F

    W. Kim and F. M\'emoli, Generalized persistence diagrams for persistence modules over posets. J. Appl. Comput. Topol. 5 (2021), 533–581

    work page 2021

  25. [25]

    Landi, The Rank Invariant Stability via Interleavings

    C. Landi, The Rank Invariant Stability via Interleavings. In: Chambers, E., Fasy, B., Ziegelmeier, L. (eds) Research in Computational Topology. Association for Women in Mathematics Series, vol 13. (2018), Springer

    work page 2018

  26. [26]

    Interactive Visualization of 2-D Persistence Modules

    M. Lesnick and M. Wright, Interactive visualization of 2-D persistence modules. Preprint, 2015, arXiv:1512.00180 [math.AT]

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  27. [27]

    Oudot and L

    S. Oudot and L. Scoccola, On the stability of multigraded Betti numbers and Hilbert functions, SIAM J. Appl. Algebra Geom. 8 (2024), no. 1

    work page 2024

  28. [28]

    Quillen, Higher algebraic K-theory I

    D. Quillen, Higher algebraic K-theory I. In Algebraic K-theory, I: Higher K-theories (Proc. Conf., Battelle Memorial Inst., Seattle, Wash., 1972) pp. 85–147, Lecture Notes in Math., Vol. 341, 1973

    work page 1972

  29. [29]

    D. Simson. Integral bilinear forms, Coxeter transformations and Coxeter polynomials of finite posets. Linear Algebra Appl. 433 (2010), 699-717

    work page 2010