nLab cubical-type model category

Cubical-type model categories

Context

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
propositionsetobjecttype
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

semantics

Model category theory

model category, model \infty -category

Definitions

Morphisms

Universal constructions

Refinements

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

General

A cubical-type model category is a model category structure whose fibrations are defined by lifting against a generalized form of open box inclusions.

The term is not a precise technical one, but refers to model structures arising from a family of constructions, the first of which is due to Sattler (2017). These constructions are motivated by cubical type theory and can in particular be applied in certain categories of cubical sets.

Outline

The inputs to the construction are

  1. a finitely complete and finitely cocomplete category \mathcal{E};

  2. a monomorphism p 𝔽:1𝔽p_{\mathbb{F}} \colon 1 \to \mathbb{F} in \mathcal{E};

  3. an adjoint functorial cylinder

with right adjoint PP on \mathcal{E}.

The map p 𝔽p_{\mathbb{F}} is intended as a classifier for the cofibrations, while the cylinder is used to define fibrations and acyclic cofibrations. The construction proceeds by building a cylindrical premodel category and then showing that it forms a model category.

The cofibrations, fibrations, and weak equivalences can be defined using just the data above, but further conditions on \mathcal{E}, p 𝔽p_{\mathbb{F}}, and CPC \dashv P are required to construct factorizations, to check that the premodel structure is cylindrical, and to prove 2-out-of-3 for weak equivalences.

The step from a premodel structure to a model structure is mediated by the following definition and proposition.

Definition

A premodel category has the fibration extension property if for every fibration f:YXf \colon Y \to X and acyclic cofibration i:XXi \colon X \to X', there is a pullback square

in which ff' is a fibration.

Proposition

Let \mathcal{E} be a cylindrical premodel category in which all objects are cofibrant. If \mathcal{E} has the fibration extension property, then the class WAFACW \coloneqq AF \circ AC has the 2-out-of-3 property (i.e., \mathcal{E} is a model category).

The fibration extension property is then connected to the existence of fibrant classifiers for fibrations; see for example (Awodey et al. 2024, Section 3.6).

Definitions

Cofibrations and acyclic fibrations

We first define the factorization system (AC,F).

Definition

A map is a cofibration when it can be written as a pullback of p 𝔽:1𝔽p_{\mathbb{F}} \colon 1 \to \mathbb{F} in \mathcal{E}.

Definition

A map in \mathcal{E} is an acyclic fibration when it has the right lifting property against all cofibrations.

Proposition

Assume \mathcal{E} is a locally cartesian closed category and the cofibrations are closed under composition. Then the cofibrations and acyclic fibrations define a weak factorization system.

Sketch

We need to show that

  • any morphism f:YXf \colon Y \to X can be factored as a cofibration followed by an acyclic fibration;
  • any map lifting against all trivial fibrations is a cofibration.

For the first point, regard ff as an object (Y,f)/X(Y,f) \in \mathcal{E}/X in the slice over XX. Then we have 𝔽 p 𝔽(Y,f)/X\sum_{\mathbb{F}} \prod_{p_{\mathbb{F}}} (Y,f) \in \mathcal{E}/X, where 𝔽\sum_{\mathbb{F}} is the dependent sum along π 0:X×𝔽X\pi_0 \colon X \times \mathbb{F} \to X and p 𝔽\prod_{p_{\mathbb{F}}} is the dependent product along X×p 𝔽:XX×𝔽X \times p_{\mathbb{F}} \colon X \to X \times \mathbb{F}. When p 𝔽p_{\mathbb{F}} is the subobject classifier, this is the partial map classifier for (Y,f)(Y,f). One may check that the map 𝔽 p 𝔽(Y,f)X\sum_{\mathbb{F}} \prod_{p_{\mathbb{F}}} (Y,f) \to X has the right lifting property against all cofibrations; this step uses the closure of cofibrations under composition.

By the Beck–Chevalley conditions, we have a pullback square

