Local Characterizations for Decomposability of 2-Parameter Persistence Modules

Magnus Bakke Botnan, Vadim Lebovici, Steve OudotAlgebras 2023 · DOI · arXiv

Abstract

Decomposing 2-parameter persistence modules into simpler components is a central challenge in topological data analysis. This paper establishes a local-to-global characterization for rectangle-decomposability, proving that a module is composed of rectangle modules if and only if its restrictions to all $2 \times 2$ grids are rectangle-decomposable. Furthermore, the authors demonstrate that rectangles constitute the maximal subclass of interval modules for which such a local characterization holds, extending previous finite-grid results to continuous settings like $\mathbb{R}^2$.

Introduction

Topological Data Analysis (TDA) tracks how the shape of data—such as connected components and holes—evolves across different scales. In the standard 1-parameter setting, this evolution is captured by a "barcode," a simple decomposition into intervals. However, real-world applications often require multi-parameter persistence (e.g., varying both density and scale simultaneously). Unlike the 1D case, 2D persistence is mathematically "wild," meaning modules can be infinitely complex and lack a simple universal barcode.

The Challenge of 2D Persistence

To manage this complexity, researchers attempt to decompose 2D modules into "interval modules," which are simpler pieces supported on specific geometric shapes. A primary goal is to find efficient ways to determine if a large, complex module is composed entirely of these simpler building blocks.

Figure 1: A visualization of a 2-parameter persistence module supported on a staircase-shaped interval in the plane.

Ideally, one would use a "local characterization"—a method to verify global structure by examining small, manageable chunks of the module. While previous work achieved this for specific cases on finite grids, this paper generalizes the approach to the continuous plane and identifies the theoretical boundaries of such local-to-global checks.

Methodology

The authors utilize tools from representation and category theory to bridge local behavior with global properties:

  1. Weak Exactness: A local condition defined on any $2 \times 2$ grid within the parameter space.
  2. Functorial Filtrations: The construction of "rectangle filtrates"—submodules that isolate data living on specific rectangular supports.
  3. Counting Functors: A mechanism to determine the multiplicity of specific rectangle summands within a global decomposition.
  4. Poset Generalization: The theory is extended to any product of two totally ordered sets with a countable coinitial subset, making it applicable to $\mathbb{R}^2$.

Key Insights: The Local-to-Global Bridge

The paper identifies rectangle modules (axis-aligned rectangles) as a critical class. They are expressive enough to encode important invariants like the rank invariant, yet simple enough to be characterized locally.

Figure 2: Examples of local $2 \times 2$ restrictions used to verify the global decomposability of a module.

The central result, Theorem 2.9, states that a module is rectangle-decomposable if and only if all its restrictions to $2 \times 2$ grids are rectangle-decomposable. This effectively transforms a global search problem into a local verification task.

Crucially, the authors also prove a "negative result" in Theorem 2.13: if the library of shapes is expanded beyond rectangles (to include, for instance, L-shaped hooks), the $2 \times 2$ local check no longer suffices. This establishes rectangles as the largest possible class of interval modules admitting such a local characterization.

Conclusion and Future Work

By lifting the constraints of finite grids, this work provides a robust theoretical framework for 2-parameter persistence in continuous settings. While it establishes the limits of $2 \times 2$ testing for rectangles, future research may explore whether larger or differently shaped test grids could characterize broader classes of modules, or how these results might generalize to $n$-parameter persistence ($n > 2$).

Summary updated

BibTeX
@inproceedings{botnan2023local,
  author = {Magnus Bakke Botnan and Vadim Lebovici and Steve Oudot},
  title = {{Local Characterizations for Decomposability of 2-Parameter Persistence Modules}},
  booktitle = {Algebras},
  year = {2023},
  doi = {10.1007/s10468-022-10189-4},
}
Figure