Ind-completion¶

The free completion of a category under small filtered colimits, whose objects can be represented by filtered diagrams in the original category.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4997
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Category Theory → Mathematics

Core Idea¶

Ind(C) embeds C through constant diagrams and satisfies a universal property for functors into categories with filtered colimits; morphisms use a limit–colimit formula and the dual construction is Pro(C). Formal filtered diagrams are added as new objects, maps are computed by eventually compatible component maps, and every such diagram obtains a colimit while preserving the original category fully faithfully under suitable size conventions. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

No faithful explanation at this level. A picture for small children turns formally adjoining colimits of filtered diagrams into 'adding the end of a growing line' or 'piling things together'. That loses the fact that the new objects are formal diagrams whose maps follow the limit–colimit rule.

Adding Missing Destinations

Mathematicians study collections of objects together with the ways of going from one to another. Sometimes a growing chain of objects, each fitting into the next, has no 'final object' inside the collection for it to build up to. Ind-completion is a bigger collection that keeps every original object and adds a new 'formal' object for each such growing chain. It also gives exact rules for how these new objects connect to each other, so every growing chain finally gets its destination.

Filtered-Colimit Completion

In category theory, a category is a collection of objects and arrows (maps) between them. Ind(C) enlarges a category C by adding a new object for every 'filtered diagram' in C, a well-behaved system of objects and maps that keeps growing in a consistent direction. Each original object sits inside as a constant diagram, and the original maps are kept exactly. Maps between the new objects are computed from component maps that eventually agree. In Ind(C) every such diagram has a colimit, its natural 'gluing together.' The dual construction, built from inverse-directed diagrams, is called Pro(C).

Given a (locally small) category C, Ind(C) is the free cocompletion of C under filtered colimits. Its objects ('ind-objects') are small filtered diagrams in C, taken up to suitable equivalence. Morphisms are given by a limit–colimit formula, Hom("colim" X_i, "colim" Y_j) = lim_i colim_j Hom(X_i, Y_j). Concretely, a morphism is a family of component maps that are eventually compatible. C embeds fully faithfully through constant diagrams, and every filtered diagram acquires a colimit in Ind(C). Ind(C) has a universal property: any functor from C into a category with filtered colimits extends essentially uniquely to a filtered-colimit-preserving functor on Ind(C). Size conventions (universes, small index categories) and assumptions such as accessibility or compactness must be stated explicitly. The dual construction, using cofiltered diagrams, is Pro(C).

Scope of Application¶

Ind-completion belongs to category theory and is useful where the analyst can specify the typed category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the category C and universe size, small filtered index categories, ind-objects and diagram equivalence, morphism limit-colimit formula, constant-diagram embedding, filtered colimits, universal property and target functor extension, accessibility or compactness assumptions and Pro dual are explicit. The scope is broad within that domain but bounded by the need for the category C and universe size, small filtered index categories, ind-objects and diagram equivalence, morphism limit-colimit formula, constant-diagram embedding, filtered colimits, universal property and target functor extension, accessibility or compactness assumptions and Pro dual are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the category C and universe size, small filtered index categories, ind-objects and diagram equivalence, morphism limit-colimit formula, constant-diagram embedding, filtered colimits, universal property and target functor extension, accessibility or compactness assumptions and Pro dual are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Ind-completion. Ind-completion compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the category C and universe size, small filtered index categories, ind-objects and diagram equivalence, morphism limit-colimit formula, constant-diagram embedding, filtered colimits, universal property and target functor extension, accessibility or compactness assumptions and Pro dual are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of category theory because they reuse the typed category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Formal filtered diagrams are added as new objects, maps are computed by eventually compatible component maps, and every such diagram obtains a colimit while preserving the original category fully faithfully under suitable size conventions., and type the carrier, state every parameter and convention in the definition, test that the category C and universe size, small filtered index categories, ind-objects and diagram equivalence, morphism limit-colimit formula, constant-diagram embedding, filtered colimits, universal property and target functor extension, accessibility or compactness assumptions and Pro dual are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Ind-completion Domain-specific

Parents (1) — outgoing typed relations

Ind-completion is a kind of Closure Prime

It remains its own entry because its identity is fixed by the category C and universe size, small filtered index categories, ind-objects and diagram equivalence, morphism limit-colimit formula, constant-diagram embedding, filtered colimits, universal property and target functor extension, accessibility or compactness assumptions and Pro dual.

Hierarchy path (1) — routes to 1 parentless root

Ind-completion → is a kind of Closure

Neighborhood in Abstraction Space¶

Ind-completion sits in a crowded region of the domain-specific corpus (5^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Category Theory Foundations (48 abstractions)

Nearest neighbors

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