Fibered Categories

Research Depth 79 in the knowledge graph I know this Set as goal
Unlocks 1 downstream topic
fibered category fibration cartesian morphism Grothendieck fibration descent cleavage

Core Idea

A fibered category (or Grothendieck fibration) over a base category B is a functor p: E → B such that for every morphism f: b → b' in B and object e' in E with p(e') = b', there exists a cartesian morphism (or cartesian lifting) φ: e → e' with p(φ) = f, satisfying a universal property. Intuitively, E is a "family of categories parametrized by B": the fiber E_b = p^{-1}(b) is the category sitting over each object b, and cartesian morphisms provide canonical ways to pull back along morphisms in B. Fibered categories formalize the notion of "varying algebraic/geometric structure over a base" and are central to descent theory, stacks, and the Grothendieck construction.

How It's Best Learned

Consider the codomain fibration cod: Arr(C) → C sending each arrow f: A → B to its codomain B. The fiber over B is the slice category C/B. A cartesian morphism is a pullback square. Verify the universal property of cartesian liftings in this example. Then consider the category of vector bundles over a base space, where the fiber functor sends each bundle to its base space—pullback of bundles provides the cartesian liftings.

Common Misconceptions

Explainer

From your study of comma categories and functor categories, you know how to form slice categories C/b and how to assemble categories of functors into structured wholes. Fibered categories answer a subtler organizational question: how do you talk about a *family* of categories varying over a base, where morphisms in the base tell you how to transport objects between fibers? The motivating example is geometric: over each topological space (or scheme) B, you have a category of vector bundles — small changes in the base space induce pullback operations on bundles, and those pullbacks are the "transport maps" the fibration formalizes.

Formally, a Grothendieck fibration is a functor p: E → B such that for every morphism f: b' → b in B and every object e in E with p(e) = b, there exists a cartesian morphism φ: e' → e in E with p(φ) = f, satisfying a universal lifting property. The universal property says: any morphism ψ: e'' → e in E with p(ψ) factoring through f in B factors uniquely through φ. Concretely, φ is the "best" way to lift f to E above the target e — it is canonical once the target and the base morphism are fixed. The object e' = f*(e) is the pullback of e along f, and this is exactly a pullback in the geometric sense when E is the category of vector bundles.

The fiber E_b over an object b ∈ B is the subcategory of E consisting of objects e with p(e) = b and morphisms φ with p(φ) = id_b. In the vector bundle example, E_b is the category of vector bundles on the single space b. A morphism f: b' → b in B induces a pullback functor f*: E_b → E_{b'}, defined (up to canonical isomorphism) by the cartesian liftings. This is where your comma-category intuition applies: the comma category b'/p in E records all ways to map into a fixed fiber. The codomain fibration cod: Arr(C) → C, sending each arrow g: A → B to its codomain B, has fiber (Arr(C))_b = C/b — precisely the slice category over b. The cartesian morphisms are exactly the pullback squares in C.

A cleavage is a choice, for each (f, e) pair, of a specific cartesian lifting φ_{f,e}. Different cleavages give equivalent total categories, but choosing one converts the fibration into a strict assignment b ↦ E_b and f ↦ f* that almost forms a pseudofunctor B^{op} → Cat — the composition f* ∘ g* need not equal (g ∘ f)* on the nose, only up to coherent isomorphism. A split fibration is one where the cleavage is strictly functorial: (g ∘ f)* = f* ∘ g* strictly. Most natural fibrations are not split, but every fibration is equivalent to a split one.

The deeper significance is the Grothendieck construction: there is an equivalence (more precisely, a 2-categorical equivalence) between fibrations p: E → B and pseudofunctors F: B^{op} → Cat. Given a fibration, you extract F by b ↦ E_b and f ↦ f*. Given a pseudofunctor, you build the total category E with objects (b, x) where x ∈ F(b), and morphisms (b', x') → (b, x) given by pairs (f: b' → b, α: x' → F(f)(x)). This is precisely why fibered categories are central to descent theory: a presheaf F: B^{op} → Set (or Cat) descends along a covering if and only if the corresponding fibration satisfies a gluing condition. Stacks are fibered categories over sites that satisfy the descent conditions, and the entire language of algebraic geometry over varying base schemes is organized through this formalism.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesLiteral EquationsSlope-Intercept FormPoint-Slope FormWriting Linear EquationsParallel and Perpendicular Line SlopesGraphing Linear EquationsPiecewise FunctionsStep FunctionsComposition of FunctionsCategories and MorphismsFunctorsNatural Transformations2-Categories and Weak FunctorsNatural Isomorphisms Between FunctorsIsomorphisms in CategoriesUniversal PropertiesInitial and Terminal ObjectsProducts and CoproductsEqualizers and CoequalizersLimits and ColimitsThe Yoneda LemmaAdjoint FunctorsFree ObjectsProjective Objects and Projective CoversHomological Dimension in CategoriesExact Sequences in CategoriesExt Functors as Derived HomTor Functors as Derived Tensor ProductDerived FunctorsDerived Categories and Derived EquivalencesLocalization of Categories2-CategoriesFibered Categories

Longest path: 80 steps · 388 total prerequisite topics

Prerequisites (4)

Leads To (1)