---
title: Signed Rectangle Rank in Multiparameter Persistence
url: https://www.emergentmind.com/topics/signed-rectangle-rank
type: topic
---

# Signed Rectangle Rank in Multiparameter Persistence

Searching arXiv for the core persistence papers and related work on signed rectangle rank.
Signed rectangle rank is an integer-valued coefficient function that appears in rank decompositions of multi-parameter persistence modules. For a persistence module \(M\) indexed by a poset such as a finite grid or \(\mathbb{R}^n\), it records how the rank invariant \(r_M(u \le v)=\operatorname{rank}(M(u\to v))\) can be reconstructed as a signed \(\mathbb{Z}\)-linear combination of rank invariants of indicator modules supported on axis-aligned rectangles [2107.06800]. In this sense, signed rectangle rank generalizes the unsigned interval multiplicities of one-parameter barcodes to the multi-parameter setting, where cancellations are generally unavoidable. The notion is closely tied both to Möbius inversion on the poset of rectangles and to the homological structure of the module through rank-exact resolutions [2107.06800]. Subsequent work distinguishes the canonical minimal rectangle decomposition from a different homological signed decomposition by hooks, showing that the former is not bottleneck stable in dimension at least two, whereas the latter is stable [2208.00300].

## 1. Definition and ambient setting

Let \(P\) be a poset viewed as a category, and let \(M:P\to \mathrm{Vec}_k\) be a pointwise finite-dimensional persistence module. The rank invariant is the function
\[
r_M(u\le v):=\operatorname{rank}(M(u\to v)),
\]
defined on
\[
\mathrm{Relation}(P):=\{(u,v)\in P\times P\mid u\le v\}
\]
[2107.06800].

A closed segment in \(P\) is the down-up interval
\[
\{u,v\}:=\{x\in P\mid u\le x\le v\}.
\]
In multi-parameter settings such as \(P=\mathbb{R}^n\) with product order, a basic class of such segments is given by axis-aligned rectangles
\[
S=[a_1,b_1]\times\cdots\times[a_n,b_n],\qquad a_i\le b_i
\]
[2107.06800].

For any segment or interval \(S\subseteq P\), the indicator module \(I_S\) assigns \(k\) on \(S\) and \(0\) outside, with identity structure maps inside \(S\) and zero maps otherwise. Its rank invariant satisfies
\[
r_{I_S}(u\le v)=1 \quad \text{if } u,v\in S \text{ (equivalently } [u,v]\subseteq S\text{), else }0
\]
[2107.06800].

With a chosen family \(\mathcal{R}\) of rectangles, a signed rectangle rank decomposition of \(r_M\) is an identity
\[
r_M=\sum_{S\in \mathcal{R}} \sigma(S)\cdot r_{I_S},\qquad \sigma(S)\in \mathbb{Z},
\]
with pointwise finite sum on \(\mathrm{Relation}(P)\) [2107.06800]. The resulting map \(S\mapsto \sigma(S)\) is the signed rectangle rank of \(M\) relative to \(\mathcal{R}\). Equivalently, one may package positive and negative coefficients as a signed barcode
\[
r_M=\mathrm{Rk}(k_+)-\mathrm{Rk}(k_-),
\]
where \(k_+\) and \(k_-\) are direct sums of rectangle modules determined by the positive and negative multiplicities [2107.06800].

In the language of later work, this is the signed difference of rectangle-module rank contributions in the unique minimal rectangle decomposition \({}_{\mathrm{rect}}(M)\) for finitely presented \(\mathbb{R}^n\)-modules [2208.00300].

## 2. Relation to barcodes and multi-parameter persistence

The conceptual role of signed rectangle rank is to provide a multi-parameter analogue of the one-parameter persistence barcode. In one parameter, the rank invariant admits an unsigned decomposition into interval ranks, so the multiplicities are nonnegative. In multiple parameters, the rank invariant cannot generally be written as an unsigned sum of rectangle indicator ranks; signed coefficients are needed to account for overlaps and algebraic dependencies [2107.06800].

The associated signed barcode represents each rectangle geometrically by its main diagonal bar, with multiplicity and sign. Positive and negative rectangles encode contributions and cancellations whose cumulative effect reconstructs the full rank invariant [2107.06800]. This makes signed rectangle rank a compressed global encoding of the rank invariant, rather than merely a local statistic.

The paper introducing signed barcodes develops the notion not only for ordinary segment ranks but also for generalized ranks over intervals,
\[
\mathrm{Rk}_I(M):=\operatorname{rank}\!\left(\varprojlim(M|_I)\to \varinjlim(M|_I)\right),
\]
with the usual rank recovered when \(I=\{i,j\}\) is a closed segment [2107.06800]. This broader framework places signed rectangle rank within a family of decompositions of generalized rank functions over interval dictionaries.

