The definition is to be understood from the point of view of space and quantity: a cubical set is a space characterized by the fact that and how it may be probed by mapping standard cellular cubes into it: the set assigned by a cubical set to the standard -cube is the set of -cubes in this space, hence the way of mapping a standard -cube into this spaces.
Being a functor , a cubical set also assigns maps between its sets of -cubes which determine in which way smaller cubes sit inside larger cubes.
The face maps go from sets of -dimensional cubes to the corresponding set of -dimensional cubes and can be thought of as sending each cube in the cubical set to one of its faces, for instance for the set of 2-cubes would be sent in four different ways by four different face maps to the set of -cubes, for instance one of the face maps would send
another one would send
On the other hand, the degeneracy maps go the other way round and send sets of -cubes to sets of -cubes by regarding an -cube as a degenerate or “thin” -cube in the various different ways that this is possible. For instance again for a degeneracy map may act by sending
Notice the -labels, which indicate that the edges and faces labeled by them are “thin” in much the same way as an identity morphism is thin (notice however that a cubical set by itself is not equipped with a notion of composition of cubes. If it were, we’d call it a cubical ω-category).
In an ordinary cubical set all degeneracy maps act in the kind of way depicted above. One might also want to require a cubical set to contain “thin” cells between equal adjacent faces. These extra degeneracy maps act by sending 1-cells to degenerate 2-cells of the form
If the cubical set has this additional property, one calls it a cubical set with connection.
”…the duality of bipointed sets, sets with two distinguished elements, and Boolean algebras without top or bottom. Contemplation of this duality, which Bill Lawvere suggested to me in a phone conversation as a simple construction of the theory of cubical sets”.
If so, given that the real interval is a final coalgebra on bipointed sets, is there some dual to it in cubical sets?
Also shouldn’t we have something on this page about Grandis’s use of cubical sets in directed algebraic topology, e.g., p. 3 ?
Todd Trimble: The passage from Pratt’s paper is a bit brief, but my impression is that they are discussing the Lawvere algebraic theory of two constants, which is a cartesian prop, and which contains more figures than the pro given by the monoidal category of cubes. In particular, there are diagonal maps in the cartesian prop which aren’t present in the category of cubes in the sense here (and which aren’t reflected as far as I can tell by cubical sets with connection). Perhaps we need some disambiguation then?
And please correct me if I’m wrong, but I believe the interval as final coalgebra is a coalgebra for the join-square endofunctor acting on the category of bipointed sets (where the two points are distinct). The condition that the two points are distinct is non-algebraic, so I can’t see a clear connection which would point to something dual in cubical sets in Pratt’s sense. But maybe there’s more going on than meets my eyes.
David Corfield: Thanks Todd. I think you’re right about Pratt’s work, see example 5 here. If his usage is at all prevalent, we should disambiguate. So, next question, which are Grandis’s cubical sets? He seems to be able to do some remarkable things with them, e.g., the link to noncommutative spaces in section 3 of this.
Todd Trimble: I believe Grandis is talking about cubes as we are here. His paper with Luca Mauri gives a rather thorough introduction to various categories of cubes (including, e.g., cubes with connections). The cartesian version doesn’t appear in that paper; I am guessing that most (all?) people who consider the category of cubes as Pratt does are in very close contact with Lawvere. The only items I found through google on this are one’s with Pratt’s name attached. But just to be on the safe side, I’ll write a brief note of disambiguation.
Daniel Kan’s early work on homotopy theory used cubical sets instead of simplicial sets. But then a bit later it was found that plain cubical sets suffer from three disadvantages when it comes to modelling homotopy n-types:
normalization of chains is essential
cubical groups are not automatically fibrant
It was then realized that none of these problems is shared by simplicial set:
Eilenberg and Mac Lane proved a normalisation theorem which may be found in Mac Lane’s book ‘Homology’.
These observations led to a widespread use of simplicial methods, while cubical methods coexisted only with a kind of underground existence, to this date.
There is, however, a proof of parts of the homotopy hypothesis also for cubical sets: their homotopy category is equivalent, after all, to the standard homotopy catgeory Top. This is described at model structure on cubical sets.
The first problem can’t be avoided. See
Rosa, Antolini and Bert Wiest, The singular cubical set of a topological space , Mathematical Proceedings of the Cambridge Philosophical Society, 126 (1), (1999)
A. P. Tonks, Cubical groups which are Kan, J. Pure Appl. Algebra, 81 (1), (1992)
the third problem is due to the fact that the cube category is a test category but not a strict test category. However, the category of cubes with connection is a strict test category, as shown by Georges Maltsiniotis, based on work by Denis-Charles Cisinski. See connection on a cubical set for details.
where is the unique (up to isomorphism) monoidal functor mapping the generating object to , and for , mapping to the inclusion . This is parallel to one way of defining the geometric realization of a simplicial set. Geometric realization is a functor left adjoint to the functor
which takes a space to the functor .
Rick Jardine constructed a cubical subdivision functor . It is an obvious subdivision of an -cube, which is just a product of barycentric subdivisions of intervals. The (functorial) subdivision of a cubical set is constructed from this naive subdivision of the -cube in the end. See Jardine’s lecture notes. for details. There is a natural sequence of maps of cubical sets
defined similar to its simplicial counterparts. Let its right adjoint be denoted as usual by . So -cubes of are cubical maps from subdivision of the -cube to (similar to the definition of simplicial Ex-functor). We get therefore maps
Let be the union of the latter maps (similar to simplicial ).
question: Is a fibrant cubical set for any cubical set ?.
Recall that a cubical set is fibrant if any cubical horn has a filler (similar to simplicial set: any Kan fibrant simplicial set has horn fillers). See also Cisinski’s book or Jardine’s lectures on cubical sets for definitions.
The first question is probably not true in general, but if we consider cubical sets with connections in the sense of Brown-Higgins (we add some degeneracy maps to cubical sets), see e.g. Maltsiniotis paper then the cubical subdivision remains the same and the is defined similarly. The question is whether with a cubical set with connections is fibrant. Is it true?
The notion of cubical set and of homology theory and homotopy theory based on singular cubes goes way back in the literature. Serre’s work on spectral sequences and fibre spaces was based on cubes. Kan’s early work on combinatorial homotopy was based on cubes. However the category of cubical sets was found to have a major disadvantage compared with simplicial sets, in that the cartesian product in this category failed to have the correct homotopy type. This is in striking contrast to the cartesian product on simplicial sets.
Nonetheless cubical sets continued to have a kind of underground existence.
Brown and Higgins introduced the extra structure of connections on cubical sets, and included this structure into their cubical strict ω-groupoids. All this structure was essential for the equivalence with crossed complexes and for the applications to homotopy theory. For example these -groupoids have a canonical structure of thin elements, defined as any composition of elements of the form . Such elements have “commuting boundary”.
The geometric realisation of cubical sets with connections, and the relation with cartesian products, has been analysed by Maltsiniotis in the paper referred to below.
Nonetheless, the advantages of cubes are:
Easy notions of multiple compositions (compared with the globular pasting schemes); we refer to compositions in cubical sets.
Good notions of tensor product, because of the rule , and hence easy conceptual handling of homotopies. This is exploited in the paper by Brown and Higgins on tensor products, and also in the following paper
which gives a monoidal closed structure on cubical -categories with connections, allowing the transfer of this to globular -categories. The tensor product here generalises the Gray tensor product of 2-categories.
Cubical methods are a key feature in using higher homotopy groupoids to prove homotopy classification results.
General introductions of the cube category and of cubical sets are in
The cubical identities satisfied by a cubical set are given there in proposition 2.8 on p. 9.
Cubical singular homology is discussed in
The fact that the exponential object of two fibrant cubical sets is again fibrant follows from remark 8.4.33 in
in the context of Cisinski model structures.
The strict test category nature of cubical sets with connection is discussed in
There is also the old work
in which “supercomplexes” are discussed, that combine simplicial sets and cubical sets (def 5). There are functors from simplicial sets to supercomplexes (after Defn 5) and, implicitly, from supercomplexes to cubical sets (in Appendix II). This was written in 1956, long before people were thinking as formally as nowadays and long before Quillen model theory, but a comparison of the homotopy categories might be in there.
A discussion of cubical sets and normal forms in several cases is in
Cubical sets as models for strict ω-groupoids are discussed in
Their use for monoidal closed structures and homotopy classification is given in
and are essential in