41.02.03 · category-theory / limits-colimits

Limits — creation, preservation, completeness, and presentability

shipped3 tiersLean: none

Anchor (Master): Mac Lane 1998 Categories for the Working Mathematician 2e (Springer GTM 5) Ch. V §4-6 (creation and preservation, the adjoint functor theorems); Adámek-Rosický 1994 Locally Presentable and Accessible Categories (Cambridge LMS 189) Ch. 1-2 (presentable objects, locally presentable and accessible categories, the adjoint functor theorem for them); Gabriel-Ulmer 1971 Lokal präsentierbare Kategorien (Springer LNM 221)

Intuition Beginner

The earlier units in this chapter met limits as the best cone over a pattern: limits glue a compatible family of pieces into one object, and colimits patch a diagram of pieces together. This unit turns to three questions those definitions leave open. First, when a translation between categories hands a limit to a friendlier category, how much of the limit's structure survives the trip? Second, how large must a category be before it can hold all limits at once? Third, can every object be rebuilt from small, indivisible pieces?

The first question separates three behaviours of a translation: it may preserve a limit (the image of the best cone stays best), reflect one (if the image is best, the original already was), or create one (every limit downstairs lifts uniquely to a limit upstairs). Creation is the strongest: it lets us compute limits in whichever category is more convenient, knowing the computation is faithful.

The second question hides a surprise. A category that is small enough to be a set of objects can hold all small limits only if it is a preorder — at most one arrow between any two objects. Completeness is therefore a genuinely large-category phenomenon, and the categories of practice ( $Set$ , $Grp$ , $R - Mod$ ) earn it by being large.

The third question is the heart of presentability. Many categories are built so that every object is a gentle colimit — a filtered colimit, behaving like a growing union — of small presentable generators. This single property, isolated by Gabriel and Ulmer in 1971, organises algebra, topology, and logic into one framework and gives the cleanest form of the adjoint functor theorem.

Visual Beginner

Picture three lenses on the same category. Under the preservation lens, a limit cone is carried across a translation and stays a limit cone. Under the creation lens, a limit drawn downstairs lifts to a unique limit upstairs. Under the presentability lens, every object dissolves into a filtered union of small atoms.

lens	what it asks	picture
preservation	does the image of a best cone stay best?	a cone translated intact across a wall
creation	does a best cone downstairs lift uniquely upstairs?	a cone pulled back through a wall
completeness	can the category hold every limit?	only the large ones can
presentability	is every object a filtered union of atoms?	an object as a growing tower of generators

The bottom-right panel is the modern picture: the category is cocomplete, a small set of presentable atoms generates it, and every object is a filtered colimit of atoms. The rest of the unit makes that picture precise and proves it is the right setting for the adjoint functor theorem.

Worked example Beginner

Work in the category of sets. Take the three-element set $X = {a, b, c}$ . We rebuild $X$ as a filtered colimit of its smaller pieces, the move presentability theory repeats for every object of every presentable category.

Step 1. List the subsets of $X$ : $\emptyset, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}$ . There are $8$ of them. Order them by inclusion. Any two subsets share an upper bound, their union, so this poset is filtered.

Step 2. Send each subset to itself, viewed as a set, with the inclusion map whenever one subset sits inside another. This is a diagram of shape "the poset of subsets of $X$ " inside the category of sets, and the shape is filtered.

Step 3. The colimit is $X$ itself. The cocone leg from each subset $S$ is the inclusion $S ↪ X$ . Given any other cocone that sends each $S$ to a set $Y$ compatibly, the three elements $a, b, c$ are each sent to definite elements of $Y$ , and these three choices give the unique mediating map $X \to Y$ .

What this tells us: even a three-element set splits apart and reassembles as a filtered colimit of smaller pieces. The atoms that cannot be split further are the singletons, and they are the finitely presentable generators. Every set, finite or infinite, admits the same decomposition, and replacing "finite" by a larger size bound gives the $λ$ -presentable generators that organise algebra and geometry.

Check your understanding Beginner

Exercise (easy, multiple choice).

A locally $λ$ -presentable category is, by definition, cocomplete and equipped with what extra data?

A. A small set of $λ$ -presentable generators such that every object is a $λ$ -filtered colimit of them B. A finite set of objects closed under all limits C. A single generator that is both initial and terminal D. A small full subcategory that is a preorder

Hint

The defining property is cocompleteness plus a small generating set of presentable objects, with a filtered-colimit reconstruction of every object.

Answer

A. Local $λ$ -presentability is cocompleteness together with a small full subcategory of $λ$ -presentable objects that generates everything under $λ$ -filtered colimits. Feedback-correct: presentable generators plus filtered reconstruction. Feedback-wrong: options B and D impose closure or order conditions that are not the definition, and option C describes a degenerate category.

Formal definition Intermediate+

