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
A W-type is a set or type which is defined inductively in a well-founded way – an inductive type. In most set theories, W-types can be proven to exist, but in predicative mathematics or type theory, where this is not the case, they are often assumed explicitly to exist. In particular W-types can be used to provide a constructive counterpart of the classical notion of a well-ordering and to uniformly define a variety of inductive types. More complex inductive types, such as strictly positive inductive types, can be reduced to W-types; see AAG. This can even be extended to inductive families.
The terms/elements of a W-type can be considered to be “rooted well-founded trees” with a certain branching type; different W-types are distinguished by their branching signatures. A branching signature is represented essentially by a family of sets $\{A_b\}_{b\in B}$ which can be interpreted as requiring that each node of the tree is labeled with an element of the set $B$, and that if a node is labeled by $b$ then it has exactly ${|A_b|}$ outgoing edges, each labeled by an element of $A_b$. From a more computational point of view, the W-type can be viewed as a data type, where $B$ indexes the set of constructors and $A_b$ is the arity of the constructor $b$.
If the trees are not required to be well-founded, we obtain instead a coinductively defined type, called a “co-W-type” or an M-type.
(1) The most basic W-type is the natural numbers. Here there are two constructors:
(2) Similarly, if $X$ is any set, then the W-type $L X$ of lists of elements of $X$ has $|X|+1$ constructors:
(3) identity types arise as a more general kind of W-type; see this blog post.
Actually, there are two slightly different formulations of W-types.
This version of W-types is the most natural for mathematicians used to thinking in terms of set theory or category theory, the categorical semantics of W-types, due to (Moerdijk-Palmgren 00).
Here we describe a W-type as the initial algebra for an endofunctor. The family $\{A_b\}_{b\in B}$ can be thought of as a morphism $f\colon A\to B$ in some category $\mathcal{C}$ (the fiber over $b\in B$ being $A_b$), and the endofunctor in question is the composite
where $A^*$ is context extension, hence is the pullback functor (a.k.a. $A\times -$), $\Pi_f$ is a dependent product, and $\Sigma_B$ is a dependent sum (a.k.a. the forgetful functor from $\mathcal{C}_{/B}$ to $\mathcal{C}$).
Such a composite is called a polynomial endofunctor.
This definition makes sense in any locally cartesian closed category, although the W-type (the initial algebra) may or may not exist in any given such category. (A non-elementary construction of them is given by the transfinite construction of free algebras.)
This definition is most useful when the category $\mathcal{C}$ is not just locally cartesian closed but is a Π-pretopos, since often we want to use at least coproducts in constructing $A$ and $B$. For example, a natural numbers object is a W-type specified by one of the coproduct inclusions $1\to 1+1$, and the list object $L X$ is a W-type specified by $X\to X+1$. More generally, endofunctors that look like polynomials in the traditional sense:
can be constructed as polynomial endofunctors in the above sense in any $\Pi$-pretopos. A $\Pi$-pretopos in which all W-types exist is called a ΠW-pretopos.
In a topos with a natural numbers object (NNO), W-types for any polynomial endofunctor can be constructed as certain sets of well-founded trees; thus every topos with a NNO is a ΠW-pretopos. This applies in particular in the topos Set (unless one is a predicativist, in which case $Set$ is not a topos and W-types in it must be postulated explicitly).
The above has a natural generalization to dependent W-types (Gambino-Hyland 04):
given a diagram of the form
there is the dependent polynomial functor
This reduces to the above for $C = \ast$ the terminal object. Notice that we do not necessarily have $g f \simeq h$, so this is not just simply a polynomial endofunctor of $\mathcal{C}/_{C}$ considered as a lccc in its own right.
In type theory, W-types are introduced by giving explicit constructors and destructors, a.k.a. term introduction and term elimination rules. If the type theory is extensional, i.e. identities have unique proofs and (dependent) function types are extensional ($f=g$ if and only if $f(x)=g(x)$ for all $x$), then this is more or less equivalent to the categorical version given above. The type theories that are the internal logic of familiar kinds of categories are all extensional in this sense.
The rules for $W$-types in extensional type theory are the following:
(1) $W$-formation rule
Andreas Abel: A and B are used exactly the other way round in the introductory text to this page. (Before, A was the arity, now B is the arity.) Harmonize!?
In the following we will sometimes abbreviate $(W x:A)B(x)$ by $W$.
(2) $W$-introduction rule
(3) $W$-elimination rule
(4) $W$-computation rule
(Awodey-Gambino-Sojakova §2, originally from Martin-Löf)
The main distinction from the naive categorical theory above is that the map $f$ (from the lines above the rules) must be assumed to be a display map, i.e. to exhibit $A$ as a dependent type over $B$, in order that the dependent product $\Pi_f$ be defined. In the case of dependent polynomial functors, $q$ must also be a display map in order to define $\Sigma_q$. (Actually, using adjointness, one can still define the W-type even if $q$ is not a display map, but its properties are not as good. This extra generality is important, however. For example, identity types arise as this more general kind of W-type; see this blog post.)
Mike Shulman: Is the term “W-type” still used in this generality? Or are they just called “inductive types”?
Note also that in intensional type theory, a W-type is only an initial algebra with respect to propositional equality, not definitional equality. In particular, the constructors are injective only propositionally, not definitionally. This applies already for the natural numbers.
In homotopy type theory, if $A$ as h-level $n\geq -1$, then $W A B$ has h-level $n$ (as it should be for (infinity,1)-colimits). A formal proof of this is discussed in (Danielsson).
The original definition in type theory is due to
The categorical semantics of W-types by initial algebras of polynomial endofunctors is due to
Dependent W-type were introduced in
Related work is:
Discussion in relation to identity types and homotopy type theory is in
Steve Awodey, Nicola Gambino, Kristina Sojakova, Inductive types in homotopy type theory (arXiv:1201.3898)
Steve Awodey, Nicola Gambino, Kristina Sojakova, Homotopy-initial algebras in type theory (arXiv:1504.05531)
Work towards dependent W-types in HoTT is here; see also inductive families.
A formal proof about the h-level of W-types is discussed in
and also in
which also computes the identity types of W-types (and more generally indexed W-types).
Discussion of W-types in homotopy type theory, or rather in model categories presenting homotopy theories, is in
Last revised on February 1, 2021 at 16:33:49. See the history of this page for a list of all contributions to it.