Accessible category¶

A category that, for some regular cardinal λ, has λ-filtered colimits and a set of λ-presentable objects from which every object is obtainable as a λ-filtered colimit, making its large object class controllable by bounded presentability data.

Version: v1 · 2026-09-28 · History
Domain-specific #: 7844
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Category Theory → Mathematics

Core Idea¶

An accessible category is a category for which some regular cardinal λ makes λ-filtered colimits available and supplies a set of λ-presentable objects from which every object can be reconstructed as a λ-filtered colimit. An object is λ-presentable when its hom functor preserves λ-filtered colimits. An object is λ-presentable when its hom functor preserves λ-filtered colimits.

How would you explain it like I'm…

Huge Box, Small Starter Kit

Picture a toy box so enormous you could never count everything in it. But there's a small starter box of little pieces, and every toy in the enormous box can be made by growing it bit by bit, in a steady orderly way, from those starter pieces. A collection like that, huge but built from a small starter box, is what mathematicians call an accessible category.

Huge but Buildable

In a branch of math called category theory, a category is a huge collection of objects with arrows between them. An accessible category is one where, even though there may be too many objects to list, there is a fixed list of 'small' objects, and every object can be built as a steadily growing combination of those small ones. The allowed way of building is special: it's like adding pieces to a pile that keeps growing in an orderly way, not gluing things together however you like. This lets mathematicians handle huge collections using a manageable set of small building blocks.

Generated by Small Objects

An accessible category is a large category, one whose objects don't form a set, that can nonetheless be generated from a set of 'small' objects. The key tool is the filtered colimit, a way of assembling an object as the combination of a directed, growing system of pieces, like building a set as the union of its finite subsets. A category is λ-accessible, for a regular cardinal λ, if it has λ-filtered colimits and a set of λ-presentable objects from which every object is a λ-filtered colimit. The cardinal λ controls how big 'small' is. Accessibility is weaker than local presentability, because an accessible category doesn't have to have all small colimits.

An accessible category is a large category whose objects are nonetheless generated, via filtered colimits, from a set of boundedly presentable objects. Precisely, a category is lambda-accessible for a regular cardinal lambda when it has lambda-filtered colimits and there is a set of lambda-presentable objects such that every object is a lambda-filtered colimit of objects from that set. An object is lambda-presentable when its hom functor preserves lambda-filtered colimits; lambda thus bounds how many pieces and morphisms must be handled at once, and a category accessible at one cardinal is often accessible at many larger regular cardinals by further results. The notion is weaker than local presentability, since arbitrary small colimits need not exist. It provides size control while supporting categories of structures and models, accessible functors, adjoint-functor theorems and homotopical constructions. Rigorous use requires tracking universes, regular cardinals, closure properties, and checking that the claimed generators really form a set and really reconstruct every object.

Scope of Application¶

Accessible categories are used in category theory, model theory, universal algebra, homotopy theory, higher category theory, combinatorial model categories, logic, and adjoint-functor analysis. Use it with universe/set conventions, category/morphisms, regular λ and λ-filtered definition, proof of required colimits, candidate λ-presentable objects and hom-functor preservation, a set/essentially small representative collection, explicit filtered-colimit representation of every object, closure and rank results, accessible functors if relevant, and theorem hypotheses. Distinguish it from small, cocomplete, finitely accessible, and locally presentable categories and from ordinary-language accessibility.

Model theory. Treats categories of structures.
Size control. Reconstructs large objects from a set.
Functor theory. Defines accessible functors.
Homotopy. Supports presentable/combinatorial settings.
Adjoints. Supplies solution-set style hypotheses.

Clarity¶

Report foundational universe/set conventions, category and morphisms, regular cardinal λ, definition of λ-filtered, existence/construction of those colimits, candidate presentable subcategory and proof each hom preserves them, essential smallness/set of representatives, representation of every object as λ-filtered colimit, replete/closure details, accessibility rank claims, functor preservation if relevant, distinction from finitely accessible and locally presentable, and theorem hypotheses used. The closest near miss sets the boundary: A locally presentable category is nearest: it is accessible and cocomplete, adding all small colimits.

Manages Complexity¶

Accessibility compresses a proper class of objects into a set of bounded generators plus filtered assembly, while delicate size and cardinal conditions prevent the slogan from being a proof. The central large categories–set-sized control tradeoff is this: The theory tames proper classes while foundations and universes remain explicit. A second flexible cardinal–minimal rank tension matters because Many λ may work while least-rank claims are delicate.

Abstract Reasoning¶

Use three linked moves: fix foundations, category, and a regular cardinal; prove existence of the required filtered colimits; identify a set of λ-presentable objects and verify preservation. As a collapse test, the proof fails when regularity, universe/set issues, presentability preservation, filteredness, or generation of every object is omitted. A fourth check is to construct every object from them by λ-filtered colimit. A final check is to state rank, universe, and local-presentability distinctions precisely.

Knowledge Transfer¶

The presentable-generator pattern transfers to new categories only after morphisms, colimits, cardinal bounds, and universe conventions are established; underlying-set size alone is not enough. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. Host mathematical structure, not the accessibility property itself. Construction operation within the definition.

Relationships to Other Abstractions¶

Current abstraction Accessible category Domain-specific

Parents (1) — more general patterns this builds on

Accessible category is a kind of Mathematical Category Domain-specific

Accessible category satisfies the defining boundary of Mathematical Category: A mathematical category is a structure consisting of objects, morphisms between objects, identity morphisms, and an associative partial composition law with matching domains and codomains, optionally enriched or equipped with additional categorical structure.

Hierarchy path (1) — routes to 1 parentless root

Accessible category → Mathematical Category → Mathematical structure → Set and Membership

Neighborhood in Abstraction Space¶

Accessible category sits in a moderately populated region (49^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Abstract Algebra & Category Theory (24 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08