Persistence of the Conley Index in Combinatorial Dynamical Systems
Abstract
A combinatorial framework for dynamical systems provides an avenue for connecting classical dynamics with data-oriented, algorithmic methods. Combinatorial vector fields introduced by Forman [7, 8] and their recent generalization to multivector fields [16] have provided a starting point for building such a connection. In this work, we strengthen this relationship by placing the Conley index in the persistent homology setting. Conley indices are homological features associated with so-called isolated invariant sets, so a change in the Conley index is a response to perturbation in an underlying multivector field. We show how one can use zigzag persistence to summarize changes to the Conley index, and we develop techniques to capture such changes in the presence of noise. We conclude by developing an algorithm to “track” features in a changing multivector field.
1 Introduction
At the end of the 19th century, scientists became aware that the very fruitful theory of differential equations cannot provide a description of the asymptotic behavior of solutions in situations when no analytic formulas for solutions are available. This observation affected Poincaré’s study on the stability of our celestial system [18] and prompted him to use the methods of dynamical systems theory. The fundamental observation of the theory is that solutions limit in invariant sets. Examples of invariant sets include stationary solutions, periodic orbits, connecting orbits, and many more complicated sets such as chaotic invariant sets discovered in the second half of the 20th century [12]. Today, the Conley index [5, 14] is among the most fundamental topological descriptors that are used for analyzing invariant sets. The Conley index is defined for isolated invariant sets which are maximal invariant sets in some neighborhood. It characterizes whether isolated invariant sets are attracting, repelling or saddle-like. It is used to detect stationary points, periodic solutions and connections between them. Moreover, it provides methods to detect and characterize different chaotic invariant sets. In particular, it was used to prove that the system discovered by Lorenz [12] actually contains a chaotic invariant set [13]. The technique of multivalued maps used in this proof may be adapted to dynamical systems known only from finite samples [15]. Unfortunately, unlike the case when an analytic description of the dynamical system is available, the approach proposed in [15] lacks a validation method. This restricts possible applications in today’s data-driven world. In order to use topological persistence as a validation tool, we need an analog of dynamical systems for discrete data. In the case of a dynamical system with continuous time, the idea comes from the fundamental work of R. Forman on discrete Morse theory [8] and combinatorial vector fields [7]. This notion of a combinatorial vector field was recently generalized to that of a combinatorial multivector field [16]. Since then, the Conley index has been constructed in the setting of combinatorial multivector fields [11, 16]. The aim of this research is to incorporate the ideas of topological persistence into the study of the Conley index.
![]() |
![]() |
![]() |
Given a simplicial complex , Forman defined a combinatorial vector field as a partition of into three sets where a bijective map pairs a -simplex with a -simplex . This pair can be thought of as a vector originating in and terminating in . Using these vectors, Forman defined a notion of flow for discrete vector fields called a -path. These paths correspond to the classical notion of integral lines in smooth vector fields. Multivector fields proposed in [16] generalize this concept by allowing a vector to have multiple simplices (dubbed multivectors) and more complicated dynamics.
An extension to the idea of the -path from Forman’s theory is called a solution for a multivector field . A solution in is a possibly infinite sequence of simplices such that is either a face of or in the same multivector as . Solutions may be doubly infinite (or bi-infinite), right infinite, left infinite, or finite. Solutions that are not doubly infinite are partial. Bi-infinite solutions correspond to invariant sets in the combinatorial setting.
In Figure 1, one can see a sequence of multivector fields, each of which contains multiple isolated invariant sets. In principle, one would like to choose an isolated invariant set from each of the multivector fields and obtain a description of how the Conley index of these sets changes. Obtaining such a description is highly nontrivial, and it is the main contribution of this paper. Given a sequence of isolated invariant sets, we use the theory of zigzag persistence [4] to extract such a description. In [6], the authors studied the persistence of the Morse decomposition of multivector fields, but this is the first time that the Conley index has been placed in a persistence framework. We also provide schemes to automatically select isolated invariant sets and to limit the effects of noise on the persistence of the Conley index.
2 Preliminaries
Throughout this paper, we will assume that the reader has a basic understanding of both point set and algebraic topology. In particular, we assume that the reader is well-versed in homology. For more information on these topics, we encourage the reader to consult [10, 17].
2.1 Multivectors and Combinatorial Dynamics
In this subsection, we briefly recall the fundamentals of multivector fields as established in [6, 11, 16]. Let be a finite simplicial complex with face relation , that is, if and only if is a face of . Equivalently, if , where denotes the vertex set of . For a simplex , we let and for a set , we let . We say that is closed if . The reader familiar with the Alexandrov topology [1, Section 1.1] will immediately notice that this notation and terminology is aligned with the topology induced on by the relation .
Definition 1 (Multivector, Multivector Field).
A subset is called a multivector if for all , satisfying , we have that . A multivector field over is a partition of into multivectors.
Every multivector is said to be either regular or critical. To define critical multivectors, we define the mouth of a set as . The multivector is critical if the relative homology in some dimension . Otherwise, is regular. Simplices in critical multivectors are marked with circles in Figures 1, 2, and 3. Throughout this paper, all references to homology are references to simplicial homology. Note that is thus well defined because . Intuitively, a multivector is regular if can be collapsed onto . In Figure 2, the red triangle with its two edges is a critical multivector because is nontrivial. Similarly, the gold colored triangles (denoted ) and the green edge (denoted ) are critical because and are nontrivial, where we use to denote the boundary of a simplex .
A multivector field over induces a notion of dynamics. For , we denote the multivector containing as . If the multivector field is not clear from context, we will use the notation . We now use a multivector field on to define a multivalued map . In particular, we let . Such a multivalued map induces a notion of flow on . In the interest of brevity, for , we set and define , , as expected. A path from to is a map , where , , and for all , we have that . Similarly, a solution to a multivector field over is a map where .
Definition 2 (Essential Solution).
A solution is an essential solution of multivector field on if for each where is regular, there exists an where and .
For a set , let denote the set of essential solutions such that . If the relevant multivector field is not clear from context, we use the notation . We define the invariant part of as . We say that is invariant or an invariant set if . If the multivector field is not clear from context, we use the notation .
Solutions and invariant sets are defined in accordance to their counterparts in the classical setting. For more information on the classical counterparts of these concepts, see [3]. As in the classical setting, we have a notion of isolation for combinatorial invariant sets.
Definition 3 (Isolated Invariant Set, Isolating Neighborhood).
An invariant set , closed, is isolated by if all paths for which satisfy . The closed set is said to be an isolating neighborhood for .
2.2 Conley Indices
The Conley index of an isolated invariant set is a topological invariant used to characterize features of dynamical systems [5, 14]. In both the classical and the combinatorial settings, the Conley index is determined by index pairs.
Definition 4.
Let be an isolated invariant set. The pair of closed sets subject to is an index pair for if all of the following hold:
-
1.
-
2.
-
3.
In addition, an index pair is said to be a saturated index pair if . In Figure 3, the gold, critical triangle is an isolated invariant set. The reader can easily verify that is an index pair for . In fact, this technique is a canonical way of picking an index pair for an isolated invariant set. This is formalized in the following proposition.
Proposition 5.
[11, Proposition 4.3] Let be an isolated invariant set. Then is a saturated index pair for .
However, there are several other natural ways to find index pairs. Figure 3 shows another index pair for the same gold triangle . By letting and , where and are the set of simplices reachable from paths originating in , respectively, we obtain a much larger index pair. In Figure 3, is the set of all colored simplices, while is the set of all colored simplices which are not gold.
In principle, it is important that the Conley index be independent of the choice of index pair. Fortunately, it is also known that the relative homology given by an index pair for an isolated invariant set is independent of the choice of index pair.
Theorem 6.
[11, Theorem 4.15] Let and be index pairs for the isolated invariant set . Then for all .
The Conley Index of an isolated invariant set in dimension is then given by the relative homology group for any index pair of denoted .
3 Conley Index Persistence
We move to establishing the foundations for persistence of the Conley Index. Given a sequence of multivector fields on a simplicial complex , one may want to quantify the changing behavior of the vector fields. One such approach is to compute a sequence of isolated invariant sets under each multivector field, and then to compute an index pair for each isolated invariant set. By Proposition 5, a canonical way to do this is to take the closure and mouth of each isolated invariant set to obtain a sequence of index pairs . A first idea is to take the element-wise intersection of consecutive index pairs, which results in the zigzag filtration:
Taking the relative homology groups of the pairs in the zigzag sequence, we obtain a zigzag persistence module. We can extract a barcode corresponding to a decomposition of this module:
|
However, the chance that this approach works in practice is low. In general, two isolated invariant sets need not overlap, and hence their corresponding index pairs need not intersect. For example, if one were to take the blue periodic solutions in the multivector fields in Figure 1 to be , , , by using Proposition 5 one gets the index pairs , , and (since . Note that in such a case, the intermediate pairs are and . But and intersect only at vertices, so none of the -cycles persist beyond their multivector field. This is problematic in computing the persistence, because intuitively there should be an generator that persists through all three multivector fields. To increase the likelihood that two index pairs intersect, we consider a special type of index pair called an index pair in .
Definition 7.
Let be an invariant set isolated by under . The pair of closed sets satisfying is an index pair for in if all of the following conditions are met:
-
1.
-
2.
-
3.
, and
-
4.
.
As is expected, such index pairs in are index pairs.
Theorem 8.
Let be an index pair in for . The pair is an index pair for in the sense of Definition 4.
Proof.
Note that by condition three of Definition 7, if , then . Condition one of Definition 7 implies that , which is condition two of Definition 4. Likewise, by condition two of Definition 7, if , then . Note that , so it follows that , which is condition one of Definition 4. Finally, condition four of Definition 7 directly implies condition three of Definition 4. ∎
An additional advantage to considering index pairs in is that the intersection of index pairs in is an index pair in . In general, is not an index pair. However, for index pairs in , we get the next two results which involve the notion of a new multivector field obtained by intersection. Given two multivector fields , , we define .
Theorem 9.
Let be index pairs in for under . The set is isolated by under .
Proof.
To contradict, we assume that there exists a path under where and there exists some where . Note that by the the definition of an index pair, . Hence, it follows by an easy induction argument that since , we have that . This directly implies that . In addition, it is easy to see that can be extended to an essential solution in , which we denote , by some simple surgery on essential solutions. This is because there must be essential solutions where and , as and are both in essential solutions. Hence, if , if , and if . Since is an essential solution, we have that , but also that . Therefore, we must have that . But by the same reasoning as before, it follows that . Hence, , a contradiction. ∎
Theorem 10.
Let and be index pairs in under . The tuple is an index pair for in under .
Proof.
We proceed by using the conditions in Definition 7 to show that is an index pair in . Note that , which is immediate by the definition of and considering . Note that since and are index pairs in , we know from Definition 7 that and Therefore . This implies the first condition in Definition 7. This argument also implies the second condition by replacing with .
Now, we aim to show that satisfies condition three in Definition 7. Consider . Without loss of generality, we assume . Therefore, , so by the definition of an index pair in . Hence, since , condition three is satisfied.
Finally, note that is obviously equal to , so condition four holds as well. ∎
Hence, if are index pairs in , these theorems gives a meaningful notion of persistence of Conley index through the decomposition of the following zigzag persistence module:
Because of the previous two theorems, when one decomposes the above zigzag module, one is actually capturing a changing Conley index. This contrasts the case where one only considers index pairs of the form , because need not be an index pair for any invariant set.
As has been established, the pair is an index pair, but it need not be an index pair in . We introduce a canonical approach to transform to an index pair in by using the push forward.
Definition 11.
The push forward of a set in , closed, is the set of all simplices in together with those such that there exists a path where and .
If is not clear from context, we use the notation . The next series of results imply that an index pair in can be obtained by taking the push forward of .
Proposition 12.
If is an isolated invariant set with isolating neighborhood under , then .
Proof.
Note that by definition, and , so it follows that . Hence, it is sufficient to show that . Aiming for a contradiction, assume there exists a where . This directly implies that . But by Proposition 5, , so . But since , there exists a path where and . Because , there exists a such that . This implies that there exists a path where and , but . Hence, is not isolated by , a contradiction. ∎
Proposition 13.
If is an isolated invariant set with isolating neighborhood under , then .
Proof.
Note that since and , it follows immediately that . Hence, it is sufficient to show that . Aiming for a contradiction, we assume there exists a such that . Note that since , it follows that there must exist a path where for all . Else, would be in , a contradiction. Hence, there must exist a such that and . Note that cannot be a face of , else . Hence, , which means one can construct a path where and . But this is a path with endpoints in which is not contained in , which contradicts being isolated by . ∎
Proposition 14.
If is an isolated invariant set with isolating neighborhood , then .
Proof.
Crucially, from these propositions we get the following.
Theorem 15.
If is an isolated invariant set then is an index pair in for .
Proof.
First, we note that since the index pair is saturated, it follows that . But since by Proposition 14 , it follows that , which satisfies condition four of being an index pair in .
We show that . Let , and assume that . There must be a path where and , by the definition of the push forward. Thus, we can construct an analogous path where for and . Hence, by definition. Identical reasoning can be used to show that , so also meets the first two conditions required to be an index pair.
Finally, we show that . By Proposition 14, this is equivalent to showing that . Since is an index pair for , it follows that . Note that since is closed, it follows that . Hence, , and all conditions for an index pair in are met. ∎
An example of an index pair induced by the push forward can be seen in Figure 3. Hence, instead of considering a zigzag filtration given by a sequence of index pairs , , …, , a canonical choice is to instead consider the zigzag filtration given by the the sequence of index pairs
Choosing is highly application specific, so in our implementation we choose . This decision together with the previous theorems gives Algorithm 1 for computing the persistence of the Conley Index.
![]() |
![]() |
![]() |
3.1 Noise-Resilient Index Pairs
The strategy given for producing index pairs in produces saturated index pairs. Equivalently, the cardinality of is minimized. This is problematic in the presence of noise, where if is a slight perturbation of we frequently have that . This gives a perturbation in our generated index pairs and in particular a perturbation in . As the Conley Index is obtained by taking relative homology, taking the intersection of index pairs and where can result in a “breaking” of bars in the barcode. An example can be seen in Figure 5, where because of noise, the two do not overlap, and hence a -dimensional homology class which intuitively should persist throughout the interval does not. In Figure 5, the Conley indices of the invariant sets consisting of the singleton critical triangles in and (the left and right multivector fields) have rank in dimension because the homology group of (which is the entire complex in both cases) relative to (which is all pink simplices) has rank . However, the generators for and are both in the intersection field . Hence, rather than one generator persisting through all three multivector fields, we get two bars that overlap at the intersection field. The difficulty is rooted in the fact that the sets , , and do not have a common intersection.
![]() |
![]() |
![]() |
To address this problem, we propose an algorithm to expand the size of . It is important to note that a balance is needed to ensure a large as well as a large . If and are too small, then it is easy to see that and may not intersect as expected even though consecutive vector fields are very similar. The following proposition is very useful for computing a balanced index pair.
Proposition 16.
Let be an index pair for in under . If is a regular multivector where is closed, then is an index pair for in .
Proof.
Note that since does not change, it is immediate the satisfies , and the first condition of an index pair in is met.
We show that . For a contradiction, we assume that there exists an such that there is a , . Note that if , then by definition is in the closure of . Since is closed and , it follows that . But since , it follows that . But this is a contradiction since by assumption, is closed. Hence, by definition of , since , and must be in the same multivector. Note that in such a case , as if it were, would not be in since and are in the same multivector. This implies that , as and , a contradiction. Thus, we conclude that .
Now, we show that . Assume there exists an satisfying . Then since is an index pair in , it follows that . To contradict, we assume . Hence, . We let . By definition of , either or and are in the same multivector. In the later case, as it was assumed that , a contradiction. Hence, . But this implies that , a contradiction. Ergo, , and .
Finally, we show that . Trivially, , so it is sufficient to show that . For a contradiction, assume that there exists an . Thus, there exists an essential solution where for some , . Since is regular, we assume without loss of generality that . Hence, . In addition, since , we have that . Therefore, . But is a solution in , a contradiction. ∎
![]() |
![]() |
![]() |
Figure 6 illustrates how enlarging by removing regular vectors as Proposition 16 suggests can help mitigate the effects of noise on computing Conley index persistence. Contrast this example with the example in Figure 5. Denoting for and in both figures, we see that is empty in Figure 5 while in Figure 6 it consists of three critical simplices each marked with a circle. Hence, in Figure 6 a single generator persists throughout the interval, unlike in Figure 5.
3.2 Computing a Noise-Resilient Index Pair
We give a method for computing a noise-resilient index pair by using techniques demonstrated in the previous subsection. Note that by Theorem 15, we have that is an index pair for invariant set in . Hence, we adopt the strategy of taking and , and we aim to find some collection so that remains an index pair in . Finding an appropriate is a difficult balancing act: one wants to find an so that is sufficiently large, so as to capture perturbations in the isolated invariant set as described in the previous section, but not so large that is small and perturbations in are not captured. If is chosen to be as large as possible, then a small shift in may results in having a different topology than or leading to a “breaking” of barcodes analogous to the case described in the previous section.
Before we give an algorithm for outputting such an , we first define a -collar.
Definition 17.
We define the -collar of an invariant set recursively:
-
1.
The -collar of is .
-
2.
For , the -collar of is the set of simplices in the -collar of together with those simplices where is a face of some with a face in the -collar of .
For an isolated invariant set , we will let denote the -collar of . Together with Proposition 16, -collars give a natural algorithm for finding an to enlarge .
In particular, we use Algorithm 2 for this purpose.
Theorem 18.
Let be the output of Algorithm 2 applied to index pair in for isolated invariant set . The pair is an index pair for in .
Proof.
To contradict, we assume that the output by Algorithm 2 results in is not an index pair. We note by inspection of the algorithm that multivectors are removed sequentially, so there exists some first such that is an index pair for in but is not an index pair for in , where denotes the variable in Algorithm 2 before is added to it. By inspection of the algorithm, we observe that since was added to , it must be that is a regular vector, and is closed, and . Proposition 16 directly implies that is an index pair, which is a contradicton. Hence, there can exist no such , so it follows that must be an index pair for in . ∎
Hence, Algorithm 2 provides a means by which the user may enlarge . As this algorithm is parameterized, a robust choice of may be application specific. We also include some demonstrations on the effectiveness of using this technique. A real instance of the difficulty can be seen in Figure 7, while the application of Algorithm 2 with to solve the problem is found in Figure 8.
![]() |
![]() |
![]() |
4 Tracking Invariant Sets
In the previous section, we established the persistence of the Conley index of invariant sets in consecutive multivector fields which are isolated by a single isolating neighborhood. In this section, we develop an algorithm to “track” an invariant set over a sequence of isolating neighborhoods. A classic example is a hurricane, where if one were to sample wind velocity at times , there may be no fixed which captures the eye of the hurricane at all without also capturing additional, undesired invariant sets at some .
4.1 Changing the Isolating Neighborhood
Thus far, we have defined a notion of persistence of the Conley Index for some fixed isolating neighborhood and simplicial complex . This setting is very inflexible —one may want to incorporate domain knowledge to change so as to capture changing features of a sequence of sampled dynamics. We now extend the results in Section 3 to a setting where need not be fixed. Throughout this section, we consider multivector fields with corresponding isolated invariant sets . In addition, we assume that there exist isolating neighborhoods where isolates both and . We will also require that if , the invariant set is isolated by . Note that for each where , there exist two index pairs for : one index pair in and another index pair in . In the case of , there is only one index pair for . Likewise, in the case of , there is a single index pair .
By applying the techniques of Section 3, we obtain a sequence of persistence modules:
|
(21) |
In the remainder of this subsection, we develop the theory necessary to combine these modules into a single module. Without any loss of generality, we will combine the first modules into a single module, which will imply a method to combine all of the modules into one.
First, we note that by Theorem 6, we have that . To combine the persistence modules
(24) |
into a single module, it is either necessary to explicitly find a simplicial map which induces an isomorphism , or to construct some other index pair for denoted such that and . This would allow substituting both occurrences of or for , and allow the combining of all the modules in Equation 21 into a single module. Since constructing the isomorphism given by Theorem 6 is fairly complicated, we opt for the second approach. First, we define a special type of index pair that is sufficient for our approach.
Definition 19 (Strong Index Pair).
Let be an index pair for under . The index pair is a strong index pair for if for each , there exists a such that there is a path where and .
Intuitively, a strong index pair for is an index pair for where each simplex is reachable from a path originating in . Strong index pairs have the following useful property.
Theorem 20.
Let denote an invariant set isolated by , , and under . If and are strong index pairs for in , under , then the pair
is a strong index pair for in under .
Proof.
We proceed by showing that the pair meets the requirements to be a strong index pair in . First, note that for all , if , then it follows by the definition of the push forward that . Hence, . Analogous reasoning shows that .
Hence, we proceed to show that . To contradict, assume that there exists a so that there is a where . Since , there must exist a such that there is a path where and . Without loss of generality, we assume that . Note that if , then by our assumption and hence contradicting our assumption that . Hence, . Note that since is an index pair, we have that . Hence, there must be some such that . Hence, , a contradiction. Thus, no such can exist.
Now, we show that . Note that since is isolated by and every is reachable by a path originating at , it follows that , else is not isolated by . Hence, this implies that .
To show that , we first note that if and , then it follows that . This is because if there exists a such that there is a path which satisfies and , there must be some . If there is no such , then this contradicts requirement of Definition 4, which states that . Hence, by the definition of the push forward, it follows that . Thus, it follows that . Thus, every essential solution in is also an essential solution in . It remains to be shown that every essential solution in is also an essential solution in .
For a contradiction, assume that there exists an essential solution such that there exists an where . Note that since , it follows that . Together, these two facts imply that . Hence, it follows that . We claim in particular that for all , . Note that if there exists a such that , then it follows that . Since is an index pair, we have that . Thus, there must exist some where where , but this contradicts that . Hence, no such exists. Analogous reasoning shows that there is no where . It follows that . But this implies that . Note that and are both index pairs for , so it follows that . This contradicts our assumption that . Thus, there is no such . Hence, we have that , which implies that .
To see that is a strong index pair, note that there must exist a path from to every , and since is the set of simplices for which there exists a path from to , it follows easily from path surgery that there exists a path from to . Hence, is a strong index pair for in . ∎
Crucially, this theorem gives a persistence module
(26) |
where the arrows are given by the inclusion. Note that since these are all index pairs for the same , it follows that we have . Hence, we will substitute into the persistence module. By using the modules in Equation 21, we get a new sequnece of persistence modules
|
(32) |
which can immediately be combined into a single persistence module.
This approach is not without it’s disadvantages, however. Namely, if and are index pairs for in and , it requires that and are strong index pairs and that is isolated by . Fortunately, the push forward approach to computing an index pair in gives a strong index pair.
Theorem 21.
Let be an isolated invariant set where is an isolating neighborhood for . The pair is a strong index pair in for .
Proof.
We note that by Theorem 20, the pair is an index pair for in . Hence, it is sufficient to show that the index pair is strong. Note that by definition, for all , there exists a such that is a face of . Hence, . Note that is precisely the set of simplices for which there exists a path originating in and terminating at , so it is immediate that there is a path originating in and terminating at . Hence, the pair is a strong index pair. ∎
Our enlarging scheme given in Algorithm 2 does not affect the strongness of an index pair.
Theorem 22.
Let be the output of applying Algorithm 2 to the strong index pair in for with some parameter . The pair is a strong index pair for in .
Proof.
Theorem 18 gives that is an index pair for in , so it is sufficient to show that such an index pair is strong. Note that does not change, but the strongness of index pairs only requires paths to be in . Since all paths in are also paths in , it follows that is a strong index pair in . ∎
These theorems give us a canonical scheme for choosing invariant sets from a sequence of multivector fields and then computing the barcode of persistence module given in Equation (32). We give our exact scheme in Algorithm 3.
The astute reader will notice an important detail about Algorithm 3. Namely, the find function is parameterized by a nonnegative integer , and the function has not yet been defined. In particular, said function must output a closed such that is isolated by . An obvious choice is to let , but such an approach does not allow one to capture essential solutions that “move” outisde of as the multivector fields change. We give a nontrivial find function in the next subsection that can be used to capture such changes in an essential solution.
4.2 Finding Isolating Neighborhoods
Given an invariant set isolated by with respect to , we now propose a method to find a closed, nontrivial such that isolates . Our method relies heavily on the concept of -collar introduced in Section 3. In fact, we will let such that isolates . Hence, it is sufficient to devise an algorithm to find . Before we give and prove the correctness of the algorithm, we briefly introduce the notion of the push backward of some set in , denoted . We let . Essentially, the push backward of in is the set of simplices for which there exists a path in from to .
We now prove that isolates . Note that since , this also implies that isolates .
Theorem 23.
Let denote an invariant set isolated by under . If is the output of Algorithm 4 on inputs , then the closed set isolates .
Proof.
For a contradiction, assume that there exists a path so that where there is an satisfying with . Note that since isolates , if does not isolate , then there must exist a first such that and . If this were not the case, then would not isolate . Without loss of generality, we assume that for all , we have that . Note that for all , when is removed from the stack , if has not been visited, then is added to the stack. Hence, this implies that if any is visited, then will be added to . If this were not the case, there would exist some such that when was removed from the stack, was not visited and was not added to the stack. This implies that , which contradicts being the first such simplex in the path.
Hence, since is added to the stack, it follows that is added to , which implies that . Note too that must be closed, as if there is a such that , then because is closed, a contradiction. But when is removed from , any of its cofaces which are in are also removed. Hence, is closed, is closed, so their union must be closed. ∎
Hence, we use Algorithm 4 as the find function in our scheme given in Algorithm 3. We give an example of our implementation of Algorithm 3 using the function in Figure 9.
![]() |
![]() |
![]() |
5 Conclusion
In this paper, we focused on computing the persistence of Conley indices of isolated invariant sets. Our preliminary experiments show that the algorithm can effectively compute this persistence in the presence of noise. It will be interesting to derive a stability theory for this persistence. Toward that direction, the stability result for the isolated invariant sets presented in Appendix A seems promising. In designing the tracking algorithm, we have made certain choices about the isolated neighborhoods and the invariant sets. Are there better choices? Which ones work better in practice? A thorough investigation with data sets in practice is perhaps necessary to settle this issue.
References
- [1] J. A. Barmak. Algebraic Topology of Finite Topological Spaces and Applications. Lecture Notes in Mathematics 2032. Springer Verlag, Berlin - Heidelberg - New York, 2011.
- [2] J. A. Barmak, M. Mrozek, and T. Wanner. A Lefschetz fixed point theorem for multivalued maps of finite spaces. Mathematische Zeitschrift, May 2019.
- [3] N. P. Bhatia and G. P. Szegö. Dynamical Systems: Stability Theory and Applications. Lecture Notes in Mathematics 35. Springer Verlag, Berlin - Heidelberg - New York, 1967.
- [4] G. Carlsson and V. de Silva. Zigzag persistence. Foundations of Computational Mathematics, 10(4):367–405, Aug 2010.
- [5] C. Conley. Isolated invariant sets and the Morse index. In CBMS Regional Conference Series 38, American Mathematical Society, 1978.
- [6] T. K. Dey, M. Juda, T. Kapela, J. Kubica, M. Lipinski, and M. Mrozek. Persistent homology of Morse decompositions in combinatorial dynamics. SIAM J. Applied Dynamical Systems, 18(1):510–530, 2019.
- [7] R. Forman. Combinatorial vector fields and dynamical systems. Math. Z., 228:629–681, 1998.
- [8] R. Forman. Morse theory for cell complexes. Adv. Math., 134:90–145, 1998.
- [9] J. Hale and H. Koçak. Dynamics and Bifurcations. Texts in Applied Mathematics 3. Springer-Verlag, 1991.
- [10] A. Hatcher. Algebraic topology. Cambridge University Press, Cambridge, 2002.
- [11] M. Lipiński, J. Kubica, M. Mrozek, and T. Wanner. Conley-Morse-Forman theory for generalized combinatorial multivector fields on finite topological spaces. arXiv:1911.12698 [math.DS], 2019.
- [12] E. N. Lorenz. Deterministic Nonperiodic Flow, pages 25–36. Springer New York, New York, NY, 2004.
- [13] K. Mischaikow and M. Mrozek. Chaos in the Lorenz equations: a computer-assisted proof. Bull. AMS (N.S.), 33:66–72, 1995.
- [14] K. Mischaikow and M. Mrozek. The Conley Index. Handbook of Dynamical Systems II: Towards Applications. (B. Fiedler, ed.) North-Holland, 2002.
- [15] K. Mischaikow, M. Mrozek, J. Reiss, and A. Szymczak. Construction of symbolic dynamics from experimental time series. Phys. Rev. Lett., 82:1144–1147, Feb 1999.
- [16] M. Mrozek. Conley–Morse–Forman theory for combinatorial multivector fields on Lefschetz complexes. Foundations of Computational Mathematics, 17(6):1585–1633, Dec 2017.
- [17] J. Munkres. Topology. Featured Titles for Topology Series. Prentice Hall, Incorporated, 2000.
- [18] H. Poincaré. Sur le probleme des trois corps et les équations de la dynamique. Acta Mathematica, 13:1–270, 1890.
Appendix A Stability of invariant sets
We now establish a result on the stability of invariant sets under perturbations to the underlying multivector field. Note that since multivector fields are discrete, metrics on multivector fields over a given simplicial complex must likewise be discrete. Hence, rather than defining a metric on the space of multivector fields for some simplicial complex , we consider a topology on the space of multivalued maps induced by multivector fields on . To define the topology on this space, we first define a relation on the set of multivector fields. In particular, if and are multivector fields on simplicial complex with the property that for all there exists a where . We say that is inscribed in and is a refinement of . We follow the notation in [6] and denote this relation as .
Unfortunately, there is no clear notion of stability between invariant sets under multivector field refinement. This is because if , there can exist such that is critical while is not, or vice versa. Hence, we consider the notion of a strong refinement. The multivector field is a strong refinement of if is a refinement of and for each regular , we have that . We use the symbol to denote the strong refinement relation. In addition, if , then we write that . This notation is motivated by the fact that the definition of established in Section 2 implies that for all .
We use the relation to define a partial order on the space of dynamics
In particular, if , we write .
Proposition 24.
The relation is a partial order.
Proof.
Note that for every multivector field , so it follows that for all , we have that . Hence, is reflexive. Similarly, if and , then it follows that for there exists a such that . But likewise, there must exist a such that . But a multivector is a partition, and . Hence, , so . Thus, and , so which implies that . Thus, is antisymmetric.
Finally, we show that is transitive. Note that if and , we have that and that . Hence, since are all defined on the same , we have that for , there exists a such that . Similarly, there exists a such that . Hence, is a refinement of , but it is not obvious that this is a strong refinement. Note that is a strong refinement of , so for every , we have that . We aim to show that . Aiming for a contradiction, assume that . In particular, let denote such an invariant set. Note that , where . If the image of were in some , then this contradicts being a strong refinement of . In addition, there cannot exist an such that , as this also contradicts being a strong refinement. There likewise can’t be an so that . Hence, for all , there exists satisfying and . This implies that , a contradiction. ∎
Given a poset , a set is said to be upper if for all where , we have that . Lower sets are defined as is expected. It is well known that upper sets induce a topology.
Definition 25.
The Alexenadrov topology on a poset is the topology on in which all upper sets with respect to are open.
In addition, it is well known that lower sets correspond to closed sets. Alexenandrov topologies have several convenient properties not found in arbitrary topological spaces. Notably, in the Alexandrov topology on , every point in has a minimal neighborhood.
Throughout the remainder of this section, we consider the Alexandrov topology on . In particular, we show that invariant sets are strongly upper semicontinuous with respect to this topology. Since we are only dealing with finite spaces, we use a definition from [2].
Definition 26 (Strongly Upper Semicontinuous).
Let denote a multivalued map from a topological space to some set . The map is strongly upper semicontinuous if for all where , .
Let denote the set of invariant sets induced by multivector fields over in some fixed . As each defines an invariant set, we consider the map which maps each to its invariant part in . We conclude this subsection by showing that is strongly upper semicontinous.
Proposition 27.
Let denote multivalued maps induced by multivector fields on some simplicial complex . For any closed , .
Proof.
For contradiction, assume that there exists a solution where but . This implies that is not essential with respect to , so there must exist some , regular such that or . But this implies that , which contradicts being a strong refinement of . ∎
Corollary 28.
The map is strongly upper semicontinuous.