Pith. sign in

REVIEW 3 major objections 4 minor 26 references

Interval Multiplicities of Persistence Modules

T0 review · 3 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For any persistence module over a finite poset, the multiplicity of each interval module is a rank computation.

desk verdict Genuinely new rank formula for interval multiplicities over finite posets, resting partly on the authors' own prior presentations—one from an unreviewed arXiv preprint—but solid enough to warrant serious refereeing. read the letter →

arxiv 2411.11594 v6 pith:DXA56PUY submitted 2024-11-18 math.RT math.ATmath.RA

Hideto Asashiba (1 , 2 , 3) , Enhao Liu (3) ((1) Department of Mathematics , Shizuoka University , (2) Osaka Central Advanced Mathematical Institute , Osaka Metropolitan University , (3) Institute for Advanced Study
show 1 more author
Kyoto University)
This is my paper · ORCID
classification math.RTmath.ATmath.RA MSC 16G2016G7055N3162R40
keywords multi-parameterpersistenceintervalmultiplicitymodulefiniteposetrankformulaessentialcoverzigzag
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper establishes an explicit formula that computes how many times a given interval module appears as a direct summand of any persistence module over a finite poset, using only the ranks of matrices assembled from the module's structure maps. This generalizes the classical one-parameter persistence multiplicity formula to arbitrary finite posets, including multi-parameter grids. If correct, it turns interval multiplicity from a decomposition problem into a linear-algebra calculation, and it identifies exactly which maps matter, leading to a reduction technique that can compute multiplicities via zigzag persistence. The formula also yields the maximal interval-decomposable direct summand of a module and a criterion for interval-decomposability.

What carries the argument

The machinery is Auslander–Reiten theory for the incidence category $k[\mathbf{P}]$: the paper computes projective presentations of the interval module $V_I$, of the middle term $E$ of the almost split sequence starting at $V_I$, and of $\tau^{-1}V_I$, then converts Hom-space dimensions into ranks via Lemma 2.9. The assembled morphisms $\varepsilon_1$ and $\pi_1$ encode the pre-join and pre-meet combinatorics of $I$, and their block matrix with $\lambda$ produces the rank expression (3.32). The essential-cover result rests on these explicit morphisms: a poset map $\zeta$ covers the morphism $g$ if every entry has a preimage, and then $\operatorname{rank} M(g)$ is preserved under restriction.

What would settle it

Take a small finite poset such as a 2D-grid $G_{2,2}$ or $G_{4,2}$, construct a persistence module $M$ by explicit matrices, compute the right-hand side of (3.32) for every interval $I$, and compare with the multiplicities obtained by an independent decomposition of $M$ (for instance by hand or by a separate algorithm). A single mismatch would refute the formula; the paper's Example 3.38 performs this check for one module, and a broader sweep over random modules and all intervals would settle the claim.

Watch

Extended reading notes

Core claim

The central claim is Theorem 3.27: for every persistence module $M$ over a finite poset $\mathbf{P}$ and every interval $I$, the multiplicity $d_M(V_I)$ equals the rank of the block matrix $\begin{pmatrix} M(\varepsilon_1) & 0 \\ M(\lambda) & M(\pi_1) \end{pmatrix}$ minus $\operatorname{rank} M(\varepsilon_1)$ minus $\operatorname{rank} M(\pi_1)$, where $\varepsilon_1$, $\pi_1$, and $\lambda$ are built from structure maps of $M$ along the pre-join and pre-meet sets of $I$. This gives the first explicit rank-only formula for interval multiplicities in this generality, and it specializes to the familiar inclusion-exclusion formula in the one-parameter case. It also provides an essential-cover theorem: if an order-preserving map $\zeta: Z \to \mathbf{P}$ covers the matrix data needed for $I$, then the multiplicity is unchanged by restricting $M$ to $Z$, so when $Z$ is a zigzag poset the multiplicity can be read off from zigzag persistence of the filtration.

Load-bearing premise

