Fibered Barcode in Multi-Parameter TDA

• Fibered barcode is a topological invariant that extracts one-dimensional barcodes from multi-parameter persistence modules via restrictions to non-negative affine lines.
• It leverages an augmented arrangement for efficient computation and real-time query support, ensuring stability and a bounded Lipschitz metric.
• Its sheaf-theoretic reinterpretation and equivalence to projected barcodes bridge algebraic and combinatorial methods for scalable data analysis.

The fibered barcode is a central invariant assigned to multi-parameter persistence modules, particularly bipersistence modules, arising in topological data analysis. It encapsulates the collection of one-dimensional barcodes obtained by restricting the module to affine lines of non-negative slope and thus quantifies the persistence of topological features across multiple scales and directions. Fibered barcodes enjoy desirable properties of computability, stability, and efficient query support via specialized data structures. Recent advances have established fibered barcodes as instances of projected barcodes in sheaf-theoretic frameworks and have enabled their scalable computation and real-time visualization.

1. Definition and Formal Structure

Let $M$ be a bipersistence module, defined as a covariant functor $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$, with $\mathbb{k}$ a field and $\leq$ the product order. For any non-negatively sloped affine line $\ell \subset \mathbb{R}^2$ (parametrized as $\ell = \{u + t w \mid t \in \mathbb{R}\}$, $u \in \mathbb{R}^2$, $w = (w_1, w_2)$, $w_1, w_2 \geq 0$), the restriction $M|_\ell$ becomes a one-parameter persistence module: $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$0. The fibered barcode $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$1 is defined as the assignment from $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$2 to the barcode of $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$3,

$$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$4

where $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$5 is the multiset of intervals describing persistent features on $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$6 (Lesnick et al., 8 Nov 2025). For $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$7-parameter modules $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$8, the fibered barcode generalizes by considering restrictions to affine lines of positive slope in $$M: (\mathbb{R}^2, \leq) \to \mathrm{Vect}_\mathbb{k}$$9.

Sheaf-theoretic reinterpretation positions $\mathbb{k}$0 as a sheaf $\mathbb{k}$1 on $\mathbb{k}$2 with microsupport in $\mathbb{k}$3, where $\mathbb{k}$4 and $\mathbb{k}$5 (Berkouk et al., 2022). The restriction to a line $\mathbb{k}$6 is realized functorially via pullback and pushforward:

$\mathbb{k}$7

where $\mathbb{k}$8 is projection and $\mathbb{k}$9 identifies $\leq$0 with $\leq$1.

2. Properties and Theoretical Guarantees

Fibered barcodes exhibit several key properties:

• Stability: For modules $\leq$2 with interleaving distance $\leq$3, the bottleneck distance of barcodes satisfies

$\leq$4

for every line $\leq$5, so $\leq$6 is $\leq$7-Lipschitz for these metrics (Lesnick et al., 8 Nov 2025).

• Finiteness of Combinatorial Types: Despite uncountably many lines, only finitely many combinatorial types of slice barcodes occur, formalized by a line arrangement in slope space partitioning the simplex of slopes into $\leq$8 open cells, each constant up to affine reparameterization (Lesnick et al., 8 Nov 2025).
• Equivalence to Projected Barcodes: In the sheaf-theoretic setting, fibered barcodes are instances of projected barcodes, obtained via the derived pushforward $\leq$9 for a linear functional $\ell \subset \mathbb{R}^2$0, thus connecting algebraic and sheaf-theoretic perspectives (Berkouk et al., 2022).

3. Computational Framework: The Augmented Arrangement

Efficient querying and computation of fibered barcodes leverage the augmented arrangement data structure:

• Critical-Slope Arrangement: Given a minimal presentation $\ell \subset \mathbb{R}^2$1 (with $\ell \subset \mathbb{R}^2$2 generators and $\ell \subset \mathbb{R}^2$3 relations), construct an arrangement of $\ell \subset \mathbb{R}^2$4 affine lines in the slope simplex $\ell \subset \mathbb{R}^2$5. Each line is defined by $\ell \subset \mathbb{R}^2$6, where $\ell \subset \mathbb{R}^2$7 and $\ell \subset \mathbb{R}^2$8 are grades of generators and relations, respectively.
• Barcode-Templates: For each open cell $\ell \subset \mathbb{R}^2$9 in $\ell = \{u + t w \mid t \in \mathbb{R}\}$0 (resulting from critical lines), select an interior slope $\ell = \{u + t w \mid t \in \mathbb{R}\}$1, form the barcode of $\ell = \{u + t w \mid t \in \mathbb{R}\}$2 restricted to the corresponding line, and store pairs $\ell = \{u + t w \mid t \in \mathbb{R}\}$3—birth and death grades—in a barcode-template $\ell = \{u + t w \mid t \in \mathbb{R}\}$4.
• Search Structure: Overlay the arrangement with barcode-templates and build a search structure (e.g., balanced binary search tree) for locating the corresponding template for any query slope $\ell = \{u + t w \mid t \in \mathbb{R}\}$5 in $\ell = \{u + t w \mid t \in \mathbb{R}\}$6 time ($\ell = \{u + t w \mid t \in \mathbb{R}\}$7).
• Complexity: Construction requires $\ell = \{u + t w \mid t \in \mathbb{R}\}$8 time and space. Querying any slice barcode proceeds in $\ell = \{u + t w \mid t \in \mathbb{R}\}$9 time (Lesnick et al., 8 Nov 2025).