A recurrent source of ambiguity in the literature is the phrase “signed rectangle rank,” which also appears in a different field: communication complexity. There it denotes, for a Boolean matrix \(M\in\{0,1\}^{m\times n}\), the minimum number of all-1 rectangles needed to express \(M\) as a \(\pm 1\)-sum, and it satisfies
\[
\operatorname{rank}(M)\le \mathrm{srr}(M)\le \chi(M),
\]
with \(\mathrm{srr}(M)\le O(r\log r)\) for matrices of rank \(r\) [2510.02583]. The persistence-theoretic notion is distinct: it is not a complexity measure of a matrix, but an integer coefficient function in a decomposition of the rank invariant of a persistence module [2107.06800]. The shared terminology reflects the same combinatorial idea of reconstructing an object by signed rectangle contributions, but the ambient categories, invariants, and goals are different.

## 3. Existence, uniqueness, and canonical minimality

The foundational structural result is a basis theorem for rank functions. Let \(\mathbb{I}\) be a locally finite collection of intervals in a poset \(P\), and let \(r:\mathbb{I}\to \mathbb{Z}\) have locally finite support. Then
\[
r=\sum_{I\in \mathbb{I}} \alpha_I\cdot \mathrm{Rk}(k_I)
\]
uniquely, with pointwise finite sum [2107.06800]. In particular, the family \(\{\mathrm{Rk}(k_I)\}_{I\in\mathbb{I}}\) acts as a basis of rank functions with locally finite support.

Specialized to rectangles, this yields existence and uniqueness of signed rectangle decompositions under natural finiteness assumptions. The corresponding minimal signed decomposition, expressed as disjoint multisets \((\mathcal{A}_+,\mathcal{A}_-)\), is unique [2107.06800]. On finite posets, and in particular on finite grids \(G\subset \mathbb{R}^n\), every module rank invariant admits such a unique minimal signed decomposition over grid rectangles [2107.06800]. For finitely presented modules over \(\mathbb{R}^n\), the usual rank admits unique minimal rank decompositions over right-open rectangles [2107.06800].

Later work reformulates this as a canonical signed barcode. For any finitely presented \(M:\mathbb{R}^n\to \mathrm{vec}\), there exists a unique signed \(\mathbb{R}^n\)-barcode
\[
{}_{\mathrm{rect}}(M)=({}^+_{\mathrm{rect}}(M),{}^-_{\mathrm{rect}}(M))
\]
such that the modules appearing are right open rectangle modules, the positive and negative multisets are disjoint, and the signed barcode is a rank decomposition of \(M\) [2208.00300]. This formalizes signed rectangle rank as a canonical object rather than an arbitrary choice of decomposition.

Even without local finiteness, uniqueness persists at the minimal level whenever a decomposition exists: the minimal decomposition is obtained by cancelling common intervals from any decomposition, and any two decompositions satisfy a balancing identity
\[
\mathcal{A}_+\cup \mathcal{A}'_-=\mathcal{A}'_+\cup \mathcal{A}_-
\]
[2107.06800]. This gives signed rectangle rank a canonical status whenever the relevant decomposition class is fixed.

## 4. Möbius inversion and explicit coefficient formulas

A central computational fact is that the coefficients \(\sigma(S)\) are obtained by Möbius inversion on the poset of rectangles ordered by inclusion. If \(\mu\) denotes the Möbius inverse of the zeta function on that poset, then for a rank function \(r\),
\[
(r\star \mu)(I)=\mathrm{mult}_I(\mathcal{A}_+)-\mathrm{mult}_I(\mathcal{A}_-)
\]
for every interval \(I\) [2107.06800]. Thus the minimal decomposition is realized directly by the integer-valued function \(r\star \mu\), split into positive and negative parts.