Throughout $λ$ denotes a regular cardinal (a cardinal closed under unions of $< λ$ -sized families; $ℵ_{0}$ is regular, as is every successor cardinal). A category $J$ is $λ$ -filtered if every subcategory of $J$ with $< λ$ objects admits a cocone in $J$ ; the case $λ = ℵ_{0}$ recovers the filtered categories of 41.02.02. A $λ$ -filtered colimit is a colimit over a $λ$ -filtered index.

Definition (preservation, reflection, creation — recap and refinement). Building on 41.02.02, let $U : C \to D$ and $F : J \to C$ . $U$ creates limits of $F$ if every limit cone over $U F$ in $D$ is the image of a cone over $F$ , and that cone is a limit, unique up to unique isomorphism of cones. Creation implies both preservation ( $U$ of a limit is a limit) and reflection (if $U$ of a cone is a limit, the cone was a limit). A functor preserving all small limits is continuous; one preserving all small colimits is cocontinuous; a continuous and cocontinuous functor is bicontinuous ^{[Mac Lane 1998]}.

Definition (complete and cocomplete; well-powered). $C$ is complete if every small diagram has a limit, cocomplete if every small diagram has a colimit. $C$ is well-powered if for each $X$ the class $Sub (X)$ of subobjects is a set, and co-well-powered dually. These size conditions enter the adjoint functor theorems of 41.03.02.

Definition ( $λ$ -presentable object). Let $C$ have $λ$ -filtered colimits. An object $X \in C$ is $λ$ -presentable if the representable $C (X, -) : C \to Set$ preserves $λ$ -filtered colimits: every map $X \to lim_{j} F (j)$ factors through some $F (j)$ , and two factorisations agree after precomposition with a map in the index. Equivalently, the canonical map $lim_{j} C (X, F (j)) \to C (X, lim_{j} F (j))$ is a bijection. The $ℵ_{0}$ -presentable objects are the finitely presentable objects of 41.02.02.

Definition (accessible and locally presentable categories). A category $C$ is $λ$ -accessible if it has $λ$ -filtered colimits and contains a small full subcategory $A$ of $λ$ -presentable objects such that every object of $C$ is a $λ$ -filtered colimit of objects of $A$ ; $A$ is a generator of $λ$ -presentable objects. $C$ is accessible if it is $λ$ -accessible for some $λ$ . $C$ is locally $λ$ -presentable if it is cocomplete and $λ$ -accessible; locally presentable if locally $λ$ -presentable for some $λ$ ^{[Gabriel-Ulmer 1971]}. Every locally presentable category is complete and cocomplete; locally presentable = accessible $+$ complete.

Definition (flat functor; category of elements). For a presheaf $F : C^{op} \to Set$ with $C$ small, the category of elements $\int_{C} F$ (written $\int F$ ) has objects $(c, x)$ with $c \in C$ , $x \in F (c)$ , and morphisms $(c, x) \to (c^{'}, x^{'})$ those $u : c \to c^{'}$ in $C$ with $F (u) (x^{'}) = x$ . $F$ is flat if $\int F$ is filtered. Flatness is the categorical form of the algebraists' flatness: a module $M$ is flat over $R$ precisely when the presheaf $M \otimes_{R} -$ (suitably presented) is flat, the link made rigorous by Lazard's theorem below.

Counterexamples to common slips Intermediate+

Completeness costs size. A small category cannot be complete without collapsing to a preorder (Freyd, Proposition 1). So the small full subcategory of finitely generated groups is not complete, and "complete" is a hypothesis one checks in a large ambient category. Locally presentable categories are large by necessity.
Creation is strictly stronger than preservation. The forgetful functor $Grp \to Set$ creates limits, but the forgetful functor from the category of fields to $Set$ preserves neither products nor equalisers (fields have neither), showing preservation is a genuine property rather than automatic.
Presentability is relative to $λ$ . In $Set$ an object is $λ$ -presentable precisely when it has $< λ$ elements (Proposition 2), so a countably infinite set is $ℵ_{1}$ -presentable but not finitely presentable. Choosing $λ$ is choosing the granularity at which "small" is measured.
Reflection without creation. A full reflective subcategory $D ↪ C$ of a complete category inherits limits computed in $C$ (the inclusion, being a right adjoint, preserves them, and being fully faithful reflects them), but the inclusion need not create colimits: abelian groups form a reflective subcategory of groups under abelianisation, yet the coproduct of abelian groups is not the coproduct of groups.

Key theorem with proof Intermediate+

The signature result is the Yoneda-density characterisation of flat presheaves: a presheaf is flat exactly when it is a filtered colimit of representables. The proof is the Yoneda lemma of 41.04.01 deployed on the category of elements.

Theorem (flat presheaves are filtered colimits of representables). Let $C$ be small and $F : C^{op} \to Set$ a presheaf. The following are equivalent.

(i) $F$ is flat, i.e. the category of elements $\int F$ is filtered. (ii) $F$ is a filtered colimit of representable presheaves in $[C^{op}, Set]$ ^{[Adámek-Rosický 1994]}.

