Natural numbers objects

The definition of a natural numbers object a priori only allows for recursively defined morphisms in which the next value Φ(s(n))\Phi(s(n)) depends only on the previous value Φ(n)\Phi(n). In many cases, however, we would also like to use nn itself to define Φ(s(n))\Phi(s(n)). This can be done in categories with finite products:

Lemma 1.

Let (N,z,s)(N,z,s) be a natural numbers object in a category with finite products. Then for every a:1→Xa : 1 \to X and every g:N×X→Xg : N \times X \to X there exists a unique morphism Φ:N→X\Phi : N \to X such that Φ(z)=a\Phi(z) = a and Φ(s(n))=g(n,Φ(n))\Phi(s(n)) = g(n, \Phi(n)).

Here, we use element notation to simplify the exposition. For example, the equation Φ(s(n))=g(n,Φ(n))\Phi(s(n)) = g(n,\Phi(n)) means that the following diagram commutes:

N→sN(id⁡N,Φ)↓↓ΦN×X→gX \begin{CD} N @>{s}>> N \\ @V{(\id_N,\Phi)}VV @VV{\Phi}V \\ N \times X @>>{g}> X \end{CD}

Proof. Define the morphism b:1→N×Xb : 1 \to N \times X by b≔(z,a)b \coloneqq (z,a) and the morphism h:N×X→N×Xh : N \times X \to N \times X by h(n,x)≔(s(n),g(n,x))h(n,x) \coloneqq (s(n),g(n,x)). By the universal property of (N,z,s)(N,z,s), there is a unique morphism Ψ:N→N×X\Psi : N \to N \times X such that:

  • Ψ(z)=b\Psi(z) = b
  • Ψ(s(n))=h(Ψ(n))\Psi(s(n)) = h(\Psi(n))

Write Ψ(n)=(Ψ0(n),Ψ1(n))\Psi(n) = (\Psi_0(n),\Psi_1(n)), where Ψ0:N→N\Psi_0 : N \to N and Ψ1:N→X\Psi_1 : N \to X. The two equations above then become:

  • Ψ0(z)=z\Psi_0(z) = z
  • Ψ0(s(n))=s(Ψ0(n))\Psi_0(s(n)) = s(\Psi_0(n))
  • Ψ1(z)=a\Psi_1(z) = a
  • Ψ1(s(n))=g(Ψ0(n),Ψ1(n))\Psi_1(s(n)) = g(\Psi_0(n),\Psi_1(n))

The uniqueness in the universal property of (N,z,s)(N,z,s) implies Ψ0=id⁡N\Psi_0 = \id_N. Therefore, Φ≔Ψ1\Phi \coloneqq \Psi_1 is the unique morphism Φ:N→X\Phi : N \to X satisfying Φ(z)=a\Phi(z)=a and Φ(s(n))=g(n,Φ(n))\Phi(s(n)) = g(n,\Phi(n)). □\square

The next result appears in Johnstone, Part A, Lemma 2.5.5. Our proof is slightly more concise because we have extracted Lemma 1.

Lemma 2.

Let (N,z,s)(N,z,s) be a natural numbers object in a category with finite products. Then 1→zN←sN1 \xrightarrow{z} N \xleftarrow{s} N is a coproduct cocone. Thus, N≅1⊔NN \cong 1 \sqcup N.

Proof. Let a:1→Xa : 1 \to X and b:N→Xb : N \to X be morphisms. We need to show that there is a unique morphism c:N→Xc : N \to X satisfying c(z)=ac(z) = a and c(s(n))=b(n)c(s(n)) = b(n). This follows by applying Lemma 1 to the morphism g:N×X→Xg : N \times X \to X defined by g(n,x)≔b(n)g(n,x) \coloneqq b(n). □\square

Next, we will check when the terminal object 11 itself is a natural numbers object. In that case, z:1→1z : 1 \to 1 and s:1→1s : 1 \to 1 are necessarily equal to id⁡1\id_1.

Lemma 3.

Let 11 be a terminal object in a category. Then (1,id⁡1,id⁡1)(1,\id_1,\id_1) is a natural numbers object if and only if for every endomorphism g:X→Xg : X \to X and every morphism a:1→Xa : 1 \to X we have g∘a=ag \circ a = a. If the category has finite products, (1,id⁡1,id⁡1)(1,\id_1,\id_1) is a parametrized natural numbers object if and only if g=id⁡Xg = \id_X for every endomorphism g:X→Xg : X \to X, i.e. the category is one-way.