The rank formula's correctness depends on the previously established projective presentations of $V_I$, $E$, and $\tau^{-1}V_I$ being correct; if any of those index sets or signs were wrong, the formula would fail.

Editorial extensions

If this is right

  • Interval multiplicities can be computed without decomposing $M$, as ranks of matrices.
  • The maximal interval-decomposable direct summand of $M$ can be read off, and $M$ is interval-decomposable exactly when its dimension vector matches the sum of these interval modules.
  • The formula shows which morphisms of $\mathbf{P}$ matter, enabling essential covers to smaller posets; when the smaller poset is zigzag, multiplicities come from zigzag persistence of the filtration without computing all structure maps.
  • In 2D-grids and bipath posets the formula specializes to practical matrix expressions, bypassing basis changes at global extrema in bipath persistence.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The rank formula likely extends to interval multiplicities in relative or truncated persistence settings, wherever the same projective presentation data can be lifted.
  • The essential-cover condition suggests a general optimization: search for the smallest poset $Z$ whose cover of the matrix data for $I$ preserves ranks, possibly connecting to existing algorithms that unfold multiparameter modules to zigzag modules.
  • One could test the formula's stability under perturbations of $M$: since ranks are lower semicontinuous, the multiplicity computed by the formula may be stable under sufficiently small noise in the structure maps, yielding a stability-type statement the paper does not address.
  • The formula's dependence on choice maps $c$ and $d$ is proven immaterial, but those choices could be exploited to select sparse or well-conditioned matrices for numerical computation.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper gives an explicit formula for the multiplicity d_M(V_I) of an interval module V_I in any persistence module M over a finite poset P, expressed in terms of ranks of matrices built from the structure maps of M. The central result is Theorem 3.27, abstracted as formula (1.2), which is obtained by combining the Auslander–Reiten formula of Theorem 3.3 with explicit projective presentations of V_I, τ^{-1}V_I, and the middle term E of the almost split sequence. The formula specializes to a simpler form for 2D grids (Theorem 3.36) and is used to introduce the notion of an essential cover ζ:Z→P, under which the multiplicity is preserved by restriction (Theorem 4.15). The final section applies these techniques to zigzag and bipath persistence computations, with worked examples.

Significance. If the main theorem is correct, the paper provides a genuinely useful generalization of the one-parameter persistent Betti number formula: it computes interval multiplicities directly from rank data without decomposing the module, and it identifies which structure maps are essential. The essential-cover results connect the rank formula to zigzag persistence algorithms, which is a valuable practical bridge. The paper is technically detailed: the reduction to Hom-space dimensions, the pushout construction of the almost split sequence, and the worked examples (Example 3.38, Examples 5.4–5.5) are carefully presented. The main caveat is that several load-bearing projective presentations are quoted from earlier papers, including an unreviewed arXiv preprint, rather than proved here.

major comments (3)
  1. [§3.1, Proposition 3.13] The projective presentation of V_U for a connected up-set U is the foundation of the whole formula, but it is restated from Asashiba et al. (2024, Proposition 5.10) with the proof omitted, and Proposition 3.34 is likewise stated without proof. The exact index sets sc1(I), sk1(I), the signs inside ε1 and π1, and the exactness of the sequences determine the block-rank expression (3.32); an error in any of these auxiliary statements would change the claimed multiplicity even though the surrounding Hom-space arguments are sound. Since Proposition 3.13 is quoted from an unreviewed arXiv preprint, please either include a self-contained proof (an appendix would suffice) or replace the reference by a peer-reviewed version.
  2. [§3.1.1, Remark 3.26] The assertion that formula (3.32) covers the injective case is not proved. The preceding Theorem 3.25 assumes m≥2, while the injective case is handled separately by Theorem 3.20 with the different expression (3.19). Since Theorem 3.27 is stated for all intervals, the paper should include a short verification that for I=↓b the index sets sk(⇓I) and sk1(I) are empty (so that M(π1) disappears) and that the remaining λ-block agrees with M(ε''1) under the choice map. This is a local gap, but it is load-bearing for the full statement of the main theorem.
  3. [§4, proof of Theorem 4.15] After deriving r = s + (rank L(g')_block - rank L(g')_diag), the proof concludes '≥ s' without justification. For an arbitrary matrix [A 0; C B], the difference rank[A 0; C B] - rank A - rank B can be negative, so the displayed implication is not automatic. The step is valid because applying formula (4.38) to M=L identifies this difference with d_L(VI) ≥ 0, but this should be stated explicitly; otherwise the inequality r ≥ s does not follow from the preceding equations.
