nLab
univalence axiom

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

logiccategory theorytype theory
trueterminal object/(-2)-truncated objecth-level 0-type/unit type
falseinitial objectempty type
proposition(-1)-truncated objecth-level 1-type/h-prop
proofgeneralized elementprogram
conjunctionproductproduct type
disjunctioncoproduct ((-1)-truncation of)sum type (bracket type of)
implicationinternal homfunction type
negationinternal hom into initial objectfunction type into empty type
universal quantificationdependent productdependent product type
existential quantificationdependent sum ((-1)-truncation of)dependent sum type (bracket type of)
equivalencepath space objectidentity type
equivalence classquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
completely presented setdiscrete object/0-truncated objecth-level 2-type/preset/h-set
setinternal 0-groupoidBishop set/setoid
universeobject classifiertype of types
modalityclosure operator monadmodal type theory, monad (in computer science)

homotopy levels

semantics

Equality and Equivalence

Universes

Homotopy theory

Contents

Idea

In intensional type theory, identity types behave like path space objects; this viewpoint is called homotopy type theory. This induces furthermore a notion of homotopy fibers, hence of homotopy equivalences between types.

On the other hand, if type theory contains a universe Type, so that types can be considered as points of Type, then between two types we also have an identity type Paths Type(X,Y). The univalence axiom says that these two notions of “sameness” for types are the same. Morally, this says that Type behaves like an object classifier.

The name univalence (due to Voevodsky) comes from the following reasoning. A fibration or bundle p:EB of some sort is commonly said to be universal if every other bundle of the same sort is a pullback of p in a unique way (up to homotopy). Less commonly, a bundle is said to be versal if every other bundle is a pullback of it in some way, not necessarily unique. By contrast, a bundle is said to be univalent if every other bundle is a pullback of it in at most one way (up to homotopy). The univalence axiom then says that the canonical fibration over Type is univalent, for every fibration with small fibers is an essentially unique pullback of this one (while those with large fibers are not, they are pullbacks of the next higher Type 1).

Definition

We state univalence first in (intensional) type theory and then in its categorical semantics.

In the type theory

Let X and Y be types. There is a canonically defined map from the identity type (X=Y) of paths (in Type) between them to the function type (XY) of equivalences in homotopy type theory between them. It can be defined by path induction, i.e. the eliminator for the identity types, by specifying that it takes the identity path 1 X:(X=X) to the identity equivalence of X.

Univalence: For any two types X,Y, this map (X=Y)(XY) is an equivalence.

Univalence is a commonly assumed axiom in homotopy type theory, and is central to the proposal (Voevodsky) that this provides a natively homotopy theoretic foundation of mathematics (the Univalent Foundations Project.)

In categorical semantics

Let 𝒞 be a locally cartesian closed model category in which all objects are cofibrant.

By the categorical semantics of homotopy type theory, a dependent type

b:BE(b):Typeb : B \vdash E(b) : Type

corresponds to a morphism EB in 𝒞 that is a fibration between fibrant objects.

Then the dependent function type

b 1,b 2:B(E(b 1)E(b 2)):Typeb_1, b_2 : B \vdash ( E(b_1) \to E(b_2)) : Type

is interpreted as the internal hom [,] 𝒞/ B×B in the slice category 𝒞/ B×B after extending E to the context B×B by pulling back along the two projections p 1,p 2:B×BB, respectively. Hence this is interpreted as

[p 1 *E,p 2 *E] 𝒞/ B×B[E×B,B×E] 𝒞/ B×B𝒞/ B×B.[p_1^* E \, , \, p_2^* E]_{\mathcal{C}/_{B \times B}} \simeq [E \times B \, , \, B \times E]_{\mathcal{C}/_{B \times B}} \in \mathcal{C}/_{B \times B} \,.

Consider then the diagonal morphism Δ B:BB×B in 𝒞 as an object of 𝒞/ B×B. We would like to define a morphism

q:Δ B[E×B,B×E] 𝒞/ B×B.q \colon \Delta_B \to [E \times B , B \times E]_{\mathcal{C}/_{B \times B}} \,.

in 𝒞/ B×B. By the defining (product internal hom)-adjunction, it suffices to define a morphism

Δ B× 𝒞/ B×BE×BB×E\Delta_B \times_{\mathcal{C}/_{B \times B}} E \times B \to B \times E

in 𝒞/ B×B. But now by the universal property of pullback, it suffices to define just in 𝒞 /B a morphism

Δ B× 𝒞/ B×BE×BΔ B× 𝒞/ B×BB×E.\Delta_B \times_{\mathcal{C}/_{B \times B}} E \times B \to \Delta_B \times_{\mathcal{C}/_{B \times B}} B \times E\,.

And since the composite pullback along either composite

BΔ BB×Bπ 1BB \xrightarrow{\Delta_B} B\times B \xrightarrow{\pi_1} B
BΔ BB×Bπ 2BB \xrightarrow{\Delta_B} B\times B \xrightarrow{\pi_2} B

