{"id":"244b0b24-d6e0-48d2-8cfe-6a0a2b24c73d","arxiv_id":"1908.09750","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Tame modules over arbitrary posets are proved to have finite encodings, fringe presentations, indicator resolutions, and primary decompositions, leading to proofs of two sheaf-theoretic conjectures.","lead":"Ezra Miller develops a unified commutative and homological algebra for modules over partially ordered sets, centered on a new finiteness condition called tameness. The framework yields finite presentation, primary decomposition, and resolution theorems for multiparameter persistence, and it proves two conjectures of Kashiwara and Schapira about constructible sheaves.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified; central syzygy theorem and sheaf applications are internally sound, with only a motivational overstatement about computational feasibility.","rationale":"The reader's conditional verdict is driven by the abstract/body mismatch and by the imported sheaf theorem. The mismatch is real but not load-bearing for the central algebraic theorem. The import is not a circularity risk because the conjectures are proved from a theorem by the same authors that does not itself assert the conjectures. The internal proofs of Theorems 4.22, 6.19, and 7.12 are explicit and check out, and the reduction to Z^n is standard and complete. I therefore do not see a basis for changing the verdict.","tokens_in":48526,"tokens_out":41015,"duration_ms":484758,"concrete_test":"Verify that [KS18, Theorem 1.5 and Corollary 1.6] applies verbatim to the bounded derived category for any closed, full, subanalytic cone Q+, and that the equivalence is compatible with the compact-support and constructibility hypotheses used in Theorem 8.22; if extra hypotheses appear, adjust Corollaries 8.25 and 8.26 accordingly.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I find no load-bearing flaw in the central claim. Theorem 7.12 is supported by an explicit reduction: finite encoding embeds the finite poset into Z^n, the pushforward is finitely determined (Proposition 7.10), Theorem 6.19 supplies finite flange, flat, and injective presentations and resolutions, and pullback preserves indicator modules and connectedness (Example 4.10, Corollary 3.11). The reverse implications are handled by common refinements and the uptight construction. The derived applications rest on Theorem 8.15, imported from the published [KS18, Theorem 1.5 and Corollary 1.6]; treating a published theorem as a black box is standard, and Hypothesis 8.1 supplies the hypotheses it requires. The one genuine discrepancy is the abstract's claim of 'computationally feasible' data structures versus Section 1.4's explicit warning of combinatorial explosion outside very low parameter counts; this is an overstatement about motivation and implementation, not a flaw in the mathematical statements.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":48606,"tokens_out":3504,"duration_ms":39581,"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.","major_comments":[],"minor_comments":[{"comment":"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.","section":"Abstract and §1.4"},{"comment":"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.","section":"§8.3, proof of Corollary 8.26"},{"comment":"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.","section":"Example 4.24"},{"comment":"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.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":"This is a strong paper whose central claims appear sound. The only substantive reservations are presentational: the abstract oversells computational feasibility, and a few cross-references and typos need correction. The reliance on Theorem 8.15 from Kashiwara–Schapira is appropriate, and the paper's explicit statements about nonminimality and compact-support assumptions are a credit to its rigor. I would be comfortable seeing the paper accepted after a minor revision addressing the abstract's wording and the small textual issues."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the central syzygy theorem holds up, and the paper delivers on its main promises. The tameness framework for modules over arbitrary posets is genuinely new, and the proofs of the two Kashiwara–Schapira conjectures are real results, not just plausible sketches. This deserves a serious referee.\n\nThe genuinely new content is substantial: tameness characterized through constant subdivisions, finite encodings, fringe presentations, and upset/downset resolutions; the reduction of the whole edifice to finitely determined Z^n-modules; and the primary decomposition theory over polyhedral partially ordered groups. The author is honest about what is new, flagging Proposition 6.7 and Theorem 6.19 as such. The proofs are explicit and internally consistent, and the limitations that are stated—nonminimality of primary decomposition, the compact-support exclusion in the subanalytic case—are real and not hidden.\n\nThe main soft spot is the abstract's claim that the theory yields \"computationally feasible\" data structures. Section 1.4 explicitly warns of combinatorial explosion outside very low parameter counts, and no algorithm or complexity bounds are supplied. That is an overstatement about motivation and implementation, not a flaw in the mathematics. Softening the abstract would make it accurate. A second, minor point: the sheaf applications rest on Theorem 8.15, imported from Kashiwara–Schapira. Treating a published theorem as a black box is standard, but readers should know that the conjectures' proofs depend on that equivalence, and the paper does not re-prove it.\n\nI agree with the stress-test note that no load-bearing flaw exists. The reduction in Theorem 7.12 via finite encoding into Z^n is explicit, and the pullback/pushforward steps are accounted for. The category of tame modules is abelian, and the kernels/cokernels point is handled correctly with the restricted notion of tame morphism.\n\nWho is this for? Researchers in multiparameter persistence and microlocal sheaf theory will get real value. Commutative algebraists will find the polyhedral primary decomposition section useful. The paper is long and dense, but the structure is clear. I would send it to peer review and encourage the author to adjust the computational language. It is a serious contribution, not a routine extension.","headline":"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.","tokens_in":49224,"tokens_out":1046,"would_cite":true,"duration_ms":13886,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["13P25","05E40","32S60","55Nxx","06F20","13E99","13D02","32B20"],"pacs":[],"model":"deepseek-v4-flash","headline":"Tame poset modules admit finite presentations and resolutions","keywords":["poset modules","tameness","persistent homology","syzygy theorem","primary decomposition","constructible sheaves","multiparameter persistence","fringe presentation"],"falsifier":"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.","tokens_in":1931,"feed_emoji":"📐","tokens_out":4208,"duration_ms":103628,"temperature":0.7,"pith_summary":"Modules over a poset are families of vector spaces indexed by a partially ordered set, with a linear map for every relation; they arise naturally as persistent homology of filtered topological spaces. This paper claims that a single finiteness condition, tameness, meaning the module is constant on finitely many regions of the poset, plays the role of the noetherian hypothesis, and proves a syzygy theorem: tameness is equivalent to having a finite encoding by a finite poset, a finite fringe presentation by birth and death indicator modules, and a finite upset or downset resolution. The result gives every tame module finite presentations and resolutions, canonical primary decompositions when the poset is a polyhedral partially ordered group, and computationally meaningful data structures for real multiparameter persistent homology. The same algebraic statement, translated into sheaf language, proves two conjectures about constructible sheaves with microsupport in a cone.","feed_headline":"Tame poset modules admit finite presentations and resolutions","feed_subtitle":"A syzygy theorem unifies four notions of tameness and proves two conjectures on constructible sheaves.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"supplies minimal injective resolutions for finitely generated $\\mathbb{Z}^n$-graded modules, the base case for the finitely determined syzygy theorem.","marker":"[GW78]"},{"why":"supplies the Čech hull and Matlis duality facts that extend resolutions from finitely generated to finitely determined $\\mathbb{Z}^n$-modules.","marker":"[Mil00]"},{"why":"provides subanalytic triangulation, the constancy lemma for constructible sheaves, and the microsupport theory used in Section 8.","marker":"[KS90]"},{"why":"states the theorem identifying sheaves with microsupport in the negative polar cone with sheaves in the conic topology, the black box imported as Theorem 8.15.","marker":"[KS18]"},{"why":"states the first conjecture (existence of conic stratifications) proved as Corollary 8.26.","marker":"[KS17]"},{"why":"states the second conjecture (PL resolutions of PL sheaves) proved as Corollary 8.25.","marker":"[KS19]"}],"fun_headline_variants":["Tame poset modules: finite algebra, unified by syzygy theorem","Poset modules turn tame, yielding finite resolutions and decompositions","Syzygy theorem tames poset modules, unifying four finiteness notions","For poset modules, tameness replaces noetherian: finite algebra emerges"],"cache_read_input_tokens":51328,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Tame poset modules: finite algebra, unified by syzygy theorem","Poset modules turn tame, yielding finite resolutions and decompositions","Syzygy theorem tames poset modules, unifying four finiteness notions","For poset modules, tameness replaces noetherian: finite algebra emerges"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000206,"raw_usage":{"total_tokens":1447,"prompt_tokens":1049,"completion_tokens":398,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":665,"completion_tokens_details":{"reasoning_tokens":318}},"tokens_in":665,"tokens_out":398,"duration_ms":4644,"temperature":1.0,"reasoning_tokens":318,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:02:54.145160+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[],"review_version":1}