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: v1 · 2026-09-08 · History
Domain-specific #: 4997
Origin domain: category theory
Subdomain: category theory

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.

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. 2. 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) — more general patterns this builds on

Ind-completion is a kind of Closure Prime

The proposed strict upward parent is prime:closure.

Hierarchy path (1) — routes to 1 parentless root

Ind-completion → Closure

Neighborhood in Abstraction Space¶

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

Family — Category-Theoretic Structures (79 abstractions)

Nearest neighbors

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