Interleaving distance

In topological data analysis, the interleaving distance is a measure of similarity between persistence modules, a common object of study in topological data analysis and persistent homology.

The interleaving distance was first introduced by Frédéric Chazal et al. in 2009.

[1] since then, it and its generalizations have been a central consideration in the study of applied algebraic topology and topological data analysis.

[2][3][4][5][6] A persistence module

of vector spaces indexed over the real line, along with a collection

of linear maps such that

is always an isomorphism, and the relation

is satisfied for every

The case of

indexing is presented here for simplicity, though the interleaving distance can be readily adapted to more general settings, including multi-dimensional persistence modules.

be persistence modules.

δ ∈

-shift is a collection

of linear maps between the persistence modules that commute with the internal maps of

The persistence modules

such that the following diagrams commute for all

( δ + ε )

Therefore, in order to find the closest interleaving between the two modules, we must take the infimum across all possible interleavings.

The interleaving distance between two persistence modules

) = inf { δ ∣

[8] It can be shown that the interleaving distance satisfies the triangle inequality.

Namely, given three persistence modules

, the inequality

is satisfied.

[8] On the other hand, there are examples of persistence modules that are not isomorphic but that have interleaving distance zero.

exists then two persistence modules are said to have infinite interleaving distance.

These two properties make the interleaving distance an extended pseudometric, which means non-identical objects are allowed to have distance zero, and objects are allowed to have infinite distance, but the other properties of a proper metric are satisfied.

Further metric properties of the interleaving distance and its variants were investigated by Luis Scoccola in 2020.

[9] Computing the interleaving distance between two single-parameter persistence modules can be accomplished in polynomial time.

On the other hand, it was shown in 2018 that computing the interleaving distance between two multi-dimensional persistence modules is NP-hard.