Theorems · Inductive type · category theory

CategoryTheory.RepresentablyCoflat

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    {D : Type u₂} → [inst_1 : CategoryTheory.Category.{v₂, u₂} D] → CategoryTheory.Functor C D → Prop

A functor F : C ⥤ D is representably coflat if the comma category (F/X) is filtered for each X : D.

Defined in

Mathlib.CategoryTheory.Functor.Flat

Cited by

9 results in Mathlib

Foundations

Depth 2 from the axioms · uses no axioms

Assumes

CategoryTheory.CategoryCategoryTheory.Category