CatDat

1\aleph_1-filtered colimits in deloopings

Every (possibly large) monoid MM induces a category BMBM with just one object. We will show that this category has 1\aleph_1-filtered colimits in the cases M=NM = \IN and M=OnM = \On (both respect to addition).

Proposition 1.

The category BNB\IN has 1\aleph_1-filtered colimits.

Proof. Let D:IBND : \I \to B\IN be an 1\aleph_1-filtered diagram. Every two parallel morphisms iji \rightrightarrows j are mapped to the same morphism in BNB \IN, because they are coequalized by some morphism and (N,+)(\IN,+) is cancellative. Hence, DD factors through the preorder reflection of I\I, and we may therefore assume that I\I itself is a preorder. Thus, the diagram consists of numbers D(i,j)ND(i,j) \in \IN for all iji \leq j satisfying

D(j,k)+D(i,j)=D(i,k)D(j,k) + D(i,j) = D(i,k)

for all ijki \leq j \leq k. In particular, D(i,j)D(i,k)D(i,j) \leq D(i,k).

Let iIi \in \I. The set of natural numbers {D(i,k):ki}\{D(i,k) : k \geq i\} is bounded above. Otherwise, for every nNn \in \IN we could find knIk_n \in \I with knik_n \geq i and D(i,kn)nD(i,k_n) \geq n. Since I\I is 1\aleph_1-filtered, the family (kn)nN(k_n)_{n \in \IN} has an upper bound kIk_\infty \in \I. But then

D(i,k)=D(kn,k)+D(i,kn)D(i,kn)nD(i, k_\infty) = D(k_n,k_\infty) + D(i, k_n) \geq D(i, k_n) \geq n

for all nNn \in \IN, contradicting the fact that D(i,k)ND(i,k_\infty) \in \IN.

Therefore, the maximum

uimax{D(i,k):ki}Nu_i \coloneqq \max \{D(i,k) : k \geq i\} \in \IN

is well-defined, which we regard as a morphism in BNB\IN. For iji \leq j we compute

ui=max{D(i,k):ki}=max{D(i,k):kj}=max{D(j,k)+D(i,j):kj}=max{D(j,k):kj}+D(i,j)=uj+D(i,j), \begin{align*} u_i & = \max \{D(i,k) : k \geq i\} \\ & = \max \{D(i,k) : k \geq j\} \\ & = \max \{ D(j,k) + D(i,j) : k \geq j\} \\ & = \max \{D(j,k) : k \geq j\} + D(i,j)\\ & = u_j + D(i,j), \end{align*}

showing that (ui)(u_i) defines a cocone. It is universal: let (vi)(v_i) be another cocone, i.e. viNv_i \in \IN and vi=vj+D(i,j)v_i = v_j + D(i,j) for all iji \leq j. Then viD(i,j)v_i \geq D(i,j) for all iji \leq j, hence viuiv_i \geq u_i. Write vi=wi+uiv_i = w_i + u_i for some uniquely determined wiNw_i \in \IN. For iji \leq j we compute

wj+uj+D(i,j)=vj+D(i,j)=vi=wi+ui=wi+uj+D(i,j),w_j + u_j + D(i,j) = v_j + D(i,j) = v_i = w_i + u_i = w_i + u_j + D(i,j),

hence wj=wiw_j = w_i. Therefore, the wiw_i are constant, and the required factorization follows. \square

Proposition 2.

The category BNB\IN is 1\aleph_1-accessible.

Proof. Based on Proposition 1, it remains to show that the unique object * is 1\aleph_1-presentable, i.e. that for every diagram D:IBND : \I \to B\IN as above, the canonical map

α:colimiIHom(,D(i))Hom(,colimiID(i))\alpha : \colim_{i \in \I} \Hom(*,D(i)) \to \Hom(*,\colim_{i \in \I} D(i))

is bijective. On objects, we necessarily have D(i)=D(i)=* and colimiID(i)=\colim_{i \in \I} D(i)=*. Hence, the codomain of α\alpha is simply N\IN, while the domain consists of equivalence classes [i,n][i,n] of pairs (i,n)I×N(i,n) \in \I \times \IN, where (i,n)(j,m)(i,n) \sim (j,m) iff there exists some ki,jk \geq i,j such that

D(i,k)+n=D(j,k)+m.D(i,k) + n = D(j,k) + m.

By the construction of the colimit cocone, we have

α([i,n])=ui+n=max{D(i,j):ji}+n.\alpha([i,n]) = u_i + n = \max \{D(i,j) : j \geq i\} + n.

(1) The map α\alpha is surjective: Pick some iIi \in \I. Choose jij \geq i such that ui=D(i,j)u_i = D(i,j). For all kjk \geq j we then have

uiD(i,k)=D(j,k)+D(i,j)=D(j,k)+ui,u_i \geq D(i,k) = D(j,k) + D(i,j) = D(j,k) + u_i,

hence D(j,k)=0D(j,k)=0. Therefore, uj=0u_j=0, and thus α([j,n])=n\alpha([j,n]) = n for all nNn \in \IN.

(2) The map α\alpha is injective: Assume that [i,n][i,n] and [j,m][j,m] have the same image. Since I\I is filtered, we may assume i=ji=j. The condition then becomes ui+n=ui+mu_i + n = u_i + m, and therefore n=mn=m. This completes the proof. \square

Proposition 3.

The category BOnB\On has 1\aleph_1-filtered colimits.

Proof. The proof is similar to BNB\IN. Let I\I be an 1\aleph_1-filtered small category and D:IBOnD : \I \to B\On a diagram. A cocone λ=(λi)iI\lambda = (\lambda_i)_{i \in \I} for DD is a family of ordinals satisfying λi=λj+D(f)\lambda_i = \lambda_j + D(f) for every morphism f:ijf: i \to j in I\I.