Proof. The argument is the Yoneda density theorem combined with pointwise computation of colimits in presheaf categories. Let $π : \int F \to C^{op}$ send $(c, x) \mapsto c$ and let $y : C^{op} \to [C^{op}, Set]$ be the Yoneda embedding, $y (c) = C (-, c)$ .

For each $(c, x)$ , Yoneda identifies $x \in F (c)$ with a natural transformation $τ^{(c, x)} : y (c) \Rightarrow F$ whose $d$ -component sends $u : d \to c$ to $F (u) (x) \in F (d)$ . If $u : (c, x) \to (c^{'}, x^{'})$ is a morphism of $\int F$ , meaning $u : c \to c^{'}$ satisfies $F (u) (x^{'}) = x$ , then $τ^{(c, x)} = τ^{(c^{'}, x^{'})} \circ y (u)$ by direct inspection of components, so the family $(τ^{(c, x)})_{(c, x) \in \int F}$ is a cocone under $y \circ π$ with nadir $F$ .

For universality, let $(σ^{(c, x)} : y (c) \Rightarrow G)_{(c, x)}$ be any cocone under $y \circ π$ with nadir $G$ . Define $φ : F \Rightarrow G$ by $φ_{c} (x) = σ_{c}^{(c, x)} (id_{c}) \in G (c)$ . Cocone compatibility of $σ$ gives $φ \circ τ^{(c, x)} = σ^{(c, x)}$ for every $(c, x)$ : evaluating at $d$ and $u : d \to c$ ,

(φ_{d} \circ τ_{d}^{(c, x)}) (u) = φ_{d} (F (u) (x)) = σ_{d}^{(d, F (u) (x))} (id_{d}) = σ_{d}^{(c, x)} (y (c) (u) (id_{c})) = σ_{d}^{(c, x)} (u),

using that $(c, x) \to (d, F (u) (x))$ is the $\int F$ -morphism witnessing cocone compatibility in the reverse direction, and the last step is the definition of a natural transformation $y (c) \Rightarrow G$ at $u$ . Uniqueness is forced: every element of $F (c)$ is some $x$ , and compatibility pins down $φ_{c} (x)$ . Hence $F ≅ lim_{(c, x) \in \int F} y (c)$ , the density colimit.

Colimits in $[C^{op}, Set]$ are computed pointwise in $Set$ , so the colimit above is filtered exactly when its indexing category $\int F$ is filtered. By definition that is flatness of $F$ , so (i) and (ii) coincide. $□$

Bridge. This density argument builds toward Lazard's theorem — flat modules are precisely filtered colimits of free modules — and appears again in 41.04.01, where the Yoneda embedding is shown to be dense and every presheaf reconstructed from representables, and in 41.05.02, where Lawvere theories identify a category of algebras with finite-product-preserving functors on an opposite category. The foundational reason flatness, filteredness, and being-a-filtered-colimit-of-representables coincide is that a presheaf is entirely determined by its elements across all stages, and Yoneda makes that determination functorial; this is exactly the mechanism by which a locally presentable category is reconstructed from its presentable generators. The construction is dual to the pro-object completion $Pro (C)$ that adjoins cofiltered limits. Putting these together, the bridge is that "every object is a gentle colimit of small pieces" is a single statement whether read in presheaves, modules, or models of a limit sketch.

Exercises Intermediate+

Exercise 4 (medium, symbolic).

Let $D i C$ be a full reflective subcategory: $i$ is fully faithful and has a left adjoint (the reflector) $r ⊣ i$ . Show that $i$ creates all limits that exist in $C$ , and conclude that a reflective subcategory of a complete category is complete.

Hint

A right adjoint preserves limits; a fully faithful functor reflects them.

Answer

Let $F : J \to D$ be small with $C$ complete, and let $(L, π)$ be the limit cone of $i F$ in $C$ . Since $i$ is a right adjoint ( $r ⊣ i$ ), $i$ preserves limits, so the limit of $F$ in $D$ , if it exists, has underlying $C$ -object $L$ . Because $i$ is fully faithful, the cone $(L, π)$ lies in the essential image of $i$ : each $π_{j} : L \to i F (j)$ is $i$ of a unique $D$ -morphism $\tilde{π}_{j} : \tilde{L} \to F (j)$ , and full faithfulness transports $L$ to an object $\tilde{L} \in D$ with $i \tilde{L} = L$ . The lifted cone $(\tilde{L}, \tilde{π})$ is then a limit of $F$ : any competing cone in $D$ maps under $i$ to a cone over $i F$ , hence factors uniquely through $(L, π)$ , and full faithfulness pulls the factorisation back to a unique factorisation through $(\tilde{L}, \tilde{π})$ . Thus $i$ creates limits, so $D$ is complete whenever $C$ is.

Exercise 5 (medium, symbolic).

Prove that the $λ$ -presentable objects in $Set$ are exactly the sets of cardinality $< λ$ .

Hint

For ( $\Rightarrow$ ), write $X$ as the $λ$ -filtered colimit of its $< λ$ -sized subsets and use that $id_{X}$ factors through one stage.

Answer

