Theorems · Definition · category theory

CategoryTheory.Functor.relativelyRepresentable.snd

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    {D : Type u₂} →
      [inst_1 : CategoryTheory.Category.{v₂, u₂} D] →
        {F : CategoryTheory.Functor C D} →
          {X Y : D} → {f : X ⟶ Y} → (hf : F.relativelyRepresentable f) → {a : C} → (g : F.obj a ⟶ Y) → hf.pullback g ⟶ a

Given a representable morphism f : X ⟶ Y, then for any g : F.obj a ⟶ Y, hf.snd g denotes the morphism in C giving rise to the following diagram `` hf.pullback g --F.map (hf.snd g)--> F.obj a | | fst g | | v v X -- f -> Y ``

Defined in

Mathlib.CategoryTheory.MorphismProperty.Representable

Cited by

34 results in Mathlib

Foundations

Depth 11 from the axioms · uses Classical.choice

Assumes

CategoryTheory.CategoryCategoryTheory.Category