2019/08/26 by Ezra Miller, Miller, Ezra
Computer Science · Mathematics · #05E40 #06A07 #06F05 #06F20 #13A02 #13D02 #13E99 #13P20 #13P25 #14F05 #14P10 #14P15 #20M14 #32B20 #32S60 #52B99 #55Nxx #68W30 #92D15 #Algebraic Geometry (math.AG) #Algebraic Topology (math.AT) #Algebraic structures and combinatorial models #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #Representation Theory (math.RT) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1908.09750
openalex publication_date 2019/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.