natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism = propositions as types +programs as proofs +relation type theory/category theory
equality (definitional, propositional, computational, judgemental, extensional, intensional, decidable)
isomorphism, weak equivalence, homotopy equivalence, weak homotopy equivalence, equivalence in an (∞,1)-category
Examples.
(in category theory/type theory/computer science)
of all homotopy types
of (-1)-truncated types/h-propositions
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 , then between two types we also have an identity type . 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 of some sort is commonly said to be universal if every other bundle of the same sort is a pullback of 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 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 ).
We state univalence first in (intensional) type theory and then in its categorical semantics.
Let and be types. There is a canonically defined map from the identity type of paths (in Type) between them to the function type 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 to the identity equivalence of .
Univalence: For any two types , this map 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.)
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
corresponds to a morphism in that is a fibration between fibrant objects.
Then the dependent function type
is interpreted as the internal hom in the slice category after extending to the context by pulling back along the two projections , respectively. Hence this is interpreted as
Consider then the diagonal morphism in as an object of . We would like to define a morphism
in . By the defining (product internal hom)-adjunction, it suffices to define a morphism
in . But now by the universal property of pullback, it suffices to define just in a morphism
And since the composite pullback along either composite
is the identity, both and are isomorphic to ; thus here we can take the identity morphism.
Now, using the path object factorization in
by an acyclic cofibration followed by a fibration, we obtain a fibrant replacement of in the slice model category .
Since also is fibrant by the axioms on the locally cartesian closed model category , we have a lift in the diagram in
This lift is the interpretation of the path induction that deduces a map on all paths from one on just the identity paths .
Finally, let be the subobject on the weak equivalences (…), and observe that and factor through this to give a morphism
The fibration 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 be a weak equivalence.
(…)
We specialize the general discussion above to the realization in sSet, equipped with the standard model structure on simplicial sets.
For any fibration (Kan fibration) between fibrant objects (Kan complexes), consider first the simplicial set
defined as the internal hom in the slice category .
Notice that the vertices of this simplicial set over a fixed pair of vertices in form the set of morphisms between the fibers in .
This is because – by the defining property of the internal hom in the slice and using that products in are pullbacks in – the horizontal morphisms of simplcial sets in
correspond bijectively to the horizontal morphisms in
in , which are precisely morphisms .
Let then
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 in , regarded as an object , comes with a canonical morphism
The fibration is univalent, precisely when this morphism is a weak equivalence.
This appears originally as Voevodsky, def. 3.4
(…)
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_.
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
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
Dan Licata, Robert Harper, Computing with Univalence (2012) (pdf)
Robert Harper, Daniel Licata, Canonicity for 2-dimensional type theory (2011) (pdf)
Daniel Licata The computational interpretation of HoTT (in 2D), talk at UF-IAS-2012 (video)
Simon Huber (with Thierry Coquand), Towards a computational justification of the Axiom of Univalence , talk at TYPES 2011 (pdf)
Bruno Barras, Thierry Coquand, Simon Huber, A Generalization of Takeuti-Gandy Interpretation (pdf)
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.