The space of sections of a smooth function
Abstract.
Given a compact manifold with boundary and a submersion whose restriction to the boundary of has isolated critical points with distinct critical values and where is or , the connected components of the space of sections of are computed from and of the fibers of . This computation is then leveraged to provide new results on a smoothed version of the evasion path problem for mobile sensor networks: From the time-varying homology of the covered region and the time-varying cup-product on cohomology of the boundary, a necessary and sufficient condition for existence of an evasion path and a lower bound on the number of homotopy classes of evasion paths are computed. No connectivity assumptions are required.
1. Introduction
Given a smooth map of compact manifolds, we are interested in the homotopy type of the space of continuous sections
of . In the case that is a fiber bundle, there is a well-known obstruction theory for constructing sections of by moving up the skeleta of a CW-decomposition of . If in addition is contractible, then is homotopy equivalent to the fiber of . The situation when is not a fiber bundle has received much less attention in the literature. It has interesting behavior even when is contractible.
For and , we establish a complete computation (Theorem 1.1) of for a class of smooth maps that is generic on the boundary . We call these tame functions (Definition 2.2). The computation uses and of the fibers of . Roughly, a tame function on a smooth compact with boundary is a submersion whose restriction has isolated critical points with distinct critical values. In Remark 1.3, we propose various extensions of this result, e.g. a computation of of the components of , higher dimensional , and other interesting possibilities.
We apply Theorem 1.1 to a smoothed version of the evasion path problem for mobile sensor networks §4. A mobile sensor network is a collection of sensors moving continuously in a bounded domain such that each sensor can detect objects within a fixed radius. The evasion path problem asks for the identification of intruders that follow a continuous path in the domain that is at all times disjoint from the region covered by the sensors. Intruders should be identified from only topological (e.g., no coordinates) information about the mobile sensor network. This problem has been studied in [6] [1] [7] (see §4.1).
We introduce a smoothed version of the evasion path problem in §4.2 which effectively approximates the mobile sensor network version. In Corollary 4.2, we obtain a complete computation of the connected components of the space of evasion paths in terms of the time-varying and of the uncovered region . In Theorem 1.4, we establish a necessary and sufficient condition for existence of an evasion path and moreover a lower bound on the number of connected components in terms of time-varying (co)homological information about the covered region and its boundary. The cup product plays a crucial role. Note that Theorem 1.4 does not require the time-varying covered region to be connected, unlike all prior necessary and sufficient conditions for existence of an evasion path. In the connected case, Theorem 1.4 has the simpler form Corollary 1.5.
The precise situation in Theorem 1.1 is as follows. Refer to Figure 1 for examples. Let be a smooth compact cobordism between manifolds with boundary and (Definition 2.1). Let be a tame function (Defintion 2.2), i.e. a smooth submersion with for such that the restriction to the boundary (not including and ) has isolated critical points with distinct critical values. (There is a similar story for where is a manifold with boundary). Note that is submersive if, for example, is a codimension- embedding and is the projection onto , as is the case in the smoothed evasion path problem. A next step in this research is to allow to have critical points in the interior of , making the conditions -generic.
To state the theorem, choose regular values that interleave the critical values of :
Set and There is a diagram of spaces where all maps are inclusions of regular level sets into the regular cobordisms between them
(1) |
Since each contains exactly critical point of on the boundary, we can construct a gradient-like vector field whose flow deformation retracts onto either or depending on whether the outward pointing normal vector at the boundary critical point in satisfies or (by submersivity of , we have ). We keep track of this information via the assignment
(2) |
for . The inclusion is a homotopy equivalance. After applying to the diagram (1), one of the induced maps going into is a bijection, so we obtain a diagram where the arrows point either left or right,
Theorem 1.1.
-
(i)
There is a surjection
with fiber over characterized as follows. Let such that . Then is naturally in bijection with the orbits of an action of the group on the set .
-
(ii)
Let be a smooth compact manifold with boundary equipped with a submersion whose restriction to the boundary has isolated critical points with distinct critical values. Define the diagram as in (1) with the additional identity map , and similarly define . Then the statements in (i) hold.
Remark 1.2.
In , is an embedded solid pair of pants and the sections of the projection have two connected components , represented by the green and blue sections.
In , is an embedded solid cylinder and there are no sections, .
In (c), is a cobordism between a single annulus and two annuli. There are infinitely many connected components of the sections . Indeed, the three sections pictured are not fiberwise homotopic, and one can modify the orange section to wrap around the bottom arm of the wavy region any integral number of times, producing a countable collection of non-fiberwise homotopic sections.
Remark 1.3.
We propose the following extensions of these results to a general theory of sections of -generic smooth maps .
-
(i)
There is a generalization of Theorem 1.1 to a computation of for any basepoint and . These higher can be addressed with a fiberwise version of the unstable Adams spectral sequence of Bousfield-Kan. This is currently being pursued by Wyatt Mackey.
-
(ii)
What happens when we allow to have critical points in the interior of ? Answering this will complete the story for -generic (isolated critical points with distinct critical values).
-
(iii)
Is there a sheaf theoretic interpretation of these results? The regular level sets in the theorem are homotopy equivalent to preimages of small open neighborhoods, so the diagram in (1) comes from an open covering of and inclusions of intersections of those open sets. This suggests replacing with the co-presheaf on .
-
(iv)
Generalize Theorem 1.1 to higher dimensions . We expect that the -actions will generalize to -actions.
The Evasion Path Problem: We apply Theorem 1.1 to obtain new results on the evasion path problem in applied topology: Theorem 1.4 and Corollary 1.5. The evasion path problem is summarized as follows; see §4 for a detailed description. Given a collection of continuous sensors moving in a bounded domain that detect objects within some fixed radius of in , an evasion path is a continuous intruder that avoids detection by the sensors for the whole time interval . Let denote the region covered by the sensors at time , and set
Then evasion paths are sections of the function
Let denote the space of evasion paths.
The sensor ball evasion path problem asks for a criterion that determines whether or not an evasion path exists and that is based only on homological information about the covered region . In practice, one imagines that we can understand the topology of since it is the region covered by the sensors. For example, if sensors can detect overlaps of their sensed regions, then Čech cohomology of can be computed. Versions of this problem have been studied in [6] [1] [7]; see 4.1.
We consider an idealized version of the evasion path problem; see §4.2. Roughly, we smooth into a smooth cobordism of manifolds with boundary embedded in that closely approximates the region covered by the sensors and whose projection is tame.
Let denote the boundary of , except for the interior of the fibers over and . Note that both and have associated diagrams and defined in the same way as in (1).
The precise statement of Theorem 1.4 is given in Theorem 4.5. In Example 4.9, Theorem 1.4 is applied to example (a) from Figure 1. See Remark 4.10 for the cases.
Theorem 1.4.
Assume . There is a surjection . In particular, an evasion path exists (i.e. is nonempty) if and only if is nonempty, and the cardinality of is bounded from below by the cardinality of the inverse limit.
Assume that the projection does not have any local minima or local maxima except over , which holds if sensors are not created or destroyed in time. Then the zigzag diagram of -algebras is determined up to isomorphism by the zigzag diagram of -algebras , the map defined in (2), and an Alexander duality isomorphism of of the regular fibers of with of their complements as well as maps on induced fiberwise by inclusion .
Corollary 1.5.
Assume that is connected for all . Then there is a surjection . In particular, an evasion path exists (i.e. is nonempty) if and only if is nonempty, and the cardinality of is bounded from below by the cardinality of the inverse limit.
Remark 1.6.
The following heuristic suggests that in applications to sensor networks it is enough to compute to understand all evasion paths that an intruder is likely to take. The fibers of the surjection are described by of the regular fibers of the map , as in Theorem 1.1. An intruder is randomly sampling from the space of paths, and so is unlikely to wrap around nontrivial loops in the regular fibers.
Funding. This material is based upon work supported by the National Science Foundation under Award No. 1903023.
2. Tame functions on cobordisms of manifolds with boundary
Definition 2.1.
A compact cobordism of manifolds with boundary is a compact -dimensional manifold with boundary and corners111For , the -stratum of a -dimensional manifold with boundary and corners consists of those points around which there is a smooth chart to that identifies with a point in . For a cobordism of manifolds with boundary, the highest nonempty stratum is . The -stratum is the union of the interiors of and , which together with the -stratum forms the full boundary . The -stratum is the interior of . whose boundary decomposes as a union
where and each is an embedded -dimensional manifold with boundary and such that the following properties hold:
-
•
The intersection is empty. We say that is a cobordism between and ,
-
•
-
•
is a cobordism between the closed manifolds and i.e.,
The following notion of a tame function, as well as the constructions we perform with them in this section, is inspired by the Morse theory on manifolds with boundary; see [2][3][4][8][9][10][11][12] and Remark 2.3.
Definition 2.2.
A tame function on a compact cobordism of manifolds with boundary is a smooth function satisfying the following conditions:
-
•
The critical points of the restriction are isolated and have distinct critical values in ,
-
•
is submersive,
-
•
and .
Remark 2.3.
Definition 2.2 does not require any nondegeneracy condition on the critical points of , so does not have to be a Morse function in the sense of [12, Def. 2.3]. In this way, our definition is more general than the Morse condition. On the other hand, we do not allow itself to have critical points. Note that for the projection from a codimension- submanifold , as is the situation in the smoothed evasion path problem (see §4), the map is submersive.
There are two types of critical points of a tame function on the boundary.
Definition 2.4.
Let be a tame function, a critical point of , and an outward pointing vector. Then is type N if and type D if
Note that is impossible since it would imply that is a critical point of .
2.1. Local constructions
The following constructions are local in the sense that for a tame function and ], the constructions apply in the preimage for small enough.
To construct sections of a tame function that pass a critical value, we make use of the flow lines of the gradient-like vector field on constructed in the following.
Proposition 2.5.
Let be a tame function.
If has only type D critical points, then there exists a smooth vector field on with the following properties:
-
(i)
on all of .
-
(ii)
For all222For , the vector field constructed in the proof of Proposition 2.5 is outward pointing on , and on it is outward pointing with respect to and inward pointing with respect to . , the vector is inward pointing.
If has only type N critical points, then there exists a smooth vector field on with the following properties:
-
(i)
on all of .
-
(ii)
For all , the vector is inward pointing.
Moreover, given any smooth section of (i.e. ) such that for all , the vector field can be chosen such that
Proof.
We consider the case of type D critical points; the type N case is symmetric.
It suffices to construct locally in an open neighborhood of every point and then sum up these local vector fields with a partition of unity. For the local construction, let and for now assume that if then is a regular point of . Then by the implicit function theorem there exists an open neighborhood of and a smooth chart such that where is an open subset of one of the following spaces depending on where sits on , and in such a way that
is the projection onto the first coordinate:
-
•
If , then ,
-
•
If , then ,
-
•
If , then ,
-
•
If , then ,
-
•
If , then ,
-
•
If , then .
In all cases above, the constant vector field
on pulls back through the diffeomorphism to a vector field on satisfying , and moreover it is inward pointing along all points , as required.
It remains to consider a critical point of type . By definition of tame function, is in . Consider a neighborhood of and a coordinate chart that sends to . Then the constant vector field pulls back to a vector field on that is inward pointing, and hence since is type D. Then in a smaller open neighborhood . Hence the vector field satisfies (i) and (ii) on , as required.
Consider now the final statement of the proposition where we are given a smooth section that is disjoint from . For for all , choose the neighborhood to be disjoint from the image of and perform the construction as above. Suppose for some . Choose to be disjoint from . Define for all such that . Then . Extend over so that on . ∎
Using the flow of , we now construct a deformation retraction of onto either or that move the values of at constant speed along . In particular, fibers get mapped to fibers at all times throughout the deformation retraction. This deformation retraction is a workhorse that is used throughout.
Lemma 2.6.
Let be a tame function.
If all critical points of are type , then deformation retracts onto . Moreover, there is a deformation retraction
that moves the fibers of along at constant speed until they reach and stop; precisely, satisfies
and
for all . Moreover, given any smooth section of (i.e. ) disjoint from , the deformation retraction can be chosen so that
for all and .
Symmetrically, if all critical points of are type , then there is a deformation retraction of onto satisfying
and
for all . Moreover, given any smooth section of disjoint from , the deformation retraction can be chosen so that
for all and .
Proof.
Assume that all critical points of are type D; the type N case is symmetric. Let be a vector field on having the properties guaranteed by Proposition 2.5.
We claim that, for , the flow of exists for all . Indeed, let be the flow line of starting at
We have everywhere in the domain of and hence
Since is inward pointing along the boundary of except on , it follows that the flow line can be extended to larger as long as , and if then the flow lines stops. Since if and only if , it follows that . That is, is defined on the interval . And, indeed, the flow is given by
The deformation retraction is defined using the flow of ,
Indeed, is a deformation retraction of onto that satisfies the claimed properties.
Given a smooth section of , we choose the vector to satisfy , as is made possible by Proposition 2.5. The flow of is everywhere tangent to . Since also , it follows that . Hence, for and , we have , as claimed. ∎
We also make use of the classical statement that, near a regular value of , is diffeomorphic to the fiber times an interval. The precise statement in our setting is the following.
Lemma 2.7.
Let be a tame function (in particular a submersion) such that its restriction also is a submersion. Then, for every , is ‘fiberwise diffeormorphic’ to the trivial cobordism . Precisely, this means that there exists a diffeomorphism
such that
where is projection. Moreover, the restriction is the identity on .
Proof.
The proof is standard. In summary, construct a gradient-like vector field such that and is tangent to the boundary , outward pointing along , and inward pointing along (using the same method as the proof of Proposition 2.5, or see the proof of [9, Lem. 3.1]). Then build the diffeomorphism from the flow of similarly to Lemma 2.6 (see also the classical reference [12, Thm. 3.4]). ∎
2.2. Zigzag discretization
Let be a tame function. Denote the critical values of by
and choose interleaving values
Consider the subspaces of given by the preimages
Since the are regular values of and , the are manifolds with boundary and is a cobordism between and .
These cobordisms and the inclusions of their boundaries fit together into a zigzag diagram of manifolds
Each for contains exactly critical point of . Suppose this critical point is type . It follows from Lemma 2.6 that the inclusion is an inclusion of a deformation retract. Let be a deformation retraction onto with the properties provided by the lemma. Then we have
There is a composite map
If the critical point in is instead type N, then in the same way a map is obtained. When we do not wish to specify the type of the critical point, we write this map with arrows pointing both ways
Remark 2.8.
The double arrow indicates a map either to the right or to the left, not both ways.
To disambiguate when desired, we define the following mappings which record which side of it deformation retracts onto, and hence determines the direction of . Precisely, for , define
and also for notational convenience define the opposite mapping
Then, for both type D and type N critical points, the double arrow denoting points in the direction
(3) |
The diagram is then the top ‘zigzag’ of the larger diagram
It is often more convenient to work with the bottom row, which we denote by
(4) |
The diagram is equivalent to ‘up to homotopy,’ in the sense that only homotopy equivalences have been removed.
3. The space of sections of a tame function
Let be a compact cobordism of manifolds with boundary (Definition 2.1) and a tame function (Definition 2.2).
Definition 3.1.
A section of is a continuous map satisfying , i.e., for all . The space of sections of is the space of continuous sections
with the compact-open topology.
We are interested in computing the connected components in terms of the homotopy groups of pre-images of open sets . In practice, we perform constructions with regular fibers and their inclusions into cobordisms between them. The formalism we use is the zigzag discretization described in §2.2, which is equivalent to working with preimages of open sets by Lemma 2.7.
The main results of this section are the computation of in Theorem 3.14 and a similar Theorem 3.15 when is a compact manifold with boundary and is submersive with isolated critical points on the boundary with distinct critical values. The proof is the series of arguments in §3.2. It relies on the section splicing and collapse constructions developed in §3.1.
3.1. Section splicing and collapse
We establish several constructions on homotopy classes of sections and their properties.
Consider a section of and a path satisfying . The idea is to splice into in a trivial cobordism near . Precisely, choose small enough so that the interval does not contain any critical values. Then, by Lemma 2.7, there is a fiberwise diffeomorphism
that restricts to the identity Here fiberwise means that
on , where is the projection. There is also a projection .
Definition 3.2.
Given a section of and a path satisfying , the left boundary -splicing
is the section of defined by
For a path satisfying , there is a right boundary -splicing defined by gluing into a regular cobordism near using the symmetric formula.
Given a regular value and a path satisfying , the interior -splicing of the path into at is the section of given by
where
is the reverse path, is viewed as a section of , and similarly for .
The left boundary -splicing is a section of with endpoints
Similarly, the right boundary splicing has endpoints
Lemma 3.3.
Consider a section of and the constant paths and . Then the splicings and are fiberwise homotopic to .
Proof.
A fiberwise homotopy from to is given by
∎
As a first application of splicings, we use them in the proof of the following lemma to modify a section to have specific behavior near the endpoints.
Lemma 3.4.
Let be a tame function. Assume that either all critical points of are type D, or all critical points are type N. Let and such that and are in the same connected component of . Then there exists a continuous section of such that and .
Proof.
Assume that all critical points of are type D; the argument for type N critical points is symmetric.
Let be the deformation retraction from Lemma 2.6 satisfying
Define the section
of . It satisfies and .
We now modify near using a left boundary splicing to obtain a section that also satisfies . Indeed, since is in the same component of as for all , which is in the same component of as by hypothesis, it follows that is in the same component of as . Taking a path in from to and deformation retracting it with into produces a path such that and . Then the left boundary -splicing (Definition 3.2)
for any sufficiently small is a section of satisfying and , as required. ∎
Splicings are also useful for converting fiberwise homotopies of sections with free endpoints to fiberwise homotopies with fixed endpoints.
Lemma 3.5.
Let be a tame function with sections . Suppose there is a fiberwise homotopy from to , meaning that , , and for all . Consider the paths . Then there is a fiberwise homotopy from to that is endpoint preserving, i.e. for all .
Proof.
For , consider the paths Let be the constant paths at the endpoints of . Then is a fiberwise homotopy from to and is endpoint preserving. Finally, the section is fiberwise homotopic to by Lemma 3.3, and the homotopy preserves endpoints. ∎
The next lemma shows that boundary splicing and interior splicing do not affect the fiberwise homotopy class of a section with no endpoint constraints.
Lemma 3.6.
Let be a tame function with a section , paths such that and , and a path for some regular value of such that . Then the left boundary splicing , the right boundary splicing , and the interior splicing are all fiberwise homotopic with free endpoints to . That is, all of these sections are in the same path component of as .
Proof.
Since the endpoints are allowed to move on during the homotopy, we can ‘unwind’ the path spliced onto the left or the right in a trivial cobordism near . The interior splicing inserts the graph of the path next to the graph of in a trivial cobordism near . The concatenation of these paths in is a loop based at and is contractible relative the basepoint. The graph of this contraction provides a fiberwise homotopy from the interior splicing to . ∎
We now introduce some notation. Given points and , define the space of sections with fixed endpoints
Given a space and points , the path space with fixed endpoints is denoted
The based loop space of at is denoted
The fiberwise homotopy class of a left boundary splicing relative its endpoints does not depend on the homotopy class of relative its endpoints , the fiberwise homotopy class of relative its endpoints , or . In particular, for any and , left boundary -splicing descends to a well-defined map
In the case the path space is equal to the based loop space and moreover . The map
is a left group action of on the set
Similarly, given and , right boundary -splicing descends to a well-defined map
In the case , the map
is a right group action of on the set
We now define various versions of a collapse map and establish their properties. Let be a tame function with only type critical points or, symmetrically, with only type critical points. For the rest of this section, the symbol means if type and if type , and symmetrically for the symbol .
Fix a basepoint section . Let be a deformation retraction along and onto , as provided by Lemma 2.6. Then define the cobordism collapse map
(5) |
The map is a left inverse of the inclusion . Since for all by Lemma 2.6, we have
and so is a map of pairs
This map induces the section collapse map on components
(6) | ||||
We prove in Lemma 3.8 that is a bijection. There is a similarly defined loop collapse map
Section collapse and section splicing are related as follows.
Lemma 3.7.
Let be a tame function with only type critical points and . Let be an associated collapse map along .
Consider a section . Then, in , we have
Moreover, consider loops and . Then, in with group operation denoted , it holds that
In particular,
and
The symmetric statement holds if has only type critical points.
Proof.
To prove we must show that for small there is a fiberwise homotopy from to the section . The section is given by flowing to the left until it lies in a trivial cobordism near with its right endpoint lying on and then attaching this onto the left of . The homotopy is constructed using this flow. We now write this out in precise formulas.
For simplification of the formulas, assume without loss of generality that and . By definition, we have
and
The claimed homotopy is then given by
for . Note that the in the denominator in the case is not a continuity issue because we have
and hence the limit as is equal to zero. This completes the proof of the claim .
The next claim is seen as follows. The left side is obtained by flowing to the left until it lies in . The result of this is the loop , followed by the section pushed into , which is exactly , followed by the loop pushed from into via the flow, which is . Appending one path after another is the composition in on the right hand side of the claimed formula. ∎
An important consequence of Lemma 3.7 is that the section collapse map is bijective.
Lemma 3.8.
Let be a tame function with only type critical points or only type critical points, and let . Then the section collapse map defined in (6) is bijective.
3.2. Connected components
The connected components of the space of sections of a tame function can be computed from and of the regular fibers of and maps between them coming from the regular cobordisms between them. This is the main theorem (Theorem 3.14) proved in this section. There is a similar statement for maps given in Theorem 3.15.
Recall the diagram of regular fibers of from (4). Applying produces a diagram of sets
A central object in this analysis is the inverse limit . Recall that an element is a collection
such that, for all , it holds that where is the map on induced by the map defined in (3).
The connected components of the space of sections are related to the inverse limit via the map
Note that is the set of fiber-preserving homotopy classes of sections of .
The map is surjective, as we prove in Proposition 3.9. The idea of the proof is as follows. We must lift a given through to a section of . For each cobordism of manifolds with boundary and , Lemma 3.4 provides a lift over the interval . These lifts agree at the regular values , hence they fit together to form the desired lift of .
Proposition 3.9.
The map is surjective.
Proof.
Let given by . To prove the lemma, we must lift through to a continuous section satisfying
(7) |
for all .
For each , choose a lift of , i.e. a point
For each , the restriction
is a tame function on the compact cobordism between the manifolds with boundary and . We claim that the hypotheses of Lemma 3.4 hold, providing a continuous section
such that
Indeed, since contains exactly critical value of by the choice of interleaving regular values , the function has exactly critical point on the boundary. Moreover, and are contained in the same connected component of since .
The endpoints of the sections agree, i.e., for all . Hence they fit together to form a continuous section of which satisfies (7). Hence and the proof is complete. ∎
To calculate , it remains to characterize the fibers of the surjection .
Let . Choose a fixed ‘basepoint’ section such that
which means that
As an intermediate object in our analysis, we consider the subspace of sections that agree with at regular values ; precisely, we define
This space splits as the Cartesian product of the spaces of sections of the restrictions with endpoints agreeing with , i.e.
Notice that, for every , we have . It follows that the inclusion induces a map
Proposition 3.10.
The map is surjective.
Proof.
Let such that . This means that for all . Since also for all , there is a continuous path from to . The idea is to splice into on the left of and to splice into on the right of , producing a new section , i.e. for all . Moreover, in the space of sections with no point restrictions, this spliced section is in the same path component as , i.e. is fiberwise homotopic to by Lemma 3.6. Then and the proof is complete.
We precisely construct the spliced section and verify the claimed properties. Restricting to subintervals produces a section of the tame function for . Form the sections
for some small enough. Then for all it holds that and . In particular, , and hence the fit together to form a section of . Moreover, since for all .
It remains to show that is fiberwise homotopic to with no point restrictions. Observe that is formed by starting with , performing a left boundary splicing with , then performing an interior splicing with for all , and finally performing a right boundary splicing with . Hence the claim follows from repeated application of Lemma 3.6. ∎
Consider the direct product group . There is a group action on the set , denoted by and defined in (8),
The orbits of this action are exactly the fibers of , as we prove in Proposition 3.11. Hence, due to Proposition 3.10 above, is naturally in bijection with the set of orbits.
We proceed to define the claimed group action and establish its properties. The action of on a class is defined by representing by its restrictions for and taking the spliced homotopy class
(8) |
Proposition 3.11.
The orbits of the group action are the fibers of . Precisely, this means that is an orbit of if and only if for some .
In particular, induces a bijection between the set of orbits of and .
Proof.
Let . It must be shown that is fiberwise homotopic to if and only if there exists an element satisfying .
By the definition (8) of the action, for any and we see that a representative section of is a sequence of a left boundary splicing with , followed by interior splicing of at the regular values for all , followed by a right boundary splicing of . Hence by Lemma 3.6 it is fiberwise homotopic to . So, if it is assumed that , it follows that is fiberwise homotopic to . This proves one direction of the if and only if statement.
To prove the other direction, suppose that is fiberwise homotopic to . For each , this fiberwise homotopy restricts to a homotopy from the section to the section . Then, Lemma 3.5 provides loops based at for and a fiberwise homotopy from to that preserves the endpoints at and . Since these homotopies are endpoint preserving, setting they fit together to provide a homotopy from a representative of to within the space . Hence , as required. ∎
In light of Proposition 3.11, to calculate it suffices to understand the group action . The group acting is defined in the regular fibers of – it is a product of fundamental groups of fibers – however the set and the action have not yet been algebraically described in terms of homotopy theoretic information about the fibers. We proceed to do this now. First, we bijectively identify with a product of fundamental groups of fibers (Proposition 3.12), and then we understand the group action in terms of composition of loops in these fundamental groups (Proposition 3.13). The resulting characterization of is summarized in Theorem 3.14.
Every section restricts to a section of for every . Let
be the section collapse map defined in (6). By Lemma 3.8, each is a bijection. This implies the following characterization of in terms of the fundamental groups of the regular fibers of .
Proposition 3.12.
The product of section collapse maps
is bijective.
Proof.
Each map for is bijective by Lemma 3.8. ∎
There is a group action
defined as follows. The collapse maps from (5) induce maps
The action is defined for and by
The actions and are identified by the bijection from Proposition 3.12, as we now prove.
Proposition 3.13.
For and ,
Proof.
Write and . By definition of and , we have
which by Lemma 3.7 is equal to
The above expression is equal to by definition of and . ∎
The result of the above discussion is the following theorem.
Theorem 3.14.
Let be a tame function, the associated diagram (4) of regular fibers, and the space of sections. Then the natural map is surjective.
The fibers of are characterized as follows. Let and such that . Then is naturally in bijection with the orbits of the action of the group on the set .
We now state a similar theorem when the domain of is instead of . The proof is essentially the same.
Theorem 3.15.
Let be a compact manifold with boundary and a smooth function that is submersive and such that its restriction to the boundary has isolated critical points with distinct critical values. Define the diagram as in (4) with the additional identity map . Define the action as above for group elements satisfying . Then the statements in Theorem 3.14 hold.
4. Application: Evasion paths in mobile sensor networks
Given a collection of continuous sensors moving in a bounded domain , an evasion path is a continuous intruder that avoids detection by the sensors for the whole time interval . Suppose each sensor observes a ball of fixed radius in centered at at every , and let be the time-varying union of these sensor balls. Then the intruder avoids detection if is not in for all .
The sensor ball evasion path problem (see §4.1 for details) asks for a criterion that determines whether or not an evasion path exists and that is based on the least amount of sensed information possible; for example, a common assumption is that the sensors only detect other nearby sensors and intruders; in particular, they do not know their coordinates in . We ask to understand the homotopy type of the space of evasion paths. The existence problem simply asks if is empty or not.
We consider an idealized version of the evasion path problem, called the smoothed evasion path problem, where we smooth the time-varying covered region into a smooth cobordism of manifolds with boundary; see §4.2 for the precise description. In our main result (Theorem 4.5), we establish a necessary and sufficient condition for existence of an evasion path based on the time-varying homology of the covered region and the time-varying cup-product on cohomology of its boundary, and moreover we provide a lower bound on the number of connected components of the space of evasion paths . In the preliminary Corollary 4.2, we provide a full computation of in terms of the time-varying and of the uncovered region , following from Theorem 3.14. In the case that is connected for all , Theorem 4.5 has the simpler form Corollary 1.5 that requires only the cup product on of the boundary of .
Our results are the first to compute more about the space than whether or not it is empty.
We recall the sensor ball evasion path problem in detail and describe prior work on evasion problems in §4.1. Then we introduce the smoothed evasion problem in §4.2, and explain our results in §4.3.
4.1. Prior work
We describe the sensor ball evasion path problem in more detail. Then we explain prior results on this problem and a general evasion problem studied in [7].
Fix some sensing radius and say that each sensor can detect objects within the closed ball
at all times . The time- covered region
(9) |
is the union of the sensor balls, and it is homotopy equivalent to the Čech complex of the covering of by the sensor balls. The time- uncovered region is the complement
where is a bounded domain that is homeomorphic to a ball.
Assume that the boundary is covered by a collection of immobile fence sensors , meaning is constant for , and that the union of balls for covers the boundary and is homotopy equivalent to . In particular, this ensures that an intruder can never escape from the domain .
We define the covered region
(10) |
and the uncovered region
Then an evasion path is equivalent to a continuous section of the projection , i.e., .
The sensor ball evasion path problem asks for a criterion for existence of an evasion path.
This problem was first stated and studied in [6] by de Silva and Ghrist in dimension . Provided that the time-varying Čech complex changes only at finitely many times, the authors establish a necessary condition for existence of an evasion path which states that the connecting homomorphism on a relative homology group with respect to the fence of the covered region must vanish.
In [1], Adams and Carlsson consider the same evasion problem in arbitrary dimension , and they establish a necessary condition for the existence of an evasion path based on zigzag persistent homology [5] of the time-varying Čech complex. They also explain how this result is equivalent to a generalization of de Silva and Ghrist’s result to the general case .
In both de Silva-Ghrist and Adams-Carlsson, the necessary condition for existence of an evasion path is determined and easily computable from the overlap information of sensor balls. Essentially, sensors only need to know which other sensors are nearby; they don’t need to know their coordinates in .
Adams-Carlsson also study smarter sensors in the plane that know local distances to nearby sensors and the natural counterclockwise ordering on nearby sensors. For these smarter sensors in , they derive a necessary and sufficient condition for existence of an evasion path as well as an algorithm to compute it, under the assumption that the covered region is connected for all . They show that this connectedness assumption is necessary for their methods.
In [7], Ghrist and Krishnan define positive homology and cohomology for directed spaces over , and they compute it using sheaf-theoretic techniques. They consider a general type of evasion problem where the covered region is a pro-object in a category of smooth compact cobordisms. They derive a criterion on positive cohomology that is necessary and sufficient for existence of an evasion path, under the assumption that is connected.
4.2. The smoothed evasion path problem
In this section we describe the precise version of the evasion path problem considered in this paper and indicate how our setting arises as a limiting case of the sensor ball evasion path problem as the number and density of the sensors becomes large.
Fix a dimension333We assume because the cases are trivial under the conditions of our Theorem 4.5 and would require slightly modified arguments to state as part of the theorem. See Remark 4.10 for the cases. and let be a smoothly embedded closed -dimensional ball. The covered region , where , is any subset with the following properties:
-
•
The time and covered regions, given by
for , are smooth compact codimension- submanifolds with smooth boundary .
-
•
The full covered region is a smooth embedded compact cobordism (Definition 2.1) between and In particular, has boundary
where is a -dimensional manifold with boundary that intersects along its boundary
for .
-
•
The boundary contains as a connected component.
-
•
The critical points of the projection are isolated and have distinct critical values contained in .
Remark 4.1.
Heuristically, when the covered region is given by the union of sensor balls over all times as in (9) and (10), the smoothed evasion path problem arises from a small perturbation of inside that smooths out the time-varying union of sensor balls into a manifold. The projection does not have any critical points since is codimension- in , and generically the projection on the boundary has isolated critical points with distinct critical values.
For generic sensor paths in , the boundaries of the sensors balls will intersect transversely at all but finitely many times . We call the transverse times the regular times, and the non-transverse times are the critical times. Heuristically, these times correspond to the regular values and the critical values, respectfully, of the function in the smoothed evasion path problem.
We define the uncovered region to be the closure of the complement . More precisely, we define the essential boundary
and the uncovered region
Then is a compact cobordism (Definition 2.1) between the time and time uncovered regions for with boundary
Note that is the intersection
Consider the projection and the space of evasion paths
(11) |
i.e., the space of continuous sections of the projection restricted to the uncovered region
Here, is given the compact-open topology, or equivalently the topology of the supremum norm for continuous maps with respect to the standard norm on .
Our main result (Theorem 4.5) establishes a necessary and sufficient condition for existence of an evasion path, and moreover provides a lower bound on the number of connected components . The required information consists of a parameterized homology of the covered region , a parameterized cup-product on the essential boundary , and an Alexander duality isomorphism. See also Corollary 1.5 for the simpler case when is connected for all .
We now briefly discuss how one might approximate the information required in Theorem 4.5 to compute existence of an evasion path in the sensor ball evasion path problem where the covered region is a time-varying union of sensors balls as in (9) and (10).
To compute the time-varying homology of it suffices to have the information of the time-varying Čech complex, or in other words the information of sensor ball overlaps; see [1].
Heuristically, one can use the Niyogi-Smale-Weinberger Theorem [13] to compute the time-varying cup-product on cohomology of the essential boundary under the following additional assumptions:
-
•
Directional sensing: The sensors detect the direction in of nearby sensors, as well as the direction of the wall if it is nearby.
-
•
Dense coverage: The sensors are -densely distributed throughout at all regular values , in the sense of [13].
Indeed, with these assumptions, we can label a sensor at time as an essential boundary sensor if there is a codimension- hypersurface in containing such that all sensors in a small neighborhood of lie on the same side of the hypersurface, and such that the other side of the hypersurface is not the wall . First of all, sensors can detect this information due to the directional sensing hypothesis. Second, due to the dense coverage hypothesis, such a hypersurface exists if and only if the sensor is close to the essential boundary ; indeed, sensors in the interior of see other sensors in all directions, whereas those near see other sensors towards the interior of and they don’t see any sensors on the other side of . This same effect occurs near , yet the sensor is aware that it is an effect of the wall. The Niyogi-Smale-Weinberger Theorem [13] then asserts that the Čech complex of the boundary sensors computes cohomology of at regular times .
4.3. Connected components of the space of evasion paths
In this section we prove the results, Theorem 4.5, Corollary 4.2, and Corollary 1.5, about the smoothed evasion path problem introduced in §4.2.
Denote the critical values of the projection by
and choose interleaving values
We recall the zigzag discretization procedure described in §2.2, which we apply here to various subspaces Consider the projection
and its restriction
from which we obtain subspaces of given by the preimages
These fit together into a zigzag diagram of topological spaces
where all maps are the natural inclusions.
Consider now the zigzag diagram in the case that is the uncovered region. Recall the abbreviated zigzag diagram
defined in (4), which is obtained roughly by inverting homotopy equivalences. Note that
Theorem 3.14 applied to the projection provides the following.
Corollary 4.2.
There is a surjection
In the notation of §3, the fibers of are characterized as follows. Let and such that . Then the fiber is naturally in bijection with the orbits of the action of the group on the set .
Proof.
The space , defined in (11), is the space of continuous sections of the projection . Since is codimension-, the projection is submersive. Since the projection on the boundary has isolated critical points with distinct critical values in by hypothesis, the same is true for its restriction to the essential boundary , and hence is a tame function (Definition 2.2). Hence the result follows from Theorem 3.14. ∎
Remark 4.3.
Corollary 4.2, applied to the examples presented in Figure 1 produces the same full computation of as Theorem 1.1, namely exactly that described in Remark 1.2.
Our main result, Theorem 4.5, provides only lower bounds on the cardinality of and determines if it is empty or not, however it needs as input only (co)homological information about the covered region and the essential boundary . This is important for applications in which the topology of and the boundary can be detected from the sensor information but the topology of may be harder to determine since this is defined as the region where there are no sensors. To improve this to a full computation of , one would need to compute the fiberwise fundamental groups and maps between them used in Corollary 4.2 from homological information. This can be addressed by a fiberwise version of the unstable Adams spectral sequence of Bousfield-Kan, currently under development by Wyatt Mackey.
The goal now is to compute in terms of homological information about the covered region and the boundary . In principle, we have access to this homological information in applications with moving sensors (see the end of §4.2).
Let be a field. In view of Proposition 4.4 below, to compute it suffices to compute the cup product structure on .
Let be the functor that takes a -algebra to the set of -algebra homomorphisms . Then applying to the diagram yields a zigzag diagram of sets.
Proposition 4.4.
There is an isomorphism of zigzag diagrams of sets
or in other words a commutative diagram
with all vertical arrows bijections and where is the set of -algebra morphisms with respect to the cup product on .
Proof.
For any topological space , there is a bijection of sets
Moreover, is a natural isomorphism from the functor to the functor . Both of these are functors from the category of topological spaces to the category of sets. Hence induces the claimed isomorphism of zigzag diagrams. ∎
It remains to compute . The inclusion map induces a map of zigzag diagrams of -algebras . In the simplest situation, when the time- covered region is connected for all , the map is an isomorphism by Proposition 4.7 below. The final result in this case is Corollary 1.5.
In Theorem 4.5 below, we explain how to compute in the case that is not necessarily connected. Let
be the complement of the essential boundary. Recall the notation for the regular level sets , and for . For each , there is a composite map
where is induced by the inclusion444For a manifold with boundary, the inclusion is a homotopy equivalence. and is Alexander duality (see Remark 4.8).
Theorem 4.5.
There is a surjection . In particular, an evasion path exists (i.e. is nonempty) if and only if is nonempty, and the cardinality of is bounded from below by the cardinality of the inverse limit.
Assume that the projection does not have any local maxima or local minima except over . Then the following information determines the zigzag diagram of -algebras up to isomorphism:
-
(i)
The zigzag diagram of -algebras ,
-
(ii)
The images for ,
-
(iii)
The type (N or D) of every boundary critical point of .
Remark 4.6.
The assumption and the given information in Theorem 4.5 are justified when interpreted in the context of a mobile sensor network.
Indeed, a local maximum of can only occur if a sensor disappears. A local minimum can occur only if a new sensor is created. So, the assumption that does not have local minima or maxima at intermediate times means that the result applies to mobile sensor networks in which sensors do not get added or removed during the time interval of interest.
The assumed information in (i)-(iii) is all determined by the boundary and the covered region . Hence, it is reasonable to assume that the sensors, which cover and have boundary , can record this information; see the discussion of the Niyogi-Smale-Weinberger theorem at the end of §4.2 for more detail. In particular, we do not require a priori information about the uncovered region ; indeed, the theorem computes the required cohomological information from the given information in .
Proof of Theorem 4.5.
The claimed surjection
is the composition of the surjection from Corollary 4.2 and the isomorphism from Proposition 4.4. It remains to compute from (i)-(iii) under the assumption that does not have any local maxima or minima at intermediate times .
The inclusion
induces a map of zigzag diagrams of -algebras
Proposition 4.7.
The map is injective. If the time- covered region is connected for all , then is an isomorphism.
Proof.
The claim that is injective means that the restriction maps
induced by the inclusions and are injective for all .
We first consider the restriction maps . By definition, we have the covering and the intersection along their common manifold boundary is . Hence there is a Mayer-Vietoris sequence
Since is homeomorphic to a ball and hence contractible, it follows that the map is an isomorphism. Restricted to , this is exactly the restriction map on reduced cohomology induced by , and it is injective. Hence the induced map on unreduced cohomology, which is , is also injective, as claimed.
Under the additional hypothesis that the time- covered region is connected for all , we have that is connected and so , in which case is an isomorphism, as claimed.
We now return to the general case and analyze the restriction maps . The argument that these are injective is similar. By definition, we have the covering with intersection along the common boundary . Hence there is a Mayer-Vietoris sequence
Hence the map is an isomorphism, which implies that the restriction map is injective, as claimed.
Under the additional hypothesis that the time- covered region is connected for all , it follows from Lemma 2.6 applied to the tame function that the cobordism is homotopy equivalent to either or , hence is connected, for all . Thus and so is an isomorphism, as claimed. This completes the proof of the proposition. ∎
Proposition 4.7 implies that is isomorphic to the image of a zigzag diagram of -algebras, where the zigzag -algebra structure on is induced by the cup-product on . Hence, it suffices to compute
as -vector spaces for all . Indeed, the -algebra structures on these images are induced by the cup products on and , respectively, which are given by assumption .
For each , there is a commutative diagram of -vector spaces
where the top map is the restriction map on cohomology induced by the inclusion , the bottom map is the pushforward on homology induced by the inclusion , and the vertical maps and are Alexander duality isomorphisms (see Remark 4.8). This diagram commutes, and hence
The right hand side is given by assumption .
Remark 4.8.
In the Alexander duality isomorphisms and we have unreduced cohomology instead of reduced cohomology because and are missing the connected subset of and moreover is disjoint from both and .
It remains to compute Consider the following commutative diagram, which is the relevant part of the map induced by the inclusion ,
All vertical maps are injective by Proposition 4.7.
There is a single critical point of the projection , and by assumption we know if is type- or type- with respect to . Assume now that it is type-; the argument in the type- case is symmetric. Since is type- with respect to the projection , it is type- with respect to the projection . Hence deformation retracts onto by Lemma 2.6, which implies that is an isomorphism.
We claim that is injective. Indeed, any nontrivial kernel of implies the existence of a component of the cobordism whose boundary is disjoint from and hence lies entirely in . Hence, since is the only critical point in , it must lie on , since any component of without a critical point is a trivial cobordism. It follows that is a local minimum of . Since is type- with respect to , the normal vector to at pointing into the interior of is pointing positively along and hence is also a local minimum of . This contradicts the assumption that there are no local minima of away from and , proving the claim that is injective.
To complete the proof, recall that in the commutative diagram above all vertical maps are injective, is an isomorphism, and is injective. It follows that . Since we computed above and since the map is part of the given data in assumption , this completes the computation of and the proof of Theorem 4.5. ∎
Example 4.9.
We use the method in Theorem 4.5 to compute in example (a) from Figure 1, providing the lower bound .
The zigzag diagram of spaces is a circle and two circles included as the boundary of the pair of pants . Hence we have the zigzag diagram of -algebras
Since the time- covered region is connected for all , the map is an isomorphism by Proposition 4.7. Hence has cardinality .
Remark 4.10.
Theorem 4.5 is stated and proved in dimensions . Here we explain the cases. For , the only possibility is and the uncovered region is empty so there are no evasion paths In the case, the assumption that the projection does not have any local minima or maxima away from implies that the cardinality of is equal to the number of connected components of the time- uncovered region minus the number of type D boundary critical points of . This is equal to
References
- [1] H. Adams and G. Carlsson, Evasion paths in mobile sensor networks, The International Journal of Robotics Research 34 (2015), no. 1, 90–104.
- [2] J. Bloom, The combinatorics of Morse theory with boundary, Proceedings of the Gökova Geometry-Topology Conference 2012, Int. Press, Somerville, MA, 2013, pp. 43–88.
- [3] M. Borodzik, A. Némethi, and A. Ranicki, Morse theory for manifolds with boundary, Algebr. Geom. Topol. 16 (2016), no. 2, 971–1023.
- [4] D. Braess, Morse-Theorie für berandete Mannigfaltigkeiten, Math. Ann. 208 (1974), 133–148.
- [5] G. Carlsson and V. de Silva, Zigzag persistence, Found. Comput. Math. 10 (2010), no. 4, 367–405.
- [6] V. de Silva and R. Ghrist, Coordinate-free coverage in sensor networks with controlled boundaries via homology, International Journal of Robotics Research 25 (2006), 1205–1222.
- [7] R. Ghrist and S. Krishnan, Positive Alexander duality for pursuit and evasion, SIAM J. Appl. Algebra Geom. 1 (2017), no. 1, 308–327.
- [8] B. Hajduk, Minimal -functions, Fund. Math. 111 (1981), no. 3, 179–200.
- [9] A. Jankowski and R. Rubinsztein, Functions with non-degenerate critical points on manifolds with boundary, Comment. Math. Prace Mat. 16 (1972), 99–112.
- [10] P. Kronheimer and T. Mrowka, Monopoles and three-manifolds, New Mathematical Monographs, vol. 10, Cambridge University Press, Cambridge, 2007.
- [11] F. Laudenbach, A Morse complex on manifolds with boundary, Geom. Dedicata 153 (2011), 47–57.
- [12] J. Milnor, Lectures on the -cobordism theorem, Notes by L. Siebenmann and J. Sondow, Princeton University Press, Princeton, N.J., 1965.
- [13] P. Niyogi, S. Smale, and S. Weinberger, Finding the homology of submanifolds with high confidence from random samples, Discrete Comput. Geom. 39 (2008), no. 1-3, 419–441.