Inessential directed maps and directed homotopy equivalences
Martin Raussen

TL;DR
This paper investigates inessential symmetries of directed spaces, explores their algebraic and topological properties, and establishes invariance of directed topological complexity and component categories under a new notion of directed homotopy equivalence.
Contribution
It introduces a new concept of directed homotopy equivalence that differs from previous definitions and proves its invariance properties for directed topological complexity and component categories.
Findings
Directed homotopy equivalences satisfy a 2-out-of-3 property.
Directed topological complexity is invariant under the new equivalence.
Directed homotopy equivalences induce isomorphisms on component categories.
Abstract
A directed space is a topological space together with a subspace of \emph{directed} paths on . A symmetry of a directed space should therefore respect both the topology of the underlying space and the topology of the associated spaces of directed paths between a source () and a target () - up to homotopy. If it is, moreover, homotopic to the identity map -- in a directed sense -- such a symmetry will be called an inessential d-map, and the paper explores the algebra and topology of inessential d-maps. Comparing two d-spaces and "up to symmetry" yields the notion of a directed homotopy equivalence between them. Under appropriate conditions, all directed homotopy equivalences are shown to satisfy a 2-out-of-3 property. Our notion of directed homotopy equivalence does not agree completely with the one defined in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Inessential directed maps and directed homotopy equivalences
Martin Raussen
Department of Mathematical Sciences, Aalborg University, Skjernvej 4A, DK-9220 Aalborg Øst, Denmark
[email protected] http://people.math.aau.dk/ raussen/
Abstract.
A directed space is a topological space together with a subspace of directed paths on . A symmetry of a directed space should therefore respect both the topology of the underlying space and the topology of the associated spaces of directed paths between a source () and a target () - up to homotopy. If it is, moreover, homotopic to the identity map – in a directed sense – such a symmetry will be called an inessential d-map, and the paper explores the algebra and topology of inessential d-maps. Comparing two d-spaces and “up to symmetry” yields the notion of a directed homotopy equivalence between them. Under appropriate conditions, all directed homotopy equivalences are shown to satisfy a 2-out-of-3 property. Our notion of directed homotopy equivalence does not agree completely with the one defined in [8] and [9]; the deviation is motivated by examples. Nevertheless, directed topological complexity, introduced in [9] is shown to be invariant under our notion of directed homotopy equivalence. Finally, we show that directed homotopy equivalences result in isomorphisms on the pair component categories of directed spaces introduced in [15].
Key words and phrases:
d-space, inessential d-map, directed homotopy equivalence, 2-out-of-3 property, directed topological complexity
1991 Mathematics Subject Classification:
55P10, 55P60, 55U99, 68Q85
The author thanks the Hausdorff Research Institute for Mathematics in Bonn, Germany, for its hospitality during two visits as part of the programme Applied and Computational Algebraic Topology in 2017 that allowed him to begin thinking about and discussing the topics dealt with in this paper.
He also wishes to thank for a helpful referee report.
1. Introduction
1.1. Motivation
Directed Algebraic Topology arose as an attempt to make methodologies from Algebraic Topology useful in the analysis of concurrency phenomena in theoretical computer science; consult eg [11, 4] for details. It is easy to agree upon the fundamental notions of Directed Algebraic Topology (ie d-space, d-map and d-homotopy, cf Definition 1.1 and 1.8).
But what are the symmetries of such a d-space, and what is a directed homotopy equivalence; when are two d-spaces homotopy equivalent in the directed sense? The first idea (suggested by several authors) is to adapt directly the notion from ordinary topology: A d-map would be a directed homotopy equivalence if there exists a d-map such that and are d-homotopic (cf Definition 1.8) to the respective identity maps. But this definition does not make sure that the most interesting objects in Directed Algebraic Topology, ie the spaces of d-paths in from to resp. of d-paths in from to are related! Have a look at Example 1.10 for a simple such case. This paper suggests both a notion of symmetry of a d-space (an inessential d-map) and the related notion of directed homotopy equivalence between two d-spaces, and it explores their properties, both algebraically and topologically. More detailed requests to directed homotopy equivalences are formulated in Section 1.4.
1.2. Organization of the paper. Results
In Section 2, we define path space preserving d-maps as those keeping the homotopy types of all path spaces between source and target invariant. Maps from a d-space into itself that are path space preserving and d-homotopic to the identity map are called inessential. It is shown that inessential maps (and also a generalization of those, arising from a certain closure process) are closed under composition and, in some cases, under factorization.
Section 3 proposes a new definition of various types of directed homotopy equivalences (and several generalizations). It allows for example to perceive a difference between certain branching spaces and a one point space, in contrast to a similar proposal in [8] and [9]; cf Example 3.3. We investigate closure and factorization properties and show that the most important notion of directed homotopy equivalence satisfies the 2-out-of-3 property (cf Section 1.4 and [12, Definition 1.1.3]) in the category of directed spaces; crucial for every thinkable proposal for a model structure on that category.
In Section 4, we show that directed topological complexity of d-spaces [9] is invariant under a sharp version of directed homotopy equivalence. In the final Section 5, we show that directed homotopy equivalences result in isomorphisms on the pair component categories of [15]. Simple non-trivial examples illustrate the concepts.
1.3. Elementary notions. Previous results
Let denote the unit interval. The following notions are fundamental in Directed Algebraic Topology [11] and in applications in concurrency theory [4]:
1.3.1. d-paths. Traces
Definition 1.1**.**
- (1)
[10] A d-space consists of a topological space together with a subspace that contains the constant paths, is closed under concatenation and under non-decreasing reparametrizations . Elements of are called d-paths. 2. (2)
For , we let denote the subspace of all d-paths from to . We write and call then a reachable pair. 3. (3)
[10] A d-map between d-spaces and is continuous and satsfies . 4. (4)
The category has d-spaces as objects and d-maps as morphisms.
Definition 1.2**.**
- (1)
We let denote the space of reachable pairs. 2. (2)
The end-point map fibres with non-empty fibres .
Remark*.*
Note that, in contrast to path spaces in ordinary topology, these end point maps very rarely are fibrations: the homotopy types of the fibres do most often vary, d-spaces are in general not homogeneous at all!
Example 1.3**.**
Simple but fundamental d-spaces are the non-directed interval with , the neutral interval with consisting of the constant paths, and the directed interval with . In these cases, the spaces of reachable pairs coincide with , with the diagonal , resp. with .
For every d-space , the monoid of surjective reparametrizations acts on by composition; it identifies d-paths under reparametrization equivalence [6]. Equivalence classes are called traces, they are the elements of the quotient trace space . The end-point map (Definition 1.2) factors over . We will use the same notation for the resulting map – with fibres . For categorical constructs, traces are better behaved, because concatenation of traces is associative. On the other hand, it is easier to handle, e.g., homotopies of paths than homotopies of traces.
In applications to concurrency, the d-spaces under consideration are usually directed -sets (=pre-cubical sets), or their geometric realizations:
Definition 1.4**.**
- (1)
A -set (also called a pre-cubical set) is a sequence of disjoint sets , equipped with face maps , satisfying the pre-cubical relations: for .
Elements of are called -cubes, those of are called vertices. 2. (2)
A -set is called non-self-linked if every cube has 2^{i}$${n}\choose{i} different iterated -faces, . 3. (3)
The geometric realization of a pre-cubical set is the d-space
[TABLE]
with and (resp. ) for (resp. ). 4. (4)
A path is directed if there are , cubes and directed paths with for .
We allow ourselves to use the most convenient setting (paths resp. traces) in a given situation because of
Proposition 1.5**.**
[14, Proposition 2.16]** For the geometric realization of a -set , the quotient maps , are homotopy equivalences.
Example 1.6**.**
[17] Let and with the d-structure inherited from the standard product d-structure on , ie . Then the trace space is contractible unless . If these two sets agree, then is homotopy equivalent to with .
In the figure on the right, the trace space from the bottom to the top vertex is homotopy equivalent to ; from a point on a bottom edge to a point on a top edge in the same colour homotopy equivalent to , and contractible (if not empty) otherwise.
The following results show that trace spaces of -sets can be quite complicated:
Proposition 1.7**.**
- (1)
[14, Proposition 3.15]** Path and trace spaces in a non-self-linked -set have the homotopy type of a CW-complex. 2. (2)
[16]** For every finite CW complex , there exists a -set (without directed loops) with vertices such that is homotopy equivalent to .
A d-map induces maps , and . They fit into a commutative diagram (depicted for ):
[TABLE]
with restricted maps on fibres over . Similarly for path spaces.
1.3.2. Directed homotopies
Definition 1.8**.**
- (1)
A d-map is called a d-homotopy from to . is then called future d-homotopic to and is called past d-homotopic to . Notation: or . 2. (2)
Two d-maps maps are called d-homotopic if there exists a zig-zag sequence of d-homotopies. 3. (3)
A d-map is called a neutral d-homotopy between and . The d-maps and are called neutrally d-homotopic. 4. (4)
Two d-maps are called dihomotopic if there exists a neutral d-homotopy with and .
We will be particularly interested in these notions for endo-d-maps from a space into itself that are related to the identity map by a d-homotopy.
Example 1.9**.**
The two relations future and past d-homotopic differ essentially even in simple examples: Consider the d-space with the d-structure inherited from the standard d-structure of and modelling a future branching.
A d-homotopy with preserves the two branches and and thus their intersection point ; in particular, cannot be constant.
On the other hand, the d-homotopy connects the constant map with every d-map . Hence all d-maps from to are dihomotopic to each other.
In greater generality, if is a d-homotopy with for some , then there exists a d-path from to for every .
The following example shows that d-homotopies do not preserve homotopy types of path spaces, and therefore the naive notion of directed homotopy equivalence mentioned in Section 1.1 is not satisfactory:
Example 1.10**.**
Let be the piecewise linear reparametrization with ; there is a convex d-homotopy with and . Hence there is also a convex d-homotopy on with and . Hence and are d-maps that are inverse to each other up to d-homotopy.
Let and and note that and . Then is contractible whereas is homotopy equivalent to (cf Example 1.6). In particular, is not a homotopy equivalence.
{\mathbf{1}}$${\mathbf{x}}$${\mathbf{0}}
1.4. Requests to the notion of direceted homotopy equivalence
We can now formulate reasonable requests that a notion of directed homotopy equivalence should satisfy: A directed homotopy equivalence should
- (1)
have a homotopy inverse such that is homotopic to and is homotopic to – in one of the flavours of directed homotopy from Definition 1.8. 2. (2)
satisfy that all maps are (weak) homotopy equivalences in the classical sense. Moreover, 3. (3)
In the category (objects: d-spaces, morphisms: d-maps; cf fx [4]), the directed homotopy equivalences enjoy the 2-out-of-3 property (cf fx [12, Definition 1.1.3]).
Ir is furthermore desirable to obtain a version of directed homotopy equivalence for which a branching space like from Example 1.9 is not contractible in a directed sense.
I have called item (1) alone in the list above the naive definition of directed homotopy equivalence since it does not take care of path spaces at all. This problem is taken care of in the definition presented in [8] and [9]: it requires (2) in a coherent sense (cf Definition 2.4) but it does not ensure (1) nor (3).
Our definition of directed homotopy equivalence (in Definition 3.1) does not satisfy alle requests on the nose. Item (1) is part of the definition, Lemma 3.2 shows that (2) is satisfied “up to inessential endo-maps” and Proposition 3.6 shows that (3) is satisfied for neutral d-homotopy equivalences. The branching space from Example 1.9 is not future homotopy equivalent to a one point d-space. Note also the more elaborate Example 3.3(2) of a directed graph which is not homotopy equivalent to the one point space in any directed sense according to our definition – although one can easily check that the constant map is a classical homotopy equivalence satisfying (2) above.
2. (Rather) Inessential d-maps
2.1. Path space preserving d-maps and d-homotopies
Ordinary topological spaces give rise to loop spaces that are interesting to study on their own behalf. d-spaces give rise to, and organise, many spaces of (directed) paths, one path or trace space for every pair of points ; cf Definition 1.2(1). For reasonable d-spaces, like the -spaces from Definition 1.4, these path spaces depend only mildly on the pair of points; they are stable within so-called components [17, 15]. If we wish that a d-map not only relates the topology of its domain and target, but also the topology of all assembled path spaces, we need to add the following requirement:
Definition 2.1**.**
- (1)
A d-map is called path space preserving (psp for short) if is a weak homotopy equivalence for all . 2. (2)
A d-homotopy , resp. a neutral d-homotopy , is called psp if every parameter d-map is psp. 3. (3)
Adding psp to the requirements in Definition 1.8 leads to the relations future/past, resp. neutrally psp d-homotopic.
Example 2.2**.**
This example investigates psp maps , cf Example 1.6(1). It shows that the psp-properties in Definition 2.1 impose severe restrictions. First of all, let and denote the extreme vertices in . The pair is the only one giving rise to a trace space . As a consequence, every psp endo d-map has to fix both and and the complement of the set .
The case has to be dealt with separately: The identity map and the reflection in the diagonal are (non-d-homotopic) psp maps. Every d-map that preserves and is neutrally psp d-homotopic to the identity map. The vertices and are not preserved, in general.
In the following, let : Let denote the set of all vertices, let denote the set of all vertices with exactly coordinates equal to . We want to establish, that a psp map preserves all vertex sets . To this end, let denote the set of all with exactly coordinates equal to [math] and none equal to , resp. the set of all with exactly coordinates and none equal to [math] (unions of interiors of lower, resp upper -faces). By Example 1.6(1), preserves and for . By continuity, preserves also their closures and intersections of those. In particular, for , preserves .
On the other hand, every permutation defines a psp d-map , that permutes elements in .
Now we want to prove that every future psp d-homotopy from the identity map (cf Definition 1.8(1)) has to fix all vertices in : Such a psp d-homotopy preserves each lower -face in , and each upper -face in (characterized by which coordinates are [math], resp. ) and their closures for . In particular, every vertex in is fixed for . Now suppose . Since every lower 1-face and its closure are preserved by , its single upper boundary vertex (with coordinates [math] and 1 coordinate ) needs to be fixed since is a future d-homotopy.
Finally, we consider the vertex ; more generally a vertex in . Let . Suppose with . Since is homotopic to and thus surjective, there exists with ; without restriction, we assume . The future of (shaded in the adjacent figure) is mapped onto the edge connecting and . It contains the element which therefore has to be mapped to . Contradiction, since a psp d-map maps only into .
{\mathbf{x}}$$f({\mathbf{x}})$${\mathbf{y}}$${\mathbf{z}}$${\mathbf{1}}$${\mathbf{0}}$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet
We conclude that preserves all faces of (including their boundaries). In fact, preserves also the interiors of faces: Assume with . Since is a d-map and since , . Contradiction!
A similar proof works for maps that are past psp d-homotopic to the identity.
2.2. Coherently path space preserving maps
Definition 2.1 relates trace spaces in the domain and the codomain to each other, but these equivalences may not be coherent: their “inverses” – for varying pairs are not necessarily collected into a continuous map. We need to formulate an additional requirement in order to achieve this:
For a d-map , consider the commmutative diagram
[TABLE]
with the pullback of along with ; ie has fibre over .
Definition 2.4**.**
- (1)
A psp d-map is called coherently psp if the map (on the left hand side of (2.3)) is a fibre homotopy equivalence, i.e, there exists a “homotopy inverse” continuous map over the identity map on such that and are fibre homotopic to the respective identity maps. 2. (2)
A d-homotopy is called coherently psp if the fibre map has a continuous fibre homotopy inverse (everything over ).
Remark*.*
The coherence requirement in Definition 2.4 is inspired by a similar requirement to what is called a directed homotopy equivalence in [8] and [9]. In the context of this paper, it becomes essential in the discussion of directed topological complexity in Section 4.
Lemma 2.5**.**
(Coherently) path space preserving maps are closed under composition and partially under factorization: Let and denote d-maps.
- (1)
If and are (coherently) psp, then is so as well. 2. (2)
If and are (coherently) psp, then is so, as well.
Proof.
Without the coherence request, the claims follow from the 2-out-of-3 property of weak homotopy equivalences. Concerning coherence: The fibre map and its homotopy “inverse” over pull back to homotopy inverse fibre homotopy equivalences and over .
- (1)
The map is a fibre homotopy equivalence; its homotopy inverse is the composition of with the homotopy inverse of over . 2. (2)
If denotes the fibre map homotopy inverse to over , then the composition of the fibre maps with the fibre map – both over – is a homotopy inverse to . This can be seen as in the proof of the fact that homotopy equivalences satisfy the 2-out-of-3 property.
∎
It is in general not true that and psp implies psp: we obtain only information on traces in the image of .
2.3. Inessential d-maps
Now we specialize to the case of endo-d-maps from a d-space into itself. In particular:
Definition 2.6**.**
A d-map is called (in the notation of Definition 1.8)
- (1)
future inessential if there is a psp d-homotopy . 2. (2)
past inessential if there is a psp d-homotopy . 3. (3)
neutrally inessential if it is neutrally psp d-homotopic to .
We will write -inessential with (+: future, -: past, [math]: neutral).
A d-map is called coherently -inessential if, in addition, the d-homotopies to the identity map can be chosen as coherent -psp d-homotopies.
Remark*.*
-inessential d-maps correspond to a weak directed version of deformation retraction. We do not insist that the d-homotopies restrict to the identity map on a subspace. It would also be possible to relate d-spaces and d-subspaces by such a relation; compare [2].
Example 2.7**.**
- (1)
Consider the branching space from Example 1.9. Every d-map is coherently [math]-psp inessential. It is coherently (resp. )-psp inessential if and only if , resp. for every . 2. (2)
A d-map is coherently [math]–psp inessential if it preserves and the branches and . It is coherently (resp. )-psp inessential if and only if, moreover, , resp. for every . 3. (3)
A d-map is [math]-psp inessential if it preserves all interiors of all face; cf Example 2.2. The cases , resp. inessential require, in addition, that , resp. , for every .
Such a d-map is also coherently psp inessential, as will be shown for in the first place: Since and are contained in the same face for every , we may select the constant speed line d-path connecting and , within . Together, these maps define a continuous lift of the map into the end point map . Let denote the source and target maps (the components of the end point map ). Concatenation on the right with maps into ; concatenation on the left with maps into . The diagram
\textstyle{\vec{P}(\partial\Box_{n})\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{*(L_{f}\circ s)}$$\scriptstyle{f\circ}$$\textstyle{\vec{P}(\partial\Box_{n})}$$\textstyle{\vec{P}(\partial\Box_{n})\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(L_{f}\circ t)*}
commutes up to homotopy, cf [13, 15]. The map has a fibre homotopy inverse by mapping, for , a path to the path given by – well-defined since and belong to the same cube. Similarly, a fibre inverse to maps to given by . Composition of with the fibre inverse of yields a homotopy inverse to .
For , one may select the constant speed line path connecting and instead. For , connect with via by a zig-zag of d-paths within the same cube. The diagram on the left provides a fibre homotopy inverse to the map .
Lemma 2.8**.**
The family of (coherently) -inessential endo-d-maps is closed under composition.
Proof.
By assumption, there are -psp-d-homotopies connecting with inessential d-maps . Compose the homotopy connecting with with the map on the right to produce an –d-homotopy connecting with . This homotopy is psp since weak homotopy equivalences are closed under composition. Concatenate the resulting d-homotopy with the original one connecting with to obtain an -psp d-homotopy connecting with .
If the original d-homotopies are coherently psp, then there composition is so, as well, by Lemma 2.5. ∎
Inessential d-maps are, moreover, partially closed under factorization:
Lemma 2.9**.**
Let denote endo d-maps such that and are (coherently) [math]-inessential. Then is (coherently) [math]-inessential.
Proof.
By assumption, there are dihomotopies connecting with resp. with . Compose the first one with on the right resulting in a dihomotopy connecting with . The dihomotopies involved induce maps for ; these maps are weak homotopy equivalences since both and are psp. Concatenate with the second psp dihomotopy to connect with . The coherent version follows from Lemma 2.5. ∎
Similar to the statement concluding Section 2.1, it is not possible to conclude: and [math]-inessential implies is [math]-inessential; there is no information about trace spaces with (one of the) outside the image of . Inessential maps do thus not satisfy the 2-out-of-3 property. It is unlikely that Lemma 2.9 holds for : The proof results in a zig-zag of d-homotopies and not a simple d-homotopy starting at , and there is no reason for a such to exist.
The following technical results will be needed in Sections 2.4 and 3:
Lemma 2.10**.**
Let and denote d-maps such that and are psp. Then the maps are psp each.
Proof.
Apply the 2-out-of-6 property for weak homotopy equivalences to the following strings of maps:
[TABLE]
[TABLE]
∎
It turns out handy that inessential maps behave well under the following form of insertion:
Lemma 2.11**.**
Let and denote d-maps such that is a (coherently) -inessential d-map on and is a (coherently) -inessential d-map on . Then is a (coherently) -inessential d-map on .
Proof.
Let denote a d-homotopy connecting and . Then the whisker composition , is a d-homotopy between and . It is psp according to Lemma 2.10 and since weak homotopy equivalences are closed under composition. Concatenate with a psp d-homotopy connecting and . The coherent version of the statement is proved by using Lemma 2.5 on top. ∎
2.4. Rather inessential d-maps
The following definition takes care of the fact that inessentialness is not a 2-out-of-3 property:
Definition 2.12**.**
An endo d-map on is called (coherently) rather -inessential if there exists an (coherently) -inessential endo d-map on such that is (coherently) -inessential.
Remark*.*
The condition rather inessential is relaxed compared to inessential: One knows only that is a weak homotopy equivalence on trace spaces of the form , on the image of the “retraction” .
Lemma 2.13**.**
The family of (coherently) rather -inessential d-maps is closed under composition.
Proof.
For rather -inessential d-maps there exist -inessential d-maps such that is -inessential. The endo d-map is -inessential by Lemma 2.11, and so is by Lemma 2.8. ∎
The following property shows that the family of rather inessential maps has better properties than the family of inessential maps.
Lemma 2.14**.**
Let denote d-maps such that is (coherently) rather -inessential.
- (1)
If is (coherently) -rather inessential, then is (coherently) rather [math]-inessential. 2. (2)
If is (coherently) rather inessential, then so is .
Proof.
- (1)
By assumption, there exist inessential d-maps such that and is inessential. By Lemma 2.11, the map is inessential. Since is inessential, by Lemma 2.9, is [math]-inessential, and hence is rather [math]-inessential. 2. (2)
By assumption, there exist inessential d-maps such that and are inessential. By Lemma 2.8, resp. Lemma 2.11, also the maps and are inessential. Hence is rather inessential.
∎
Remark*.*
- (1)
Lemma 2.13 and 2.14 together yield: The rather [math]-inessential endo-d-maps on a d-space enjoy the 2-out-of-3 property. 2. (2)
In Lemma 2.14(1), we can in general not conclude that is rather -inessential. It is not certain that there exists a future (or past) d-homotopy relating and . 3. (3)
It is possible to refine (1): If and are rather [math]-inessential through a d-homotopy (instead of a dihomotopy, cf Definition 1.8(2)) from , then is so, as well.
2.5. Generalization to monoids
Considering the monoid of d-maps on , we may localize the submonoid consisting of -inessential d-maps (and coherent versions), and declare, for inessential d-maps on , the d-maps and equivalent mod inessentials. In particular, inessential maps are equivalent to the identity , and hence so are rather inessential maps. Furthermore, we will in Section 5 consider the quotient monoid with respect to the symmetric and transitive closure (an equivalence relation) of this relation.
The notions “inessential” and “rather inessential”, for , in the preceeding sections are special cases of the following picture comparing a monoid to a submonoid enjoying the “inessentiality” property (compare with Lemma 2.9):
[TABLE]
In such a situation, one may define a “closure” of by . Using the same formal arguments as in Lemma 2.13 and Lemma 2.14, one proves:
Proposition 2.16**.**
Let denote a pair of monoids enjoying the inessentiality property (2.15). Then
- (1)
* is a submonoid of containing .* 2. (2)
* enjoys the 2-out-of-3-property, i.e., if two of the three elements are contained in , then so is the third.*
3. Directed homotopy equivalences
3.1. Definitions and Examples
Definition 3.1**.**
A d-map is called a (coherent) directed homotopy equivalence if there exists a d-map such that and are (coherently) -rather inessential.
In particluar, a directed homotopy equivalence is an ordinary homotopy equivalence. Moreover, an -directed homotopy equivalence preserves trace spaces “up to inessentials”:
Lemma 3.2**.**
Let denote an -directed homotopy equivalence. Then there exists an inessential d-map such that is a weak homotopy equivalence for all (“ is psp on the image of ”)
Proof.
By definition, there exist inessential maps and such that and are inessential. By Lemma 2.11, the maps and are inessential, as well. Apply Lemma 2.10 to the maps and to conclude that the map is psp. Since is psp, the maps induced by on trace spaces in the image of are weak homotopy equivalences. ∎
Example 3.3**.**
- (1)
Consider the branching space from Example 1.9, and let us see that the inclusion of the one-point d-space consisting of the origin is not a -equivalence: Let denote the unique map. For any (-inessential) map , the composition , and maps every element to . We have seen in Example 1.9 that this map is not future d-homotopic to the identity map on .
Remark that the map is a past (and thus a neutral) directed homotopy equivalence, even coherently so: The map is the identity map. Let denote the constant (and unique) d-path at . Then is a fibre homotopy equivalence over . The fibre inverse maps to the unique trace from to in . 2. (2)
Let denote the geometric realization of the directed graph (“the letter W”)
[TABLE]
All non-empty path and trace spaces are contractible, and the unique d-map to the one point/one path d-space is coherently psp (cf Definition 2.4). To check, whether is dicontractible (ie [math]-directed homotopy equivalent to ), let and denote arbitrary d-maps. The composite map is constant and thus not (neutrally) d-homotopic to since any dihomotopy with will fix the branch points and . 3. (3)
Let us compare the spaces and with and ; the latter space occurs as a simple model for mutual exclusion between two processes in concurrency theory.
\leftarrow X$$Y$${\mathbf{j}}_{1}$${\mathbf{j}}_{2}$$\leftarrow Y_{1}$$Y_{2}\to
Assume is an directed homotopy equivalence with “homotopy inverse” . By Lemma 3.2, and , whereas . Since is continuous, we conclude that and . Similarly, and . In particular, maps into and into . This map can therefore neither be future- nor past-d-homotopic to the identity map.
Otherwise for : The map , is a neutral directed homotopy equivalence with homotopy inverse . To check coherence, observe that whereas
, and contracts to the inner hollow square.
The trace space connecting two points in that hollow square has two elements if and only if and and one element else. A fibre homotopy inverse to associates to such a trace the trace connecting with consisting of a horizontal and a vertical path; the order (first horizontal, then vertical or the reverse) follows the order of the trace connecting and . 4. (4)
The directed circle is the pre-cubical set with one [math]-cell and one -cell. Its geometric realization is a circle on which directed paths proceed counter-clockwise, ie., they are images of non-decreasing paths under the universal covering . The directed -torus arises as product of directed circles.
It is shown in [15, Section 4.4] that only directed homeomorphisms on are inessential; furthermore, the inessential maps on a directed torus are necessarily products of directed homeomorphisms on each factor. In particular, these inessential maps are bijections; hence, rather inessential maps are necessarily inessential. As a result, only very few maps are directed self-homotopy equivalences: On a directed circle, these are only the directed homeomorphisms, and on a torus, these are only products of such.
Definition 3.4**.**
Two d-spaces and are called (coherently) -equivalent if there is a (coherent) directed homotopy equivalence .
Remark*.*
- (1)
It follows from Definition 3.1 and from Lemma 2.13 that (coherent) -equivalence is an equivalence relation between d-spaces. 2. (2)
For two -equivalent d-spaces and , there exist in fact d-maps and such that and are (coherently) -inessential (not just rather inessential). Here is why: If there are d-maps and inessential d-maps and such that and are -inessential, then replace by and by . The map is -inessential according to Lemma 2.11. Likewise .
We need to come back to the weaker notion from Definition 3.1 in Section 3.2 in order to establish a 2-out-of-3 property for individual -directed homotopy equivalences, cf Proposition 3.6. 3. (3)
Goubault [8] and Goubault, Farber and Sagnier [9] propose the following requirements to a d-map to qualify as a directed homotopy equivalence:
- (a)
is an ordinary homotopy equivalence with a homotopy inverse d-map . 2. (b)
Both and are fibre homotopy equivalences.
(b) is a reformulation of the original wording in [8] and [9]. Remark that this definition has both weaker and stronger assumptions compared to our definition. Weaker since it is not assumed that the compositions , resp. are d-homotopic to the identity maps (in any flavour). Stronger since no compositions with inessential maps are used.
With their definition, from Example 3.3(1) is always a directed homotopy equivalence with homotopy inverse . Even from Example 3.3(2) does then qualify as a directed homotopy equivalence; coherence (ie (b) above) is established as in Example 3.3(2).
3.2. A 2-out-of-3 property
Previous attempts to define directed homotopy equivalences failed to establish the 2-out-of-3 property among morphisms (d-maps) in the category ; cf Definition 1.1(4). Proposition 3.6 below shows that Definition 3.1 is suitably weak to establish such a property.
We will need the following generalization of Lemma 2.11 (for all flavours ):
Lemma 3.5**.**
Let and denote d-maps such that and are rather inessential. Then, for every rather inessential map , the composition is rather inessential.
Proof.
By assumption, there exist inessential d-maps such that , and are inessential. By Lemma 2.8, is inessential. By Lemma 2.11, is inessential, and so is . Again by Lemma 2.11, the map is inessential. Hence is rather inessential. ∎
Proposition 3.6**.**
The [math]-directed homotopy equivalences satisfy the 2-out-of-3 property among morphisms (d-maps) in the category .
Proof.
We try the 2-out-of 3 property for all flavours . Only for one of the factorization cases it is necessary to assume that :
**Composition: **
Let denote -directed homotopy equivalences with “inverses” : Both and are then rather inessential. By Lemma 3.5, so is their composition . Similarly for composition in the reverse order.
**Factorization 1: **
Let and be d-maps such that and are -directed homotopy equivalences. By assumption, there exist reverse maps and such that and and are rather inessential. To check as a “left inverse” to , we consider: that is rather inessential by Lemma 3.5. By Lemma 2.14, the composition is so, as well.
**Factorization 2: **
and are -directed homotopy equivalences. Hence there exist reverse maps and such that and and are rather inessential. Hence is rather inessential by Lemma 3.5. By Lemma 2.14, is rather [math]-inessential.
∎
Remark*.*
Proposition 3.6 is also valid for coherent [math]-directed homotopy equivalences. Every lemma used in the proof has also a coherent version.
3.3. Generalizations
3.3.1. -equivalences
The framework presented in the previous sections can be generalized to compare d-spaces that are equivalent in a weaker sense. The notion of (weak) homotopy equivalence can be replaced by that of an -equivalence:
Definition 3.7**.**
[17, Definition 2.5] A familiy of -morphisms is called an equivalence system if
- (1)
is closed under homotopy; 2. (2)
satisfies the 2-out-of-3-property; 3. (3)
contains all weak homotopy equivalences: 4. (4)
An -morphism induces a bijection on sets of path components. 5. (5)
is closed under finite products and finite sums. A finite sum is contained in if and only if every summand is so.
Many equivalence systems arise from a functor into a category : The family consists then of those morphisms for which is an isomorphism. This is the case for the most important examples of equivalence systems for our purposes that are collected in the list below:
**: **
the weak homotopy equivalences
**: **
the family of maps inducing bijections on sets of path components
**: **
the family of maps inducing bijections on and isomorphisms on all homotopy groups for every and every choice of basepoint
**: **
( an abelian group): the family of maps inducing isomorphisms on all homology groups for every .
The whole program in the previous sections can be adapted: We will call a d-map -path space preserving if is an -equivalence for all . This leads to the concept of (coherently) -inessential endo-d-maps (generalising Definition 2.6) and (coherent) -equivalence (generalising Definition 3.1). If the system satisfies the 2-out-of-6 property (as all those in the list above), then all properties of inessential maps and directed homotopy equivalences have counterparts (-(rather) inessential maps, resp. -equivalences) in this framework.
Directed maps induce functors between the “natural homology” systems [3] associated to d-spaces. If a d-map is an -equivalence, then these natural homology systems become isomorphisms on the level of homology “up to -inessential maps” on both sides. Details will be developed in Section 5.
3.3.2. General endomorphisms
The pattern of proof in Lemma 3.5 can be generalized to the following setting: Let and denote morphisms in some given category . Let and denote the monoids of endomorphisms. Let denote submonoids enjoying the inessentiality property (2.15) and giving rise to closures , resp. , cf Section 2.5. Together, the mophisms define maps (not monoid morphisms, in general!) and .
Lemma 3.8**.**
Suppose and . Then .
Let us call a morphism an equivalence up to inessentials if there exists a morphism satisfying the assumptions of Lemma 3.8. Then we can prove, analogously to Proposition 3.6:
Proposition 3.9**.**
The property “equivalence up to inessentials” among -morphisms is a 2-out-of-3-property.
4. Directed homotopy equivalences and directed topological complexity
4.1. (Directed) topological complexity
Michael Farber [7] introduced the notion “topological complexity” of a topological space to address the motion planning problem: Given a topological space , find the minimal number of subspaces covering such that there exists a continuous section of the path space fibration over each ; technically speaking, this is the Schwartz genus of the path space fibration. This notion has been extensively studied, and the topological complexity has been determined or at least estimated for many spaces of interest in the literature.
Recently, Goubault, Farber, and Sagnier [9] have proposed the following definition for directed topological complexity (adapted from one of the customary definitions of to the directed framework, cited here using the notations from the present paper) for a d-space such that is a Euclidean Neighbourhood Retract (ENR):
Definition 4.1**.**
[9, Definition 3] The directed topological complexity of a d-space is the minimal number (if existing) such that there is a (not-necessarily continuous) section of the fibre map and over mutually disjoint subspaces and such that is continuous.
The authors then calculate the directed topological complexity of some important d-spaces, but it seems fair to say that the theory is not well-developed yet in the directed case. The crucial complication compared with the non-directed case stems from the fact that the end-point map is, in most cases, not a fibration: In general, the homotopy types of fibres varies with the end points; d-spaces are not homogeneous!
The following recent result by Borat and Grant [1] concerning the “directed spheres” , the boundaries of unit cubes, came as a surprise: Whereas the (ordinary) topological complexity of spheres is for odd and for even, they show:
Proposition 4.2**.**
[1]** Directed topological complexity satisfies: for all .
4.2. Invariance under directed homotopy equivalence
Goubault, Farber and Sagnier investigate also the invariance of topological complexity under their notion of directed homotopy equivalence, cf the final remark in Section 3.1. It is quite easy to check that the following result [9, Proposition 7] also holds when using our notion of coherent directed homotopy equivalence, regardless of the flavour :
Proposition 4.3**.**
Directed topological complexity is invariant under directed homotopy equivalence.
Proof.
The basic argument in the proof is essentially the one given in [9]. We adapt it to our setting as follows: Assume and are d-maps such that and are coherently inessential, cf Definition 3.4. Then is a fibre homotopy equivalence over . Let denote a section of , continuous on disjoint subspaces covering . Then the composite is a map over , continuous on the disjoint subspaces covering . It pulls back to a section of over . Composition with a fibre inverse to yields a section of the restrictions of which to the subsets are continuous.
Hence . A symmetric argument proves the reverse inequality. ∎
5. Directed homotopy equivalences and pair component categories.
5.1. Extension categories and relatives
It was the main aim of [15] (consult that paper for motivations and details) to organize essential information about the relations between spaces of directed paths (with varying end points) within a given d-space in appropriate categories; to investigate, and if possible, to simplify and/or to compress these categories. Point of departure is the extension category of the fundamental category [10, 4] (objects: points in ; morphisms: homotopy classes of d-paths between source and target). contains as objects the reachable pairs in . (Extension) morphisms have the form – contravariant in the first coordinate and covariant in the second. To this category, further morphisms arising from endo-d-maps may be added “acting” on those already present:
An endo-d-map gives rise to a morphism from to . All endo-d-maps give rise to the morphisms of a category (under composition) on the object set . The “mixed” category , cf [15], has again as set of objects; its morphisms are freely generated by those of and of modulo the relations generated by the following two commutative diagrams
[TABLE]
for any endo d-map ; and
[TABLE]
for any future d-homotopy (cf Definition 1.8) from to , and for all . Here is the d-path arising by restricting to .
From now on, we will make use of general -equivalences, cf Section 3.3.1; at a first read just think of of consisting of the weak homotopy equivalences. The category comes equipped with a functor into any of the categories corresponding to the equivalence system : Pairs of points go to trace space resp. its -invariant (eg homology); extensions and d-maps to the morphism induced by those on (the invariants of) these trace spaces. The diagrams associated to (5.1) and to (5.2) in do commute!
Instead of letting all endo-d-maps act, we may restrict to adding only the -inessential ones, corresponding to the symmetries of the d-space : First of all, they give rise to “inessential” subcategories restricting the morphisms in to those arising from inessential d-maps. Combining with the extension category – as above – yields a subcategory . Remark that inessential d-maps are mapped into isomorphisms in under the functor mentioned above.
Inverting all symmetries given by inessential morphisms gives rise to localized categories – relating objects and resp. extensions and by an isomorphism. Remark that also a rather inessential morphism gives rise to isomorphisms in the localized category: If and are inessential morphisms, then is a product of isomorphisms (with inverse ). Note also that the functors from above into extend to the localized categories (eg to ) since invertible morphisms go to isomorphisms.
The path components of with respect to isomorphisms in such a localized category (with respect to zig-zag paths induced by inessential morphisms) form the objects of the quotient pair component categories ; cf. [15]. Remark that rather inessential morphisms in become identities in this quotient category.
5.2. Pair component categories as obstructions to directed homotopy equivalences
A d-map induces a functor : To we associate the pair and to an extension by we associate the extension by . There is no obvious way to construct a functor relating endo-d-maps on to endo-d-maps on on the basis of a single d-map , such. That option seems to arise if one considers a pair of d-maps and . We may then associate to an endo-d-map the endo-d-map . But this construction is not functorial: To a composition of d-maps , we associate and not .
Now assume that d-spaces and are -equivalent, ie there exists a d-map with “ inverse” . By Lemma 2.11 and Lemma 3.5, if we start with a (rather) inessential map , then the resulting map is again (rather) inessential. The two endo d-maps and on from above “differ” only by the inserted (rather) inessential map .
Proposition 5.3**.**
Let denote an equivalence.
- (1)
*The composite functor * \textstyle{E\vec{\pi}_{1}(X)\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{E\vec{\pi}_{1}(F)}$$\textstyle{E\vec{\pi}_{1}(Y)\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\Sigma_{{\mathcal{F}}}^{\alpha}E\vec{\pi}_{1}(Y)[\Sigma_{{\mathcal{F}}}^{\alpha}(Y)^{-1}]}
- is essentially onto. Every morphism in the localized category is conjugate (via isomorphisms) to a morphism in the image.*
- (2)
The above functor yields a quotient isomorphism on the level of pair component categories.
In particular, if two d-spaces have non-isomorphic pair component categories , then there cannot exist an -equivalence between them. As Example 3.3(2) shows, the existence of an isomorphism of pair component categories is a necessary but not a sufficient condition for the existence of an -equivalence.
Proof.
- (1)
Let denote an -inverse to . An object is connected – by the isomorphism – to with . Every covariant extension morphism fits into the diagram
[TABLE]
Note that the top morphism is in the image of . Similarly for contravariant extensions.
An inessential d-map inducing fits into the diagram
[TABLE]
with a morphism in the image of (of the identity on ) on top. 2. (2)
As mentioned before, an -equivalence does not yet induce a functor between localized categories. But inessential maps give rise to isomorphisms in those and hence to identities in the pair component categories; hence becomes a functor. The remaining part follows from (1) above: The functors induced by and by on pair component categories are the identities.
∎
Example 5.4**.**
In his thesis [2], Dubut defined an interesting -space consisting of four 2-dimensional cubes and a glueing that can visualized as in Figure 1:
It is quite easy to see (cf [15, Section 1.2]) that all arising path spaces in are either empty, contractible, or they consist of two contractible components. This fact, and also all arising extension maps, are very reminiscent of the space , the boundary of a square, cf Example 1.6. But these two spaces are not homotopy equivalent: Their component categories are analyzed in [15]. The pair component category of is easy to understand; it has nine objects; cf [15, Section 4.3.1]. In contrast, the pair component category of is difficult to describe; it has far more objects; cf [15, Proposition 5.13]. In particular, there cannot exist any directed homotopy equivalence connecting them.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Borat and M. Grant, Directed topological complexity of spheres , J. Appl. Comput. Topol. 4 (1) (2020), 3 – 9.
- 2[2] J. Dubut, Directed homotopy and homology theories for geometric models of true concurrency , Ph.d.-thesis, École normale supérieure Paris-Saclay (2017).
- 3[3] J. Dubut, É. Goubault, J. Goubault-Larrecq, Natural Homology , In: Halldórsson M., Iwama K., Kobayashi N., Speckmann B. (eds) Automata, Languages, and Programming. ICALP 2015. Lect. Notes Comput. Sci. vol 9135. Springer, Berlin, Heidelberg (2015).
- 4[4] L. Fajstrup, É. Goubault, E. Haucourt, S. Mimram, and M. Raussen, Directed Algebraic Topology and Concurrency, Springer, Cham (2016).
- 5[5] L. Fajstrup, É. Goubault, and M. Raussen, Algebraic Topology and Concurrency , Theor. Comput. Sci. 357 (2006), 241 – 278. Revised version of Aalborg University preprint, 1999.
- 6[6] U. Fahrenberg and M. Raussen, Reparametrizations of continuous paths . J. Homotopy Relat. Struct. 2 (2007), 93 – 117.
- 7[7] M. Farber, Topological Complexity of Motion Planning , Discrete Comput. Geom. 29 (2003), 211 – 221.
- 8[8] É. Goubault, On directed homotopy equivalences and a notion of directed topological complexity , arxiv:1709.05702 v 2 (2017).
