ℵ1-filtered colimits in deloopings
Every (possibly large) monoid M induces a category BM with just one object. We will show that this category has ℵ1-filtered colimits in the cases M=N and M=On (both respect to addition).
Proposition 1. The category BN has ℵ1-filtered colimits.
Proof.
Let D:I→BN be an ℵ1-filtered diagram. Every two parallel morphisms i⇉j are mapped to the same morphism in BN, because they are coequalized by some morphism and (N,+) is cancellative. Hence, D factors through the preorder reflection of I, and we may therefore assume that I itself is a preorder. Thus, the diagram consists of numbers D(i,j)∈N for all i≤j satisfying
D(j,k)+D(i,j)=D(i,k)
for all i≤j≤k. In particular, D(i,j)≤D(i,k).
Let i∈I. The set of natural numbers {D(i,k):k≥i} is bounded above. Otherwise, for every n∈N we could find kn∈I with kn≥i and D(i,kn)≥n. Since I is ℵ1-filtered, the family (kn)n∈N has an upper bound k∞∈I. But then
D(i,k∞)=D(kn,k∞)+D(i,kn)≥D(i,kn)≥n
for all n∈N, contradicting the fact that D(i,k∞)∈N.
Therefore, the maximum
ui:=max{D(i,k):k≥i}∈N
is well-defined, which we regard as a morphism in BN. For i≤j we compute
ui=max{D(i,k):k≥i}=max{D(i,k):k≥j}=max{D(j,k)+D(i,j):k≥j}=max{D(j,k):k≥j}+D(i,j)=uj+D(i,j),
showing that (ui) defines a cocone. It is universal: let (vi) be another cocone, i.e. vi∈N and vi=vj+D(i,j) for all i≤j. Then vi≥D(i,j) for all i≤j, hence vi≥ui. Write vi=wi+ui for some uniquely determined wi∈N. For i≤j we compute
wj+uj+D(i,j)=vj+D(i,j)=vi=wi+ui=wi+uj+D(i,j),
hence wj=wi. Therefore, the wi are constant, and the required factorization follows. □
Proposition 2. The category BN is ℵ1-accessible.
Proof.
Based on Proposition 1, it remains to show that the unique object ∗ is ℵ1-presentable, i.e. that for every diagram D:I→BN as above, the canonical map
α:colimi∈IHom(∗,D(i))→Hom(∗,colimi∈ID(i))
is bijective. On objects, we necessarily have D(i)=∗ and colimi∈ID(i)=∗. Hence, the codomain of α is simply N, while the domain consists of equivalence classes [i,n] of pairs (i,n)∈I×N, where (i,n)∼(j,m) iff there exists some k≥i,j such that
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):j≥i}+n.
(1) The map α is surjective: Pick some i∈I. Choose j≥i such that ui=D(i,j). For all k≥j we then have
ui≥D(i,k)=D(j,k)+D(i,j)=D(j,k)+ui,
hence D(j,k)=0. Therefore, uj=0, and thus α([j,n])=n for all n∈N.
(2) The map α is injective: Assume that [i,n] and [j,m] have the same image. Since I is filtered, we may assume i=j. The condition then becomes ui+n=ui+m, and therefore n=m. This completes the proof. □
Proposition 3. The category BOn has ℵ1-filtered colimits.
Proof.
The proof is similar to BN. Let I be an ℵ1-filtered small category and D:I→BOn a diagram. A cocone λ=(λi)i∈I for D is a family of ordinals satisfying λi=λj+D(f) for every morphism f:i→j in I.
We first observe that D factors uniquely through the preorder reflection of I. Indeed, any two parallel morphisms in I are coequalized by some morphism, and BOn is left cancellative. Thus, we may assume that I is a preorder. Each inequality i≤j in I is mapped to an ordinal number αi,j:=D(i→j), and these numbers satisfy
αi,k=αj,k+αi,j
for all i≤j≤k. In particular, αi,j≤αi,k.
For fixed i∈I, the collection {αi,j:j≥i} is a set of ordinals because I is small, hence bounded above in On. We claim that it has a maximum element. Otherwise, we can find a countable chain i=j0≤j1≤j2≤… in I such that αi,jn<αi,jn+1 for all n∈N. Since I is ℵ1-filtered, there is an upper bound j∞∈I of (jn)n∈N. For each n∈N, the equation
αi,jn+1=αjn,jn+1+αi,jn
implies that αjn,jn+1>0. Hence,
αjn,j∞=αjn+1,j∞+αjn,jn+1>αjn+1,j∞,
so (αjn,j∞)n∈N is a strictly decreasing infinite sequence of ordinals, contradicting the well-foundedness of On. Thus, the maximum
ui:=max{αi,j:j≥i}
is a well-defined ordinal number, which we regard as a morphism in BOn. The family (ui)i∈I forms a cocone for D, since for all i≤j we have
ui=max{αi,k:k≥i}=max{αi,k:k≥j}=max{αj,k+αi,j:k≥j}=max{αj,k:k≥j}+αi,j=uj+αi,j.
To establish the universal property, let (λi)i∈I be any cocone for D, so that λi=λj+αi,j for all i≤j. The cocone relation ui=uj+αi,j implies that ui≥uj whenever i≤j. By the well-foundedness of On, there exists i0∈I such that uj=ui0 for all j≥i0. For such j, the relation
ui0=uj+αi0,j=ui0+αi0,j
forces αi0,j=0. Consequently,
ui0=max{αi0,j:j≥i0}=0.
Define the mediating morphism to be the ordinal κ:=λi0. We must show that λi=κ+ui for all i∈I. Choose j∈I with j≥i and j≥i0. Since j≥i0, we have uj=0 and αi0,j=0. The cocone condition for λ gives
κ=λi0=λj+αi0,j=λj.
Applying the cocone conditions for u and λ to i≤j, we obtain
ui=uj+αi,j=0+αi,j=αi,j
and
λi=λj+αi,j=κ+αi,j=κ+ui.
This proves the existence of the mediating morphism.
For uniqueness, suppose κ′ is any ordinal satisfying λi=κ′+ui for all i∈I. Evaluating at i0 yields
λi0=κ′+ui0=κ′+0=κ′,
hence κ′=κ. Therefore, the cocone (ui)i∈I is the colimit of D in BOn.
□
This page is referenced by the following categories.