nLab cubical-type model category

Cubical-type model categories


Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logicset theory (internal logic of)category theorytype theory
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
introduction rule for implicationcounit for hom-tensor adjunctionlambda
elimination rule for implicationunit for hom-tensor adjunctionapplication
cut elimination for implicationone of the zigzag identities for hom-tensor adjunctionbeta reduction
identity elimination for implicationthe other zigzag identity for hom-tensor adjunctioneta conversion
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition, truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition, mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction set (into subsingleton)internal hom (into subterminal object)function type (into h-proposition)
negationfunction set into empty setinternal hom into initial objectfunction type into empty type
universal quantificationindexed cartesian product (of family of subsingletons)dependent product (of family of subterminal objects)dependent product type (of family of h-propositions)
existential quantificationindexed disjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijection setobject of isomorphismsequivalence type
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image of morphism into terminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset with equivalence relationinternal 0-groupoidBishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
set of truth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels


Model category theory

model category, model \infty -category



Universal constructions


Producing new model structures

Presentation of (,1)(\infty,1)-categories

Model structures

for \infty-groupoids

for ∞-groupoids

for equivariant \infty-groupoids

for rational \infty-groupoids

for rational equivariant \infty-groupoids

for nn-groupoids

for \infty-groups

for \infty-algebras

general \infty-algebras

specific \infty-algebras

for stable/spectrum objects

for (,1)(\infty,1)-categories

for stable (,1)(\infty,1)-categories

for (,1)(\infty,1)-operads

for (n,r)(n,r)-categories

for (,1)(\infty,1)-sheaves / \infty-stacks

Cubical-type model categories


These exist a class of model category structures on certain categories of cubical sets, due to Christian Sattler, motivated by cubical type theory.


Let \mathbb{C} be a small category with finite products. Assume there is a (cartesian) interval object 𝕀\mathbb{I}, i.e., an object 𝕀\mathbb{I} with two parallel morphisms 0,1:e𝕀0,1 \colon e \to \mathbb{I}, where ee is the terminal object in \mathbb{C}.

Assume further that we have connection maps ,:𝕀×𝕀𝕀\vee,\wedge : \mathbb{I}\times\mathbb{I} \to \mathbb{I} such that x0=0x=xx \vee 0 = 0 \vee x = x and x1=1x=xx \wedge 1 = 1 \wedge x = x.

We also need a face lattice 𝔽\mathbb{F}, that is, a sub-lattice of the subobject classifier Ω\Omega in the presheaf category cSet= opSetcSet = \mathbb{C}^{op} \to Set containing the endpoints of each cylinder object J +=J×𝕀J^+ = J \times \mathbb{I} for each object JJ of \mathbb{C}, and an operation :𝔽 𝕀𝔽\forall \colon \mathbb{F}^\mathbb{I} \to \mathbb{F} right adjoint to the projection in the sense that ψδ\psi \le \forall \delta iff ψpδ\psi p \le \delta, where p:𝔽×𝕀𝔽p : \mathbb{F} \times \mathbb{I} \to \mathbb{F}.

If we want the model to be effective, we also require that each proposition ψ=1\psi = 1 with ψ𝔽(I)\psi \in \mathbb{F}(I) is decidable. (This rules out taking 𝔽=Ω\mathbb{F} = \Omega.)

Instances of the assumptions

A simple and central example is the full subcategory of the category of posets PosPos on powers of 𝕀=(0<1)\mathbb{I} = (0 \lt 1). This is also the Lawvere theory of distributive lattices. The idempotent completion is the full subcategory of PosPos on finite lattices.

Other prominent examples are the Lawvere theories of de Morgan, Kleene, and boolean algebras.

For computational purposes we can take 𝔽\mathbb{F} to be the smallest lattice containing the cylinder endpoints (the faces of cubes). To get Cisinski model structures we can take 𝔽=Ω\mathbb{F} = \Omega.

Equivalence with simplicial sets

One may wonder whether these models structures are equivalent to the model in simplicial sets. This is not the case for Cartesian cubes; see mailing-list. However, this model does form a Grothendieck (infinity,1)-topos, because it satisfies the Giraud axioms. For deMorgan cubical sets the geometric realization is not a Quillen equivalence (because of the reversal map); the counterexample is the unit interval quotient by the symmetry); see Sattler. Whether they are equivalent by another map is not yet excluded. The question whether the geometric realization for the cubical sets based on distributive lattices is an equivalence is still open, cf. also Hackney and Rovelli and Streicher and Weinberger.


Last revised on August 15, 2022 at 02:31:51. See the history of this page for a list of all contributions to it.