Pith. sign in

REVIEW

Saecular persistence

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.04927 v2 pith:G7K4ROC3 submitted 2021-12-09 math.CT math.AT

classification math.CTmath.AT
keywords persistencesaeculardecompositionmathbfmodulesapplicationscategorygeneralized
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

A persistence module is a functor $f: \mathbf{I} \to \mathsf{E}$, where $\mathbf{I}$ is the poset category of a totally ordered set. This work introduces saecular decomposition: a categorically natural method to decompose $f$ into simple parts, called interval modules. Saecular decomposition exists under generic conditions, e.g., when $\mathbf{I}$ is well ordered and $\mathsf{E}$ is a category of modules or groups. This represents a substantial generalization of existing factorizations of 1-parameter persistence modules, leading to, among other things, persistence diagrams not only in homology, but in homotopy. Applications of saecular decomposition include inverse and extension problems involving filtered topological spaces, the 1-parameter generalized persistence diagram, and the Leray-Serre spectral sequence. Several examples -- including cycle representatives for generalized barcodes -- hold special significance for scientific applications. The key tools in this approach are modular and distributive order lattices, combined with Puppe exact categories.

Discussion (0). Continue with ORCID to comment.

Pith tools