Homotopy Category¶

A category that retains objects while replacing maps by homotopy classes or, more generally, formally inverting a designated class of weak equivalences.

Version: v4 · 2026-09-19 · History
Domain-specific #: 2018
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Algebraic Topology, Homotopy Theory → Mathematics

Core Idea¶

A homotopy category is the ordinary category obtained when a homotopy theory treats weakly equivalent objects as isomorphic and treats maps differing only by homotopy as the same morphism. In the elementary category of topological spaces, one construction keeps the same spaces and defines

\[ \operatorname{Hom}_{\operatorname{hTop}}(X,Y) = [X,Y], \]

the set of homotopy classes of continuous maps. Composition is well-defined because homotopic maps remain homotopic after pre- or postcomposition.

The model-categorical construction is more general. If \(\mathcal M\) is a model category with weak equivalences \(W\), its homotopy category is the localization.

How would you explain it like I'm…

No faithful explanation at this level. A kid-level version reduces to 'just blur away the shape details.' That is exactly the misreading the concept rules out: it is a controlled localization that keeps a consistent way of composing maps.

Slidable Maps Count Once

Mathematicians study shapes and the ways of sending one shape into another, called maps. Sometimes two maps can be slid smoothly into each other, and for many questions they might as well be the same. A homotopy category is a new collection where those slidable maps count as one single map. You can still chain maps one after another, and the chaining still works perfectly. The new collection keeps exactly the information that doesn't change under sliding, following carefully chosen rules.

Maps Up to Deformation

A category is a collection of objects plus arrows between them that you can compose. The homotopy category of topological spaces keeps the same spaces but makes each arrow a class of continuous maps, where two maps are in the same class if they are homotopic, meaning one can be continuously deformed into the other. Composition still works, because deforming a map before or after composing it still gives homotopic results. More generally, you pick a class of "weak equivalences" and force them to become isomorphisms. The result is still an ordinary category, with identities and associative composition. It is not a sloppy deletion of detail. It is a precise construction that records only what is invariant under the chosen notion of sameness.

A homotopy category is the ordinary category obtained from a homotopy theory by treating weakly equivalent objects as isomorphic and homotopic maps as equal. For topological spaces, hTop keeps the same objects and sets Hom(X,Y) = [X,Y], the homotopy classes of continuous maps; composition is well defined because homotopy is preserved by pre- and postcomposition. In a model category M with weak equivalences W, the homotopy category is the localization Ho(M) = M[W⁻¹], given by a functor γ: M → Ho(M) that sends every weak equivalence to an isomorphism and is universal among such functors. Morphisms can be computed concretely by taking a cofibrant replacement of the source and a fibrant replacement of the target and then forming homotopy classes. The construction is not simply discarding detail: it is a controlled localization relative to a declared class of weak equivalences, and the output still has identities and associative composition.

Scope of Application¶

For topological spaces, homotopy categories support reasoning invariant under homotopy equivalence. For pointed spaces, they support suspension, loops, cofiber sequences, and stable constructions with basepoint-preserving maps.

For chain complexes, localizing at quasi-isomorphisms yields derived categories, so homological algebra can disregard resolutions that compute the same derived object. For simplicial sets and topological spaces equipped with Quillen model structures, the corresponding homotopy categories are equivalent even though the source categories differ.

Clarity¶

“Homotopy” must be relative to structure. Free homotopy, pointed homotopy, chain homotopy, simplicial homotopy, and model-categorical left/right homotopy are related but not interchangeable.

Weak equivalence must also be named. For spaces, a homotopy equivalence is stronger than a weak homotopy equivalence without CW-type hypotheses. A localization at weak homotopy equivalences may require replacement before morphisms are represented by ordinary homotopy classes.

Manages Complexity¶

Homotopy theory routinely uses many presentations for one underlying homotopy type: CW approximations, fibrant replacements, resolutions, subdivisions, and simplicial models. The homotopy category declares these interchangeable for invariant reasoning.

Localization also turns construction choices into canonical morphisms up to homotopy. A derived functor can be defined using a replacement, then shown independent of that choice in the homotopy category.

Abstract Reasoning¶

The universal property can be written:

\[ \operatorname{Fun}(\mathcal M[W^{-1}],\mathcal D) \simeq \{F:\mathcal M\to\mathcal D\mid F(W)\subseteq\operatorname{Iso}(\mathcal D)\}. \]

Thus localization is determined not by one arbitrary formula for zigzags but by how functors out of it behave.

Knowledge Transfer¶

The mechanism transfers literally from spaces to chain complexes, simplicial sets, differential graded objects, and spectra: choose weak equivalences, localize, and calculate maps through suitable replacements.

Different model structures may present the same homotopy theory. A Quillen equivalence induces an equivalence of homotopy categories, providing a controlled bridge between combinatorial and geometric models.

The construction does not transfer literally to ordinary social or conceptual “equivalence.” Outside mathematics, the portable residues are Category, Isomorphism, and abstraction by equivalence; the weak-equivalence localization and derived mapping machinery remain domain-bound.

Relationships to Other Abstractions¶

Current abstraction Homotopy Category Domain-specific

Parents (1) — outgoing typed relations

Homotopy Category is a kind of Category Prime

prime:category is the broader abstraction this entry instantiates.

Hierarchy paths (3) — routes to 3 parentless roots

Homotopy Category → is a kind of Category → includes Associativity → is a kind of Invariance

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Homotopy Category sits in a sparse region of the domain-specific corpus (64^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Categories, Sheaves & Homotopy (21 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25