minor comments (4)
  1. [Throughout] There are several typos: 'Auslandr-Reiten' in §1.2, 'examaple' in Notation 3.4, 'Cosider' at the start of Examples 5.4 and 5.5, 'filed' for 'field' in the Introduction, and 'we notice the reader' in Remark 5.8.
  2. [Examples 5.1, 5.3, 5.5] There are cross-reference mismatches: Example 5.1 appeals to 'Theorem 4.11' for the essential-cover property, but the relevant statement is Definition 4.11; Example 5.3 says 'adopting Theorem 3.29' where Notation 3.29 is meant; Example 5.5 refers to 'Theorem 4.10' when Lemma 4.9 or Definition 4.11 appears intended.
  3. [Lemma 3.39] Items (2) and (3) of Lemma 3.39 are printed identically; please clarify the intended distinction between the two statements, presumably one is an equality of dimension vectors and the other an equality of total dimensions.
  4. [Remark 3.31] The remark explains that missing columns in the minimal 2D-grid presentation are eliminated by column operations, but it does not specify the actual column operations. A one-line indication, or a reference to the exact proof in Asashiba et al. (2022), would make the minimal presentation easier to verify.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the rank formula for d_M(V_I) is a genuine derivation from Auslander–Reiten theory; the self-cited projective presentations are independent auxiliary lemmas, not the target result.

full rationale

The central formula (3.32) is an explicit, parameter-free rank expression built from structure maps of M. Its derivation combines the Auslander–Reiten multiplicity formula (Theorem 3.3, cited from Asashiba et al. 2017), the explicitly proved Lemma 2.9, and explicit projective presentations of V_I, tau^{-1}V_I, and the middle term E of the almost split sequence. Some of these presentations are not re-proved in this paper: Proposition 3.13 refers to Asashiba et al. 2024, Proposition 5.10; Lemma 3.30 restates Asashiba et al. 2022, Proposition 39; Proposition 3.34 is stated without proof. This is a legitimate omitted-proof and verification concern, but it is not circularity. The cited statements are parameter-free theorems about projective presentations of interval modules over up-sets and down-sets; they do not assume the multiplicity formula or any fitted values, and they are independent of the target quantity d_M(V_I). The paper does not define d_M(V_I) in terms of the ranks it computes, nor does it fit a parameter and then rename it as a prediction. The essential-cover definition (Definition 4.11) does require a rank formula, but Theorem 4.7 independently establishes such a formula for the standard g, and Theorem 4.15 is a conditional transfer statement rather than a circular derivation. No specific reduction of the conclusion to the hypotheses can be exhibited from the paper's own equations, so the derivation chain is substantially self-contained modulo standard representation theory and the cited independent auxiliary results.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No numbers are fitted to data; the formula is exact and parameter-free. The only arbitrary ingredients are choice maps c, d and a pair (b_j,a_i), and the theorem states the result is independent of these choices. The paper defines new mathematical objects (essential covers, maximal interval-decomposable summands) but these are definitions with proofs, not empirical entities requiring independent evidence.