( $\Leftarrow$ ) If $∣ X ∣ < λ$ and $f : X \to lim_{j} F (j)$ is a map into a $λ$ -filtered colimit of sets, each of the $< λ$ elements of $X$ is represented in some $F (j_{x})$ ; $λ$ -filteredness merges the $< λ$ indices $j_{x}$ into a single $ℓ$ , so $f$ factors through $F (ℓ)$ . Two factorisations $f_{1}, f_{2}$ through some $F (ℓ)$ agree in the colimit iff each of the $< λ$ element-wise equalities is witnessed by a later map, and $λ$ -filteredness merges these witnesses into one. Hence $Set (X, -)$ preserves $λ$ -filtered colimits. ( $\Rightarrow$ ) If $X$ is $λ$ -presentable, write $X = lim_{S \subseteq X, ∣ S ∣ < λ} S$ as the $λ$ -filtered colimit of its $< λ$ -sized subsets along inclusions. The identity $id_{X}$ factors through some such $S_{0}$ , so $X$ is a retract of $S_{0}$ through the inclusion $S_{0} ↪ X$ ; since $∣ S_{0} ∣ < λ$ and the inclusion is monic, $∣ X ∣ \leq ∣ S_{0} ∣ < λ$ . $□$

Exercise 7 (medium, symbolic).

Show that the finitely presentable abelian groups (as objects of $Ab$ ) are exactly the finitely presented $Z$ -modules: groups admitting a presentation $Z^{m} ↠ M$ with finitely generated kernel.

Hint

A homomorphism out of $M$ into a filtered colimit factors through a stage iff both the generators and the relations are detected at a common stage.

Answer

