equality (definitional, propositional, computational, judgemental, extensional, intensional, decidable)
isomorphism, weak equivalence, homotopy equivalence, weak homotopy equivalence, equivalence in an (β,1)-category
Examples.
This entry is about the notion of skeleton in category theory. For the notion of (co)skeletal simplicial sets see at simplicial skeleton.
A strict category $\mathcal{C}$ is called skeletal if any two objects that are isomorphic are actually already equal (in the fixed set of objects $Obj(\mathcal{C})$), hence if all its isomorphisms are automorphisms.
(If in addition all isomorphisms are in fact identity morphisms, then one speaks of a gaunt category. In the other extreme, if all morphisms of a skeletal category are isomorphisms, then one has a skeletal groupoid).
A skeleton of a category $C$ is defined to be a skeletal subcategory of $C$ whose inclusion functor exhibits it as equivalent to $C$. A weak skeleton of $C$ is any skeletal category which is weakly equivalent to $C$.
In the absence of the axiom of choice, it is more appropriate to define a skeleton of $C$ to be a weak skeleton as defined above.
In this section, we work in set-level foundations to construct skeleta of categories and more general objects.
If the axiom of choice holds, then every category $C$ has a skeleton (in the strongest sense).
Simply choose one object in each isomorphism class and one isomorphism to that object from each other object in that class.
In more detail, generate the full subcategory $sk(C)$ containing just the chosen objects. Denote by $in\colon sk(C)\to C$ the inclusion. We exhibit a weak inverse of $in$ as a functor $-':x\mapsto x'$ constructed as follows. For every object $x$ one has chosen already the unique object $x'$ in $sk(X)$ isomorphic to $x$, but one also needs to make a choice of isomorphism $i_x\colon x\to x'$ for every $x$. This enables to conjugate between $C(x,y)$ and $C(x',y')$ by
The rule for morphisms $-': f\mapsto f' := i_y\circ f\circ i_{x}^{-1}$ is clearly functorial. Let us show that $-'$ is a weak inverse of $in$. In one direction, given $y\in sk(C)$ we compute $(in_{y})' = y$ (strict equality); in another direction, given $x\in C$, notice that $i^{-1}_{in_{x'}}:in_{x'}\cong x$ for $x\in C$ is an isomorphism. It suffices to show that these isomorphisms for all $x\in C$ together form a natural isomorphism $i^{-1}_{in}:in_{-'}\to id_C$; the naturality diagram is commutative precisely because of the conjugation formula for the functor $-'$ for morphisms. This completes the proof that $-'$ is indeed a weak inverse of $in$.
In fact, the statement that every (possibly small) category has a skeleton is equivalent to the axiom of choice if βsubcategoryβ and βequivalenceβ have their naive (βstrongβ) meanings. For given a surjection $p:A\to B$ in $Set$, make $A$ into a category with a unique isomorphism $a\cong a'$ iff $p(a)=p(a')$; then a skeleton of $A$ supplies a splitting of $p$.
Even with the more general notion of weak or ana-equivalence of categories, some amount of choice is required to show that every category has a skeleton. It would be interesting to know the precise strength of the statement βevery category is weakly equivalent to a skeletal one.β
In the presence of choice we can thusly turn the process of taking the skeleton of a category into an endo-pseudofunctor on $\mathfrak{Cat}$, the $2$-category of categories.
For each category $\mathcal{C}$ let $sk_\mathcal{C}$ denote a skeleton of $\mathcal{C}$ and let $E_\mathcal{C}:sk_\mathcal{C}\simeq\mathcal{C}:E_\mathcal{C}^{\sim1}$ denote the skeletal equivalence at $\mathcal{C}$, with $\epsilon^{sk}_\mathcal{C}:E_\mathcal{C}\circ E^{\sim1}_\mathcal{C}\Rightarrow1_\mathcal{C}$ the skeletal transformation at $\mathcal{C}$. We define an endo-pseudofunctor
as follows:
is defined by
since
Using the above definition, we can canonically define the skeleton of an indexed category.
Let $\psi:\mathcal{B}^{op}\to\mathfrak{Cat}$ be an indexed category. We define the indexed skeleton of $\psi$, denoted
to be the indexed category given by postcomposing $\psi$ with $sk$, so $sk(\psi)=sk\circ\psi.$ That is, for each $I\in\mathcal{B}$ we take a skeleton $sk(\psi(I))$ of the category $\psi(I)$ indexed by $I$ with equivalence $E_I:\psi(I)\simeq sk(\psi(I)):E_I^{\sim1}$, we extend functors using the equivalences at various skeletons, and we extend natural transformations using skeletal isomorphisms in the codomain categories (although $\mathcal{B}^{op}$ has only identity $2$-cells since itβs a promoted $1$-category, so the action on $2$-cells is trivial).
Using the above definition and the Grothendieck construction, we can define the skeleton of a fibration using the skeleton of an indexed category.
Let $p:\mathcal{E}\to\mathcal{B}$ be a fibration. We define the fibered skeleton of $p$, denoted
to be the Grothendieck completion of the indexed skeleton of the indexing by $p$. That is, $sk(p)$ is the fibration obtained by turning $p$ into an indexed category using the Grothendieck construction, taking the indexed skeleton of this indexed category, then turning the resulting skeletal indexed category back into a fibration (via the Grothendieck construction again). We refer to the total category $sk^p_\mathcal{E}$ in the resulting fibration as the $p$-skeleton of $\mathcal{E}$, which is different than $sk_\mathcal{E}$ since we have only skeletalized the fiber categories of our original fibration and not the total category of the original fibration. In general, we will have that
although they are trivially equivalent. As an example of this construction in action, we can pass from the monomorphism fibration on a category with pullbacks to the subobject fibration by taking the fibered skeleton. For details, see the subobject fibration section of codomain fibration.
In this section we collect some properties of skeleta in set-level foundations.
Of course, two categories can be equivalent even if one is skeletal and the other is not. Thus, the notion of skeletal category violates the principle of equivalence. (It doesnβt make sense to ask whether a particular category, skeletal or not, βviolates the principle of equivalenceβ.)
Without any choice, we have the following theorems.
Any thin category (i.e. any preordered set) has a weak skeleton.
In this case, we can take the objects of the skeleton of $C$ to be the isomorphism classes of $C$. If $C$ is thin, then we can define a partial ordering on its set of isomorphism classes, making them into a skeleton of $C$.
Any two skeletons (in the strong sense) of a category are isomorphic.
Let $\mathcal{C}$ be a category, with $sk (\mathcal{C})$ and $sk (\mathcal{C})'$ two skeletons of $\mathcal{C}$, and for each object $Y\in\mathcal{C}$ denote by $X_Y$ and $X_Y'$ respectively the unique objects in $sk (\mathcal{C})$ and $sk (\mathcal{C})'$ which are isomorphic to Y, and denote their respective isomorphisms by $i_Y:Y\to X_Y$ and $i_Y':Y\to X_Y'$. We define a functor $F:sk (\mathcal{C})\to sk (\mathcal{C})'$ by
We then have
so $F$ is a functor. The inverse $F^{-1}: sk (\mathcal{C})'\to sk (\mathcal{C})$ is defined in the obvious way, and is functorial by similar computations.
Notice that the axiom of choice fails in general when one considers internal categories. Hence not every internal category has a skeleton. A necessary condition for an internal category $X_1 \rightrightarrows X_0$ to have a skeleton is the existence quotient $X_0/X_1$ - the object of orbits under the action of the core of $X$. If the quotient map $X_0 \to X_0/X_1$ has a section, then one could consider $X$ to have a skeleton, but this condition isnβt sufficient for the induced inclusion functor to be a weak equivalence of internal categories when this makes sense (i.e. if the category is internal to a site).
David Roberts: The claim above about the necessity of the existence of the quotient needs to be checked.
Define a coskeleton of a category $C$ to be a skeletal category $S$ with a surjective equivalence $C\to S$. In Categories, Allegories it is shown that the following are equivalent.
The axiom of choice holds.
Any two ana-equivalent categories are strongly equivalent.
I removed βnon-anaβ, since I don't think that βstrongly equivalentβ would ever be used in an βana-β sense. βToby
Addendum: Actually, I don't know why I asked whether you meant weakly or strongly here, since obviously one can prove that two ana-equivalent categories are weakly equivalent! It seems that the discussion above used the terms βequivalenceβ and βana-equivalenceβ where equivalence of categories uses βstrong equivalenceβ and βweak equivalenceβ or βana-equivalenceβ; so I just changed it. And then I added another entry, which maybe you should remove if Freyd & Scedrov don't actually address it. On the other hand, if they really talk about weak equivalence instead of ana-equivalence (although if they define it in elementary terms, it's hard to tell the difference), maybe there's no need to say βana-β at all on this page.
Any two weakly equivalent categories are strongly equivalent.
Every small category has a weak skeleton.
Every small category has a coskeleton.
Any two weak skeletons of a given small category are isomorphic.
Any two coskeletons of a given small category are isomorphic.
For convenience we add:
It is well-known that objects defined by universal properties in a category, such as limits and colimits, are not unique on the nose, but only unique up to unique canonical isomorphism. It can be tempting to suppose that in a skeletal category, where any two isomorphic objects are equal, such objects will in fact be unique on the nose. However, under the most appropriate definition of βunique,β this is not true (in general), because of the presence of automorphisms.
More explicitly, consider the notion of cartesian product in a category. Although we colloquially speak of βa productβ of objects $A$ and $B$ as being the object $A\times B$, strictly speaking a product consists of the object $A\times B$ together with the projections $A\times B\to A$ and $A\times B\to B$ which exhibit its universal property. Thus, even if the category in question is skeletal, so that there can be only one object $A\times B$ that is a product of $A$ and $B$, in general this object can still βbe the product of $A$ and $B$β in many different ways.
For example, given any projections $A\times B\to A$ and $A\times B\to B$ that exhibit $A\times B$ as a product of $A$ and $B$, we can compose them both with any automorphism of $A\times B$ to get a new, different, pair of projections that also exhibit $A\times B$ as a product of $A$ and $B$. In fact, the universal property of a product implies that any two pairs of projections are related by an automorphism of $A\times B$, so this example is generic. Thus, even in a skeletal category, we cannot speak of βtheβ product of $A$ and $B$, except in the same generalized sense that makes sense in any category. A formal way to say this is that the βcategory of products of $A$ and $B$,β while still equivalent to the trivial category, as it is in any category with products, will not be isomorphic to the trivial category even when the ambient category is skeletal.
(It is true in a few cases, though, that skeletality implies uniqueness on the nose. For instance, a terminal object can have no nonidentity automorphisms, so in a skeletal category, a terminal object (if one exists) really is unique on the nose.)
All the discussion above pertains to set-level foundations. In intensional type theory such as homotopy type theory, additional care is needed.
A first guess is to define a precategory $C$ to be skeletal if for any objects $a,b$ there is a function $\Vert a\cong b\Vert \to (a=b)$, i.e. if $a$ and $b$ are merely isomorphic then they are equal. (Here $\Vert-\Vert$ denotes the propositional truncation.) However, if the type $ob(C)$ of objects is not a set, then $a=b$ is not a proposition, and so under this definition a category could βbe skeletalβ in more than one way.
Arguably a better definition is to say that a precategory $C$ is skeletal if for any objects $a,b$ the canonical function
is an equivalence. Since $\Vert a\cong b\Vert$ is always a proposition, this entails that $a=b$ is also a proposition. Thus, this implies that $ob(C)$ is a set, i.e. that $C$ is a strict category.
Note the analogy between this condition and the notion of univalent category: the only difference is the propositional truncation. It follows that if a precategory is both skeletal and univalent, then $a\cong b$ is always a proposition (since it is equivalent to its propositional truncation), and thus the category is gaunt. Indeed, the gaunt categories are precisely those that are both skeletal and univalent.
Unlike in set-level foundations, in intensional type theory not every precategory (and not even every univalent category) has a skeleton. Indeed, if the axiom sets cover fails, then there can be univalent categories that are not weakly equivalent to any strict category. For this reason, the notion of skeleton tends to be less useful outside of set-level foundations, although particular concrete examples may turn out to be skeletal.
Every poset is skeletal.
The walking parallel pair is a skeletal category which is not a poset.
All of the above examples are in fact gaunt: not only are any two isomorphic objects equal, but any isomorphism is an identity morphism.
In terms of (n,r)-category-theory one may essentially identify preordered sets with thin categories or (0,1)-categories. Under this identification, the passage of skeleta of categories corresponds to choosing an equivalent partial order inside a preorder.
For more details (and more precise statements, see at relation between preorders and (0,1)-categories.
See also:
Presenting a pretorsion theory on Cat whose torsion(-free) objects are the groupoids (skeletal categories, respectively), hence whose βtrivial objectsβ are the skeletal groupoids:
Last revised on May 12, 2023 at 16:55:02. See the history of this page for a list of all contributions to it.