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
typical contexts
The principle of functional extensionality states that two functions are equal if their values are equal at every argument.
In set theory, in the same way that the axiom of choice has internal and external versions, depending on whether one uses the external logic? or the internal logic of the set theory, function extensionality also has internal and external versions.
In set theory, let $\mathbb{1}$ denote the unique singleton up to bijection. There are multiple notions of external function extensionality, due to the different possible notions of function and element in set theory:
for all sets $A$ and $B$ and functions $f:A \to B$ and $g:A \to B$, $f = g$ if and only if for all elements $x \in A$, $f(x) = g(x)$.
for all sets $A$ and $B$ and functions $f:A \to B$ and $g:A \to B$, $f = g$ if and only if for all functions $x:\mathbb{1} \to A$, $f \circ x = g \circ x$.
for all sets $A$ and $B$ and elements of the function set $f \in B^A$ and $g \in B^A$, $f = g$ if and only if for all elements $x \in A$, $\mathrm{ev}_{A, B}(f, x) = \mathrm{ev}_{A, B}(g, x)$.
for all sets $A$ and $B$ and elements of the function set $f \in B^A$ and $g \in B^A$, $f = g$ if and only if for all elements of the function set $x \in A^\mathbb{1}$, $\mathrm{comp}_{\mathbb{1}, A, B}(f, x) = \mathrm{comp}_{\mathbb{1}, A, B}(g, x)$.
The first is the one most commonly found in foundations of categorical set theories with separate notions of element and function. The second is the one most commonly found in foundations of categorical set theories where an element is defined as a function out of the terminal set $\mathbb{1}$.
The first and the third notions of function extensionality are equivalent to each other, since for every set theory with function sets, the category of sets is a cartesian closed category, which means that there is a bijection between the hom-sets
and thus for every function $f:X \to Y$ there is a unique element of a function set $[f] \in Y^X$, and for every element of a function set $g \in Y^X$ there is a unique function $g':X \to Y$.
In set theory, let $\mathbb{1}$ denote the unique singleton up to bijection and let $\prod_{x \in A} B_x$ denote the Cartesian product of a family of sets $(B_x)_{x \in A}$. For all sets $A$, let $\Delta_{A}:A \to A \times A$ denote the diagonal function; this means that the preimage of $\Delta_{A}$ at $(x, y) \in A \times A$, $\Delta_{A}^*(x, y)$, is a subsingleton, and $(\Delta_{A}^*(x, y))_{x \in A, y \in A}$ is a family of sets.
The principle of internal function extensionality is given by one of the two equivalent statements:
given sets $A$ and $B$, one can derive the element of the set
given sets $A$ and $B$, one can derive the element of the set
This is the set theoretic analogue of the axiom of function extensionality found in dependent type theories, where functions are elements of function types, the type theoretic analogue of function sets, and equalities are represented by identity types, the type theoretic analogue of the diagonal one-to-one correspondence, and is true in any set theory with Cartesian products of arbitrary families of sets as well as function sets.
There are multiple ways to extend the set-theoretic definition of external function extensionality from the category of sets to more general categories.
The first notion of external function extensionality extends from the category of sets to any concrete category $C$, where objects are specific kinds of sets (such as groups, rings, topological spaces, et cetera) and morphisms are specific kinds of functions between sets (such as group homomorphisms, ring homomorphisms, continuous maps, et cetera).
The second notion of external function extensionality extends from the category of sets to any well-pointed category $C$, and corresponds to the statement that the terminal object is an extremal generator in category, and is one of the conditions for making a pretopos a well-pointed pretopos. This definition is satisfied in any concrete category $\mathcal{C}$. This is not the same as the first notion of external function extensionality, since not every concrete category is well-pointed, and not every well-pointed category is concrete: Grp is concrete but not well-pointed, while an arbitrary model of ETCS is well-pointed but not necessarily concrete.
The third and fourth notions of external function extensionality extends from the category of sets to any concrete cartesian closed category $C$, and is equivalent to the first notion in any concrete cartesian closed category.
None of these notions are called “function extensionality” in category theory. The term “function extensionality” is reserved for the generalization of internal function extensionality to arbitrary categories, as documented in the next section.
The notion of function extensionality in a category arises from the generalization of the set-theoretic definition of internal function extensionality from the category of sets to more general categories. In particular, similar to internal function extensionality, it is the logical formulation of function extensionality in the internal language of the category. The “internal” formulation can be interpreted in a category with a rich enough internal language. For instance, function extensionality can be stated in the Mitchell-Benabou language and is true in any topos. So every topos internally satisfies function extensionality despite the fact that toposes do not generally satisfy the external notion of being concrete or well-pointed. This is because the quantifier $\forall x:X$ in the internal language is interpreted as a quantification over all generalized elements $I \to X$ rather than merely the global elements $1 \to X$. Then the statement when quantifying over generalized elements is true as a consequence of the definition of an exponential object.
In intensional type theory, the notion of equality $a = a'$ is replaced by identifications, these being terms of identity type $Id_A(a,a')$. Since such identity type are in general not mere propositions, care needs to be exercised in stating function extensionality in intensional type theory:
For types $A, B \,\colon\, Type$ and parallel functions $f, g \,\colon\, A \to B$, there are the following two canonical functions (from identity types of function types to dependent products of pointwise identity types), which one may use for expressing function extensionality (2), both defined via path induction (see function application to identifications) as shown now:
(These two definitions of $\mathrm{happly}$ become the same under singleton contractibility. The second definition behaves better with the function application to identifications.)
In general, both functions $\mathrm{happly}(f, g)$ are not equivalences of types in intensional type theory: two functions could be defined in different ways, and thus be intensionally different, yet produce the same values on all inputs (i.e. be extensionally the same).
Function extensionality is then the statement that the function $\mathrm{happly}(f, g)$ (1) is an equivalence of types after all, for all functions $f, g \,\colon\,A \to B$:
(e.g. UFP13 (2.9.1)).
In the generality of dependent functions $f,g \,:\, (d \colon D) \to C_d$ (using the notation here) this reads:
(In this dependent generality this is a special case of UFP13, Lem. 2.9.7.)
Compare this to the analogous extensionality principle for dependent pairs (see there):
One could replace the equivalences of types above with judgmental equality of types, which results in judgmental function extensionality. Applied to each definition, judgmental function extensionality states that for all all types $A$ and $B$ and functions $f:A \to B$ and $g:A \to B$
and
respectively.
Suppose that given functions $f:A \to B$ and $g:A \to B$, for all $x:A$, $f(x)$ and $g(x)$ are judgmentally equal to each other $f(x) \equiv g(x):B$. Then it follows that $f$ and $g$ are judgmentally equal to each other, $f \equiv g:A \to B$, and thus function extensionality holds. This result is crucial in the proof of function extensionality from an interval type with judgmental computation rules.
There are a number of axioms in dependent type theory which imply function extensionality. These include
Function extensionality is equivalent to weak function extensionality – see at References – General.
In homotopy type theory, the univalence axiom implies type-theoretic function extensionality (2) – see at References – in HoTT.
Postulating an interval type with judgmental computation rules for the point constructors of the interval type implies function extensionality.
The proof assumes a typal uniqueness rule for function types. Let $\mathrm{ap}_f \colon Id_{\mathbb{I}}(0, 1) \to Id_A(f(0),f(1))$ be the function application to identities, $\mathrm{concat}_{a, b, c}: Id_A(a , b) \times Id_A(b , c) \to Id_A(a , c)$ be concatenation of identities (i.e. transitivity), and $\mathrm{inv}_{a, b}: Id_A(a , b) \to Id_A(b , a)$ be the inverse of identities (i.e. symmetry).
First the proof constructs a function $k:A \to (\mathbb{I} \to B)$ from a dependent function $h:\prod_{x:A} Id_B\big(f(x) , g(x)\big)$, inductively defined by
$\beta_{k(x)}^0 : Id_B\big(k(x)(0) , f(x)\big)$
$\beta_{k(x)}^1 : Id_B\big( k(x)(1) , g(x) \big)$
$\beta_{k(x)}^p : Id_{Id_B\big(k(x)(0) , k(x)(1)\big)}\big(\mathrm{ap}_{k(x)}(p) , \mathrm{concat}_{k(x)(0), f(x), k(x)(1)}(\mathrm{concat}_{k(x)(0), f(x), g(x)}(\beta_{k(x)}^0, h(x)), \mathrm{inv}_{k(x)(1), g(x)}(\beta_{k(x)}^1))\big)$
Then it uses the properties of function types, product types, currying, uncurrying, and the symmetry of products $A \times B \simeq B \times A$, to construct a function $k':\mathbb{I} \to (A \to B)$, inductively defined by
$\beta_{k'}^0(x): Id_B\big( k'(0)(x) , f(x)\big)$
$\beta_{k'}^1(x): Id_B\big( k'(1)(x) , g(x) \big)$
$\beta_{k'}^p(x):\mathrm{ap}_{k'}(p)(x) =_{Id_B\big( k'(0)(x) , k'(1)(x) \big)} \mathrm{concat}_{k'(0)(x), f(x), k'(1)(x)}(\mathrm{concat}_{k'(0)(x), f(x), g(x)}(\beta_{k'}^0(x), h(x)), \mathrm{inv}_{k'(1)(x), g(x)}(\beta_{k'}^1(x)))$
If the interval type has judgmental computation rules for the point constructors, then $k'(x)(0) \equiv f(x)$ and $k'(x)(1) \equiv g(x)$ for all $x:A$, which implies that $k'(0)(x) \equiv f(x)$ and $k'(1)(x) \equiv g(x)$ for all $x:A$, and subsequently that $k'(0) \equiv f$ and $k'(1) \equiv g$. This means that there are identities $\beta_{k'}^0:k'(0) =_{A \to B} f$ and $\beta_{k'}^1:k'(1) =_{A \to B} g$, and an identity
thus proving function extensionality.
An interval type with only typal computation rules for the point constructors does not imply function extensionality. This is because the proof with the judgmental computation rules uses the fact that $k'(0)(x) \equiv f(x)$ and $k'(1)(x) \equiv g(x)$ for all $x:A$ implies that $k'(0) \equiv f$ and $k'(1) \equiv g$. However, if the computation rules are typal, then the equivalent statement is that having identities $\beta_{k'}^0(x): Id_B\big(k'(0)(x) , f(x)\big)$ and $\beta_{k'}^1(x): Id_B\big(k'(1)(x) , g(x)\big)$ for all $x:A$ implies that there are identities $\beta_{k'}^0: Id_{(A \to B)}\big(k'(0) , f\big)$ and $\beta_{k'}^1 : Id_{A \to B}\big(k'(1) , g\big)$, which is precisely function extensionality, and so cannot be used to prove function extensionality.
To do: write how extensional type theory automatically satisfies function extensionality.
…
To do: write how requiring all types to be mere propositions in dependent type theory, such as in propositional logic as a dependent type theory automatically satisfies function extensionality.
…
Under the standard relation between type theory and category theory, the categorical semantics of the type $\underset{x \colon X}{\prod} Id_Y\big( f(x),\, g(x) \big)$ of pointwise identifications between a pair of parallel functions $f,g \;\colon\; X \to Y$ is the space of sections over (hence the right base change along) $X$ of the pullback
where
$X,Y$ now denote objects in any given ambient categorical model of dependent types which serve as the categorical semantics for the types of the same name,
$Paths(Y)$ denotes any “very good” path space object (see there) of $Y$.
Since the right base change is right adjoint to pullback, this means that the categorical semantics of global elements of $\underset{x \colon X}{\prod} Id_Y\big( f(x),\, g(x) \big)$, whose immediate categorical semantics is as maps out of the terminal object (to be denoted “$\ast$”):
is equivalently given by maps of the form
These in turn (now by the defining universal property of the pullback) are equivalent to maps of the form
hence to lifts of $(f,g)$ through the path fibration display map.
In contrast, the categorical semantics of the global type of identifications $Id_{(X \to Y)}(f,g)$ is by maps of the form
where
$Maps(X,Y)$ denotes the internal hom in the ambient categorical model of dependent types —
if one assumes a cartesian closure, then this is equivalently denoted as an exponential objects: $Y^X$.
So the categorical semantics of function extensionality (2) says in particular that there is a map
which serves to lift global elements as above.
Of course we are not just interested in global elements here. What we really want is an actual section $Maps\big(X, Paths(Y)\big) \to Paths\big(Maps(X,Y)\big)$ of $\phi$ in the slice over $Maps\big(X, (Y \times Y)\big)$ (although this can be derived from the global element formulation by using the Yoneda lemma together with currying and uncurrying tricks), such that this exhibits a weak equivalence.
Function extensionality holds in the internal type theory of a type-theoretic fibration category precisely if dependent products (i.e. right base change) along fibrations preserve acyclic fibrations.
The condition in prop. holds in particular in right proper Cisinski model structures, since in these right base change along fibrations is a right Quillen functor (see e.g. the proof here).
Notice that every presentable locally Cartesian closed (∞,1)-category (by the discussion there) has a presentation by a right proper Cisinski model category. Accordingly we may say that every presentable locally Cartesian closed (∞,1)-category interprets HoTT+FunExt.
Discussion of variants of function extensionality in Martin-Löf type theory, and their relation:
Richard Garner, On the strength of dependent products in the type theory of Martin-Löf, Annals of Pure and Applied Logic 160 1 (2009) 1-12 [arXiv:0803.4466, doi:10.1016/j.apal.2008.12.003]
Peter LeFanu Lumsdaine, Strong functional extensionality from weak (2011) [blog post]
Proofs of function extensionality from an interval type with judgmental computation rules:
Discussion of function extensionality in homotopy type theory and proof that it is implied by univalence:
Original announcement in:
Textbook accounts:
Univalent Foundations Project, §2.9 & §4.9 Homotopy Type Theory – Univalent Foundations of Mathematics (2013) [web, pdf]
Egbert Rijke, §13 in: Introduction to Homotopy Type Theory, Cambridge Studies in Advanced Mathematics, Cambridge University Press [arXiv:2212.11082]
Exposition:
Tutorial for formalization in Coq:
Formalization in cubical Agda:
Discussion of the categorical semantics in the context of homotopy type theory:
On definitional function extensionality in higher observational type theory:
Last revised on March 11, 2024 at 18:17:42. See the history of this page for a list of all contributions to it.