What is an equivalence in a higher category?
Viktoriya Ozornova, Martina Rovelli

TL;DR
This survey provides a unified overview of the concept of equivalence across strict and higher categories, including $(n)$ and $( )$-categories, emphasizing their interrelations.
Contribution
It systematically consolidates the notion of equivalence in higher categories, offering a clear, uniform framework for understanding these complex relationships.
Findings
Unified framework for equivalences in strict and higher categories
Clarification of equivalence notions in $(n)$ and $( )$-categories
Enhanced understanding of categorical relationships in higher dimensions
Abstract
The purpose of this survey is to present in a uniform way the notion of equivalence between strict -categories or -categories, and inside a strict -category or -category.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Algebraic structures and combinatorial models · Intracranial Aneurysms: Treatment and Complications
What is an equivalence in a higher category?
Viktoriya Ozornova
Max Planck Institute for Mathematics, Bonn, Germany
and
Martina Rovelli
Department of Mathematics and Statistics, University of Massachusetts, Amherst, USA
Abstract.
The purpose of this survey is to present in a uniform way the notion of equivalence between strict -categories or -categories, and inside a strict -category or -category.
2020 Mathematics Subject Classification:
18N10; 18N30; 18N60; 18N65; 18N40
Contents
-
1.3.3 Biequivalences and biadjoint biequivalences in a -category
-
2.4.3 Equivalences in a category enriched over Kan complexes
-
2.5.2 Equivalences in a category enriched over (naturally marked) quasi-categories
Introduction
Many theorems in mathematics are about identifying two types of mathematical objects of interest that present themselves as seemingly different. While it is tempting to state such results by saying that two classes of mathematical objects are equal, in practice – rather than equality – the correct mathematical notion of sameness that encapsulates many such correspondences is that of a bijection. For instance, here are some well-known examples of correspondences in math that are expressed by means of suitable bijections:
- (1)
Galois correspondence: Given a finite field extension , there’s a bijection between the set of intermediate field extensions of and the set of subgroups of the Galois group of . 2. (2)
Classification of covering spaces: Given a nice pointed space , there’s a bijection between the set of isomorphism classes of pointed covering spaces of and the set of subgroups of the fundamental group of . 3. (3)
Stone duality: There’s a bijection between the large set of Boolean algebras and the large set of Boolean rings.
We may notice at this point that each of the aforementioned examples is in fact the shadow of a stronger statement. For instance, in the Galois correspondence it also holds that every inclusion of intermediate field extensions of correspond to a (reverse) inclusion of the corresponding subgroups of the Galois group of .
More generally, it if often the case that the mathematical objects of interest come with a relevant notion of morphisms between them, and naturally assemble into a category. While a set only consists of elements, a category consists of elements called objects, as well as arrows or morphisms between objects, together with a unital and associative composition law.
It is then desirable to upgrade the correspondence statements to suitable notions of sameness for the corresponding categories. At a first glance, one could hope to generalize the notion of bijection of sets to that of isomorphism of categories. Roughly speaking, an isomorphism of categories from to consists of functorial assignments and , and is designed so that for all objects of one has that is equal to , and similarly for .
Here are some correspondences that can be expressed by means of isomorphisms of categories.
- (1)
Categorified Galois correspondence: Given a finite field extension , there’s a contravariant isomorphism between the category of intermediate field extensions of and inclusions and the category of subgroups of the Galois group of and inclusions. 2. (2)
Universal property of group algebras: Given a group and a field , there is an isomorphism between the category of modules over the group algebra and the category of representations of . In a similar vein, there’s an isomorphism between the category of abelian groups and the category of modules over .
While extremely natural and intuitive, the notion of isomorphism of categories is too strict, and fails at encompassing the majority of mathematical correspondences of interest. Roughly speaking, the issue is that in many situations one has functorial assignments and , but given an object of one has that is not equal, but rather isomorphic to in the category , and similarly for . This is the defining property for an equivalence of categories, as opposed to that of an isomorphism of categories.
Here are some classical correspondences that can be expressed by means of equivalences of categories which are not isomorphisms of categories.
- (1)
Zariski duality [GW20, §2]: In algebraic geometry there is a contravariant equivalence between the category of affine schemes and the category of commutative rings. 2. (2)
Categorified classification of covering spaces [tD08, §3]: Given a nice space , there is an equivalence between the category of covering spaces over and the category of sets with an action of the fundamental groupoid of . 3. (3)
Morita theory: Given a commutative ring , there is an equivalence between the category of modules over and the category of modules over . Also, given commutative rings and , there is an equivalence between the product of the categories of modules over and , and the category of modules over . 4. (4)
Gelfand duality [Gel41]: In functional analysis there is a contravariant equivalence between the category of commutative -algebras and the category of compact Hausdorff topological spaces. 5. (5)
Dold–Kan correspondence [GJ09, §III]: There’s an equivalence between the category of simplicial abelian groups and the category of non-negatively graded chain complexes. 6. (6)
-categorical straightening-unstraightening [LR20]: Given a category , there is an equivalence between the category of presheaves on and the category of discrete fibrations over . 7. (7)
Low dimensional cobordism hypothesis [Koc04]: In mathematical physics, given a field there is an equivalence between the category of vector space valued -dimensional topological quantum field theories over and the category of finite-dimensional -vector spaces, and an equivalence between the category of -vector space valued -dimensional topological quantum field theories and the category of commutative Frobenius -algebras.
But, once again, too many phenomena of interest cannot be formalized via the notion of equivalence and even more fundamentally via the notion of category itself. Indeed, many mathematical objects of interest naturally assemble into something more complex than an ordinary category, such as an -category, an -category, or more generally an -category.
The differences amongst these notions arise essentially from choosing different combinations of two parameters: whether there are non-invertible morphisms in dimension higher than , and whether the axioms hold on the nose or up to a higher morphism. Roughly speaking, the differences amongst these types of higher categories can be summarized by the following table
[TABLE]
where the first and second row are special cases of the last one when taking .
Notable examples of higher categories that cannot be modelled by ordinary categories include:
- (1)
Versions of the -category of spaces, of rational spaces, or of spectra; 2. (2)
Versions of the -category of chain complexes, and of DG-algebras; 3. (3)
The -category of categories and the -category of -categories; 4. (4)
Versions of the -category of cobordisms [BD95, Lur09c, Aya09, CS19, AF17]; 5. (5)
Versions of the -category of spans or correspondences of -groupoids, or more generally inside a monoidal -category [Lur09c, GR17, Hau18, DK19, Har20]; 6. (6)
Versions of the -Morita category of -algebras [JFS17, Hau17].
And here are several correspondences that need to be expressed as -equivalences of -categories which are not equivalences of ordinary categories.
- (1)
Algebraic models in rational and -adic homotopy theory [Qui69, Sul77, Man01]: There’s an -equivalence between the -category of rational spaces and the -category of reduced differential graded Lie algebras over and also to the homotopy theory of -reduced differential graded cocommutative coalgebras over . Sullivan’s algebraic model defines an -equivalence between the -category of rational spaces and the -category of Sullivan algebras. In a similar vein, given any prime number , there’s an -equivalence between the -category of -adic spaces and an appropriate -category of -algebras. 2. (2)
- and -categorical straightening-unstraightening [Gro03, Lur09a, Nui21]: Given a -category , there is a -equivalence of -categories between the -category of categorical pseudo-presheaves over and the -category of Grothendieck fibrations over . Also, given a - (or more generally -)category , there is an -equivalence between the -category of - (or more generally -)categorical presheaves and the -category of cartesian fibrations over . 3. (3)
Fully extended cobordism hypothesis [BD95, Lur09c, Fre13, AF17]: Given a monoidal -category , evaluation at a point defines an -equivalence between the -groupoid of fully extended -dimensional topological quantum field theories valued in and the -groupoid of fully dualizable objects in . 4. (4)
Homological mirror symmetry [Kon95, KS01, GPS18] Given a symplectic manifold , there is a conjectural equivalence of -categories – which are certain stable -categories – between an appropriate Fukaya category of and the derived category of coherent sheaves on the mirror variety of . 5. (5)
Stable homotopy hypothesis [JO12, GJO19, GH15, MOP*+*22]: There is an -equivalence between the -category of Picard -categories and the -category of stable -types. 6. (6)
-algebras and homology theories [AF15]: Factorization homology defines an -equivalence between an appropriate -category of -algebras and an appropriate -category of excisive homology theories. 7. (7)
Derived categories of quasi-coherent sheaves [MM15]: Given a derived stack satisfying a suitable quasi-affineness condition, there is a monoidal -equivalence (hence an -equivalence) between the monoidal -category of quasi-coherent sheaves and the monoidal -category of modules over the global sections of . 8. (8)
-categorical Dold–Kan correspondence [Dyc21]: There’s an -equivalence between an appropriate -category of simplicial stable -categories and an appropriate -category of connective chain complexes of stable -categories. 9. (9)
Local geometric Langlands duality [AG15]: Given a connected reductive group , there is conjecturally an -equivalence between an appropriate -category of -modules on the moduli stack of -bundles and an appropriate -category of ind-coherent sheaves on a DG-stack of local system on the dual .
So far we have only mentioned the external viewpoint on equivalences, meaning the notion of -equivalence between -categories. But there is also an internal viewpoint on equivalences, which is about understanding the notion of an -equivalence of objects inside an -category. For instance, bijections of sets can be seen as isomorphisms in the category of sets and equivalences of categories can be understood as equivalences in the -category of categories, and one can define more generally isomorphisms in any category and equivalences in any -category. Even more generally, one can define -equivalences inside an -category and -equivalences inside an -category. This is the correct notion of sameness for objects inside a generic -category.
The purpose of this paper is to survey the various notions of equivalence between and inside the various higher categorical structures: sets, categories, -categories and -categories, treating both the internal and external viewpoint each time. We also discuss some model categorical tools to help interpret an presented by a model at the model categorical level.
Note: This paper targets someone who is familiar with the ordinary category theory language. It starts by recalling elementary notions, such as the notion of a category, or isomorphism in a category, or even the notion of a bijection of sets. This is not done thinking that the reader is learning this for the first time, but instead aiming to stress one or more viewpoints that are suitable for generalizations for more complicated contexts.
Acknowledgements
We are thankful for insightful discussions with Dimitri Ara, Nick Gurski, Simon Henry, Félix Loubaton, Lennart Meier, Nima Rasekh, and Alex Rice. The second author is grateful for support from the National Science Foundation under Grant No. DMS-2203915.
1. Equivalences of and inside strict higher categories
1.1. Isomorphism of sets and inside a category
1.1.1. Bijections of sets
We recall the notion of bijection of sets, stressing a (perhaps odd) viewpoint that helps prepare the ground for the viewpoint of sets being [math]-categories. In virtue of this, we introduce the following auxiliary notation:
Notation 1.1.1**.**
For a set and , we denote
[TABLE]
One way to define bijections is in terms of injectivity and surjectivity:
Definition 1.1.2** (Bijection of sets).**
A function between sets and is a bijection, and we write , if
- (1)
is surjective, meaning that for every element there exists an element and equalities of elements
[TABLE] 2. (2)
is injective, meaning that for every elements there are equalities
[TABLE]
Two sets and are in bijection, and we write , if there is a bijection between them.
There is a characterization of bijections in terms the existence of an inverse function.
Proposition 1.1.3** (Isomorphism in the category ).**
A function between sets is a bijection if and only if it is invertible; i.e., if there exists a function and equalities
[TABLE]
This viewpoint will be taken to be the notion of isomorphism in the category of sets, and is generalizable to define isomorphisms in any category .
1.1.2. Categories
Recall from e.g. [ML98, §I.2] that a (small) category consists of
- •
a set of objects ,
- •
for every a hom-set ,
- •
an identity operator function for every
[TABLE]
- •
a composition operator function for every
[TABLE]
satisfying for every the associativity axiom, given by the commutativity of the diagram of sets and functions
[TABLE]
for every the unitality axiom, given by the commutativity of the diagram of sets and functions
[TABLE]
In particular, the data of a category also determines a set of morphisms, given by the union of all hom-sets
[TABLE]
as well as several operators:
- •
source and target operators ,
- •
identity operator
- •
composition operators , defined all pairs of morphisms such that .
Given categories and , a functor consists of
- •
a function on objects
[TABLE]
- •
and a function on hom-sets for every
[TABLE]
satisfying the functorial properties; namely, the compatibility with composition, given by the commutativity for every of the diagram
[TABLE]
and the compatibility with identity, given by the commutativity for every of the diagram
[TABLE]
For instance, is the large111A large category is defined analogously to a small category, with the difference that is allowed to be a class, as opposed to a set. The formalization of categories of different sizes can be made precise by making use of Grothendieck universes (cf. [AGV71, Exposé I, Appendice II]). category of sets and functions, with usual composition of functions and identity functions of sets.
1.1.3. Isomorphisms in a category
The following definition recovers that of bijection of sets when read in the case of the category .
Definition 1.1.4** (Isomorphism in a category ).**
A morphism between objects and in a category is an isomorphism, and we write , if there exists a morphism in and equalities
[TABLE]
Two objects and of a -category are isomorphic, and we write , if there is an isomorphism between them in .
Isomorphisms can also be described in terms of the existence of inverses on each side (a viewpoint that will inspire Construction 1.5.11):
Remark 1.1.5*.*
A morphism in a category is an isomorphism if and only if there exist morphisms such that
[TABLE]
and this formulation was taken as one the first definitions of isomorphism in a category in [EM45, §I.1].
It is easily verified that the relation of being isomorphic for sets or more generally objects in a category is an equivalence relation.
1.1.4. The walking isomorphism
One can identify the universal shape that encodes the notion of an isomorphism, as we briefly recall after introduce the auxiliary category .
Construction 1.1.6**.**
We denote by the free category on two morphisms with opposite directions and . This is obtained by gluing and “head-to-tail”, and generating all possible compositions. Explicitly, the set of objects is and the hom-sets are
[TABLE]
[TABLE]
The category can be understood as the pushout of categories
[TABLE]
Here,
- •
denotes the walking object category, which consists of one object and no non-identity morphisms;
- •
and denote the walking morphism category and its opposite, which consist of one morphism – and respectively – between different objects and no other non-identity morphisms;
- •
denotes the boundary of , consisting of two objects and and no non-identity morphisms.
The vertical map is the canonical inclusion and the two cocomponents of the top horizontal map are the two distinct isomorphisms .
Construction 1.1.7** (The walking isomorphism).**
We denote by the walking isomorphism category, which is obtained from the category by imposing the relations
[TABLE]
The set of objects is and the hom-sets are
[TABLE]
The category can be understood as the pushout of categories
[TABLE]
where denotes the category consisting of two parallel morphisms and both the cocomponents of the vertical map are the canonical folding map that identifies the two morphisms.
By design, the walking isomorphism detects isomorphisms in the following sense:
Remark 1.1.8*.*
A morphism in a category is an isomorphism if and only if the functor determined by extends to a functor along the inclusion , i.e., if there is a solution to the lifting problem of categories
[TABLE]
1.1.5. The fundamental set of a category
The isomorphism relation for objects in a category can also be tested as equality relation in a suitable quotient set.
Definition 1.1.9**.**
Given a category , the fundamental set of is the set
[TABLE]
of the isomorphism classes of objects in . This defines a product-preserving functor .
Essentially by definition, we get:
Remark 1.1.10*.*
Given a category and the following are equivalent.
- (1)
There is an isomorphism
[TABLE] 2. (2)
There is an equality
[TABLE]
1.2. Equivalence of categories and inside a -category
1.2.1. Equivalences of categories
The notion of equivalence of categories is a classical one, occurring at least as early as [Gab62, §I.8] and discussed e.g. in [ML98, §IV.4].
Definition 1.2.1** (Equivalence of categories).**
A functor between categories is an equivalence, and we write , if
- (1)
the functor is surjective on objects up to isomorphism, meaning that for every object there exists an object and an isomorphism
[TABLE] 2. (2)
the functor is fully faithful or a hom-wise isomorphism, meaning that for all objects , the functor induces an isomorphism
[TABLE]
Two categories and are equivalent, and we write , if there exists an equivalence of categories between them.
Proposition 1.2.2**.**
The walking isomorphism category is contractible, meaning that there is an equivalence of categories
[TABLE]
Proof.
Consider the unique functor . There is an isomorphism (in fact an equality)
[TABLE]
and furthermore induces an isomorphism
[TABLE]
Similarly, the functions , and are isomorphisms. So there’s an equivalence , as desired. ∎
Remark 1.2.3*.*
In the context of the canonical model structure on the category (see e.g. [Rez96] or [Joy08b] for a description), the object is a cylinder for the terminal object in the sense of [Hov99, Definition 1.2.4]. Meaning, it comes with a factorization
[TABLE]
of the folding map of into a cofibration followed by a weak equivalence (in fact acyclic fibration). Note that is not the unique cylinder, and shouldn’t be expected to be. In fact, for every the connected groupoid on elements, obtained as the iterated pushout of -copies of along objects, is also a cylinder on the terminal object in the canonical model structure on . Every other cylinder object would be qualified to detect isomorphisms in a category as in Remark 1.1.8.
There is a characterization of equivalences between categories in terms the existence of a “weak” inverse. See e.g. [Gab62, Proposition 12] or [ML98, §IV.4] for a proof.
Proposition 1.2.4**.**
A functor between categories is an equivalence if and only if there exists a functor and isomorphisms
[TABLE]
This viewpoint can be taken to be the notion of equivalences in the -category of categories, and is generalizable to define equivalences in any -category .
1.2.2. -categories
Recall from e.g. [ML98, §XII.3] that a -category222The notion of -category also occurs in [EK66, §I.5] (under the name of hypercategory), based on ideas from [Ehr63, Bén65]. consists of
- •
a set of objects ;
- •
for every , a hom-category ;
- •
for every , an identity functor
[TABLE]
- •
for every a composition functor
[TABLE]
satisfying the associativity axiom (1.1.1) and the unitality axiom (1.1.2) read as diagrams of categories and functors, as opposed to sets and functions.
Given categories and , a -functor consists of
- •
a function on objects
[TABLE]
- •
for every , a functor on hom-categories
[TABLE]
satisfying the functorial properties as (1.1.3) and (1.1.4) read as diagrams of categories and functors, as opposed to sets and functions.
In particular, the data of a -category determines a set of -morphisms and a set of -morphisms given by
[TABLE]
as well as several operators:
- •
source and target operators
[TABLE]
- •
identity operators
[TABLE]
- •
composition operators333For simplicity of exposition, we’ll allow abuses of notation when the context is clear. For instance, we may omit the composition symbol, or omit the subscript of composition operators, or shorten expressions such as to or .
[TABLE]
[TABLE]
defined for all pairs of (-)morphisms such that the (dimension appropriate) source of the equals the target of .
For instance, the large category of categories and functors can also be regarded as a -category: the large -category of categories, functors and natural transformations, with usual composition of functors and natural transformations.
1.2.3. Equivalences in a -category
We can now define the notion of an equivalence in an arbitrary -category. It is used e.g. in [Str80, §1.5], [Lac02, §2], [Gur12, Definition 1.6], [RV22, Definition 1.4.6], and it also recovers the notion of equivalence between categories when read in the case of the large -category .
Definition 1.2.5** (Equivalence and adjoint equivalences in a -category ).**
A -morphism in a -category is an equivalence, and we write , if there exists a -morphism in and isomorphisms
[TABLE]
Two objects and in a -category are equivalent, and we write , if there exists an equivalence between them in .
It is easily verified that the relation of being equivalent for categories or more generally for objects in a -category is an equivalence relation.
There is a characterization of equivalences in a -category in terms of adjoint equivalences, a notion that we briefly recall. See e.g. [Str80, §1.5], [ML98, §IV.4], [Lac04, §3], and [Gur12, Theorem 1.9] for more details.
Definition 1.2.6** (Adjoint equivalence in a -category ).**
A -morphism in a -category is an adjoint equivalence in if there exist a -morphism in and isomorphisms
[TABLE]
and equalities
[TABLE]
The following result is classical. See e.g. [Gab62, Proposition I.12], [Str80, §1.5], [ML98, §IV.4], [Lac04, Lemma 5], and [Gur12, Theorem 1.9] for a proof. Standard proofs of this fact use string calculus for -morphisms in a -category, clarifying the algebraic formulas which can be used instead.
Theorem 1.2.7**.**
A -morphism in a -category is an equivalence if and only if it is an adjoint equivalence in .
The idea is that, by definition, every adjoint equivalence is an equivalence. Vice versa given an equivalence witnessed by the data of , and , one could tweak to obtain such that , and witness that is an adjoint equivalence.
1.2.4. The walking equivalence and adjoint equivalence
We seek an indexing shape – which we will denote by and features e.g. in [Lac02, §3] as – parametrizing equivalences in a -category. The construction of relies on the construction of the auxiliary category , which in turns relies on the notion of suspension. Given a category , we denote by the suspension -category, which consists of two objects and one non-trivial hom-category given by (see e.g. [OR21b, Definition 1.2] for more details). This defines a functor .
Construction 1.2.8** (The walking equivalence).**
We denote by the walking equivalence, which is obtained from by freely adding -isomorphisms
[TABLE]
The -category can be understood as the pushout of -categories
[TABLE]
Here, denotes the walking -morphism, which consists of a -morphism between two parallel -morphisms, and the left vertical maps are suspensions of canonical maps that define and as pushouts in Constructions 1.1.6 and 1.1.7. We see that , but the hom-categories of can’t be easily described.
By design, walking equivalence detects equivalences in the following sense.
Remark 1.2.9*.*
A -morphism in a -category is an equivalence if and only if the functor extends to a functor along the inclusion . Meaning, if there is a solution to the lifting problem of -categories
[TABLE]
By contrast, we can also determine the indexing shape – which we will denote by and features e.g. in [Lac04, §6] as – parametrizing adjoint equivalences in a -category.
Construction 1.2.10** (The walking adjoint equivalence).**
We denote by the walking adjoint equivalence, which is obtained from by imposing the relations
[TABLE]
The -category can be understood as the pushout of -categories
[TABLE]
Here denotes the -category consisting of two parallel -morphisms the vertical map is a coproduct of two copies of the canonical folding map . The set of objects of is and the hom-categories
[TABLE]
are all isomorphic to , the category with countably many objects and a unique morphism between any two objects.
By design, walking adjoint equivalence detects equivalences in the following sense.
Remark 1.2.11*.*
A -morphism in a -category is an adjoint equivalence if and only if the functor extends to a functor along the inclusion . Meaning, if there is a solution to the lifting problem of -categories
[TABLE]
Although we know by Theorem 1.2.7 that equivalences and adjoint equivalences define the same notion, there is a sense in which the notion of adjoint equivalence is more coherent than the basic equivalence. This is manifested at the level of indexing shapes and : in the morphisms and that have been added from are unrelated, and the extra coherence relation is then added in . A precise formulation of this fact will be given in Propositions 1.3.2 and 1.3.3, where we will discuss that is a contractible -category while is not. Note that, although perhaps counterintuitively, this is not a contradiction to Theorem 1.2.7.
Digression 1.2.12*.*
There is a notion of adjunction in a -category, meaning a generalization of the idea of an (adjoint) equivalence for which the -morphisms and are not necessarily invertible. This goes back to [Kel69, §2] and [KS74, §2]. The corresponding corepresenting object, meaning what could be referred to as the walking adjunction, is studied in [SS86] and also reused in [RV16, Remark 3.3.8]. An alternative construction of from Construction 1.2.10 is to impose the invertibility of -morphisms corepresenting the unit and counit in the walking adjunction.
1.2.5. The fundamental category of a -category
The equivalence relation for objects in a -category can also be tested as isomorphism relation in a suitable category or equality in a suitable set.
Definition 1.2.13**.**
Given a -category , the fundamental category of is the category
[TABLE]
obtained by base change along the product-preserving functor . More explicitly, its set of objects is
[TABLE]
and its hom-sets are
[TABLE]
This defines a product-preserving functor .
Remark 1.2.14*.*
Given a -category and , the following are equivalent.
- (0)
There is an equality
[TABLE] 2. (1)
There is an isomorphism
[TABLE] 3. (2)
There is an equivalence
[TABLE]
1.3. Equivalence of -categories and inside a -category
1.3.1. Biequivalences of -categories
The notion of biequivalence of -categories is classical and appears e.g. as [Str80, §1.33] and [Lac02, §3].
Definition 1.3.1** (Biequivalence of -categories).**
A -functor is a biequivalence of -categories, and we write , if
- (1)
the -functor is surjective on objects up to equivalence, meaning that for every object there exists an object and an equivalence
[TABLE] 2. (2)
and the -functor is a hom-wise equivalence, meaning that for all objects the -functor induces equivalences
[TABLE]
Two -categories are biequivalent, and we write , if there exists a biequivalence between them.
We immediately make use and explore the meaning of biequivalence of -categories with the following two propositions, which feature in [Lac04] and are there attributed to Joyal. They formalize the idea that is not coherent, while is.
Proposition 1.3.2**.**
The -category is not contractible, namely
[TABLE]
We give two independent proofs of this fact.
Model categorical proof.
The lifting problem in
[TABLE]
where the left vertical map is the folding map, does not admit a lift. Given that the left vertical map is a cofibration in the canonical model category (see [Lac02, Lac04] for an explicit description), the map cannot be an acyclic fibration. Since it is a fibration, it means it cannot be a weak equivalence. ∎
Polygraphic homology proof.
The chain complex associated to the -category as described in [Gue21, §4.2] (based on ideas from [Bou84, §7]) is of the form
[TABLE]
Given that
[TABLE]
the second homology of , which is the polygraphic homology of , is given by
[TABLE]
By [Gue21, Proposition 4.3.3], we obtain , as desired. ∎
The following is discussed in [Lac04, §6].
Proposition 1.3.3**.**
The -category is contractible, namely
[TABLE]
Proof.
Consider the unique functor . There is an equivalence (in fact an equality)
[TABLE]
and induces an equivalence
[TABLE]
Similarly, the functors , and are equivalences of categories. So there is a biequivalence , as desired. ∎
Remark 1.3.4*.*
In the context of the canonical model structure on the category (see [Lac02, Lac04] for an explicit description), the object is a cylinder on the terminal object in the sense of [Hov99, Definition 1.2.4]. Meaning, it comes with a factorization
[TABLE]
of the folding map of into a cofibration followed by a weak equivalence (in fact acyclic fibration). Note that is not the unique cylinder object, and shouldn’t be expected to be. In fact, two other cylinder objects are given by and , which are obtained by gluing two copies of , respectively, identifying with or with . Instead, the category – regarded as a discrete -category – is not a cylinder object in this context, as it is not cofibrant.
We now explore to which extent the notion of biequivalence is related to the existence of an inverse. One direction always holds:
Remark 1.3.5*.*
A -functor between -categories is a biequivalence if there exists a -functor and equivalences
[TABLE]
The hope for having equivalence of the two statements, in general, turns out to be false. We now recall how the other implication may fail.
Remark 1.3.6*.*
If a -functor between -categories is a biequivalence, it is not generally true that there exists a -functor and -equivalences
[TABLE]
It is shown in [Lac02, Example 3.1] that a counterexample is given by a -functor of the form . Here, is the -category whose underlying category is , with a -morphism from the -morphism to the -morphism if and only if is even.
An alternative option is to consider an appropriate -category of pseudo-functors from to , for any -categories and . The following is mentioned e.g. in [Str80, §1.33] and in [Lac02, §3].
Theorem 1.3.7**.**
A -functor between -categories is a biequivalence if and only if there exists a pseudo-functor and -equivalences
[TABLE]
1.3.2. -categories
The viewpoint from Remarks 1.3.5 and 1.3.7 is taken to define the notion of a biequivalence in any -category.
Recall that a -category consists of
- •
a set of objects ,
- •
for every a hom--category ,
- •
for every , an identity -functor
[TABLE]
- •
for every , a composition -functor
[TABLE]
satisfying same axioms as (1.1.1) and (1.1.2) read in -categories, as opposed to sets.
In particular, the data of a -category determines a set of -morphisms, a set of -morphisms and a set of -morphisms given by
[TABLE]
[TABLE]
Amongst other structual operators, one also gets composition operators defined for all and all pairs of -cells such that .
Given categories and , a -functor consists of
- •
a function on objects
[TABLE]
- •
and a -functor on hom--categories for every
[TABLE]
satisfying the functorial properties from (1.1.3) and (1.1.4).
For instance, the large -category of -categories, -functors and -natural transformations can also be regarded as a -category: the (large) -category of -categories, -functors, -natural transformations, and modifications, with usual composition of functors and natural transformations and modifications. One could also consider : the large -category of -categories, pseudo-functors, pseudo-natural transformations, and modifications.
1.3.3. Biequivalences and biadjoint biequivalences in a -category
The definition of biequivalence in a -category appears e.g. as [GPS95, Definition 3.5], and also plays a central role in [Gur12, §2].
Definition 1.3.8** (Biequivalence in a -category ).**
A -morphism in a -category is a biequivalence, and we write , if there exists a -morphism in and equivalences
[TABLE]
Two objects are -equivalent, and we write , if there exists an equivalence between them.
Remark 1.3.9*.*
For a -functor, the notion of biequivalence in specializes to that of biequivalence of -categories when read in the case of the large -category . However, when read in the large -category , it does not specialize to Definition 1.3.8 (see Remark 1.3.6, cf. also the discussion of [Lac10, §7.5]).
It is easily verified that the relation of being biequivalent for objects in a -category is an equivalence relation.
There is a characterization of equivalences in a -category in terms of biadjoint biequivalences, which we now recall. The following is [Gur12, Definition 2.3] (see also [CCKS21, Definition 3.12]).
Definition 1.3.10** (Biadjoint biequivalence à la Gurski in a -category ).**
A -morphism in a -category is a biadjoint biequivalence in if there exists a -morphism in and -morphisms between -morphisms
[TABLE]
and -morphisms
[TABLE]
and satisfying the swallowtail relations
[TABLE]
The following is [Gur12, Theorem 4.5].
Theorem 1.3.11**.**
A -morphism in a -category is a biequivalence if and only if it is a biadjoint biequivalence in .
1.3.4. The walking biequivalence and bidajoint biequivalence
We seek an indexing shape – which we will denote by – parametrizing biequivalences in a -category. Given a -category , we denote by the suspension -category, which consists of two objects and one non-trivial hom--category given by (see e.g. [AM20, §B.6.5]). This defines a functor .
Construction 1.3.12** (The walking biequivalence).**
We denote by the walking biequivalence, which is obtained from by freely adding the isomorphisms
[TABLE]
It can be described as the pushout of -categories
[TABLE]
Here, the left vertical maps are suspensions of canonical maps that define and as pushouts in Constructions 1.1.6 and 1.2.8.
By design, the walking biequivalence detects biequivalences in the following sense.
Remark 1.3.13*.*
A -morphism in a -category is a biequivalence if and only if there is a solution in to the lifting problem of -categories
[TABLE]
We can also determine the indexing shape – which we will denote by – parametrizing biadjoint biequivalences in a -category.
Construction 1.3.14** (Gurski’s biadjoint biequivalence).**
We denote by the walking biequivalence, which is obtained as the following iterated pushout
[TABLE]
Here, denotes the -category consisting of two parallel -morphisms and the last vertical map is the sum of two copies of the canonical folding map that identifies the two -morphisms. Instead, the first two left (non-isomorphism) vertical maps are suspensions of canonical maps that define and as pushouts in Constructions 1.2.8 and 1.2.10, and the right (non-isomorphism) vertical map is an iterated suspension of the canonical map .
The -category is designed to detect biadjoint biequivalences:
Remark 1.3.15*.*
A -morphism in a -category is a biequivalence if and only if there is a solution to the lifting problem of -categories
[TABLE]
Like before, although biequivalences and biadjoint biequivalences define the same notion, there is a sense in which the notion of biadjoint biequivalence is more coherent than the basic biequivalence. A precise formulation of this fact will be given Propositions 1.4.8 and 1.4.9, where we will discuss that is conjecturally a contractible -category while is not.
Digression 1.3.16*.*
There several variants of notions of biadjunctions in a -categories, meaning a generalization of the idea of a (biadjoint) biequivalence for which the - and -cells occurring are not necessarily invertible, even in a weak sense. These include [Gur12, Definition 2.1], [Ara22, Definition 6.2], [Lac00], [Ver11, Example 1.1.7], [Kel89, §6], [Pst22, §3].
1.4. Equivalences of -categories and inside an -category
After having explored the meaning of the appropriate notion of sameness for -categories for the low values , we are now ready to discuss this for arbitrary . Unsurprisingly, setting this up requires an induction that builds on previous notions and terminology, so we fix the following conventions. We follow the convention that
- •
The relation is equality, the relation is isomorphism, the relation is equivalence and the relation is biequivalence.
- •
is the set , is the category , is the category .
- •
is , is , is and is .
With these conventions, and assuming to know the notions of -category and -functor, the category , the notion of -equivalence of -categories and the notion of equivalence in an -category , we will recall by induction on the notions of -category and -functor, the category , the notion of -equivalence of -categories and the notion of -equivalence in an -category .
Given the inductive nature of the definitions, making sense of something (e.g. Definition 1.4.1) anywhere in this section for a certain , assumes one being able to make sense of everything (e.g. Definition 1.4.3) in this section for . We include for the reader’s convenience a table summarizing how some of the key definitions build on each other for different values of :
[TABLE]
1.4.1. -categories
Following the convention that a [math]-category is a set (and recovering the fact that a -category is a category), recall from e.g. [EK66, §IV.2] (cf. also [Ehr63]) that an -category consists of
- •
a set of objects ,
- •
for every a hom--category ,
- •
for every , an identity -functor
[TABLE]
- •
and, for every , a composition -functor
[TABLE]
satisfying same axioms as (1.1.1) and (1.1.2) read in -categories as opposed to sets.
In particular, the data of an -category also determines a collection of sets for , where by convention is the set of objects of and is the set of -morphisms given by
[TABLE]
Amongst other structural operators, one also gets composition operators defined for all and all pairs of -cells such that . Given -categories and , an -functor consists of
- •
a function on objects
[TABLE]
- •
and an -functor on hom--categories for every
[TABLE]
satisfying the functorial properties from (1.1.3) and (1.1.4) read in -categories as opposed to sets.
1.4.2. -equivalences of -categories
We now define the relation of -equivalence between -categories inductively for . This approach is consistent with the one from [Str87, §1] and is also the usual notion of equivalence in enriched contexts from e.g. [Kel82, §1.11] or [JY21, Def. 1.3.11].
Definition 1.4.1** (-equivalence of -categories).**
An -functor between -categories is an -equivalence, and we write , if
- (1)
the -functor is surjective on objects up to equivalence, meaning that for every object there exists an object and an -equivalence444Note that -equivalence inside is defined either in previous sections (for ) or in Definition 1.4.3 (for ).
[TABLE] 2. (2)
the -functor is a hom-wise -equivalence, meaning that for all objects the -functor induces -equivalences
[TABLE]
Two -categories are -equivalent, and we write , if there is an -equivalence between them.
We now explore how the notion of -equivalence guarantees the existence of a kind of inverse. Like before, one should not expect that an equivalence of -categories should have an inverse (cf. Remark 1.3.6), but one direction always holds. The following is alluded to in [GPS95, §1], referring to [Str87].
Remark 1.4.2*.*
An -functor between -categories is an -equivalence if there exists an -functor and -equivalences
[TABLE]
The following notion of an -equivalence in an -category is treated in [Str87, §1].
Definition 1.4.3** (-equivalence in an -category ).**
An -morphism in an -category is an -equivalence if and only if there exist a -morphism and -equivalences
[TABLE]
Two objects of are -equivalent, and we write , if there is an -equivalence between them.
1.4.3. The fundamental -category of an -category
Testing whether two objects and in an -category are -equivalent can be tested as an -equivalence in a suitable -category instead, which we now describe.
Definition 1.4.4**.**
Let . Given an -category the fundamental -category of is the -category
[TABLE]
obtained by base change along the product-preserving functor . This defines a product-preserving functor . More explicitly, its set of objects is
[TABLE]
and its hom--categories are
[TABLE]
For , the fundamental -category of is by induction defined to be the -category
[TABLE]
The following is a consequence of the definitions.
Proposition 1.4.5**.**
Let . Given an -category and , the following are equivalent.
- (1)
There is an -equivalence
[TABLE] 2. (2)
For some – hence for all – there is a -equivalence
[TABLE]
Proof.
We prove the statement by induction on further assuming for simplicity of exposition. The other values of can be treated similarly with a further induction on .
The base of the induction, the case , is Remark 1.1.10, and we now assume . Let . Having an -equivalence
[TABLE]
is equivalent to the existence of and so that there are -equivalences
[TABLE]
[TABLE]
This is in turn equivalent – by induction hypothesis – to the existence of -equivalences
[TABLE]
[TABLE]
Finally, this is equivalent to the existence of an -equivalence
[TABLE]
This concludes the proof. ∎
This fact allows one to see that Definition 1.4.1 is consistent with the approach to equivalences of weak -categories from [Tam99], [Sim12, §20], [Pao19, §§6.1-6.2].
1.4.4. The walking -equivalence
We seek an indexing shape – which we will denote by – parametrizing -equivalences in an -category. We follow the convention that , we have , and are precisely , and , and, assuming to know how is defined we define for general .
Given an -category , we denote by the suspension -category, which consists of two objects and one non-trivial hom--category given by (see e.g. [AM20, §B.6.5]) for more details. This defines a functor .
Construction 1.4.6** (The walking -equivalence).**
Let . We denote by the walking -equivalence, which is obtained from as the pushout of -categories
[TABLE]
Here, the left (non-isomorphism) vertical map is the coproduct of two suspension of canonical maps that define by induction hypothesis.
The -category is designed to detect -equivalences:
Remark 1.4.7*.*
A -morphism in an -category is an -equivalence if and only if there is a solution to the lifting problem of -categories
[TABLE]
The following could be proven with similar techniques to those from Proposition 1.3.2.
Proposition 1.4.8**.**
Let . The -category is not contractible, namely
[TABLE]
We know for abstract reasons that for all there exists a contractible category with two objects. This can be obtained, for instance, by factoring the unique map as a cofibration followed by a weak equivalence
[TABLE]
in the canonical model structure on from [LMW10, Theorem 6.1].
However, we are not aware of a way to construct the -category explicitly beyond for which we have discussed . Even for , one can consider the candidate , which is likely to be contractible, but we are not aware of a proof.
Conjecture 1.4.9**.**
The -category is contractible, namely there is an equivalence of -categories
[TABLE]
1.5. Equivalences of -categories and inside an -category
1.5.1. -categories
While the notion of an -category foresees the presence of morphisms up to dimension , allowing cells in all dimensions leads to the notion of an -category. We refer the reader to e.g. [Str87, §1] for a traditional approach to the definition of an -category, but we briefly recall the main features here.
The data of an -category consists of a collection of sets , , where is called the set of objects of and , , is the set of -cells or -arrows or cells of dimension of , together with:
- •
source and target operators for all ;
- •
identity operators for all ;
- •
composition operators defined for all and all pairs of -cells such that .
Notice that this is equivalent to endowing every pair , , with the structure (but not the axioms, yet) of a category. For all , we ask that the triple together with all the relevant source, target, identity and composition operators is a -category. In particular, for every there is a hom--category .
An -functor between -categories and is a collection of maps for that preserves source, target, identity, and composition. We denote by the (large) category of (small) -categories and -functors.
A cell in an -category which is the identity of a lower dimensional cell is said to be trivial. An -category in which all -cells are trivial for is precisely an -category, and an -functor between -categories reduces precisely to an -functor.
1.5.2. -equivalences of -categories
The following is from [AL20, §1.2] (see also [Lou21, Définition 1.1.7]).
Definition 1.5.1** (Structure of reversibility).**
Let be an -category, and a set of morphisms of . We say that is a structure of reversibility if for every and for every -cell in there exist in a -cell and -cells
[TABLE]
The following terminology is consistent with [LMW10, Definition 4.2] (and with [ABG*+*]).
Definition 1.5.2** (-equivalence in an -category ).**
A -morphism in an -category is an -equivalence, and we write , if there exists a structure of reversibility in the -category containing . Two objects and in are -equivalent, and we write , if there is an -equivalence between them.
It is easily verified that the relation of being -equivalent for objects in an -category is an equivalence relation.
The following recovers the notion of weak equivalence from [LMW10, Definition 4.7] (and -equivalence from [ABG*+*]).
Definition 1.5.3** (-equivalence of -categories).**
An -functor between -categories is an -equivalence, and we write , if and only if
- ((1))
the -functor is surjective on objects up to -equivalence, meaning that for every object there exists an object and an -equivalence
[TABLE] 2. ((2))
and the -functor is surjective on -morphisms up to -equivalence, meaning that, for all -morphisms in and all -cells in , there is a -cell in so that
[TABLE]
Two -categories and are -equivalent, and we write , if there is an -equivalence between them.
Remark 1.5.4*.*
In the context of Definition 1.5.3, Condition (2) can be replaced with
- (2’)
the -functor is a hom-wise -equivalence, meaning that for every the morphism induces an -equivalence
[TABLE]
For an -functor , having an inverse implies being an equivalence of -categories:
Remark 1.5.5*.*
An -functor is an -equivalence if there exists an -functor and -equivalences
[TABLE]
Once again, in general, one should not expect that an equivalence of -categories should in general have an inverse (cf. Remark 1.3.6).
1.5.3. The walking -equivalence
We seek an indexing shape – which we will denote by – parametrizing -equivalences in an -category. The same construction occurs in the literature as from [AL20, Remark 4.4]. The categorical structure of essentially encodes the structure given by the set of witnesses from [Che07], the reversibility structure from [AL20, Remark 4.4] and the quasi-invertible structure from [Ric20, §1.4]
Construction 1.5.6**.**
By induction on , one gets a map
[TABLE]
Indeed, for this is the map
[TABLE]
induced at the pushout level by the map of spans
[TABLE]
and for it is the map
[TABLE]
induced at the pushout level by the map of spans
[TABLE]
Construction 1.5.7** (The walking -equivalence).**
We denote by the walking -equivalence, obtained as the limit in -categories of the maps from Construction 1.5.6
[TABLE]
The following explains how relates with . Consider the intelligent truncation functor from [AM20, §1.2], which is the left adjoint to the canonical inclusion . Roughly, the functor universally enforces all morphisms in dimension to be equalities.
Remark 1.5.8*.*
If denotes the intelligent truncation from [AM20, §1.2], we have that for every there is an isomorphism of -categories
[TABLE]
The -category is designed to detect -equivalences:
Remark 1.5.9*.*
A -morphism in an -category is an -equivalence if and only if there is a solution in to the lifting problem
[TABLE]
The following can be proven using techniques similar to Proposition 1.3.2.
Proposition 1.5.10**.**
Note that is not contractible, namely
[TABLE]
1.5.4. The possibly coherent walking -equivalence
We know for abstract reasons (cf. [LMW10, §4.7]) that there exists a contractible -category with two objects, and it will be shown in the forthcoming manuscript [ABG*+*] that such -category would automatically parametrize -equivalences.
However, we are not aware of a known model for this -category in the literature, and we consider a candidate here. This is inspired by conversations with Rice related to [Ric20, Definition 11] and conversations with Ara, Métayer, and Mimram. It is also possibly related to [HL23, Construction 4.29].
Construction 1.5.11**.**
We denote by the free category generated by three morphisms , and . This is obtained by gluing “head-to-tail” with both and , and generating all possible compositions. The set of objects is . The category can be understood as the pushout of categories
[TABLE]
Construction 1.5.12**.**
For , we define inductively to be an -category (in fact an -category) coming with a map :
- •
Set to be and to be .
- •
For , set to be the pushout of -categories
[TABLE]
Construction 1.5.13** (The walking -equivalence).**
We denote by the possibly coherent walking -equivalence, obtained as the colimit in -categories
[TABLE]
The -category is, evidently, an -category with non-trivial morphisms in each dimension, and in particular it is not an -category for any finite . However, there are (at least) two natural ways to “approximate” it by an -category, given by considering the left and right adjoint of the canonical inclusion , discussed in [AM20, §1.2]. We have already mentioned the left adjoint, the intelligent truncation , and we now consider as well the right adjoint, the rough truncation . Essentially, the functor forgets all morphisms in dimension higher than .
Remark 1.5.14*.*
By construction, the rough -truncation of is isomorphic to the -th layer from Construction 1.5.12, namely
[TABLE]
Instead, the computation of the intelligent -truncation of is non-trivial. For lower levels, one can show that there are identifications
[TABLE]
The computation for is a straightforward check. The one for relies on the fact that an isomorphism in a category can be described as discussed in Remark 1.1.5. The one for is already delicate, and we briefly sketch an argument, leaving the details to the interested reader. If denotes the left Quillen functor from [OR21a, Construction 4.8], one can obtain biequivalences
[TABLE]
We wonder whether is contractible:
Question 1.5.1**.**
Is it true that the -category is contractible, namely that there is an -equivalence
[TABLE]
The potential contractibility of can be formulated in several equivalent ways, as follows.
Proposition 1.5.15**.**
The following are equivalent.
- ((1))
There is an -equivalence
[TABLE] 2. ((2))
For all there is an -equivalence
[TABLE]
Proof.
Recall from [LMW10, Theorem 4.39] (resp. [LMW10, Theorem 6.1]) the canonical model structure on (resp. ), in which every object is fibrant and the weak equivalences are precisely the equivalences of -categories from Definition 1.5.3 (resp. the -equivalences of -categories from Definition 1.4.1). The fact that (1) implies (2) is a consequence of the fact that is a left Quillen functor and is cofibrant by construction, and we now show that (2) implies (1).
Saying that there is an equivalence of -categories as in (1) is equivalent to saying that the unique map is an acyclic fibration in . Given the explicit set of generating cofibrations for from [LMW10, Theorem 4.39], the same statement amounts to solving for all a generic lifting problem in of the form
[TABLE]
Given the naturality square (of the counit of the adjunction on the given map )
[TABLE]
we see that the map must factor through and it hence suffices to solve the lifting problem in
[TABLE]
Given the isomorphism
[TABLE]
it suffices to solve the lifting problem
[TABLE]
By transposing along the adjunction , it suffices to solve the lifting problem of -categories
[TABLE]
Given that there is an equivalence by (2) with , and given that is a cofibration in , we obtain that this lifting problem admits a solution, as desired. ∎
Given (1.5.1) – combined with Propositions 1.2.2 and 1.3.3 – we know that the equivalent conditions (1) and (2) hold for , but we don’t have a proof for higher .
Indications towards the potential contractibility of are the following.
- •
The polygraphic homology of the -category vanishes in positive degrees, and this is by [Gue21, §4.3] a necessary condition for the contractibility of .
- •
It is plausible that the -category agrees with the construction from [Ric20, Definition 11], which is shown to be contractible in the sense of [Ric20, Definition 21] in [Ric20, Theorem 22], and this is likely a necessary condition for the contractibility of .
However, depending on how the construction from [HL23, Construction 4.29] is related to Construction 1.5.13, it is possible that [HL23, Lemma 4.33] implies that the answer to Question 1.5.1 is no.
2. Equivalences of and inside weak higher categories
Throughout this section, we assume the basic language and theory of Kan complexes, which we refer to as spaces, and of quasi-categories, which we refer to as -categories. In particular, we will allow ourselves to cite results about spaces and -categories when needed.
Building on this prerequisite, we will then give an informal introduction to the notion of -categories and the notion of appropriate equivalence between -categories and inside an -category. Although the details will be some times omitted, all the statement are rigorous.
Following this convention, an -category will always refer to a quasi-category (so really a simplicial set that admits lifts of inner horns), while an -category would refer to the general notion, of which quasi-categories are just one incarnation. To exemplify this convention, here’s one possible sentence: An -category can be presented by different models. For instance, it could be presented by an -category, i.e., a quasi-category, or by a complete Segal space.
We will continue reserving the use of calligraphic letters, such as , , , for (strict!) -categories, consistently with the previous section. Instead, we will reserve script letters, such as , , for -categories or -categories. To showcase the convention, here are some relevant examples that will feature in this section:
- •
denotes the (-)category of -categories;
- •
will denote the -category of -categories;
- •
will denote the -category of -categories;
- •
denotes the category of marked simplicial sets.
- •
will denote the model structure for -categories on the category of marked simplicial sets, whose underlying -category is ;
2.1. Review of -categories
2.1.1. -categories
An -category is an -groupoid, a.k.a. a space. Spaces assemble into a (cartesian closed) -category . One way to construct it is as the -category underlying the (cartesian) Kan–Quillen model structure for Kan complexes.
Let now . Assuming to know what is an -category and what is the cartesian -category of -categories, we now recall by induction on the idea of an -category and the cartesian -category .
Without loss of generality555Some features in this presentation of the notion are not intrinsic to the notion of an -category, meaning that they are not invariant under the appropriate notion of equivalence that will be introduced in Section 2.2. One of these is, for instance, the set of objects. Although it may appear to be a potential issue, it is not.
we can assume that a (small) -category for consists in particular of
- •
a set of objects
- •
for every a hom--category ,
- •
an identity operator function for every
[TABLE]
- •
and a composition -simplex for every in the -category
[TABLE]
satisfying for every the associativity axiom from (1.1.1), given by the commutativity of the diagram in the -category
[TABLE]
for every the unitality axiom from (1.1.2), also in the -category . A complete definition would also require coherent homotopies expressing the associativity and unitality of iterations of the composition operator. There are several ways to make this precise, including – but not limited to – categories strictly enriched over a cartesian closed model structure for -categories as in [BR13, Theorem 3.11] or -categories enriched over the -categories of -categories as in [GH15, §5,6].
Given an -category , one sees – by induction on – that has -morphisms for and several composition maps along morphisms of a lower dimension, similarly to the strict cases, where axioms are replaced with lots of coherence data. With respect to these composition maps, all morphisms in dimension higher than are invertible. This is consistent with the fact that an -category recovers the notion of an -category.
Assuming that an -functor is a map of spaces, and assuming to know what is an -functor, we now recall by induction on the idea of an -category and the cartesian -category . Given -categories and , for , an -functor consists in particular of
- •
a function on objects
[TABLE]
- •
and an -functor on hom--categories for every
[TABLE]
satisfying the functorial properties from (1.1.3) and (1.1.4) in the -category . Again, a complete definition would also require coherent homotopies expressing the associativity and unitality of iterations of the composition operator functorial properties involving more than two inputs.
-categories assemble into a (cartesian closed) -category , of which the [math]-simplices are -categories and the -simplices are the -functors. One can build the (cartesian closed) -category of -categories using the formalism from [GH15, Remark 5.7.13, §6.1] (see also [Hei20]), or by taking the underlying -category of one of the (cartesian) model structures for -categories.
Model structures for -categories include the Joyal model structure quasi-categories (from [Joy08b, §6.1], [Lur09a, Theorem 2.2.5.1]), the Bergner model structure for Kan-enriched categories (from [Ber07a]), and the Lurie model structure for naturally marked quasi-categories (from [Lur09a, Proposition 3.1.3.7]). Model structures for -categories include the Lurie model structure for -bicategories (from [Lur09b, Theorem 4.2.7] and [GHL22, Definition 6.1]). Model structures for -categories for general include the Verity model structure for saturated -complicial sets (from [OR20, Theorem 1.25]), the Barwick model structure for -fold complete Segal spaces (from [Bar05]), the Rezk model structure for complete Segal -spaces (from [Rez10, §11]), the Ara model structure for -quasi-categories (from [Ara14, §5.17]), the Bergner–Lurie model structure for categories enriched over -categories (from [Lur09a, Theorem A.3.2.24] applied for instance to [Lur09a, Example A.3.2.23]), and the Campion–Doherty–Kapulkin–Maehara model structure for saturated -comical sets (from [CKM20, DKM21]). To see that all these models are equivalent, and precisely that they have an underlying -category equivalent to , see – amongst others – [Ber07b, BR13, Lur09a, Lur09b, Ara14, BR20, DKM21, GHL22, Lou22b].
Historically, before the notion of -category, other notions of weak -categories were developed in order to encode phenomena of interest. These are sometimes referred to as weak -categories or -categories. The idea is that an -category has -morphisms for any and all axioms for -morphisms encoding the categorical structure only hold up to an invertible -morphism. By contrast, an -category could be seen as a special case of -category, for which there are no non-identity -morphisms in dimension .
In the lower dimensions (, , and to some extent ), fully algebraic descriptions of weak -categories are available, for instance in the models of bicategories [Bén67], tricategories [GPS95] and tetracategories [Tri06]. For general , there are also versions of the notion of -category which are based on higher operads, with the original notion appearing in [Bat98], and further variants in [Lei04, §9-10]. Other (non-fully-algebraic) models of -categories for general are Tamsamani categories, originally from [Tam99] and further developed in [HS98, Pel03, Sim12, Pao19].
Weak -categories assemble into an -category . For there is an -category of weak -categories or -truncated -categories. A model for this -category was originally constructed as a relative category in [Tam99], and was further studied in [HS98, Pel03, Sim12, Pao19]. Alternatively, this -category can be constructed following [GH15, Proposition 6.1.7] as an -localization of the -category . See also [GH15, Remark 6.1.3] for how the approaches are related.
2.1.2. Some notable functors
We discuss ways in which the theory of -categories has to interact with others, such as the theory of strict -categories from Section 1 and the theory of -categories for .
Remark 2.1.1*.*
For , there is an inclusion of -categories
[TABLE]
morally given by the fact that any -category can be regarded as an -category with no non-identity morphisms in dimension higher than . This -functor admits a right adjoint, called the core functor,
[TABLE]
which intuitively retains in dimension only the morphisms that are invertible.
The adjunction of -categories
[TABLE]
can be implemented in the model of -categories given by Verity’s model structure on saturated -complicial sets. Precisely, it is the underlying adjunction of -categories of the adjunction from [Ver08, Notation 13], which can be shown to be a Quillen pair using [Ver08, Lemma 25, Corollary 108].
In particular, for all there are -colimit preserving inclusions of -categories
[TABLE]
Also, for , there exists a functor
[TABLE]
Remark 2.1.2*.*
For , if denotes the -category of bipointed -categories, there is a hom functor
[TABLE]
which essentially extracts the hom at two given points. The hom functor admits a left adjoint, called the suspension functor
[TABLE]
which builds an -category with exactly two objects and one interesting hom between the two objects given by the input. The adjunction
[TABLE]
is treated as [GH15, Definition 4.3.21] and can be implemented in the model of -categories given by Verity’s model structure on saturated -complicial sets via the Quillen pair from [OR22, Lemma 2.7], in the model for complete Segal -spaces via the left Quillen functor from [Rez10, Proposition 4.6], or in the model of categories enriched over complete Segal -spaces.
In total, one can forget the base points and iterate the construction, obtaining a functor
[TABLE]
The following records in which sense the core functor and the hom functor commute with each other. It can also be seen as a variant of (1.4.1) for -categories.
Proposition 2.1.3**.**
Let . Let be an -category and . There is an -equivalence of -categories
[TABLE]
Proof of Proposition 2.1.3.
One can prove (for instance in the model of saturated -complicial sets) that there is a commutative diagram of left adjoint -functors:
[TABLE]
So by [RV22, Proposition 2.1.10] one obtains a commutative diagram of the corresponding right adjoint -functors:
[TABLE]
and this concludes the proof. ∎
Let denote the -category of (strict) -categories, which can be constructed as the underlying -category of the canonical model structure for -categories from [LMW10, Theorem 6.1]. We briefly discuss the state of the art of the functors that relate the -categories of strict and weak -dimensional categories by distinguishing or the case of general .
Remark 2.1.4*.*
For , there is an inclusion of -categories666We say that is an inclusion of -categories if it is a map of -categories that is a hom-wise equivalence of Kan complexes and injective-on-objects up to equivalence in .
[TABLE]
that essentially regards a strict -category as an -category in the natural way. This -functor admits a left adjoint
[TABLE]
which intuitively enforces all morphisms of dimension higher than and coherence equivalences to be equalities. The adjunction
[TABLE]
can be realized as a nerve-categorification Quillen reflection in most models of -categories presented by model categories. For , this can be easily implemented in Kan complexes, and for , this can be done in quasi-categories, naturally marked quasi-categories, and complete Segal spaces (see e.g. [MOR22, §4.2]). For , this was done in saturated -complicial sets [OR21a], in -quasi-categories [Cam20], in -fold complete Segal spaces [Mos20], and in categories enriched over -categories [MOR22, §4.2], [GHL22, §1]. For general , the adjunction (2.1.4) is potentially realized by the Quillen pair from [HL23, Definition 4.46, Theorem 4.50].
Consider the functor
[TABLE]
This functor does not preserve -pullbacks, but the following lemma records a crucial weaker compatibility of this functor with pullbacks that will play a role in Propositions 2.3.1 and 2.3.2.
Lemma 2.1.5**.**
Given functors of -categories and , we have that
[TABLE]
Proof.
Since preserves -limits, saying that
[TABLE]
is equivalent to saying that
[TABLE]
which can be seen (for instance using the argument from [Lin21]) to be equivalent to saying that
[TABLE]
so we are done. ∎
2.2. -equivalence of -categories
We follow the convention that an -equivalence inside an -category is a path.
Let now . Assuming to know what is an -equivalence inside an -category we now define inductively for an -equivalence inside an -category.
Definition 2.2.1** (-equivalence in an -category ).**
Let . A -morphism in an -category is an -equivalence if and only if there exist a -morphism and -equivalences
[TABLE]
Two objects in an -category and are -equivalent, and we write , if there is an -equivalence between them.
We can give an immediate variant of the definition.
Proposition 2.2.2**.**
Let . A -morphism in an -category is an -equivalence if and only if there exist -morphisms and -equivalences
[TABLE]
Proof.
The forward implication is straightforward, by taking and . For the backwards implication, we observe that there is an -equivalence
[TABLE]
One can then use and to produce an appropriate as
[TABLE]
so we are done. ∎
2.2.1. Alternative viewpoints
We discuss ways that the notion of equivalence in an -category has to interact with the notion of equivalence in a strict -category from Section 1.4.2 and in an -category for .
Recall the functor from Remark 2.1.1. The following characterization of -equivalences in terms of lower dimensional cores can be seen as a variant of Proposition 1.4.5 for -categories. It is similar to the approach originally taken in [Tam99, HS98, Pel03, Sim12, Pao19] to define equivalences in a weak -category.
Proposition 2.2.3**.**
Let . Let be an -category and . The following are equivalent.
- (1)
There is an -equivalence
[TABLE] 2. (2)
For some – hence for all – there is an -equivalence
[TABLE]
We can now prove the proposition.
Proof.
We prove the statement by induction on further assuming for simplicity of exposition. The other values of can be treated similarly with a further induction on . The base of the induction, the case , , can be shown using [Joy08b, Proposition 1.14], and we now assume . Let .
Having an -equivalence
[TABLE]
is equivalent to the existence of and so that there are -equivalences
[TABLE]
[TABLE]
This is in turn equivalent – by induction hypothesis and Proposition 2.1.3– to the existence of -equivalences
[TABLE]
[TABLE]
Finally, this is equivalent to the existence of an -equivalence
[TABLE]
This concludes the proof. ∎
Recall the functor from Remark 2.1.4. We discuss – at least for low values of – a characterization of -equivalences in terms of -equivalences after applying .
Proposition 2.2.4**.**
Let . Let be an -category, and . The following are equivalent.
- (1)
There is an -equivalence
[TABLE] 2. (2)
There is an -equivalence
[TABLE]
The case is essentially by definition of , the case is essentially done in [Joy08a, §1.10], and the case is addressed in [RV22, Theorem 1.4.7]. The statement possibly also holds for higher , upon correct identification of the functor .
We follow the convention that an -equivalence between -categories is a homotopy equivalence. Let now . Assuming to know what is an -equivalence between -categories, we now define inductively for an -equivalence between -categories.
Definition 2.2.5** (-equivalence of -categories).**
Let . An -functor between -categories is an -equivalence if and only if
- (1)
the -functor is surjective on objects up to equivalence, meaning that for every object there exists an object and an -equivalence
[TABLE] 2. (2)
the -functor is a hom-wise -equivalence, meaning that for all objects the morphism induces -equivalences
[TABLE]
We can prove that that every -equivalence admits an inverse in a suitable sense.
Proposition 2.2.6** (-equivalence of -categories).**
Let . An -functor between -categories is an -equivalence if and only if there exists an -functor and -equivalences
[TABLE]
[TABLE]
The content of this proposition is essentially [GH15, §5.5, 5.6]. Precisely, the backwards implication is [GH15, Proposition 5.5.3], and the forwards implication is roughly discussed in [GH15, Remark 5.6.5]; a further closely related discussion appears in [GH15, Corollary 5.6.3]. We give an alternative proof.
Proof.
Without loss of generality, one can represent as a map between fibrant objects in the Verity model structure for saturated -complicial sets on marked simplicial sets from [OR20, Theorem 1.25]. By Definition 2.2.5, saying that is an -equivalence amounts to being a hom-wise equivalence of -categories and essentially surjective up to -equivalence. By [Lou22a, Corollary 3.2.11] this is equivalent to saying that is a weak equivalence in . Using [Hov99, Proposition 1.2.8], this is equivalent to saying that the map is a homotopy equivalence in , meaning that there exist a map and homotopies in
[TABLE]
By definition of -equivalence, this is equivalent to saying that there are -equivalences
[TABLE]
[TABLE]
One can show, by direct verification, that the model structure for complicial sets is simplicial with mapping spaces given by
[TABLE]
So the previous statement is equivalent to saying that there are -equivalences
[TABLE]
[TABLE]
By Proposition 2.2.3, this is equivalent to saying that there are -equivalences
[TABLE]
[TABLE]
as desired. ∎
2.2.2. Walking equivalence
We can determine an indexing shape parametrizing -equivalences in an -category. To this end, let and denote the -categories obtained by regarding the categories and as -categories via the inclusion of -categories from Remark 2.1.4. They will also be regarded as -categories for via the inclusion of -categories . It is evident that classifies -morphisms in an -category, and we will now show that detects -equivalences in an -category in a suitable sense.
Proposition 2.2.7**.**
A -morphism in an -category is an -equivalence if and only if there is a solution to the lifting problem in the -category
[TABLE]
To clarify the meaning of the proposition, we intend that there exists an -functor and an -equivalence
[TABLE]
Proof.
Without loss of generality, one can represent as a quasi-category, and the map as a -simplex . Using [DS11, Proposition 2.2] (and the model of right hom space in a quasi-category from [Lur09a, §1.2.2]), one can show that saying that is an -equivalence is equivalent to saying that there is a solution to the lifting problem in the category
[TABLE]
Using an argument similar to the one in the proof of Proposition 2.3.1, one can further see that this is equivalent to saying that there exists a solution to the lifting problem
[TABLE]
in the -category , as desired. ∎
We can now use the previous proposition about -categories in an -categories to prove the analog characterization for -equivalence in an -category.
Proposition 2.2.8**.**
Let . A -morphism in an -category is an -equivalence if and only if there is a solution to the lifting problem in the -category
[TABLE]
Proof.
Saying that is an -equivalence in the -category is by Proposition 2.2.3 equivalent to saying that is an -equivalence in . By Proposition 2.2.7, this is equivalent to saying that there exists a solution in the -category for
[TABLE]
By transposing along the inclusion-core adjunction of -functors from (2.1.2) for , this is equivalent to saying that there exists a solution in the -category for
[TABLE]
as desired. ∎
One could also study when a -morphism of an -category is an -equivalence. To this end, recall the suspension functor from (2.1.3) and consider the -categories and . They will also be regarded as -categories for via the inclusion of -categories . It can be seen, for instance using the model of complete Segal -spaces, that classifies -morphisms in an -category. We will now show that classifies -equivalences in an -category in a suitable sense.
Definition 2.2.9**.**
Let and . A -morphism in an -category is an -equivalence if and only if there is a solution to the lifting problem in the -category
[TABLE]
2.3. Model categorical techniques
We recall from [Hir03] a model-categorical Proposition 2.3.1 which will be a crucial tool in the sequel. This technical result will allow to interpret the notion of -equivalence in an -category presented by one of the usual models coming from model structures.
We denote by the (left) homotopy relation in . We denote by (resp. ) the initial (resp. terminal) object of .
The following technical fact allows one to work with strict lifting problems as opposed to lifting problems up to homotopy (meaning, inside an -category). We will use this proposition in Propositions 2.4.1, 2.4.2, 2.5.1 and 2.6.1.
Proposition 2.3.1**.**
Let . Let be a model category for -categories777in the sense of [BSP21, Definition 15.4] Suppose that and are cofibrant objects and that we are given a factorization of
[TABLE]
as a cofibration followed by a weak equivalence in . A -morphism in an -category is an -equivalence if and only if there is a solution to the (strict!) lifting problem in
[TABLE]
Proof.
By definition, being an equivalence in the -category is equivalent to the existence of a solution to the lifting problem in the -category
[TABLE]
This is equivalent to saying that there exists an -functor and an -equivalence
[TABLE]
Phrased in terms of mapping spaces, this is equivalent to saying
[TABLE]
Since derived mapping spaces in the model category compute the hom--categories of the -category , this is equivalent to saying
[TABLE]
By [Hir03, Theorem 17.7.2], this is equivalent to saying that
[TABLE]
This in turn is equivalent to the existence of an up-to-homotopy lift
[TABLE]
in . By [Hir03, Corollary 7.3.12], this is equivalent to having a strict lift in the same diagram, as desired. ∎
With an analog proof, one can prove a more general statement, which recovers the previous one for . Consider the map .
Proposition 2.3.2**.**
Let and . Let be a model category for -categories888in the sense of [BSP21, Definition 15.4]. Suppose that and are cofibrant objects. Suppose also that we are given a factorization of
[TABLE]
as a cofibration followed by a weak equivalence in . Then, a -morphism in an -category is an -equivalence if and only if there is a solution to the (strict!) lifting problem in
[TABLE]
Remark 2.3.3*.*
Given an explicit implementation of as a homotopical and cofibration-preserving functor , one can obtain an instance of (2.3.2) by applying to (2.3.1).
[TABLE]
In order to apply Proposition 2.3.1, there’s interest in , and in the most simple of their cofibrant replacements in the main model categories that model -categories. In the next section we will interpret Proposition 2.3.1 (and sometimes Proposition 2.3.2) in the main model structures for -categories.
2.4. Equivalences in an -category presented by a model
We discuss the notion of -equivalence in -categories presented by quasi-categories, naturally marked quasi-categories, and Kan-enriched categories. The treatment of other models – such as complete Segal space, saturated -complicial sets, and -comical sets – are recovered for the case of Sections 2.6.1, 2.6.2 and 2.6.3.
2.4.1. Equivalences in a quasi-category
Consider the Joyal model structure on simplicial sets for quasi-categories from [Joy08b, §6.1] or [Lur09a, Theorem 2.2.5.1]. A model for the inclusion from Remark 2.1.4 is implemented by the usual nerve , which is a right Quillen functor. Hence, a model for the walking -morphism is the -simplex , and a model for is . A factorization of of the form (2.3.1) is the trivial factorization
[TABLE]
Proposition 2.4.1**.**
A -morphism in a quasi-category is an -equivalence if and only if there is a solution to either – hence all – of the following (strict!) lifting problems in
[TABLE]
The first is an application of Proposition 2.3.1, the second and third ones follow from [DS11, Proposition 2.2].
2.4.2. Equivalences in a naturally marked quasi-category
Consider the Lurie model structure on marked simplicial sets for naturally marked quasi-categories from [Lur09a, Proposition 3.1.3.7]. A model for the inclusion from Remark 2.1.4 is implemented by the naturally marked nerve which marks the -simplices that are isomorphisms (see [GHL22, §1] for more details), which is a right Quillen functor. Hence, a model for the walking -morphism is , the minimally marked -simplex, and a model for is , the simplicial set maximally marked. Relevant factorizations of of the form (2.3.1) include the trivial factorization
[TABLE]
and the factorization
[TABLE]
The following is an application of Proposition 2.3.1.
Proposition 2.4.2**.**
A -morphism in a naturally marked quasi-category is an -equivalence if and only if there is a solution to either – hence all – of the following (strict!) lifting problems in
[TABLE]
2.4.3. Equivalences in a category enriched over Kan complexes
Consider the Bergner model structure on simplicial categories for Kan-enriched categories from [Ber07a]. A model for the inclusion from Remark 2.1.4 is implemented by the base-change functor along the discrete inclusion , which regards each category as a simplicial category with discrete hom-simplicial sets and which is a right Quillen functor. Hence, a model for the walking -morphism is . The following is an application of Proposition 2.3.1.
Proposition 2.4.3**.**
A -morphism in a Kan-category is an -equivalence if and only if there is a solution of the following lifting problem in the category
[TABLE]
2.5. Equivalences in an -category presented by a model
We discuss the notion of -equivalence in -categories presented by -bicategories and quasi-categorically enriched categories. The treatment of other models – such as -complicial sets, saturated -comical sets and complete Segal -spaces – are recovered for the case of Sections 2.6.1, 2.6.2 and 2.6.3.
2.5.1. Equivalences in an -bicategory
Consider the Lurie model structure on scaled simplicial sets for -bicategories from [Lur09b, Theorem 4.2.7] or [GHL22, Definition 6.1]. A model for the inclusion from Remark 2.1.4 is implemented by the functor which marks all -simplices in the nerve of a category, and which is right Quillen. Hence, model for the walking -morphism is , the -simplex with the unique possible scaling, and a model for is , the simplicial set with the maximal scaling. A factorization of of the form (2.3.1) is the trivial factorization
[TABLE]
The following is an application of Proposition 2.3.1. See also [GHL22, Definition 1.25] for other characterizations of -equivalences in an -bicategory.
Proposition 2.5.1**.**
A -morphism in an -bicategory is an -equivalence if and only if there is a solution to the following (strict!) lifting problem in
[TABLE]
2.5.2. Equivalences in a category enriched over (naturally marked) quasi-categories
Consider the Bergner–Lurie model structure (resp. ) on simplicial categories (resp. marked simplicial categories) for quasi-categorically enriched categories (resp. categories enriched over naturally marked quasi-categories). The model structure (resp. ) is an instance of [Lur09a, Theorem A.3.2.24] in the specific case of [Lur09a, Example A.3.2.23] (resp. [Lur09a, Example A.3.2.22]). A model for the inclusion from Remark 2.1.4 is implemented by the right Quillen functor given by the base-change functor along the discrete inclusion . The following are applications of Proposition 2.3.1.
Proposition 2.5.2**.**
A -morphism in a category enriched over naturally marked quasi-categories is an -equivalence if and only if there is a solution to the following lifting problem in the category :
[TABLE]
Proposition 2.5.3**.**
A -morphism in a quasi-categorically-enriched category is an -equivalence if and only if there is a solution to the following lifting problem in :
[TABLE]
Example 2.5.4*.*
We want to stress that having a cofibration in the factorization ot type (2.3.1) is indeed crucial. Consider the -morphism in the -category . We know by construction that is an equivalence in the -category . In particular, it is also an -equivalence in the quasi-categorically enriched category . We observe that the lifting problem up to homotopy admits a solution in the model category .
[TABLE]
The same lifting problem regarded strictly in the category – as opposed to up-to-homotopy in the model category – does not lift. This can be seen by observing that all maps are constant. However, if one considers the canonical map , the lifting problem
[TABLE]
admits a strict solution in .
2.6. Equivalences in an -category presented by a model
We discuss the notion of -equivalence in -categories presented by saturated -complicial sets, saturated -comical sets and complete Segal -spaces.
2.6.1. Equivalence in a saturated -complicial set
Consider the Verity model structure on marked simplicial sets for saturated -complicial sets from [OR20, Theorem 1.25]. A model for the inclusion from Remark 2.1.4 is implemented by the homotopical functor , which marks the -simplices that are witnessed by an isomorphism and all simplices in dimension or higher in the nerve of a category. Hence, a model for the walking -morphism is , the standard -simplex minimally marked and a model for is , the simplicial set maximally marked. Relevant factorizations of of the form (2.3.1) include the factorization
[TABLE]
and the factorization
[TABLE]
and the factorization
[TABLE]
The following is an application of Proposition 2.3.1.
Proposition 2.6.1**.**
A -morphism in a saturated -complicial set is an -equivalence if and only if there is a solution to either – hence all – of the following (strict!) lifting problems in the category
[TABLE]
Let . A model for the suspension functor is given by the homotopical functor obtained by iterating the construction from [OR22, Lemma 2.7]. Hence, a model for is , and a model for is . A factorization of of the form (2.3.1) is the trivial factorization
[TABLE]
The following then is again an application of Proposition 2.3.2. See also [Lou22a, Corollary 3.2.11] for other characterizations of -equivalences.
Proposition 2.6.2**.**
A -morphism in a saturated -complicial set is an -equivalence if and only if there is a solution to the following (strict!) lifting problem in the category
[TABLE]
2.6.2. Equivalence in a saturated -comical set
Consider the Doherty–Kapulkin–Maehara model structure on marked cubical sets for saturated -comical sets [DKM21, Theorem 2.7]. A model for the inclusion from Remark 2.1.4 is implemented by the homotopical functor , which marks the -cubes that are witnessed by an isomorphism and all cubes in dimension or higher in the cubical nerve of a category. Hence, a model for the walking -morphism is , the standard -cube minimally marked and a model for is , the cubical nerve of maximally marked. Relevant factorizations of of the form (2.3.1) include the factorization
[TABLE]
and the factorization
[TABLE]
where is the marked -cube from [DKM21, §1], and the factorization
[TABLE]
where is the cubical set from [DKM21, §2].
The following is an application of Proposition 2.3.2.
Proposition 2.6.3**.**
A -morphism in a saturated -comical set is an -equivalence if and only if there is a solution to either – hence all – of the following (strict!) lifting problems in the category
[TABLE]
2.6.3. Equivalence in a complete Segal -space
Consider the Rezk model structure on -spaces for complete Segal -spaces from [Rez10, §11].
A model for the inclusion from Remark 2.1.4 is implemented by the homotopical functor
[TABLE]
where denotes the Rezk nerve from [Rez01, §3.5] – there referred to as the classifying diagram – which is a right Quillen functor, and hence homotopical, and denotes the canonical projection, so that the functor is a left Quillen functor, and hence is homotopical. For , a model for the suspension functor is given by the homotopical functor obtained by iterating the construction from [Rez10, Proposition 4.6]. Hence, a model for is the representable object and a model for is .
A factorization of of the form (2.3.1) is the trivial factorization
[TABLE]
The following is an application of Proposition 2.3.2. See also [Rez10, §11.14] for other characterizations of -equivalences.
Proposition 2.6.4**.**
A -morphism in a complete Segal -space is an -equivalence if and only if there is a solution to the following (strict!) lifting problem in the category
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ABG + ] Dimitri Ara, Albert Burroni, Yves Guiraud, Philippe Malbos, François Métayer, and Samuel Mimram, Polygraphs: from rewriting to higher categories , manuscript in preparation.
- 2[AF 15] David Ayala and John Francis, Factorization homology of topological manifolds , J. Topol. 8 (2015), no. 4, 1045–1084.
- 3[AF 17] by same author, The cobordism hypothesis , ar Xiv:1705.02240 v 2 (2017).
- 4[AG 15] D. Arinkin and D. Gaitsgory, Singular support of coherent sheaves and the geometric Langlands conjecture , Selecta Math. (N.S.) 21 (2015), no. 1, 1–199.
- 5[AGV 71] Michael Artin, Alexander Grothendieck, and Jean-Louis Verdier, Theorie de topos et cohomologie Étale des schemas I, II, III , Lecture Notes in Mathematics, vol. 269, 270, 305, Springer, 1971.
- 6[AL 20] Dimitri Ara and Maxime Lucas, The folk model category structure on strict ω 𝜔 \omega -categories is monoidal , Theory Appl. Categ. 35 (2020), Paper No. 21, 745–808.
- 7[AM 20] Dimitri Ara and Georges Maltsiniotis, Joint et tranches pour les ∞ \infty -catégories strictes , Mém. Soc. Math. Fr. (N.S.) (2020), no. 165, vi+213.
- 8[Ara 14] Dimitri Ara, Higher quasi-categories vs higher Rezk spaces , J. K-Theory 14 (2014), no. 3, 701–749.
