REVIEW 4 minor 19 references
Modules over posets: commutative and homological algebra
T0 review · 0 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Tame poset modules admit finite presentations and resolutions
desk verdict A substantial, internally sound syzygy theorem for tame poset modules with real sheaf-theoretic payoff; the only notable blemish is an overstatement about computational feasibility in the abstract. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the indicator module $k[U]$ or $k[D]$ for an upset $U$ or downset $D$ of the poset: a vector space $k$ placed in every degree of $U$ or $D$ and zero elsewhere. Upset modules play the role of free modules, tracking births; downset modules play the role of injective modules, tracking deaths. A fringe presentation splices a finite direct sum of upset modules to a finite direct sum of downset modules through a monomial matrix of scalars, and an indicator resolution is a complex built from these modules with connected component maps. The mechanism that carries the argument is the reduction from an arbitrary poset $Q$ to finitely determined $\mathbb{Z}^n$-modules: any finite encoding poset embeds in $\mathbb{Z}^n$, and the classical syzygy theory for finitely determined modules transfers back along the poset map.
What would settle it
Construct a module over a poset that has a finite constant subdivision but no finite upset or downset resolution; the syzygy theorem says none exists. In the sheaf setting, a concrete test is to find a compactly supported subanalytically constructible sheaf with microsupport in the negative polar cone of $\mathbb{R}^n$ whose support admits no conic stratification, which would contradict the proven conjecture.
Extended reading notes
Core claim
The central discovery is that modules over arbitrary posets become as tractable as modules over noetherian commutative rings exactly when they are tame. Theorem 7.12, the syzygy theorem, says that for a $Q$-module $M$, being tame is equivalent to admitting a finite constant subdivision of $Q$, a finite poset encoding, a finite fringe presentation, a finite upset presentation or downset copresentation, and a finite upset or downset resolution. Any one of these structures can dominate any given finite encoding, and any given one of these structures can be refined to a finite constant subdivision. The proof reduces the general poset case to the already understood case of finitely determined $\mathbb{Z}^n$-modules: a finite encoding poset embeds into $\mathbb{Z}^n$, the module is pushed forward to a finitely determined module there, the classical syzygy theorem for finitely determined modules applies, and the resulting resolutions pull back to $Q$. This yields concrete consequences: every tame module over a polyhedral partially ordered group has a finite primary decomposition, and every compactly supported constructible sheaf whose microsupport lies in the negative polar cone has finite subanalytic upset and downset resolutions by indicator sheaves.
Load-bearing premise
The application to sheaves rests on an imported theorem from the cited literature: sheaves whose microsupport lies in the negative polar cone are the same as sheaves in the coarser conic topology, and this equivalence must hold in the bounded derived category. If that identification fails, the finite sheaf resolutions and the two conjectures that follow from them collapse.
Editorial extensions
If this is right
- Tame multiparameter persistence modules, including modules over real parameter spaces, have finite fringe presentations and finite indicator resolutions, so a computer can store births and deaths as finitely many semialgebraic upsets and downsets instead of infinitely many generators.
- Over polyhedral partially ordered groups, every downset-finite module has a finite primary decomposition, so each homology class is assigned a finite list of pure death types corresponding to faces of the positive cone.
- The two conjectures on constructible sheaves follow: a compactly supported constructible sheaf with microsupport in the negative polar cone has finite subanalytic upset and downset resolutions, and its support has a subordinate conic stratification.
- The theorem applies in cases where the module is not finitely generated, because tameness is materially weaker than the noetherian condition already over $\mathbb{Z}^n$.
- The equivalence preserves extra geometry: semialgebraic, piecewise-linear, and class X versions of tameness are carried through all parts of the syzygy theorem, and the subanalytic version holds for compact support.
Reading between the lines
- Because the proof embeds any finite encoding poset into $\mathbb{Z}^n$, tameness suggests a homological-dimension bound for poset modules in terms of the order dimension of their encoding posets, a notion the paper does not develop.
- The monomial-matrix form of a fringe presentation points to an algorithmic route for real multiparameter persistence: compute the semialgebraic boundaries where births and deaths occur rather than approximating them by lattice points.
- If constructibility is indeed captured by the conic topology, then local finiteness rather than finiteness of the constant subdivision may be enough for noncompact supports, connecting tameness to the phenomenon of ephemeral modules.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a commutative and homological algebra for modules over arbitrary posets, centered on a new finiteness condition called tameness. Tameness is characterized in several equivalent ways: finite constant subdivisions (topological), finite poset encodings (combinatorial), finite fringe presentations (algebraic), and finite upset or downset presentations and resolutions (homological). The main syzygy theorem (Theorem 7.12) is proved by an explicit reduction to finitely determined Z^n-modules via finite encodings and pushforwards, building on the finitely determined syzygy theorem (Theorem 6.19). Section 8 translates the syzygy theorem for complexes into the language of subanalytically constructible sheaves and derives two conjectures of Kashiwara and Schapira as Corollaries 8.25 and 8.26. The paper also develops primary decomposition over polyhedral partially ordered groups, with candid statements of its limitations, including nonminimality and the compact-support assumption in the subanalytic case.
Significance. If the results stand, the paper gives a robust and multiply-characterized finiteness notion for poset modules, replacing noetherian hypotheses in a setting where finite generation is too restrictive for motivating examples such as continuous multiparameter persistence. The syzygy theorem and its sheaf-theoretic corollaries are substantial: they provide finite indicator resolutions and conic stratifications for sheaves with microsupport in a negative polar cone, settling two conjectures from the Kashiwara–Schapira program. The paper is unusually explicit about the boundaries of its own theory: nonminimality of primary decomposition is stated and illustrated, and the compact-support exclusion in the subanalytic part of Theorem 7.12 is flagged. The reduction to finitely determined Z^n-modules is concrete and the key steps are proven, not merely asserted. The dependence on Theorem 8.15 is an import from published work by Kashiwara and Schapira rather than a circular assumption, and Hypothesis 8.1 supplies the requisite hypotheses; treating that theorem as a black box is standard practice. No load-bearing mathematical flaw was found.
minor comments (4)
- [Abstract and §1.4] The abstract's claim that the theory yields 'computationally feasible' data structures is stronger than what the paper establishes, and it is in tension with §1.4, which warns of combinatorial explosion outside the very lowest parameter counts and notes that poset encoding lacks desirable persistence features. I recommend softening the computational claim in the abstract to match the 'in principle' language used in the body.
- [§8.3, proof of Corollary 8.26] The reduction to compact support is imported from the proof of [KS18, Theorem 3.17] rather than reproduced. Since the conjecture being proved is [KS17, Conjecture 3.17], please clarify the exact citation for the reduction and state explicitly which hypotheses of that result are being invoked, so the reader can verify that the non-polyhedral generality is preserved.
- [Example 4.24] The cross-reference 'the diagonal strip R2-module M in Example 4.4' appears to be wrong: the diagonal strip module is discussed in Example 2.10, whereas Example 4.4 concerns k0 ⊕ k[R2]. Please correct the reference.
- [Throughout] There are several typographical errors that should be fixed in a revision: §1.4 'tt stipulates' should be 'it stipulates'; §1.8 'commutatve' should be 'commutative'; §5.4 'aribtary' should be 'arbitrary'; and the garbled symbol '/integerdivide' appears in a number of places in Section 3.1 and should be replaced by the intended set difference notation.
Circularity Check
No circularity found; the syzygy theorem reduces to independent published theory of finitely determined Z^n-modules.
full rationale
The derivation chain is self-contained in the relevant sense. Theorem 7.12 proves the tameness equivalences by definition (Definition 2.12), by Theorem 4.22 relating constant subdivisions to finite encodings, and by reduction to Theorem 6.19 for finitely determined Z^n-modules via finite poset embedding, pushforward, and pullback. Theorem 6.19 rests on Proposition 6.7, proved from the published work of Goto-Watanabe [GW78], together with Matlis duality; these are external results with stated hypotheses that do not assume tameness or the Kashiwara-Schapira conjectures. The derived-category applications import Theorem 8.15 from [KS18, Theorem 1.5 and Corollary 1.6] as a published black box; this is standard practice and not circular, since the imported equivalence has its own stated hypotheses (Hypothesis 8.1) and is not the target conjecture. Corollaries 8.25 and 8.26 follow by imposing finiteness and restricting the resolutions supplied by Theorem 8.22, which is itself a translation of Theorem 7.17; the conjectures are not used as inputs. The only noticeable discrepancy is the abstract's motivational phrase 'computationally feasible, topologically interpretable data structures' against Section 1.4's explicit warning of combinatorial explosion outside very low parameter counts; this is a rhetorical overstatement about implementation, not a circular derivation step. Overall, no prediction is fitted to its own input, no load-bearing argument reduces by construction to a self-citation, and no central claim is assumed in the course of proving it.
Assumptions & free parameters
assumptions (4)
- domain assumption Microsupport-conic topology equivalence (Theorem 8.15 of this paper, citing [KS18, Theorem 1.5 and Corollary 1.6])
- standard math Every finite poset has finite order dimension and embeds into Z^n for some n.
- domain assumption Subanalytic sets admit subanalytic triangulations (cited from [KS90]).
- standard math The category of modules over a poset is abelian, and ordinary homological algebra applies.
invented entities (3)
-
Tameness (tame poset module)
-
Fringe presentation and monomial matrix notation
-
Polyhedral partially ordered group
Cite this review
Pith. "Pith review of Modules over posets: commutative and homological algebra." pith.science (2026). https://pith.science/paper/27MHOTRK
@misc{pith2026190809750,
author = {Pith},
title = {Pith review of: Modules over posets: commutative and homological algebra},
year = {2026},
howpublished = {\url{https://pith.science/paper/27MHOTRK}},
note = {Machine review of arXiv:1908.09750}
}
read the original abstract
The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary decompositions, and resolutions. Interpreting this finiteness in the language of derived categories of subanalytically constructible sheaves proves two conjectures due to Kashiwara and Schapira concerning sheaves with microsupport in a given cone. The motivating case is persistent homology of arbitrary filtered topological spaces, especially the case of multiple real parameters. The algebraic theory yields computationally feasible, topologically interpretable data structures, in terms of birth and death of homology classes, for persistent homology indexed by arbitrary posets. The exposition focuses on the nature and ramifications of a suitable finiteness condition to replace the noetherian hypothesis. The tameness condition introduced for this purpose captures finiteness for variation in families of vector spaces indexed by posets in a way that is characterized equivalently by distinct topological, algebraic, combinatorial, and homological manifestations. Tameness serves both the theoretical and computational purposes: it guarantees finite primary decompositions, as well as various finite presentations and resolutions all related by a syzygy theorem, and the data structures thus produced are computable in addition to being interpretable. The tameness condition and its resulting theory are new even in the finitely generated discrete setting, where being tame is materially weaker than being noetherian.
Figures
Reference graph
Works this paper leans on
-
[1]
[AD80] S. Abeasis and A. Del Fra, Degenerations for the representations of an equioriented q uiver of type Am, Boll. Un. Mat. Ital. Suppl. (1980) no. 2, 157–171. [ADK81] S. Abeasis, A. Del Fra, and H. Kraft, The geometry of representations of Am, Math. Ann. 256 (1981), no. 3, 401–418. MODULES OVER POSETS: COMMUTATIVE AND HOMOLOGICAL ALGEBRA 6 1 [ASW15] Ze...
work page 1980
-
[4]
Decomposition of persistence modules
arXiv:math.RT/1811.08946v2 [CSZ09] Gunnar Carlsson, Gurjeet Singh, and Afra Zomorodian, Computing multidimensional persistence, Algorithms and computation, Lecture Notes in Computer Science V ol. 5878, Springer, Berlin, 2009, pp. 730–739. [CZ09] Gunnar Carlsson and Afra Zomorodian, The theory of multidimensional persistence , Dis- crete and Computational ...
work page Pith review arXiv 2009
-
[8]
Functors on Posets Left Kan Extend to Cosheaves: an Erratum
arXiv:math.CT/1907.09416v1 [DRS72] Peter Doubilet, Gian-Carlo Rota, and Richard Stanley, On the foundations of combinatorial theory (VI): The idea of generating function , Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (Univ. California, Berkele y, 1970/1971), Vol. II: Probability theory, pp. 267–318, Univ. Californ...
work page Pith review arXiv 1907
-
[13]
arXiv: math.AG/1805.00349v3 [KN09] N. S. Khripchenko and B. V. Novikov, Finitary incidence algebras , Communications in Algebra 37 (2009), no. 5, 1670–1676. [Knu08] Kevin P. Knudson, A refinement of multi-dimensional persistence , Homology Homotopy Appl. 10 (2008), no. 1, 259–281. [KMS06] Allen Knutson, Ezra Miller, and Mark Shimozono, Four positive formul...
work page Pith review arXiv 2009
-
[15]
Madden and Trevor McGuire, Neighbors, generic sets and Scarf-Buchberger hy- persurfaces, preprint,
http:/ /www.math.harvard.edu/˜lurie/papers/ HA.pdf, dated August 10, 2017 and accessed 30 August 2017 [MMc15] James J. Madden and Trevor McGuire, Neighbors, generic sets and Scarf-Buchberger hy- persurfaces, preprint,
work page 2017
-
[16]
Neighbors, Generic Sets and Scarf-Buchberger Hypersurfaces
arXiv:math.CO/1511.08224 [Mil00] Ezra Miller, The Alexander duality functors and local duality with monom ial support, Jour- nal of Algebra 231 (2000), 180–234. [Mil02] Ezra Miller, Cohen–Macaulay quotients of normal semigroup rings via irr educible resolu- tions, Math. Res. Lett. 9 (2002), no. 1, 117–128. [Mil15] Ezra Miller, Fruit flies and moduli: inter...
work page Pith review arXiv 2000
-
[17]
arXiv:math.AT/1709.08155 [Mil19a] Ezra Miller, Essential graded algebra over polynomial rings with real ex ponents, draft,
-
[19]
A presentation of general multipersistence modules computable in polynomial time?
arXiv:math.AT/ 1210.1932v1 [Puu18] Ville Puuska, personal communications, 2017–2018. [Rie40] Frigyes Riesz, Sur quelques notions fondamentales dans la th´ eorie g´ en´ erale des op´ erations lin´ eaires, Annals of Math. 41 (1940), 174–206. [SCL+16] Martina Scolamiero, Wojciech Chach´ olski, Anders Lundman, Ry an Ramanujam, and Se- bastian ¨Oberg, Multidim...
work page Pith review arXiv 1940
Show all 19 references
-
[990]
arXiv:math.AT/1705.00955v3 [KS18] Masaki Kashiwara and Pierre Schapira, Persistent homology and microlocal sheaf theory , J
[KS17] Masaki Kashiwara and Pierre Schapira, Persistent homology and microlocal sheaf theory , preprint version of [KS18a]. arXiv:math.AT/1705.00955v3 [KS18] Masaki Kashiwara and Pierre Schapira, Persistent homology and microlocal sheaf theory , J. of Appl. and Comput. Topolog...
2018 arXiv
-
[1986]
[GW78] Shiro Goto and Keiichi Watanabe, On graded rings, II ( Zn-graded rings), Tokyo J. Math. 1 (1978), no. 2, 237–261. [HOST19] Heather A. Harrington, Nina Otter, Hal Schenck, and Ulr ike Tillmann, Stratifying multipa- rameter persistent homology, SIAM J. Alg. Geom., to appe...
1978 arXiv
-
[1997]
doi:10.1007/978-1-4612- 2008-4 [Tre09] David Treumann, Exit paths and constructible stacks , Compos. Math. 145 (2009), no. 6, 1504–1532. Mathematics Department, Duke University, Durham, NC 27708 Website: http://math.duke.edu/people/ezra-miller
2009 doi
-
[2005]
[NR72] L
[MT19] Ezra Miller and Ashleigh Thomas, Persistence distances via primary decomposition , draft. [NR72] L. A. Nazarova and A. V. Ro ˘ ıter, Representations of partially ordered sets (in Russian), Investigations on the theory of representations, Zap. Nauˇ cn. Sem. Leningrad. Ot...
1972 doi
-
[2010]
[ELZ02] Herbert Edelsbrunner, David Letscher, and Afra Zomoro dian, Topological persistence and simplification, Discrete and computational geometry and graph drawing (Columb ia, SC, 2001), Discrete Comput. Geom. 28 (2002), no. 4, 511–533. [GC17] Oliver G¨ afvert and Wojciech Ch...
2002
-
[2014]
arXiv:math.AT/1303.3255v2 [Cur19] Justin Curry, Functors on posets left Kan extend to cosheaves: an erratum , preprint,
-
[2015]
arXiv:math.AT/1512.00180 [Lur17] Jacob Lurie, Higher algebra , preprint,
-
[2016]
Clifford, Partially ordered abelian groups , Annals of Math
[Cli40] Alfred H. Clifford, Partially ordered abelian groups , Annals of Math. 41 (1940), 465–473. [Coa03] Iustin Coandˇ a, On the Bernstein–Gelfand–Gelfand correspondence and a res ult of Eisenbud, Fløystad, and Schreyer , J. Math. Kyoto Univ. 43 (2003), no. 2, 429–439. [CEH07...
1940 arXiv
-
[2017]
arXiv:math.AT/ 1206.1819v1 62 EZRA MILLER [Ghr08] Robert Ghrist, Barcodes: the persistent topology of data , Bull. Amer. Math. Soc. (N.S.) 45 (2008), no. 1, 61–75. [Goo86] Kenneth R. Goodearl, Partially Ordered Abelian Groups with Interpolation , Mathematical Surveys and Monog...
2008 arXiv
-
[2019]
43 (1942), 298–331
arXiv:math.AT/1902.09933v1 [Bir42] Garrett Birkhoff, Lattice-ordered groups, Annals of Math. 43 (1942), 298–331. [Bla07] Seth S. Blair, Wing vein patterning in Drosophila and the analysis of intercellular signaling , The Annual Review of Cell and Developmental Biology 23 (2007)...
1942 arXiv
-
[3432]
[BH11] Paul Bendich and John Harer, Persistent intersection homology , Found. Comput. Math. 11 (2011), no. 3, 305-336. [BP19] Nicolas Berkouk and Fran cois Petit, Ephemeral persistence modules and distance compar- ison, preprint,
2011
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.