homotopy type

**homotopy theory, (∞,1)-category theory, homotopy type theory**

flavors: stable, equivariant, rational, p-adic, proper, geometric, cohesive, directed…

models: topological, simplicial, localic, …

see also **algebraic topology**

**Introductions**

**Definitions**

**Paths and cylinders**

**Homotopy groups**

**Basic facts**

**Theorems**

**natural deduction** metalanguage, practical foundations

**type theory** (dependent, intensional, observational type theory, homotopy type theory)

**computational trinitarianism** = **propositions as types** +**programs as proofs** +**relation type theory/category theory**

logic | category theory | type theory |
---|---|---|

true | terminal object/(-2)-truncated object | h-level 0-type/unit type |

proposition(-1)-truncated objecth-proposition, mere proposition

proofgeneralized elementprogram

cut rulecomposition of classifying morphisms / pullback of display mapssubstitution

cut elimination for implicationcounit for hom-tensor adjunctionbeta reduction

introduction rule for implicationunit for hom-tensor adjunctioneta conversion

logical conjunctionproductproduct type

disjunctioncoproduct ((-1)-truncation of)sum type (bracket type of)

implicationinternal homfunction type

negationinternal hom into initial objectfunction type into empty type

universal quantificationdependent productdependent product type

existential quantificationdependent sum ((-1)-truncation of)dependent sum type (bracket type of)

equivalencepath space objectidentity type

equivalence classquotientquotient type

inductioncolimitinductive type, W-type, M-type

higher inductionhigher colimithigher inductive type

completely presented setdiscrete object/0-truncated objecth-level 2-type/preset/h-set

setinternal 0-groupoidBishop set/setoid

universeobject classifiertype of types

modalityclosure operator, (idemponent) monadmodal type theory, monad (in computer science)

linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation

proof netstring diagramquantum circuit

(absence of) contraction rule(absence of) diagonalno-cloning theorem

synthetic mathematicsdomain specific embedded programming language

</table>

Traditionally, a *homotopy type* is a topological space regarded up to weak homotopy equivalence, (although this may sometimes be referred to as its *weak homotopy type*, (see below)). Formally this may be taken to mean the object that $X$ represents in the standard homotopy category Ho(Top), or, better, in the (∞,1)-category ∞Grpd $\simeq$ $L_{whe} Top$, the simplicial localization of the category Top at the weak homotopy equivalences, of which $Ho(Top)$ is the decategorification. As such, topological spaces regarded as homotopy types are equivalently *∞-groupoids* (see at *homotopy hypothesis* for more on this).

More generally, then, we may think of every object in any (∞,1)-topos $\mathcal{C}$ as being a *homotopy type in the world of* $\mathcal{C}$ (just as we may think of an object of a 1-topos $\mathcal{S}$ as being a “set in the world of $\mathcal{S}$”). For instance, if $\mathcal{C} = Sh_\infty(C)$ is an (∞,1)-category of (∞,1)-sheaves/of ∞-stacks over some (∞,1)-site $C$, then an object of $\mathcal{C}$ may be thought of as a *homotopy type over $C$*, or a *sheaf of homotopy types*. If $\mathcal{C}$ is the classifying topos of some geometric theory $T$, then an object of $\mathcal{C}$ may be called a “$T$-structured homotopy type”. And if $\mathcal{C}$ is a cohesive (∞,1)-topos, an object of $\mathcal{C}$ may be called a “cohesive homotopy type”. In the special case that $\mathcal{C} = Sh_\infty(*) \simeq \infty Gprd$, this reproduces the traditional notion.

The reason this makes sense is that any $(\infty,1)$-topos has an internal language, which is *homotopy type theory* — a formal logic whose basic objects are abstract things called *homotopy types*, just as the basic objects of set theory are abstract things called sets. Inside the internal logic of $\mathcal{C}$, its objects behave like classical homotopy types (although the ambient logic is constructive). This explains why we can think of objects of $\mathcal{C}$ as “homotopy types in the world of $\mathcal{C}$”: they are the categorical semantics of these abstract homotopy types in the internal logic of $\mathcal{C}$. In the special case of $\infty Grpd$, the internal and external logic are the same, so this meaning also includes the classical usage of “homotopy type”.

