Cartesian fibration
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.
Definition
[edit]Given a functor , a morphism in is called -cartesian if the natural map
is bijective.[1][2] Explicitly, thus, is cartesian if given
- and
with , there exists a unique in such that . See also an argument in § Basic example, which may be less mysterious.
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 simply a map (functor) over the base; i.e., . 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 .
Basic example
[edit]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 an invertible sheaf homomorphism on ,
- the composition of and above is the morphism such that and is
To see the forgetful map
is a cartesian fibration, let be in . Given and with , if exists such that , then we must have:
Since is invertible, the above equation uniquely determines .[4]
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]
See also
[edit]References
[edit]- ^ Kerodon, Definition 5.0.0.1.
- ^ Khan, Definition 3.1.1.
- ^ Khan, Definition 3.1.2.
- ^ Khan, Example 3.1.3. . NB: The reference does not assume the sheaf homomorphisms are invertible but then it is not clear how to show the map is a cartesian fibration (and it is common to assume the homomorphisms are invertible; see for example the moduli stack of vector bundles).
- ^ Khan, Theorem 3.1.5.
- ^ An introduction in Louis Martini, Cocartesian fibrations and straightening internal to an ∞-topos [arXiv:2204.00295]
- Adeel A. Khan, A modern introduction to algebraic stacks, https://www.preschema.com/lecture-notes/2022-stacks/
- Kerodon, https://kerodon.net/
- Aaron Mazel-Gee, A user’s guide to co/cartesian fibrations (arXiv:1510.02402)
Further reading
[edit]- https://ncatlab.org/nlab/show/Cartesian+fibration
- https://ncatlab.org/nlab/show/Cartesian+morphism
- https://ncatlab.org/nlab/show/Grothendieck+fibration