Join of Categories¶
The small-category construction that preserves two input categories, adds one morphism from every left object to every right object and none backward, and forms an associative monoidal product.
Core Idea¶
The categorical join places one category wholly before another. Its objects are the disjoint union of the inputs. Morphisms within each side remain unchanged; every left object receives exactly one canonical morphism to every right object, and no morphisms are added from right to left.
These hom-set rules determine compatible composition and define a bifunctor on small categories. Join is associative up to the standard categorical structure, the empty category is its unit, terminal-category joins form left and right cones, and the nerve carries categorical join to simplicial join.
Scope of Application¶
- Category theory. Builds an oriented monoidal combination of small categories.
- Cone constructions. Adjoins initial or terminal cone points using [0].
- Higher-category theory. Interfaces with joins and slices of simplicial sets and quasicategories.
- Nerve calculations. Translates categorical constructions into simplicial combinatorics.
Clarity¶
Write the four hom-set cases explicitly and retain factor order. Associativity is categorical rather than literal equality under all encodings, and opposite categories reverse the join order. Inclusion test: Construct the disjoint object union, preserve both internal hom-sets, assign singleton C-to-D and empty D-to-C cross hom-sets, and verify categorical composition. Exclusion test: Exclude coproduct, product, arbitrary category gluing, and a graph join lacking identities and composition. Nearest boundary: The coproduct C⊔D has no cross morphisms; the join adds a unique arrow in one direction between every cross pair. Exit condition: The construction ceases to be the join if reverse cross arrows are added, forward cross hom-sets are not singleton, or original internal hom-sets are altered.
Manages Complexity¶
The construction compresses many new arrows and their composites into one uniform orientation rule. It preserves each input while supplying exactly the cross-category comparability needed for cones and higher-categorical slices.
Abstract Reasoning¶
- Form the disjoint union of objects.
- Copy internal hom-sets unchanged.
- Set every left-to-right hom-set to a singleton and every reverse one to empty.
- Define the forced compositions and verify category axioms.
- Check functoriality, unit, associativity, and nerve compatibility as needed.
Knowledge Transfer¶
The ordered-gluing pattern transfers to enriched or higher categorical joins only after replacing singleton homs with the correct enriched or simplicial data. The ordinary definition should not be assumed unchanged.
Relationships to Other Abstractions¶
Current abstraction Join of Categories Domain-specific
Parents (1) — more general patterns this builds on
-
Join of Categories is a kind of Composition Prime
The Categorical Join is Composition that combines two categories and adds every forward left-to-right morphism into one associative construction.
Hierarchy path (1) — routes to 1 parentless root
- Join of Categories → Composition → Gestalt Principles → Holism
Neighborhood in Abstraction Space¶
Join of Categories sits in a crowded region of the domain-specific corpus (25th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Category Theory & Higher Structures (18 abstractions)
Nearest neighbors
- Simplicial Localization — 0.89
- Category of Manifolds — 0.89
- Mathematical Category — 0.89
- K-theory — 0.89
- Mapping Cylinder — 0.89
Computed from structural-signature embeddings · 2026-10-08