is the identity, both Δ B× 𝒞/ B×BE×B and Δ B× 𝒞/ B×BB×E are isomorphic to E; thus here we can take the identity morphism.

Now, using the path object factorization in 𝒞

B B I Δ B B×B\array{ B &&\stackrel{\simeq}{\hookrightarrow}&& B^I \\ & {}_{\mathllap{\Delta_B}}\searrow && \swarrow_{\mathrlap{}} \\ && B \times B }

by an acyclic cofibration followed by a fibration, we obtain a fibrant replacement of Δ B in the slice model category 𝒞 B×B.

Since also [E×B,B×E] 𝒞/ B×B is fibrant by the axioms on the locally cartesian closed model category 𝒞, we have a lift q^ in the diagram in 𝒞/ B×B

B q [E×B,B×E] 𝒞/ B×B q^ B I B×B=* 𝒞/ B×B.\array{ B &\stackrel{q}{\to}& [E \times B, B \times E]_{\mathcal{C}/_{B \times B}} \\ \downarrow &{}^{\mathllap{\hat q}}\nearrow& \downarrow \\ B^I &\to& B \times B = *_{\mathcal{C}/_{B \times B}} } \,.

This lift is the interpretation of the path induction that deduces a map on all paths γB I from one on just the identity paths id bBB I.

Finally, let Eq(E)[E×B,B×E] 𝒞/ B×B be the subobject on the weak equivalences (…), and observe that q and q^ factor through this to give a morphism

q^:B IEq(E).\hat q : B^I \to Eq(E) \,.

The fibration EB is univalent in 𝒞 if this morphism is a weak equivalence. By the 2-out-of-3 property, of course, it is equivalent to ask that q:BEq(E) be a weak equivalence.

(…)

In simplicial sets

We specialize the general discussion above to the realization in 𝒞= sSet, equipped with the standard model structure on simplicial sets.

For EX any fibration (Kan fibration) between fibrant objects (Kan complexes), consider first the simplicial set

[E×B,B×E] B×BsSet/ B×B[E \times B , B \times E]_{B \times B} \in sSet/_{B \times B}

defined as the internal hom in the slice category sSet/ B×B.

Notice that the vertices of this simplicial set over a fixed pair (b 1,b 2):*B×B of vertices in B form the set of morphisms E b 1E b 2 between the fibers in sSet.

This is because – by the defining property of the internal hom in the slice and using that products in sSet/ B×B are pullbacks in sSet – the horizontal morphisms of simplcial sets in

* [E×B,B×E] B×B (b 1,b 2) B×B\array{ * &&\to&& [E \times B, B \times E]_{B \times B} \\ & {}_{\mathllap{(b_1,b_2)}}\searrow && \swarrow \\ && B \times B }

correspond bijectively to the horizontal morphisms in

E b 1×{b 2} {b 1}×E b 2 B×B\array{ E_{b_1} \times \{b_2\} &&\to&& \{b_1\} \times E_{b_2} \\ & \searrow && \swarrow \\ && B \times B }

in sSet, which are precisely morphisms E b 1E b 2.

Let then

Eq(E)[E×B,B×E] B×BsSet/ B×BEq(E) \hookrightarrow [E \times B, B \times E]_{B \times B} \in sSet/_{B \times B}

be the full sub-simplicial set on those vertices that correspond to weak equivalences ((weak) homotopy equivalences).

By a similar consideration, one sees that the diagonal morphism Δ B:BB×B in sSet, regarded as an object BsSet/ B×B, comes with a canonical morphism

BEq(E).B \to Eq(E) \,.

The fibration EB is univalent, precisely when this morphism is a weak equivalence.

This appears originally as Voevodsky, def. 3.4

In simplicial presheaves

(…)

Properties

The univalence axiom implies function extensionality.

A commented version of a formal proof of this fact can be found in (Bauer-Lumsdaine).

Univalence is essentially the same as the “completeness” condition in the theory of Segal spaces/semi-Segal spaces. See at complete Segal space/_complete semi-Segal space_.

References

The univalence axiom was introduced and promoted by Vladimir Voevodsky around 2005. (?)

A quick survey is for instance in

An exposition is at

An accessible account of Voevodsky’s proof that the universal Kan fibration in simplicial sets is univalent is at

A quick elegant proof of the object classifier/universal associated infinity-bundle in simplicial sets/-groupoids is in

The HoTT-Coq code is at

A guided walk through the formal proof that univalence implies functional extensionality is at

A discussion of univalence in categories of presheaves over an inverse category with values in a category for which univalence is already established is discussed in

The computational interpretation of univalence / canonicity is discussed in

Univalence is claimed to be established in all (infinity,1)-toposes, their presentations by type-theoretic model categories as well as further cases of locally cartesian closed (infinity,1)-categories in

For more references see homotopy type theory.

Revised on May 17, 2013 12:38:27 by Urs Schreiber (82.169.65.155)