Extensive category¶

A category with finite coproducts that are disjoint and stable enough that objects over a coproduct decompose equivalently into objects over its summands.

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

Core Idea¶

A category is extensive when the canonical functor from the product of slice categories over X and Y to the slice over X+Y is an equivalence, encoding universal disjoint decomposition. Pullback along coproduct injections separates any map into its two pieces, and the extensivity equivalence guarantees those pieces reconstruct the original object uniquely up to isomorphism. 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…

The Clean Split Bins

Imagine two separate toy bins, a red one and a blue one. If you have a pile of toys and each toy belongs to one bin or the other, you can always split the pile into red-bin toys and blue-bin toys. Put the two parts back together and you get exactly your pile again. A math world where this splitting always works perfectly is called an extensive category.

Clean Splitting and Gluing

In category theory, mathematicians study collections of objects and the arrows between them. One basic move is gluing two objects X and Y side by side, with no overlap, to make X+Y. A category is extensive when anything that sits over X+Y can always be cut cleanly into a part over X and a part over Y. Gluing those parts back gives you the same thing you started with. So splitting and gluing are perfect opposites.

Universal Disjoint Decomposition

In category theory, a coproduct X+Y is the universal way to put two objects side by side, like a disjoint union of sets. A slice category C/X collects all the objects that come with a map into X. A category is extensive when it has finite coproducts and the natural functor taking a pair (an object over X, an object over Y) to their sum over X+Y is an equivalence. In practice, any map into X+Y can be pulled back along the two inclusions into a piece over X and a piece over Y. Those pieces then reassemble the original object up to isomorphism. Sets behave this way, but not every category with coproducts does, so having sums is not enough on its own.

Let C be a category with finite coproducts. For objects X and Y, the slice category C/X has as objects the arrows A→X. There is a canonical functor C/X × C/Y → C/(X+Y) sending a pair (A→X, B→Y) to A+B→X+Y. C is extensive when this functor is an equivalence for every X and Y. Concretely, any map E→X+Y decomposes by pulling back along the coproduct injections into E₁→X and E₂→Y, and these reassemble E uniquely up to isomorphism. This captures 'universal disjoint decomposition': coproducts are disjoint and stable under pullback. To verify extensivity you must check the equivalence itself, under the stated size conventions, not just that coproducts exist or look like disjoint unions.

Scope of Application¶

Extensive category 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 finite coproducts exist and for every X and Y the canonical functor from C/X times C/Y to C/(X+Y) is an equivalence under the declared size convention. The scope is broad within that domain but bounded by the need for finite coproducts exist and for every X and Y the canonical functor from C/X times C/Y to C/(X+Y) is an equivalence under the declared size convention.

Clarity¶

The abstraction clarifies a crowded vocabulary by making finite coproducts exist and for every X and Y the canonical functor from C/X times C/Y to C/(X+Y) is an equivalence under the declared size convention 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 Extensive category. Extensive category 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 finite coproducts exist and for every X and Y the canonical functor from C/X times C/Y to C/(X+Y) is an equivalence under the declared size convention 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, Pullback along coproduct injections separates any map into its two pieces, and the extensivity equivalence guarantees those pieces reconstruct the original object uniquely up to isomorphism., and type the carrier, state every parameter and convention in the definition, test that finite coproducts exist and for every X and Y the canonical functor from C/X times C/Y to C/(X+Y) is an equivalence under the declared size convention, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Extensive category Domain-specific

Parents (1) — outgoing typed relations

Extensive category is a kind of Decomposition Prime

What makes it its own entry: the domain-specific identity determined by finite coproducts exist and for every X and Y the canonical functor from C/X times C/Y to C/(X+Y) is an equivalence under the declared size convention.

Hierarchy path (1) — routes to 1 parentless root

Extensive category → is a kind of Decomposition

Neighborhood in Abstraction Space¶

Extensive category sits in a crowded region of the domain-specific corpus (2^nd 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