assumptions (5)
  • standard math Krull-Schmidt theorem for finite-dimensional modules over finite k-linear categories
    Used in Theorem 2.6 to define multiplicities d_M(L).
  • standard math Auslander-Reiten theory, including existence of almost split sequences and the transpose/Nakayama functors for finite-dimensional algebras
    Theorem 3.3 and Propositions 3.23 and 3.24 rely on Gabriel's construction of almost split sequences.
  • standard math Cited theorem Asashiba et al. 2017, Theorem 3, expressing interval multiplicity via Hom-space dimensions
    Starting point for the derivation; accepted as an established published result.
  • standard math Projective presentation of interval modules over up-sets (Asashiba et al. 2024, Proposition 5.10, restated as Proposition 3.13; minimal version Asashiba et al. 2022, Proposition 39)
    Load-bearing external input for the matrices ε1 and π1; not re-proven in this paper.
  • domain assumption Finite poset P and finite-dimensional vector spaces over a field k (tameness)
    The whole framework of persistence modules over incidence categories requires these finiteness assumptions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Interval Multiplicities of Persistence Modules." pith.science (2026). https://pith.science/paper/DXA56PUY

@misc{pith2026241111594,
  author       = {Pith},
  title        = {Pith review of: Interval Multiplicities of Persistence Modules},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DXA56PUY}},
  note         = {Machine review of arXiv:2411.11594}
}
abstract

For any persistence module $M$ over a finite poset $\mathbf{P}$, and any interval $I$ of $\mathbf{P}$, we give a formula for the multiplicity $d_M(V_I)$ of the interval module $V_I$ in the indecomposable decomposition of $M$ in terms of the ranks of matrices consisting of structure linear maps of $M$. This generalizes the corresponding formula for 1-dimensional persistence modules. As applications, the formula enables us to compute the maximal interval-decomposable direct summand of $M$, to decide whether $M$ is interval-decomposable, and to detect properties determined by prescribed interval summands without decomposing $M$. We also give criteria, in terms of top and socle supports along minimal projective resolutions and injective coresolutions of $M$, restricting the intervals that can occur as direct summands of $M$ and thereby reduce the number of intervals to be computed in practice. Moreover, the formula tells us which morphisms of $\mathbf{P}$ are essential to compute $d_M(V_I)$. This leads to the notion of an order-preserving map $\zeta \colon Z \to \mathbf{P}$ essentially covering $I$, for which the multiplicity is preserved under the induced restriction functor $R \colon \operatorname{mod} \mathbf{P} \to \operatorname{mod} Z$. When $Z$ is of Dynkin type $\mathbb{A}$, also known as a zigzag poset, this allows the multiplicity to be computed more efficiently from the filtration level of topological spaces, without computing all structure linear maps of $M$. Finally, we give a formula for $d_M(V_I)$ in terms of a projective (or injective) (co)presentation of $M$. In the 2D-grid case, this is more practical since such resolutions can be computed from the filtration level of topological spaces.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