4. Query Algorithm and Evaluation

To answer a barcode query for a line $u \in \mathbb{R}^2$0:

1. Normalize the slope $u \in \mathbb{R}^2$1 of $u \in \mathbb{R}^2$2 to the simplex $u \in \mathbb{R}^2$3.
2. Locate the cell $u \in \mathbb{R}^2$4 containing $u \in \mathbb{R}^2$5 via the search structure.
3. Retrieve barcode-template $u \in \mathbb{R}^2$6.
4. For each pair, compute birth and death along $u \in \mathbb{R}^2$7:

$u \in \mathbb{R}^2$8

1. Return $u \in \mathbb{R}^2$9.

This procedure realizes logarithmic-time barcode evaluation, enabling real-time interactive applications such as the RIVET visualization framework for bipersistent homology.

5. Sheaf-Theoretic Connections and Metrics

Sheaf theory provides a categorical and analytical underpinning for fibered barcodes:

• Derived pushforward $w = (w_1, w_2)$0 along a continuous $w = (w_1, w_2)$1 yields a one-parameter persistence sheaf whose barcode is the projected barcode along $w = (w_1, w_2)$2.
• Fibered barcodes correspond, under equivalence, to projected barcodes $w = (w_1, w_2)$3 for appropriate linear functionals $w = (w_1, w_2)$4.
• Stability is ensured via convolution/interleaving distance $w = (w_1, w_2)$5, with integral sheaf metric (ISM) and sliced convolution distance (SCD) defined by

$w = (w_1, w_2)$6

$w = (w_1, w_2)$7

Both metrics are lower bounds for $w = (w_1, w_2)$8 and computable by reduction to standard 1D barcode algorithms (Berkouk et al., 2022).

6. Implementation and Example

Practical implementation proceeds by direct reduction to 1D persistence computations:

• Standard libraries (Ripser, Dionysus, GUDHI, giotto-tda) operate on slices via real-valued filtrations $w = (w_1, w_2)$9.
• For ISM/SCD, sample $w_1, w_2 \geq 0$0 directions $w_1, w_2 \geq 0$1 in $w_1, w_2 \geq 0$2 and process each as an independent 1D persistence computation ($w_1, w_2 \geq 0$3 per run, with $w_1, w_2 \geq 0$4 the complex size).
• A plausible implication is that only modest $w_1, w_2 \geq 0$5 ($w_1, w_2 \geq 0$6–$w_1, w_2 \geq 0$7) suffices for accurate metric estimates.
• Example: For a module presented by two generators $w_1, w_2 \geq 0$8 and one relation $w_1, w_2 \geq 0$9, the arrangement of critical lines in slope space yields two cells, each encoded with corresponding barcode-templates for rapid query evaluation (Lesnick et al., 8 Nov 2025).

7. Significance and Applications

Fibered barcodes unify algebraic, combinatorial, and sheaf-theoretic approaches to multi-parameter persistence:

• They provide a stable and computable invariant for data analysis in settings where multi-scale, multi-directional topology is central.
• The augmented arrangement data structure enables interactive visualization and exploration in software such as RIVET (Lesnick et al., 8 Nov 2025).
• New metrics, ISM/SCD, facilitate quantification of module similarity with computational efficiency and theoretical grounding (Berkouk et al., 2022).

A plausible implication is that advances in the computation and stability of the fibered barcode will enable broader adoption in high-dimensional TDA, scientific visualization, and applied mathematics. The categorical equivalence with projected barcodes bridges algebraic and analytical methods, potentially informing further theoretical developments in persistence theory.

Property	Fibered Barcode	Projected Barcode
Definition	Slice along non-negative affine lines; barcode of slice	Pushforward along linear
Computability	Augmented arrangement, $M|_\ell$0 construction	Standard 1D persistence
Stability	$M|_\ell$1 Lipschitz in module interleaving distance	Follows from pushforward