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
homotopy theory, (∞,1)-category theory, homotopy type theory
flavors: stable, equivariant, rational, p-adic, proper, geometric, cohesive, directed…
models: topological, simplicial, localic, …
see also algebraic topology
Introductions
Definitions
Paths and cylinders
Homotopy groups
Basic facts
Theorems
In dependent type theory with identity types, equivalence types, and dependent function types, equivalence extensionality characterizes the identity type of equivalence types and is the property that for all equivalences and , there are equivalences
Equivalence extensionality is equivalent to function extensionality.
Function extensionality implies equivalence extensionality because, in the presence of function extensionality, the property of being an equivalence is a proposition.
For the converse, we show that equivalence extensionality implies weak function extensionality (which implies function extensionality). Let be a type and be a family of contractible types indexed by . The projection map is an equivalence. By equivalence extensionality, it follows that post-composition with defines an equivalence . In particular, the fiber of at the identity equivalence is contractible. One can show (again using equivalence extensionality) that is a retract of the fiber of at : there is a section sending to and a retraction sending with to (modulo transport). Thus is also contractible.
Proof that equivalence extensionality implies function extensionality in Agda:
Last revised on March 24, 2025 at 12:39:40. See the history of this page for a list of all contributions to it.