The map cc is a cofibration by construction. One may check that the composite Yc 𝔽 p 𝔽(Y,f)XY \overset{c}{\to} \sum_{\mathbb{F}} \prod_{p_{\mathbb{F}}} (Y,f) \to X is ff.

The second point follows from the retract argument after checking that the class of cofibrations is closed under retracts.

Fibrations and acyclic cofibrations

Variations on the construction differ in their definition of the fibrations and acyclic fibrations. We give the definition used in Sattler (2017).

Definition

A map f:YXf \colon Y \to X is a fibration when it has the right lifting property against the pushout application ev^(δ k,m)\widehat{ev}(\delta_k, m) for all k{0,1}k \in \{0,1\} and cofibrations mm. A map is a trivial cofibration when it has the left lifting property against the fibrations.

The above definition is appropriate when the cylinder functor admits connections in the sense of Gambino & Sattler (2017), which is related to the notion of connection on a cubical set. Other definitions are used in cases without connections; see for example (Awodey 2023).

Further assumptions on \mathcal{E} and the cylinder are needed to construct the (trivial cofibration, fibration) factorizations using the small object argument or algebraic small object argument; see for example Sections 3 and 7 of (Gambino & Sattler 2017) respectively. The algebraic route may be necessary to define the factorizations constructively.

Cylindricality

For the (cofibration, trivial fibration) weak factorization system to be cylindrical, it is necessary to assume that the class of cofibrations is closed under pushout application ev^(,): 2 2\widehat{ev}(\partial,-) \colon \mathcal{E}^{\mathbf{2}} \to \mathcal{E}^{\mathbf{2}}.

For the premodel structure to be cylindrical, it then suffices to require that the cylinder functor admits a symmetry, meaning an isomorphism CCCCC \circ C \cong C \circ C interacting with the cylinder structure in an appropriate way. See (Sattler 2017, Remark 4.3).

The Frobenius condition

The proofs of the fibration extension property require first establishing that the (trivial cofibration, fibration) weak factorization system satisfies the Frobenius condition.

A proof for a setting with connections can be found in (Gambino & Sattler 2017). Proofs for settings without connections can be found in (Awodey 2023), (Hazratpour & Riehl 2024), and (Barton 2024).

Instances of the assumptions

A concrete application is to categories of cubical sets, i.e. presheaves over a category of cubes \Box.

A simple and central choice for \Box 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} \rightarrowtail \Omega to be the smallest lattice of subobjects containing the cylinder endpoints (the faces of cubes). To get Cisinski model structures we can take 𝔽=Ω\mathbb{F} = \Omega. 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.)

Equivalence with simplicial sets

One may wonder whether these model structures are equivalent to the classical model structure on simplicial sets, i.e., whether they present classical homotopy theory.

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.

A modified model structure for cartesian cubes, the equivariant fibration model structure, does present classical homotopy theory (Awodey, Cavallo, Coquand, Riehl & Sattler (2024)). This model structure agrees with the test model structure on cartesian cubical sets.

The model structure for cartesian cubes with one connection also presents classical homotopy theory (Cavallo & Sattler (2022)). In this case an explicit equivariance condition on fibrations is not required (but is automatically satisfied). Again, the model structure agrees with the test model structure on the same category.

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.

References

Sattler’s construction is in

and some elements appear in the earlier paper

The following two notes describe the construction, specialized to cubical sets, in more type-theoretic language.

A refactoring of part of Sattler’s construction through the notion of “cylindrical premodel category” is described in Section 3 of

and in the unpublished note

Adaptations of the construction to cartesian cubical sets without connections can be found in

Cubical-type model categories that present classical homotopy theory:

On equivalences with the model structure on simplicial sets:

Proofs of the Frobenius condition:

Formalization of a version of the construction in the Coq proof assistant:

Last revised on January 1, 2025 at 01:45:37. See the history of this page for a list of all contributions to it.