We first observe that DD factors uniquely through the preorder reflection of I\I. Indeed, any two parallel morphisms in I\I are coequalized by some morphism, and BOnB\On is left cancellative. Thus, we may assume that I\I is a preorder. Each inequality iji \leq j in I\I is mapped to an ordinal number αi,jD(ij)\alpha_{i,j} \coloneqq D(i \to j), and these numbers satisfy αi,k=αj,k+αi,j\alpha_{i,k} = \alpha_{j,k} + \alpha_{i,j} for all ijki \leq j \leq k. In particular, αi,jαi,k\alpha_{i,j} \leq \alpha_{i,k}.

For fixed iIi \in \I, the collection {αi,j:ji}\{\alpha_{i,j} : j \geq i\} is a set of ordinals because I\I is small, hence bounded above in On\On. We claim that it has a maximum element. Otherwise, we can find a countable chain i=j0j1j2i = j_0 \leq j_1 \leq j_2 \leq \dotsc in I\I such that αi,jn<αi,jn+1\alpha_{i,j_n} < \alpha_{i,j_{n+1}} for all nNn \in \IN. Since I\I is 1\aleph_1-filtered, there is an upper bound jIj_\infty \in \I of (jn)nN(j_n)_{n \in \IN}. For each nNn \in \IN, the equation αi,jn+1=αjn,jn+1+αi,jn\alpha_{i,j_{n+1}} = \alpha_{j_n,j_{n+1}} + \alpha_{i,j_n} implies that αjn,jn+1>0\alpha_{j_n,j_{n+1}} > 0. Hence, αjn,j=αjn+1,j+αjn,jn+1>αjn+1,j,\alpha_{j_n,j_\infty} = \alpha_{j_{n+1},j_\infty} + \alpha_{j_n,j_{n+1}} > \alpha_{j_{n+1},j_\infty}, so (αjn,j)nN(\alpha_{j_n,j_\infty})_{n \in \IN} is a strictly decreasing infinite sequence of ordinals, contradicting the well-foundedness of On\On. Thus, the maximum uimax{αi,j:ji}u_i \coloneqq \max \{ \alpha_{i,j} : j \geq i \} is a well-defined ordinal number, which we regard as a morphism in BOnB\On. The family (ui)iI(u_i)_{i \in \I} forms a cocone for DD, since for all iji \leq j we have

ui=max{αi,k:ki}=max{αi,k:kj}=max{αj,k+αi,j:kj}=max{αj,k:kj}+αi,j=uj+αi,j. \begin{align*} u_i & = \max \{ \alpha_{i,k} : k \geq i \} \\ & = \max \{ \alpha_{i,k} : k \geq j \} \\ & = \max \{ \alpha_{j,k} + \alpha_{i,j} : k \geq j \} \\ & = \max \{ \alpha_{j,k} : k \geq j \} + \alpha_{i,j} \\ & = u_j + \alpha_{i,j}. \end{align*}

To establish the universal property, let (λi)iI(\lambda_i)_{i \in \I} be any cocone for DD, so that λi=λj+αi,j\lambda_i = \lambda_j + \alpha_{i,j} for all iji \leq j. The cocone relation ui=uj+αi,ju_i = u_j + \alpha_{i,j} implies that uiuju_i \geq u_j whenever iji \leq j. By the well-foundedness of On\On, there exists i0Ii_0 \in \I such that uj=ui0u_j = u_{i_0} for all ji0j \geq i_0. For such jj, the relation ui0=uj+αi0,j=ui0+αi0,ju_{i_0} = u_j + \alpha_{i_0,j} = u_{i_0} + \alpha_{i_0,j} forces αi0,j=0\alpha_{i_0,j} = 0. Consequently, ui0=max{αi0,j:ji0}=0.u_{i_0} = \max \{ \alpha_{i_0,j} : j \geq i_0 \} = 0. Define the mediating morphism to be the ordinal κλi0\kappa \coloneqq \lambda_{i_0}. We must show that λi=κ+ui\lambda_i = \kappa + u_i for all iIi \in \I. Choose jIj \in \I with jij \geq i and ji0j \geq i_0. Since ji0j \geq i_0, we have uj=0u_j = 0 and αi0,j=0\alpha_{i_0,j} = 0. The cocone condition for λ\lambda gives κ=λi0=λj+αi0,j=λj.\kappa = \lambda_{i_0} = \lambda_j + \alpha_{i_0,j} = \lambda_j. Applying the cocone conditions for uu and λ\lambda to iji \leq j, we obtain ui=uj+αi,j=0+αi,j=αi,ju_i = u_j + \alpha_{i,j} = 0 + \alpha_{i,j} = \alpha_{i,j} and λi=λj+αi,j=κ+αi,j=κ+ui.\lambda_i = \lambda_j + \alpha_{i,j} = \kappa + \alpha_{i,j} = \kappa + u_i. This proves the existence of the mediating morphism.

For uniqueness, suppose κ\kappa' is any ordinal satisfying λi=κ+ui\lambda_i = \kappa' + u_i for all iIi \in \I. Evaluating at i0i_0 yields λi0=κ+ui0=κ+0=κ,\lambda_{i_0} = \kappa' + u_{i_0} = \kappa' + 0 = \kappa', hence κ=κ\kappa' = \kappa. Therefore, the cocone (ui)iI(u_i)_{i \in \I} is the colimit of DD in BOnB\On. \square

Author: Martin Brandenburg

Context

This page is referenced by the following categories.