Papers
Topics
Authors
Recent
2000 character limit reached

Functorial Framework for Persistent Homology

Updated 5 January 2026
  • The paper establishes that persistent homology exhibits local functoriality through a categorical framework that leverages geometric symmetries, yet global functoriality is obstructed by non-geometric transformations.
  • It defines enriched data-set categories and Grothendieck graphs to systematically encode the structure and symmetries of data, enabling decomposition into canonical blocks.
  • The work demonstrates that set-equivariant operators facilitate the formation of natural transformations, offering practical tools to analyze symmetry-induced features in persistence modules.

A functorial framework for persistent homology provides a categorical language for encoding, transferring, and enriching the algebraic and topological invariants derived from data via persistent homology. Central to this approach is the identification and exploitation of functoriality: the property that persistence invariants behave coherently under morphisms of data, often via the structure of categories, functors, and natural transformations. Functorial frameworks allow for an explicit accounting of symmetries, equivariances, decompositions, and the precise scope and limitations of persistent homology as a categorical invariant. Recent advances formalize this perspective by introducing categories of enriched data sets, colored directed graphs, and set-equivariant operators; providing precise statements and counterexamples regarding the global functoriality of persistent homology; and establishing foundational theorems for decomposing such structures into canonical blocks, all as detailed in "Landscapes of Data Sets and Functoriality of Persistent Homology" (Chacholski et al., 2020).

1. Enriched Data-Set Categories and Morphisms

An enriched data set—termed an "incarnation"—is a pair (Φ,M)(\Phi, M), where Φ={φ1,,φm}\Phi=\{\varphi_1,\ldots,\varphi_m\} is a finite set of real-valued functions (measurements) on a finite domain XX, and MEndΦ(X)M \subseteq \operatorname{End}_{\Phi}(X) is a chosen set of allowed domain endomorphisms that preserve the set Φ\Phi under composition, i.e., for every gMg \in M, φgΦ\varphi \circ g \in \Phi for all φΦ\varphi \in \Phi. The collection EndΦ(X)\operatorname{End}_{\Phi}(X) forms the structure monoid of Φ\Phi, and the pair (Φ,M)(\Phi, M) is referred to as a monoid incarnation if MM is a submonoid, or group incarnation if MM is a subgroup.

Morphisms between incarnations are set-equivariant operators (SEOs) (α,T):(Φ,M)(Ψ,N)(\alpha, T):(\Phi, M) \to (\Psi, N), where α:ΦΨ\alpha:\Phi \to \Psi and T:MNT:M \to N satisfy the condition: α(φg)=α(φ)T(g)\alpha(\varphi \cdot g) = \alpha(\varphi) \cdot T(g) for all φΦ,gM\varphi \in \Phi, g \in M. If TT is a homomorphism of monoids/groups, the SEO is said to be monoid-equivariant (MEO) or group-equivariant (GEO), respectively.

Operations such as product and coproduct in the base category of data sets lift to incarnations, and a decomposition theorem (Proposition 6.1) asserts that every incarnation (Φ,M)(\Phi, M) canonically splits (up to SEO-isomorphism) as a coproduct of block-incarnations according to the orbits of MM on Φ\Phi (Chacholski et al., 2020).

2. Grothendieck Graph Data Structure

Each incarnation (Φ,M)(\Phi, M) is encoded by a Grothendieck graph G=(V=Φ,M,E)G=(V=\Phi, M, E), where the edge set E={(φ,g,ψ)ψ=φg,gM}E = \{ (\varphi, g, \psi)\mid \psi = \varphi \circ g, g \in M \} is colored by elements of MM. From every vertex φ\varphi and color gg, there is a unique outgoing gg-edge, satisfying a bijectivity condition on projections. This structure is formalized as the category GrMV\operatorname{Gr}_M V, whose morphisms are composable triples with group or monoid multiplication in the color. Morphisms of Grothendieck graphs correspond to pairs (α,T)(\alpha, T) as above that preserve the edge structure.

The assignment (Φ,M)(Φ,M,E)(\Phi, M) \mapsto (\Phi, M, E), together with SEOs as morphisms, defines a fully faithful embedding of the category of incarnations ("Nirvana") into the category of colored directed graphs ("GGraph") (Chacholski et al., 2020).