26 extracted references · 9 canonical work pages

  1. [1]

    Computational Geometry105–106, 101879 (2022) https://doi.org/10.1016/j.comgeo.2022.101879

    Asashiba, H., Buchet, M., Escolar, E.G., Nakashima, K., Yoshiwaki, M.: On interval decomposability of 2D persistence modules. Computational Geometry105–106, 101879 (2022) https://doi.org/10.1016/j.comgeo.2022.101879

    arXiv 2022

  2. [2]

    Journal of Pure and Applied Algebra227(10), 107397 (2023) https://doi.org/10.1016/j.jpaa

    Asashiba, H., Escolar, E.G., Nakashima, K., Yoshiwaki, M.: Approximation by interval-decomposables and interval resolutions of persistence modules. Journal of Pure and Applied Algebra227(10), 107397 (2023) https://doi.org/10.1016/j.jpaa. 2023.107397

    arXiv 2023

  3. [3]

    Journal of Computational Algebra 6–7, 100007 (2023) https://doi.org/10.1016/j.jaca.2023.100007

    Asashiba, H., Escolar, E.G., Nakashima, K., Yoshiwaki, M.: On approximation of 2d persistence modules by interval-decomposables. Journal of Computational Algebra 6–7, 100007 (2023) https://doi.org/10.1016/j.jaca.2023.100007

    arXiv 2023

  4. [4]

    arXiv (2023)

    Aoki, T., Escolar, E.G., Tada, S.: Summand-Injectivity of Interval Covers and Mono- tonicity of Interval Resolution Global Dimensions. arXiv (2023). https://doi.org/ 10.48550/arXiv.2308.14979

    arXiv doi:10.48550/arxiv.2308.14979 2023

  5. [5]

    Japan Journal of Industrial and Applied Mathematics (2024) https://doi.org/10.1007/s13160-024-00681-3

    Aoki, T., Escolar, E.G., Tada, S.: Bipath persistence. Japan Journal of Industrial and Applied Mathematics (2024) https://doi.org/10.1007/s13160-024-00681-3

    doi:10.1007/s13160-024-00681-3 2024

  6. [6]

    arXiv (2024)

    Asashiba, H., Gauthier, E., Liu, E.: Interval Replacements of Persistence Modules. arXiv (2024). https://doi.org/10.48550/arXiv.2403.08308

    work page doi:10.48550/arxiv.2403.08308 2024

  7. [7]

    Japan Journal of Industrial and Applied Mathematics 34(2), 489–507 (2017) https://doi.org/10.1007/s13160-017-0247-y

    Asashiba, H., Nakashima, K., Yoshiwaki, M.: Decomposition theory of modules: the case of kronecker algebra. Japan Journal of Industrial and Applied Mathematics 34(2), 489–507 (2017) https://doi.org/10.1007/s13160-017-0247-y

    work page doi:10.1007/s13160-017-0247-y 2017

  8. [8]

    Canadian Journal of Mathematics76(1), 66–103 (2024) https://doi.org/10

    Blanchette, B., Brüstle, T., Hanson, E.J.: Homological approximations in persistence theory. Canadian Journal of Mathematics76(1), 66–103 (2024) https://doi.org/10. 4153/s0008414x22000657

    work page 2024