A homotopy type that is an *n-truncated object in an (∞,1)-category* or equivalently that interprets a type of *homotopy level* $n+2$ is also called a *homotopy n-type* or *$n$-type* for short. For topological spaces / ∞-groupoids this means that all homotopy groups above degree $n$ are trivial.

In traditional homotopy theory of topological spaces one sometimes distinguishes the notion of *strong homotopy types* from that of *weak homotopy types*, depending on whether one regards topological spaces up to *homotopy equivalence* or up to *weak homotopy equivalence* (see also there the section *Relation to homotopy types*).

The two notions agree on good cofibrant spaces, namely on the CW-complexes (see model structure on topological spaces) and for homotopy theory proper it is the *weak* homotopy equivalences that matter.

More precisely, weak homotopy equivalences between spaces give an equivalence relation on the class of topological spaces, and referring to a *homotopy type* means that you are to consider properties of a space that are shared by any of the spaces weakly equivalent to it and thus in that equivalence class. In this expanded sense, therefore, a **homotopy type** is such a weak equivalence class of spaces. Using the terminology from homotopy category, two spaces *have the same homotopy type* if they are isomorphic in Ho(Top).

By standard theorems, homotopy types in topological can also be ‘modeled’ by many other structures, such as

- simplicial sets up to weak homotopy equivalence;
- small categories up to weak homotopy equivalence of their nerves;
- $\infty$-groupoids up to category-theoretic equivalence (this is the content of the homotopy hypothesis).

In most cases the tools of homotopy theory, in particular model categories, can be used to establish these equivalences.

The sense of ‘modeled’ is related to Whitehead’s algebraic homotopy theory. A setting such as those above acts as a model for homotopy types if there are comparison functors between $\Spaces$ and the category, and some notion of homotopy within the category yielding an equivalence of homotopy categories.

Although the notion of homotopy type is defined for arbitrary spaces, it is most usual to restrict attention to ‘locally nice’ spaces such as polyhedra (i.e. realisations of simplicial complexes or CW-complexes). Various other classes of space occur naturally in various parts of mathematics in particular in analysis and algebraic geometry and there the methods of abstract homotopy theory provide a way of mimicking the basic idea of homotopy type as described above.

Using variants of ‘weak equivalence’, for instance, ‘$n$-equivalence’, one gets coarser notions of equivalence which can be very useful. The particular case of $n$-equivalence leads to the related notion of homotopy n-type.

**dependent type**, dependent type theory, Martin-Löf dependent type theory

**homotopy type**, homotopy type theory

homotopy level | n-truncation | homotopy theory | higher category theory | higher topos theory | homotopy type theory |
---|---|---|---|---|---|

h-level 0 | (-2)-truncated | contractible space | (-2)-groupoid | true/unit type/contractible type | |

h-level 1 | (-1)-truncated | contractible-if-inhabited | (-1)-groupoid/truth value | (0,1)-sheaf/ideal | mere proposition/h-proposition |

h-level 2 | 0-truncated | homotopy 0-type | 0-groupoid/set | sheaf | h-set |

h-level 3 | 1-truncated | homotopy 1-type | 1-groupoid/groupoid | (2,1)-sheaf/stack | h-groupoid |

h-level 4 | 2-truncated | homotopy 2-type | 2-groupoid | (3,1)-sheaf/2-stack | h-2-groupoid |

h-level 5 | 3-truncated | homotopy 3-type | 3-groupoid | (4,1)-sheaf/3-stack | h-3-groupoid |

h-level $n+2$ | $n$-truncated | homotopy n-type | n-groupoid | (n+1,1)-sheaf/n-stack | h-$n$-groupoid |

h-level $\infty$ | untruncated | homotopy type | ∞-groupoid | (∞,1)-sheaf/∞-stack | h-$\infty$-groupoid |

- Edwin Spanier, section 7.8 of
*Algebraic topology*, McGraw-Hill, 1966

There are some useful points made in:

- H. J. Baues,
*Homotopy Types*, in*Handbook of Algebraic Topology*, (edited by I. M. James?), North Holland, 1995.

Last revised on July 3, 2018 at 15:13:28. See the history of this page for a list of all contributions to it.