On a finite grid \(G\), for a rectangle \([s,t]\) with \(s\le t\), the coefficient is the mixed finite difference
\[
\sigma([s,t])=
\sum_{s':\, s'\le s,\ \|s'-s\|_\infty\le 1}
\sum_{t':\, t'\ge t,\ \|t'-t\|_\infty\le 1}
(-1)^{\|s'-s\|_1+\|t'-t\|_1}\cdot r_M(s'\le t')
\]
[2107.06800]. Equivalently, using backward differences at lower corners and forward differences at upper corners,
\[
\sigma([s,t])=(\Delta^-_{s_1}\Delta^+_{t_1}\cdots \Delta^-_{s_n}\Delta^+_{t_n})\, r_M(s,t)
\]
[2107.06800]. Expanded over \(\epsilon,\eta\in\{0,1\}^n\),
\[
\sigma([s,t])=
\sum_{\epsilon,\eta\in\{0,1\}^n}
(-1)^{|\epsilon|+|\eta|}\cdot r_M(s-\epsilon,\,t+\eta)
\]
with the convention that values outside the grid are zero [2107.06800].

These identities show that signed rectangle rank is a discrete mixed derivative of the rank invariant. The original paper describes a heuristic continuous interpretation for finitely presented \(\mathbb{R}^n\)-modules: \(\sigma\) behaves like a signed “jump measure” of \(r_M\) across lower and upper faces of rectangles [2107.06800]. This suggests that signed rectangle rank localizes the singular support of the rank invariant in a combinatorial form.

The computational consequence on finite grids is explicit. If rank queries \(r_M(s\le t)\) are available for all comparable pairs, all rectangle coefficients can be computed by the \(2n\)-fold finite-difference formula, after which positive coefficients populate \(\mathcal{A}_+\) and negative coefficients populate \(\mathcal{A}_-\) [2107.06800]. The arithmetic complexity is
\[
O(2^{2n}\cdot \#\mathrm{Relation}(G)),
\]
which is linear in the encoding size of \(r_M\) for fixed \(n\) [2107.06800].

## 5. Algebraic origin in rank-exact resolutions

Signed rectangle rank is not merely a combinatorial inversion artifact; it reflects the algebraic structure of the module. The key notion is that of a rank-exact short exact sequence
\[
0\to A\to B\to C\to 0,
\]
meaning that the generalized rank is additive:
\[
\mathrm{Rk}(B)=\mathrm{Rk}(A)+\mathrm{Rk}(C)
\]
pointwise on segments [2107.06800]. This class of sequences defines an exact structure \(E\) on the category of persistence modules [2107.06800].

Within this exact category, the Grothendieck group \(K_0(E)\) is generated by classes of indicator modules of segments, and for finite posets the rank invariant induces an isomorphism
\[
K_0(E)\cong \mathbb{Z}^{\mathrm{Relation}(P)}
\]
with basis \(\{[k_{i,j}]\,|\, i\le j\in P\}\) [2107.06800]. If a module \(M\) admits a finite rank-exact projective resolution
\[
0\to P_m\to \cdots \to P_1\to P_0\to M\to 0,
\]
then in \(K_0(E)\),
\[
[M]=\sum_{k\ge 0}(-1)^k[P_k],
\]
hence
\[
r_M=\sum_{k\ge 0}(-1)^k r_{P_k}
\]
[2107.06800]. Since each \(P_k\) decomposes as a direct sum of indicator modules on segments or rectangles, the coefficients in the signed rank decomposition arise as the alternating signs of the resolution terms [2107.06800].

This homological origin becomes central in the stability theory developed later. In the rank exact structure on finitely presentable \(\mathbb{R}^n\)-modules, the indecomposable rank projectives are hook modules rather than rectangle modules [2208.00300]. Every such module admits a finite minimal rank projective resolution, and the associated signed barcode
\[
{}_{\mathrm{rk}}(M)=\left(\bigcup_{k\ \mathrm{even}} {}_k(M),\ \bigcup_{k\ \mathrm{odd}} {}_k(M)\right)
\]
is well defined and reconstructs the rank invariant as a signed sum of hook-module rank invariants [2208.00300]. Thus the rectangle-based signed decomposition and the rank-exact homological decomposition are related but not identical. A plausible implication is that the minimal rectangle decomposition captures a canonical Möbius-theoretic compression of the rank invariant, whereas the rank-exact decomposition is the one directly aligned with projective homological structure.

## 6. Stability, limitations, and later refinements

A major issue for applications is stability under perturbations. The initial work reports that signed decompositions are “maximally separated among all decompositions in the matching distance on rank invariants” and that replacing a module by a module built from the positive and negative rectangle summands does not increase inter-module distances [2107.06800]. However, subsequent analysis identifies a stronger obstruction: the minimal rank decomposition by rectangles is not bottleneck stable in the natural signed bottleneck metric when \(n\ge 2\) [2208.00300].

The negative result is explicit. There is no function \(f:\mathbb{R}_{\ge 0}\to \mathbb{R}_{\ge 0}\) with \(f(r)\to 0\) as \(r\to 0\) such that
\[
\widehat{d_B}({}_{\mathrm{rect}}(M),{}_{\mathrm{rect}}(N))
\le f(d_I(M,N))
\]
for all finitely presented \(M,N:\mathbb{R}^n\to \mathrm{vec}\) when \(n\ge 2\) [2208.00300]. The counterexample uses right open rectangles \(H_{a,b}\), \(V_{a,b}\), and \(T_a\), with
\[
{}_{\mathrm{rect}}(M_{a,b})=(\{[V_{a,b}],[H_{a,b}]\},\{[T_a]\}),
\]
and constructs pairs of modules whose interleaving distance tends to zero while the signed bottleneck cost remains at least \(1\) [2208.00300]. This shows that small perturbations can force large changes in the minimal signed rectangle barcode.

The remedy proposed in the same paper is to replace rectangle decompositions by the rank exact decomposition built from hook modules. For finitely presented modules \(M,N:\mathbb{R}^n\to \mathrm{vec}\),
\[
\widehat{d_B}({}_{\mathrm{rk}}(M),{}_{\mathrm{rk}}(N))
\le (2n-1)^2\cdot d_I(M,N)
\]
[2208.00300]. This signed hook barcode is therefore bottleneck stable with an explicit constant. The paper further proves universality properties for the signed bottleneck dissimilarity on hook barcodes and computes the global dimension of the rank exact structure as
\[
\mathrm{gldim}^{\mathrm{rk}}(\mathrm{vec}^{\mathbb{R}^n}_{\mathrm{fp}})=2n-2
\]
[2208.00300].

The main interpretive consequence is not that signed rectangle rank is invalid, but that it serves a different purpose. It remains a canonical and geometrically intuitive decomposition of the rank invariant, especially useful for visualization and algebraic inspection [2107.06800]. Yet if one requires perturbation-stable signed summaries, the hook-based rank exact decomposition is the preferred replacement [2208.00300].

A related caveat concerns the choice of decomposition dictionary. Over all intervals rather than rectangles, decompositions may exist but need not be unique, and the resulting barcodes can be harder to interpret [2107.06800]. Restricting to rectangles on grids restores uniqueness and geometric transparency, but not bottleneck stability [2107.06800; 2208.00300].

## 7. Interpretation, examples, and broader significance

In the simplest case, if the rank invariant is already the rank of a single rectangle module \(I_S\), then the signed rectangle rank assigns coefficient \(1\) to \(S\) and \(0\) elsewhere [2107.06800]. More interestingly, when the same region of the rank invariant can be generated by overlapping rectangles from incomparable lower corners, Möbius inversion returns positive coefficients on those birth rectangles together with a negative rectangle correcting the overlap [2107.06800]. This is the canonical multi-parameter counterpart of inclusion–exclusion.

In one parameter, no negative coefficients are needed: every coefficient \(\sigma(I)\) is nonnegative, and the decomposition reduces to the usual barcode [2107.06800]. In multiple parameters, negative coefficients encode algebraic relations beyond simple feature counts. The signed barcode may therefore be read as a balance of positive and negative bars crossing parameter regions, with \(r_M(s\le t)\) equal to the number of positive bars connecting \(s^-\) to \(t^+\) minus the number of negative ones [2107.06800].

For finitely presented \(\mathbb{R}^n\)-modules, computation proceeds by discretizing to the finite critical grid induced by generators and relations, then applying the same Möbius inversion formulas [2107.06800]. The paper also notes that smoothing commutes with signed decompositions and removes bars whose signed prominence lies near the diagonal hyperplanes, suggesting a denoising mechanism [2107.06800]. This suggests that signed rectangle rank is particularly suited to exploratory analysis of multi-parameter persistence, where one seeks a compact visual and algebraic summary of the global rank structure.

Within topological data analysis, the broader significance of signed rectangle rank lies in three facts. First, it gives a canonical decomposition of the rank invariant for finite grids and finitely presented modules [2107.06800]. Second, it exposes a direct bridge between combinatorial inversion formulas and homological algebra through rank-exact resolutions [2107.06800]. Third, the later instability results clarify its scope: it is best understood as a canonical signed encoding of rank information, not as the final stable metric invariant in higher-parameter settings [2208.00300].

A common misconception is to treat the signed rectangle barcode as a straightforward multi-parameter replacement for the classical barcode in all respects. The later theory shows that this is too strong: it generalizes the decomposition aspect of one-parameter persistence, but not the bottleneck stability phenomenon associated with one-parameter barcodes [2208.00300]. The stable homological replacement uses hooks rather than rectangles, even though the latter remain more immediately geometric.

Source: https://www.emergentmind.com/topics/signed-rectangle-rank