Cubical Set

Represent a combinatorial or homotopical object as a contravariant set-valued functor on a declared cube category, with functorial face, degeneracy, and optional richer cube operations.

Version

v3 · 2026-09-19 · History

Domain-specific #

1600

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Algebraic Topology → Mathematics

Aliases

Cubical presheaf

Core Idea

Fix a cube category Box whose objects are formal n-dimensional cubes and whose morphisms describe the allowed ways of inserting endpoints, deleting or identifying dimensions, permuting coordinates, or adding connection operations. A cubical set is a presheaf

\[ X:\Box^{op}\to\mathbf{Set}. \]

The set X_n=X(Box^n) is the collection of abstract n-cubes of X. A cube map alpha:Box^m→Boxn induces a structure map X(alpha):X_n→X_m. The reversal of arrows is load-bearing: probing an n-cube along a lower-dimensional cube map produces its lower-dimensional face or specialization.

How would you explain it like I'm…

Box of Labeled Pieces

Imagine a big box of pieces: dots, sticks, flat squares and solid cubes. Each piece comes with a little tag that says which smaller pieces make up its sides, like which sticks are the edges of a square. A cubical set is that whole collection of pieces plus all the tags that say how they fit together.

Shapes Built From Cubes

A Cubical Set is a way mathematicians describe shapes by keeping lists instead of drawing them. There's a list of points, a list of lines, a list of squares, a list of cubes, and so on to higher dimensions. For each square, there are rules saying which lines form its edges, and for each line which points are its ends. The rules must agree with each other: if you reach a corner by going along two different edges, you land on the same corner. There are also rules that let a smaller piece be counted as a flattened bigger piece. Different versions of the rulebook exist, and you have to say which one you're using.

Cubes With Matching Faces

A Cubical Set describes a higher-dimensional space as organized data: for each dimension n, a set X_n of abstract n-cubes, together with maps between these sets. Face maps take an n-cube to one of its 2n faces by fixing one coordinate to 0 or 1, so a square has four edges and a cube has six square faces. Degeneracy maps do the reverse, turning a lower-dimensional cube into a 'flat' higher one that doesn't change in one direction. These maps must satisfy consistency rules, called cubical identities, so that reaching a corner by two compatible routes gives the same result. The allowed operations come from a chosen 'cube category,' and there are several legitimate choices, some adding operations like swapping coordinates. Cubical sets are used in homotopy theory, the study of concurrency, and the foundations of type theory.

 

A Cubical Set is a presheaf X: □^op → Set on a chosen cube category □, whose objects are formal cubes □ⁿ and whose morphisms encode allowed operations such as inserting endpoints, deleting or identifying dimensions, permuting coordinates, or connections. X_n = X(□ⁿ) is the set of n-cubes, and each cube map α: □ᵐ → □ⁿ induces a structure map X(α): X_n → X_m in the reverse direction; this contravariance means probing an n-cube with a lower-dimensional map yields its face or specialization. In the standard face-and-degeneracy presentation, each n-cube has 2n faces (fixing one coordinate to 0 or 1), and degeneracies produce n-cubes constant in one direction. Functoriality enforces the cubical identities, so corners reached by compatible face operations agree regardless of order. Because variants add coordinate exchange, connections (min/max), reversals, diagonals, weakening or contraction, the cube category is part of any precise claim. Cubical sets encode higher geometry combinatorially and model homotopy theory, higher paths, concurrency, and constructive type-theoretic semantics.

Scope of Application

Algebraic homotopy theory. Cube categories that are test categories let their presheaves present classical homotopy types after an appropriate localization. Cubical boundaries, horns or boxes, fillers, and geometric realization supply combinatorial analogues of paths and homotopies.

Homotopy type theory. Cartesian and De Morgan cubical sets provide interval objects and path semantics. Awodey develops a cartesian cubical model of homotopy type theory, while Cohen, Coquand, Huber, and Mörtberg use a richer cubical model to give constructive computational meaning to univalence and to handle function extensionality and selected higher inductive types.

Clarity

The shortest recognition test asks three questions: What is Box? What is X(Box^n) in each dimension? What maps does X assign to each morphism of Box? If the answer gives only cubes but no contravariant structure maps, it is not yet a cubical set.

Manages Complexity

Higher-dimensional attachment data can require many separate compatibility equations. The functor packages them into one law: identity maps act as identities and composite cube maps act by composite restrictions in reverse order. The cubical identities are no longer ad hoc bookkeeping; they are instances of functoriality.

Abstract Reasoning

Use this protocol:

1. Declare Box and list its generating morphisms and equations.
2. Specify X_n for each needed dimension.
3. Give the induced face, degeneracy, and optional richer operations.
4. Verify their cubical identities, or derive them from functoriality.
5. Define morphisms as natural transformations commuting with every operation.
6. Add fillers, labels, basepoints, realizations, or model structures only as separately declared layers.

Knowledge Transfer

Literal transfer occurs when topology, concurrency, type theory, or higher category theory retains the same presheaf grammar. The meanings of a 2-cell may differ, but Box, contravariance, dimension fibers, and functorial boundary maps remain recognizable.

Transfer from cubical to simplicial methods needs an explicit adjunction, triangulation, nerve, or comparison functor. Calling squares triangles does not preserve their face combinatorics. Transfer from a cubical set to a topological space likewise passes through geometric realization and may be considered only up to the declared equivalence.

Relationships to Other Abstractions

Current abstraction Cubical Set Domain-specific

Parents (1) — outgoing typed relations

• Cubical Set is a kind of Functor Domain-specific

  Functor. A cubical set is literally a contravariant functor from a cube category to Set.

Hierarchy paths (4) — routes to 4 parentless roots

• Cubical Set → is a kind of Functor → presupposes Category → includes Associativity → is a kind of Invariance

Show alternative paths (3)

Neighborhood in Abstraction Space

Cubical Set sits in a sparse region of the domain-specific corpus (60^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

• Simplicial Presheaf — 0.85
• Aztec Diamond — 0.85
• McKay Graph — 0.84
• Exceptional Inverse Image Functor — 0.84
• Synthetic differential geometry — 0.84

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