Join (simplicial sets)¶

A monoidal operation combining two simplicial sets so simplices consist of an ordered simplex from the first followed by one from the second, corresponding under realization to topological join.

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

Core Idea¶

The simplicial join extends ordinal sum by colimits, has the empty simplicial set as unit, corresponds to categorical join under nerves, and supports slice, cone, horn, twisted-arrow, and higher-categorical constructions. Ordered vertex blocks are concatenated with every first-factor vertex before every second-factor vertex; face and degeneracy maps restrict within or cross the split, and universal extension assembles arbitrary simplicial sets from representables. 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…

Corners in a Row

Think of shapes built from dots, sticks and triangles, where the dots are put in a line from first to last. To join two shapes, put all the dots of the first shape before all the dots of the second. Then fill in a piece connecting them. Join one dot with another dot and you get a stick. Join a dot with a stick and you get a triangle.

Ordered Shape Gluing

Mathematicians build shapes out of points, segments, triangles and their higher versions, and they keep the corners of each piece in a fixed order. The join of two such shapes lines up the corners of the first shape before the corners of the second. Then it fills in every combined piece. For example, joining a point with a segment makes a triangle. Joining anything with the empty shape leaves it unchanged.

Ordinal-Sum Simplicial Join

Simplicial sets describe shapes built from ordered simplices — points, edges, triangles, tetrahedra. For the basic simplices, the join just stacks ordered vertex lists: an n-simplex joined with an m-simplex is an (n+m+1)-simplex, with every vertex of the first before every vertex of the second. Its faces either live inside one part or cross the split. For general simplicial sets, the join is extended from these basic pieces by gluing. The empty simplicial set is the unit, and this join matches the join of categories when you take nerves. It is used to build cones, slices and other constructions in higher category theory.

The join of simplicial sets X ⋆ Y is built so that on standard simplices Δ^m ⋆ Δ^n ≅ Δ^(m+n+1), corresponding to the ordinal sum [m] ⊕ [n], where every vertex of the first block precedes every vertex of the second. It is extended to arbitrary simplicial sets by colimits, using the fact that every simplicial set is assembled from representables. Concretely, an n-simplex of X ⋆ Y is a simplex of X, a simplex of Y, or a pair with one from each whose degrees sum to n−1; face and degeneracy maps either act within one factor or cross the split, possibly emptying one side. Handling empty degrees typically uses augmented conventions. The empty simplicial set is the unit and the join is associative up to coherent isomorphism. Under the nerve, it corresponds to the categorical join, and it relates to the topological join under geometric realization. It underlies slice and cone constructions, horns, twisted arrows, and much of higher-categorical machinery.

Scope of Application¶

Join (simplicial sets) belongs to simplicial and higher category theory and is useful where the analyst can specify the typed simplicial and higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the simplicial sets and indexing category, degree formula and empty degrees, ordinal-sum convention, face and degeneracy actions, unit, associativity coherence, categorical nerve relation, geometric realization relation, and finite or augmented convention are explicit. The scope is broad within that domain but bounded by the need for the simplicial sets and indexing category, degree formula and empty degrees, ordinal-sum convention, face and degeneracy actions, unit, associativity coherence, categorical nerve relation, geometric realization relation, and finite or augmented convention are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the simplicial sets and indexing category, degree formula and empty degrees, ordinal-sum convention, face and degeneracy actions, unit, associativity coherence, categorical nerve relation, geometric realization relation, and finite or augmented convention 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 Join (simplicial sets). Join (simplicial sets) 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 simplicial and higher 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.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of simplicial and higher category theory because they reuse the typed simplicial and higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Ordered vertex blocks are concatenated with every first-factor vertex before every second-factor vertex; face and degeneracy maps restrict within or cross the split, and universal extension assembles arbitrary simplicial sets from representables., and type the carrier, state every parameter and convention in the definition, test that the simplicial sets and indexing category, degree formula and empty degrees, ordinal-sum convention, face and degeneracy actions, unit, associativity coherence, categorical nerve relation, geometric realization relation, and finite or augmented convention are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Join (simplicial sets) Domain-specific

Parents (1) — outgoing typed relations

Join (simplicial sets) is a kind of Composition Prime

It remains its own entry because its identity is fixed by the simplicial sets and indexing category, degree formula and empty degrees, ordinal-sum convention, face and degeneracy actions, unit, associativity coherence, categorical nerve relation, geometric realization relation, and finite or augmented convention.

Hierarchy path (1) — routes to 1 parentless root

Join (simplicial sets) → is a kind of Composition → presupposes Gestalt Principles → is a decomposition of Holism

Neighborhood in Abstraction Space¶

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

Family — Simplicial Sets & Higher Categories (7 abstractions)

Nearest neighbors

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