pith. sign in

arxiv: 1706.04095 · v2 · pith:XPB6QR4Enew · submitted 2017-06-13 · 🧮 math.CT

Theory of interleavings on categories with a flow

classification 🧮 math.CT
keywords categoriesdistanceinftyinterleavingfunctorsclasscolaxequivariant
0
0 comments X
read the original abstract

The interleaving distance was originally defined in the field of Topological Data Analysis (TDA) by Chazal et al. as a metric on the class of persistence modules parametrized over the real line. Bubenik et al. subsequently extended the definition to categories of functors on a poset, the objects in these categories being regarded as `generalized persistence modules'. These metrics typically depend on the choice of a lax semigroup of endomorphisms of the poset. The purpose of the present paper is to develop a more general framework for the notion of interleaving distance using the theory of `actegories'. Specifically, we extend the notion of interleaving distance to arbitrary categories equipped with a flow, i.e. a lax monoidal action by the monoid $[0,\infty)$. In this way, the class of objects in such a category acquires the structure of a Lawvere metric space. Functors that are colax $[0,\infty)$-equivariant yield maps that are $1$-Lipschitz. This leads to concise proofs of various known stability results from TDA, by considering appropriate colax $[0,\infty)$-equivariant functors. Along the way, we show that several common metrics, including the Hausdorff distance and the $L^{\infty}$-norm, can be realized as interleaving distances in this general perspective.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. It's All About Covers: Persistent Homology of Cover Refinements

    math.AT 2026-02 unverdicted novelty 8.0

    Cover refinements enable a near-linear-size approximation to the Vietoris-Rips filtration with unconditional log-3 interleaving that preserves persistent homology.

  2. Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs

    cs.CG 2025-04 unverdicted novelty 6.0

    Presents ILP formulations to bound the interleaving distance on mapper graphs, with evaluation on small examples and benchmark datasets.