Show all 26 references
  1. [9]

    Advances in Mathematics 369, 107171 (2020) https://doi.org/10.1016/j.aim.2020.107171

    Bauer, U., Botnan, M.B., Oppermann, S., Steen, J.: Cotorsion torsion triples and the representation theory of filtered hierarchical clustering. Advances in Mathematics 369, 107171 (2020) https://doi.org/10.1016/j.aim.2020.107171

    2020

  2. [10]

    Algebraic & Geometric Topology18(6), 3133–3204 (2018) https://doi.org/10.2140/agt.2018

    Botnan, M., Lesnick, M.: Algebraic stability of zigzag persistence modules. Algebraic & Geometric Topology18(6), 3133–3204 (2018) https://doi.org/10.2140/agt.2018. 18.3133 Botnan,M.:Intervaldecompositionofinfinitezigzagpersistencemodules.Proceedings of the American Mathematica...

    2018 doi

  3. [11]

    Foundations of Computational Math- ematics10(4), 367–405 (2010) https://doi.org/10.1007/s10208-010-9066-0 54

    Carlsson, G., De Silva, V.: Zigzag persistence. Foundations of Computational Math- ematics10(4), 367–405 (2010) https://doi.org/10.1007/s10208-010-9066-0 54

    2010 doi

  4. [12]

    In: Proceedings of the Twenty-Fifth Annual Symposium on Computa- tional Geometry, pp

    Carlsson, G., De Silva, V., Morozov, D.: Zigzag persistent homology and real-valued functions. In: Proceedings of the Twenty-Fifth Annual Symposium on Computa- tional Geometry, pp. 247–256. ACM, Aarhus Denmark (2009). https://doi.org/10. 1145/1542362.1542408

    2009

  5. [13]

    Dis- crete & Computational Geometry37(1), 103–120 (2007) https://doi.org/10.1007/ s00454-006-1276-5

    Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Dis- crete & Computational Geometry37(1), 103–120 (2007) https://doi.org/10.1007/ s00454-006-1276-5

    2007

  6. [14]

    Journal of Algebra and Its Applications14(5), 1550066 (2015) https://doi

    Crawley-Boevey, W.: Decomposition of pointwise finite-dimensional persistence mod- ules. Journal of Algebra and Its Applications14(5), 1550066 (2015) https://doi. org/10.1142/S0219498815500668

    2015 doi

  7. [15]

    LIPIcs, Volume 244, ESA 2022244, 43–14315 (2022) https://doi.org/10.4230/LIPICS.ESA.2022.43

    Dey, T.K., Hou, T.: Fast computation of zigzag persistence. LIPIcs, Volume 244, ESA 2022244, 43–14315 (2022) https://doi.org/10.4230/LIPICS.ESA.2022.43

    2022 doi

  8. [16]

    Discrete & Computational Geometry, 1–28 (2023) https://doi.org/10.1007/ s00454-023-00584-z

    Dey, T.K., Kim, W., Mémoli, F.: Computing generalized rank invariant for 2-parameter persistence modules via zigzag persistence and its applications. Discrete & Computational Geometry, 1–28 (2023) https://doi.org/10.1007/ s00454-023-00584-z

    2023

  9. [17]

    Algorithms and a computer algebra approach

    Dowbor, P., Mróz, A.: The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach. Colloquium Mathematicum107(2), 221–261 (2007) https://doi.org/10. 4064/cm107-2-4

    2007

  10. [18]

    Lipics, Volume 99, Socg 201899, 32–13215 (2018) https://doi.org/10

    Dey, T.K., Xin, C.: Computing bottleneck distance for 2-D interval decomposable modules. Lipics, Volume 99, Socg 201899, 32–13215 (2018) https://doi.org/10. 4230/LIPICS.SOCG.2018.32

    2018

  11. [19]

    arXiv (2024)

    Dey, T.K., Xin, C.: Computing Generalized Ranks of Persistence Modules via Unfolding to Zigzag Modules. arXiv (2024). https://doi.org/10.48550/arXiv.2403. 08110

    2024 doi

  12. [20]

    American Mathematical Society, Providence (2010)

    Edelsbrunner, H., Harer, J.: Computational Topology: An Introduction. American Mathematical Society, Providence (2010). https://doi.org/10.1090/mbk/069

    2010 doi

  13. [21]

    Discrete & Computational Geometry28(4), 511–533 (2002) https: //doi.org/10.1007/s00454-002-2885-2

    Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and sim- plification. Discrete & Computational Geometry28(4), 511–533 (2002) https: //doi.org/10.1007/s00454-002-2885-2

    2002 doi

  14. [22]

    In: Dlab, V., Gabriel, P

    Gabriel, P.: Auslander-reiten sequences and representation-finite algebras. In: Dlab, V., Gabriel, P. (eds.) Representation Theory I vol. 831, pp. 1–71. Springer, Berlin, Heidelberg (1980). https://doi.org/10.1007/BFb0089778

    1980 doi

  15. [23]

    arXiv (2023)

    Hiraoka, Y., Nakashima, K., Obayashi, I., Xu, C.: Refinement of Interval Approxi- mations for Fully Commutative Quivers. arXiv (2023). https://doi.org/10.48550/ 55 arXiv.2310.03649

    2023 arXiv

  16. [24]

    Journal of Applied and Computational Topology5(4), 533–581 (2021) https: //doi.org/10.1007/s41468-021-00075-1 Leszczyński, Z.: On the representation type of tensor product algebras

    Kim, W., Mémoli, F.: Generalized persistence diagrams for persistence modules over posets. Journal of Applied and Computational Topology5(4), 533–581 (2021) https: //doi.org/10.1007/s41468-021-00075-1 Leszczyński, Z.: On the representation type of tensor product algebras. Fund...

    2021

  17. [25]

    Prentice Hall, Upper Saddle River, New Jersey (2000)

    Munkres, J.R.: Topology, 2nd edn. Prentice Hall, Upper Saddle River, New Jersey (2000)

    2000

  18. [26]

    Discrete & Computa- tionalGeometry33(2),249–274(2005)https://doi.org/10.1007/s00454-004-1146-y 56

    Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete & Computa- tionalGeometry33(2),249–274(2005)https://doi.org/10.1007/s00454-004-1146-y 56

    2005 doi

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.