Compact closed category¶

A symmetric monoidal category in which every object has a dual with unit and counit morphisms satisfying the snake identities.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3777
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Category Theory, Monoidal Duality → Mathematics

Core Idea¶

A compact closed category supplies coherent duals allowing wires or morphisms to bend between inputs and outputs. Evaluation and coevaluation create and cancel dual pairs, and the snake identities guarantee that bending a wire out and back is identity. 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.

The load-bearing residual is not the broad topic of category theory. It is categorical duality for every object in a symmetric tensor setting. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that every object has chosen duality data satisfying both triangular snake identities under the monoidal coherence fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

Bendy-String Machines

Imagine drawing machines joined by strings, where things flow in one end and out the other. In a compact closed category, you're allowed to bend any string into a U-turn, so an input can turn into an output. The one big rule: if a string zigzags back and forth, you can always pull it straight, and nothing has changed.

Wires That Can Bend Back

Mathematicians sometimes draw processes as boxes connected by wires, where each wire carries a kind of thing. A compact closed category is a special setting where every kind of wire has a matching 'partner' wire, which lets you bend a wire around. One move makes a pair of partner wires out of nothing, like a cup, and another move joins a pair and ends them, like a cap. The key rule, called the snake rule, says a wire bent out and back again in an S-shape is the same as a straight wire. This lets you swap inputs and outputs in a controlled way.

Categories With Duals for Every Object

Category theory studies objects and the arrows (processes) between them. A monoidal category lets you put things side by side, a tensor product, and a symmetric one lets you swap their order. A compact closed category is a symmetric monoidal category where every object A has a dual A*, together with two special arrows: one that creates a pair A* and A from nothing (the unit or coevaluation) and one that combines A and A* into nothing (the counit or evaluation). These must satisfy the snake identities: create a pair and then cancel one side, and you get back the plain identity, like pulling a zigzag string straight. In pictures, this means wires can be bent to turn inputs into outputs. Finite-dimensional vector spaces with the usual tensor product are a standard example.

A compact closed category is a symmetric monoidal category in which every object A has a dual A*, equipped with a unit (coevaluation) η: I → A* ⊗ A and a counit (evaluation) ε: A ⊗ A* → I that create and cancel dual pairs. These must satisfy the two triangle, or snake, identities: composing η and ε in the zigzag pattern (with the appropriate unitors and associators) yields the identity on A, and correspondingly on A*. In string diagrams, η and ε are a cup and a cap, and the snake identities say a wire bent out and back straightens to the identity; this lets morphisms be transposed between input and output positions coherently. The defining requirement is that duality data exists for every object and satisfies both snake identities under the monoidal coherence — having some duals, or only one identity, is not enough. Standard examples include finite-dimensional vector spaces with the tensor product and sets with relations.

Scope of Application¶

Compact closed category belongs to category theory and is useful where the analyst can specify a symmetric monoidal category C, tensor unit I, each object A and dual A-star, coevaluation I to A tensor A-star, evaluation A-star tensor A to I, symmetry and snake equations, then evaluate every object has chosen duality data satisfying both triangular snake identities under the monoidal coherence. The scope is broad within that domain but bounded by the need for every object has chosen duality data satisfying both triangular snake identities under the monoidal coherence. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making every object has chosen duality data satisfying both triangular snake identities under the monoidal coherence the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Compact closed category can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Compact closed category. Compact closed 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: a symmetric monoidal category C, tensor unit I, each object A and dual A-star, coevaluation I to A tensor A-star, evaluation A-star tensor A to I, symmetry and snake equations. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express every object has chosen duality data satisfying both triangular snake identities under the monoidal coherence independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of category theory because they reuse a symmetric monoidal category C, tensor unit I, each object A and dual A-star, coevaluation I to A tensor A-star, evaluation A-star tensor A to I, symmetry and snake equations, Evaluation and coevaluation create and cancel dual pairs, and the snake identities guarantee that bending a wire out and back is identity., and type the carrier, state every parameter and convention in the definition, test that every object has chosen duality data satisfying both triangular snake identities under the monoidal coherence, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Compact closed category Domain-specific

Parents (1) — outgoing typed relations

Compact closed category is a kind of Duality Prime

Every object is paired with a coherent categorical dual.

Children (1) — abstractions linked here by typed relations

Dagger Compact Category Domain-specific is a kind of Compact closed category

It retains compact duals for every object and adds a tensor-compatible dagger tied to the duality maps.

Hierarchy path (1) — routes to 1 parentless root

Compact closed category → is a kind of Duality

Neighborhood in Abstraction Space¶

Compact closed category 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 — Categorical Constructions & Dualities (33 abstractions)

Nearest neighbors

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