ross.street@mq.edu.au ††thanks: The author gratefully acknowledges the support of Australian Research Council Discovery Grant DP190102432. \amsclass18B10, 18D05 \dedicationDedicated to the memory of R.F.C. (Bob) Walters.
Variation on a comprehensive theme
Abstract
The main result concerns a bicategorical factorization system on the bicategory of categories and functors. Each functor factors up to isomorphism as where is what we call an ultimate functor and is what we call a groupoid fibration. Every right adjoint functor is ultimate. Functors whose ultimate factor is a right adjoint are shown to have bearing on the theory of polynomial functors.
keywords:
factorization system; bicategory; fibration; final functorIntroduction
As an undergraduate I came across Russell [14] and was quite disturbed by the state of foundations for mathematics. The comprehension schema seemed central as a connection between mathematics and language. Then I was happy with the breakthrough I saw in the papers [10, 11, 12] of Lawvere.
The factorization described here is an old idea I have been meaning to check thoroughly and write up but only now have found a reason to do so. The reason relates to as an example of a polynomic bicategory in the sense of my recent paper [17]. We want to define a property of a functor in terms of one of its factors being special in some way.
The idea for the present paper is a variant of the comprehensive factorization of a functor as a composite where is a final functor (in the sense of [13] and used by Walters and the author in [19] but sometimes called cofinal) and is a discrete fibration. The name for the factorization system was chosen because of its relationship to the comprehension scheme for sets. This is an orthogonal factorization system in the usual sense on as an ordinary category and in the enriched sense on as a (strict) 2-category. Here “discrete” means, of course, that the fibres of are sets.
Now we wish to think of as a bicategory and consider whether we obtain a factorization system in a bicategorical sense when we behave totally bicategorically and close our fibrations up under composition with equivalences and ask that the pseudofibres be groupoids.
This works. Our proof models the proof of the usual comprehensive factorization as described by Verity and the author in [18]. The final functors are replaced by what we call ultimate functors and the discrete fibrations by what we call groupoid fibrations. In our application, we are concerned with functors whose ultimate factor is a right adjoint.
1 Groupoid fibrations
The following concept is called “strongly cartesian” by Grothendieck. These morphisms are always closed under composition (unlike those he called “cartesian”).
Definition 1.1.
Let be a functor. A morphism in is called cartesian for when the square (1.1) is a pullback for all .
(1.1) |
Since any commutative square with a pair of opposite sides invertible is a pullback, we see that all invertible morphisms in are cartesian, and, if is fully faithful, then all morphisms of are cartesian.
Definition 1.2.
The functor is a groupoid fibration when
-
(i)
for all and in , there exist in and invertible such that , and
-
(ii)
every morphism of is cartesian for .
Our groupoid fibrations include all equivalences of categories and so are not necessarily fibrations in the sense of Grothendieck.
From the pullback (1.1) it follows that groupoid fibrations are conservative (that is, reflect invertibility). So their pseudofibres are groupoids.
For functors , we write for the comma category (or slice) of and ; it is the top left vertex of a universal square
(1.2) |
in the bicategory . In particular, the arrow category of is . For a functor and writing , there is a canonical functor defined as follows.
|
We write for the full subcategory of the comma category of (1.2) consisting of those objects at which the component of is invertible. It is called the pseudopullback or isocomma category of the cospan ; it is the top left vertex of a universal square
(1.3) |
in the bicategory .
Here are three fairly easy observations.
Proposition 1.3.
-
(a)
A functor is a groupoid fibration if and only if the canonical is an equivalence.
-
(b)
Suppose is a groupoid fibration. A functor is a groupoid fibration if and only if the composite is.
-
(c)
The pseudopullback of a groupoid fibration along any functor is a groupoid fibration. That is, if in (1.3) the functor is a groupoid fibration, so too is .
There is a 2-category of groupoid fibrations over defined as follows: The objects are groupoid fibrations over . The hom categories are given by the pseudopullbacks:
So the morphisms are triangles with a natural isomorphism therein.
(1.4) |
We also consider with the same convention on its morphisms.
2 Some fully faithful right adjoint functors
(2.5) |
All the categories in the diagram (2.5) are cartesian closed. All the functors are “closed under exponentiation”. The left adjoints all preserve finite products (by Day Reflection Theorem). Our focus here is on the inclusion with left 2-adjoint and right adjoint . The subcategory of the category contains all and only the invertible morphisms of .
Lemma 2.1.
A functor is an equivalence if and only if both and are equivalences.
Proof 2.2.
Only if is clear since is a 2-functor. For the converse first note that surjectivity on objects up to isomorphism for is the same as for .
So it remains to deduce from the groupoid equivalences that is fully faithful. Take and in . Since is surjective on objects up to isomorphism, there exists in and a commutative square
Since is full, there exist invertible and in such that and . Consequently, proving that is full.
Since is faithful, the only automorphisms in taken to identities by are identities. We will use this special case in our proof now that is faithful. Take in with . Think of these two morphisms as objects of which are taken to two equal objects of . Since is full, the two objects and are isomorphic by an isomorphism in made up of automorphisms of and which are taken to identities by . Since those automorphisms must be identities, we deduce that , as required.
Lemma 2.3.
If is a groupoid fibration and is an equivalence then is an equivalence.
Proof 2.4.
Since is a right adjoint, it preserves the pseudopullback
so that both and are equivalences. The result follows by Lemma 2.1.
Proposition 2.5.
The usual “Grothendieck construction” 2-functor
is a biequivalence. If then is equivalent to the pseudofibre of over .
The result of applying to the 2-adjunction
transports to a biadjunction
via the biequivalences
Remark 2.6.
The inclusion 2-functor is fully faithful with a left biadjoint whose value at the object is the groupoid fibration which corresponds to the pseudofunctor taking to .
The construction of by generators and relations is awkward to work with; instead we use the following universal property of the coinverter construction. Write for the full subcategory of consisting of those functors which invert all the morphisms of . The adjunction unit induces an isomorphism
for all categories (not just groupoids).
3 Ultimate functors
Definition 3.1.
A functor is called ultimate when, for all objects , the fundamental groupoid of the comma category is equivalent to the terminal groupoid:
Proposition 3.2.
Every right adjoint functor is ultimate.
Proof 3.3.
If then has a left adjoint owing to the initial object of . Applying the 2-functor to the adjunction yields an adjunction between groupoids.
Proposition 3.4.
Ultimate functors are taken by to equivalences.
Proof 3.5.
Let be ultimate. We must prove is an equivalence. What we prove is that, for any category , if each diagonal functor is an equivalence then is an equivalence. Since is 2-natural in , any choice of adjoint equivalence is pseudonatural: choose also counit and unit . We will show that we have an inverse equivalence for defined by
For , we have isomorphisms
naturally in and , while, for , we have isomorphisms
naturally in and .
Proposition 3.6.
A functor is ultimate if and only if its pseudopullback along any (groupoid) opfibration is taken by to an equivalence.
Proof 3.7.
The pseudopullback of along an opfibration has ; so is ultimate if is. So takes to an equivalence by Proposition 3.4. For the rest, in the pseudopullback
note that has an initial object and is a groupoid opfibration.
Proposition 3.8.
Every coinverter (localization) is ultimate.
Proof 3.9.
Pullback along an opfibration has a right adjoint so coinverters are taken to coinverters. Also, takes coinverters to isomorphisms since it is a left adjoint and all 2-cells in are already invertible. Proposition 3.6 applies.
Proposition 3.10.
Suppose is ultimate. A functor is ultimate if and only if the composite is ultimate.
Proof 3.11.
Look at the pasting
of two pullbacks with a groupoid fibration. Since is ultimate, is equivalenced by . So is equivalenced by if and only if is.
Lemma 3.12.
If is a groupoid fibration and is a functor from a groupoid then the composite is an equivalence.
Proof 3.13.
is a left adjoint and is a groupoid already.
Proposition 3.14.
Ultimate groupoid fibrations are equivalences.
4 Bicategorical factorization systems
The concept of factorization system in a bicategory is not new; for example, see [2, 3]. Before giving the definition, we revise the bicategorical variant of pullback.
Definition 4.1.
A square
(4.6) |
in a bicategory is called a bipullback of the cospan when, for all objects , the functor
obtained from the universal property of the pseudopullback, is an equivalence.
Remark 4.2.
A factorization system on a bicategory consists of a pair of sets and of morphisms of satisfying:
-
FS0.
if with and an equivalence then , while if with and an equivalence then ;
-
FS1.
for all and , the diagram
(4.7) (in which the isomorphism has components of the associativity constraints for ) is a bipullback;
-
FS2.
every morphism factorizes with and .
It follows that and are closed under composition and their intersection consists of precisely the equivalences. Moreover, in the square (4.7), the morphism is in if the square is a bipullback for all , and dually. Also note that, if all morphisms in are groupoid fibrations then Remark 4.2 applies to simplify the bipullback verification for FS1.
5 Main theorem
Theorem 5.1.
Ultimate functors and groupoid fibrations form a bicategorical factorization system on . So every functor factors pseudofunctorially as with ultimate and a groupoid fibration.
Proof 5.2.
FS0 is obvious. For FS2 construct the diagram
where , the squares commute up to isomorphism, has a left adjoint , and is a coinverter.
It remains to prove FS1. By Remark 4.2, we must prove that, for any groupoid fibration and any ultimate functor , the functor
is taken to an equivalence of groupoids by . By Remark 2.6, the value of the left biadjoint to at the ultimate functor is equivalent to . So every morphism over with a groupoid fibration factors up to isomorphism as
(5.8) |
uniquely up to a unique isomorphism. In this, we have and such that . Take any object of ; it consists of functors and an invertible natural transformation . By the universal property of the pseudopullback , the isomorphism is equal to the pasted composite
By Proposition 1.3, is a groupoid fibration. We can apply (5.8) with , and the identity of to obtain and such that uniquely up to a unique isomorphism of . This gives us and an isomorphism determined by the isomorphisms
This proves that the functor is surjective on objects up to isomorphism. Now suppose we also have and an isomorphism
which means we have invertible and such that . By the universal property of the pseudopullback, there exists a unique such that , and , and there also exists a unique invertible such that and . So we have
which allows us to use the uniqueness of to obtain a unique isomorphism such that and . Then is such that and . Hence is full and it remains to prove it faithful. So suppose we have an invertible such that and . The universal property of pseudopullback implies there exists such that and , and implies we can deduce that from the equations and . By the uniqueness of , we have and hence , as required.
6 Other possible variants
It is possible that the factorization carries through for -categories (also called quasicategories or weak Kan complexes); see [8, 9]. For the case of the tricategory whose objects are bicategories with all 2-cells invertible, a basic ingredient would be the triadjunction
where is the subtricategory of with all morphisms equivalences. There is an obvious core providing a right triadjoint too. This requires the bumping up to factorization systems on tricategories. And, after all, as yet my application only needs the case.
There is presumably also a version of the (ultimate, groupoid fibration) for categories internal to a category as done in [18] for the usual comprehensive factorization.
7 Application to polynomials
In this section, we use our factorization to understand the implications of the paper [17] for polynomials in as a bicategory.
A morphism in a bicategory is called a groupoid fibration when, for all objects , the functor is a groupoid fibration as per Definition 1.2.
A morphism is called a right lifter when, for all , there exists a right lifting of of through (in the sense of [20]).
Recall from [17] that a bicategory with bipullbacks is always calibrated by the groupoid fibrations as the neat morphisms; that is, such a bicategory is polynomic. This allows for the construction of a bicategory of “polynomials” in . Indeed, Definition 8.2 of [17] means for this situation that a polynomial from to in is a span
in with a right lifter and a groupoid fibration. To have a more explicit description we need to identify the right lifters in the given .
Proposition 7.1.
A functor is a right lifter in if and only if it is a right adjoint.
Proof 7.2.
Right adjoints in any bicategory are right lifters since the lifting is given by composing with the left adjoint. Conversely, suppose the functor is a right lifter. A right lift for each object of gives the components of the counit of an adjunction ; as in any book introducing adjoint functors, we know that the universal property of right lifter allows us to define on morphisms and so on.
In order to distinguish polynomials in the polynomic bicategory from polynomials in , in the sense of Weber [22], as a category with pullbacks, I use the term abstract polynomial for the former; that is, it is a span
of functors, where is a groupoid fibration and .
A functor is an abstract polynomial functor when, in its factorization
as per Theorem 5.1, the ultimate functor is a right adjoint.
The next result follows from the work in [17]; for convenience, we will include a direct proof.
Proposition 7.3.
Abstract polynomial functors compose.
Proof 7.4.
Take with , and with groupoid fibrations. Form the pseudopullback
(7.9) |
to obtain the required “distributive law”. One easily verifies there exists , is a groupoid fibration and the Chevalley-Beck condition (as recalled on page 150 of [15])
holds. So where is a groupoid fibration and is a right adjoint.
Write for the subcategory of obtained by restricting the morphisms to abstract polynomial functors.
The next result is essentially Proposition 8.6 of [17].
Proposition 7.5.
If the bicategory is calibrated then, for each , there is a pseudofunctor taking the polynomial to the abstract polynomial functor which is the composite
in .
Corollary 7.6.
The pseudofunctor , taking each abstract polynomial its associated abstract polynomial functor with , is a biequivalence.
Remark 7.7.
After my talk on this topic in the Workshop on Polynomial Functors https://topos.site/p-func-2021-workshop/, Paul Taylor kindly pointed out his 1988 preprint [21] in which he distinguished parametric (or local) right adjoint functors with motivation from proof theory and consequently calling them stable functors. His trace factorization for such a functor is a right adjoint functor followed by a groupoid fibration. I am grateful to Clemens Berger for observing that the groupoid fibrations so arising are a resticted class: their pseudofibres are coproducts of codiscrete (chaotic) categories. However, it does show that every parametric right adjoint functor provides an example of an abstract polynomial functor.
——————————————————–
References
- [1] Jean Bénabou, Introduction to bicategories, Lecture Notes in Math. 47 (Springer, Berlin, 1967) 1–77.
- [2] Renato Betti, Dietmar Schumacher and Ross Street, Factorizations in bicategories Dipartimento di Matematica, Politecnico di Milano, n. 22/R (May 1999); see 1997 draft at http://science.mq.edu.au/~street/61.pdf.
- [3] Magali Dupont and Enrico M. Vitale, Proper factorization systems in 2-categories, J. Pure Appl. Algebra 179(1-2) (2003) 65–86.
- [4] Hans Ehrbar and Oswald Wyler, On subobjects and images in categories, Report 68-34 (Carnegie Mellon University, November 1968) 28pp.
- [5] Peter J. Freyd and G. Max Kelly, Categories of continuous functors I, J. Pure and Applied Algebra 2 (1972) 169–191; Erratum Ibid. 4 (1974) 121.
- [6] John W. Gray, The categorical comprehension scheme, Lecture Notes in Math. 99 (Springer-Verlag, Berlin and New York, 1969) 242–312.
- [7] John W. Gray, Formal category theory–Adjointness for 2-categories, Lecture Notes in Math. 391 (Springer-Verlag, New York, 1974).
- [8] André Joyal, Notes on quasi-categories (University of Chicago, 22 June 2008); https://www.math.uchicago.edu/~may/IMA/Joyal.pdf.
- [9] André Joyal, The theory of quasi-categories and its applications, Volume 2; https://mat.uab.cat/~kock/crm/hocat/advanced-course/Quadern45-2.pdf.
- [10] F.W. Lawvere, The category of categories as a foundation for mathematics, Proceedings of the Conference on Categorical Algebra, La Jolla 1965 (Springer-Verlag, New York 1966) 1–20.
- [11] F.W. Lawvere, Adjointness in Foundations, Dialectica 23 (1969) 281–296.
- [12] F.W. Lawvere, Equality in hyperdoctrines and comprehension schema as an adjoint functor, Proceedings of the AMS Symposium on Pure Mathematics XVII (1970) 1–14.
- [13] Saunders Mac Lane, Categories for the Working Mathematician, Graduate Texts in Mathematics 5 (Springer-Verlag, 1971).
- [14] Bertrand Russell, The Principles of Mathematics (Cambridge University Press, U/K. 1903).
- [15] Ross Street, Elementary cosmoi I, Lecture Notes in Math. 420 (Springer-Verlag, 1974) 134–180.
- [16] Ross Street, Fibrations in bicategories, Cahiers de topologie et géométrie différentielle 21 (1980) 111–160.
- [17] Ross Street, Polynomials as spans, Cahiers de topologie et géométrie différentielle catégoriques 61(3) (2020) 113–153.
- [18] Ross Street and Dominic Verity, The comprehensive factorization and torsors, Theory and Applications of Categories 23(3) (2010) 42–75.
- [19] Ross Street and R.F.C. Walters, The comprehensive factorization of a functor, Bulletin American Math. Soc. 79 (1973) 936–941.
- [20] Ross Street and Robert F.C. Walters, Yoneda structures on 2-categories, J. Algebra 50 (1978) 350–379.
- [21] Paul Taylor, The trace factorisation of stable functors, Preprint (1988); available at http://www.paultaylor.eu/stable/.
- [22] Mark Weber, Polynomials in categories with pullbacks, Theory and Applications of Categories 30(16) (2015) 533–598.