homotopy hypothesis-theorem
delooping hypothesis-theorem
stabilization hypothesis-theorem
n-category = (n,n)-category
n-groupoid = (n,0)-category
Globular sets are to simplicial sets as globes are to simplices.
They are one of the major geometric shapes for higher structures: if they satisfy a globular Segal condition then they are equivalent to strict ω-categories.
The globe category is the category whose objects are the natural numbers, denoted here and whose morphisms are generated from
for all subject to the relations (dropping obvious subscripts)
A globular set, also called an -graph is a presheaf on . The category of globular sets is the category of presheaves
This means that a globular set is given by a collection of sets , called the sets of -globes, equipped with functions
called the -target and -source maps (or similar), such that the globular identities hold: for all
.
The globular identities ensure that two sequences of boundary maps
with and for are equal if and only if their last term coincides; for all we have
For a globular set we may therefore write unambigously
with the sequence of consecutive identity-assigning, source or target maps, respectively.
The presheaf definition can understood from the point of view of space and quantity: a globular set is a space characterized by the fact that and how it may be probed by mapping standard globes into it: the set assigned by a globular set to the standard -globe is the set of -globes in this space, hence the way of mapping a standard -globe into this spaces.
More generally:
If to the globe category we add additional generating morphisms
satisfying the relations
we obtain the reflexive globe category, a presheaf on which is a reflexive globular set. In this case the morphism
is called the th identity assigning map; it satisfies the globular identities:
A presheaf on the full subcategory of the globe category containing only the integers through is called an -globular set or an -graph or an -graph. An -globular set may be identified with an -globular set which is empty above dimension .
Note that a -globular set is just a directed graph, and a -globular set is just a set.
Any strict 2-category or bicategory has an underlying 2-globular set. Likewise, any tricategory has an underlying 3-globular set. Globular sets can be used as underlying data for n-categories as well; see for instance Batanin ω-category.
A strict omega-category is a globular set equipped in each degree with the structure of a category such that for every pair the induced structure on the 2-graph is that of a strict 2-category.
The globular -globe is the globular set represented by , i.e. .
Also related is the notion of computad, which is similar to a globular set in some ways, but allows “formal composites” of -cells to appear in the sources and targest of -cells.
The definition is reviewed around def. 1.4.5, p. 49 of
See also