nLab W-type

Idea

A W-type is a set or type which is defined inductively in a well-founded way based on a type of “constructors” and a type of “arities”, with one constructor having a certain canonical form. As such it is a particular kind of 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, with multiple constructors that are assumed only to be strictly positive, can be reduced to W-types, at least in the presence of other structure such as sum types and function extensionality; see for instance 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 we remove the requirement that the trees are well-founded, we obtain instead a kind of coinductive type called an M-type (presumably since “M” is like a “W” upside down).

Definition

Actually, there are two slightly different formulations of W-types.

W-types in categories

Plain version

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

$$\mathcal{C} \overset{A^*}{\longrightarrow} \mathcal{C}_{/A} \overset{\Pi_f}{\longrightarrow} \mathcal{C}_{/B} \overset{\Sigma_B}{\longrightarrow} \mathcal{C} \,,$$

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:

$$F(Y) = A_n \times Y^{\times n} + \dots + A_1 \times Y + A_0$$

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).

Dependent W-types

The above has a natural generalization to dependent or indexed W-types (Gambino-Hyland 04) with a type $C$ of indices:

given a diagram of the form

$$\array{ A &\stackrel{f}{\longrightarrow}& B \\ \downarrow^{\mathrlap{h}} && \downarrow^{\mathrlap{g}} \\ C && C }$$

there is the dependent polynomial functor

$$\mathcal{C}_{/C} \overset{h^\ast}{\longrightarrow} \mathcal{C}_{/A} \overset{\Pi_f}{\longrightarrow} \mathcal{C}_{/B} \overset{\Sigma_g}{\longrightarrow} \mathcal{C}_{/C} \,,$$

This reduces to the above for $C = \ast$ the terminal object.

Notice that we do not necessarily have $g f = h$, so this is not just simply a polynomial endofunctor of $\mathcal{C}/_{C}$ considered as a lccc in its own right. If we do have $g f = h$, then $C$ is called a type of parameters instead of indices.

W-types in type theory

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

$$\frac{A:Type\; x:A\vdash B(x):Type}{(W x:A)B(x):Type}$$

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

$$\frac{a:A\; t:B(a)\to W}{sup(a,t):W}$$

(3) $W$-elimination rule

$$\frac{\array{w:W\vdash C(w):Type\\ x:A, u:B(x)\to W, v:(\Pi y:B(x))C(u(y))\vdash\\ c(x,u,v):C(sup(x,u))}}{w:W\vdash wrec(w,c):C(w)}$$

(4) $W$-computation rule

$$\frac{\array{w:W\vdash C(w):Type\\ x:A, u:B(x)\to W, v:(\Pi y:B(x))C(u(y))\vdash\\ c(x,u,v):C(sup(x,u))}}{\array{ x:A, u:B(x)\to W\vdash wrec(sup(x,u),c)=\\ c(x,u,\lambda y.wrec(u(y),c)):C(sup(x,u))}}$$

(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, it seems that $q$ must also be a display map, in order to define $\Sigma_q$. However, using adjointness, one can still define the W-type even if $q$ is not a display map. This more general version is what in type theory is called an indexed W-type; if $q$ is a display map then one sometimes refers to non-uniform parameters instead of indices. (By contrast, uniform parameters are the kind discussed above where $g f = h$, so that the entire construction takes place in a single slice category This is an instance of the red herring principle, since non-uniform parameters are not really parameters at all, but a special kind of indices.) For example, identity types are indexed W-types but not parametrized ones (even non-uniformly); see this blog post.)

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.

Properties

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).

Related concepts

• M-type

• predicative topos

type, type theory

• propositions as types, inductive type, W-type

• empty type, unit type

• pointed type

dependent type, dependent type theory, Martin-Löf dependent type theory

• dependent sum type, dependent product type

homotopy type, homotopy type theory

• identity type, dependent identity type

• homotopy n-type, connected type

• higher inductive type

• geometric homotopy type, cohesive homotopy type

References

The original definition in type theory is due to

• Per Martin-Löf, Intuitionistic Type Theory, Notes by G. Sambin of a series of lectures given in Padua, 1980. Bibliopolis, 1984.

The categorical semantics of W-types by initial algebras of polynomial endofunctors is due to

• Ieke Moerdijk, Erik Palmgren, Wellfounded trees in categories, Annals of Pure and Applied Logic 104 (2000) 189 – 218 (web)

• Benno van den Berg, Ieke Moerdijk (2008-09-25); $W$-types in sheaves; vdBM_Wtypes.ps/pdf

Dependent W-type were introduced in

• Nicola Gambino, Martin Hyland, Wellfounded trees and dependent polynomial functors. In Types for proofs and programs, volume 3085 of Lecture Notes in Comput. Sci., pages 210–225. Springer-Verlag, Berlin, 2004 (web)

Related work is:

• Michael Abbott?, Thorsten Altenkirch, and Neil Ghani, Representing Nested Inductive Types using W-types (pdf)

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.

• Christian Sattler, On relating indexed W-types with ordinary ones, 2015 PDF

A formal proof about the h-level of W-types is discussed in

• Nils Anders Danielsson, Positive h-levels are closed under W (web)

and also in

• Jasper Hugunin, IWTypes, https://github.com/jashug/IWTypes

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

• Benno van den Berg, Ieke Moerdijk, W-types in Homotopy Type Theory (arXiv:1307.2765)

W-types in Coq wiki