In mathematics, especially homotopy theory, a cartesian fibration is, roughly, a map so that every lift exists that is a final object among all lifts. For example, the forgetful functor

from the category of pairs
of schemes and quasi-coherent sheaves on them is a cartesian fibration (see § Basic example). In fact, the Grothendieck construction says all cartesian fibrations are of this type; i.e., they simply forget extra data. See also: fibred category, prestack.
A right fibration between simplicial sets is an example of a cartesian fibration.
Given a functor
, a morphism
in
is called
-cartesian or simply cartesian if the natural map

is bijective.[1][2] Explicitly, thus,
is cartesian if given
and

with
, there exists a unique
in
such that
.
Then
is called a cartesian fibration if for each morphism of the form
in D, there exists a
-cartesian morphism
in C such that
. [3]
A morphism
between cartesian fibrations over the same base S is a map (functor) over the base; i.e.,
that sends cartesian morphisms to cartesian morphisms. Given
, a 2-morphism
is an invertible map (map = natural transformation) such that for each object
in the source of
,
maps to the identity map of the object
under
.
This way, all the cartesian fibrations over the fixed base category S determine the (2, 1)-category denoted by
.
Let
be the category where
- an object is a pair
of a scheme
and a quasi-coherent sheaf
on it,
- a morphism
consists of a morphism
of schemes and a sheaf homomorphism
on
,
- the composition
of
and above
is the (unique) morphism
such that
and
is

To see the forgetful map

is a cartesian fibration,[4] let
be in
. Take

with
and
. We claim
is cartesian. Given
and
with
, if
exists such that
, then we have
is

So, the required
trivially exists and is unqiue.
Note some authors consider
, the core of
instead. In that case, the forgetful map is also a cartesian fibration.
Grothendieck construction
[edit]
Given a category
, the Grothendieck construction gives an equivalence of ∞-categories between
and the ∞-category of prestacks on
(prestacks = category-valued presheaves).[5]
Roughly, the construction goes as follows: given a cartesian fibration
, we let
be the map that sends each object x in C to the fiber
. So,
is a
-valued presheaf or a prestack. Conversely, given a prestack
, define the category
where an object is a pair
with
and then let
be the forgetful functor to
. Then these two assignments give the claimed equivalence.
For example, if the construction is applied to the forgetful
, then we get the map
that sends a scheme
to the category of quasi-coherent sheaves on
. Conversely,
is determined by such a map.
Lurie's straightening theorem generalizes the above equivalence to the equivalence between the ∞-category of cartesian fibrations over some ∞-category C and the ∞-category of ∞-prestacks on C.[6]
- ^ Kerodon, Definition 5.0.0.1. harvnb error: no target: CITEREFKerodon (help)
- ^ Khan, Definition 3.1.1. harvnb error: no target: CITEREFKhan (help)
- ^ Khan, Definition 3.1.2. harvnb error: no target: CITEREFKhan (help)
- ^ Khan, Example 3.1.3. harvnb error: no target: CITEREFKhan (help)
- ^ Khan, Theorem 3.1.5. harvnb error: no target: CITEREFKhan (help)
- ^ An introduction in Louis Martini, Cocartesian fibrations and straightening internal to an ∞-topos [arXiv:2204.00295]