Pair component categories for directed spaces
Martin Raussen

TL;DR
This paper refines the theory of pair component categories for directed spaces by removing restrictions, using homology instead of homotopy, and offers an alternative to natural homology, enhancing the analysis of directed path spaces.
Contribution
It extends previous work on directed space categories by relaxing conditions and replacing homotopy with homology, providing new tools for analyzing path space invariants.
Findings
Introduces a homology-based pair component category for directed spaces.
Provides an alternative to natural homology for computable invariants.
Refines the concept of stable components in directed topology.
Abstract
The notion of a homotopy flow on a directed space was introduced in \cite{Raussen:07} as a coherent tool for comparing spaces of directed paths between pairs of points in that space with each other. If all parameter directed maps preserve the homotopy type of path spaces, such a flow (and these parameter maps) are called inessential. For a directed space, one may consider various categories whose objects are pairs of reachable points and whose morphisms may be induced by these inessential d-maps. Localization with respect to subcategories with these inessential d-maps as morphisms can be combined with a path space functor into the homotopy category, the quotient pair component category has as objects pair components along which the homotopy type is invariant -- for a coherent and transparent reason. This paper follows up \cite{FGHR:04,GH:07,Raussen:07} and removes some of the…
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.
Pair component categories for directed spaces
Martin Raussen
Department of Mathematical Sciences, Aalborg University, Skjernvej 4A, DK-9220 Aalborg Øst, Denmark
[email protected] http://people.math.aau.dk/ raussen/
Abstract.
The notion of a homotopy flow on a directed space was introduced in [21] as a coherent tool for comparing spaces of directed paths between pairs of points in that space with each other. If all directed maps along such a 1-parameter deformation preserve the homotopy types of path spaces, such a flow and the parameter maps are called inessential.
For a directed space, one may consider various categories whose objects are pairs of reachable points to which a functor associates the space of directed paths between them. The monoid of all inessential maps acts on such a category by endofunctors leaving the associated path spaces invariant up to homotopy. We construct a pair component category as quotient category: it has as objects pair components along which the homotopy type is invariant – for a coherent and transparent reason.
This paper follows up [8, 16, 21] and removes some of the restrictions for their applicability. At least in several examples, it gives reasonable results for spaces with non-trivial directed loops. If one uses homology equivalence instead of homotopy equivalence as the basic relation, it yields an alternative to computable versions of “natural homology” introduced in [5] and elaborated in [3]. It refines, for good and for evil, the stable components introduced and investigated in [25].
Key words and phrases:
d-space; homotopy flow; pair category; localization, component category, cubical complex
1991 Mathematics Subject Classification:
18B35, 55P60, 55U40, 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.
A preliminary version of this article was presented at the Abel-Symposium 2018 in Geiranger, Norway. Support is gratefully acknowledged.
Thanks are also due to the referees who rightly suspected errors in a previous version and who suggested several improvements of the presentation.
1. Introduction
1.1. Directed spaces and spaces of directed paths
A directed space (or d-space for short) [17, 18] is a topological space together with a subset of directed paths (or d-paths) satisfying reasonable properties: includes all constant paths, it is closed under concatenation of d-paths and and under non-decreasing reparametrizations. The set is given the compact-open topology inherited from . A map is a d-map if .
Particularly important d-spaces are the directed interval with consisting of all non-decreasing maps , and the d-spaces which are the building blocks for cubical complexes - the geometric realizations of pre-cubical sets with d-paths that are cubewise non-decreasing. Cubical complexes are the underlying d-spaces for Higher Dimensional Automata, models for true concurrency introduced and investigated by Pratt and van Glabbeek [20, 13, 14]; cf Section 3.3.1 for details.
For two points , we consider the subspace of all d-paths with source and target . The point is reachable from if this subset is non-empty; and is then called a reachable pair. A d-path and a reparametrization with a surjective non-decreasing map are reparametrization equivalent. The symmetric and transitive closure of this relation is called reparametrization equivalence [7]. Equivalence classes, the so-called traces, are the elements of trace spaces with the quotient topology under the natural projection . In many cases, and in particular for cubical complexes , these projection maps are homotopy equivalences [22].
Unlike in classical topology, the topology of path and trace spaces may vary depending on the pair of end points, even for path-connected spaces, since the reverse path of a d-path is, in general, not a d-path; for simple examples cf Section 4. In this article, we will partition, not the d-space itself (this was done in [8] and [16]), but the subspace of reachable pairs (cf Section 2.1.3) into coherent “components” along which the homotopy type of the path and trace spaces have to be invariant.
1.2. A motivating example
Reading the impressive and comprehensive thesis [3] by Jérémy Dubut, an example (p. 162) with graphical representation in Figure 1 caught my attention:
The cubical complex (geometric realization of a pre-cubical set, cf Section 3.3.1, Definition 3.4) consists of four 2-cells . Remark that the cell shares a face with both cells and . As a result, path spaces between points in cell and points in cell have different homotopy types depending on their relative positions: The space ,
- •
is empty if and
- •
has two contractible components if and
- •
is contractible else;
cf Figure 2.
Observe that a d-path with source in and target in hence does not induce a homotopy equivalence between and by extension if and (or if and ); cf Figure 2. In particular, the only d-paths within that, by extension, induce homotopy equivalences on all non-empty path spaces are the trivial ones: ; cf Figure 3. Similarly for d-paths connecting various points within ; they are never weak isomorphisms in the parlance of [16, 10]. As a consequence, the fundamental category of the cubical complex (cf Section 2.1.2) allows only a trivial system of weak isomorphisms (consisting solely of the contant paths).
1.3. Previous work
In order to obtain discrete invariants, previous work [16, 10] studies localizations and component categories (cf Section 2.3) of the fundamental category (cf Section 2.1.2) of a d-space without non-trivial loops. So-called weak isomorphisms consisting of inessential d-paths (inducing equivalences on all non-empty path spaces) form systems of morphisms that are used for localizations or quotients.
In Dubut’s example in the previous section, it turns out that each component consists of a single point only; the components do not give rise to any state space reduction at all! K. Ziemiański [25] has recently suggested so-called stable components to overcome this problem, cf also Section 6.2.
A similar problem has been known for a long time for directed spaces with non-trivial directed loops. The simplest such space , the directed circle with counterclockwise directed paths, does not allow any non-trivial paths giving rise to weak isomorphisms either, cf [10, Section 6.4.1].
1.4. Contributions
The present paper takes a different approach resulting in reasonable finite component categories in both above mentioned cases (cf Section 5.5 and Section 4.4.1); in particular, this is probably the first definition of a component category that can deal with directed spaces containing non-trivial directed loops.
The category of departure is no longer the fundamental category (with point as objects, cf Section 2.1.2) but its extension category that has pairs of reachable points within as objects; the morphisms are pairs of d-homotopy classes of d-paths, cf. Section 2.1.3. This category comes with a trace functor (cf Section 2.3.2) associating to a pair the trace space . The aim is to identify, in a functorial way, pairs and d-homotopy classes in the extension category that give rise to the same data under , up to (homotopy) equivalence.
The resulting component categories are results of a quotient formation that arises from an action of a submonoid of the monoid consisting of all d-maps from into itself. A d-map is called inessential if it is d-homotopic to the identity map via a d-homotopy (called a homotopy flow) that, moreover, is path space preserving (psp), ie it induces homotopy equivalences , on non-empty trace spaces, cf Section 2.2.1, Definition 2.5.
These inessential d-maps act on the extension category by endo-functors. In particular, the trace functor factors over the action of these inessential morphisms (up to isomorphisms). The arising components (objects in a component category) are the path components among the pairs of reachable points with respect to the effects of path space preserving homotopy flows on the end points: In which ways can a pair of source and target points be perturbed by a 1-parameter deformation of the entire d-space without changing the homotopy type (or another reasonable invariant) of the path space inbetween?
To construct the pair component category, we make use of a localization and quotient process (cf Section 2.3) on a category with objects and morphisms generated freely by those in and, additionally, morphisms arising from the endo-functors induced by inessential d-maps on – modulo several natural relations; for details cf Section 2.1.5 and 2.3.1.
Several important properties of the arising pair component categories are collected in Section 3. In Section 4, they are used in the investigation of a number of basic examples illustrating scope and results of the chosen approach. In particular, the pair component category of the directed circle has two objects: the diagonal and its complement. Morphisms between them correspond either to the natural numbers or to the augmented natural numbers , cf Section 4.4.1.
It is certainly out of scope to determine pair components of a general d-space and their category algorithmically. When the space in question is a cubical complex, ie the geometric realization of a pre-cubical set, (Section 3.3.1), it is possible to find an approximation in the form of a so-called order component category, cf Section 5; usually much finer than the pair component category discussed previously: One considers only specific inessential d-maps (for details cf Section 5) that preserve each cell of the complex. We verify that, for a cubical complex with finitely many cells, the localization and the quotient process, as above, using only these specific d-maps, gives rise to a finite order component category. The pair component categories of cubical complexes are quotients of these order component categories.
Some of the constructions in this paper are borrowed from [21] and developed to suit new purposes. The reader should also compare K. Ziemianski’s recent interesting paper [25] defining and investigating stable components. Comments can be found in Section 6.2. Pointers to future work, in particular investigating how far this approach can be made functorial, conclude this article in Section 6.3.
2. Categorical constructs. Towards components and their categories
2.1. A zoo of categories
2.1.1. Trace category
The trace category [21] of a d-space has as objects the elements of . Morphisms from to are given by . Identities are given by constant traces, and composition by concatenation (up to reparametrization; hence associative). The trace category is enriched in .
A d-map between two d-spaces and induces a functor (of topologically enriched categories) .
2.1.2. Fundamental category
The fundamental category [17, 9, 18, 10] of a d-space is an ordinary category. It arises from the trace category by identifying morphisms (ie traces) that are related by a directed homotopy (or a d-homotopy [17, 18]; this is not always the same notion!). Morphisms are identified along the path-component functor , giving rise to a quotient functor . A d-map induces a functor .
2.1.3. Extension and factorization categories
Since we are interested in path spaces between given end points and their inter-relation, we need a category allowing for bookkeeping of both start and end points. The reachable pairs in a d-space , ie those in , form the objects of the extension category (called preorder category in [21]); cf. also [19, 5, 3]) of the trace category (cf 2.1.1). It is considered as a full subcategory of ; an (extension) morphism has the form :
[TABLE]
It was remarked by Fajstrup and Hess [11] that it is important to consider these categories together with the subcategories which allow only right. resp. only left extensions in order to distinguish clearly different d-spaces (for example the one arising by reversing all arrows from the original one); for a careful analysis, consult [4].
The extension category comes equipped with a functor with and .
More useful in the future is the extension category of the fundamental category with morphisms . It comes equipped with a functor into the category of homotopy types (cf Section 2.3.2).
A d-map between d-spaces induces a functor between extension categories and a natural transformation from the functor to on . Likewise a functor and a natural transformation from to on .
Homotopy groups (of path spaces) require a base point. To allow the necessary categorical bookkeeping, one may consider the factorization categories of the trace category, resp. the fundamental category, with traces, resp. d-homotopy classes of such as objects; cf [21, 3, 4]. Although not essentially more difficult, we will not use factorization categories in the subsequent parts of this paper.
2.1.4. Endo-d-category
We will need further categories with the same objects (the set of reachable pairs) but with different morphisms:
Definition 2.2**.**
Let denote a topological space.
- (1)
denotes the topological monoid of all continuous self (or endo)-maps on , equipped with the compact-open topology. 2. (2)
If is a d-space, a d-map is called an endo-d-map. Altogether, the endo-d-maps on form the topological submonoid (under composition). 3. (3)
Endo-d-maps give rise to the morphisms of the category with objects in , i.e., is the space of all d-maps satisfying and . Composition is given by composition of d-maps; the identity map gives rise to all identity morphisms.
The category is topologically enriched.
Remark that also the endo-d-category comes with a functor ; on the objects, it is defined as for the extension category; on morphisms, it associates to the map .
In general, a d-map between d-spaces and does not induce a functor from into .
2.1.5. d-extension category
Combining the morphisms from the categories and yields the d-extension category of : The set of objects is again the set of reachable pairs in . The morphisms arise from a quotient of the category freely generated by the morphisms from and from by composition modulo the congruence relation making diagrams (2.3) and (2.4) below commute:
[TABLE]
for any ; and
[TABLE]
for any simple future d-homotopy (cf Definition 2.5) from to , and for all . Here is the d-path arising by restricting to .
Remark*.*
- (1)
Imposing (2.3) means that every endo-d-map defines a functor from into itself. Altogether they define a monoid action of the monoid on by such endo-functors. 2. (2)
Diagram (2.3) encodes a coherent -extension property (compare [8, 16]) of the morphisms in the subcategory of endo-d-maps with respect to the subcategory of morphisms in the subcategory of extensions. 3. (3)
As a consequence of (2.3), every morphism in is a composition of just one endo-d-morphism and one extension morphism
. 4. (4)
If there is a simple d-homotopy from to such that and , then, according to (2.4), give rise to the same morphism in . 5. (5)
The functors from the previous paragraphs can be aggregated to define a functor (and this is why it makes sense to impose the commutativity of (2.3) and (2.4) above). 6. (6)
Note that, even if the d-space does not allow any non-trivial loops, the d-extension category may include non-identity endomorphisms arising from combinations of d-maps and of extensions. 7. (7)
Inclusion of morphism sets defines functors from , resp. from into – all categories have the same objects given by . By (4) above, the latter functor is not faithful in general.
2.2. Homotopy flows and inessential d-maps
2.2.1. Homotopy flows
We start by recalling elementary definitions about homotopy notions in directed algebraic topology: We distinguish the directed unit interval with consisting of all non-decreasing self maps (d-paths) and the undirected unit interval with consisting of all constant maps (paths).
Definition 2.5**.**
Let and denote two d-spaces.
- (1)
A d-map is called a simple d-homotopy from to (also: a future d-homotopy from to , or a past d-homotopy from to ) 2. (2)
A d-map is called a dihomotopy (or neutral d-homotopy). 3. (3)
Simple d-homotopies from to with (resp. ) are called future (resp. past) homotopy flows. Simple dihomotopies with (resp. ) are called neutral homotopy flows.
Both for a d-homotopy and for a dihomotopy, all level maps are d-maps. Only for d-homotopies, every path , is a d-path in .
The notion of homotopy flow [21] is meant to capture some, but not all, of the properties of a flow for a dynamical system associated to a vector field. Note that it is not demanded that the level maps , are invertible; they need neither be injective nor surjective. The map is not supposed to satisfy a group (or monoid) law either.
Concatenations and compositions.
Two simple d-homotopies between endo-d-maps on a d-space , say from to , resp. from to , can be concatenated to yield a d-homotopy from to . In particular, a homotopy flow from to can be concatenated with a simple d-homotopy from to on to yield a homotopy flow from to .
Homotopy flows on a given d-space can be composed in various ways (cf [21]). Here we propose a generalized construction: For two simple future d-homotopies let be given by . In particular, ,
and . Remark that this construction does not commute: in general, .
Any d-path provides a simple d-homotopy from to . In particular, d-paths on the 1-skeleton of joining and yield such simple d-homotopies “via” , resp. “via” . In the special case of homotopy flows , their composition provides homotopy flows ending at (via , resp. via ).
Similarly for past d-homotopies on . For neutral homotopy flows the path does not have to be directed. The construction above can be generalized to yield a composition of simple d-homotopies .
2.2.2. Psp homotopy flows and inessential d-maps
Ziemiański [25, Definition 2.6] gives a list of very natural requirements to a family of morphisms in the category to be considered as an equivalence system. We will concentrate here on the following particular cases (also considered in [25]):
**: **
consists of all (weak) homotopy equivalences.
**: **
consists of all maps inducing bijections on sets of path components ().
**: **
consists of all maps inducing isomorphisms on for ; denotes an abelian group.
In the following, all families are supposed to be sandwiched between and . We are, first of all, interested in homotopy flows that preserve path spaces up to an -equivalence:
Definition 2.6**.**
- (1)
A d-map is called -path space preserving (-psp for short) if is an -equivalence for all pairs . 2. (2)
A d-homotopy (in particular, a homotopy flow) is called -psp if every d-map is psp. 3. (3)
An endo d-map is called future/past/neutral -inessential if there exists a future/past/neutral -psp homotopy flow with and (resp. and ).
In the following, we will write abbreviate the “flavours” future with , past with , and neutral with . We may then talk about an homotopy flow, resp. inessential map.
Lemma 2.7**.**
Let denote a d-space.
- (1)
The concatenation of an homotopy flow on ending at with an homotopy from to (cf Section 2.2.1) yields an homotopy flow ending at . 2. (2)
The -inessential maps on a d-space are closed under composition; they form a submonoid of the monoid of all endo-d-maps on . 3. (3)
Consider the morphisms denoted in (2.3) in the case where is -psp. Then the functor (cf Section 2.1.5, Remark Remark) sends all these morphisms into -equivalences. 4. (4)
If is -inessential via a homotopy flow keeping fixed (i.e., ), then all extensions starting at induce -equivalences. Likewise, if is inessential via a homotopy flow from to fixing , then extensions ending at induce -equivalences.
Proof.
The statements follow from the construction of compositions of (psp) homotopy flows in Section 2.2.1, from Definition 2.6 and from (2.4) in the case where one of the maps is the identity.
∎
Remark*.*
- (1)
In previous work ([8, 16]), attention was given to psp-properties of extension morphisms and, moreover, a pushout/pullback property encompassing that the psp property can be “matched “ (on an individual basis) at start and end points. Asking for a psp homotopy flow means that there has to be a global witness (the psp homotopy flow) for these psp properties. As the example in Section 1.2 shows, it may be necessary to perturb start and end point coherently together to obtain “constant” path spaces (up to -equivalence). Hence, we are not going to compress the effects of inessential extension morphisms but those of inessential d-maps. 2. (2)
The concepts “psp homotopy flow” and “inessential d-map” make also sense from a computer science applied perspective. A psp homotopy flow captures coherent perturbations of all executions regardless of end points on a Higher Dimensional Automaton (HDA) in concurrency theory (cf [20, 14, 10]).
2.3. Localization and component categories
2.3.1. Inessential subcategories: Definitions
According to Lemma 2.7, the -inessential d-maps on (cf Definition 2.6.3) form submonoids , resp. (the neutral ones) of the monoid of all endo-d-maps on . As such, they give rise to wide subcategories of that we call . Objects are always the sets , regardless the decorations and .
A fourth flavour comes up as follows: Let
; ie induces the identity map on all homotopy groups, on path components, resp. on a range of homology groups.
In the following (starting in Section 2.3.4), we will concentrate on (mixed) subcategories , with
**Objects: **
Pairs of points in .
**Morphisms: **
arise as finite compositions of inessential morphims in with extension morphisms in obeying to the relations (2.3) and (2.4); the latter for .
As in Section 2.1.5, Remark Remark, one should think of the monoid as “acting” on the extension category by endo-functors, this time leaving moreover the homotopy types of associated trace spaces invariant.
2.3.2. Localization
Given a category with subcategory , the localization [1] of with respect to consists of a category together with a functor turning -morphisms into isomorphisms, and such that a functor factors uniquely through if and only if it sends all -morphisms into isomorphisms.
In practice, localization consists in adding formal inverses to the -morphisms; the morphisms in the localized category are finite zig-zags consisting of morphisms in the category and inverses of morphisms in the subcategory . A prominent example defines the category as the result of localizing the subcategory whose morphisms consists of all weak homotopy equivalences.
We will consider categories arising from a d-space . Of particular interest are the localized categories : all morphisms arising from inessential d-maps (and no extension morphisms) are inverted. In these cases, we can draw several conclusions from (2.3) and (2.4) in Section 2.1.5:
Lemma 2.8**.**
- (1)
The relations from (2.3) and (2.4) lead to reverse relations concerning morphisms for and psp homotopy flows on :
- (a)
. 2. (b)
. 2. (2)
*Let denote an inessential d-map on . Then indcuces bijections between morphism sets . *
Proof.
- (1)
follows directly from (2.3) and (2.4) in Section 2.1.5. 2. (2)
.
∎
By the universal property characterizing localization, for , the functors into and into (cf Section 2.1.3) extend to give rise to functors from the localized categories into for which we will use the same notation. Similarly, for a wider class of equivalence systems, for the functors with target category arising from composing with eg homology or from taking connected components.
2.3.3. Component categories
Going one step further, one may form from a category with a subcategory a quotient category together with a quotient functor sending morphisms in to identities and such that a functor factors uniquely through if and only if it sends all -morphisms to identities [2, 10]. The quotient category has as objects the path components of -objects with respect to paths arising by composing morphism in and . Morphisms in the quotient category are represented by morphisms in the category , ie by concatenations of morphisms in the original category and inverses of -morphisms. Representatives can be composed if just their target, resp. source are situated in the same component (plug in an arbitrary -morphism to obtain a morphism representing the composition); cf eg [2, 10] for details. In particular, every -morphism in represents an identity in the component category .
By the universal properties, the quotient functor factors over the localization functor giving rise to a functor . This functor is not always an equivalence of categories; it is so if is loop-free, ie if it contains only identities as endomorphisms; cf [16, 10].
2.3.4. Pair component categories
Since objects are interpreted as path components, we will use the notation for relevant categories of pairs in our context.
In the following, we describe a number of interesting pair component categories; in all of them, pairs and in give rise to the same object (then called component) if and only if there exists a zig-zag of -morphisms. For , those are induced by zig-zags of psp homotopies flows joining them. We will call the components in these categories future, past, neutral resp. total components.
By far the most important pair component categories arise as categories of components with and . As discussed above, objects (components) correspond to path components among reachable pairs along psp homotopy flows. Extension morphisms are identified if equivalent up to an inessential endo-d-map. The key relations go back to (2.3) and (2.4) – for – in Section 2.1.5:
For an inessential endo-d-map on and d-homotopy classes , the morphisms and represent the same morphism in the component category. Likewise, cf Lemma 2.8.2, morphisms arise from morphisms under .
In the remaining part of the paper, we will use the shorter notation , , for the future, past, neutral resp. total pair component categories. Inclusion induces functors
[TABLE]
These are onto on objects and, since every morphism arises from an extension, full on morphisms.
For and , the quotient category is the naive category of homotopy types. By the universal property characterizing quotient categories, the functors factors to give rise to functors from to this category of homotopy types. Likewise for and consisting of bijections; or and consisting of isomorphisms.
Remark*.*
There are several variations on this theme that we are not going to follow up:
- (1)
The full category with the same subcategories ; resulting in a pair component with the same objects as above but with an additional “action” of essential endo-d-maps (the quotient of morphisms in with respect to and its inverses; see 3) below). 2. (2)
In both cases: Pair component categories with departure the extension category of the trace category instead of that of the fundamental category. 3. (3)
Forgetting extensions, and considering , morphisms given by an endo d-map and its compositions and with an inessential such map are identified in the quotient category.
3. Properties of homotopy flows and components
3.1. Components are path-connected
Any homotopy flow on a d-space yields, when restricted to a point or a pair of points, a path connecting the ends. This elementary observation implies:
Lemma 3.1**.**
Any component is path-connected. For , two elements of the same component can be connected by a zig-zag of (pairs of) d-paths.
3.2. Future components are future connected
The following definition adapts similar ones from [8, 25] to the pair setting:
Definition 3.2**.**
A subset is called future connected if, for any two pairs , there exist and d-paths such that for all , .
Past connectivity is defined similarly. We omit the decoration .
Proposition 3.3**.**
Future components are future connected. Past components are past connected. Total components are both.
Proof.
We give a proof of future connectivity; the other cases follow by considering the reverse directed space. There are essentially two zig/zag situations to consider (arrows indicate -psp homotopy flows by their restrictions to pairs of points):
[TABLE]
In the case on the left, the d-paths joining with within can be chosen as restrictions of and to .
In the case on the right, there is a psp homotopy flow with and a psp d-homotopy flow with . In the notation from Section 2.2.1, let and . The dipaths connect with within . The dipaths connect with within .
The general zig-zag situation follows by an inductive argument. ∎
3.3. Regions fixed by (psp) homotopy flows
3.3.1. Pre-cubical sets. Cubical complexes
Definition 3.4**.**
- (1)
A pre-cubical set (also called a -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)
The geometric realization of a pre-cubical set is the d-space
[TABLE]
with and (resp. ) for (resp. ). 3. (3)
A path is directed if there are , cubes and directed paths with for .
Pre-cubical sets are the underlying structure of a Higher-Dimensional Automaton [20, 13, 14, 10]; those have moreover a coherent labelling of the 1-cubes. In this section, we consider homotopy flows on the geometric realization of a pre-cubical set , also called a cubical complex. We will often just write for .
3.3.2. Homotopy flows and components
Let denote a subset of a d-space . Its past consists of all elements in that can reach an element in . Its future consists of all elements in that can be reached from an element in . Both contain .
A cube in a finite dimensional cubical complex is called a future branch cube, resp. a past branch cube [23] if there exist more than one maximal cube containing it as a bottom boundary cube (iterated ), resp. top boundary cube (iterated ).
Proposition 3.5**.**
- (1)
For every (neutral) homotopy flow on and every future branch cube there exists such that . 2. (2)
For every (neutral) homotopy flow on and every past branch cube there exists such that . 3. (3)
A future (resp. past) homotopy flow on preserves future (resp. past) branch cubes.
Proof.
- Let , the union of all cubes that have as a lower face. For every homotopy flow on , since is compact, there exists such that . Assume there exists and such that for for a cube containing as a lower face. Let denote a maximal cube containing but not as a lower face. Let be contained in ; we assume without restriction that occupies the first coordinates. Observe that there exists a d-path from to . The d-path starts in and ends in which is contained in for small . Contradiction!
- (1)
The same reasoning applied to the reverse d-structur on (d-paths replaced by reverse d-paths) yields the result for past branch cubes. 3. (2)
is an immediate consequence of 1. and 2.
∎
The following result is straightforward; it turns out to be very useful in Section 4:
Lemma 3.6**.**
Let denote a subspace of a d-space .
- (1)
A d-map (resp. a dihomotopy ) that keeps invariant (, resp. ), keeps also invariant its closure , its past and its future . 2. (2)
A future (resp. past) homotopy flow keeping invariant keeps also invariant the complement of its past (resp. the complement () of its future. 3. (3)
Intersections of invariant sets are invariant.
Corollary 3.7**.**
- (1)
Any future (resp. past) homotopy flow fixes a future (resp. past) branch point (=[math]-cell) . 2. (2)
Any future homotopy flow preserves the past of a future branch point and its complement . 3. (3)
Any past homotopy flow preserves the future of a past branch point and its complement . 4. (4)
For any disjoint collections of future branch points, any future homotopy flow preserves subsets of the form 5. (5)
Similarly for past homotopy flows and collections of past branch points.
For , divide the set of all future branch points into the set containing all those in and into containing the remaining ones. Let
[TABLE]
Obviously, . Intersections over empty sets are interpreted as the entire space ; in particular, if . Observe that the relation defined by is an equivalence relation on . If , then is obviously path-connected.
As an immediate consequence of Corollary 3.7(4-5), we obtain:
Corollary 3.9**.**
Let denote a future component, ie an object in . Let denote one of the two projections, and let .
If , then .
Similar statements apply to past components whose projections are contained in similarly defined sets and to total components whose projections are contained in sets .
Remark that we did not need a psp-property (preservation of path spaces) for the result in Corollary 3.9.
3.3.3. Psp homotopy flows and components
The following property is an immediate consequence of the definitions (for a general d-space ):
Lemma 3.10**.**
If two pairs and belong to the same pair component in , then
- (1)
* and are -equivalent (ie (weakly) homotopy equivalent, homology equivalent ).* 2. (2)
Furthermore, there exist paths and in connecting with resp. with such that are all -equivalent. For , these paths can be chosen as zig-zags of d-paths.
The following easy observation is useful for many examples and replaces lr-conditions on left/right extensions [8, 16], also called Ore conditions in [3]:
Lemma 3.11**.**
*Let denote a future -psp homotopy flow, . For every with there exists with such that and are contained in the same -component.
Similarly for past -psp homotopy flows.*
Proof.
The -psp property of makes sure that and, in particular, is an -equivalence. ∎
3.4. Products
Let denote d-spaces; we will consider our constructs for their product, the d-space . There are natural homeomorphisms fibered over , giving rise to natural homeomorphisms on all fibers, . Hence the extension category is naturally isomorphic to ; likewise to .
A pair of endo-d-maps, on and on , defines the endo-d-map on . If the maps are -psp, then so is . But not every (psp) d-map on is a product. In general, the inclusion of product maps induces monomorphisms and likewise . After localization and quotient formation, one obtains from the isomorphism of categories above:
Proposition 3.12**.**
The quotient functor
[TABLE]
is onto on objects and full on morphisms.
4. Examples
In this section, we walk through a number of simple, but key examples for which it is possible to determine pair component categories by elementary considerations.
4.1. Intervals and hyperrectangles
4.1.1. An interval
Let denote an interval; it may be (half-)open or closed, bounded or unbounded. All trace spaces , , are contractible, and hence any endo-d-map on is automatically psp. Moreover, any two endo-d-maps are psp-d-homotopic to and to – by convex combination. In particular, they are all inessential with respect to every choice of and . In fact, the space of endo-d-maps on is contractible.
For every two pairs , with there exists an endo-d-map with , for example a piecewise linear map with , and . Hence, any two pairs are contained in the same (unique) component, and the pair component category is the trivial category with one object and one (identity) morphism – for every choice of and .
4.1.2. Hyperrectangles and generalizations
A hyperrectangle is a finite product of intervals. It follows from Proposition 3.12 that also the pair component category is the trivial category with one object and one (identity) morphism.
Using the same reasoning as in Section 4.1.1, one can show that pair component categories are trivial, more generally, for subspaces satisfying the following property: For every pair , the lines connecting and with , resp. with are contained in .
4.2. Directed graphs
4.2.1. A branching
A future branching graph is the pre-cubical set consisting of two 1-cubes and and three 0-cubes and . Its geometric realizaton is homeomorphic to the subspace with induced directed topology. All non-trivial path spaces are contractible. Any future homotopy flow has to fix the only future branch point, ie the origin (equal to its own past ) as well as the path components of its complement (cf Corollary 3.7.4 and Lemma 3.1) and ; note that is automatically psp. It is elementary to see that the future pair category (suppressing identities, and regardless of ) of the form
[TABLE]
Each arrow represents a well-defined morphism (+ represented by an extension in the future, - by an extension in the past). This category is isomorphic to the extension category of the (poset) category with three objects and non-reversible relations given by and .
For the past pair component category, note that every reachable pair of points can be connected with the pair by a past psp homotopy flow. Hence the past pair category is the trivial category with one object and one identity morphism.
The total pair category coincides with the future past category, the neutral pair category is also trivial.
4.2.2. Particular directed graphs
We will consider a directed graph (a one-dimensional pre-cubical set), with the property that there is at most one directed path between two vertices. Morphisms are thus either empty or singletons, and this gives rise to a partial order on the vertices. Restrict this partial order to the (future) branch points (out-degree ). For every branch point , consider the subgraph ; moreover the path-components of ; the latter correspond to top branches not including any branch point.
Lemma 4.1**.**
The future components (objects of the future pair component category ) are products of subgraphs of the form
- •
* for *
- •
* if is reachable from , or*
- •
.
Morphisms are inherited from the partial order on the branch points.
Proof.
It follows from Corollary 3.9 that a component must be contained in one of the products of subgraphs described above. On the other hand, any pair of points can be connected by a future homotopy flow (which is automatically psp) with fixing the complement of . Likewise any pair of points can be connected by a zig-zag of future homotopy flows with any other pair in . ∎
A similar result identifies past pair components (objects in ) with products of subgraphs between past branch points or of bottom branches. For total pair components (objects in ), both future and past branch points, top branches and bottom branches have to be taken into account.
For the neutral pair components (objects in ), Proposition 3.5 tells us: Factors of components arise as subgraphs arising as zig-zags of d-paths between branch-points and connecting a past branch point with a future branch point (no intermediate future branch point) or connecting a future branch point with a past branch point (no intermediate past branch point) by a reverse d-path. Top branches and bottom branches are identified with a branch point and do not give rise to components.
Example 4.2**.**
The directed graph representing the letter has one future branch vertex and two past ones. has two path components, and has five pair components. has three path components; taking reachable pairs among the two branch vertices and these components leads to nine components in . For the total pair component category, , the three branch points and the four components of the complement stay invariant; this results in 15 pair components. The neutral pair component category is trivial.
It is more complicated to determine components for graphs with several directed paths between certain pairs of vertices (thus including non-directed loops). For a simple example, consult Section 4.3.1 below.
4.3. Simple cubical complexes without directed loops
4.3.1. Boundary of a square
We consider the boundary of the 2-cube . Its geometric realization decomposes into and ; we wish to show that its component category is given by
{B_{1}B_{1}}$${AB_{1}}$${B_{1}C}$${AA}$${AC}$${CC}$${AB_{2}}$${B_{2}C}$${B_{2}B_{2}}$$\scriptstyle{-}$$\scriptstyle{+}$$\scriptstyle{{\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}+}}$$\scriptstyle{{\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}-}}$$\scriptstyle{+}$$\scriptstyle{+}$$\scriptstyle{-}$$\scriptstyle{-}$$\scriptstyle{{\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}+}}$$\scriptstyle{{\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}-}}$$\scriptstyle{-}$$\scriptstyle{+}
The path space consists of two contractible components; all other non-empty path spaces are contractible. In particular, every psp-homotopy flow preserves both and and their complement . The sets and are not connected to each other. By Lemma 3.1.2, no component can contain sources, resp. targets from more than one – since projections of connected spaces are connected.
As a consequence, there are three one element components and . All other components are contained in . It is easy to find a (one-zig one-zag) psp homotopy flow connecting pairs within the given regions; for a formal justification, cf Section 5.
Morphisms that can be represented by future (resp. past) extensions are marked with (resp. ). A mark is in red if the extension (with target ) does not cover a homotopy equivalence of path spaces. The left square marked with and the right square marked with do not commute; the mixed top and bottom squares do. Not surprisingly, this category is (isomorphic to) the extension category of the graph category on a directed graph with vertices and directed arrows from to and from to .
For , the past pair component category and also the total pair component category are isomorphic to the future pair component category : is d-homeomorphic to the space with the reverse d-path structure. Finally, also the neutral pair category yields the same result: A neutral psp-homotopy flow has to preserve the pair and hence and ; the rest of the argument is as above.
The d-space with directed intervals (ie a square from which a minor square has been deleted, arising as model of a very simple HDA modeling mutual exclusion) yields the same results for the pair component categories. For the neutral category (), one may use the following argument by comparison: Consider a piecewise linear d-map with . Then is a psp map from into leaving pointwise fix, and is d-homeomorphic to . Convex combination of and defines a neutral psp d-homotopy between these two maps, fixing pointwise, and thus exhibits as a directed deformation retract of - with isomorphic neutral pair component category.
The deformation retraction above is not given by a future nor by a past d-homotopy. But it is not difficult to check that the pair component categories are all mutually isomorphic.
4.3.2. Swiss flag
The “Swiss flag” is an HDA that arises as a model for two processes only interacting via capacity one semaphores [9, 10]. It can be described by a Euclidean cubical complex (cf Section 5.4), a pre-cubical set whose geometric realization can be embedded into a “cubical plane”, including a deadlock – only constant paths with that source, a “doomed region” - every d-path starting in cannot leave - and an unreachable region . It has a directed deformation retract [3] given by the directed graph
[TABLE]
with two additional 2-cubes and glued in – with vertices at , resp. . The geometric realization of this 2-complex will be called .
and represent the only future branch points in . The intersection of their pasts is given by the vertex . The intersection of the past of one of them with the complement of the other’s are the half-open 1-cells (including , excluding ). The intersection of their complements has two connected components: one of them is the complement of the entire 2-cell ; the other consists of apart from the entire two lower 1-cells (corresponding to the doomed region). All of these subspaces are preserved by any future d-homotopy flow by Corollary 3.7.
The pair is the only one representing a non-trivial path space. Hence, as in 4.3.1, none of the other areas can be moved into by a psp future homotopy flow. As a consequence, no point in can be connected to a point on by a psp-future homotopy flow, since such a d-homotopy would move points on into ; and similarly when exchanging and . Somewhat surprisingly, a psp future homotopy flow can “discover” the unreachable region, ie apart from its upper 1-cells.. The resulting future pair component category of the “Swiss flag” does not give rise to further compression; it is the extension category of
[TABLE]
where are half-open 1-cells, and contain only upper, resp. lower boundaries, and the lower und upper squares commute.
A similar procedure applies for the past pair component category : just align with instead of . For the total pair component category , the (interiors of) the 1-cells give rise to separate components. For the neutral pair component category , the areas form one component.
4.3.3. Matchbox
The matchbox was discussed in [6] and has been a test case for various constructs concerning homological constructions. It can be represented as the boundary of a 3-box from which the interior of a lower face has been removed. An equivalent description is given as the product of with an additional 2-cell glued in at the top. We will use the latter representation and we will reuse notation from Section 4.3.1 concerning in the following sense: Components from that case are replaced by their products with the half-open interval – and path spaces have the same homotopy types as for . In particular, only the pair represents homotopy type ; all other pairs in the component category correspond to contractible path spaces. Nevertheless, compared to , the (entire) cell gives rise to additional components : There is no psp homotopy flow connecting a point from the complement of with itself: such a homotopy flow would push a path from to (corresponding to a non-contratible path space) to a path with target in – with a contractible path space.
As a consequence, additional components and need to be added to the component categories of from Section 4.3.1, with obvious extension morphisms relating them to the other components and to each other.
4.3.4. Cubical “spheres” in higher dimensions
A cube in the cubical decomposition of the boundary of an -box (the “cubical -sphere”) corresponds to an -tupel with , and . These -tuples are partially ordered by the product order arising from apart from . Let denote the category representing that partial order (with objects). Remark that can be obtained as a directed deformation retract of the Euclidean complex . Hence, as will be shown in Section 5.4, products of (reachable) open subcubes will be contained in the same component.
The homotopy types of trace spaces in were determined by Ziemiański [25]: For -tuples , let (where we replace with ). Let denote the cardinality of the set .
Lemma 4.5**.**
[25]* Let . Then trace space is contractible if there exists with , and homotopy equivalent to a sphere of dimension otherwise.*
Proposition 4.6**.**
For , the component categories all agree with the extension category of the partial order category .
Proof.
The proof relies entirely on properties of (psp) homotopy flows established in Section 3.
- (1)
For , a (neutral) psp homotopy flow leaves cells of the form , resp. (regardless of the order of the coordinates) invariant; moreover, also their closures and complements. In fact, Lemma 4.5 shows that leaving one or both of the cells to the future (or the past) changes the homotopy type of . Apply Lemma 3.1 and Lemma 3.10. 2. (2)
Now consider and a cell of type : From 1. above and Corollary 3.7, we conclude that every psp future homotopy flow leaves the set invariant (with ). This intersection is equal to the union of all cubes with no -coordinate at all (here we use !). But each cell of type is a maximal cube in that set with respect to the partial order. All cubes below are of type and are thus invariant; cf 1. above. Hence is so, as well.
A cell of type cannot be connected by a future psp flow with any of the (invariant) cubes in its future. Assume there is a psp future homotopy flow connecting one of the lower boundary cubes with . Then, using Lemma 3.11, would connect a cell of type with one of the invariant cells . Contradiction! 3. (3)
Now consider cubes of type . Then is contained in the closure of a cube of type (invariant by (1) and (2) above). We conclude from Lemma 3.6 that a psp future homotopy flow departing will end in a cube of type . If , then Lemma 3.11 tells us that would connect a cube of type (invariant by 1. and 2. above) with a different cube. Contradiction!
Likewise, a vertex of type does not leave under a psp homotopy flow with . If so, it would have to end in a cube of type . Lemma 3.11 implies that the same psp homotopy connects a “complementary” cube of type with a cube of type . This contradicts (1) and (2) above. 4. (4)
Since all cubes of the types considered in (3) above are invariant under a psp homotopy flow, none of them can be reached from another cube under a psp homotopy flow departing from a different cube in its past.
For past pair components, one may apply similar arguments - or consider the reverse d-space that is d-homeomorphic to the original one: Just exchange [math] s and s! ∎
Remark that the components in this case correspond to products of reachable components of the fundamental category considered in [8] (for and for Ziemiański’s stable components [25].
4.4. Spaces with directed loops
4.4.1. Directed circle
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 . All trace spaces , are homotopy equivalent to the discrete space indexed by the non-negative integers .
A directed degree one map homotopic to the identity induces a homotopy equivalence on all trace spaces if and only if it is a directed homeomorphism: Since , it is onto. Assume for . One of the counter-clockwise arcs from to , resp. from to maps to a constant path, the other (without restriction the one from to ), to a d-path from to itself with winding number one. But then misses the component given by constant maps!
For every two elements , there is a future psp homotopy flow of counter-clockwise rotations (hence directed homeomorphisms) with . As a result, all pairs on the diagonal are contained in the same component. The diagonal is of course invariant under any map. On the other hand, we have just seen that no pair in the complement can be connected to an element on the diagonal by a psp d-map (a homeomorphism!).
Let denote two pairs in the complement of the diagonal. After a rotation, we may assume that . There is a directed homeomorphism (image of a piecewise linear map on under the exponential map) that fixes and maps into or into .
As a result, the future pair category of has two objects given by the diagonal and its complement . Endomorphisms on both objects correspond to the non-negative integers . The morphisms correspond to , as well, whereas corresponds to the positive integers ; composition corresponds to addition. Note that and are not isomorphic!
All other pair component categories are isomorphic among each other.
Remark*.*
- (1)
The result for the directed circle is slightly different from the one obtained in [21] where we departed from the extension category of the fundamental category and localized weakly invertible extensions instead of d-maps. 2. (2)
Remark, that the pair component category does distinguish between a directed interval (Section 4.1.1) and the directed circle .
4.4.2. Directed torus
Now consider the directed -torus . All trace spaces are homotopy equivalent to a discrete space indexed by . Let us again verify that a psp-d-map homotopic to the identity is necessarily a homeomorphism. It must be onto since it preserves the fundamental homology class. Assume for . Consider a d-path in from via to of -degree if and if . The two pieces map under to paths of multidegree , each; note that . The maps and have as image subsets whose homotopy types correspond to , resp. . They cannot both be surjective, ie have image all homotopy types corresponding to .
Proposition 4.7**.**
The pair component category is isomorphic to the product This is a category with objects in the set . If one lets correspond to [math] and to , and hence an object to a bit vector , then is a product of factors and . A factor corresponds to exactly for pairs . Composition corresponds to coordinatewise addition.
Proof.
According to Proposition 3.12, we need only show that the quotient functor from the product is injective on objects, as well. To achieve this, we will show that every inessential d-map is a product of d-homeomorphisms , ie :
Let denote an inessential d-map with and , and . (If we had an inessential map relating these pairs in the reverse direction, we may consider since has to be a directed homeomorphism). After a coordinatewise rotation, we may assume that – and . Let denote a d-path from to , constant in the first variable. Consider the induced diagram of trace spaces
[TABLE]
The image of the lower extension map contains loops of multidegree . The image of the upper extension map map can only contain loops of multidegree with . This contradicts the fact that an endo map on that is homotopic to the identity has to preserve multidegrees. ∎
Remark*.*
In contrast to what happens to previously considered component categories of the fundamental category ([8, 16]), this example shows that localized and component categories constructed from pair categories by localizing the effects of psp-d-maps make sense also for d-spaces with non-trivial directed loops.
We postpone the investigation of the pair component categories for the d-space corresponding to Dubut’s example to Section 5.5.
5. Pre-cubical sets and order pair components
In general, it seems to be hard to determine the pair component categories introduced in Section 2.3.4 algorithmically. For pre-cubical sets, cf Section 3.3.1, we will now define and describe a related finer component category that arises by inverting fewer morphisms and that is easier to comprehend and to determine.
5.1. Interval induced maps on a pre-cubical set
The following construction is essentially contained in [25]: Let denote a reparametrization of the unit interval , i.e, a non-decreasing and surjective continuous map. All such reparametrizations form a convex and hence contractible space (in the topology inherited from the compact-open topology). The homeomorphisms within the reparametrizations (the strictly increasing ones) form likewise a convex and hence contractible subspace. Particular reparametrizations are of future type if for all , resp. of past type if . Algebraically, interval reparametrizations form a monoid under composition (with those of future, resp. past type as submonoid) and homeomorphisms form a group (with subgroups of future, resp. past type).
Consider a pre-cubical set . Every interval reparametrization can be used to construct an endo-d-map on the geometric realization defined by . By definition, is a cube-preserving map. It is well-defined with respect to the boundary relations on ; for this to be true, in general, it is necessary to use the same reparametrization on each coordinate.
An endo-d-map in will be called interval induced if it can be described as for a suitable interval reparametrization .
Remark*.*
- (1)
For a Euclidean complex, cf Section 5.4, one may be less careful and select different reparametrizations for each of the coordinates. 2. (2)
If is a homeomorphic d-map with inverse , then and are inverse homeomophic endo-d-maps. 3. (3)
It is clear that the interval induced endo-d-maps on form a submonoid of the monoid of all endo-d-maps; the interval induced endo-d-homeomorphisms on form a subgroup of the group of all endo-d-homeomorphisms.
Lemma 5.1**.**
An interval induced endo-d-map induced by an interval homeomorphism is neutrally inessential. If it is of future type (resp. past type), it is future (resp. past) inessential: .
Proof.
A linear reparametrization homotopy arises by convex combination of the identity map and the chosen reparametrization . It consists of d-maps , and it is an increasing/decreasing homotopy (in the -variable) if is of future, resp. of past type. The homotopy induces the homotopy flow given by on ending at .
If is a homeomorphism (ie injective), it induces a neutral, future, resp. a past homotopy flow that consists of d-homeomorphisms; in particular, of homotopy equivalences. Each induced map induces thus homeomorphisms on path and trace spaces (with the map induced by the inverse homeomorphism as inverse). Hence it is -inessential. ∎
Question. Is the statement in Lemma 5.1 true for general interval induced endo-d-maps?
Like in Section 2.3.4, the monoid of -interval induced d-homeomorphisms on , , gives rise to wide subcategories (same pair objects) resp. . In the remaining part of the paper, we will focus on the localized category and the (pair) component category, denoted .
The inclusion of inverted subcategories gives rise to quotient functors
between localized categories resp. between quotient categories. In the following, we will show that, for a finite pre-cubical set , the “finer” category has finitely many objects and conclude that this also holds for the pair component categories .
5.2. Order equivalence and order pair components
Definition 5.2**.**
- (1)
Two vectors are called order equivalent if and only if for all and . 2. (2)
Let . The pairs and are called order equivalent if and only if the vectors and are order equivalent.
Lemma 5.3**.**
- (1)
Two vectors are order equivalent if and only if there exists a d-homeomorphism with . 2. (2)
Let denote a pre-cubical set with an -cell and an -cell . Let such that and are order equivalent. Then there exists an interval induced endo-d-homeomorphism with and .
Proof.
A d-homeomorphism produces clearly order equivalent vectors and . Given order equivalent vectors , one may choose a piecewise linear d-homeomorphism with . (2) follows from (1). ∎
The following lemma concerning least upper bounds resp. greatest lower bounds is straightforward:
Lemma 5.4**.**
If two pairs and are order equivalent, then they are both order equivalent to their least upper bounds and greatest lower bounds , as well. As a consequence
- (1)
There exists a -zig-zag morphism . 2. (2)
There exists a -zig-zag-morphism .
Proposition 5.5**.**
Let denote a pre-cubical set with an -cell and an -cell . Let and .
- (1)
If the pairs and are order equivalent, then the pairs and are situated in the same component in for all and hence also in , for all and . In particular, and are homeomorphic and thus homotopy equivalent. 2. (2)
If the pairs and are contained in the same component object in the component category , then and are order equivalent. 3. (3)
The order pair categories , agree and will be denoted just by .
Proof.
This follows immediately from Lemma 5.3 and Lemma 5.4. ∎
5.3. Order subdivisions and the order pair component category
Proposition 5.5 allows to give fairly explicit descriptions of the order pair category of a pre-cubical set : A cube subdivides into -simplices given by inequalities ; there are such simplices. All possible order relations between coordinates arise by replacing by either or by ; each replacement (ie each ordered partition) gives rise to interiors of subsimplices of this subdivision. If , inclusions , resp. induce simplicial projections resp. (by restriction of a partition to , resp. coordinates).
To get hold on an object in the order pair category of , you need to fix a pair of cubes and the interior of a subsimplex of the simplicial subdivision of just described. Furthermore, you need to make sure that there exist such that . By Proposition 5.5, this condition is independent of the choice of base points in ; for example, one may choose the barycenters of each subsimplex . But beware: These do, in general, not agree with the pair of barycentres of its projections within , resp. .
Future (extension) morphisms from to are determined by for and ; well-determined up to natural homeomorphisms by Lemma 5.4. Composition of future morphisms arises from composition in the fundamental category between matching representatives; you may have to change base point pairs by an element of before representatives match! Similarly for past morphisms.
Remark*.*
The path space between two points in the same cube is contractible or empty; this is in particular true for path spaces between barycenters of a subdivision simplex and a boundary simplex. Hence, there is at most one morphism between neighbouring cells given by an extension morphism contained in these two cells.
By construction, the functor from Section 2.1.3 extends to ; its restriction to (analogous to the construction in Section 2.3.1) factors over the quotient category . The quotient functors , , from Section 5.1 are all surjective on objects and full; but rarely faithful.
For a finite-dimensional pre-cubical set , the order pair component can be “over-approximated” by a discrete full subcategory of : For an -dimensional complex , we choose as objects all pairs such that all coordinates of and of are fractions . This choice ensures that every subsimplex contains at least one such pair. The projection functor from the arising subcategory of into is onto on objects and fully faithful, hence an equivalence of categories. Using Remark Remark for (2) below, we conclude:
Corollary 5.6**.**
Let denote a finite pre-cubical set.
- (1)
and thus all pair component categories have finitely many objects. 2. (2)
If does not admit any non-trivial directed loops, then all the above mentioned categories have finite sets of morphisms.
5.4. Euclidean cubical complexes
With the lattice of integer vectors as vertices, one forms an infinite pre-cubical set whose geometric realization is . Every subcomplex of that complex is called a Euclidean cubical complex. By definition, such a Euclidean complex admits only trivial directed loops.
Definition 5.7**.**
- (1)
Two elements will be called cube-equivalent if there exists a cube such that are both contained in the interior of . 2. (2)
A d-map with for every , is called cube-preserving. 3. (3)
If (resp. , is said of future type, resp. of past type. 4. (4)
A cube-preserving d-map restricts to a cellular endo-d-map from every subcomplex into itself. These cube-preserving maps form, when restricted to , a (contractible!) monoid. Those of future (resp. past) type form contractible submonoids .
Proposition 5.8**.**
Let denote a Euclidean cubical complex. Any cube preserving d-map of future type (resp. of past type) is (resp. ) inessential.
Proof.
Cellwise convex combination between and defines a homotopy flow such that every d-map is cube-preserving, as well. It is a future (resp. past) homotopy flow if is of future (resp. past) type. It is therefore enough to show that an cube-preserving map is -psp; we do that for :
According to Remark Remark.5 (cf also [21, (5.3)]), the diagram
[TABLE]
is homotopy commutative for . Hence it is enough to show that for every and every d-path
- (1)
from to between cube-related elements, the map 2. (2)
from to between cube-related elements, the map
are homotopy equivalences. (The construction makes uses of paths instead of traces, but the naturalization map between traces and d-paths in Euclidean complexes from [22] is a homotopy equivalence.) We prove 1. above; the proof of 2. is similar.
A map is constructed by assigning to the d-path , ie . Since and are cube-related, and are, for every , contained in the same subcube of , and hence is a d-path in .
The composition \textstyle{\vec{P}(X)_{{\mathbf{x}}}^{{\mathbf{y}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{*\sigma}$$\textstyle{\vec{P}(X)_{{\mathbf{x}}}^{{\mathbf{y}}^{\prime}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{M^{{\mathbf{y}}}}$$\textstyle{\vec{P}(X)_{{\mathbf{x}}}^{{\mathbf{y}}}} assigns to the path , which is homotopic to the identity map.
For , let denote the d-path from to . We consider the homotopy
\textstyle{\vec{P}(X)_{{\mathbf{x}}}^{{\mathbf{y}}^{\prime}}\times I\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{M^{\sigma(s)}}$$\textstyle{\vec{P}(X)_{{\mathbf{x}}}^{\sigma(s)}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{*\sigma^{s}}$$\textstyle{\vec{P}(X)_{{\mathbf{x}}}^{{\mathbf{y}}^{\prime}}} (with parameter ); it deforms the map – for – into – for . The latter map sends into , and it is homotopic to the identity map on . ∎
Proceeding as in Section 5.1, the monoids from Definition 5.7 give rise to wide subcategories . We can form the localized categories , their quotient categories and, using Proposition 5.8, quotient functors into , at least for .
Proposition 5.5 has the following (far simpler) analogue for Euclidean cubical complexes:
Proposition 5.9**.**
Let denote a Euclidean complex and let .
- (1)
If and are cube equivalent, then and are situated in the same component in . In particular, and are homotopy equivalent. 2. (2)
If the pairs and are situated in the same component object in the component category , then and are cube equivalent. 3. (3)
The pair categories , agree and will be denoted just by . There are quotient functors for all .
For the proof of Proposition 5.9, we need the following lemma. We will write if they are contained in the same component; here for . We shall write if for all .
Lemma 5.10**.**
- (1)
Let be cube-related and . Let .
Then . 2. (2)
Let be cube-related, . Then .
Proof.
of Lemma 5.10: To show (1), we construct a cube-preserving d-map (of future type) with and as product of piecewise linear d-maps , given by
[TABLE]
by assumption . To show (2), a similarly constructed cube-preserving d-map fixes and sends into . ∎
Proof.
of Proposition 5.9:
- (1)
Choose in the interior of the same cell as and in the same cell as . According to Lemma 5.10, we obtain the following chain of equivalences:
.
A similar construction works for . 2. (2)
is obvious, since d-maps in preserve (interiors of) cubes. 3. (3)
follows from (1) and (2).
∎
Corollary 5.11**.**
Let denote a Euclidean cubical complex.
- (1)
Components in can be indexed by reachable pairs of cubes . 2. (2)
The category is isomorphic to the full subcategory of the objects of which are the pairs of barycenters of reachable cubes. 3. (3)
Components in each of the categories are unions of such pairs. 4. (4)
The categories and hence have finitely many objects and morphisms.
Remark*.*
Contrary to what happens for general cubical complexes, for Euclidean cubical complexes we can, as in the proof of Proposition 5.9, construct inessential endo-d-maps fixing just one of the end points and leading to inessential extension morphisms; compare Lemma 2.7.4. This is the reason why, for these complexes, it may be unecessary to distinguish between effects of inessential d-maps and of inessential extensions, as they were used in previous work on component categories [8, 16].
5.5. Dubut’s example revisited
Finally, we analyze component categories in the case of the cubical complex from Section 1.2, which is not a Euclidean complex. Nevertheless, some of the tools from the preceeding sections come in helpful. It turns out that in this case, the -inessential d-maps have a quite specific form that we deduce for : For that purpose, we have to consider a more precise decomposition of the space . Using natural homeomorphisms identifying the four 2-cells with , we define:
- (1)
; 2. (2)
; ; 3. (3)
; 4. (4)
; ; 5. (5)
; ; 6. (6)
; ; ; 7. (7)
.
Proposition 5.12**.**
A -inessential d-map has the following properties:
- (1)
* preserves .* 2. (2)
The restrictions of to and to agree, ie
. 3. (3)
On , resp. on , is a product map for suitable d-maps that satisfy . 4. (4)
These d-maps are d-homeomorphisms for some . 5. (5)
*There are d-maps , with and such that *
* and with as in (3).* 6. (6)
* preserves .*
Proof.
- (1)
The vertex is a future branch point. By Corollary 3.7.1, both that point, its past and the complement of are preserved. Moreover, preserves and . Also the subsets and are equal to their own future. 2. (2)
For a chosen point , we consider the set of all points in its past
and decompose it according to whether belongs to
**: **
=. For , trace space has two path components.
**: **
=. For , trace space is path-connected; all paths in it intersect , but not .
**: **
=. For , trace space is path-connected; all paths in it intersect , but not .
Let . Since is a psp d-map, its restriction to must map into By continuity, it maps the one point set into 3. (3)
The horizontal d-path from to through maps under to the horizontal d-path from to through ; in particular, for . Likewise for using vertical d-paths through . The existence of a future d-homotopy from to requires . 4. (4)
By (1) above, . Let . Assume there exists with . Then, for every , the space has one component whereas has two. Hence cannot be psp.
Similarly for . 5. (5)
The second component of does not depend on and is equal to since
. 6. (6)
Since is a homeomorphism, it preserves the upper boundary and its complement.
∎
Like in Section 5.1, but now with a coherent prescribed order on the first and second coordinate, we may compare coordinates of start and end points by the relations . For example, a decoration indicates that the first coordinates of start and end point agree whereas the second coordinate of the start point is less than the second coordinate of the end point.
Proposition 5.13**.**
The pair component category has – independently of – objects of the form: Reachable pairs in
- (1)
* with decorations and ;* 2. (2)
; with decorations and in one coordinate; 3. (3)
; 4. (4)
* with decorations and ;* 5. (5)
; 6. (6)
; 7. (7)
* with decorations ;* 8. (8)
* with decorations ;* 9. (9)
* with decorations ;* 10. (10)
* and ;* 11. (11)
; 12. (12)
, with decorations and ; 13. (13)
; 14. (14)
; 15. (15)
* – no decorations;* 16. (16)
; 17. (17)
; 18. (18)
; 19. (19)
; 20. (20)
**
and the inherited extension morphisms.
Proof.
Most of the distinctions follow from the fact that is a product of homeomorphisms, hence points with non-equal coordinates cannot be identified with points with equal coordinates (unlike what may happen for a homotopy equivalence). In order to construct a psp-d-map establishing equivalence of pairs of points in one of the equivalence classes, one may choose and d-homeomorphisms with and use them to define the map on according to Proposition 5.12(2) -(4). To extend that map to the remaining cells, choose d-maps as in Proposition 5.12(5) and define on accordingly. A linear future d-homotopy connects with the resulting endo map on . In general, a zig-zag of such d-homotopies is needed.
It may be a bit surprising that decorations do not turn up in case (15). One may extend a map from Proposition 5.12(4) to d-maps (for the first coordinate on , resp. the second on ); this map needs only be injective on . Using such maps, we establish that two pairs and are -equivalent as follows:
[TABLE]
This implies that all pairs in are equivalent to each other, and hence all pairs in case (15). ∎
Remark that inessential maps do not preserve all cells; hence has fewer component objects than , cf Section 5.4.
For , a similar case-by-case examination exhibits components of type with decorations; this time, start points in can be fused. For , the subsets cannot be fused with neither nor .
6. Conclusion and future work
6.1. Summary
Inessential homotopy flows and inessential d-maps yield a coherent framework for comparing path spaces with variable end points within a given directed space. Localizing their contribution to categories with pairs of points as objects transforms them into isomorphisms; this is justified since the trace space functor lets them correspond to isomorphisms in the homotopy category. The resulting quotient categories were shown to have finitely many (though often a huge number of) objects when the underlying directed space is a finite cubical complex, even if the space admits directed loops. In many examples, in particular for the example from Section 1.2 motivating this paper in the first place, the quotient categories retain essential information about dependence of the path/trace spaces on their end points in a compressed way.
6.2. Future work: Relations to other constructions
As the motivating example (Section 1.2) shows, previously studied component categories [8, 16, 10] do not always deliver categories with a countable number of objects, even when the directed space has the nice structure of a finite cubical complex. This paper advises a way to overcome this default - and making the constructions of so-called “Natural homology” [5] (and its precursor in [21]) applicable in this more general setting. In contrast to other approaches, at least in principle, the definitions are suitable also in cases where the space admits directed loops. This option has only been investigated in detail only in a few concrete cases in Section 4.4; further development is desirable.
Ziemiański found a different way to overcome the shortcomings of previous work on components by defining and investigating stable components [25] that partition the directed space itself (instead of the space of reachable pairs). Path spaces between pairs of points within two components are, in general, not invariant up to -equivalence, but they become so after a stabilization process based on a number of well-motivated axioms. Path spaces between points in a given pair of components may vary but they stabilize when allowing large enough targets (resp. small enough sources). The resulting stable components are easier to determine than ours. It would be interesting to find out whether the components in this paper can be produced by partitioning reachable pairs of Ziemiański’s stable components into smaller pieces.
In a different direction, it is a challenge to develop a directed version of Michael Farber’s topological complexity [12]. The definitions can easily be modified by requiring directed paths, but one needs a better understanding of the end point map and its partial sections. In the directed case, this map is, in general far from being a fibration, and the (Schwarz genus) methods from the classical theory are not available. First steps have been taken in [15]; relations to methods from this paper might be helpful in future developments.
6.3. Future work: Functoriality. Towards directed homotopy equivalences?
A d-map between two d-spaces does not give rise to any relation between the spaces of endo-d-maps and ; cf Section 2.1.4 for the notation. Instead, one needs a pair and of d-maps giving rise to the maps and . We need further properties allowing us to relate the “homotopy dynamics” on the two d-spaces:
Definition 6.1**.**
A pair of d-maps is called an -equivalence if there exist psp homotopy flows connecting with and connecting with .
In particular, for , the map is an ordinary weak homotopy equivalence.
Lemma 6.2**.**
*An -equivalence induces -equivalences
and .*
Proof.
The first two properties follow from the definitions. For the last claims, apply the 2-out-of-6 property for (our) -equivalences. ∎
It is tempting to call a d-map satisfying the requirements in Definition 6.1 a directed equivalence; and for - the (weak) homotopy equivalences - a directed (weak) homotopy equivalence. But this definition is still not quite satisfactory. It is not clear that this notion
- •
satisfies a 2-out-of-3-properties
- •
leaves directed topological complexity [15] invariant, and
- •
that it behaves well with respect to components.
The follow-up paper [24] responds to these challenges with an adjustement of Definition 6.1 as point of departure.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T. Borceux, Handbook of Categorial Algebra I: Basic Category Theory , Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge (1994).
- 2[2] M. Bednarczyk, A. Borzyskowski, and W. Pawlowski, Generalized congruences - epimorphisms in 𝒞 𝒞 \mathcal{C} at , Theory Appl. Categ. 5 (11), 266–280 (1999).
- 3[3] J. Dubut, Directed homotopy and homology theories for geometric models of true concurrency , Ph.d.-thesis, École normale supérieure Paris-Saclay (2017).
- 4[4] C. Calk, É. Goubault and Ph. Malbos, Time-reversal properties of concurrent systems , ar Xiv:1812.05062 (2018), Homology Homotopy Appl., to appear.
- 5[5] J. Dubut, É. Goubault and J. Goubault-Larrecq, Natural homology , in: Automata, languages, and programming. 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II, 171–183, Springer, Berlin (2015).
- 6[6] U. Fahrenberg, Directed homology , Electr. Notes Theoret. Comput. Sci. 100 , 111–125 (2004).
- 7[7] U. Fahrenberg and M. Raussen, Reparametrizations of continuous paths , J. Homotopy Relat. Struct. 2 (2), 93–117 (2007).
- 8[8] L. Fajstrup, M. Raussen, É. Goubault, and E. Haucourt, Components of the Fundamental Category , Appl. Categ. Struct. 12 (1), 81 – 108 (2004).
