Exposé VI. Fibered Categories and Descent
0. Introduction
Contrary to what had been announced in the introduction to the preceding exposé, it has turned out to be impossible to do descent in the category of preschemes, even in particular cases, without first having developed with sufficient care the language of descent in general categories.
The notion of “descent” supplies the general framework for all procedures of “gluing” objects, and consequently of
“gluing” categories. The most classical case of gluing is relative to the data of a topological space and a covering
of by open subsets Xᵢ. Suppose one is given, for every , a fiber space, say, Eᵢ over Xᵢ, and for every pair
an isomorphism from to , where , satisfying the
well-known transitivity condition, written in abbreviated form . One knows that there exists a
fiber space on , defined up to isomorphism by the condition that one have isomorphisms
satisfying the relations , with the usual abuse of notation.
Let be the sum space of the Xᵢ; it is therefore a fiber space over , i.e. endowed with a continuous map
. The data of the Eᵢ can be interpreted more concisely as a fiber space over , and the data of the
as an isomorphism between the two inverse images, by the two canonical projections, and of
on . The gluing condition can then be written as an identity between isomorphisms of fiber
spaces and over the triple fiber product , where
denotes the inverse image of on by the canonical projection of index . The construction of from
and is a typical case of a “descent” procedure.
Moreover, starting from a fiber space on , one says that is “locally trivial”, with fiber , if there exists an open covering of such that the are isomorphic to , or what amounts to the same thing, such that the inverse image of on is isomorphic to .
Thus the notion of “gluing” objects, like that of “localization” of a property, is tied to the study of certain types of “base changes” . In algebraic geometry, many other types of base change, and notably faithfully flat morphisms , must be regarded as corresponding to a procedure of “localization” relative to preschemes, or other objects, “over” . This type of localization is used just as much as ordinary topological localization, of which it is moreover a special case. The same is true, to a lesser extent, in analytic geometry.
Most of the proofs, reducing to verifications, are omitted or merely sketched. Where appropriate, we specify the less evident diagrams that enter into a proof.
1. Universes, Categories, Equivalence of Categories
To avoid certain logical difficulties, we shall admit here the notion of a Universe, which is a set “large enough”
that one does not leave it under the usual operations of set theory; an “axiom of Universes” guarantees that every
object lies in a Universe. For details, see a book in preparation by C. Chevalley and the speaker.1 Thus the
symbol Set denotes not the category of all sets, a notion that has no sense, but the category of sets that lie in a
given Universe, which we shall not specify in the notation. Similarly, Cat will denote the category of categories
lying in the Universe in question; the “morphisms” from one object of Cat to another are, by definition, the
functors from to .
If is a category, we denote by the set of objects of , and by
the set of arrows of , or morphisms of . We shall therefore write
, avoiding the common abuse of notation . If and
are two categories, a functor from to will always mean what is commonly called a
covariant functor from to . Its data include both the target category and the source
category, and . The functors from to form a set, denoted
, which is the set of objects of a category denoted Hom̲(𝒞,𝒞′). By
definition, a contravariant functor from to is a functor from the opposite category
of to .
We shall admit the notions of projective limit and inductive limit of a functor , and in particular the most common special cases of these notions: cartesian products and fiber products, the dual notions of direct sums and amalgamated sums, and the usual formal properties of these operations.
For example, in the category Cat introduced above, projective limits, relative to categories lying in
the chosen Universe, exist. The set of objects, respectively the set of arrows, of the projective-limit category
of the is obtained by taking the projective limit of the sets of objects, respectively
the sets of arrows, of the categories . The best-known case is that of the product of a family of
categories. We shall constantly use, in what follows, the fiber product of two categories over a third.
For everything concerning categories and functors, pending the book in preparation already mentioned, see [VI.1], which is necessarily quite incomplete, even as concerns the generalities sketched in the present number.
Let us take this occasion to spell out the notion of equivalence of categories, which is not presented satisfactorily in [VI.1]. A functor is said to be faithful, respectively fully faithful, if for every pair of objects , of , the map from to is injective, respectively bijective. One says that is an equivalence of categories if
is fully faithful and, moreover, every object of is isomorphic to an object of the form .
One shows that this is the same as saying that there exists a functor from to
quasi-inverse to , i.e. such that GF is isomorphic to and FG is isomorphic to
.
When this is so, giving a functor and an isomorphism is equivalent to giving, for every , a pair formed by an object of and an isomorphism , namely . With this notation, there exists a unique functor having the given map as its object map, and such that the map is a homomorphism of functors .
Finally, if is a functor quasi-inverse to , and if one chooses isomorphisms and , then the two compatibility conditions on and stated in [VI.1, I.1.2] are in fact equivalent to one another; and for every chosen isomorphism , there exists a unique isomorphism such that those conditions are satisfied.
2. Categories over Another Category
Let be a category in the chosen Universe. It is therefore an object of Cat, and one may consider the
category of “objects of Cat over ”. An object of this category is therefore a
functor
One also says that the category , endowed with such a functor, is a category over , or an -category. Thus an -functor from a category over to a category over will mean a functor
such that
qf = p,
where and are the projection functors for and respectively. The set of -functors from to is therefore in bijective correspondence with the set of arrows with source and target in ,
without this being an identity, since the data of an as above does not determine and as categories over . Of course, as in any other category , we shall routinely make the abuse of language that identifies -functors, in the sense just explained, with arrows in a category .
We shall denote by
the set of -functors from to . Of course, a composite of -functors is an -functor, the composition in question corresponding by definition to the composition of arrows in .
Now consider two -functors
and a homomorphism of functors
One says that is an -homomorphism, or a “homomorphism of -functors”, if for every , one has
In words: putting , the morphism
in is an -morphism. In general, for every morphism in and every
category over , a morphism in is called an -morphism if
, where denotes the projection functor . If one has a third
-functor and an -homomorphism , then vu is
again an -homomorphism.
Thus the -functors from to , and the -homomorphisms between them,
form a subcategory of the category Hom̲(ℱ,𝒢) of all functors from to ; it will be called the
category of -functors from to and denoted
Hom̲_{ℰ/-}(ℱ,𝒢).
It is also the kernel subcategory of the pair of functors
R,S: Hom̲(ℱ,𝒢) ⇉ Hom̲(ℱ,ℰ),
where is the constant functor defined by the object of Hom̲(ℱ,ℰ), and is the functor
defined by .
To finish these generalities, it remains to define the natural pairings between the categories Hom̲_{ℰ/-}(ℱ,𝒢) by
composition of -functors. In other words, one wants to define a “composition functor”
(i) Hom̲_{ℰ/-}(ℱ,𝒢) × Hom̲_{ℰ/-}(𝒢,ℋ) → Hom̲_{ℰ/-}(ℱ,ℋ)
when , , are three categories over , in such a way that this functor induces, on objects, the composition map for -functors and . For this, recall that one defines a canonical functor
(ii) Hom̲(ℱ,𝒢) × Hom̲(𝒢,ℋ) → Hom̲(ℱ,ℋ),
which on objects is just the composition map of functors, and which transforms an arrow , where
u: f → f′, v: g → g′,
are arrows in Hom̲(ℱ,𝒢), respectively in Hom̲(𝒢,ℋ), into the arrow
v ∗ u: gf → g′f′
defined by the relation
(v ∗ u)(ξ) = v(f′(ξ)) · g(u(ξ)) = g′(u(ξ)) · v(f(ξ)).
It is well known that one indeed obtains in this way a homomorphism from gf to , and that, for variable ,
and , , one obtains the functor (ii); that is, one has
(I) id_g ∗ id_f = id_{gf},
and
(II) (v′ ∗ u′) ∘ (v ∗ u) = (v′ ∘ v) ∗ (u′ ∘ u).
Recall also that one has an associativity formula for the canonical pairings (ii), expressed on the one hand by the associativity of the composition of functors, and on the other hand by the formula
(III) (w ∗ v) ∗ u = w ∗ (v ∗ u)
for the composition products of homomorphisms of functors, where and are as above, and where one supposes given in addition a homomorphism of functors .
I now say that when and are -categories, the canonical composition functor (ii) induces a functor (i). Since we already know that the composite of two -functors is an -functor, this amounts to saying that when and are homomorphisms of -functors, then is also a homomorphism of -functors. This follows trivially from the definitions. Since the pairings (i) are induced by the pairings (ii), they satisfy the same associativity property, also expressed in the formulas and , for -functors and -homomorphisms of -functors.
To complete the formulary (I), (II), (III), recall also the formulas
(IV) v ∗ id_ℱ = v and id_𝒢 ∗ u = u,
where, for simplicity, one writes or instead of when , respectively , is the identity automorphism of , respectively .
It follows from the definition of the pairings (i) that Hom̲_{ℰ/-}(ℱ,𝒢) is a functor in and
, from the product category to the category Cat.
Indeed, if is an -functor, i.e. an object of Hom̲_{ℰ/-}(𝒢,𝒢₁), then
by taking in (i), there corresponds to it a functor
g_*: Hom̲_{ℰ/-}(ℱ,𝒢) → Hom̲_{ℰ/-}(ℱ,𝒢₁).
One defines analogously, for an -functor , a functor
f^*: Hom̲_{ℰ/-}(ℱ,𝒢) → Hom̲_{ℰ/-}(ℱ₁,𝒢).
For short, these functors are also denoted by the symbols and respectively;
these in fact denote only the corresponding maps on the sets of objects. It follows from the associativity property
indicated above that one does indeed obtain in this way, as announced, a functor Cat_/ℰ° × Cat_/ℰ → Cat.
3. Base Change in Categories over ℰ
Since projective limits exist in Cat, relative to categories belonging to the Universe, the same is true
in . In particular, cartesian products exist there; these are interpreted as fiber products in
Cat. In accordance with the general notation, if and are categories over , we
denote by
their product in , i.e. their fiber product over in Cat, regarded as a category over
. Thus is endowed with two -functors
and , which define, for every category over , a bijection
Hom_ℰ(ℋ, ℱ ×_ℰ 𝒢) ≃ Hom_ℰ(ℋ,ℱ) × Hom_ℰ(ℋ,𝒢).
This bijection moreover comes from an isomorphism of categories
Hom̲_{ℰ/-}(ℋ, ℱ ×_ℰ 𝒢) ≃ Hom̲_{ℰ/-}(ℋ,ℱ) × Hom̲_{ℰ/-}(ℋ,𝒢),
by taking the sets of objects of the two sides. The displayed functor is the one whose components are the functors and from the first member to the two factors of the second. We leave to the reader the verification that one indeed obtains an isomorphism in this way; the analogous fact is true more generally whenever one has a projective limit of categories, and not only in the case of a fiber product.
Recall moreover, as was said in VI.1, that
Ob(ℱ ×_ℰ 𝒢) = Ob(ℱ) ×_{Ob(ℰ)} Ob(𝒢),
Fl(ℱ ×_ℰ 𝒢) = Fl(ℱ) ×_{Fl(ℰ)} Fl(𝒢),
the composition of arrows being carried out componentwise.
In what follows, we consider a functor
and, for every category over , we regard as a category over by means of . In other words, we interpret the “fiber product” operation as an operation of “base change”, the functor being called the “base-change functor.” In accordance with the well-known general facts, one obtains in this way a functor, called the base-change functor for :
It is adjoint to the “restriction of the base” functor, which sends every category over , with projection functor , to regarded as a category over by the functor . As is well known for a base-change functor in a category, the base-change functor “commutes with projective limits”, and in particular “transforms” fiber products over into fiber products over .
Let and be two categories over . We shall define a canonical isomorphism
(i) Hom̲_{ℰ′/-}(ℱ′,𝒢′) ≃ Hom̲_{ℰ/-}(ℱ ×_ℰ ℰ′,𝒢),
where ℱ′ = ℱ ×_ℰ ℰ′ and 𝒢′ = 𝒢 ×_ℰ ℰ′.
For this, consider the functor
pr₁: 𝒢′ = 𝒢 ×_ℰ ℰ′ → 𝒢,
and define (i) by
which a priori denotes a functor
(ii) Hom̲(ℱ′,𝒢′) → Hom̲(ℱ′,𝒢).
It remains only to verify that this latter functor induces a functor on the subcategories in (i), and that this induced functor is an isomorphism. That (ii) induces a bijection
Hom_{ℰ′/-}(ℱ′,𝒢′) ≃ Hom_{ℰ/-}(ℱ ×_ℰ ℰ′,𝒢)
is the characteristic property of the base-change functor. It remains therefore
to prove that if , are -functors , then the map
induces a bijection
Hom_{ℰ′}(F,G) ≃ Hom_ℰ(pr₁ ∘ F, pr₁ ∘ G).
The verification of this fact is immediate and is left to the reader.
It follows from this isomorphism (i), and from the end of the preceding number, that
Hom̲_{ℰ′/-}(ℱ ×_ℰ ℰ′, 𝒢 ×_ℰ ℰ′)
may be regarded as a functor in , , , from the category
Cat_/ℰ° × Cat_/ℰ° × Cat_/ℰ to the category Cat, isomorphic to the functor defined by the expression
Hom̲_{ℰ/-}(ℱ ×_ℰ ℰ′,𝒢).
In particular, for fixed and , one obtains a functor in . Thus the -functor of projection defines a morphism, i.e. a functor
λ*_{ℱ,𝒢}: Hom̲_{ℰ/-}(ℱ,𝒢) → Hom̲_{ℰ′/-}(ℱ′,𝒢′),
which we now spell out. On the sets of objects of the two sides, it is the map
f ↦ f′ = f ×_ℰ ℰ′,
expressing the functorial dependence of on the object over . On the other hand, consider two -functors
and a homomorphism of -functors
We shall spell out the corresponding homomorphism of -functors
For every
with
ξ ∈ Ob(ℱ), S′ ∈ Ob(ℰ′), p(ξ) = λ(S′) = S,
the morphism
u′(ξ′): f′(ξ′) = (f(ξ),S′) → g′(ξ′) = (g(ξ),S′) in 𝒢′
is defined by the formula
This is indeed an -morphism in , since .
Now consider any -functor
and the corresponding functor
Hom̲_{ℰ′/-}(ℱ ×_ℰ ℰ′, 𝒢 ×_ℰ ℰ′)
→ Hom̲_{ℰ″/-}(ℱ ×_ℰ ℰ″, 𝒢 ×_ℰ ℰ″).
I say that this functor is none other than the one obtained by the preceding process, starting from and over and regarding as a category over , taking into account the isomorphisms of “transitivity of base change”
ℱ′ ×_ℰ′ ℰ″ ≃ ℱ″ = ℱ ×_ℰ ℰ″,
𝒢′ ×_ℰ′ ℰ″ ≃ 𝒢″ = 𝒢 ×_ℰ ℰ″,
which imply a canonical isomorphism
Hom̲_{ℰ″/-}(ℱ′ ×_ℰ′ ℰ″, 𝒢′ ×_ℰ′ ℰ″)
≃ Hom̲_{ℰ″/-}(ℱ ×_ℰ ℰ″, 𝒢 ×_ℰ ℰ″).
The verification of this compatibility is immediate and is left to the reader.
The functors just defined are compatible with the pairings defined in the preceding number. More precisely, if , , are categories over and if one puts
ℱ′ = ℱ ×_ℰ ℰ′, 𝒢′ = 𝒢 ×_ℰ ℰ′, ℋ′ = ℋ ×_ℰ ℰ′,
one has commutativity in the following diagram of functors:
Hom̲_{ℰ/-}(ℱ,𝒢) × Hom̲_{ℰ/-}(𝒢,ℋ) → Hom̲_{ℰ/-}(ℱ,ℋ)
↓ λ*_{ℱ,𝒢} × λ*_{𝒢,ℋ} ↓ λ*_{ℱ,ℋ}
Hom̲_{ℰ′/-}(ℱ′,𝒢′) × Hom̲_{ℰ′/-}(𝒢′,ℋ′) → Hom̲_{ℰ′/-}(ℱ′,ℋ′),
where the horizontal arrows are the composition functors defined in the preceding number. This commutativity is expressed by the formulas
for , , a formula which simply expresses the functoriality of base change, and
(v ∗ u)′ = v′ ∗ u′
when is an arrow of Hom̲_{ℰ/-}(ℱ,𝒢) and is an arrow of Hom̲_{ℰ/-}(𝒢,ℋ). The
verification of this formula follows easily from the definitions.
In what follows, we shall be chiefly interested in Hom̲_ℰ(ℱ,𝒢), and certain remarkable subcategories of it, when
. For this reason we introduce a special notation:
Γ̲(𝒢/ℰ) = Hom̲_ℰ(ℰ,𝒢),
Γ(𝒢/ℰ) = Ob(Γ̲(𝒢/ℰ)) = Hom_ℰ(ℰ,𝒢).
Remarks. When is a point category, i.e. and are reduced to a
single element, which also means that is a final object of the category Cat, then the data of a category
over is equivalent to the data of a category in the ordinary sense, since there will be a unique functor
from to . More precisely, is then isomorphic to Cat. Moreover, the
categories Hom̲_{ℰ/-}(ℱ,𝒢) are then none other than the Hom̲(ℱ,𝒢).
Recall then that the fundamental formula
Hom(ℋ, Hom̲(ℱ,𝒢)) ≃ Hom(ℱ × ℋ, 𝒢),
functorial in the three arguments appearing in it, allows Hom̲(ℱ,𝒢) to be interpreted axiomatically, in terms internal
to the category Cat. Thus the familiar formulary for Hom̲-categories appears as a special case of a formulary valid
in categories such as Cat, where “Hom̲-objects”, defined by the preceding formula, exist. There is an analogous
interpretation of Hom̲_{ℰ/-}(ℱ,𝒢), when is again arbitrary, by the formula
Hom(ℋ, Hom̲_{ℰ/-}(ℱ,𝒢)) ≃ Hom_ℰ(ℱ × ℋ, 𝒢),
functorial in the three arguments. In this way, the formal properties set out in VI.2 and VI.3 are special cases of more
general results, valid in categories where the objects Hom̲_{ℰ/-}(ℱ,𝒢), for and two objects
of the category over a third object , exist.
4. Fiber Categories; Equivalence of ℰ-Categories
Let be a category over , and let . The fiber category of at is the subcategory of that is the inverse image of the point subcategory of defined by .
Thus the objects of are the objects of such that , and its morphisms are the morphisms of such that , i.e. the -morphisms in . Of course, is canonically isomorphic to the fiber product , where denotes the point subcategory of defined by , endowed with its inclusion functor into . It follows, taking the transitivity of base change into account, that if one makes a base change , then for every , the projection induces an isomorphism
ℱ′_{S′} → ℱ_S, where S = λ(S′).
Proposition.
Let be an -functor. If is fully faithful, then for every base change , the corresponding functor
f′: ℱ′ = ℱ ×_ℰ ℰ′ → 𝒢′ = 𝒢 ×_ℰ ℰ′
is fully faithful.
The verification is immediate. More generally, one can show that every projective limit of fully faithful functors, here and the identity functors in and , is a fully faithful functor.
One should note that the assertion analogous to 4.1, with “fully faithful” replaced by “equivalence of categories”, is false, already for . However:
Proposition.
Let be an -functor. The following conditions are equivalent:
- There exists an -functor and -isomorphisms
gf ≃ id_ℱ, fg ≃ id_𝒢.
- For every category over , the functor
f′ = f ×_ℰ ℰ′: ℱ′ = ℱ ×_ℰ ℰ′ → 𝒢′ = 𝒢 ×_ℰ ℰ′
is an equivalence of categories.
-
is an equivalence of categories, and for every , the functor induced by is an equivalence of categories.
-
is fully faithful, and for every and every , there exist and an -isomorphism .
Proof. Evidently (1) implies that is an equivalence of categories, a notion defined by the same condition but without requiring the isomorphisms of functors to be -morphisms. On the other hand, it follows from the functorialities of the preceding number that condition (1) is preserved after base change . Hence (1) ⇒ (2). Evidently (2) ⇒ (3), since it is enough to take and . It is still more trivial that (3) ⇒ (4). It remains to prove (4) ⇒ (1).
For this, choose for every an object and an isomorphism such that , where . This is possible by the second condition in (4). As is known and immediate, the fact that is fully faithful implies that can be regarded in a unique way as a functor from to , so that the define a functorial homomorphism, hence isomorphism,
Moreover, by construction, is an -functor and an -homomorphism. To the preceding data there then corresponds a functorial isomorphism , defined by the condition , and one sees at once that it is also an -morphism. This proves the assertion.
Definition.
If the preceding conditions are satisfied, one says that is an equivalence of categories over , or an -equivalence.
Corollary.
Suppose that the projection functor is a transportable functor, i.e. that for every isomorphism in and every object in , there exists an isomorphism in with source such that . Then every -functor that is an equivalence of categories is an -equivalence.
This follows
from criterion (4).
Corollary.
Let be an -equivalence. Then for every category over , the corresponding functors
Hom̲_{ℰ/-}(𝒢,ℋ) → Hom̲_{ℰ/-}(ℱ,ℋ),
Hom̲_{ℰ/-}(ℋ,ℱ) → Hom̲_{ℰ/-}(ℋ,𝒢)
are equivalences of categories.
This follows from criterion (1) by the usual argument.
5. Cartesian Morphisms, Inverse Images, Cartesian Functors
Let be a category over , with projection functor .
Definition.
Consider a morphism
in , and let
S = p(ξ), T = p(η), f = p(α).
One says that is a cartesian morphism if, for every and every -morphism , there exists a unique -morphism such that .
This therefore means that, for every , the map
is bijective. It also means that the pair represents, as a functor in , the functor given by the second member.
If, for a given morphism in and a given , such a pair exists, i.e. a cartesian morphism in with target and with , then is determined in up to unique isomorphism. One then says that the inverse image of by exists, and an object of endowed with a cartesian -morphism is called an inverse image of by .
Often, once is fixed, one assumes such an inverse image chosen whenever it exists. The inverse image will then be denoted by symbols such as , or simply , or when these notations cause no confusion. In what follows, the canonical morphism will then be denoted .
If for every the inverse image of by exists, one also says that the
inverse-image functor by in exists, and then becomes a covariant functor in ,
from to . This comes from the fact that the second member in (i) depends covariantly
on , or more precisely denotes a functor from to Set.
This functorial dependence of is made explicit as follows. Consider cartesian -morphisms
α: η → ξ, α′: η′ → ξ′
and an -morphism . Then there exists a unique -morphism such that
α′ μ = λ α,
as follows from the fact that is cartesian.
Also note the following immediate fact. Consider a commutative diagram in
η --α--> ξ
| |
μ λ
↓ ↓
η′ --α′-> ξ′
where and are -morphisms, is an -isomorphism, and is a -isomorphism. Then is cartesian if and only if is cartesian.
Definition.
An -functor is called a cartesian functor if it transforms cartesian
morphisms into cartesian morphisms. We denote by Hom̲_cart(ℱ,𝒢) the full subcategory of Hom̲_{ℰ/-}(ℱ,𝒢) formed by the
cartesian functors.
For example, regarding as a category over by means of the identity functor, every morphism of is cartesian. Thus a cartesian functor from to is a section functor that transforms every morphism of into a cartesian morphism. Such a functor is called a cartesian section of over .
Proposition.
- A functor that is an -equivalence is a cartesian functor.
- Let , be two isomorphic -functors . If one is cartesian, then so is the other.
- The composite of two cartesian functors and is a cartesian functor.
Assertion (3) is trivial from the definition; (2) follows from the remark preceding VI.5.2; (1) follows easily from the definition and criterion VI.4.2 (3). More precisely, a morphism in is cartesian if and only if is cartesian.
Corollary.
Let be an -equivalence. Then for every category over , the corresponding functors and induce equivalences of categories:
Hom̲_cart(𝒢,ℋ) ≃ Hom̲_cart(ℱ,ℋ),
Hom̲_cart(ℋ,ℱ) ≃ Hom̲_cart(ℋ,𝒢).
This follows in the usual way from criterion VI.4.2 (1) and from VI.5.3 (1), (2), (3).
One can specify that the -functor is cartesian if and only if is cartesian, and likewise an -functor is cartesian if and only if is cartesian.
It follows from VI.5.4 (3) that, if one considers the subcategory of whose objects are the same as those of and whose morphisms are the cartesian functors, then, as in VI.2, one has pairings
Hom̲_cart(ℱ,𝒢) × Hom̲_cart(𝒢,ℋ) → Hom̲_cart(ℱ,ℋ)
induced by those of VI.2. These pairings allow one to regard Hom̲_cart(ℱ,𝒢) as a functor in and
, from the category (Cat^cart_/ℰ)° × Cat^cart_/ℰ to Cat. We shall need this remark chiefly in the case
.
Definition.
Let be a category over . We denote by
the category of cartesian -functors , i.e. the cartesian sections of over .
By what has just been said, is a functor in , from the category
to the category Cat.
We shall see below the relations between this operation and the notion of projective limit of categories, as well as numerous examples.
6. Fibered Categories and Prefibered Categories. Products and Base Change in Them
Definition.
A category over is called a fibered category, and the functor is then said to be fibrant, if it satisfies the two following axioms:
Fib I. For every morphism in , the inverse-image functor by in exists.
Fib II. The composite of two cartesian morphisms is cartesian.
A category over satisfying condition Fib I is called a prefibered category over .
If is a fibered, respectively prefibered, category over , a subcategory of is called a fibered subcategory, respectively a prefibered subcategory, if it is a fibered, respectively prefibered, category over and, moreover, the inclusion functor is cartesian. If, for example, is a full subcategory of , one sees that this means that, for every morphism in and every , is -isomorphic to an object of .
Another interesting case is the following. Let be a fibered category over , and consider the subcategory of with the same objects and whose morphisms are the cartesian morphisms of ; in particular the morphisms of are the isomorphisms of . One sees at once that this is indeed a fibered subcategory of , because in the bijection
relative to a cartesian -morphism in , the -isomorphisms of the first member correspond to the cartesian morphisms of the second. By definition, the cartesian sections then correspond bijectively to arbitrary -functors . However, note that the natural functor
Hom̲_{ℰ/-}(ℰ,𝒢) → Hom̲_cart(ℰ,ℱ) = Lim←(ℱ/ℰ)
is faithful, but in general is not fully faithful, i.e. is not an isomorphism.
Remarks. Let be a category over . The following conditions are equivalent:
- All morphisms of are cartesian.
- is a fibered category over , and the are groupoids, i.e. every morphism in is an isomorphism.
One then says that is a category fibered in groupoids over .
These are the ones encountered especially in “theory of moduli”. If is a groupoid, one shows that conditions (1) and (2) are also equivalent to the following:
- is a groupoid, and the projection functor is transportable; cf. VI.4.4.
For example, if and are groupoids such that and are reduced to a point, so that and are defined, up to isomorphism, by groups and , and the functor is defined by a group homomorphism , then is fibered over if and only if is surjective, i.e. if defines an extension of the group by the group .
Proposition.
Let be an -equivalence. In order that be a fibered, respectively prefibered, category over , it is necessary and sufficient that be so.
This follows easily from the definitions and from the remark made above that a morphism in is cartesian if and only if is.
Proposition.
Let , be two categories over , and let be a morphism in . Then is cartesian if and only if its components are cartesian.
Indeed, let be the target and the source of , and let be the morphism of such that and are -morphisms. For every in , one has a commutative diagram
where the vertical arrows are bijections. Thus if one of the horizontal arrows is a bijection, the same is true of the other. This already shows that if and are cartesian, hence the second horizontal arrow is bijective, then is cartesian. The converse is seen by taking, in the diagram above, , whence : first for , which proves that is cartesian, then for , which proves that is cartesian.
Corollary.
Let , and let be an -functor . Then is cartesian if and only if and are cartesian. One obtains in this way an isomorphism of categories
Hom̲_cart(𝒢, ℱ₁ ×_ℰ ℱ₂) ≃ Hom̲_cart(𝒢,ℱ₁) × Hom̲_cart(𝒢,ℱ₂),
and in particular, taking , an isomorphism of categories
Lim←((ℱ₁ ×_ℰ ℱ₂)/ℰ) ≃ Lim←(ℱ₁/ℰ) × Lim←(ℱ₂/ℰ).
Corollary.
Let and be two fibered, respectively prefibered, categories over . Then their fiber product is a fibered, respectively prefibered, category over .
These results moreover extend to the case of the fiber product of an arbitrary family of categories over .
Proposition.
Let be a category over , with projection functor , and let be a functor. Regard as a category over by the projection functor . Let be a morphism of . Then is a cartesian morphism if and only if its image in is cartesian.
The proof is immediate and is left to the reader.
Corollary.
For every cartesian functor of categories over , the functor
F′ = F ×_ℰ ℰ′
from to is cartesian.
Consequently, the functor Hom̲_ℰ(ℱ,𝒢) → Hom̲_ℰ′(ℱ′,𝒢′) considered in VI.3 induces a functor
Hom̲_cart(ℱ,𝒢) → Hom̲_cart(ℱ′,𝒢′).
In other words, for fixed and , one may regard
Hom̲_cart(ℱ ×_ℰ ℰ′, 𝒢 ×_ℰ ℰ′)
as a functor in , from the category to Cat. If and
are also allowed to vary, one finds a functor from the category
Cat_/ℰ° × (Cat^cart_/ℰ)° × Cat^cart_/ℰ
to Cat.
When one takes into account the isomorphism
Hom_ℰ′(ℱ′,𝒢′) ≃ Hom_ℰ(ℱ ×_ℰ ℰ′,𝒢)
considered in VI.3, the cartesian -functors from to correspond to the -functors that transform every morphism whose first projection is a cartesian morphism of into a cartesian morphism of . Taking , one finds, after a change of notation:
Corollary.
is isomorphic to the full subcategory of Hom̲_{ℰ/-}(ℰ′,ℱ) formed by the
-functors that transform arbitrary morphisms into cartesian morphisms. In
particular, if is a fibered category and if is the subcategory of
whose morphisms are the cartesian morphisms of , then one has a bijection
This makes precise the way in which the expression
must be regarded as a functor in and , from the category Cat_/ℰ° × Cat^cart_/ℰ to the
category Cat. Later we shall see a more complete functorial dependence with respect to when
is required to be a fibered category.
Corollary.
If is a fibered, respectively prefibered, category over , then is a fibered, respectively prefibered, category over .
Proposition.
Let and be prefibered categories over , and let be a cartesian -functor from to . In order that be faithful, respectively fully faithful, respectively an -equivalence, it is necessary and sufficient that for every , the induced functor
be faithful, respectively fully faithful, respectively an equivalence.
The proof is immediate from the definitions.
To finish this number, we give a few properties of fibered categories using axiom Fib II.
Proposition.
Let be a prefibered category over . In order that be fibered, it is necessary and sufficient that it satisfy the following condition:
Fib II′. Let be a cartesian morphism in over the morphism of . For every morphism in , and every , the map
is bijective.
In other words, in a category fibered over , cartesian diagrams are characterized by a property a priori stronger than the one in the definition, which is recovered by taking in the preceding statement.
Corollary.
Let be a category over and let be a morphism in . In order that be an isomorphism, it is necessary that be an isomorphism and that be cartesian. The converse is true if is fibered over .
Indeed, if is an isomorphism then evidently so is . For every , the map
is bijective. Since is an isomorphism, one sees at once that an element of the first member is a -morphism if and only if its image in the second is an -morphism. Thus one obtains a bijection
which proves the first assertion. Conversely, suppose that is an isomorphism and that satisfies the condition stated in Fib II′, which means, when is fibered over , that is cartesian. Then one sees at once that for every , the map from to is bijective, and hence is an isomorphism.
Corollary.
Let and be two composable morphisms in the category fibered over . If is cartesian, then is cartesian if and only if is cartesian.
One uses the definition of cartesian morphisms in the strengthened form VI.6.11.
7. Categories Cloven over ℰ
Definition.
Let be a category over . A cleavage of over means a function that attaches to every an inverse-image functor for in , denoted . The cleavage is said to be normalized if implies . A cloven category, respectively a normalized cloven category, means a category over endowed with a cleavage, respectively with a normalized cleavage.
It is evident that admits a cleavage if and only if is prefibered over , and then admits a normalized cleavage. The set of cleavages on is in bijective correspondence with the set of subsets of satisfying the following conditions:
- The are cartesian morphisms.
- For every morphism in and every , there exists a unique -morphism in with target .
For the cleavage defined by to be normalized, it is necessary and sufficient that also satisfy the condition:
- The identity morphisms in belong to .
The morphisms that are elements of may be called the “transport morphisms” for the cleavage in question.
The notion of isomorphism of cloven categories over is clear. More generally, one can define morphisms of cloven -categories as functors of -categories that send transport morphisms to transport morphisms. These are, in particular, cartesian functors. In this way the cloven categories over are the objects of a category, the category of cloven categories over . The reader may spell out the existence of products, tied to the fact that if a category over is the product of categories over , each endowed with a cleavage, then is endowed with the corresponding natural cleavage. We also leave to the reader the task of spelling out the notion of base change in cloven categories.
We shall denote by the canonical morphism
As was said, it is functorial in , i.e. one has a functorial homomorphism
α_f: i_T f* → i_S,
where for every , denotes the inclusion functor
Now consider morphisms
f: T → S and g: U → T
in , and let . There then exists a unique -morphism
making commutative
the diagram
by the definition of . For variable , this homomorphism is functorial; that is, one has a homomorphism
of functors . Note at once:
Proposition.
In order that the cloven category over be fibered, it is necessary and sufficient that the be isomorphisms.
It follows, taking to be an isomorphism and its inverse, and considering the isomorphisms and :
Corollary.
If is a fibered cloven category over , then for every isomorphism in , is an equivalence of categories .
Proposition.
Let be a cloven category over . One has:
A)
c_{f,id_T}(ξ) = α_{id_T}(f*(ξ)),
c_{id_S,f}(ξ) = f*(α_{id_S}(ξ)).
and
B) c_{f,gh}(ξ) · c_{g,h}(f*(ξ))
= c_{fg,h}(ξ) · h*(c_{f,g}(ξ)).
In these formulas, , , denote morphisms
V → U → T → S
and is an object of .
In the case of a normalized cleavage, the first and second relations take the simpler form
A′) c_{f,id_T} = id_{f*}, c_{id_S,f} = id_{f*}.
As for the third, it is visualized by the commutativity of the diagram
In the case of fibered categories, where the are isomorphisms, this commutativity may be expressed intuitively by saying that the successive use of isomorphisms of the form does not lead to “contradictory identifications.” One may also write this formula without the argument , using the convolution product of homomorphisms of functors:
c_{fg,h} ∘ (h* ∗ c_{f,g}) = c_{f,gh} ∘ (c_{g,h} ∗ f*).
The proof of the first two formulas in VI.7.4 is trivial; let us sketch that of the third. For this, consider, in
addition to the square (D), the square of homomorphisms
which is commutative by definition of . Consider the diagram obtained by joining the vertices of (D) to
the corresponding vertices of this square by homomorphisms of the form :
The four lateral faces of the cube so obtained are also commutative. For the left face, this comes from the fact that
the left column of (D) is obtained from the left column of the preceding square by applying , and that
is a functorial homomorphism. For the other three faces, this is nothing other than the definition of the operations
on the remaining three sides of (D). Thus the five faces of the cube other than the upper face are commutative. It
follows that the two (fgh)-morphisms defined by (D) have the same composite with
. Hence they are equal by the definition of .
Let us confine ourselves, in what follows, to normalized cloven categories. Such a category gives rise to the following objects:
- A map from to
Cat. - A map , associating to every , with source and target , a functor .
- A map , associating to every pair of arrows of a functorial homomorphism .
Moreover, these data satisfy the conditions expressed in formulas A′) and B) above. N.B. If one had not confined oneself to the case of a normalized cleavage, one would have had to introduce an additional object, namely a function associating to every object of a functorial homomorphism ; condition A′) would then be replaced by condition A).
We shall now show how one can reconstruct, up to unique isomorphism, the normalized cloven category over from the preceding objects.
8. Cloven Category Defined by a Pseudofunctor ℰ° → Cat
For short, call a pseudofunctor from to Cat, one should say a normalized pseudofunctor,
a set of data a), b), c) as above, satisfying conditions A′) and B). In the preceding number we associated to a
normalized cloven category over a pseudofunctor . Here we indicate the
inverse construction. We shall leave to the reader the verification of most of the details, as well as of the fact that
these constructions are indeed “inverse” to one another. More precisely, one should regard the pseudofunctors
as the objects of a new category, and show that our constructions provide equivalences,
quasi-inverse to one another, between this latter category and the category of cloven categories over
defined in the preceding number.
Put
the sum set of the sets . N.B. here we write , and not , for the value at the object of of the given pseudofunctor, to avoid notational confusion later. We therefore have an evident map
Let
ξ̄ = (S,ξ), η̄ = (T,η), with ξ ∈ Ob(ℱ(S)), η ∈ Ob(ℱ(T)),
be two elements of , and let . Put
If in addition one has a morphism in and , one defines a map, denoted ,
i.e. a map
Hom_{ℱ(T)}(η, f*(ξ)) × Hom_{ℱ(U)}(ζ, g*(η))
→ Hom_{ℱ(U)}(ζ, (fg)*(ξ)),
by the formula
u ∘ v = c_{f,g}(ξ) · g*(u) · v.
That is, is the composite of the sequence
ζ --v--> g*(η) --g*(u)--> g*f*(ξ) --c_{f,g}(ξ)--> (fg)*(ξ).
On the other hand, put
The preceding pairings define pairings
while the definition of the gives an evident map
This being said, one verifies the following points:
-
Composition between elements of the is associative.
-
For every in , consider the identity element of
and its image in . This object is a left and right unit for composition between elements of the .
This already shows that one obtains a category by putting
N.B. one cannot simply take to be the union of the sets , since these latter sets are not necessarily disjoint. Moreover:
- The maps and define a functor . In this way becomes a category over ; moreover, the evident map induces a bijection
- The evident maps
Ob(ℱ(S)) → ℱ° = Ob(ℱ), Fl(ℱ(S)) → Fl(ℱ),
where the second is defined by the evident maps
define an isomorphism
- For every object of , and every morphism of , consider
the element of , with , and the element of , image of by the morphism
This element is cartesian, and it is the identity of if . In other words, the set of the defines a normalized cleavage of over . Moreover, by construction, one has commutativity in the diagram of functors
where is the inverse-image functor by , relative to the cleavage considered on . Finally:
- The homomorphisms given with the pseudofunctor are transformed, by the isomorphisms , into the functorial homomorphisms associated with the cleavage of .
We restrict ourselves to giving the verification of 1), which is, if anything, less trivial than the others. It suffices to prove associativity of composition between objects of sets of the form . Thus consider in morphisms
S ←^f T ←^g U ←^h V
and objects
ξ, η, ζ, τ
in , , , , and finally elements
u ∈ h_f(η̄,ξ̄) = Hom_{ℱ(T)}(η, f*(ξ)),
v ∈ h_g(ζ̄,η̄) = Hom_{ℱ(U)}(ζ, g*(η)),
w ∈ h_h(τ̄,ζ̄) = Hom_{ℱ(V)}(τ, h*(ζ)).
We want to prove the formula
(u ∘ v) ∘ w = u ∘ (v ∘ w),
which is an equality in . By the definitions, the two members of this equality are obtained by composition along the upper and lower contours of the diagram below:
τ --w--> h*(ζ) --h*(v)--> h*g*(η) --h*g*(u)--> h*g*f*(ξ) --h*(c_{f,g}(ξ))--> h*(fg)*(ξ)
\____________________ v∘w ____________________/ | c_{g,h}(f*(ξ)) | c_{fg,h}(ξ)
↓ ↓ ↓
(gh)*(η) --(gh)*(u)--> (gh)*f*(ξ) --c_{f,gh}(ξ)--> (fgh)*(ξ).
The middle square is commutative because is a functorial homomorphism, and the square on the right is commutative by condition B) for a pseudofunctor. This gives the asserted result.
Of course, it remains to specify, when the pseudofunctor considered already comes from a normalized cloven category over , how one obtains a natural isomorphism between and . We leave the details to the reader.
We likewise leave to the reader the interpretation, in terms of pseudofunctors, of the notion of inverse image of a cloven category over by a base-change functor .
9. Example: Cloven Category Defined by a Functor ℰ° → Cat; Split Categories over ℰ
Suppose one has a functor
It then defines a pseudofunctor by putting
ℱ(S) = φ(S), f* = φ(f), c_{f,g} = id_{(fg)*}.
Thus the construction of the preceding number gives us a category cloven over , said to be associated with the functor . For a cloven category over to be isomorphic to a cloven category defined by a functor , it is manifestly necessary and sufficient that it satisfy the conditions
(fg)* = g*f*, c_{f,g} = id_{(fg)*}.
In terms of the set of transport morphisms, this also simply means that the composite of two transport morphisms
is a transport morphism. A cleavage of a category over satisfying the preceding condition
is called a splitting of over , and a category over endowed
with a splitting is called a split category over . It is therefore a special case of the notion of
cloven category. The category of split categories over is therefore equivalent to Hom̲(ℰ°,Cat). Note that
a split category over is a fortiori a cloven category over .
If is a fibered category over , there does not always exist a splitting on . Suppose for example that and are reduced to one element, and that the set of endomorphisms of that element is a group , respectively , so that the projection functor is given by a group homomorphism , surjective since is fibrant. One verifies at once that the set of cleavages of over is in bijective correspondence with the set of maps such that , i.e. the set of “systems of representatives” for the classes modulo the subgroup that is the kernel of the surjective homomorphism . A cleavage is a splitting if and only if is a group homomorphism. To say that a splitting exists therefore means that the group extension of by is trivial, which is expressed, when is commutative, by the vanishing of a certain cohomology class in , where is regarded as a group on which operates.
Suppose, however, that is a fibered category over such that the
are rigid categories, i.e. the automorphism group of every object of is reduced to the identity. It is then easy to prove that admits a splitting over . Indeed, one first observes that the question of existence of a splitting is not changed if is replaced by an -equivalent category. This reduces us in the present case to the case where the are rigid and reduced categories, i.e. two isomorphic objects in are identical. But if is a rigid and reduced category, every isomorphism between two functors , where is any category, is an identity. It follows that if is a fibered category over whose fiber categories are rigid and reduced, then there exists a unique cleavage of over , which is necessarily a splitting. Thus is isomorphic to the category defined by a functor such that the are rigid and discrete categories, and the functor is defined up to isomorphism.
10. Co-Fibered Categories, Bi-Fibered Categories
Consider a category over , with projection functor
It defines a category over by the projection functor
A morphism in is said to be co-cartesian if it is a cartesian morphism for over . Spelling this out, one sees that it means that for every object of , the map
is bijective. One then also says that is a direct image of by , in the category over . If it exists for every in , one says that the direct-image functor by exists; once it has been chosen, this functor is denoted
It is therefore defined by an isomorphism of bifunctors on :
Thus, if exists, then for to exist it is necessary and sufficient that admit an adjoint functor, i.e. that there exist a functor and an isomorphism of bifunctors
Let be another morphism in , and suppose that the inverse and direct images by , , and
fg exist. Consider then the functorial homomorphisms
c^{f,g}: f_* g_* ← (fg)_*,
c_{f,g}: g* f* → (fg)*.
One observes that, if and are regarded as a pair of adjoint functors, and likewise and , then the two preceding homomorphisms are adjoint to one another. Thus one is an isomorphism if and only if the other is. In particular:
Proposition.
Suppose that the category over is prefibered and co-prefibered. In order that it be fibered, it is necessary and sufficient that it be co-fibered.
Of course, is said to be co-prefibered, respectively co-fibered, over if is prefibered, respectively fibered, over . We shall say that is bi-fibered over if it is both fibered and co-fibered over .
11. Various Examples
a) Categories of Arrows of ℰ
Let be a category. Denote by the category associated with the totally ordered set with two
elements [0,1]. It therefore has two objects 0 and 1, and besides the two identity morphisms one arrow (0,1)
with source 0 and target 1. Let
Ar(ℰ) = Hom̲(Δ¹,ℰ).
This is called the category of arrows of . The object 1 of defines a canonical functor,
called the target functor
the functor defined by the object 0 of being called the source functor. For every object of
, the fiber category is canonically isomorphic to the category of
objects of over .
Consider a morphism in . To it there corresponds a canonical functor
f_*: ℰ_/T = ℱ_T → ℰ_/S = ℱ_S
and a functorial isomorphism
which therefore makes a direct-image functor for in . Moreover, here
(id_S)_* = id_{ℱ_S}, (fg)_* = f_* g_*, c^{f,g} = id_{(fg)},
i.e. is endowed with a co-splitting over . A fortiori, is co-fibered over . Note now that the set of morphisms in is in bijective correspondence with the set of commutative square diagrams in :
Y --f′--> X
| v | u
↓ ↓
T --f--> S.
By definition, the morphism in question is cartesian if the square is cartesian in , i.e. if it makes a fiber product of and over . The inverse-image functor therefore exists if and only if, for every object over , the fiber product exists. It follows from VI.10.1 that if the product of two objects over a third always exists in , i.e. if is prefibered over , then is even fibered over .
b) Category of Presheaves or Sheaves on Variable Spaces
Let be the category of topological spaces. If is a topological space, we denote by the category of open subsets of , whose morphisms are inclusion maps. If is a category, a functor is called a presheaf on with values in , and a sheaf if it satisfies a left-exactness condition that we shall not repeat here.
The category of presheaves on with values in is, by definition, the category
Hom̲(𝒰(T)°,𝒞), and the category of sheaves on with values in is the full subcategory
whose objects are the objects of Hom̲(𝒰(T)°,𝒞) that are sheaves. If is a morphism in , i.e. a
continuous map of topological spaces, then by the increasing map there corresponds to it a functor
, whence a functor
f_*: Hom̲(𝒰(T)°,𝒞) → Hom̲(𝒰(S)°,𝒞)
called the direct-image functor of presheaves by . One sees at once that the direct image of a sheaf is a sheaf. Thus the functor induces a functor, also denoted
Moreover, one verifies trivially, by associativity of composition of functors, that for a second continuous map one has the identity
(gf)_* = g_* f_*, and likewise (id_S)_* = id_{𝒫(S)}.
In this way one obtains a functor
respectively
from to Cat. In fact, we are interested in the corresponding functor
S ↦ 𝒫(S)°, respectively S ↦ ℱ(S)°.
It defines a co-fibered, indeed co-split, category over the category of topological spaces, called the co-fibered category of presheaves, respectively sheaves, with values in , understood as on variable spaces. Spelling out the construction of VI.8, one sees that a morphism from a presheaf on to a presheaf on is a pair formed by a continuous map from to and a morphism in the category . This description is equally valid for morphisms of sheaves, being a full subcategory of .
In the most important cases, the category and the category over are also fibered categories; that is, for every continuous map, the direct-image functors and have an adjoint functor, then denoted and called the inverse-image functor of presheaves, respectively the inverse-image functor of sheaves, by the continuous map . This functor exists, for example, if . One can show that the functor exists whenever inductive limits, relative to diagrams in the Universe under consideration, exist in . The question is less easy for . Indeed, even in the case , the inverse image of a presheaf that is a sheaf is not in general a sheaf; in other words, the inverse-image functor of sheaves is not isomorphic to the functor induced by the inverse-image functor of presheaves, despite the common notation . Thus is a co-fibered subcategory of , but not a fibered subcategory; i.e. the inclusion functor is not fibrant.
The co-fibered category can be deduced from a more general co-fibered, or rather fibered, category obtained as follows. For every category in the fixed Universe, put
𝒫(𝒰) = Hom̲(𝒰,𝒞),
and
note that is naturally a contravariant functor in , from the
category Cat to Cat. It therefore defines a split category over , which we shall denote
. The objects of this category are pairs , where is a category and
is a functor; a morphism from to is essentially a
pair , where is a functor and is a homomorphism of functors .
We leave to the reader the task of spelling out the composition of morphisms in .
The projection functor
ℱ = Cat_//𝒞 → ℰ = Cat
sends the pair to the object . The fiber category at is the category
Hom̲(𝒰,𝒞), up to isomorphism. When inductive limits exist in , one shows easily that the fibered category
over Cat is also co-fibered over Cat; i.e. one can define the notion of direct image of a
functor by a functor .
The category of presheaves is deduced from the preceding fibered category by the base change
the functor defined above. This gives a fibered category over , and by passing
to the opposite category one obtains the co-fibered category of presheaves over Top. The notion of
inverse image of a functor corresponds to that of direct image of a presheaf; the notion of direct image of a functor
corresponds to that of inverse image of a presheaf.
c) Objects with Operators over an Object with Operators
Let be a category over , and let be an object of on which a group operates, on the left to fix ideas. This object with operators can be interpreted as corresponding to a functor from the category defined by , with a single object and as its group of endomorphisms, to the category . It therefore defines by base change a category over , which is fibered, respectively co-fibered, when is so over .
A section of over , necessarily cartesian, since is a groupoid and every isomorphism in is cartesian by VI.6.12, can also be interpreted as an -functor over , or also as an object with operators in “over” the object with operators .
d) Pairs of Quasi-Inverse Adjoint Functors; Autodualities
When the base category is reduced to two objects , and, besides the identity arrows, to two isomorphisms and inverse to one another, i.e. is a connected rigid groupoid with two objects, a normalized cloven category over is essentially the same thing as the system formed by two categories and and a pair of adjoint functors and that are equivalences of categories, hence quasi-inverse to one another. One takes for and the fiber categories of , for and the functors and , and the two isomorphisms
u: FG ≃ id_{ℱ_a}, v: GF ≃ id_{ℱ_b}
are and . The two usual compatibility conditions between and are nothing other than condition
VI.7.4 B) for the composites fgf and gfg. It is easy to show that these conditions suffice to imply that one indeed
has a pseudofunctor .
An interesting case is the one in which
ℱ_b = ℱ_a°, G = F°, v = u°.
An autoduality in a category means the data of a functor and an isomorphism such that and the isomorphism make a pair of adjoint functors, necessarily quasi-inverse to one another. This condition is written
D(u(x)) = u(D(x)) for every x ∈ Ob(𝒞).
e) Categories over a Discrete Category ℰ
One says that is a discrete category if every arrow in it is an identity arrow, so that is defined up to unique isomorphism by knowing the set . The data of a category over is therefore equivalent, up to unique isomorphism, to the data of a family of categories , , the fiber categories. Every category over is fibered; every -functor is cartesian; one has a canonical isomorphism
Hom̲_{ℰ/-}(ℱ,𝒢) ≃ ∏ᵢ Hom̲(ℱᵢ,𝒢ᵢ).
In particular, one obtains
Γ̲(ℱ/ℰ) = Lim←(ℱ/ℰ) ≃ ∏ᵢ ℱᵢ.
f) Suppose that ℰ Has Exactly Two Objects S and T
Suppose that, besides the identity morphisms, has one morphism . Then a category
over is defined, up to unique -isomorphism, by the data of two categories
and and a bifunctor on with values in
Set. Indeed, if is a category over , one associates to it the two fiber categories
and and the bifunctor . We leave to
the reader the task of spelling out the construction in the opposite direction. For the category in question to be
fibered, or prefibered, which comes to the same thing, it is necessary and sufficient that the functor be
representable with respect to the argument . For it to be co-fibered, it is necessary and sufficient that be
representable with respect to the argument .
g)
Let , regarded as a category over by means of . Then
is fibered and co-fibered over , and is even endowed with a canonical splitting and
co-splitting, corresponding to the constant functor on , respectively on , with values
in Cat and value . One has
Γ̲(ℱ/ℰ) ≃ Hom̲(ℰ,𝒞),
and
corresponds to the full subcategory formed by the functors that transform arbitrary morphisms into isomorphisms.
12. Functors on a Cloven Category
Let be a normalized cloven category over . For every object of , denote by
the inclusion functor. Thus one has a functorial homomorphism, for every morphism in ,
α_f: i_T f* → i_S,
where is the base-change functor for defined by the cleavage. Let now
be a functor from to a category . Put, for every ,
F_S = F ∘ i_S: ℱ_S → 𝒞,
and for every in ,
φ_f = F ∗ α_f: F_T f* → F_S.
Thus to every functor there is associated a family (F_S) of functors
, and a family of homomorphisms of functors . These
families satisfy the following conditions:
a) .
b) For two morphisms and in , one has commutativity in the square of functorial homomorphisms:
F_U g* f* --F_U ∗ c_{f,g}--> F_U(fg)*
| φ_g ∗ f* | φ_{fg}
↓ ↓
F_T f* ------φ_f-------------> F_S.
The first relation is trivial, and the second relation is obtained by applying the functor to the commutative diagram
g*f*(ξ) --c_{f,g}(ξ)--> (fg)*(ξ)
| α_g(f*(ξ)) | α_{fg}(ξ)
↓ ↓
f*(ξ) --α_f(ξ)-----------> ξ
for variable in .
If is a second functor , giving rise to functors and functorial homomorphisms , and if is a functorial homomorphism, then to it there correspond the functorial homomorphisms :
One checks at once that, for every morphism in , one has commutativity in the squares
c) F_T f* --φ_f--> F_S
| u_T ∗ f* | u_S
↓ ↓
G_T f* --ψ_f--> G_S.
Proposition.
Let be the category whose objects are pairs of families (F_S),
, of functors , and of families ,
, of functorial homomorphisms satisfying conditions a) and b), and
whose morphisms are the families , , of homomorphisms verifying the
commutativity condition c) written above; composition of morphisms is by composition of homomorphisms of functors
. Then the two laws just described define an isomorphism from the category
Hom̲(ℱ,𝒞) to the category .
It is trivial that this is indeed a functor from the first category to the second. This functor is fully faithful: for given , , the map is trivially injective. To show that it is surjective, it suffices to note that commutativity condition c) expresses the functoriality of the maps
u(ξ) = u_S(ξ): F(ξ) = F_S(ξ) → G(ξ) = G_S(ξ)
for homomorphisms of the form in . On the other hand, one has functoriality on each fiber category, i.e. for morphisms in that are -morphisms with . Hence one has functoriality for every morphism in , since an -morphism, where is a morphism in , is uniquely a composite of a morphism and a -morphism.
It remains therefore to prove that the functor is bijective on objects. The preceding argument already shows that
is injective on objects; it remains to prove that it is surjective. That is, suppose we start from a system (F_S),
satisfying a) and b), and define a map by
F(ξ) = F_S(ξ) for ξ ∈ Ob(ℱ_S) ⊂ Ob(ℱ),
and a map by
for every morphism in , every object of , and every -morphism with target . Then one obtains a functor from to . Indeed, the relation is trivial; it remains to prove multiplicativity when one has an -morphism and a -morphism , with and morphisms of . Putting , one has
u = α_f(ξ)u′, v = α_g(η)v′, w = α_{fg}(ξ)w′
with
w′ = c_{f,g}(ξ) g*(u′) v′ cf. VI.8.
With this notation, one must prove commutativity of the outer contour of the diagram below:
F_U(ζ) --F_U(v′)--> F_U g*(η) --F_U g*(u′)--> F_U g*f*(ξ) --F_U(c_{f,g}(ξ))--> F_U(fg)*(ξ)
\________________ F(v) ________________/ | φ_g(f*(ξ)) | φ_{fg}(ξ)
↓ ↓
F_T(η) --F_T(u′)--> F_T f*(ξ) --φ_f(ξ)--> F_S(ξ).
The left triangle is commutative by definition of ; the middle square is commutative because it is deduced from the homomorphism by the functorial homomorphism ; finally the right square is commutative by condition b). The desired conclusion follows.
Suppose now that is also a normalized cloven category over , which from now on we shall call , and that we are interested in -functors from to . If is such a functor, it induces functors
on the fiber categories. On the other hand, for every morphism in and every object in , the -morphism factors uniquely through a -morphism
where the subscript or indicates the cloven category in which the inverse-image functor is being taken. Hence one obtains a functorial homomorphism of functors from to :
φ_f: F_T f*_ℱ → f*_𝒢 F_S.
The two systems (F_S) and satisfy the following conditions:
a′) .
b′) For two morphisms and in , one has commutativity in the following diagram of functorial homomorphisms:
F_U g*_ℱ f*_ℱ --F_U ∗ c^ℱ_{f,g}--> F_U(fg)*_ℱ
| φ_g ∗ f*_ℱ | φ_{fg}
↓ ↓
g*_𝒢 F_T f*_ℱ
| g*_𝒢 ∗ φ_f
↓
g*_𝒢 f*_𝒢 F_S --c^𝒢_{f,g} ∗ F_S--> (fg)*_𝒢 F_S.
We leave to the reader the verification, as well as the statement and proof of the analogue of Proposition VI.12.1,
which implies that one obtains in this way a bijective correspondence between the set of -functors from
to and the set of systems (F_S), satisfying conditions a′) and b′) above. Of
course, in this correspondence, the cartesian functors are characterized by the property that the homomorphisms
are isomorphisms.
Remark. Of course, it is usually better to reason directly on fibered categories without using explicit cleavages. This avoids, in particular, having to appeal, for the simple notion of ℰ-functor or cartesian ℰ-functor, to a heavy interpretation such as the one above. It is in order to avoid unbearable heaviness, and to obtain more intrinsic statements,
that we have had to give up starting, as in [VI.2], from the notion of cloven category, called “fibered category” in the cited text, which now takes second place in favor of the notion of fibered category. It is moreover probable that, contrary to the still prevailing usage, tied to old habits of thought, it will eventually prove more convenient in universal problems not to put the emphasis on one solution supposed chosen once and for all, but to put all solutions on an equal footing.
Bibliography
[VI.1] A. Grothendieck, “Sur quelques points d’algèbre homologique,” Tôhoku Math. J. 9 (1957), 119–221.
[VI.2] A. Grothendieck, “Technique de descente et Théorèmes d’existence, I,” Séminaire Bourbaki 190, December 1959.
The eventual authors are C. Chevalley and P. Gabriel. The book is due out in the year 3000. Meanwhile, cf. also SGA 4 I.