Theorems · Definition · category theory

CategoryTheory.Limits.natTransIntoForgetCompFiberwiseColimit

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    {F : CategoryTheory.Functor C CategoryTheory.Cat} →
      {H : Type u₂} →
        [inst_1 : CategoryTheory.Category.{v₂, u₂} H] →
          (G : CategoryTheory.Functor (CategoryTheory.Grothendieck F) H) →
            [inst_2 :
                ∀ {X Y : C} (f : X ⟶ Y),
                  CategoryTheory.Limits.HasColimit
                    ((F.map f).toFunctor.comp ((CategoryTheory.Grothendieck.ι F Y).comp G))] →
              G ⟶ (CategoryTheory.Grothendieck.forget F).comp (CategoryTheory.Limits.fiberwiseColimit G)

Every functor G : Grothendieck F ⥤ H induces a natural transformation from G to the composition of the forgetful functor on Grothendieck F with the fiberwise colimit on G.

Defined in

Mathlib.CategoryTheory.Limits.Shapes.Grothendieck

Cited by

1 results in Mathlib

Foundations

Depth 49 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Limits.HasColimit