Proof. The first statement is immediate from the definition of a natural numbers object. For the second, (1,id⁡1,id⁡1)(1,\id_1,\id_1) is a parametrized natural numbers object if and only if, for all morphisms f:A→Xf : A \to X and all endomorphisms g:X→Xg : X \to X, there is a unique morphism Φ:A→X\Phi : A \to X such that Φ∘id⁡A=f\Phi \circ \id_A = f and Φ∘id⁡A=g∘Φ\Phi \circ \id_A = g \circ \Phi. These equations simplify to Φ=f\Phi = f and f=g∘ff = g \circ f. Since this must hold for every f:A→Xf : A \to X, we must have g=id⁡Xg = \id_X (by the Yoneda Lemma or by a direct argument). □\square

Next, we prove a partial converse to the result that countably distributive categories have a parametrized natural numbers object.

Lemma 4.

Let C\C be a category with finite products, countable copowers denoted ⊗\otimes, and a parametrized natural numbers object 1→zN→sN1 \xrightarrow{z} N \xrightarrow{s} N. Then there is an isomorphism N≅N⊗1N \cong \IN \otimes 1, and for every object AA the natural morphism α:N⊗A→A×(N⊗1)\alpha : \IN \otimes A \to A \times (\IN \otimes 1) is an isomorphism.

Proof. We will use element notation extensively. In particular, for every element a∈Aa \in A and n∈Nn \in \IN, there is an element n⊗a∈N⊗An \otimes a \in \IN \otimes A, formally defined by the nnth coproduct inclusion. The morphism α\alpha is defined by α(n⊗a)=(a,n⊗1).\alpha(n \otimes a) = (a,n \otimes 1).

In any category with a terminal object and countable copowers, we can construct the non-parametrized NNO N⊗1\IN \otimes 1 with the element 0⊗1∈N⊗10 \otimes 1 \in \IN \otimes 1 and the map s:N⊗1→N⊗1,s(n⊗1)≔(n+1)⊗1.s : \IN \otimes 1 \to \IN \otimes 1, \quad s(n \otimes 1) \coloneqq (n+1) \otimes 1. See here for a detailed proof. Since, by assumption, 1→zN→sN1 \xrightarrow{z} N \xrightarrow{s} N is a parametrized NNO, it is also a non-parametrized NNO and is therefore isomorphic to the one just constructed. We may assume without loss of generality that they are equal and hence work with N=N⊗1N = \IN \otimes 1.

Next, apply the parametrized universal property of the NNO to the diagram A→fN⊗A→gN⊗AA \xrightarrow{f} \IN \otimes A \xrightarrow{g} \IN \otimes A defined by f(a)≔0⊗af(a) \coloneqq 0 \otimes a and g(n⊗a)≔(n+1)⊗ag(n \otimes a) \coloneqq (n+1) \otimes a. It gives a morphism Φ:A×N→N⊗A\Phi : A \times N \to \IN \otimes A satisfying Φ(a,0⊗1)=0⊗a,Φ(a,s(m))=g(Φ(a,m)).\Phi(a,0 \otimes 1) = 0 \otimes a, \quad \Phi(a,s(m)) = g(\Phi(a,m)). For m≔n⊗1∈Nm \coloneqq n \otimes 1 \in N, where n∈Nn \in \IN, the second equation becomes Φ(a,(n+1)⊗1)=g(Φ(a,n⊗1)).\Phi(a,(n+1) \otimes 1) = g(\Phi(a,n \otimes 1)). By induction on n∈Nn \in \IN, it follows that Φ(a,n⊗1)=n⊗a,\Phi(a,n \otimes 1) = n \otimes a, which is exactly the statement that Φ∘α=id⁡N⊗A\Phi \circ \alpha = \id_{\IN \otimes A}.