Suppose $M$ has a finite presentation $Z^{m} \to M \to 0$ with kernel $K \leq Z^{m}$ finitely generated. For a filtered system $(N_{j})$ and a map $f : M \to lim N_{j}$ , lift $f$ to $Z^{m}$ : the $m$ generator images each live in some $N_{j}$ , and filteredness merges the indices so $f$ is represented by $\tilde{f} : Z^{m} \to N_{ℓ}$ for some $ℓ$ . The finitely many relations in $K$ each vanish in the colimit, witnessed at later stages; filteredness merges these witnesses into one stage at which $\tilde{f}$ descends to $\overset{ˉ}{f} : M \to N_{ℓ^{'}}$ . Uniqueness up to a further stage is identical. Conversely, if $M$ is finitely presentable as an object, write $M = lim_{M ↠ Q, Q f.p.} Q$ over its finitely presented quotients (a filtered system); the identity on $M$ factors through some $Q_{0}$ , exhibiting $M$ as a retract of a finitely presented module, hence finitely presented. $□$

Exercise 8 (hard, symbolic).

Prove Freyd's theorem: a small category with all small products is a preorder (at most one morphism between any two objects).

Hint

Suppose two distinct maps $a \to b$ exist, let $μ$ be the cardinality of the set of all morphisms, and compare $∣ Hom (a, b^{μ}) ∣$ with $μ$ using Cantor.

Answer

Suppose for contradiction that some hom-set $Hom (a, b)$ has cardinality $κ \geq 2$ . Let $μ = ∣ Mor (C) ∣$ be the cardinality of the set of all morphisms (finite because $C$ is small). Since $C$ has all small products, the product $b^{μ}$ of $μ$ copies of $b$ exists and is an object of $C$ . The universal property of the product gives a bijection $Hom (a, b^{μ}) ≅ Hom (a, b)^{μ} = κ^{μ}$ . Because $κ \geq 2$ , Cantor's theorem gives $κ^{μ} \geq 2^{μ} > μ$ . But $Hom (a, b^{μ})$ is a hom-set of $C$ , so $∣ Hom (a, b^{μ}) ∣ \leq μ$ . Combining, $μ < 2^{μ} \leq κ^{μ} \leq μ$ , a contradiction. Hence no hom-set has two distinct elements, and $C$ is a preorder. $□$

Exercise 9 (hard, symbolic).

Let $C, D$ be locally presentable and $F : C \to D$ . Using the accessible adjoint functor theorem, show that $F$ has a right adjoint if and only if $F$ preserves small colimits.

Hint

( $\Rightarrow$ ) is 41.03.02. For ( $\Leftarrow$ ), note that preserving small colimits makes $F$ accessible, then apply the accessible AFT to $F^{op}$ .

Answer

( $\Rightarrow$ ) A left adjoint preserves all small colimits (41.03.02). ( $\Leftarrow$ ) Suppose $F$ preserves small colimits. Pick $λ$ so that $C$ and $D$ are locally $λ$ -presentable; then $F$ preserves $λ$ -filtered colimits in particular, so $F$ is $λ$ -accessible. The accessible adjoint functor theorem (Adámek-Rosický 2.19) states that an accessible functor $G : A \to B$ from a locally presentable category that preserves limits has a left adjoint. Apply it to $F^{op} : C^{op} \to D^{op}$ : $C^{op}$ is locally presentable only in special cases, so instead apply the dual form directly — a colimit-preserving accessible functor out of a locally presentable category has a right adjoint. Since $F$ is accessible and preserves small colimits, the dual accessible AFT supplies a right adjoint $G ⊣$ ... a right adjoint $G$ with $F ⊣ G$ . Concretely, define $G (d)$ as the limit of the large diagram of all $c$ with a map $F c \to d$ , made small by accessibility and presentability; the solution-set condition is automatic because the $λ$ -presentable $c$ suffice. $□$

Advanced results Master

Theorem (Freyd: small complete categories are preorders). A small category with all small products is a preorder. Consequently a complete small category is a preorder, and completeness is a genuinely large-category phenomenon: the categories of practice ( $Set$ , $Grp$ , $R - Mod$ , schemes) earn completeness by being large. The full proof is Proposition 1 ^{[Freyd 1964]}.

Theorem (Gabriel-Ulmer characterisations of locally presentable categories). For a category $C$ and a regular cardinal $λ$ , the following are equivalent ^{[Gabriel-Ulmer 1971]}.

(i) $C$ is locally $λ$ -presentable. (ii) $C$ is cocomplete and accessible. (iii) $C$ is equivalent to $Lex_{λ} (A^{op}, Set)$ , the category of set-valued functors on a small category $A$ that preserve $λ$ -small limits. (iv) $C$ is a full reflective subcategory of a presheaf category $[A, Set]$ with a reflector preserving $λ$ -filtered colimits. (v) $C$ is the category of models of a small limit sketch.

Equivalence (v) is the bridge to logic: locally presentable categories are exactly the categories of models of essentially algebraic theories. Varieties of algebras ( $Grp$ , $R - Mod$ , lattices) are locally finitely presentable; the category of compact Hausdorff spaces is locally $ℵ_{1}$ -presentable; presheaf categories are locally finitely presentable.

Theorem (adjoint functor theorem for locally presentable categories). Let $C, D$ be locally presentable.

A functor $F : C \to D$ has a right adjoint iff $F$ preserves small colimits.
A functor $G : C \to D$ has a left adjoint iff $G$ preserves small limits and is accessible (preserves $λ$ -filtered colimits for some $λ$ ) ^{[Adámek-Rosický 1994]}.

This is the cleanest form of the adjoint functor theorem, and it is reconstructed from limit-preservation: the solution-set condition of 41.03.02 is automatic, because every object of $C$ is a $λ$ -filtered colimit of $λ$ -presentable generators, so the $λ$ -presentable objects form a canonical solution set. Exercise 9 develops the proof.

Theorem (Lazard: flat modules are filtered colimits of free modules). For a commutative ring $R$ and an $R$ -module $M$ , the following are equivalent ^{[Lazard 1964]}.

(i) $M$ is flat: $- \otimes_{R} M$ preserves exact sequences (equivalently finite limits in $R - Mod$ ). (ii) $M$ is a filtered colimit of finitely generated free $R$ -modules $R^{n}$ . (iii) The functor $M \otimes_{R} -$ is flat in the categorical sense (category of elements filtered).

Lazard's theorem is the algebraic shadow of the density theorem: a flat module is precisely a filtered colimit of the free modules, which are the finitely presentable projective generators of $R - Mod$ . It underlies the homological algebra of 01.06.01, where flat resolutions compute $Tor$ and the exactness of filtered colimits is Grothendieck's axiom AB5.

Theorem (monadic functors create limits). If $U : A \to S$ is monadic (the comparison $A \to S^{T}$ to the Eilenberg-Moore category of the induced monad is an equivalence), then $U$ creates all small limits that exist in $S$ . Dually, comonadic functors create colimits. The proof is that limits in $S^{T}$ are computed on underlying objects with algebra structure defined componentwise, because the monad operations are algebraic equations and limits preserve equations; full development in 41.05.02. This is why limits of groups, rings, and modules are computed on underlying sets: the forgetful functors are monadic.

Synthesis. Putting these together, presentability is the structural refinement under which the adjoint functor theorem collapses to a clean equivalence and Lazard's theorem recovers algebraic flatness from categorical flatness. The foundational reason is that a locally presentable category is freely generated under gentle colimits by a small set of atoms, so every object, every functor value, and every solution set is controlled by those atoms — this is exactly why the solution-set condition becomes automatic and why limit-preservation alone detects adjoints. The central insight generalises the products-and-equalizers reduction of 41.02.02: just as completeness reduces to two stock shapes, presentability reduces to a small generating set plus filtered colimits, and the same calculus governs both. The construction is dual to the accessible-category theory of ind- and pro-completions $Ind (C)$ , $Pro (C)$ . This is exactly the framework on which the Beck monadicity theorem of 41.05.02, the derived adjunctions of 01.06.01, and the model-category foundations of modern homotopy theory all rest: locally presentable categories are the natural ambient setting for any homological or homotopical construction, and the adjoint functor theorem for them is the bridge between a limit-preservation hypothesis and an adjunction conclusion.

Full proof set Master

Proposition 1 (Freyd: small complete $\Rightarrow$ preorder). A small category with all small products is a preorder.

Proof. Suppose for contradiction that some hom-set $Hom (a, b)$ has cardinality $κ \geq 2$ . Let $μ = ∣ Mor (C) ∣$ , a cardinal since $C$ is small. The product $b^{μ}$ of $μ$ copies of $b$ exists in $C$ and is an object of $C$ . The universal property of the product yields a bijection

Hom (a, b^{μ}) ≅ μ \prod Hom (a, b) = κ^{μ} .

Since $κ \geq 2$ , Cantor gives $2^{μ} \leq κ^{μ}$ and $2^{μ} > μ$ , hence $κ^{μ} > μ$ . But $Hom (a, b^{μ})$ is a hom-set of $C$ , so its cardinality is at most the total number of morphisms $μ$ . Thus $μ < κ^{μ} \leq μ$ , a contradiction. No hom-set has two distinct elements, so $C$ is a preorder. The dual argument with coproducts shows a small category with all small coproducts is a preorder. $□$

Proposition 2 ( $λ$ -presentable objects in $Set$ ). In $Set$ , the $λ$ -presentable objects are exactly the sets of cardinality $< λ$ .

Proof. ( $\Leftarrow$ ) Let $∣ X ∣ < λ$ and let $F : J \to Set$ be a $λ$ -filtered diagram with colimit $lim F$ , computed as $⨆_{j} F (j)$ modulo the usual identifications. A map $f : X \to lim F$ sends each of the $< λ$ elements of $X$ to a class represented in some $F (j_{x})$ ; $λ$ -filteredness merges the $< λ$ indices ${j_{x}}$ into a single $ℓ$ , giving a factorisation $X \to F (ℓ) \to lim F$ . If $f_{1}, f_{2} : X \to F (ℓ)$ become equal in the colimit, each of the $< λ$ element-wise equalities is witnessed by a map out of $ℓ$ ; $λ$ -filteredness merges these witnesses into one $ℓ \to ℓ^{'}$ coequalising both. So $Set (X, -)$ preserves $λ$ -filtered colimits.

( $\Rightarrow$ ) Suppose $X$ is $λ$ -presentable. The poset of subsets of $X$ of cardinality $< λ$ is $λ$ -filtered (the union of $< λ$ subsets of size $< λ$ again has size $< λ$ ), and $X = lim_{S \subseteq X, ∣ S ∣ < λ} S$ along inclusions. The identity $id_{X}$ factors through some $S_{0}$ , so $X$ is a retract of $S_{0}$ across the inclusion $S_{0} ↪ X$ . Since $S_{0} ↪ X$ is monic, $∣ X ∣ \leq ∣ S_{0} ∣ < λ$ . $□$

Proposition 3 (adjoint functor theorem for locally presentable categories). Let $C, D$ be locally presentable and $F : C \to D$ . Then $F$ has a right adjoint if and only if $F$ preserves small colimits.

Proof. Necessity is 41.03.02: left adjoints preserve colimits. For sufficiency, assume $F$ preserves small colimits. Choose a regular cardinal $λ$ so that $C$ is locally $λ$ -presentable with generators $A \subseteq C$ . Then $F$ preserves $λ$ -filtered colimits (they are small colimits), so $F$ is $λ$ -accessible. To build a right adjoint $G : D \to C$ , fix $d \in D$ and consider the comma category $F ↓ d$ of pairs $(c, F c \to d)$ . We seek an initial object. Because every $c \in C$ is a $λ$ -filtered colimit $c = lim_{a \in A / c} a$ of generators, and $F$ preserves such colimits, any map $F c \to d$ factors through some $F a \to d$ with $a \in A$ up to refinement. Thus the full subcategory of $F ↓ d$ on the $λ$ -presentable $a \in A$ is cofinal: it is essentially small ( $A$ is small) and cofiltering (because $A$ has $λ$ -small colimits and $F$ preserves them, kernel pairs of competing factorisations are detected on presentable objects). Form the limit

G (d) = (a, F a \to d) \in (F ↓ d)_{pres} lim a

in the complete category $C$ ; the indexing category is essentially small, so the limit exists. The universal property of this limit realises $C (c, G (d)) ≅ D (F c, d)$ naturally in $c$ and $d$ , exhibiting $F ⊣ G$ . The solution-set condition is replaced by presentability, which supplies the canonical small cofinal subcategory. $□$

Proposition 4 (monadic functors create limits). If $U : A \to S$ is monadic, then $U$ creates all small limits existing in $S$ .

Proof. By monadicity, $A ≃ S^{T}$ for the induced monad $T = (T, η, μ)$ , so it suffices to show the forgetful functor $U^{T} : S^{T} \to S$ creates limits. Let $((X_{i}, a_{i}))_{i \in I}$ be a small diagram of $T$ -algebras, and let $(L, (π_{i}))$ be the limit of the underlying diagram $(X_{i})$ in $S$ (assumed to exist). We lift the algebra structure. Because $T$ , as the composite $U^{T} \circ F^{T}$ of the free-forgetful adjunction on $S^{T}$ , is itself a right adjoint when $S$ is complete in the appropriate sense — more directly, because the algebra axioms are equations — the cone $(T π_{i} : T L \to T X_{i})$ together with the structure maps $a_{i} : T X_{i} \to X_{i}$ induces a unique $T$ -algebra structure $a : T L \to L$ making each $π_{i}$ a homomorphism:

T L T π_{i} ↓ T X_{i} a a_{i} L ↓ π_{i} X_{i}

The unit axiom $a \circ η_{L} = id_{L}$ and the multiplication axiom $a \circ μ_{L} = a \circ T a$ hold because they hold componentwise after each $π_{i}$ , which jointly detect equality into the limit $L$ . The lifted cone $((L, a), (π_{i}))$ is a limit in $S^{T}$ : any cone of algebras maps under $U^{T}$ to a cone in $S$ , hence factors uniquely through $(L, (π_{i}))$ , and the factorisation is an algebra homomorphism because the $π_{i}$ detect the algebra operations. Uniqueness of the lift follows from faithfulness of $U^{T}$ . So $U^{T}$ creates limits, hence so does the monadic $U$ . $□$

Connections Master

Limits as universal cones 41.02.01. That unit owns the definition of the universal cone, the standard finite shapes (products, equalizers, pullbacks), and uniqueness up to unique isomorphism. The present unit takes those definitions as given and asks the structural questions they raise — creation versus preservation, the size cost of completeness, and the presentable-generator decomposition — without restating the cone calculus.
Construction, preservation, and filtered colimits 41.02.02. The products-and-equalizers reduction, the preservation/reflection/creation trichotomy, finitely presentable objects, and filtered-colimit commutation with finite limits are all developed there. This unit generalises the finite case to a regular cardinal $λ$ , packages the resulting $λ$ -presentable generators into locally presentable categories, and reconstructs the adjoint functor theorem from limit-preservation, complementing rather than duplicating that treatment.
Adjunctions and the adjoint functor theorems 41.03.02, 41.03.03. The General and Special Adjoint Functor Theorems with the solution-set condition are proved in 41.03.02 and the unit-counit reconstruction given in 41.03.03. The present unit supplies the locally-presentable refinement (Proposition 3 and Exercise 9), in which the solution-set condition is automatic because presentable generators form a canonical solution set — the cleanest modern form of the theorem.
Representables and the Yoneda lemma 41.04.01. The Key theorem deploys the Yoneda density theorem: every presheaf is a colimit of representables indexed by its category of elements, and that colimit is filtered exactly when the presheaf is flat. This is the Yoneda lemma of 41.04.01 read on the category of elements, and it is the engine of every presentability result in the unit.
Monads, monadicity, and Lawvere theories 41.05.02. Proposition 4 shows monadic functors create limits, and the Gabriel-Ulmer characterisation identifies locally presentable categories with models of limit sketches — the categorified counterpart of Lawvere theories treated in 41.05.02. Varieties of algebras sit at the intersection: monadic over $Set$ and locally finitely presentable.
Homological algebra and flat modules 01.06.01. Lazard's theorem identifies flat modules with filtered colimits of free modules, supplying the categorical underpinning for flat resolutions, the exactness of filtered colimits (Grothendieck's axiom AB5), and the derived $Tor$ functors of 01.06.01. The homological algebra corpus supplies the running module-theoretic examples; this unit supplies their universal-property backbone.

Historical & philosophical context Master

The theory of locally presentable categories was created by Peter Gabriel and Friedrich Ulmer in Lokal präsentierbare Kategorien (1971) ^{[Gabriel-Ulmer 1971]}, where finitely presentable generators, $λ$ -presentability for a regular cardinal, and the equivalence between such categories and categories of models of limit sketches were established. The framework was extended to accessible categories by Michael Makkai and Robert Paré in 1989 ^{[Makkai-Paré 1989]}, and given its standard textbook form by Jiří Adámek and Jiří Rosický in Locally Presentable and Accessible Categories (1994) ^{[Adámek-Rosický 1994]}, from which the adjoint functor theorem for locally presentable categories (Proposition 3) and the clean equivalence between flatness and filtered-colimit-of-representables take their modern shape.

The algebraic seed is Daniel Lazard's 1964 theorem ^{[Lazard 1964]} that a module is flat precisely when it is a filtered colimit of free modules, a result that gave categorical flatness its first and most consequential instance. Peter Freyd's theorem that a small complete category is a preorder appears as an exercise in Abelian Categories (1964) ^{[Freyd 1964]} alongside the adjoint functor theorem with the solution-set condition; it is the size-theoretic obstruction that forces presentability to live in large categories. Saunders Mac Lane's Categories for the Working Mathematician (1971; 2nd ed. 1998) ^{[Mac Lane 1998]} fixed the standard treatment of creation and preservation of limits (Chapter V §4-6) that the present unit refines. Philosophically, the Gabriel-Ulmer-Adámek-Rosický synthesis closes a circle opened by Kan's 1958 adjoint functors: existence of adjoints, completeness, and presentability are three faces of one condition, and the right setting for all three is the locally presentable category.

Bibliography Master

@book{AdamekRosicky1994lpac,
  author    = {Ad\'amek, Ji\v{r}\'i and Rosick\'y, Ji\v{r}\'i},
  title     = {Locally Presentable and Accessible Categories},
  publisher = {Cambridge University Press},
  series    = {London Mathematical Society Lecture Note Series 189},
  year      = {1994}
}

@incollection{GabrielUlmer1971lpac,
  author    = {Gabriel, Peter and Ulmer, Friedrich},
  title     = {Lokal pr\"asentierbare Kategorien},
  publisher = {Springer},
  series    = {Lecture Notes in Mathematics 221},
  year      = {1971}
}

@book{MacLane1998lpac,
  author    = {Mac Lane, Saunders},
  title     = {Categories for the Working Mathematician},
  edition   = {2},
  publisher = {Springer},
  series    = {Graduate Texts in Mathematics 5},
  year      = {1998}
}

@article{Lazard1964,
  author  = {Lazard, Daniel},
  title   = {Sur les modules plats},
  journal = {Bulletin de la Soci\'et\'e Math\'ematique de France},
  volume  = {97},
  year    = {1969},
  pages   = {1--14}
}

@book{Freyd1964lpac,
  author    = {Freyd, Peter},
  title     = {Abelian Categories: An Introduction to the Theory of Functors},
  publisher = {Harper and Row},
  year      = {1964}
}

@book{Riehl2016lpac,
  author    = {Riehl, Emily},
  title     = {Category Theory in Context},
  publisher = {Dover},
  year      = {2016}
}

@book{MakkaiPare1989lpac,
  author    = {Makkai, Michael and Par\'e, Robert},
  title     = {Accessible Categories: The Foundations of the Categorical Model Theory},
  publisher = {American Mathematical Society},
  series    = {Contemporary Mathematics 104},
  year      = {1989}
}

@book{AdamekRosickyVitale2011,
  author    = {Ad\'amek, Ji\v{r}\'i and Rosick\'y, Ji\v{r}\'i and Vitale, Enrico M.},
  title     = {Algebraic Theories: A Categorical Introduction to General Algebra},
  publisher = {Cambridge University Press},
  series    = {Cambridge Tracts in Mathematics 184},
  year      = {2011}
}

Prerequisites

41.02.01
41.04.01

Tier anchors

beginner: Riehl 2016 Category Theory in Context (Dover) §3.4-3.5 (limits glue compatible families, colimits patch diagrams together, completeness as a global property); Spivak 2014 Category Theory for the Sciences (MIT Press) §6.2-6.3 (filtered unions and the intuition that every object is assembled from finite pieces)
intermediate: Riehl 2016 Category Theory in Context (Dover) §3.5-3.8 and §4.5-4.6 (preservation and creation of limits, the adjoint functor theorems rebuilt from limit-preservation); Awodey 2010 Category Theory 2e (Oxford) Ch. 5 §5.6-5.8 and Ch. 9 §9.4-9.5
master: Mac Lane 1998 Categories for the Working Mathematician 2e (Springer GTM 5) Ch. V §4-6 (creation and preservation, the adjoint functor theorems); Adámek-Rosický 1994 Locally Presentable and Accessible Categories (Cambridge LMS 189) Ch. 1-2 (presentable objects, locally presentable and accessible categories, the adjoint functor theorem for them); Gabriel-Ulmer 1971 Lokal präsentierbare Kategorien (Springer LNM 221)

References

Adámek-Rosický — Locally Presentable and Accessible Categories · Cambridge LMS 189, 1994, Ch. 1 (presentable objects, filtered colimits), Ch. 2 (locally presentable categories, the adjoint functor theorem for them), Ch. 3 (accessible categories)
Mac Lane — Categories for the Working Mathematician · 2nd ed., Springer GTM 5, 1998, Ch. V §4-6 (creation and preservation of limits, the adjoint functor theorems)
Gabriel-Ulmer — Lokal präsentierbare Kategorien · Springer LNM 221, 1971 (locally presentable categories, finitely presentable generators, the duality with limit sketches)
Lazard — Sur les modules plats · Bull. de la Société Mathématique de France, Mém. 97 (1969), pp. 1-14; first announced C. R. Acad. Sci. Paris 248 (1959), pp. 3312-3313
Freyd — Abelian Categories · Harper and Row 1964, Ch. 3, Exercise D (a small complete category is a preorder) and the adjoint functor theorem with the solution-set condition
Riehl — Category Theory in Context · Dover 2016, §3.5-3.8 (preservation, creation, filtered colimits revisited), §4.5-4.6 (the adjoint functor theorems)
Makkai-Paré — Accessible Categories · AMS Contemporary Mathematics 104, 1989 (accessible categories, the accessible adjoint functor theorem)

Estimated time

beginner: 20m
intermediate: 52m
master: 95m