Theorems · Definition · category theory

CategoryTheory.Functor.IsFinitelyAccessible

{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 finitely accessible if it is ℵ₀-accessible. Equivalently, it preserves all filtered colimits. See CategoryTheory.Functor.IsFinitelyAccessible_iff_preservesFilteredColimits.

Defined in

Mathlib.CategoryTheory.Presentable.Finite

Cited by

2 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.Category