It remains to prove α∘Φ=id⁡A×N\alpha \circ \Phi = \id_{A \times N}. We first observe that α∘g=(id⁡A×s)∘α\alpha \circ g = (\id_A \times s) \circ \alpha as morphisms N⊗A→A×(N⊗1)\IN \otimes A \to A \times (\IN \otimes 1). Indeed, for every n⊗a∈N⊗An \otimes a \in \IN \otimes A, α(g(n⊗a))=α((n+1)⊗a)=(a,(n+1)⊗1),\alpha(g(n \otimes a)) = \alpha((n+1) \otimes a) = (a, (n+1) \otimes 1), while (id⁡A×s)(α(n⊗a))=(id⁡A×s)(a,n⊗1)=(a,(n+1)⊗1).(\id_A \times s)(\alpha(n \otimes a)) = (\id_A \times s)(a, n \otimes 1) = (a, (n+1) \otimes 1). The universal property applied to the diagram A→(id⁡A,z)A×N→id⁡A×sA×NA \xrightarrow{(\id_A,z)} A \times N \xrightarrow{\id_A \times s} A \times N shows that there is a unique morphism Ψ:A×N→A×N\Psi : A \times N \to A \times N satisfying Ψ∘(id⁡A,z)=(id⁡A,z)\Psi \circ (\id_A,z) = (\id_A,z) and Ψ∘(id⁡A×s)=(id⁡A×s)∘Ψ,\Psi \circ (\id_A \times s) = (\id_A \times s) \circ \Psi, namely id⁡A×N\id_{A \times N}. Thus, it suffices to verify that α∘Φ:A×N→A×N\alpha \circ \Phi : A \times N \to A \times N satisfies these two equations. We have α(Φ(a,z))=α(0⊗a)=(a,0⊗1)=(a,z),\alpha(\Phi(a,z)) = \alpha(0 \otimes a) = (a, 0 \otimes 1) = (a,z), and hence α∘Φ∘(id⁡A,z)=(id⁡A,z)\alpha \circ \Phi \circ (\id_A,z) = (\id_A,z). Moreover, α∘Φ∘(id⁡A×s)=α∘g∘Φ=(id⁡A×s)∘α∘Φ.\alpha \circ \Phi \circ (\id_A \times s) = \alpha \circ g \circ \Phi = (\id_A \times s) \circ \alpha \circ \Phi. This finishes the proof. □\square

Remark. Actually, the mentioned result and Lemma 4 can be combined into an equivalent characterization as follows: In a category with finite products and countable copowers, the NNO (which exists, see here) is a parametrized NNO if and only if for all objects AA the canonical morphism ∐n∈NA=∐n∈N(A×1)→A×∐n∈N1\textstyle \coprod_{n \in \IN} A = \coprod_{n \in \IN} (A \times 1) \to A \times \coprod_{n \in \IN} 1 is an isomorphism. This is the precise connection to countable distributivity.

Lemma 5.

Let F:C→DF : \C \to \D be left adjoint to G:D→CG : \D \to \C. Assume that 1C1_{\C} is a terminal object of C\C such that 1D≔F(1C)1_{\D} \coloneqq F(1_{\C}) is a terminal object of D\D. Then FF preserves natural numbers objects. That is, if (N,z,s)(N,z,s) is a natural numbers object in C\C, then its image (F(N),F(z),F(s))(F(N),F(z),F(s)) is a natural numbers object in D\D.

Proof. For a category C\C with a terminal object 1C1_{\C}, let R(C)R(\C) denote the category of diagrams 1C→x0X→rX1_{\C} \xrightarrow{x_0} X \xrightarrow{r} X in C\C. A natural numbers object in C\C is precisely an initial object of R(C)R(\C). Suppose that H:C→DH : \C \to \D is a functor between categories with terminal objects that preserves terminal objects. Then HH induces a functor R(H):R(C)→R(D)R(H) : R(\C) \to R(\D) that maps 1C→x0X→rX1_{\C} \xrightarrow{x_0} X \xrightarrow{r} X to its image 1D≅H(1C)→H(x0)H(X)→H(r)H(X).1_{\D} \cong H(1_{\C}) \xrightarrow{H(x_0)} H(X) \xrightarrow{H(r)} H(X).

In the situation of the lemma, we therefore have two functors

R(F):R(C)→R(D),R(G):R(D)→R(C). \begin{align*} R(F) & : R(\C) \to R(\D),\\ R(G) & : R(\D) \to R(\C). \end{align*}

Notice that GG preserves terminal objects since it is a right adjoint.

We claim that R(F)R(F) is left adjoint to R(G)R(G). Indeed, for objects (X,x0,r)∈R(C)(X,x_0,r) \in R(\C) and (Y,y0,s)∈R(D)(Y,y_0,s) \in R(\D), a morphism R(F)(X,x0,r)→(Y,y0,s)R(F)(X,x_0,r) \to (Y,y_0,s) is the same as a morphism f:F(X)→Yf : F(X) \to Y such that f∘F(x0)=y0,s∘f=f∘F(r).f \circ F(x_0) = y_0, \quad s \circ f = f \circ F(r). Under the adjunction F⊣GF \dashv G, it corresponds to a morphism f~:X→G(Y)\widetilde{f} : X \to G(Y) such that f~∘x0=G(y0),G(s)∘f~=f~∘r.\widetilde{f} \circ x_0 = G(y_0), \quad G(s) \circ \widetilde{f} = \widetilde{f} \circ r. This is precisely a morphism (X,x0,r)→R(G)(Y,y0,s)(X,x_0,r) \to R(G)(Y,y_0,s).

Since R(F)R(F) is a left adjoint, it preserves initial objects. This is precisely the statement that FF preserves natural numbers objects. □\square

Context

This page is referenced by the following categories.

This page is referenced by the following category implications.