The paper introduces the persistent homotopy type distance dHT, a new metric for comparing functions on homotopy equivalent spaces, which bounds the bottleneck distance of persistence diagrams and extends existing distances.
Contribution
It defines the novel persistent homotopy type distance dHT, connecting homotopy theory with persistent homology, and demonstrates its properties and relations to existing metrics.
Findings
01
dHT bounds the bottleneck distance between persistence diagrams
02
dHT extends the L-infinity and natural pseudo-distances
03
dHT can be interpreted via interleavings in persistence theory
Abstract
We introduce the persistent homotopy type distance dHT to compare real valued functions defined on possibly different homotopy equivalent topological spaces. The underlying idea in the definition of dHT is to measure the minimal shift that is necessary to apply to one of the two functions in order that the sublevel sets of the two functions become homotopically equivalent. This distance is interesting in connection with persistent homology. Indeed, our main result states that dHT still provides an upper bound for the bottleneck distance between the persistence diagrams of the intervening functions. Moreover, because homotopy equivalences are weaker than homeomorphisms, this implies a lifting of the standard stability results provided by the L-infty distance and the natural pseudo-distance dNP. From a different standpoint, we prove that dHT extends the L-infty distance and dNP in two…
\Lambda^{\mathbf{C}}\big{(}(X,{\boldsymbol{\varphi}}_{X}),(Y,{\boldsymbol{\varphi}}_{Y})\big{)}:=\big{\{}\alpha\geq 0:\mbox{$(X,{\boldsymbol{\varphi}}_{X})$ and $(Y,{\boldsymbol{\varphi}}_{Y})$ are ${\vec{\boldsymbol{\alpha}}}$-homotopy equivalent in $\mathbf{C}$}\big{\}},
\Lambda^{\mathbf{C}}\big{(}(X,{\boldsymbol{\varphi}}_{X}),(Y,{\boldsymbol{\varphi}}_{Y})\big{)}:=\big{\{}\alpha\geq 0:\mbox{$(X,{\boldsymbol{\varphi}}_{X})$ and $(Y,{\boldsymbol{\varphi}}_{Y})$ are ${\vec{\boldsymbol{\alpha}}}$-homotopy equivalent in $\mathbf{C}$}\big{\}},
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
The Persistent Homotopy Type Distance
Patrizio Frosini
Patrizio Frosini, Department of Mathematics, University of
Bologna, Italy
We introduce the persistent homotopy type distancedHT to compare two
real valued functions defined on possibly different homotopy
equivalent topological
spaces. The underlying idea in the definition of dHT is to measure
the minimal shift that is necessary to apply to one of the two
functions in order that the sublevel sets of the two functions become
homotopy equivalent. This distance is interesting in connection
with persistent homology. Indeed, our main result states that dHT
still provides an upper bound for the bottleneck distance between the
persistence diagrams of the intervening functions. Moreover,
because homotopy equivalences are weaker than homeomorphisms, this
implies a lifting of the standard stability results provided by the L∞ distance and the
natural pseudo-distance dNP. From a different standpoint, we prove
that dHT extends the L∞ distance and dNP in two
ways. First, we show that, appropriately restricting the category of
objects to which dHT applies, it can be made to coincide with the other two distances. Finally, we show that dHT has an interpretation in terms of interleavings that naturally places it in the family of distances used in persistence theory.
Persistent homology has been developed as a theory to study topological properties of noisy or incomplete data, establishing itself as a fundamental tool for topological data analysis [15, 19, 7]. Persistent homology is characterized by an invariant called the persistence diagram (also known as the barcode) which summarizes both topological features of a dataset and their prominence. One of the reasons for the success of persistent homology is that persistence diagrams change continuously provided that the input dataset also changes continuously. This is known as the Stability Theorem of Persistence [11]. Usually, (a) changes in persistence homology are measured via the bottleneck distance between persistence diagrams, (b) datasets are modeled as real valued functions defined on the same space, and (c) one uses the L∞ distance between functions to quantify their changes:
Theorem 1** (Stability Theorem of Persistence [11]).**
Let X be a compact polyhedron. Then, for all continuous tame functions φ1,φ2:X→R, and all integers k≥0,
[TABLE]
Above, dB stands for the bottleneck distance between persistence diagrams, and Dk(φ) is the persistence diagram corresponding to the k-th homology of the sub-level set filtration of the function φ.
In order to lift the Stability Theorem of Persistence to the case when functions are defined on different, albeit homeomorphic spaces, one can resort to the natural pseudo-distance. If two continuous functions φX:X→R, φY:Y→R are given on homeomorphic spaces X and Y, then the natural pseudo-distance dNP [14] between them is defined by
[TABLE]
where h varies in the set of all homeomorphisms from the topological space X onto the topological space Y.
If two continuous functions φX:X→R, φY:Y→R are given on non-homeomorphic spaces X and Y, then we set dNP((X,φX),(Y,φY)):=∞.
Then, since persistence diagrams of sub-level set filtrations are invariant under reparameterization, one obtains an improvement of inequality (1.1) stated in Theorem 1:
[TABLE]
However, the natural pseudo-distance is not suitable when we are interested in analyzing functions defined on non-homeomorphic topological spaces.
In this paper we construct a new extended pseudo-metric, called the persistent homotopy type distance, denoted dHT, to quantify the distance between real-valued functions defined on different spaces which is meaningful when the spaces are at least homotopy equivalent. In plain words, the persistent homotopy type distance is a generalization of the natural pseudo-distance in that it uses homotopy equivalences in place of homeomorphisms. This allows us to use the persistent homotopy type distance to obtain a new and stronger stability theorem for persistent homology, which is the main contribution of our paper:
Theorem 2**.**
Let X and Y be compact polyhedra, and k be any non-negative integer. Let φX:X→R and φY:Y→R be continuous functions. Then,
[TABLE]
We note that in the statement above dHT becomes infinity when the underlying spaces above are not homotopy equivalent.
Variations on the basic definition of dHT
In the definition (1.2) of the natural pseudo-distance above, one can in fact consider two interesting variations: on one hand, one can extend the class of considered functions from scalar functions φX:X→R to vector-valued functions φX=(φi):X→Rn, with ∥φX∥∞:=supx∈Xmax1≤i≤n∣φi(x)∣; on the other hand, one can restrict from the category H0 (whose objects are all topological spaces endowed with Rn-valued continuous functions and morphisms are all homeomorphisms between topological spaces) to any subcategory H of H0 closed under inverse [2]: for any φX:X→Rn, φY:X→Rn,
[TABLE]
if there is a homeomorphism from X to Y in H, dNPH((X,φX),(Y,φY))=∞ otherwise.
Generalizing the natural pseudo-distance to vector-valued functions permits to lift the stability of the interleaving distance of multidimensional persistence modules [22] in much the same way as we lift the stability of the bottleneck distance in one-dimensional persistence.
Restricting the set of homeomorphisms allows for the application of the natural pseudo-distance to cases when the desired invariance is not the one expressed by any homeomorphism, as shown in previous papers [17, 18]. For example, two monotonic functions φ,ψ:[0,1]→R with the same set of extrema are equivalent under dNP (and therefore equivalent for standard persistent homology) when every homeomorphism from [0,1] to [0,1] is accepted. Thus, suitably restricting the set of acceptable homeomorphisms would permit distinguishing two such functions.
From a different perspective, since the group of all self-homeomorphisms of a topological space, even a compact one, is not itself compact, the possibility of restricting the set of homeomorphisms is also motivated by the desire of working with compact groups. This would be useful for obtaining interesting theorems e.g. good finite approximations of the considered groups.
Analogously to the ability to specify a subcategory H in the case of the natural pseudo-distance, our proposal for a persistent homotopy type distance also permits specifying what constitutes suitable classes of homotopy equivalences, therefore allowing to select the class that is judged more relevant for a given application.
The homotopy type distance as an interleaving distance
Starting with [9, 21], and more recently with [22, 4, 10], a unifying look at all the metrics usually used to state the stability theorems of persistence has been proposed in terms of interleaving distances. Interleavings apply between pairs of functors from the category of ordered reals to any other category. Interleavings are given by pairs of natural transformations between each one of the functors and a shifted version of the other functor.
The interleaving distance measures the smallest shift that allows the existence of an interleaving. Since many distances considered in topological data analysis can be formulated in terms of interleavings, it is natural to ask whether the same holds true for the persistent homotopy type distance. A further contribution of this paper is a positive answer to this question. Related recent work in this direction is that of Blumberg and Lesnick [3]. In a related thread, we prove that, when restricted to merge trees, our homotopy type distance agrees with the interleaving distance between merge trees of Morozov et al. [23].
Organization of the paper
After introducing the persistent homotopy type distance in Section 2, we discuss its properties and give some examples. In Section 3, we prove that the bottleneck distance between persistence diagrams is upper-bounded by the persistent homotopy type distance (Theorem 2). In other words, we lift the Stability Theorem of Persistence (Theorem 1) to functions defined on different spaces provided that they are homotopy equivalent. In Section 4, we show that the interleaving distance between merge trees can be obtained as a special case of the persistence homotopy type distance. Then, Section 5 offers an interpretation of the persistent homotopy type distance as an interleaving distance more in general. Finally, a discussion section offers some thoughts on possible extensions.
2. Mathematical setting
For any integer n≥1, let us endow Rn with the partial order ⪯ defined by setting, for any α,β∈Rn, α=(αi)⪯β=(βi) whenever αi≤βi for i=1,…,k. When α⪯β we also write β⪰α. For α=(αi)∈Rn, we set ∥α∥∞=max1≤i≤k∣αi∣. Recall that for a function φX:X→Rn, we set ∥φX∥∞=supx∈X∥φX(x)∥∞.
For α∈R, we denote by α the diagonal element (α,α,…,α)∈Rn.
Let us consider the category S such that: the objects of S are all the pairs (X,φX) where X is a topological space and φX:X→Rn is a vector-valued continuous function; the morphisms of S from an object (X,φX) to another object (Y,φY) are all the continuous maps f:X→Y such that φY∘f⪯φX. The composition of morphisms is the usual composition of maps and identity morphisms are identity maps.
Definition 2.1**.**
For every α∈Rn, with α⪰0, the α-shift functor(⋅)α:S→S is defined as follows: for every (X,φX) in ob(S), (X,φX)α=(X,φX′), where φX′(x)=φX(x)−α for every x∈X; for every f:(X,φX)→(Y,φY) in hom(S), (f)α=f regarded as a morphism between (X,φX)α and (Y,φY)α.
Instead of S, we can restrict ourselves to any sub-category C of S provided that C is closed with respect to the α-shift functor for any α∈Rn. From now on we assume one such C is fixed.
Definition 2.2**.**
Let (X,φX), (Y,φY) be objects in C. Given α⪰0 in Rn, an α-mapf with respect to (φX,φY) is a morphism in C from (X,φX) to (Y,φY)α, that is a continuous map f:X→Y such that φY∘f⪯φX+α. Furthermore, given two α-maps f1:X→Y and f2:X→Y, an α-homotopy in C between f1 and f2 with respect to the pair (φX,φY) is a continuous map H:X×[0,1]→Y such that
(1)
f1≡H(⋅,0);
2. (2)
f2≡H(⋅,1);
3. (3)
H(⋅,t) is an α-map in C with respect to the pair
(φX,φY) for every t∈[0,1].
If an α-homotopy between the α-maps f1 and f2 with respect to the pair
(φX,φY) exists, we say that f1, f2 are α-homotopic with respect to (φX,φY).
In plain words, an α-homotopy between α-maps is a homotopy that is a α-map at every instant.
Remark 2.1*.*
Any map f:X→Y that induces a morphism f:(X,φX)→(Y,φY)α with respect to (φX,φY), also induces a morphism f:(X,φX)→(Y,φY)β, still with respect to (φX,φY), for every β⪰α. Therefore, an α-map can also be regarded as a β-map, for every β⪰α.
Remark 2.2*.*
For any fixed α⪰0, the α-homotopy with respect to (φX,φY) is an equivalence relation on α-maps from (X,φX) to (Y,φY)α.
We now introduce the relation of α-homotopy equivalence between objects of C. In spite of its name, in general it is not going to be an equivalence relation.
Definition 2.3**.**
For every α⪰0 in Rn and any two objects (X,φX) and (Y,φY) in C, we say that (X,φX) and (Y,φY) are α-homotopy equivalent in C if there exist α-maps f:X→Y and g:Y→X in C, with respect to (φX,φY) and (φY,φX) respectively, such that the following properties hold:
•
the map
g∘f:X→X is 2α-homotopic to idX with respect to (φX,φX);
•
the map
f∘g:Y→Y is 2α-homotopic to idY with respect to (φY,φY).
If the two previous conditions hold, we say that g (resp. f) is an α-homotopy inverse of f (resp. g) with respect to (φX,φY) (resp. (φY,φX)), and that (f,g) constitutes a pair of α-homotopy equivalences in C with respect to the pair (φX,φY).
We observe that in general the α-homotopy inverse of f with respect to the pair (φX,φY) is not unique.
We are now ready to define the persistent homotopy type distance.
Definition 2.4**.**
For each α∈R, set α=(α,α,…,α)∈Rn. For each pair \big{(}(X,{\boldsymbol{\varphi}}_{X}),(Y,{\boldsymbol{\varphi}}_{Y})\big{)}\in ob(\mathbf{C})\times ob(\mathbf{C}) we set
[TABLE]
and
[TABLE]
where we use the convention that the infimum over the empty set is +∞.
dHTC will be called the persistent homotopy type (pseudo-)distance on the category C. When C is taken to be the whole S, sometimes we simply denote dHTC by dHT.
Proposition 2.1**.**
Let (X,φX) and (Y,φY) be two objects in S such that φX and φY are bounded, that is ∥φX∥∞,∥φY∥∞<+∞. Then, dHT((X,φX),(Y,φY))<∞ if and only if X and Y are homotopy equivalent.
Proof.
Let us assume that X and Y are homotopy equivalent. Then, there exist maps f:X→Y and g:Y→X and homotopies H:X×[0,1]→X and G:Y×[0,1]→Y between g∘f and idX and between f∘g and idY, respectively. Since φX and φY are bounded functions, the numbers
αX:=∥φX−φY∘f∥∞, αY:=∥φX∘g−φY∥∞, αX:=21maxt∈[0,1]∥φX−φX∘H(⋅,t)∥∞, and αY:=21maxt∈[0,1]∥φY∘G(⋅,t)−φY∥∞ are all finite. Thus,
α:=sup{αX,αY,αX,αY}<∞,
and \alpha\in\Lambda^{\mathbf{S}}\big{(}(X,{\boldsymbol{\varphi}}_{X}),(Y,{\boldsymbol{\varphi}}_{Y})\big{)} so that dHT≤α.
Conversely, if dHT((X,φX),(Y,φY))<∞, there is some α∈R such that (X,φX) and (Y,φY) are α-homotopy equivalent in S with α=(α,α,…,α). Hence, X and Y are homotopy equivalent.
∎
In this paper we will follow the convention that α+∞=∞+α=∞ for every α∈R:=R∪{∞}.
We now prove that dHTC is an extended pseudo-metric. To this aim we use the following lemma.
Lemma 2.1**.**
Let (X,φX), (Y,φY), (Z,φZ) be three objects in C.
If (f1,g1) is a pair of α1-homotopy equivalences with respect to (φX,φY) in C and
(f2,g2) is a pair of α2-homotopy equivalences with respect to (φY,φZ) also in C, then
(f2∘f1,g1∘g2) is a pair of (α1+α2)-homotopy equivalences with respect to the pair (φX,φZ) in C.
Proof.
By definition, f2∘f1 (resp. g1∘g2) is an (α1+α2)-map with respect to (φX,φZ) (resp. (φZ,φX)).
Again by definition,
a 2α1-homotopy H1:X×[0,1]→X with respect to (φX,φX) from g1∘f1 to idX and
a 2α2-homotopy H2:Y×[0,1]→Y with respect to (φY,φY) from g2∘f2 to idY exist. Thus, we can define a map
Hˉ:X×[0,1]→X by setting
Hˉ(x,t):={g1∘H2(f1(x),2t),H1(x,2t−1),\mboxift∈[0,1/2)\mboxift∈[1/2,1].Hˉ is a (2α1+2α2)-homotopy with respect to (φX,φX) from g1∘g2∘f2∘f1 to idX.
Similarly, we can define a (2α1+2α2)-homotopy (φZ,φZ) from f2∘f1∘g1∘g2 to idZ.
This proves the claim.
∎
Remark 2.3*.*
The term extended pseudo-metric means that the function dHTC is a function defined on ob(C)×ob(C) such that, for every (X,φX),(Y,φY)∈ob(C), it holds that (i)dHTC((X,φX),(Y,φY))∈[0,∞], (ii)
if (X,φX)=(Y,φY) then dHTC((X,φX),(Y,φY))=0, (iii)dHTC satisfies the symmetry property, (iv)dHTC satisfies the triangle inequality.
Proposition 2.2**.**
The function dHTC:ob(C)×ob(C)→R is an extended pseudo-metric.
Proof.
We check that dHTC satisfies the properties of an extended pseudo-metric.
(1)
By definition, dHTC cannot take negative values.
2. (2)
dHTC((X,φX),(X,φX))=0 because the identity map of X, idX, belongs to hom(C) and (idX,idX) is a pair of 0-homotopy equivalences with respect to (φX,φX).
3. (3)
The equality dHTC((X,φX),(Y,φY))=dHTC((Y,φY),(X,φX)) immediately follows from the symmetry of the definition of pairs of α-homotopy equivalences.
4. (4)
Let φX:X→Rn, φY:Y→Rn, φZ:Z→Rn be three objects in our category C. Let α=(α,α,…,α)∈Rn with α≥0. If either (X,φX) is not α-homotopy equivalent to (Y,φY), or (Y,φY) is not α-homotopy equivalent to (Z,φZ) for any α∈R, then the definition of dHTC implies that dHTC((X,φX),(Y,φY))+dHTC((Y,φY),(Z,φZ))=∞. In this case the inequality dHTC((X,φX),(Y,φY))+dHTC((Y,φY),(Z,φZ))≥dHTC((X,φX),(Z,φZ)) is trivially satisfied. Therefore, let us assume that (f1,g1) is a pair of α1-homotopy equivalences with respect to (φX,φY) for some α1≥0, and (f2,g2) is a pair of α2-homotopy equivalences with respect to (φY,φZ) for some α2≥0. By definition of dHTC,
we can assume that
α1≤dHTC((X,φX),(Y,φY))+ε
and α2≤dHTC((Y,φY),(Z,φZ))+ε for an arbitrarily small ε>0. We know from Lemma 2.1 that
(f2∘f1,g1∘g2) is a pair of (α1+α2)-homotopy equivalences with respect to (φX,φZ).
It follows that
[TABLE]
By taking the limit for ε tending to [math], we obtain the triangle inequality
[TABLE]
∎
As we mentioned in the introduction, our definition of the persistent homotopy type distance is meant to be a generalization of the natural pseudo-distance. The next proposition gives a relationship between these two distances when we compare functions on two homeomorphic spaces, whereas Example 2.9 proves that we can read the natural pseudo-distance dNP into the persistent homotopy type distance dHTC when we suitably restrict the underlying category.
Proposition 2.3**.**
Let (X,φX) and (Y,φY) be objects in S where X and Y are homeomorphic. Then,
[TABLE]
In particular, if X=Y, and (X,φ1),(X,φ2) are objects in S, then
[TABLE]
Proof.
If dNP((X,φX),(Y,φY))=∞ then there is nothing to prove. If not, then there exist α≥0 and
a homeomorphism f:X→Y such that ∥φX−φY∘f∥∞≤α. Thus, f and f−1 are α-maps, and f−1∘f and f∘f−1 are 0-homotopic, and hence 2α-homotopic, with α=(α,α,…,α) to idX and idY, respectively, by constant homotopies. Therefore, (f,f−1) is a pair of α-homotopy equivalences for (φX,φY), implying that (X,φX) and (Y,φY) are α-homotopy equivalent. Thus, dHT≤dNP.
∎
In the next few sections we will compare the persistent homotopy type distance with other metrics widely used in the topological data analysis literature to measure the perturbations in the input functions. In particular, in Section 5 we will show that the persistent homotopy type distance can be represented as an interleaving type distance. For the moment, however, we proceed with the study of the persistent homotopy type distance using the current definition.
2.1. Examples
We now show how to compute the persistent homotopy type distance in some simple cases. We take C=S and denote dHTS simply by dHT. For the sake of simplicity, we take n=1.
The first example pertains to the case when one can retract a given space X to a subset A in such a way that the function values do not increase.
Proposition 2.4**.**
Let (X,φX) be an object in S and let A be a subspace of X such that there exists a deformation retract F:X×[0,1]→X of X onto A with the property that φX(F(x,t))≤φX(x) for all x∈X and t∈[0,1]. Then,
[TABLE]
Proof.
The proof follows directly from the definition of the homotopy type distance.
∎
As an immediate corollary, we obtain:
Example 2.1*.*
Let X be a contractible space and let z∈X. For fixed c∈R, let φc:X→R denote the constant function φc(x)=c on X. Simply denote again by c the constant function equal to c on {z}. It holds that dHT((X,φc),({z},c))=0.
In the next two examples, we show that dHT may be different from dNP even when the spaces are homeomorphic.
Example 2.2*.*
Let X be the band obtained by gluing without any twist two opposite sides of a rectangle R, and Y the band obtained by gluing the same
sides of R after applying a complete twist (i.e. a torsion of 2π radians). Assume that the glued sides have length equal to 2 and that X and Y are embedded into R3 as follows (see Figure 1):
[TABLE]
with 0≤u<2π and −1≤v≤1. Moreover, let φX:X→R be defined by φX(x,y,z)=z and similarly φY:Y→R be defined by φY(x,y,z)=z. This way the centerlines of both X and Y coincide with the curve C={(x,y,z)∈R3:x2+y2=4,z=0} and φX takes values in {−1,1} at every boundary point of X, while φY continuously varies in [−1,1] for every boundary point of Y. We claim that
[TABLE]
and
[TABLE]
In order to establish (2.2) note that for any homeomorphism f:X→Y one has that ∥φX−φX∘f∥∞=2 simply because f must take boundary points to
boundary points.
In order to establish (2.1), defining the retractions onto C given by rX:X→C by rX(x,y,z)=(x,y,0) and rY:Y→C by rY((2+vsinu)cosu,(2+vsinu)sinu,vcosu)=(2cosu,2sinu,0), and the inclusions iC,X and iC,Y of C into X and Y respectively, one immediately checks that (iC,Y∘rX,iC,X∘rY) is a pair of 1-homotopy equivalences with respect to (φX,φY). This means that dHT((X,φX),(Y,φY))≤1.
On the other hand, we claim that by Theorem 2 for k=1 we have that dHT((X,φX),(Y,φY))≥1. Indeed, notice that D1(φX)={(−1,∞)} whereas D1(φY)={(0,∞)}, see Figure 1. It then follows that the bottleneck distance (see Section 3.1) between these diagrams satisfies dB(D1(φX),D1(φY))=1, which via Theorem 2 implies our claim.
Example 2.3* (Lens spaces).*
Let X=Y be the disjoint union of the lens spaces L(7,1) and L(7,2). Define φX:X→R by setting φX∣L(7,1)≡0 and φX∣L(7,2)≡1, and define φY:Y→R by setting φY∣L(7,1)≡1 and φY∣L(7,2)≡0. Then, it holds that dHT((X,φX),(Y,φY))=0 because L(7,1) and L(7,2) are homotopy equivalent but not homeomorphic [25], whereas dNP((X,φX),(Y,φY))=1.
Finally, we consider another example which shows that dNP and dHT can in fact be the same.
Example 2.4*.*
Let M be any closed connected oriented manifold. Consider X=Y=M and φY=φc, the constant function equal to c. In this case dNP(φX,φc)=∥φX−c∥∞. We claim that in this case dHT(φX,φc)=dNP(φX,φc). Assume that α≥0 is such that there exists a pair (f,g) a pair of α-homotopy equivalences with respect to the pair (φX,φc). We will prove that α≥∥φX−c∥∞. Note that from c=φc(f(x))≤α+φX(x) for x∈M we have that α≥c−minφX. Now, since g∘f and idM are homotopic, their degrees are the same, therefore ∣deg(f)∣=∣deg(g)∣=1. Hence, both f and g are surjective. From the condition φX(g(x))≤α+φc(x)=α+c for all x∈M we obtain that α≥maxφX−c. Hence, \alpha\geq\max\big{(}c-\min\varphi_{X},\max\varphi_{X}-c\big{)}=\|\varphi_{X}-c\|_{\infty}. The fact that dHT≤dNP (Proposition 2.3) yields the claim.
We now consider three questions that may naturally arise:
•
What if we simplify the definition of α-homotopies given in Definition 2.2 by removing the condition about H being an α-map at each instant, requiring only it to be an α-map for t=0 and t=1? And, analogously, what if we remove the condition about an α-homotopy in a subcategory C of S to be a morphism in C at each instant?
•
Would it be possible to define dHTC via a minimum instead of an infimum?
•
Is dHTC actually only an extended pseudo-metric or rather an extended metric?
We will answer this questions by means of examples, taking n=1, i.e. real valued functions, for the sake of simplicity. Moreover, when possible, we take C=S, and in such cases we simply write dHT instead of dHTS.
As for the first issue, the definition of α-homotopy we have given may seem more complex than necessary. One could think of removing the condition about being an α-map at each instant, maintaining only the condition that it be an α-map for t=0 and t=1. Unfortunately, the new metric d∗ that we would obtain from this simplified definition of α-homotopies would not give an upper bound for the bottleneck distance in persistent homology. In particular, the vanishing of
d∗ would not imply that the considered sublevel-set persistent homologies are the same. This is shown in the following example, proving that the analogue of Theorem 2 for d∗ would not hold.
Example 2.5*.*
Define φ,ψ:[−1,1]→R by φ(x)=1−∣x∣ and ψ(x)=(1+x)/2 (see Figure 2).
We also define f,g:[−1,1]→[−1,1] by setting f(x)=1−2∣x∣ and g(x)=(x−1)/2.
We have that ψ∘f(x)=21+(1−2∣x∣)=1−∣x∣=φ(x) and
φ∘g(x)=1−2x−1=1−21−x=21+x=ψ(x), so that the maps f and g are [math]-maps with respect to (φ,ψ) and (ψ,φ), respectively. Furthermore,
g∘f(x)=2(1−2∣x∣)−1=−∣x∣ and
f∘g(x)=1−22x−1=1−2(21−x)=x. It follows that f∘g equals the identity, whereas g∘f is homotopic to the identity via the homotopy H(x,t):=(t−1)∣x∣+tx). Note that H(⋅,0) and H(⋅,1) are [math]-maps with respect to (φ,φ).
As a consequence, d∗(φ,ψ)=0. Now we can observe that the sublevelset persistent homologies of φ and ψ are clearly different from each other, and hence the corresponding bottleneck distance is positive.
This can be easily seen by checking that 1 is a homological critical value for φ, but not for ψ.
Therefore, d∗ is not an upper bound for the bottleneck distance.
On the contrary, we shall prove in Section 3.1 that that property holds for dHT
(Theorem 2). This fact leads us to prefer the definition of α-homotopy, and consequently of dHT, that we have presented.
Analogously, the following Example 2.6 shows the difference between asking an α-homotopy to be a morphism in C rather than in S at each instant.
Example 2.6*.*
Denoting by 2Z the even integers and by 2Z+1 the odd integers, let X={0}×R∪[0,1]×2Z and Y={0}×R∪[0,1]×(2Z+1) be two subsets of R2. Let φX(s,t)=t and φY(s,t)=t. Taking C the subcategory of S whose morphisms are homeomorphisms, it holds that dHTC((X,φX),(Y,φY))=1 whereas dHT((X,φX),(Y,φY))=0. Notice that removing the request for an α-homotopy in C to be a homeomorphism at each instant, we would obtain dHTC((X,φX),(Y,φY))=0 by using the [math]-maps f:X→Yf(s,t)=(s,t−1) and g:Y→X, g(s,t)=(s,t−1) shown in Figure 3.
As for the second issue, the use of an infimum instead of a minimum is necessary, as the following example shows.
The same example shows that dHT is not an extended metric, but only an extended pseudo-metric, thus clarifying the third issue.
Example 2.7*.*
Define φ,ψ:[−2,2]→R by setting φ(x)=−∣x∣, ψ(x)=0 for ∣x∣≤1 and ψ(x)=2−2∣x∣ for ∣x∣>1 (see Figure 4).
We claim that, for every small enough α>0 in R, we can find a pair of α-homotopy equivalences (fα,fα−1) with respect to (φ,ψ). As a consequence, dHT(([−2,2],φ),([−2,2],ψ))=0. In order to show our claim, let us take 0<α<2 and consider the homeomorphism fα:[−2,2]→[−2,2] defined by setting
[TABLE]
Observe that fα([−2,−α])=[−2,−1], fα([−α,α])=[−1,1] and fα([α,2])=[1,2].
It follows that
[TABLE]
As a consequence
[TABLE]
We can easily check that −α≤φ(x)−ψ∘fα(x)≤0 for every x∈[−2,2].
It follows that ∥φ−ψ∘fα∥∞≤α.
Hence, (fα,fα−1) is a pair of α-homotopy equivalences with respect to (φ,ψ). Given that α can be chosen arbitrarily close to 0, this implies that dHT(([−2,2],φ),([−2,2],ψ))=dNP(([−2,2],φ),([−2,2],ψ))=0.
We claim that no pair of [math]-homotopy equivalences with respect to (φ,ψ) exists. We prove this by contradiction. Assume that a pair of [math]-homotopy equivalences (f0,g0) with respect to (φ,ψ) exists. Then a homotopy H0:[−2,2]×[0,1]→[−2,2] exists, such that H0(x,0)=g0∘f0(x), H0(x,1)=x and φ(H0(x,t))≤φ(x) for every x∈[−2,2] and every t∈[0,1].
It is easy to prove that H0(−2,t)=−2 for every t∈[0,1]: H0(−2,1)=−2, φ(H0(−2,t))≤φ(−2) for every t∈[0,1], and −2 is a strict local minimum point for φ.
Analogously, H0(2,t)=2 for every t∈[0,1]. It follows that g0∘f0(−2)=−2 and g0∘f0(2)=2.
Now, we observe that f0({−2,2})⊆{−2,2}, because f0 is a [math]-map and −2,2 are the only points where ψ takes a value that is not strictly greater than φ(−2)=φ(2)=−2.
Analogously, g0({−2,2})⊆{−2,2}. By possibly composing f0 with the reflection x↦−x, we can assume that f0(−2)=−2. From the equality g0∘f0(−2)=−2, it follows that g(−2)=−2.
We can now prove that f0([−2,2])⊆[−2,−1]. Indeed, since f0(−2)=−2, if f0([−2,2]) contained a point xˉ>−1, it should also contain an infinite number of points x where ψ takes the value [math]. This contradicts the assumption that f0 is a [math]-map, because φ takes its maximum [math] only at the point [math].
Furthermore, g0([−2,−1])⊆[−2,0]. Indeed, since g0(−2)=−2, if g0([−2,−1]) contained a point xˉ>0, there should exist a point xˉ∈[−2,−1) such that g(xˉ)=0, so that φ((xˉ))=0.
This contadicts the assumption that g0 is a [math]-map.
In conclusion, we should have that g0∘f0([−2,2])⊆[−2,0], thus contradicting the fact that
g0∘f0(2)=2.
2.3. The importance of choosing a subcategory C of S
The main motivation for considering a subcategory C of S instead of only the category S is to generalize the natural pseudo-distance, whose definition depends on the selection of a set of objects and a set of morphisms that may be respectively smaller than the set of all real-valued continuous functions and the set of all homeomorphisms (cf., e.g., Section 7.1 in [2], [6] and [18]). The following examples show that this choice is fruitful.
The first two examples show that the use of an appropriate subcategory C of S allows us to represent the L∞ distance and the natural pseudo-distance dNP as particular cases of dHTC.
Example 2.8*.*
For a fixed compact X, consider the category C whose objects are given by the pairs (X,φ) where φ:X→Rn is continuous, and such that between any two objects (X,φ),(X,φ′)∈ob(C) there is at most one morphism, idX:X→X, from (X,φ) to (X,φ′), and this happens provided that φ′⪯φ. If φ′ is not everywhere less than φ, then no morphism exists from (X,φ) to (X,φ′).
By choosing this subcategory C of S we obtain that dHTC((X,φ),(X,φ′))=∥φ−φ′∥∞.
Example 2.9*.*
Let us set n=2m in the definition of the category S. Take the category C whose objects are the objects (X,φX) of S and the morphisms from an object (X,φX) to another object (Y,φY) are the homeomorphisms f:X→Y such that φY∘f⪯φX.
If ψX:X→Rm is a continuous function, then
[TABLE]
Here the symbol (ψX,−ψX) denotes the function φX:X→Rn whose first m components define the function ψX, while the last m components define the function −ψX. Analogously for the symbol (ψY,−ψY).
Let us prove the previous equality. In the case that X and Y are not homeomorphic, we have that
dNP((X,ψX),(Y,ψY))=dHTC((X,(ψX,−ψX)),(Y,(ψY,−ψY)))=∞. Therefore we can confine ourselves to assuming that X and Y are homeomorphic.
If there exist an α≥0 and
a homeomorphism f:X→Y such that ∥ψX−ψY∘f∥∞≤α, then
ψY∘f⪯ψX+α and ψY∘f⪰ψX−α (i.e. −ψY∘f⪯−ψX+α), and hence f is an α-map in C from (X,(ψX,−ψX)) to (Y,(ψY,−ψY)), with α=(α,α,…,α)∈Rm. Analogously, since ∥ψY−ψX∘f−1∥∞=∥ψX−ψY∘f∥∞≤α, f−1 is an α-map in C from (Y,(ψY,−ψY)) to (X,(ψX,−ψX)).
Furthermore, f−1∘f and f∘f−1 are 0-homotopic, and hence 2α-homotopic to idX and idY, respectively, by constant homotopies. Therefore, (f,f−1) is a pair of α-homotopy equivalences for ((ψX,−ψX),(ψY,−ψY)), implying that (X,(ψX,−ψX)) and (Y,(ψY,−ψY)) are (α,α)-homotopy equivalent. Thus, dNP((X,ψX),(Y,ψY))≥dHTC((X,(ψX,−ψX)),(Y,(ψY,−ψY))).
If (X,(ψX,−ψX)) and (Y,(ψY,−ψY)) are (α,α)-homotopy equivalent with α≥0, then there is a pair (f,g) of (α,α)-homotopy equivalences for ((ψX,−ψX),(ψY,−ψY)). The definition of C implies that f and g are two homeomorphisms. Moreover,
ψY∘f⪯ψX+α and −ψY∘f⪯−ψX+α (i.e. ψY∘f⪰ψX−α), and hence ∥ψX−ψY∘f∥∞≤α.
In other words, by taking a suitable subcategory C of S we can read the natural pseudo-distance dNP into the persistent homotopy type distance dHTC.
The following examples provide more insights into the different outcomes that can be obtained varying the category C. In particular, Example 2.10 shows the effect of a restriction of both ob(S)
and hom(S), while Example 2.11 illustrates the effect of a restriction of hom(S).
Example 2.10*.*
Let us imagine to be interested in comparing gray-level colorings of narrow strips (possibly segments), represented by pairs (Rϵ,φ) where Rϵ is the rectangle [−1,1]×[0,ϵ] for some ϵ∈[0,1] and φ:Rϵ→R takes values that depend only on the first coordinate (i.e. φ(x,y1)=φ(x,y2) for every (x,y1),(x,y2)∈Rϵ). We will call each of these pairs a strip coloring. Let us also assume that we wish (i) to distinguish the generic strip coloring (Rϵ,φ) from its horizontal reflection (Rε,φ^) with φ^ defined by setting φ^(x,y)=φ(−x,y), and (ii) not distinguish the strip colorings (Rϵ,φ) and (R0,φ∣R0) on the ground that the height of the strips is not important. Then, these requirements can be satisfied by considering the subcategory C of S whose objects are given by the
previously defined strip colorings for all ϵ∈[0,1], and whose morphisms between two strip colorings (Rϵ,φ),(Rϵ′,φ′)∈ob(C) are the continuous maps f=(f1,f2):Rϵ→Rϵ′ such that
(1)
f1 depends only on the first coordinate;
2. (2)
f1(⋅,0) is a strictly increasing homeomorphism;
3. (3)
The inequality φ′∘f(x,y)≤φ(x,y) holds for every (x,y)∈Rϵ.
Now, let us set φ(x,y)=x. If f=(f1,f2):Rϵ→Rϵ is an α-map with respect to (φ,φ^),
then φ^(f(x,y))≤φ(x,y)+α for every (x,y)∈Rϵ. The definition of φ and φ^ implies that −f1(x,y)≤x+α for every (x,y)∈Rϵ.
By setting x=−1, y=0 and observing that f1(−1,0)=−1, we get 1=−f1(−1,0)≤−1+α, i.e. α≥2.
It is immediate to check that (idRϵ,idRϵ) is a pair of 2-homotopy equivalences with respect to (φ,φ^). Therefore dHTC((Rϵ,φ),(Rϵ,φ^))=2.
Moreover,
dHTC((Rϵ,φ),(R0,φ∣R0))=0, so that dHTC satisfies the two required properties (i) and (ii).
It is also interesting to observe that dNP((Rϵ,φ),(R0,φ∣R0))=∞
(because Rϵ and R0 are not homeomorphic) and dHTS((Rϵ,φ),(Rϵ,φ^))=0 (because the homeomorphism f(x,y)=(−x,y) is a [math]-homotopy equivalence with respect to the pair (φ,φ^)),
so that neither dNP nor dHTS satisfy the two required properties (i) and (ii).
Example 2.11*.*
Let C be the category whose objects are pairs (X,φ) with X=[−1,1] and φ:X→R a continuous function, and whose morphisms between two objects (X,φ),(X,φ′) are the non-decreasing continuous maps f:X→X.
Let us take the two functions φ,φ^:X→R defined by setting φ(x)=x and φ^(x)=−x. In the category C, the map f(x)≡1 is a [math]-map with respect to the pair (φ,φ^), and the map g(x)≡−1 is a [math]-map with respect to the pair (φ^,φ). The function H:[−1,1]×[0,1]→R, H(x,t)=t(x+1)−1 is a [math]-homotopy between g∘f and idX with respect to the pair (φ,φ), and the function H′:[−1,1]×[0,1]→R, H′(x,t)=t(x−1)+1 is a [math]-homotopy between f∘g and idX with respect to the pair (φ^,φ^).
As a consequence, dHTC((X,φ),(X,φ^))=0. In other words, dHTC cannot distinguish φ from φ^.
However, if we maintain the same objects and restrict the set of morphisms to the set of all increasing homeomorphisms from X to X, we obtain another subcategory C′ of S such that
dHTC′((X,φ),(X,φ^))>0. Therefore, different choices of the subcategory C of S can produce different pseudo-metrics in our model.
2.4. dHT is the same in the topological, PL, and smooth categories
In this section we prove that dHT is the same in the topological, PL, and smooth categories.
Proposition 2.5**.**
Let C be the subcategory of S such that: the objects of C are all the pairs (X,φX) where X is a compact polyhedron, and φX:X→R is a piecewise linear function; the morphisms of C from an object (X,φX) to another object (Y,φY) are all the piecewise linear maps f:X→Y such that φY∘f≤φX. If (X,φX) and (Y,φY) are two objects in C, and hence in S, then dHTC((X,φX),(Y,φY))=dHTS((X,φX),(Y,φY)).
Proof.
The inequality dHTC((X,φX),(Y,φY))≥dHTS((X,φX),(Y,φY)) holds because each morphism in C is also a morphism in S. To see that the converse inequality,
let ωX and ωY be the moduli of continuity of φX and φY, respectively. Let (f,g) be a pair of α-homotopy equivalences in S with respect to (φX,φY). Let K,L be simplicial complexes such that X=∣K∣ and Y=∣L∣. By the simplicial approximation theorem (cf., e.g., [16]), there exists ε>0 and Kε and Lε subdivisions of K and L with mesh(Kε),mesh(Lε)<ε, respectively, and a PL map fε:X→Y such that, for any x∈X, each simplex of Lε containing f(x) contains also fε(x). Since fε is homotopic to f via F(x,t)=(1−t)fε(x)+tf(x), and mesh(Lε)<ε, it holds that fε is ωY(ε)-homotopic to f. Analogously, there exists a simplicial approximation gε of g that is ωX(ε)-homotopic to g via G(x,t)=(1−t)gε(x)+tg(x). Notice that fε is an (α+ωY(ε))-map with respect to (φX,φY) and that gε is an (α+ωX(ε))-map with respect to (φY,φX). Thus, S:X×I→X defined by S(x,t)=G(F(x,t),t)) is a (ωX(ε)+ωY(ε))-homotopy between gε∘fε and g∘f. Because (f,g) is a pair of α-homotopy equivalences with respect to (φX,φY), g∘f is 2α-homotopic to idX with respect to (φX,φX). Thus, there is a (ωX(ε)+ωY(ε)+2α)-homotopy between gε∘fε and idX with respect to (φX,φX). Because any homotopy between continuous mappings can likewise be approximated by a combinatorial version, possibly further subdividing K and L, we can approximate the (ωX(ε)+ωY(ε)+2α)-homotopy between gε∘fε and idX by a (2ωX(ε)+ωY(ε)+2α)-homotopy between gε∘fε and idX that is PL at each instant. Analogously, there is a (ωX(ε)+2ωY(ε)+2α)-homotopy between fε∘gε and idY with respect to (φY,φY) that is PL at each instant. Hence, (fε,gε) is a pair of (ωX(ε)+ωY(ε)+α))-homotopy equivalences with respect to (φX,φY). As ε tends to 0, ωX(ε) and ωY(ε) tend to 0. Hence, the claim.
∎
Proposition 2.6**.**
Let D be the subcategory of S such that: the objects of D are all the pairs (M,φM) where M is a smooth connected compact manifold, and φM:M→R is a smooth function; the morphisms of D from an object (M,φM) to another object (N,φN) are all the smooth maps f:M→N such that φN∘f≤φM. If (M,φM) and (N,φN) are two objects in D, and hence in S, then dHTD((M,φM),(N,φN))=dHTS((M,φM),(N,φN)).
Proof.
It may be proved in much the same way as Proposition 2.5, using the fact that any continuous map f:M→N with M and N manifolds can be approximated by C∞-maps homotopic to f (cf. [20, Ch. 5, Lemma 1.5]).
∎
3. Stability of persistent homology with respect to dHT
In this section we establish some connections between the distance
dHT and persistent homology, in particular we lift the Stability
Theorem of Persistence 1 via dHT.
3.1. Preliminaries
3.1.1. Overview of persistence diagrams and the bottleneck distance
In persistent homology, for each k=0,1,2,… one seeks to summarize the topological information contained in the sequence of sublevel sets φX−1((−∞,t]) into a multiset Dk(φX) of points of the extended plane called a persistence diagram: a birth–death pair (b,d) corresponding to a homological feature in degree k gives rise to a point p=(b,d) in Dk(φX); points are taken with multiplicity in order to take into account the presence of multiple features appearing and disappearing at the same sublevels.
There is a natural notion of distance, called the bottleneck distancedB, that makes the set of all persistence diagrams into a metric space.
The bottleneck distance between two persistence diagrams D1,D2 is
[TABLE]
where M varies among all the binary relations between D1 and D2 that are both right- and left-unique, i.e. partial matchings between D1 and D2.
The following result, which for fixed X expresses the continuity of the assignment φ↦Dk(φ), is standard:
In the above statement, tameness refers to a certain regularity condition singling out functions φ for which the homology groups Hk(φ−1((−∞,a])) are finite dimensional for all a∈R, and in addition, the maps induced at homology level by the inclusions φ−1((−∞,a−ε])↪φ−1((−∞,a+ε]) fail to be isomorphisms for ε>0 small only at finitely many points.
One of the salient features of the above result is that it assumes the underlying space X to be fixed. Using our construction of the homotopy type distance we lift this result into a statement that applies to any pair (X,φX) and (Y,φY) in the category C satisfying minimal tameness conditions.
3.1.2. Persistence modules and interleavings
More recently, persistent homology has been revisited in terms of persistence modules and interleavings. The main references here are [9] and [10].
A persistent module (over R) is by definition a directed sequence of vector spaces connected by linear maps {Vδ⟶vδ,δ′Vδ′}δ≤δ′ such that vδ,δ=id for all δ∈R and vδ′,δ′′∘vδ,δ′=vδ,δ′′ for all δ≤δ′≤δ′′. It is said to be q-tame if the linear maps vδ,δ′ with δ<δ′ have finite rank.
We now recall the notion of interleaving of persistence modules [9, §3.2]. Given two persistent modules {Vδ⟶vδ,δ′Vδ′}δ≤δ′ and {Wδ⟶wδ,δ′Wδ′}δ≤δ′, one says that they are α≥0 interleaved if for each δ≥0 there exist maps ϕδ:Vδ→Wδ+α and γδ:Wδ→Vδ+α such that the following four diagrams (3.1), (3.2), (3.3), and (3.4) commute for all δ,δ′∈R with δ≤δ′:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
In what follows, for each non-negative integer k, Hk(⋅) will denote the homology functor (with field coefficients). Given a pair (X,φX) and a non-negative integer k, we define the associated sublevelset persistence module
[TABLE]
where:
•
for each δ∈R, Vδ:=Hk(Xδ), where Xδ:=φX−1((−∞,δ]).
•
for each δ,δ′∈R with δ≤δ′ the linear map vδ,δ′:=Hk(ιδ,δ′X:Xδ↪Xδ′) induced by the natural inclusion ιδ,δ′X of Xδ into Xδ′.
3.2. Lifting stability results via dHT
In this section we obtain a lower bound for the homotopy type distance based on comparing persistence diagrams.
The context of the following theorem is that of the full subcategory C of S whose objects are compact polyhedra endowed with continuous real valued functions. Thus, the associated sublevelset persistence modules turn out to be q-tame [10], and one can still obtain persistence diagrams for sublevelset persistence without adding any extra tameness condition on the functions [8]. Moreover, because C is a full subcategory of S, dHTC coincides with dHTS restricted to objects of C. Thus we can simply write dHT for dHTC.
We start proving that the persistence modules of α-homotopic pairs are α-interleaved.
Lemma 3.1**.**
Let (X,φX) and (Y,φY) be two α-homotopy equivalent pairs in C.
Then, for every non-negative integer k, the persistence modules PkX and PkY are α-interleaved.
Proof.
Fix a non-negative integer k, and write PkX={Vδ⟶vδ,δ′Vδ′}δ≤δ′ and PkY={Wδ⟶wδ,δ′Wδ′}δ≤δ′ where:
•
for each δ∈RVδ:=Hk(Xδ) and Wδ:=Hk(Yδ);
•
for each δ,δ′∈R with δ≤δ′ the maps vδ,δ′:=Hk(ιδ,δ′X) and wδ,δ′:=Hk(ιδ,δ′Y).
Let (f,g) be a pair of α-homotopy equivalences with respect to (φX,φY). For each δ∈R, let fδ:=f∣Xδ and gδ:=g∣Yδ denote the restrictions of f and g to Xδ and Yδ, respectively. Notice that from the fact that f and g are α-maps it follows that im(fδ)⊂Yδ+α and im(gδ)⊂Xδ+α for each δ∈R.
In order to prove that PkX and PkY are α-interleaved, for each δ∈R we need to provide maps ϕδ:Vδ→Wδ+α and γδ:Wδ→Vδ+α such that the four diagrams (3.1), (3.2), (3.3), and (3.4) commute for all δ,δ′∈R with δ≤δ′.
In order to establish the commutativity of (3.1) consider the following diagram of topological spaces:
[TABLE]
Notice that gδ+α∘fδ:Xδ→Xδ+2α and the inclusion ιδ,δ+2αX:Xδ↪Xδ+2α are homotopic by hypothesis. Indeed, since a 2α-homotopy H:X×[0,1]→X between g∘f and idX exists, the restriction of H to Xδ×[0,1] has its image contained in Xδ+2α, and is therefore a proper homotopy between the maps gδ+α∘fδ and ιδ,δ+2αX. Thus Hk(gδ+α∘fδ)=Hk(ιδ,δ+2αX). Applying the homology functor to diagram (3.5) therefore yields the commutative diagram (3.1). The commutativity of diagram (3.2) can be established in a similar way.
In order to establish the commutativity of (3.3) consider the following diagram of topological spaces:
[TABLE]
We now verify that this diagram commutes so that the commutativity of (3.3) follows by applying the homology functor to (3.6). Indeed, pick any x∈Xδ. Then
[TABLE]
Since x∈Xδ was arbitrary it follows that fδ′+α∘ιδ,δ′X=ιδ+α,δ′+α∘fδ+α.
One can verify that (3.4) commutes using a similar argument.
∎
Using Lemma 3.1, we now obtain the stability of persistence diagrams with respect to the persistent homotopy type distance.
Under the assumption that X and Y are compact polyhedra, and φX:X→R and φY:Y→R are continuous functions, the persistence modules PkX and PkY are q-tame by [8, Thm. 2.3]. By Lemma 3.1, if (X,φX) and (Y,φY) are α-homotopy equivalent with respect to (φX,φY), then, the persistence modules PkX and PkY are α-interleaved. Thus, the claim follows from the stability theorem for q-tame persistence modules over R [10].
∎
4. The homotopy type distance for comparing merge trees
A merge tree is a structural descriptor used in shape analysis. For a continuous function φ:X→R defined on a connected domain, the merge tree of φ encodes how the sublevel sets φ−1((−∞,t]) are connected for increasing values of t∈R.
Following [23], it can be defined as follows. Consider the epigraph epi(φ) of φ, that is the space
[TABLE]
and the function φˉ:epi(φ)→R defined by φˉ(x,t)=t. Consider the equivalence relation ∼ on epi(φ) defined by setting (x,t)∼(x′,t′) if and only if t=t′ and (x,t) and (x′,t′) belong to the same connected component of φˉ−1(t). The merge tree of φ, denoted Mφ, is the quotient space epi(φ)/∼. In other words, Mφ is the Reeb graph [24] of epi(φ) with respect to φˉ.
Mφ is naturally endowed with the continuous function φ^:Mφ→R defined by setting φ^(p):=φˉ(x) for any point x belonging to the equivalence class p.
Because Mφ is the Reeb graph of epi(φ) with respect to φˉ, the assumption that X is a compact polyhedron and φ is piecewise linear ensures that epi(φ)/∼ is a (non-compact) polyhedron of dimension 1 [13]. In particular, Mφ turns out to be a tree with finitely many leaves. As such, merge trees can be compared using the persistent homotopy type distance. It is then interesting to study the persistent homotopy type distance on merge trees in relation to other distances that have been proposed for the same goal.
The manuscript [23] presents an interleaving distance between merge trees that is interesting because it satisfies a stability property with respect to perturbation of the function that defines the merge tree. The interleaving distance between merge trees is defined as follows. For ε≥0, define the ε-shift map iφε:Mφ→Mφ that sends, for every t∈R, a connected component of φˉ−1(t) to the connected component of φˉ−1(t+ε) that contains it. In other words, iφε is the map induced by the inclusion of the sublevel sets of φ. Given two continuous functions φ,ψ:X→R, and ε≥0, consider the two ε-shift maps iφε:Mφ→Mφ and iψε:Mψ→Mψ. Two continuous maps fε:Mφ→Mψ and gε:Mψ→Mφ are said to be ε-compatible if the following diagrams commute
[TABLE]
and, moreover, ψ^∘fε=φ^+ε and φ^∘gε=ψ^+ε.
In this setting, the interleaving distance, dI(Mφ,Mψ) between two merge trees
is the greatest lower bound on ε for which there are ε-compatible
maps [23]:
[TABLE]
We prove that the persistent homotopy distance on merge trees coincides with such interleaving distance.
Proposition 4.1**.**
For every pair of piecewise linear functions φ,ψ:X→R defined on a compact connected polyhedron X, it holds that
[TABLE]
Proof.
In order to see that dHT≤dI, we will prove that, given ε≥0, every pair of ε-compatible maps between Mφ and Mψ constitutes a pair of ε-homotopy equivalences. Pick ε≥0 and let iφε:Mφ→Mφ and iψε:Mψ→Mψ be ε-shifts on Mφ and Mψ, respectively. Assume that fε:Mφ→Mψ and gε:Mψ→Mφ are ε-compatible. Because ψ^∘fε=φ^+ε and φ^∘gε=ψ^+ε, it follows that fε and gε are ε-maps. Let us see that (fε,gε) is a pair of ε-homotopy equivalences with respect to (φ^,ψ^). To this end, we need to construct a 2ε-homotopy with respect to (φ^,φ^) (resp. (ψ^,ψ^)) between the identity of Mφ (resp. Mψ) and gε∘fε (resp. fε∘gε). However, from the assumption that fε and gε are ε-compatible, we get iφ2ε=gε∘fε and iψ2ε=fε∘gε. Thus, equivalently, we need to construct a 2ε-homotopy H (resp. K) with respect to (φ^,φ^) (resp. (ψ^,ψ^)) between the identity on Mφ (resp. Mψ) and the 2ε-shift iφ2ε (resp. iψ2ε). We show how to construct H. Recall that Mφ is a tree, and that for every p∈Mφ there are finitely many leaves ℓ1,…ℓnp∈Mφ which can be connected to p by a simple path increasing under φ^. For i=1,…,np, set δip:=(φ^(p)−φ^(ℓi))/2ε∈R, and let γip:[−δip,+∞)→Mφ be the path increasing under φ^ with starting point ℓi (i.e. φ^(−δip)=ℓi)), passing through p, and parametrized by φ^∘γip(t)=φ^(p)+2εt with t∈[−δip,+∞). Note that, as parameter t increases, the paths γip, with i=1,…,np, can only merge and not branch, and that γip(0)=p for every i. See Figure 5 for notation and an illustration of intervening elements.
Setting H:Mφ×[0,1]→Mφ, (p,s)↦γip(s) gives a well-defined set map because it does not depend on the choice of the leaf ℓi. Notice that H(p,0)=p, H(p,1)=iφ2ε(p), and φ^(H(p,s))=φ^(p)+2εs for all p∈Mφ and s∈[0,1].
It remains to show that H is continuous. In the case when ε=0, H(p,s)=p for every (p,s)∈Mφ×[0,1], and so H is the identity map of Mφ for every s∈[0,1], implying the continuity of H in that case. Now we pick ε>0. Let q0 belong to the image of H, that is q0=H(p0,s0) for some (p0,s0)∈Mφ×[0,1], and let V be an open set in Mφ containing q0.
For every η>0 and q∈Mφ, let U(q,η) be the connected component of φ^−1((φ^(q)−η,φ^(q)+η)) containing q.
Let η>0 be small enough such that U(q0,η) is contained in V. Set J(s0)=(s0−4εη,s0+4εη)∩[0,1]. Note that U(p0,η/2)×J(s0) is an open neighborhood of (p0,s0) in Mφ×[0,1]. By construction, for every (p,s)∈U(p0,η/2)×J(s0), it holds that φ^(H(p,s))=φ^(γip(s))=φ^(p)+2εs. Moreover, (p,s)∈U(p0,η/2)×J(s0) implies that φ^(p0)−η/2<φ^(p)<φ^(p0)+η/2 and s0−4εη<s<s0+4εη, so that
[TABLE]
Because q0=H(p0,s0) implies that φ^(q0)=φ^(p0)+2εs0, we deduce that
[TABLE]
yielding H(U(p0,η/2)×J(s0))⊆U(q0,η)⊆V.
Indeed, we observe that H(p,s) belongs to the connected component of φ^−1((φ^(q0)−η,φ^(q0)+η)) containing q0.
In other words, H is continuous.
So, H is a 2ε-homotopy between the identity on Mφ and iφ2ε. In a similar way, we can build a 2ε-homotopy K between the identity on Mψ and iψ2ε. So, we have finally proved that (fε,gε) is a pair of ε-homotopy equivalences with respect to (φ^,ψ^).
Conversely, in order to see that dI≤dHT, let f:Mφ→Mψ and g:Mψ→Mφ be such that (f,g) is a pair of ε-homotopy equivalences with respect to (φ^,ψ^) for some ε≥0. For every p∈Mφ, let
[TABLE]
Analogously, for every q∈Mψ, let
[TABLE]
In plain words, fε shifts the point f(p) of Mψ in the direction of increasing function values until it reaches the level φ^(p)+ε, and similarly gε shifts the point g(q) of Mφ in the direction of increasing function values until it reaches the level ψ^(q)+ε. By construction, ψ^∘fε=φ^+ε, φ^∘gε=ψ^+ε, fε∘gε=iψ2ε and gε∘fε=iφ2ε. To prove that fε and gε are ε-compatible maps, it remains to check that they are continuous, which is implied by the structure of the tree Mφ.
∎
5. dHT can be seen as an interleaving distance using categories
The goal of this section is to re-interpret some of the material contained in the previous sections in terms of interleavings. The advantage is that we obtain a unifying look at the distances we have encountered so far.
The theory of interleavings was initiated by Chazal et al. in [9], further developed by Lesnick in [22] to comprise also functional categories, and by Bubenik and Scott in [4] for functors from the category of ordered reals, and extended by Bubenik-deSilva-Scott [5] to the case of functors from any preordered set.
5.1. Functorial definition of interleaving distance
For a given integer n≥1 we denote by Rn the poset category with object set Rn with a morphism between u and v in Rn iff u⪯v.
Let O be an arbitrary category. We start with the general definition of interleaving distance between functors from Rn to O following [5].
Definition 5.1**.**
Let T:Rn→O be a functor between Rn and O and ε⪰0. The ε*-shift * of T is the functor Tε:Rn→O such that:
(1)
Tε(u)=T(u+ε);
2. (2)
Tε(u⪯v)=T(u+ε⪯v+ε).
Given two functors T,T′:Rn→O, a natural transformation ξ:T⇒T′ between these functors consists of a morphism ξu:T(u)→T′(u) in O for every u∈Rn, such that, for every u⪯v∈Rn, the following diagram commutes:
[TABLE]
Given ε∈R by ε∈Rn we denote the vector with all components equal to ε.
Definition 5.2**.**
Given two functors T,T′:Rn→O, and a real number ε≥0, T and T′ are said to be ε-interleaved if there exist natural transformations ξ:T⇒Tε′ and η:T′⇒Tε such that, for every u∈Rn,
ηu+ε∘ξu=T(u⪯u+2ε) and ξu+ε∘ηu=T′(u⪯u+2ε).
Moreover, in that case, the pair (ξ,η) is called an ε-interleaving between T and T′.
Definition 5.3**.**
Given two functors T,T′:Rn→O, the interleaving distance between T and T′ is defined as
[TABLE]
whenever T and T′ are ε-interleaved for some real number ε≥0, whereas dIO(T,T′)=∞, otherwise.
Let O be an arbitrary category, and let OR be the category of functors from R to O. It holds that dIO is an extended pseudo-metric on the objects of OR.
Next, we consider specific choices of the target category O. When there is no risk of confusion, in order to avoid an overload of notation, we will avoid specifying the O symbol in the notation dIO.
5.1.1. The interleaving distance between Rn-valued functions
Let O=Top/R⪯n be the category of continuous functions φX:X→Rn as objects, and 0-maps as morphisms: a morphism from φX to φY is a continuous map f:X→Y such that φY∘f⪯φX.
Proposition 5.2**.**
Every continuous function φX:X→Rn defines a functor TφX:Rn→Top/R⪯n by setting
•
for every u∈Rn, TφX(u):=φX−u;
•
for every u,v∈Rn with u⪯v, TφX(u⪯v):=idX.
Proof.
For u⪯v, idX:X→X is a morphism between φX−u and φX−v because (φX−v)∘idX⪯φX−u. Moreover, TφX preserves identity and composition.
∎
Let us now see what ε-shifts look like in this setting.
Proposition 5.3**.**
For every ε⪰0, and for every φX, the ε-shift of TφX, TεφX:Rn→Top/R⪯n, is equal to the functor TφX−ε:Rn→Top/R⪯n.
Proof.
By Definition 5.1 and the definition of TφX in Proposition 5.2, the ε-shift of TφX is the functor TεφX:Rn→Top/R⪯n such that
(1)
for every u∈Rn, TεφX(u)=TφX(u+ε)=φX−u−ε=TφX−ε(u);
2. (2)
for every u,v∈Rn with u⪯v, TεφX(u⪯v)=TφX(u+ε⪯v+ε)=idX=TφX−ε(u⪯v).
∎
The next lemma characterizes all the natural transformations between pairs of functors TφX and TφY.
Lemma 5.1**.**
Let X, Y be topological spaces, and let φX:X→Rn, φY:Y→Rn be any two continuous functions. Then, every continuous map f:X→Y such that φY∘f⪯φX induces a natural transformation ξf:TφX⇒TφY such that, for every u∈Rn, ξf(u) is equal to f.
Reciprocally, to every natural transformation ξ:TφX⇒TφY
corresponds a continuous map f:X→Y such that φY∘f⪯φX defined by f=ξ(u) for any u∈Rn.
Proof.
Any continuous map f:X→Y such that φY∘f⪯φX induces a natural transformation ξf:TφX⇒TφY defined as follows: for every u∈Rn, ξf(u):=f. Indeed, for every u∈Rn, f is a morphism between φX−u and φY−u because φY∘f⪯φX implies (φY−u)∘f⪯φX−u, proving that ξf(u):TφX(u)→TφY(u). Moreover, f∘idX=idY∘f, proving that ξf(u)∘TφX(u⪯v)=TφY(u⪯v)∘ξf(v).
Reciprocally, assume that there is a family ξ={ξ(u):TφX(u)→TφY(u)}u∈Rn of continuous maps such that diagram (5.5) commutes for every u⪯v∈Rn:
[TABLE]
Equivalently, for u⪯v, ξ(v)∘idX=idY∘ξ(u). Hence, ξ(u)=ξ(v) for every u⪯v. Hence, it is sufficient to define f:=ξ(u) for one and hence all u∈Rn.
∎
We can now show that the interleaving distance between functors TφX and TφY in Top/R⪯n coincides with the natural pseudo-distance.
Proposition 5.4**.**
Let X and Y be topological spaces. Denoting by dNP the natural pseudo-distance, for every pair of continuous functions φX:X→Rn and φY:Y→Rn, it holds that
[TABLE]
Proof.
If X and Y are not homeomorphic, dNP=∞ trivially implying that dI≤dNP.
Let f:X→Y be a homeomorphism such that ∥φX−φY∘f∥∞≤ε for some ε≥0. It then holds that (φY−ε)∘f⪯φX and (φX−ε)∘f−1⪯φY. By Lemma 5.1, f induces a natural transformation ξf from TφX to T(φY−ε), as well as a natural transformation ξf−1 from TφY to T(φX−ε). By Proposition 5.3, T(φY−ε)=TεφY and T(φX−ε)=TεφX. Moreover, for every u∈Rn, ξf(u)=f, and analogously ξf−1(u+ε)=f−1. Thus, we get ξf−1(u+ε)∘ξf(u)=f−1∘f=idX=TφX(u⪯u+2ε). Similarly, ξf(u+ε)∘ξf−1(u)=f∘f−1=idY=TφY(u⪯u+2ε). Hence, the pair (ξf,ξf−1) is an ε-interleaving between TφX and TφY, proving that dI≤dNP also in this case.
Let us now show that dNP≤dI. The claim is obvious if dI=∞, so let us assume that TφX and TφY are ε-interleaved for some ε≥0 by an ε-interleaving (ξ,η) with ξ:TφX⇒TεφY and η:TφY⇒TεφX. By Definition 5.2, for every u∈Rn, η(u+ε)∘ξ(u)=TφX(u⪯u+2ε), and ξ(u+ε)∘η(u)=TφY(u⪯u+2ε). Hence, by Lemma 5.1 and Proposition 5.3, there are two continuous maps f:X→Y and g:Y→X such that, for each u∈Rn, ξ(u)=f, η(u)=g, (φY−ε)∘f⪯φX and (φX−ε)∘g⪯φY. Moreover, from η(u+ε)∘ξ(u)=TφX(u⪯u+2ε) and ξ(u+ε)∘η(u)=TφY(u⪯u+2ε), it follows that g∘f=idX and f∘g=idY. Hence, g=f−1 and ∥φX−φY∘f∥∞≤ε.
∎
5.1.2. The interleaving distance between functions up to homotopy
We now consider O=hTop/R⪯n, the category with continuous functions φX:X→Rn as objects, and 0-homotopy classes of 0-maps between X and Y as morphisms: for two objects φX, φY in hTop/R⪯n, a morphism from φX to φY is the 0-homotopy class with respect to (φX,φY) of a 0-map f:X→Y, that is, a continuous map between X and Y such that φY∘f⪯φX, and is denoted by [f](φX,φY). In hTop/R⪯n, the composition of morphisms is defined as the 0-homotopy class of the composition of 0-maps: for φX, φY, φZ in hTop/R⪯n, and f:X→Y, g:Y→Z being 0-maps with respect to (φX,φY) and (φY,φZ), respectively, we set
[TABLE]
This is well defined because the composition does not depend on the representatives, and φZ∘g≤φY, φY∘f⪯φX imply φZ∘g∘f⪯φX. Composition is associative and, for any object (X,φX), the 0-homotopy class of the identity idX with respect to (φX,φX) is a morphism from (X,φX) to (X,φX) in hTop/R⪯n.
Proposition 5.5**.**
Every continuous function φX:X→Rn defines a functor hTφX:R→hTop/R⪯n by setting
•
for every u∈Rn, hTφX(u):=φX−u;
•
for every u,v∈Rn with u⪯v, hTφX(u⪯v):=[idX](φX−u,φX−v).
Proof.
For u⪯v, [idX](φX−u,φX−v) is a morphism between φX−u and φX−v because (φX−v)∘idX⪯φX−u. Moreover, hTφX preserves the identity and the composition.
∎
Let us now consider ε-shifts of functors hTφX.
Proposition 5.6**.**
For every ε⪰0, and for every φX, the ε-shift of hTφX, hTεφX:Rn→hTop/R⪯n, is equal to the functor hTφX−ε:Rn→hTop/R⪯n.
Proof.
By Definition 5.1 and the definition of hTφX (Proposition 5.5), the ε-shift of hTφX is the functor hTεφX:Rn→hTop/R⪯n such that
(1)
for every u∈Rn, hTεφX(u)=hTφX(u+ε)=φX−u−ε=hTφX−ε(u);
2. (2)
for every u,v∈Rn with u⪯v, hTεφX(u⪯v)=hTφX(u+ε⪯v+ε)=[idX](φX−u−ε,φX−v−ε)=hTφX−ε(u⪯v).
∎
The next lemma describes the natural transformations between pairs of functors hTφX and hTφY.
Lemma 5.2**.**
Let X, Y be topological spaces, and let φX:X→Rn, φY:Y→Rn be any two continuous functions. Then, every continuous map f:X→Y such that φY∘f⪯φX induces a natural transformation hξf:hTφX⇒hTφY such that, for every u∈Rn, hξf(u) is equal to [f](φX−u,φY−u).
Reciprocally, for every natural transformation hξ:hTφX⇒hTφY, with hξ(u)=[fu](φX−u,φY−u), and for every α⪰0 in Rn, fu and fu+α are α-homotopic with respect to (φX,φY) for every u∈Rn.
Proof.
Any continuous map f:X→Y such that φY∘f⪯φX induces a natural transformation hξf:hTφX⇒hTφY defined as follows: for every u∈Rn, hξf(u):=[f](φX−u,φY−u). Indeed, for every u∈Rn, f is a morphism between φX−u and φY−u because φY∘f⪯φX implies (φY−u)∘f⪯φX−u, proving that hξf(u):hTφX(u)→hTφY(u). Moreover, [f](φX−u,φY−u)∘[idX](φX−u,φX−u)=[idY](φY−u,φY−u)∘[f](φX−u,φY−u), proving that hξf(u)∘hTφX(u⪯v)=hTφY(u⪯v)∘hξf(v).
Reciprocally, assume that there is a family hξ={hξ(u):hTφX(u)→hTφY(u)}u∈Rn of 0-homotopy classes of maps fu with respect to (φX−u,φY−u) such that diagram (5.5) commutes for every u≤v∈Rn: hξ(v)∘hTφX(u⪯v)=hTφY(u⪯v)∘hξ(u). Take α=v−u. From
[TABLE]
it follows that
[TABLE]
Equivalently, [fu+α](φX−u,φY−u−α)=[fu](φX−u,φY−u−α). In other words, there exists a homotopy H:X×I→Y such that H(⋅,0)=fu, H(⋅,1)=fu+α, and φY∘H(⋅,t)−u−α⪯φX−u for every t∈I. Hence φY∘H(⋅,t)⪯φX+α for every t∈I, yielding that fu and fu+α are α-homotopic with respect to (φX,φY).
∎
We can now show that the interleaving distance between functors hTφX and hTφY in hTop/R⪯n coincides with the persistent homotopy type pseudo-distance.
Proposition 5.7**.**
Let X and Y be topological spaces. Denoting by dHT the persistent homotopy type pseudo-distance, for every pair of continuous functions φX:X→Rn and φY:Y→Rn, it holds that
[TABLE]
Proof.
If X and Y are not homotopy equivalent, dHT=∞ trivially implying that dI≤dHT.
Let f:X→Y, g:Y→X form a pair (f,g) of ε-homotopy equivalences with respect to (φX,φY) for some ε⪰0. It holds that (φY−ε)∘f⪯φX and (φX−ε)∘g⪯φY. By Lemma 5.2, f induces the natural transformation hξf:hTφX⇒hT(φY−ε) with hξf(u)=[f](φX−u,φY−ε−u), and g induces the natural transformation hξg:hTφY⇒hT(φX−ε) with hξg(u)=[g](φY−u,φX−ε−u). By Proposition 5.6, hT(φY−ε)=hTεφY and hT(φX−ε)=hTεφX. Thus, we get
[TABLE]
Similarly, hξf(u+ε)∘hξg(u)=hTφY(u⪯u+2ε). Hence, the pair (hξf,hξg) is an ∥ε∥∞-interleaving between hTφX and hTφY, proving that dI≤dHT also in this case.
Let us now show that dHT≤dI. The claim is obvious if dI=∞, so let us assume that hTφX and hTφY are ε-interleaved for some ε≥0 by an ε-interleaving (hξ,hζ). By Proposition 5.6, there is a continuous 0-map fu:X→Y with respect to (φX−u,φY−u−ε) and a continuous 0-map gu+ε:Y→X with respect to (φY−u−ε,φX−u−2ε) such that [fu](φX−u,φY−u−ε)=hξ(u) and [gu+ε](φY−u−ε,φX−u−2ε)=hζ(u+2ε) for any fixed u arbitrarily chosen. Note that fu and gu+ε are also ε-maps with respect to (φX,φY) and (φY,φX), respectively. By Definition 5.2, for every u∈Rn, hζ(u+ε)∘hξ(u)=hTφX(u≤u+2ε), and hξ(u+2ε)∘hζ(u+ε)=hTφY(u+ε⪯u+3ε). Hence, from hζ(u+ε)∘hξ(u)=hTφX(u⪯u+2ε) we deduce that gu+ε∘fu is 0-homotopic to idX with respect to (φX−u,φX−u−2ε), that is gu+ε∘fu is 2ε-homotopic to idX with respect to (φX,φX). Analogously, from hξ(u+ε)∘hζ(u)=hTφY(u⪯u+2ε) we deduce that fu+ε∘gu is 0-homotopic to idY with respect to (φY−u,φY−u−2ε), that is fu+ε∘gu is 2ε-homotopic to idY with respect to (φY,φY). On the other hand, by Lemma 5.2, gu is ε-homotopic to gu+ε with respect to (φY,φX), and fu+ε is ε-homotopic to fu with respect to (φX,φY). Thus, fu+ε∘gu is 2ε-homotopic to fu∘gu+ε with respect to (φY,φY), implying that fu∘gu+ε is 2ε-homotopic to idY with respect to (φY,φY). In conclusion, for an arbitrarily chosen u∈Rn, (fu,gu+ε) is a pair of ε-homotopy equivalences with respect to (φX,φY), thus proving that dHT((X,φX),(Y,φY))≤ε.
∎
5.1.3. The interleaving distance between persistence modules
Let VectF be the category of vector spaces over a fixed field F. An n-dimensional persistence module can be viewed as a functor P:Rn→VectF. Replacing O with VectF in Definition 5.2, we obtain the interleaving distance on the category VectF as usual.
A standard way in which one obtains n-dimensional persistence modules from topological spaces endowed with Rn valued functions, is by composing the sublevelset filtration functor with the homology functor: for k a non-negative integer, and for (X,φX) an object in Top/R⪯n, PkX=Hk∘TφX is an object in VectFRn.
An immediate remark is that given k∈N and any ε-interleaving (ζ,η) between objects (X,φX) and (Y,φY) in Top/R⪯n, the pair (Hk(ζ),Hk(η)) is an ε-interleaving between the n-dimensional persistence modules PkX and PkY.
As a corollary of Propositions 5.7 and 5.4 we then obtain the following result linking the interleaving distances on the categories VectFRn, Top/R⪯n, and hTop/R⪯n.
Corollary 5.1**.**
For every (X,φX),(Y,φY) with X,Y topological spaces, every φX:X→Rn, φY:Y→Rn continuous functions, and every non-negative integer k, it holds that
[TABLE]
Remark 5.1*.*
Compare the leftmost inequality above (for n=1) with Lemma 3.1.
6. Discussion
We have introduced the persistent homotopy type distance dHT to quantify perturbations of functions defined on homotopy equivalent spaces. As a key consequence, we were able to lift the standard stability result of persistence diagrams of sublevel set filtrations of Cohen-Steiner, Edelsbrunner, and Harer [11] from the setting of functions defined on the same domain to the more general setting of functions defined on possibly different but homotopy equivalent domains.
Focusing, as we did, on sublevelsets filtrations implies a certain asymmetry in the definition of persistent homotopy type distance in that only up-shifts of maps impact it, but not down-shifts, see Proposition 2.4 and Example 2.6.
This lack of symmetry is shared neither by the L∞ distance nor the natural pseudo-distance. One interesting line of research is whether a certain modification of our definition of the persistent homotopy type distance would correct this asymmetry. Further, it would be interesting to investigate whether such modification implies a lift of the standard L∞ stability results for extended persistence [12] and/or interlevel set persistence [1] to settings when functions are defined on possibly different homotopy equivalent domains.
Another interesting open line of research is uncovering the relationship, if any, between our homotopy type distance and the distances that appear in the recent work of Blumberg and Lesnick [3].
7. Acknowledgements
This work started during a visit of the third author to the first author at the University of Bologna in 2014 which was partially supported by INdAM-GNSAGA. The first two authors partially carried out this research within the
activities of ARCES “E. De Castro”, University of Bologna. The third author has been partially supported by NSF under grants DMS-1547357, CCF-1526513, and IIS-1422400. The authors thank Francesca Cagliari for her helpful advice about the categorical setting and Michael Lesnick for useful discussions that helped us to focus Section 5.
Bibliography25
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications vol. 15, (2013) no. 1, 51–72.
2[2] S. Biasotti, L. De Floriani, B. Falcidieno, P. Frosini, D. Giorgi, C. Landi, L. Papaleo, M. Spagnuolo, Describing shapes by geometrical-topological properties of real functions , ACM Computing Surveys, vol. 40 (2008), n. 4, 12:1–12:87.
3[3] A. Blumberg and M. Lesnick. Universality of the Homotopy Interleaving Distance . Ar Xiv 2017, https://arxiv.org/abs/1705.01690 .
4[4] P. Bubenik and J. A. Scott, Categorification of persistent homology , Discrete & Computational Geometry, vol. 51 (2014), n. 3, 600–627.
5[5] P. Bubenik, V. de Silva, and J. Scott. Metrics for generalized persistence modules. Foundations of Computational Mathematics vol. 15 (2015) n. 6, 1501–1531.
6[6] F. Cagliari, B. Di Fabio, C. Landi, The natural pseudo-distance as a quotient pseudo-metric, and applications , Forum Mathematicum, 27 (2013), n. 3, 1729–1742.
7[7] G. Carlsson, Topology and data , Bull. Amer. Math. Soc. (N.S.), vol. 46 (2009), n. 2, 255–308.
8[8] A. Cerri, B. Di Fabio, M. Ferri, P. Frosini, C. Landi, Betti numbers in multidimensional persistent homology are stable functions , Mathematical Methods in the Applied Sciences, vol. 36 (2013), 1543–1557.