3. Decomposition Theorems and Morphism Formation

The categorical structure supports fine decompositional and morphism-forming properties:

  • Bases and Dimension: A basis for (Φ,M)(\Phi, M) is an independent set ΩΦ\Omega \subset \Phi generating Φ\Phi under MM-action, with all bases sharing the same cardinality ("dimension"). In the transitive group case, dimension is $1$.
  • Morphism Extension: Every SEO is determined by its action on a basis, subject to a relation-preserving condition: for compatible relations in the source, their images under α\alpha and TT must maintain those relations in the target. This yields unique SEO extensions (Proposition 4.8).
  • Block Diagonalization: Every incarnation (Φ,M)(\Phi, M) decomposes as a coproduct of its MM-orbit blocks, with the corresponding SEO given by the identity on blocks and the diagonal action of MM across blocks (Proposition 6.1).

These properties encode the intrinsic symmetry and orchestrate the classification of morphisms between incarnations (Chacholski et al., 2020).

4. Global vs. Local Functoriality of Persistent Homology

Persistent homology, defined as PHdΦ:(Φ,M,E)opTame([0,)×R,Vect)PH_d^{\Phi}:(\Phi, M, E)^{op}\to Tame([0,\infty)\times \mathbb{R},Vect), assigns to each measurement the persistent homology module and to each domain action the induced homology map. However, this assignment fails to extend to a global functor NirvanaFun(,Tame)Nirvana \to Fun(-, Tame): non-geometric SEOs lack canonical maps between Vietoris–Rips complexes, as demonstrated by a sign-flip counterexample that destroys comparability between the persistent modules of the transformed data (Chacholski et al., 2020). Thus, persistent homology is not a functor on the entire category of incarnations; its global functoriality is obstructed except for the subcategory of geometric SEOs.

5. Local Functoriality via Grothendieck Graphs

Despite failures at the global level, for each fixed incarnation (Φ,M)(\Phi, M), the assignment φPHd(φ)\varphi \mapsto PH_d(\varphi) and (φ,g,φg)PHdg(φ)(\varphi, g, \varphi g) \mapsto PH_d^{-g}(\varphi) (i.e., functorially pulling back along domain symmetries) yields a genuine contravariant functor from the Grothendieck graph (Φ,M,E)op(\Phi, M, E)^{op} to Tame([0,)×R,Vect)Tame([0,\infty)\times \mathbb{R}, Vect). The local functoriality theorem asserts that such confined functoriality is always respected, and the composition rules hold by the functorial properties of domain maps (Chacholski et al., 2020).

6. Role of Equivariant Operators and Symmetry Extension

Set-equivariant operators allow for the comparison of structures not visible to persistent homology. Geometric SEOs (i.e., those corresponding to actual maps between domains) enable the definition of natural transformations between persistent homology functors, preserving structure. Non-geometric SEOs—such as those corresponding to unit changes or domain modifications—encode symmetries acting beyond the scope of persistent homology functoriality but organize complementary invariants. By composing persistent homology on incarnations with SEOs, both functorial and equivariant analytical tools are available, broadening the invariant landscape associated with a data set (Chacholski et al., 2020).

7. Synthesis, Examples, and Implications

The functorial framework subsumes the classical pipeline of persistent homology: starting with a data set of functions, endowing it with symmetries MM to form an incarnation, and then forming the Grothendieck graph to encode those symmetries. Persistent homology then acts functorially on this object at the local (fixed-incarnation) level, even as global functoriality is precluded by non-geometric transformations. Canonical decomposition theorems guarantee that every incarnation splits into MM-orbits; morphisms are uniquely determined by their effects on bases.

A central example is the case where XS1X \subset S^1, and MM is generated by rotation, so the persistent homology functor becomes S1S^1-equivariant and detects H1H_1-classes invisible in the absence of symmetry. Consequently, the persistent homology of data sets with internal symmetries is categorically positioned: local functoriality is preserved along geometric symmetries, while the broader organizational role of SEOs structures all measurement-based operators, revealing and situating the extent of the functorial reach of persistent homology within a rigorous categorical framework (Chacholski et al., 2020).


References:

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Whiteboard

Topic to Video (Beta)

Follow Topic

Get notified by email when new papers are published related to Functorial Framework for Persistent Homology.