Level-sets persistence and sheaf theory
Nicolas Berkouk, Gr\'egory Ginot, Steve Oudot

TL;DR
This paper establishes a deep connection between level-sets persistence in topological data analysis and derived sheaf theory, providing categorical equivalences and stability results.
Contribution
It constructs functors linking 2-parameter persistence modules and sheaves, and proves classification, barcode decomposition, and stability theorems for Mayer-Vietoris systems.
Findings
Establishes a pseudo-isometric equivalence of categories between sheaves and Mayer-Vietoris systems.
Provides classification and stability theorems for Mayer-Vietoris systems.
Shows a functorial equivalence between level-sets persistence and derived pushforward.
Abstract
In this paper we provide an explicit connection between level-sets persistence and derived sheaf theory over the real line. In particular we construct a functor from 2-parameter persistence modules to sheaves over , as well as a functor in the other direction. We also observe that the 2-parameter persistence modules arising from the level sets of Morse functions carry extra structure that we call a Mayer-Vietoris system. We prove classification, barcode decomposition, and stability theorems for these Mayer-Vietoris systems, and we show that the aforementioned functors establish a pseudo-isometric equivalence of categories between derived constructible sheaves with the convolution or (derived) bottleneck distance and the interleaving distance of strictly pointwise finite-dimensional Mayer-Vietoris systems. Ultimately, our results provide a functorial equivalence between…
Peer Reviews
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.
Taxonomy
TopicsData Visualization and Analytics · Constraint Satisfaction and Optimization · Data Mining Algorithms and Applications
Level-sets persistence and sheaf theory
Nicolas Berkouk, Grégory Ginot, Steve Oudot
Abstract
In this paper we provide an explicit connection between level-sets persistence and derived sheaf theory over the real line. In particular we construct a functor from 2-parameter persistence modules to sheaves over , as well as a functor in the other direction. We also observe that the 2-parameter persistence modules arising from the level sets of Morse functions carry extra structure that we call a Mayer-Vietoris system. We prove classification, barcode decomposition, and stability theorems for these Mayer-Vietoris systems, and we show that the aforementioned functors establish a pseudo-isometric equivalence of categories between derived constructible sheaves with the convolution or (derived) bottleneck distance and the interleaving distance of strictly pointwise finite-dimensional Mayer-Vietoris systems. Ultimately, our results provide a functorial equivalence between level-sets persistence and derived pushforward for continuous real-valued functions.
Contents
-
1.2.2 Notations and conventions for shifts of graded and persistent objects
-
3.1 Convolution distance for sheaves after Kashiwara-Schapira
-
3.3 Extending level-set persistence modules as pre-sheaves over
-
4.1 Construction of the sheafification of MV-systems: the functor
-
4.2 The functor from constructible sheaves to Mayer-Vietoris systems
1 Introduction
Persistent homology is a powerful and versatile tool of applied algebraic topology that has found applications in a variety of areas of the Sciences, in particular those connected with data Science. Roughly speaking, the aim of persistent homology is to define algebraic invariants for filtered topological spaces that are both robust and computer-friendly. Typically, given a continuous function , one considers the homology of the sublevel sets , for a real parameter , and of the various inclusion maps induced between them as grows. This data is called the sublevel-sets persistence module associated to . Under some reasonable finiteness assumptions, this data can be compactly encoded with a set of intervals—called a barcode—that describe when the homology generators appear, live, then die in the family of sublevel sets. Barcodes are easy to compute and to handle on a computer. They serve as descriptors for data in applications, where they can be compared using a matching distance called the bottleneck metric. This metric is actually equivalent to the so-called interleaving distance between persistence modules, which is both stable (i.e. robust to perturbations of the input function ) and universal (i.e. the most sensitive among stable distances) [Les12]. These properties constitute the cornerstone of persistence theory and they play a key role in its applications.
In the recent years, several generalizations of persistent homology have been proposed, whose goal is to extract richer information on the topology of a continuous function . In this work we focus on two of the most prominent ones, namely level-sets persistence and two-parameter persistence, and we provide an explicit connection to derived (co)sheaf theory.
Level-sets persistence studies the homology groups of preimages , where is the French notation111We adopt this notation for the sake of clarity, to avoid potential confusions with the point . for the open interval . The collection of these groups for , together with the collection of morphisms induced by inclusions of smaller intervals into larger intervals, form a two-parameter persistence module indexed over the upper half-plane via the identification of each interval with the point . This module is called the level-sets persistence module of and denoted by (see 2.27). Note that the plane is equipped with the partial product order, noted . Henceforth we will write for the category of persistence modules indexed over , and for its counterpart over . Unfortunately, though very natural, the theory of general 2-parameter persistence modules is significantly more complicated than 1-parameter persistence. For instance, there is no analogue of barcodes, due to the poset being a wild-type quiver with arbitrarily complicated indecomposables. Nevertheless, one can still define an interleaving distance in this context, satisfying the same stability and universality properties as in 1-parameter persistence [Les12].
Another very promising direction of investigation is given by merging (co)sheaves theory with persistence and computer-friendly techniques. It was pioneered by the work of Curry [Cur14], and a general framework was developed by Kashiwara and Schapira [KS18a, KS18b]. In order to benefit fully from the algebraic topology of sheaves, it is necessary to work with the derived (sometimes called homotopy) category. Kashiwara-Schapira have equipped the derived category of sheaves with a distance, called the convolution distance, which is a derived analogue of the interleaving distance, see [KS18a, BP19]. Furthermore, there is a natural notion of barcode and a decomposition theorem for constructible sheaves over . To a function , one can associate a canonical sheaf over , namely the derived pushforward , which is a sheaf analogue of the level-sets persistence homology introduced earlier (here k is our ground field). The persistence theory for sheaves over , following Kashiwara and Schapira’s program, was investigated in depth in [BG]. In particular, a derived bottleneck distance for constructible sheaves was developed and proven to be isometric to the convolution distance.
The main motivation of this paper is to relate precisely the above developments, namely: persistence modules over on the one hand; sheaves over on the other hand. Specifically, given a function , we are interested in connecting the level-set persistence module with the derived pushforward . In order to do so, we will construct a functor from 2-parameter persistence modules to sheaves over (see section 3.3). Note that this functor is not an equivalence of categories, and that it is not isometric nor reasonably Lipschitz either. Indeed, there can be no equivalences or almost equivalences between these two categories, since the general category of 2-parameter persistence modules is wild representation type as we have mentioned already, and since its objects do not, in general, satisfy any of the local-to-global properties of sheaves.
As mentioned above, of particular interest to us are the level-sets persistence modules arising from continuous functions , which actually have more structure than general persistence modules over .
Our idea is thus to consider a variant of the category of 2-parameter persistence modules taking into account the extra structure and properties carried by level-sets persistence modules.
This follows the fundamental credo of algebraic topology that extra structure on homology gives refined homotopy and geometric information. A general idea here is that to get a better-behaved category of 2-parameter persistence modules, it is key to consider and restrict to those objects having the extra structure and properties coming from data arising in practical applications.
Let us now explain where this extra structure comes from: the various homology groups of a topological space obtained as the union of two open subsets are connected through the well-known Mayer-Vietoris long exact sequence. This sequence involves the homology groups of the union, the sum of the homology groups of the two open subsets, and the homology of their intersection. We axiomatize this data to define a structure we call Mayer-Vietoris (MV) persistence systems over , whose category is denoted by . A MV-system is a graded persistence module over , together with connecting morphisms for all vectors and grades , giving rise to the following exact sequences (see Definition 2.14):
[TABLE]
and satisfying some appropriate compatibility conditions. These sequences encode the interactions between the various homology groups at various points of , and they carry both a derived and local-to-global information—in some sense that will be made precise in the paper.
A key property that we leverage in our analysis, is that the category of Mayer-Vietoris systems is rather well behaved. In particular, we prove a structure theorem for Mayer-Vietoris persistence systems under standard pointwise finite dimensionality assumptions (see Theorem 2.19). According to this result, there are four different types of indecomposable Mayer-Vietoris systems, which all have pointwise dimension at most 1 and are therefore characterized by their supports. The supports can be either vertical or horizontal bands, or else birth or death blocks (see Definition 2.16 and Lemma 3.25). Degree-wise, these indecomposables behave like the so-called block modules from level-sets persistence and middle-exact bipersistence theories [BCB18, BL17, CdSKM19, CdSM09, CO17]. For this reason, in the following we abuse terms and also call our indecomposables block MV-systems. Our structure theorem (Theorem 2.19) takes the following form:
Theorem 1.1**.**
A, bounded below, pointwise finite-dimensional (pfd) Mayer-Vietoris system has a unique decomposition as a direct sum of block MV-systems.
This result follows non-trivially from the decomposition theorem for middle-exact bipersistence modules [BCB18, CO17]. It provides a barcode for Mayer-Vietoris systems, made of the blocks involved in their decomposition. Furthermore, we have a canonical interleaving distance for Mayer-Vietoris systems since they form a category.
The aforementioned functor from 2-parameter persistence modules to sheaves lifts as a (contravariant) functor from Mayer-Vietoris systems to the derived category of sheaves on , which is essentially the sheafification of the duality functor. We construct a pointwise section of this functor, i.e. a functor from sheaves to Mayer-Vietoris systems such that the composition with gives the identity pointwise on every sheaf (see Corollary 4.18):
[TABLE]
Roughly speaking, this functor is defined as the dual of the derived global sections of sheaves (see Definition 4.7). Both functors restrict to the subcategories of pointwise (resp. strictly pointwise see Definition 4.1) finite-dimensional Mayer-Vietoris systems on one side, and of constructible sheaves on on the other side. Under standard pointwise finiteness conditions, we are able to prove that these two functors establish a pseudo-isometric equivalence between these categories. More precisely, our second main theorem (see Theorem 4.21 and Corollary 4.20) states as follows:
Theorem 1.2**.**
The functors and form a pseudo-isometric equivalence of categories, meaning:
- —
for all strictly pointwise finite-dimensional Mayer-Vietoris systems , one has equality between the interleaving, convolution and derived bottleneck distances;
- —
for all constructible sheaves , one has ;
- —
if and only if .
In particular, the derived distances can be computed using the 2-paramater interleaving distance for M-V systems.
To prove this theorem, in Sections 4.1 and 4.2 we explicitly compute the action of the sheafification of Mayer-Vietoris systems functor and of its section on shifts and convolution for the building block modules of each theories. These are computations of independent interest.
Finally, we prove that the functors and are equivalent to each other under these transformations, i.e. (Proposition 4.6), hence isometric according to theorem 1.2, thus establishing the sought-for correspondence between level-sets persistence and derived pushforward for continuous real-valued functions.
Theorem 1.3 below summarizes our main results connecting level-sets persistence, Mayer-Vietoris systems, and derived sheaves. The notation stands for the category of topological spaces over , whose objects are spaces together with a continuous map , and whose morphisms are commutative triangles \textstyle{X\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\phi}$$\scriptstyle{f}$$\textstyle{Y\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{g}$$\textstyle{\mathbb{R}} . We let denote the subcategory of those functions such that is constructible, denote the bounded derived category of constructible sheaves on , and we denote the functor .
Theorem 1.3**.**
The following diagram of categories and functors commutes:
[TABLE]
Furthermore, and the vertical maps are isometries, while the other maps are -Lipschitz.
Proof.****.
The existence and commutativity of the diagram is the content of Lemma 4.3, Propositions 2.28 and 4.6, and Theorem 4.21. The rest of the statement is given by Theorem 4.21 and the stability theorems 2.30, 3.4.
Theorem 1.3 relates precisely, and in fact essentially identifies, level-set persistence and constructible sheaves. Moreover, it does so in a functorial way. In the final section of the paper (Section 4.4) we give an example with full detail that illustrates this result.
1.1 Related and future work
Parallel and independently to our work, Fluhr [Flu18] has consider similar problems, building a functor from the category of derived constructible sheaves over to the category of contravariant functors on some poset . Once restricted to the subposet of all points/elements corresponding to bounded intervals, such contravariant functors carry roughly the same data as our Mayer-Vietoris systems.
In future work it will be interesting to use the isometric functors we have constructed to study the shriek functors associated to functions, namely .
Furthermore, the pseudo-isometry theorem 1.2 shall lift at the level of derived category of 2-paramater persistence modules to give an isometric equivalence of categories between constructible sheaves and the quotient of a full subcategory of 2-parameter persistent complexes where one identifies those MV-systems that are at distance [math] of each other.
1.2 Notations
Here we detail our notations and conventions, for the reader’s convenience:
- —
We fix a ground (commutative) field denoted k.
- —
For , we will use the notations and .
- —
Given a category , we denote its opposite category.
- —
We will use the same notation for a poset and its associated category whose objects are the elements of and whose set of morphims from to consists of a single element if and is empty if not.
- —
A functor from a poset to vector spaces will be called pointwise finite dimensional, pfd for short, if for every , is finite dimensional.
- —
We denote the functor .
- —
For a death block , see Definition 2.8, we denote its dual in , and vice-versa.
- —
The derived category associated to an abelian category (such as complexes of sheaves or complexes of k-modules) is the localization of with respect to quasi-isomorphisms, that is the category obtained by formally inverting quasi-isomorphisms. See e.g. [KS90, Gro57].
1.2.1 Notations for intervals
- —
We will use the french notation for open intervals in . The reason is to avoid confusion with points which will both be possible values of persistent or sheaf objects (and usually appear with similar letters).
- —
For real numbers , the notation will mean an interval whose boundary points are and . We use this notation when we do not want to precise if the interval is open, compact, or half-open; in other words as a variable.
1.2.2 Notations and conventions for shifts of graded and persistent objects
Standard and convenient notations for shifting the degree of a (possibly differential) graded object or for shifted (or translated) persistent object are both given by in the literature. We will have to use objects which are both differential graded and persistent, and we now explain how to avoid confusion about this notation in the paper. Note that we also have to deal with objects which are naturally homologically graded (for instance persistence modules) and cohomologically graded (sheaves).
For any (differential) cohomologically graded object , we will use the notation for the (differential) graded object where . The letter can be replaced by , , , or in the paper, and the notation with one of these letters always means such a grading shift. These letters can also show up in subscripts.
Similarly, for a (differential) homologically graded object we will use the notation for the graded object , following for instance the conventions of [Sta19, Section 12.13]. We warn the reader that there is also an opposite convention in the literature (which is the topological convention for suspension). The main advantage of this choice of convention in this paper is that the duality functor commutes with the shift in grading (instead of changing to its opposite):
[TABLE]
where following the usual convention for dual of (differential) graded objects we define
[TABLE]
for any integer .
For a persistent object (over or , see 2.1) we will also use the standard notation (where is in ) for its shifted by the vector , which is also a persistent object (Definition 2.2). Note that the shift is by a vector, i.e. a point in not an integer. We will also use letters such as , or , , for these operations. This should cause no confusion since the sets of letters used in the two types of shifts are disjoint.
For instance for a graded persistent object , the notation , where and , stands for the persistent object defined by .
2 The category of Mayer-Vietoris systems over
In this section we study the notion of Mayer-Vietoris system which are persistence modules over with additional structure. We first start by the latter notion.
2.1 Middle-exact persistence modules over
We define , equipped with the product (partial) order if and only if and . In other words, is the upper half-space above the antidiagonal of , equipped with the induced product partial order of .
Recall that for , we denote and .
Definition 2.1**.**
A persistence module over is a functor , where is the category of k-vector spaces.
Persistence modules over together with natural transformations of functors form a category, denoted .
Similarly the category of persistence comodules over is the category of functors .
In particular, the data of a persistence module over is encoded by the structural morphisms
[TABLE]
defined for any and and their compatibilities.
The motivating examples are the persistence modules associated, for any integer , to the level-set of a continuous function (see example 2.27). Because of this traditional examples, we will sometimes use the terminology *level-set persistence modules for arbitrary persistence modules over *.
Definition 2.2**.**
For and , we define to be the persistence module given, for any , by with structural morphisms induced by those of : for any :
[TABLE]
We extend the definition to by with the identity for .
It is immediate to check that the structural morphisms (1) induces, for any the canonical translation maps:
[TABLE]
We will adopt the convention that when we do not need explicitly a notation for a translation or structural morphism we simply do not label it.
For , any induces the short complex :
[TABLE]
where the first map is \left(\begin{array}[]{c}\tau^{M}_{s_{x}}\\ -\tau^{M}_{s_{y}}\end{array}\right) and the second one is in matrix notations. In other words for any and , the first map is given by and the second by . The fact that (3) is a complex is an immediate consequence of definition 2.1.
Definition 2.3**.**
An object is said to be middle-exact if the complexes are exact for every .
Remark 2.4**.**
We think of middle-exact complexes as being the analogue for the poset of half the terms of the Mayer-Vietoris long exact sequence relating the various homology groups of two open subsets of a space, their reunion and intersection. What is missing to have a long exact sequence are precisely the connecting homomorphisms relating homology groups of different degrees. In Section 2.2, we will precisely introduce an additional data on a (graded) middle-exact object of to obtain such long exact sequences.
Persistence modules have a barcode decomposition similar to peristence modules over that we now describe. First we specify the various geometric types, called blocks, of the barcode.
Definition 2.5**.**
A block is a subset of of the following type :
A birthblock (bb for short) if there exists such that , where and can eventually worth simultaneously. Moreover, we will write that is of type bb+ if , and of type bb- if . 2. 2.
A deathblock (db for short) if there exists such that . Moreover, we will write that is of type db+ if and of type db- if not. 3. 3.
A horizontalblock (hb for short) if there exists and such that . 4. 4.
A verticalblock (vb for short) if there exists and such that .
Remark 2.6**.**
Blocks are defined over the whole and not just .
Remark 2.7**.**
Note that a deathblock is characterized by its supremum222which is easily seen to be, if , the point , that is together with the data of whether its two boundary lines are in the block or not (note that the supremum is inside if and only if both boundaries lines are). Similarly a birth block is characterized by its infimum and the data of whether its boundary lines are in or not. Note also that the vertical and horizontal blocks never have finite extremums.
Definition 2.8** (Duality between death and birth blocks).**
The dual of a deathblock is the birthblock whose infimum is the supremum of and whose vertical (resp. horizontal) boundary lines are in if and only if the the vertical (resp. horizontal) boundary lines of are not.
Dually we define the dual of a birthblock as the death block whose supremum is the infimum of and whose vertical (resp. horizontal) boundary lines are in if and only if the the vertical (resp. horizontal) boundary lines of are not.
Remark 2.9**.**
The rule is involutive: and in particular exhibits a perfect duality between death and birth blocks. Furthermore, note that the dual of a deathblock is of type bb+** if and only if the deathblock has a non-trivial intersection with i.e. is in db+.
We now define the building blocks (that is the indecomposables in the middle exact case) of persistence modules over .
Definition 2.10**.**
Let be a block, define the block module associated to by, for any , :
[TABLE]
Remark 2.11**.**
If is in db-**, then . Therefore we will usually not consider the block modules associated to such negative deathblocks. In what follows, the reader can safely assume that when we speak about a deathblock we mean an element of db+, unless otherwise stated.
Let us denote, for , ; this is a block of the same type as .
Lemma 2.12**.**
Let be a block and . There is a canonical isomorphism
[TABLE]
Proof.****.
By definition 2.10, we have that
[TABLE]
Therefore we have that
[TABLE]
Theorem 2.13** (Cochoy-Oudot [CO17], Botnan-Crawley-Boevey [BCB18]).**
Let be middle exact and pointwise finite dimensional (pfd). Then there exists a unique multiset of blocks such that :
[TABLE]
2.2 Mayer-Vietoris systems over and their classification
Definition 2.14**.**
We define the category of Mayer-Vietoris persistent systems over as follows :
Objects : collections where is in and , such that for all and all , the following sequence
[TABLE]
is exact and furthermore the following diagram is commutative, for :
[TABLE]
Morphisms : for and two Mayer-Vietoris systems over , a morphism from to is a collection of morphisms where such that the following diagram
[TABLE]
commutes for all and .
For a Mayer-Vietoris system and , we will write for the associated object of of which lies in degree .
A natural class of examples of such M-V systems is provided by homology of level-sets of a continuous function on a topological space . See, example 2.27 below. Furthermore, we will see that any complex of sheaves on gives rise to a MV-system (see Proposition 4.11).
Remark 2.15**.**
- —
Observe that if is a Mayer-Vietoris system, is in particular a middle exact modules, for .
- —
The category is indeed a category. It is easy from the definition to observe that it is additive. However, as we shall see later on, it is not abelian.
Our remaining goal in this section is to classify Mayer-Vietoris system in a way similar to Theorem 2.13. For this, we introduce building blocks for those.
Definition 2.16**.**
Let B be a block (Definition 2.5) and . We define the Mayer-Vietoris system of degree associated to B, denoted , by :
- —
If B is of type bb-, hb or vb then with for all and
- —
If B is of type db+, then with for all , for all and for , we define , , and by pointwise identities on .
- —
Dually, if is of type bb+, then define as .
- —
If B is of type db-**, then we set .
Of course the case of db-** matches remark 2.11.
Remark 2.17**.**
One can easily see that the Mayer-Vietoris systems are indecomposable. We will refer to these Mayer-Vietoris systems to block MV-systems for short.
Also note that for a block of type db+ or bb+** and , the graded persistent module with for all and is not a Mayer-Vietoris system.
Lemma 2.18**.**
The graded persistent modules associated to blocks in Definition 2.16 are Mayer-Vietoris systems for any and block .
Proof.****.
We advise the reader to draw the different cases in a way similar to figure 2. Since , the case of db+ and bb+ are equivalent.
Note that every block which is not of type db is stable by upward vertical and/or left-to-right horizontal translations. It follows that is injective. Thus for blocks of type vb, hb or bb-, is one to one as well in every degree, a well as is the map in degree for of type db (and therefore also for if is of type bb+ by definition 2.16).
Note now that for a block , if and satisfies that , then either or is in as well if is of type different from bb. Furthermore, for a block of type bb, the latter property only fails if where is its dual (death)block. When is of type bb-, those points are not in . Therefore, the maps are surjective for all blocks of type different from bb+.
Let us now prove that the subsequences \textstyle{\textbf{k}^{B}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\textbf{k}^{B}[s_{x}]\oplus\textbf{k}^{B}[s_{y}]\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\textbf{k}^{B}[s]} are exact for any ; we have already seen that the composition is zero. Now, assume is a nonzero element in the kernel of . Then, if then so are and and therefore and are the identity map . In particular . But since as well, then is the map and hence is in its image. If , then is not a birthblock and at least one element among and is not in . If none are, then there is nothing to prove and if not then is either a vertical or horizontal block. In the first case, and therefore is the identity map so that we have a preimage for . The other case is dual. This conclude the proof of the lemma for all blocks which are not of type db+.
To prove the result for blocks of type db+, since and by the injectivity result we have obtained at the beginning of that proof, it is enough to prove that the sequences
[TABLE]
are exact for any , . If , there is nothing to prove. Thus we assume . First, if both and are null, then . Therefore, is the identity and the sequence is exact. If both and are non-null, then identifies with the necessarily injective diagonal inclusion and so that and the sequence is thus exact. Finally if only one or is non-null, one of the map or is the identity-hence injective-and we still have . Thus . The sequence is again exact and the lemma is proved.
Denote by M-V the full sub-category of Mayer-Vietoris systems over whose objects are the MV systems such that there exists with for all . In other words, M-V is the subcategory of lower-bounded Mayer-Vietoris systems.
Theorem 2.19** (Classification of pfd M-V systems).**
Let an object of M-V which is pointwise finite dimensional. Then there exists a unique collection of multisets of blocks of type bb-, hb, vb, and db+, such that we have an isomorphism in M-V :
[TABLE]
We call the barcode of . It completely determines up to isomorphism of Mayer-Vietoris systems.
Remark 2.20**.**
By Definition 2.5, birth blocks of type bb+ generate the same MV systems as their dual death blocks, therefore they come in pairs in the decomposition given by Theorem 2.19, which explains why the blocks of type bb+ are ignored in the barcode.
To prove the theorem 2.19, we will use the following technical lemmas :
Lemma 2.21**.**
Let be a pfd MV-system over . If contains only blocks of type db+, then .
Proof.****.
Given , the universal property of cokernels and the exactness of (3) imply that factorizes through
[TABLE]
Now, this cokernel is trivial since by assumption is isomorphic to a direct sum of blocks of type db+. Therefore, .
Consequently, for every and every , the exact sequence of persistence modules
[TABLE]
yields since is assumed to be of type db+.
Lemma 2.22**.**
Let be a pfd MV-system over , such that there exists a block of type bb+ such that for some . Then there exists a pfd MV system such that :
[TABLE]
Proof.****.
Let , since we have the following commutative diagram, where the rows are exact sequences and where exists (and is injective) by the universal property of cokernels:
[TABLE]
Since is a directed ideal of , is an injective object of by lemma 2.1 of[BCB18]. Therefore, splits and is a summand of . The commutativity of (7) then implies the existence of a complement of in , such that decomposes locally as follows:
[TABLE]
Note that we may assume without loss of generality that . Then, by exactness of , we have , therefore our local decomposition extends to a full decomposition of , which means that the upper row complex in (7) is a summand of .
Proof.** (of theorem 2.19).**
Let M-V, and assume without loss of generality that the lower bound is equal to . Then, all the ’s are middle-exact pfd persistence modules over , therefore they decompose uniquely (up to isomorphism) as direct sums of block modules, by theorem 2.13. Note that for the decomposition is trivial.
The finite barcode case:
We first show the result in the case where is finite for every . For each , fix an isomorphism . Thus, the family induces an isomorphism of MV systems from to
[TABLE]
Let of type either bb-, hb or vb, then for , the map :
[TABLE]
is surjective. Thus, is zero on . This proves that is a summand of . Finally, noting the multi-set of intervals of of type either bb-, hb or vb, we have :
[TABLE]
There remains to prove that the right-hand side of the direct sum, noted , decomposes in MV(). For , the barcode contains only blocks of type either bb+ or . Denote by the multiset of blocks of type bb+ involved in . Let us prove by induction that, for any , there exists a MV system such that
[TABLE]
For the property clearly holds with . Let us now assume the property holds up to some . Since has finite cardinality, Lemma 2.22 (applied repeatedly) decomposes as
[TABLE]
which yields the induction step.
Now, given , for any the barcode of can only contain deathblocks by construction. Therefore, by Lemma 2.21, we have . It follows that
[TABLE]
thus concluding the decomposition in the finite barcode case.
The infinite barcode case:
We now generalize to the case where the barcodes can be infinite. For the same reason as in the finite case, each block of type bb-, hb or vb involved in some barcode splits as a summand of . Hence, we are reduced to proving the existence of the decomposition in the case where is a pfd MV system, and contains only blocks of type bb+ or db+ for all . Given , define . Define also
[TABLE]
Then it is clear that , and since is pointwise finite dimensional, contains finitely many blocks of type bb+, for all . We now identify each with its block decomposition via some fixed isomorphism, and for we define as follows:
[TABLE]
Let us prove that is a sub-MV system of . To do so, it is sufficient to prove that for all , the image of is contained in . Fix and . Then factorizes uniquely through:
[TABLE]
As previously, for every of type bb+, we can find such that the canonical map:
[TABLE]
is a monomorphism. And as seen in the proof of Lemma 2.22, \text{coker}\big{(}\textbf{k}_{B}[s_{x}]\oplus\textbf{k}_{B}[s_{y}]\longrightarrow\textbf{k}_{B}[s]\big{)} is isomorphic to , hence an injective object of , so its image splits off as a summand of and is therefore included in
[TABLE]
where is the multiplicity of in . Since , we conclude that . This proves that is a sub-MV system of .
Then, we can apply our decomposition result in the finite barcode case to . And since we have the filtration
[TABLE]
which stabilizes pointwise, we get a decomposition for .
Remark 2.23**.**
Let us finish by a remark on the “derived” meaning of Mayer-Vietoris systems. The axioms and structure we put on are actually encoding a natural homotopy property. To state it, we have to consider the (derived) category of 2-parameter persistence chains complexes, that is the (associated derived) category of functors . Taking the direct sum of homology groups of 2-parameter persistence chain complex gives a graded 2-parameter persistence module. Such graded 2-parameter persistence modules that can be lifted to a Mayer-Vietoris system are precisely those such that the underlying 2-parameter persistence chain complex satisfies the following property333which is best expressed using -categories or model categories:
- For any , the canonical map exhibits as the homotopy quotient \mathbf{hocoker}\Big{(}C_{\bullet}\to C_{\bullet}[s_{x}]\oplus C_{\bullet}[s_{y}]\Big{)} of the persistence chain complex morphisms .
A down to earth way of expressing this homotopy quotient property is to say is quasi-isomorphic to the cone of as a persistent chain complex over . In other words, the structure of Mayer-Vietoris systems is essentially encoding the data of a homotopy property carried by their underlying chain complexes; property expressing that the chain complex at a is determined by those of the chain complexes at the point , , for any which exhibits a local to global coherence of the values of those special 2-parameter persistence chain complexes.
2.3 Interleaving distance for M-V systems
We have a (fully faithful) functor given by the diagonal embedding where . We also denote the induced functor.
Given , and a Mayer-Vietoris system over (as in Definition 2.14), observe that the collection is a morphism of Mayer-Vietoris systems, where .
Definition 2.24**.**
Let and two Mayer-Vietoris systems over . An -interleaving between and is the data of two morphisms of M-V systems and such that the following diagram commutes :
[TABLE]
If and are -interleaved, we shall write
Definition 2.25**.**
Define the interleaving distance between two Mayer-Vietoris systems and to be the non-negative or possibly infinite number :
[TABLE]
Remark 2.26**.**
The interleaving distance for Mayer-Vietoris persistence system is just a derived444because we precisely requires the morphisms to commute with the maps connecting homology groups of different degrees. This claim will be even more supported by the isometry theorem 4.21 extension of the usual interleaving distance in defined, for by
[TABLE]
where means that and are -interleaved as persistence modules, that is there exists and are persistence modules morphisms satisfying that the diagram (8) commutes.
We say that a Mayer-Vietoris system is bounded if there is only finitely many which are non-zero.
We now turn to a main source of examples of Mayer-Vietoris systems.
Example 2.27** (Mayer-Vietoris system associated to continuous functions).**
Let be a continuous function on a topological space . For any , we set
[TABLE]
If , then we have the inclusion inducing, for all ’s, homomorphisms in homology. By Lemma 3.16, this makes a persistence module over , which is called the level set persistence module associated to .
Now, let . For any , we have that the open interval has a cover given by the two open sub-intervals and whose intersection is . Therefore the Mayer-Vietoris sequence associated to this cover gives us linear maps and exact sequences
[TABLE]
We write the maps given at every point by and for we set .
Proposition 2.28**.**
The ’s are persistence modules morphisms and makes the collection a Mayer-Vietoris persistence system over .
Furthermore, the assignment is a functor .
Proof.****.
The fact that the are persistence modules maps as well as the commutativity of diagram (5) follow from the naturality of the Mayer-Vietoris sequence. The exactness of (9) implies the condition (4).
Recall from the introduction that is the category of topological spaces over which by definition has objects given by continuous functions where is a topological space. The set of morphisms from to is the set of all continuous maps such that the diagram \textstyle{X\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\phi}$$\scriptstyle{f}$$\textstyle{Y\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{g}$$\textstyle{\mathbb{R}} is commutative. Since f^{-1}(]-x,y[)=\phi^{-1}\big{(}g^{-1}(]-x,y[)\big{)}, we have that restricts to a continuous map . Therefore we have induced maps after taking homology for all . The functoriality of the homology functor and Mayer-Vietoris sequence prove that this is a morphism of Mayer-Vietoris system and furthermore that the assignment , is a functor.
Example 2.29**.**
Assume is a smooth or topological manifold and is continuous. Then the Mayer Vietoris system (given by example 2.27) is bounded since an open subset of a manifold is a manifold and hence has no homology in degrees higher than its dimension.
In particular, we obtain from the degree-wise stability of interleaving distance between level-set persistence modules the following :
Proposition 2.30**.**
Let two continuous functions defined on the topological space . Then :
[TABLE]
Proof.****.
If the distance is , there is nothing to prove. Otherwise, let . Then for any , we have level-set inclusions and which induce persistence modules over morphisms
[TABLE]
[TABLE]
since taking homology groups is a functor and by lemma 3.16.
The fact that these maps are Mayer-Vietoris systems morphisms follows again as in proposition 2.28 by the naturality of the Mayer-Vietoris sequence associated to open covers of the intervals by and .
3 Stable sheaf theoretic interpretation of persistence
The relationship between (co)sheaf theory and persistence homology has been emphasized by the work of Curry [Cur14] and Kashiwara-Schapira [KS18b, KS18a]. We will recall basics of this point of view in this section and construct a functor from (level-set) persistent objects (over ) to sheaves.
In this paper, we follow the standard notations of [KS90], [KS18b], [BG] for sheaves.
In particular, k will denote a field, the category of vector spaces over k and, for a topological space , we will note the category of sheaves of k-vector spaces on and PSh(X) the category of presheaves of k-modules on . For shortness, we will also write Hom for .
Henceforth, will be the derived category of complexes of k-modules with bounded cohomology, and will be the one of complexes of sheaves with bounded cohomology of k-modules over . Recall that the derived category is obtained from by inverting quasi-isomorphisms of complexes of abelian sheaves. Unless the context is unclear, we will simply use the word sheaf for an object of . We will use the standard Grothendieck operations on sheaves as in [KS90]. Note that, associated to any open-closed subset of , is a sheaf whose main property is that its stalks are k at any point in and are [math] else, see [KS90].
3.1 Convolution distance for sheaves after Kashiwara-Schapira
In [KS18b] Kashiwara and Schapira have defined a (pseudo)distance on the derived category of sheaves. This distance is a sheaf version (derived by design) of the interleaving distance of persistence modules. It is based on convolution of sheaves which we now explain.
Let be an euclidean vector space, which in our case of interest will simply be . We let be the addition map .
Definition 3.1** ([KS18b]).**
The convolution of sheaves is the bifunctor given, for , by the formula :
[TABLE]
where is the external tensor product of sheaves.
To define the convolution distance, we will only need a very specific case : convolution by the constant sheaf supported on a ball centered at 0. More precisely we define, for ,
[TABLE]
The convolution by has some nice properties :
Proposition 3.2** ([KS18b]).**
Let and .
There are functorial isomorphisms and . 2. 2.
If , there is a canonical morphism of sheaves in inducing a natural transformation . In the special case where , we simply write for this natural transformation.
Convolution by is the sheaf analogue of the canonical shift of a persistence module. Indeed, by Proposition 3.2.(1), for any map we get canonical maps
[TABLE]
These maps allow us to define interleaving.
Definition 3.3**.**
For and , one says that and are -interleaved if there exists two morphisms in , and such that the compositions and are the natural morphisms and , that is, we have a commutative diagram in :
[TABLE]
In this case, we write . 2. 2.
or , we define their convolution distance as :
[TABLE]
The convolution distance has the following properties
Proposition 3.4** ([KS18b] and [BG]).**
The convolution distance is a closed extended pseudo-metric on that is, for :
- (a)
, 2. (b)
, 3. (c)
if moreover and are constructible (see definition below), one has . 2. 2.
(Stability Theorem) If is a locally compact topological space, and are continuous functions, then for any one has :
[TABLE]
and the same is true for and .
3.2 Graded barcodes and derived isometry theorem
There is a notion of barcodes for constructible sheaves that mimicks the persistence case. This allows to define a derived bottleneck distance following [BG].
Definition 3.5**.**
A sheaf , is said to be constructible if there exists a locally finite stratification of , such that for each stratum is locally closed in , the restriction is locally constant and furthermore, the stalks are of finite dimension for every .
We write respectively and for the category of constructible sheaves on and the full (triangulated) subcategory of consisting of complexes of sheaves whose cohomology objects lies in .
Note that the notion of constructibility is precisely what is usually called -constructibility. Since no other notion will show up in this work we simply drop the .
Remark 3.6**.**
The condition on the stalks is the sheaf analogue of the condition of being pointwise finite dimensional for persistence modules.
There is a decomposition similar to persistence for constructible sheaves. Namely we have the following two results.
Theorem 3.7** (Decomposition - [KS18b] Theorem 1.17.).**
Let , then there exists a locally finite family of intervals such that . Moreover, this decomposition is unique up to isomorphism.
Corollary 3.8** (Structure).**
Let .
Then there exists an isomorphism in :
[TABLE]
where is seen as a complex of sheaves concentrated in degree [math]. 2. 2.
For each , there is a unique multiset of intervals such that .
This corollary allows us to define the graded barcode of an object of following [BG] which is the derived enhancement of the usual barcode of 1d-persistence modules.
Definition 3.9**.**
The graded-barcode of is the sequence of multisets .
We write , and for the sub-multisets of consisting respectively of the closed or bounded open intervals, semi-open intervals which are open on the right, semi-open intervals which are open on the right (and not equal to ).
The interval appearing in the respective subsets will be called respectiveley of central type, left type and right type.
By the corollary 3.8, the graded-bracode uniquely determines the complex of sheaves up to isomorphisms in and furthermore we have a unique decomposition
[TABLE]
into sheaves whose cohomology only have supports in intervals of central type, left type and right type respectively. This is called the CLR decomposition in [BG].
Lemma 3.10** ([BG]).**
Let . If , then and are -interleaved if and only if , and . In particular, bars of a given type can only be interleaved with bars of the same type.
One can characterize the geometric condition for two sheaves and on intervals of same types to be -interleaved in terms of their endpoints. We will need the following result.
Proposition 3.11** (Proposition 3.8 in [BG]).**
Let , and in . Then :
,
,
.
In order to define the bottleneck distance, we first define the notion of -matching.
Definition 3.12**.**
Let and be two graded-barcodes and . An -matching between and is the data of
partial matchings: , for all satisfying that
for any matched pair , (resp. , ), one has (resp. ) and
for the and which are not matched, one has . 2. 2.
a bijection satisfying, for any , that and
that if and are both open or both closed,
and if is open and is closed, if is closed and is open.
Remark 3.13**.**
An -matching can match bars of different degrees, but only if one of them is compact and the other one is open and differs in degree by . In all other situations one can only match bars of same degrees. See [BG].
Definition 3.14**.**
Let and be two graded-barcodes, then one defines their bottleneck distance to be the possibly infinite positive value:
[TABLE]
The graded bottleneck distance is isometric to the convolution.
Theorem 3.15** (Isometry [BG]).**
Let be two objects of . Then
[TABLE]
3.3 Extending level-set persistence modules as pre-sheaves over
In this section we interpret level-set persistence modules as (pre)sheaves on the line . Let be the poset of open subsets of ordered by the inclusion. We denote in the same way the associated category.
Lemma 3.16**.**
Set to be given on objects by .Then is a well defined fully faithfull functor. The esential image of is precisely the full subcategory of bounded open intervals of .
In particular, restricting to objects of those categories, is a bijection from to bounded open intervals of .
Proof.****.
By definition
[TABLE]
hence is well defined, injective on objects with image the bounded open intervals. Furthermore, if then which proves that is order presearving (and necessarily fully faithfull since the morphisms are empty or a singleton).
Given we can consider its pointwise dual which has a canonical structure of a persistence comodule, that is of an object of
[TABLE]
We denote by this dual of . More precisely, is the composition of functors
[TABLE]
Since is a persistence comodule, for any open , we have a module
[TABLE]
Lemma 3.17**.**
There is a functor extending the formula (12) into a canonical presheaf on , that is such that for , one has
[TABLE]
Proof.****.
One notice that the formula exhibits as a Kan extension which makes it into a presheaf canonically. Indeed, consider the (opposite of the) functor defined previously (see 3.16) and let be the right Kan extension along of , which is therefore by definition an object of :
[TABLE]
As is complete, the pointwise formula (12) is an immediate consequence.
Remark 3.18**.**
A corollary of the proof is that the restriction morphism of are given, for , by the canonical restrictions for any and the induced (by the universal property) map on the limits.
Composing with the (opposite of the) sheafification functor gives the functor from persistence modules on to sheaves on .
Definition 3.19**.**
We set to be the sheafification of the presheaf and we write for the induced functor . We call the level-set persistence to sheaves functor.
Similarly there is a functor going in the other direction defined as follows. Given a sheaf on , by restriction to open intervals and using the identification of lemma 3.16, we get a persistence comodule. Since pointwise duality transforms a persistence comodule into a persistence module we obtain the functor
[TABLE]
where is the composition (we recall that the image of is precisely the open subintervals). We call (abusively) this functor the restriction-to-intervals functor.
We will also write the endofunctor of sheaves which to a sheaf associate its pointwise bidual . There is a canonical natural transformation
[TABLE]
given by the pointwise canonical morphism.
Proposition 3.20**.**
The level-set persistence to sheaves functor from Definition 3.19 satisfies the following properties.
Its composition with the restriction-to-intervals functors is the canonical biduality functor: .
In particular the restriction of this composition of functors to the subcategory of pointwise finite dimensional555where we mean the sheaves whose stalk at each point are finite dimensional objects is naturally isomorphic to 2. 2.
It is the right adjoint of the functor :
[TABLE]
and the map (14) is the counit of this adjunction. 3. 3.
If is a pointwise finite dimensional persistent module, and , then 4. 4.
Assume that is pointwise finite dimensional. Then, for all , we have natural isomorphisms
[TABLE]
provided that the left hand side is finite dimensional. 5. 5.
One can identify with the image of pre-sheaves morphism : .
Proof.****.
First, once the formula is proved, to check that the asserted restriction of the composite is canonically isomorphic to the identity, it is sufficient to prove that the canonical transformation is an isomorphism on all stalks when restricted to a pointwise finite dimensional sheaf. This reduces the statement to the standard case of finite dimensional vector spaces. To prove the formula note that the value of a sheaf is a on an open is uniquely determined by its value on any open cover; furthermore, for any open interval one has that
[TABLE]
In particular, on can restrict to cover by open intervals of and compute the value of the sheaf at as a limit. Therefore, noticing that the intersection of two intervvals is an interval, we get that for a sheaf , one has
[TABLE] 2. 2.
Since the sheafification functor is a right adjoint and by universal property of Kan extensions we have natural isomorphisms:
[TABLE]
Here for a persistent comodule and a persistent module , we denote the coequalizer
[TABLE]
where the upper and lower maps are induced by the (co)persistence structures.
This proves the adjunction formula. The fact that the counit is given by (14) is a direct consequence of the proof of property (1). 3. 3.
The functors , sheafification (which is a right adjoint) as well as right Kan extensions commute with finite direct sums. This gives the finite sums case. But the assumption ensures it is enough to estblish the resutls on the stalks and therefore the canonical map is an isomorphism. 4. 4.
Write for the (full) subcategory of consisting of intervals containing . Let us fix defined by . Then is a functor and is initial among functors . Therefore :
[TABLE]
Since is a totally ordered set, we can apply the theorem of decomposition of pfd modules over totally ordered sets to , thus there exists a multiset of intervals of such that :
[TABLE]
It follows that
[TABLE]
Now if is finite dimensional then the above product in the right hand side of (16) is a finite product and thus a direct sum: Therefore we have
[TABLE] 5. 5.
This is a general fact for sheaves on a -topological space, that is for sheaves on a space for which all points are closed.
Remark 3.21**.**
We have sticked in this paper to the traditionnal point of view of looking at level-set as being given by homology functors and thus as persistent objects; point of view for which computational models are well developped. This is the reason why some (bi)duality shows up in the picture. It is possible (and actually slightly easier) to construct an analogue of going from persistence comodules to sheaves.
Let , and be the projection onto the second coordinate. Recall that for any block (Definition 2.5) we have defined (see 2.10) a persistence module .
Proposition 3.22**.**
Let be a block. Let be such that , with the convention that and when .
If is of type dquad, then . 2. 2.
If is of type bquad, then . 3. 3.
If is of type vquad, then . 4. 4.
If is of type hquad, then .
Proof.****.
Let be of type dquad. If is included in , then is identically null as well as and there is nothing to prove. If not, has a non-trivial intersection with and are the coordinates of the supremum of for the order relation of . Then, for , one has
[TABLE]
Hence is non-zero if and always null if either or . It follows that that for , then if and for all , there exists such that . We conclude that
[TABLE]
By claim 5 of Proposition 3.20, we deduce that . Similarly, if is a vertical block, delimited by the lines , with , then we have
[TABLE]
independently of whether the boundary lines are part of or not. In particular, for any , there exists such that while there exists such that if or . As in the dquad case (17), we thus find that
[TABLE]
The last two other cases are obtained using a similar analysis.
Remark 3.23**.**
In particular, does not depend on whether contains its boundary or not. If is of type , then (since ).
Remark 3.24** (characterizations of ).**
If is of type , then the numbers and are characterized by the fact that the point is the infimum of the points in , see figure (1).
Similarly, if is of type dquad, then the numbers and satisfies that the point is the supremum of the points in .
Finally, for of type vquad, and satisfies that has boundary given by the lines of equation and , while if it is of type hquad, and satisfies that the boundary of are the horizontal lines of equations and .
Blocks of type db+, hb, vb and bb- are actually uniquely determined by their intersection with the anti-diagonal, that is the interval (as in Proposition 3.22). Precisely we have:
Lemma 3.25**.**
Let be real numbers. There are unique blocks , , and respectively of type , hb, vb and such that .
Proof.****.
By definition 2.5, all the blocks except the birth blocks lying entirely in , that is those of type , are uniquely determined by their intersection with the anti-diagonal (also see figure 1). In fact the points determine the block of any of these types as in remark 3.24 and more precisely it determines the boundary lines of the block. To determine if the lines are included in the block or not, we look to whether or are inside the interval . For instance, for we take the vertical block delimited by the vertical lines and and containing them, while is the block vertical delimited by the same lines but not containing any of them.
Corollary 3.26**.**
If is middle-exact and pointwise finite dimensional, then is weakly constructible. Furthermore, if is strongly pointwise finite dimensional (definition 4.1) and midddle-exact, then is constructible.
In particular, the restriction of the sheafification functor to the full subcategory of pfd modules takes values in the subcategory of constructible sheaves.
Proof.****.
By the decomposition Theorem 2.13, the pfd module is isomorphic to a direct sum of blocks . Since commutes with direct sum for pfd modules (Proposition 3.20), Proposition 3.22 yields that is a (pointwise finite when is strongly pfd) direct sum of sheaves of the form where is an interval.
The level-set persistence to sheaves functor does not preserve interleavings in general. However, the trouble is only related to the death or quadrant. More precisely we have the following two lemmas.
Lemma 3.27**.**
Let be middle exact pointwise finite dimensional and such that their barcodes contains only blocks of type , vb and hb. Then
[TABLE]
Furthermore, if , then
[TABLE]
Proof.****.
By Theorem 2.13, we have isomorphisms , of persistence modules, such that the blocks are of types , vb and hb. Lemma 2.12 implies that
[TABLE]
where each is of the form where is an interval which is
- —
a closed non-empty interval if is of type ;
- —
a semi-open interval closed on the left (resp. closed on the right) if is of type hb (resp. vb).
Therefore we have:
[TABLE]
Using Proposition 3.11, we thus get that in all cases,
[TABLE]
and by additivity of the convolution functor we obtain as claimed.
The same results holds for the blocks so that
[TABLE]
Note further that, for a block , the canonical map (of proposition 3.2) is identified with the canonical sheaf map as follows from the proof of [BG, Lemma 3.9]. Since the sheaf map is induced by restriction we obtain from the above equivalences, that the diagram
[TABLE]
is commutative. Using [BG, Proposition 3.10], the above identification extends to the vb and hb blocks case as well: that is we have, for any block of type , vb and hb a commutative diagram
[TABLE]
Now let and be an -interleaving between and , then applying the functor to the latter isomorphisms, we obtain an -interleaving in sheaves given by and .
For deathblocks or birthblocks of type , the sheafification functor does not intertwine shifts with convolution in a naive way. However we have the following precise result. To state it, we first recall that to a block , we can associate the two real numbers such that ; the convention being that and when .
Lemma 3.28**.**
Let be a block of type db or . If is a block, its dual death block intersects and we denote .
Furthermore, for any , we have that,
[TABLE]
Proof.****.
The proof will be similar to the one of lemma 3.27. First note that, if is of birthtype , the supremum of is the infimum of by definition of the dual block. Therefore, by remark 3.24, we have that the infimum of the elements of is the point . It follows that remains of type as long as and it becomes of type when . Furthermore, in that latter case, we have that
[TABLE]
By lemma 2.12 and proposition 3.22, we thus have that if is of type , then
[TABLE]
Using Proposition 3.11, we see that for , one has
[TABLE]
which shows the formula (24).
Now, note that if is of type dquad, then has a non-empty intersection with as long as . And similarly we find, using proposition 3.22 that
[TABLE]
To prove formula (21), we are left to apply Proposition 3.11 a last time.
Remark 3.29**.**
The proof of lemma 3.28 and proposition 3.22 also shows that the last equivalence in lemma 3.28 also reads, for , as
[TABLE]
4 Almost isometric equivalence between and
In this section, we explain why the interleaving distance between level set persistence is essentially the same as the derived bottleneck distance between the associated sheaves (in the constructible case).
In order to express this we will relate constructible sheaves by an isometry to a specific type of graded persistence modules, that is those satisfying the following definition.
Definition 4.1**.**
A middle-exact persistence module , is said to be strongly pointwise finite dimensional, if it is pointwise finite dimensional and satisfies the following additional condition :
[TABLE]
A Mayer-Vietoris system is said to be strongly pointwise finite dimensional if each is strongly pointwise finite dimensional and only finitely many ’s are non-zero.
The full subcategory of MV() whose objects are strongly pointwise finite dimensional MV-systems is denoted by .
Our goal now is to build two functors :
[TABLE]
Satisfying for every , , in other words is a pointwise section, and that, for every ,
[TABLE]
This goal will be achieved by Corollary 4.18 and Corollary 4.20.
4.1 Construction of the sheafification of MV-systems: the functor
We will now apply section 3.3 to compare the Mayer-Vietoris persistence systems and constructible sheaves. To do so, we first consider the direct sum of the level set persistence to sheaves functor:
Let be the localization functor sending the category of complexes of sheaves over to its derived category .
Definition 4.2**.**
The sheafification of MV-systems functor: is the functor given, on objects , by
[TABLE]
and, on morphisms , by
[TABLE]
That this is a functor is a direct consequence of section 3.3.
Lemma 4.3**.**
If is a strongly pointwise finite dimensional Mayer-Vietoris system, then is a constructible sheaf. In particular, we have a commutative diagram of functors:
[TABLE]
Proof.****.
We can apply Theorem 2.19 together with proposition 3.22 in a way similar to the proof of corollary 3.26.
The same argument shows that if is pfd (but not necessarily strongly), then is weakly constructible.
Proposition 4.4**.**
The sheafification of MV-systems functor satisfies the following properties :
it commutes with degree shifting operator : for all Mayer-Vietoris system , one has . 2. 2.
For a block of type bb-, hb, vb, db+**, and , we have :
[TABLE]
where, still denoting , is the interval given by
[TABLE] 3. 3.
If , then . 4. 4.
If is isomorphic to (in the derived category), then .
Proof.****.
Note that assertion 1 is immediate from the definition since we put each precisely in degree .
2 and 3. First assume is of type bb-, hb or vb. Then definition 2.16 implies that . Since commutes with direct sum and shifts, Lemma 3.27 implies and further, for , this isomorphism sends the canonical structure maps onto the canonical map (see diagram (18)).
It remains to prove the same result in the case of a block of type db. Then definition 2.16 says that as a graded persistent module, one has
[TABLE]
and therefore
[TABLE]
Denote as before Proposition 3.22. Following the notation of Lemma 3.28 we thus have that for the dual block of type bb+**, one has that , by definition. Then, Lemma 3.28, the commutation of convolution wih shifts and Proposition 3.22 imply that
[TABLE]
This formula (26) is precisely the formula for according to Proposition 3.11. We obtain a commutative diagram similar to (18) in the same way as in Lemma 3.27. This concludes the proof of claim 2. Assertion 3 follows immediately of assertion 2 and the fact that the canonical translation maps of persistent modules are sent to the canonical maps .
- Assume . By Theorem 2.19, we can decompose
[TABLE]
into Mayer-Vietoris blocks. Since commutes with direct sum and shifts (by property 1), we have isomorphisms
[TABLE]
For any vertical, horizontal or bb- type block , Proposition 3.22 tells us that where is a non-empty interval (uniquely determined by ). If is of type db+**, then
[TABLE]
according to definition 2.16 and 4.2. Therefore, we have an isomomorphism
[TABLE]
of constructible sheaves. Here , are the subsets of those bars that are of type db+** in the respective decompositions of and .
By unicity of the decomposition in Theorem 3.7, we obtain degreewise bijections between the set of associated graded barcodes and and therefore bijections with the property that for any , is a block of the same type as and which is equal to except maybe on the boundary.
Lemma 4.5**.**
Let be sets of M-V blocks of types db, vb, db and bb-. If there is a bijection such that for any , is equal to except maybe on the boundary, then
[TABLE]
Proof of the lemma.****.
It is enough to check that, if and are two blocks of the same type which differs only on their boundary, then and are -interleaved for any . This property follows from Lemma 2.12 and an immediate application of the definition of the blocks of each type. Then the direct sum of those interleavings relating each to gives a -interleaving in between and for every ; the lemma follows.
The claimed property 3 follows from the lemma since we have proved just above that we can find such a permutation relating , for each degree .
Let be a continuous map. Then we have the derived functors of the direct image: , see [KS90, Ive86] which are the cohomology groups of the derived functor . Note that this is just a special case of derived direct image, defined for any continuous map , which is a functor . In particular, the
[TABLE]
A morphism is mapped by this functor to the linear map and the fact that this defines a functor is an immediate consequence of the composition formula see [KS90, Ive86].
Proposition 4.6**.**
Assume is locally contractible. Then there is an natural isomorphism
[TABLE]
Proof.****.
By example 2.27 and definition 4.2, we have . Now, from definition 3.19, we have that is the sheafification of the presheaf
[TABLE]
since k is a field (and therefore the cohomology of the dual of a chain complex is the dual of the homology) and every open in is a disjoint union of intervals. It is well-known that for and any sheaf , is the sheaf associated to the presheaf (see [Ive86, Proposition 5.11] for instance). Furthermore, when is locally contractible, one has an isomorphism of presheaves
[TABLE]
where the first isomorphism is for the sheaf cohomology with value in a constant sheaf and its restriction to an open subset, and the last isomorphism is the usual identification of sheaf cohomology with value on a constant sheaf with singular cohomology for locally contractible spaces.
4.2 The functor from constructible sheaves to Mayer-Vietoris systems
We now turn to the construction of a section of the sheafification of MV-systems. We have the following intrinsic definition.
Definition 4.7**.**
Given F^{\bullet}\in\text{D}\big{(}\text{Mod}(\textbf{k}_{\mathbb{R}})\big{)} and , we define to be the object of given, for by :
[TABLE]
where is the hypercohomology of complexes of sheaves and is the restriction of to the open .
The degree hypercohomology of the restriction of to an open set is isomorphic to the hypercohomology of on the open (see [KS90] for instance) so that the latter formula can be used in (29).
There is a slightly less homological algebraic involved formula for constructible sheaves, see Lemma 4.8 below. Since those are our case of interest, the reader can take formula (31) as the definition of for the rest of the paper.
That is a persistent module follows from Lemma 3.16. Since hypercohomology and duality are functors, then it is immediate that for all ,
[TABLE]
Note that the hypercohomology (see [TftR88, Gro57] for standard references) of a complex of sheaves on a space is obtained by replacing by a quasi-isomorphic injective complex of sheaves666that is a fibrant resolution in the model category of sheaves (which in the case where is bounded on the left is the same as a quasi-isomorphic chain complex whose terms are injective sheaves) and then taking the cohomology of the section of this complex :
[TABLE]
For constructible sheaves , one can simply compute the hypercohomology by computing the derived sections of the sheaf as follows immediately from the following lemma (since the homology is equal to the sheaf in that case).
Lemma 4.8**.**
Let be in . Then for any , and , one has an isomorphism of persistent modules over :
[TABLE]
where is the -th right derived functor of the functor of sections on and is the graded sheaf given by the homology of the underlying complex of .
Note that since is assumed to be constructible, there are only finitely many pairs such that the right-hand-side vector space is non zero.
Proof.****.
The reader who knows the spectral sequences associated to hypercohomology can immediately deduce the result of the lemma by noticing that the assumption on implies its degeneracy at the -page which is exactly the right hand side of (31).
Alternatively, let be any complex of sheaves on a space . Denote the functor sending an open to the sections of over . Denote its derived functor, which, by definition is given by where is an injective complex of sheaves quasi-isomorphic to . Note also that and that for any sheaf , one has , see [KS90] or another classical textbook.
Then according to definition 4.7 is the persistent object given by the composite functor
[TABLE]
Now we asume . By Theorem 3.8, we have an isomorphism of complexes of sheaves . Therefore we can replace by its homology in (32). Then, we can take to be the direct sum of injective resolutions of each . The lemma follows thanks to the fact that only finitely many and in (31) gives non-zero terms as noted above and therefore the functors in (32) commutes with the (finite) direct sum.
Remark 4.9**.**
The functor is not faithful. Indeed for any , one has an non-split exact sequence of sheaves
[TABLE]
which gives a non zero homomorphism in . However there are no non-zero Mayer-Vietoris systems homomorphism in between and as follows from Proposition 4.14 below since there are non non-zero homomorphims in between M-V systems associated to horizontal blocks in different degrees.
Note also that the isomorphism of lemma 4.8 is not natural in for similar reasons. For instance, the right hand side of (31) maps the non zero morphism (induced by the short exact sequence ) to [math] but does not.
Remark 4.10**.**
The functor is thus essentially defined as the dual of the derived section of and not just as the dual of the homology sheaf of which could have been a more naive approach. The main reason is that the latter will not carry a Mayer-Vietoris structure; in other words, it will forget too much of the structure of the constructible sheaf. However, the derived construction carries such a structure in a natural way as we will now see.
Proposition 4.11**.**
The family carries a natural structure of a Mayer-Vietoris system. In addition, if , then it is strongly pointwise finite dimensional (Definition 4.1).
Proof.****.
We have already seen that is a persistence module over as an immediate consequence of lemma 3.16. For and , we have to build the connection morphism . Let an injective resolution of in the category of sheaves. Consider , then we have the Mayer-Vietoris sequence associated to the cover of which is the short exact sequence of complexes of sheaves
[TABLE]
Let us write for the -th cohomology groups . Passing to cohomology, we thus obtain a long exact sequence (see [KS90])
[TABLE]
Since by definition of sheaf cohomology, one has, , the linear dual of the maps given by the exact sequence (33) yields linear maps for all . The exactness of (33) and Lemma 3.16 also implies that the collection is a Mayer-Vietoris system over .
When is constructible, its cohomology groups are finite dimensional in each degree, and there are only finitely many of them. Therefore is pointwise finite dimensional. Now the proof that is strongly finite dimensional is an argument similar to the proof of property 4 in Proposition 3.20. Alternatively, one can simply use the structure theorem 3.8 and proposition 4.14 below to conlude directly since strongly pointwise finite dimensional modules are stable under locally finite direct sums.
Proposition 4.12**.**
The rule defines functors , fitting in a commutative diagram:
[TABLE]
Furthermore, these functors are additive and commutes with shifts associated to the canonical triangulated structure of the derived category.
Proof.****.
Since the definition of is functorial and the connecting morphism in Mayer-Vietoris long exact sequences is also functorial, we obtain that is indeed a functor. Proposition 4.11 gives the fact that sends the subcategory of constructible sheaves to the one of strongly pointwise finite dimensional systems. The last assertion follows from the fact that hyperchohomology commutes with direct sums and shifts.
Example 4.13**.**
Let be constructible (derived) sheaf over . Then by Proposition 4.4 and Lemma 4.8 we obtain, for any , the simple formula
[TABLE]
for (one can also note that the only values of for which we have a non zero term are [math] and from Proposition 3.22).
Recall definition 2.16 of the canonical MV-systems associated to blocks as well as Lemma 3.25. The following is the analogue of proposition 3.22, that is, it describes the action of on the building blocks of a constructible sheaf. Together with example 4.13, it allows to compute the value of explicitly.
Proposition 4.14**.**
Let be an interval in .
If is open, then . 2. 2.
If , then . 3. 3.
If , then . 4. 4.
If is compact, then .
Here all the isomorphisms are isomorphisms of Mayer-Vietoris systems and the blocks are given by lemma 3.25.
Remark 4.15**.**
Note that when applying on an interval, the closed boundary becomes an open boundary lines in the associated block of the image and the open ones become closed.
As will be made clear by the proof, the claim 1 relies heavily on the fact that we have taken a derived functor approach for the definiton of .
Proof.****.
Let us first prove the open interval case. In view of the proof of proposition 4.11, using compatibility with shifts and direct sums, we only need to compute the cohomology groups of which by definition (see [KS90]) is isomorphic to . By Proposition 3.13 and 3.14 in [BG], we have that it is always [math] for . Furthermore, the only case for which it is non-zero for is when is an open whose closure is included in . In that latter case (which means, if , that i.e. and ) we then have . Therefore, by functoriality of the functor in its left variable, it follows that the persistence module associated to in is either [math] if is not open or, if is open, is precisely the block module in degree which is supported on the type bb+ block whose infimum is and contains none of its boundary lines. Here, by block module we refer to Definition 2.10. Therefore, by definition of duality 2.8, for an open , the contribution of in is precisely in degree 1 supported on the type block dual to the deathblock .
It remains to compute the image of the . By Proposition 3.13 and 3.1 in [BG], we find that if is open,
[TABLE]
For , the condition can be rewritten as and . Using functoriality of again, we thus find that, when is open, the persistence module associated to is the block module concentrated in degree [math] and supported on the type db block . Combining the degree [math] and part, the functoriality of the the Mayer-Vietoris long exact sequence (33) then shows that is precisely the MV-block module as in Definition 2.5.
Now for the three other types of intervals, the computation is easier since we only have to consider in the computation of (all other degrees are [math] by the computations of [BG]). Arguing as for the open interval case, using Proposition 3.13 and 3.1 in [BG], we obtain that the persistence modules are respectively the block modules , and when is of the type , or .
Proposition 4.16**.**
Let . For any , there is an isomorphism of graded persistence modules .
Proof.****.
Using theorem 3.7, we have that . By compatibility of convolution with direct sums and shifts, it is thus enough to prove the result for for an interval .
Let us start with the case where is compact. Then by Proposition 3.11, we obtain
[TABLE]
where the last isomorphism is given by Proposition 4.14. Note that, by definition, the block is of type bb-** (see Lemma 3.25 and definition 2.16). Therefore as a persistent module over , we have . By lemma 2.12 and remark 3.24 we find that
[TABLE]
Combining the last two isomorphisms with (34), we find that
[TABLE]
using again Proposition 4.14 for the last isomorphism. Similarly, in the case where is half-open, we obtain, for any and ,
[TABLE]
[TABLE]
It remains to cover the case of an open interval . Again by Proposition 3.11, we have
[TABLE]
where the last isomorphism is given by proposition 4.14. Note that by definition the block is of type dquad+ (see Lemma 3.25 and definition 2.16). Therefore as a persistent module over , we have, for , that
[TABLE]
where the dual block is of type bb+**. By Lemma 2.12 and Remark 3.24 we find that
[TABLE]
Combining these last two isomorphisms with (38), we find that, for ,
[TABLE]
as claimed.
It remains to consider the case . We have still . As a graded persistent module over , by Lemma 2.12, we have that
[TABLE]
But since , we have that the death block \big{(}B_{d}^{\langle a,b\rangle}-\vec{\varepsilon}\big{)} is concentrated below the anti-diagonal , that is in and therefore \textbf{k}^{\big{(}B_{d}^{\langle a,b\rangle}-\vec{\varepsilon}\big{)}}\cong 0. Similarly, the birth block module \big{(}(B_{d}^{\langle a,b\rangle})^{\dagger}-\vec{\varepsilon}\big{)} is of type bb-** precisely for . The infimum of the points included in this birth block has coordinates . Therefore,
[TABLE]
Taking the (shifted) direct sum of this last two isomorphisms thus obtain, that, for , we have
[TABLE]
and therefore the claim follows from the last case of (38).
Remark 4.17**.**
Note that this kind of results has been proven with different assumptions in section 5 of [BP19].
4.3 The isometry theorem between the interleaving distance on and the graded bottleneck distance for sheaves
In this section, we will state and prove our main isometry theorem. Before that, we derive a few corollaries of the results we have obtained in sections 4.2 and 4.1.
Let be the endofunctor given by the cohohomology sheaf, that is, for any complex of sheaves , by
[TABLE]
Corollary 4.18**.**
Consider (the restrictions) and . For any , one has an isomorphism
[TABLE]
Further, there is an natural equivalence of functors .
In other words, is an natural section of the functor on strongly pointwise finite dimensional modules.
Proof.****.
Let us prove the first claim. Since both functors and commutes with shifts and direct sums (propositions 4.4 and 4.12), in view of the structure theorem 3.7, it is enough to construct the isomorphism for sheaves of the form . Now Proposition 4.4.2 (for ) and Proposition 4.14 we have
[TABLE]
which is precisely giving such a claimed isomorphism for an interval.
Let us prove the natural equivalence; we will denote by the linear dual as before. By definition of , if , one has,
[TABLE]
By definition 3.19 and lemma 3.17, denoting the sheafification functor, we have, for any open set ,
[TABLE]
Recal that by definition and therefore the restriction homomorphisms yields the canonical morphism
[TABLE]
where the left map is the canonical homorphism for a vector space to its bidual. Since the cohohomology of a a complex of sheaf is the sheafification of the presheaf , combining (41), (42) and (43) we obtain a morphism of sheaves:
[TABLE]
where the first isomorphism is given by the quasi-isomorphism . To see that this map is an isomorphism, it is enough to check it for the stalks, and therefore, since that map commutes with finite direct sum and shifts (a finite direct sum of injective resolutions is an injective resolution), it is enough to prove that this map is an isomorphism when . The latter follows from (40).
Corollary 4.19**.**
The functor is essentially surjective.
Proof.****.
For any constructible sheaf , is a strongly pointwise finite dimensional Mayer-Vietoris system and Corollary 4.18 gives a natural isomorphism . Therefore, is in the essential image of .
Corollary 4.20**.**
Let be a strongly pointwise finite dimensional Mayer-Vietoris system. Then
[TABLE]
In other words, though is not an equivalence, it maps an object to an object which is at distance [math] fom itself.
Proof.****.
By statement 3 of Proposition 4.4, it is sufficient to prove that and are isomorphic in . But Corollary 4.18 implies and the result follows.
We can now state our isometry theorem
Theorem 4.21** (Isometry).**
The Mayer-Vietoris sheafification functor and the functor are pseudo-isometries between the interleaving distance and the convolution and bottleneck distances for sheaves. That is, for all , one has equalities
[TABLE]
And for all constructible sheaves , one has
[TABLE]
Proof.****.
Theorem 3.15 implies already the equality between bottleneck and convolution distances.
By Proposition 4.4, the Mayer-Vietoris sheafification functor maps the shift functor onto the convolution functor and therefore if are -interleaved, then in . Thus, for all , one has
[TABLE]
Similarly, Proposition 4.16 implies that sends the convolution functor to the shift functor and thus, we also have that, for all , one has
[TABLE]
From (45) and (46) we get, for all , that
[TABLE]
The triangular inequality and Corollary 4.20 implies
[TABLE]
Combining inequality (48) with (47), we ontain that all inequalities in (47) are egalites which gives the first claim
[TABLE]
To prove the remaining one, we use Corollary 4.18. This gives us, for any isomorphisms and and therefore we have
[TABLE]
since we just proved that is an isometry. The equality (49) concludes the proof of the theorem.
In particular the theorem allows to compute the bottleneck or convolution distance for sheaves using interleaving distance for persistence modules and vice-versa. Furthermore, we recover as a corollary the following result of [KS18b].
Corollary 4.22**.**
If is a locally contractible compact topological manifold, and are continuous constructible functions, one has :
[TABLE]
Proof.****.
Theorem 4.21 and proposition 4.6 imply that
[TABLE]
by Proposition 2.30.
4.4 A detailled example
The following example was suggested to us by Justin Curry.
Let be the circle embedded in . Let be the first coordinate projection and be the constant map with value zero.
From example 2.27 we obtain two Mayer-Vietoris systems and , which are given, for any , by and .
Using the same notation as in Lemma 3.25 we have.
Proposition 4.23**.**
One has
[TABLE]
In particular, and . Furthermore, and .
Proof.****.
The preimage of satisfies
[TABLE]
This gives that has the module decomposition given in figure (4) which is exactly the decomposition of into a bb-** module with infimum in degree [math] and a module associated to the deathblock with supremum . The image of is given by adidtivity and Proposition 4.14:
[TABLE]
Applying Corollary 4.18 (or using Proposition 4.4 directly) yields . Similarly, we have that
[TABLE]
and thus as can be seen in figure (4) as well. We apply again Proposition 4.14 and Corollary 4.18 to conclude.
In particular we recover the computation of [BG] for the derived images sheaves and :
[TABLE]
Furthermore, we can find -interleaving between and as well as -inteleaving between and . Therefore, the decomposition of the proposition gives a -inteleaving for and .
Acknowledgments
The authors wish to thank Benedikt Fluhr for his very useful comments, notably the non-naturality of the isomorphism of Lemma 4.8, and for providing the counter-example of Remark 4.9.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BCB 18] Magnus Bakke Botnan and William Crawley-Boevey. Decomposition of persistence modules. available at https://arxiv.org/abs/1811.08946 , 2018.
- 2[BG] Nicolas Berkouk and Grégory Ginot. A derived isometry theorem for constructible sheaves on ℝ ℝ \mathbb{R} . available at https://arxiv.org/abs/1805.09694 .
- 3[BL 17] Magnus Bakke Botnan and Michael Lesnick. Algebraic stability of zigzag persistence modules. ar Xiv preprint ar Xiv:1604.00655, 2017.
- 4[BP 19] Nicolas Berkouk and François Petit. Ephemeral persistence modules and distance comparison. available at aar Xiv:1902.09933 , 2019.
- 5[Cd SKM 19] Gunnar Carlsson, Vin de Silva, Sara Kališnik, and Dmitriy Morozov. Parametrized homology via zigzag persistence. Algebraic & Geometric Topology , 19(2):657–700, 2019.
- 6[Cd SM 09] Gunnar Carlsson, Vin de Silva, and Dmitriy Morozov. Zigzag persistent homology and real-valued functions. In Proceedings of the Twenty-fifth Annual Symposium on Computational Geometry , SCG ’09, pages 247–256, New York, NY, USA, 2009. ACM.
- 7[CO 17] Jérémy Cochoy and Steve Oudot. Decomposition of exact pfd persistence bimodules. available at ar Xiv:1605.09726 , 2017.
- 8[Cur 14] Justin Curry. Sheaves, Cosheaves and Applications . Ph D thesis, 2014.
