Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-22T06:32:42.780Z Has data issue: false hasContentIssue false

NON-TRIVIAL HIGHER HOMOTOPY OF FIRST-ORDER THEORIES

Published online by Cambridge University Press:  11 January 2024

TIM CAMPION
Affiliation:
DEPARTMENT OF MATHEMATICS JOHN HOPKINS UNIVERSITY BALTIMORE, MD, USA E-mail: [email protected]
JINHE YE*
Affiliation:
MATHEMATICAL INSTITUTE UNIVERSITY OF OXFORD OXFORD, UK
Rights & Permissions [Opens in a new window]

Abstract

Let T be the theory of dense cyclically ordered sets with at least two elements. We determine the classifying space of $\mathsf {Mod}(T)$ to be homotopically equivalent to $\mathbb {CP}^\infty $. In particular, $\pi _2(\lvert \mathsf {Mod}(T)\rvert )=\mathbb {Z}$, which answers a question in our previous work. The computation is based on Connes’ cycle category $\Lambda $.

MSC classification

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Introduction

In the previous work of the authors with Cousins [Reference Campion, Cousins and Ye1], it was shown that given a complete first-order theory T, the fundamental group of the classifying space of $\mathsf {Mod}(T)$ , the category of models of T with elementary embeddings, is exactly the Lascar group. The Lascar group was introduced as a model-theoretic Galois group [Reference Lascar7]. Other topological invariants of the classifying space $|\mathsf {Mod}(T)|$ beyond the fundamental group appear to be worthy of exploration. In all the examples appearing in [Reference Campion, Cousins and Ye1], the homotopy groups in degrees 2 and above were observed to vanish. By relaxing the restriction to models of theories in other more expressive logics, for example, abstract elementary classes (AECs), arbitrary homotopy types can be realized, even for AECs with nice model-theoretic properties [Reference Connes2]. This motivates the following question:

Question 0.1. Is it true that for every first-order theory T, $\pi _2(\lvert \mathsf {Mod}(T)\rvert )$ vanishes? If not, what is the model-theoretic content of it?

In this short note, we answer the first part of Question 0.1 in the negative. Specifically, for T the theory of dense cyclically ordered sets with at least two elements, $\lvert \mathsf {Mod}(T)\rvert \simeq \mathbb {CP}^\infty $ . In particular, $\pi _2(\lvert \mathsf {Mod}(T) \rvert ) = \mathbb {Z} \neq 0$ . The computation is based on Connes’ cycle category $\Lambda $ [Reference Cisinski4] and the work of Nikolaus and Scholze [Reference Nikolaus and Scholze9]. The theory of dense cyclically ordered sets is a canonical example in model theory where existence of non-forking extensions fails over $\varnothing $ . In forthcoming work, we will show that for T stable, $\pi _2(\lvert \mathsf {Mod}(T)\rvert )$ is always trivial. Stability can be characterized axiomatically in terms of forking independence (see, for example, [Reference Harnik and Harrington5, Reference Kim and Pillay6]), and clever usage of these independence axioms will enable us to trivialize the second homotopy group. This seems to suggest that $\pi _2(\lvert \mathsf {Mod}(T)\rvert )$ is related to certain aspects of forking/dividing. However, the connection is still rather mysterious (see Remark 2.10). For an introduction to forking and dividing, see [Reference Tent and Ziegler11, Chapter 7].

The contents of this note are as follows. In Section 1, we introduce the category of cyclically ordered sets, and compute its homotopy type following [Reference Nikolaus and Scholze9]. In Section 2, we introduce the theory of dense cyclically ordered sets and its category of models $\mathsf {DCyc}$ . We show that it is homotopy equivalent to the category of cyclically ordered sets. Lastly, for a first-order theory T, we have a brief discussion of $\pi _2|\mathsf {Mod}(T)|$ with forking and dividing in model theory.

1 Nonempty cyclically ordered sets

In this section, we introduce the category of cyclically ordered sets (Definition 1.1), and compute the homotopy type of the category thereof (Corollary 1.14).

1.1 Cyclically ordered sets

We introduce cyclically ordered sets from a model-theoretic perspective (Definition 1.1) and show that this category may alternatively be defined via an Ind construction (Lemma 1.3).

Definition 1.1. The language of cyclically ordered sets $ \mathcal {L}_{\mathsf {Cyc}}$ is the language with a ternary relation symbol $R(x,y,z)$ . A cyclically ordered set is an $\mathcal {L}_{\mathsf {Cyc}}$ -structure $(S,R(x,y,z))$ such that the following holds:

  • Asymmetry: $\forall x,y,z,w R(x,y,z)\wedge R(x,z,w)\rightarrow y\neq w$ ;

  • Transitivity: $\forall x,y,z,w R(x,y,z) \wedge R(x,z,w) \rightarrow R(x,y,w)$ ;

  • Connectedness: For all distinct $x,y,z$ , $R(x,y,z)$ or $R(z,y,x)$ ;

  • Cyclicity: $\forall x,y,z R(x,y,z)\rightarrow R(y,z,x)$ .

An embedding of cyclically ordered sets (or in short, embedding) is an $\mathcal {L}_{\mathsf {Cyc}}$ -embedding. Namely $f:C\to D$ is an embedding of cyclically ordered sets if f is injective and $R_C(a,b,c)\leftrightarrow R_D(f(a),f(b),f(c))$ . Note that the preservation of R implies f is injective once C has at least three elements. We introduce notation for the following categories of cyclically ordered sets:

  • $\mathsf {Cyc}$ is the category of cyclically ordered sets and embeddings between them.

  • $\mathsf {Cyc}_{>0} \subset \mathsf {Cyc}$ is the full subcategory of nonempty cyclically ordered sets.

  • $\mathsf {Cyc}^{\mathrm {fin}}_{>0} \subset \mathsf {Cyc}_{>0}$ is the full subcategory of finite, nonempty cyclically ordered sets.

Remark 1.2. It is worth pointing out that the axioms other than Cyclicity for a cyclically ordered set state that $R(x,y,z)$ is a strict linear ordering on the complement of x for each x.

Lemma 1.3. $\mathsf {Cyc}_{>0}$ is an $\aleph _0$ -accessible category. The finitely-presentable objects are the finite cyclically ordered sets. Thus we have an equivalence $\mathsf {Cyc}_{>0} \simeq \operatorname {\mathrm {Ind}}(\mathsf {Cyc}^{\mathrm {fin}}_{>0})$ .

Proof It is clear that directed colimits are given by taking unions. Thus the finite nonempty cyclically ordered sets are finitely presentable. As every nonempty cyclically ordered set is the (directed) union of its finite cyclically ordered subsets, the claim follows.

Remark 1.4. The above mentioned categories $\mathsf {Cyc}_{>0}$ and $\mathsf {Cyc}^{\mathrm {fin}}_{>0}$ are closely related to the cyclic sets of [Reference Cisinski4], but there are some differences. The first difference is the site of definition: Connes’ cycle category $\Lambda $ is a Reedy category with both “monic” and “epic” morphisms; our category $\mathsf {Cyc}_{>0}^{\mathrm {fin}} \subset \Lambda $ contains only the monomorphisms, as is more natural in the setting of model theory. The other main difference is that Connes’ category of cyclic sets is a presheaf category $\mathsf {Psh}(\Lambda )$ , whereas our category of cyclically ordered sets is just the Ind-category $\mathsf {Cyc}_{>0} = \operatorname {\mathrm {Ind}}(\mathsf {Cyc}_{>0}^{\mathrm {fin}}) \subset \mathsf {Psh}(\mathsf {Cyc}_{>0}^{\mathrm {fin}})$ (Lemma 1.3).

Following this observation, we denote by $[n-1]$ the cyclically ordered set with n elements.

1.2 Finite cyclically ordered sets and paracycles

Recall (cf. [Reference Nikolaus and Scholze9, Appendix B]) that Connes’ cycle category $\Lambda $ may be defined as the quotient of the paracycle category (variously denoted $\mathsf L$ or $\Lambda _\infty $ ) by a free categorical action of the categorical group $B \mathbb {Z}$ . In this subsection, we check that $\mathsf {Cyc}_{>0}^{\mathrm {fin}}$ is likewise the quotient of the category $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ of monomorphisms in $\Lambda _\infty $ by the restriction of this categorical action.

Remark 1.5. For us, a categorical group G is a strict group object in the category of categories. An action of a categorical group G on a category C is meant in the strict sense—a strictly unital and associative functor $G \times C \to C$ .

We let $B\mathbb {Z}$ denote the categorical delooping of the integers. This is the category with one object, with morphism set $\mathbb {Z}$ , and composition given by addition of integers. This category is a categorical group, i.e., a strict group object in the category of categories, in a unique way. As in [Reference Nikolaus and Scholze9, Appendix B], a $B \mathbb {Z}$ action on C amounts to a $\mathbb {Z}$ action on the homsets of C.

Definition 1.6 [Reference Campion and Ye3, Reference Nikolaus and Scholze9].

A graded poset is a poset equipped with an automorphism. A paracycle is a graded poset of the form $(1/n)\mathbb {Z}$ for some $n \geq 1$ , where the automorphism is given by $x \mapsto x + 1$ . We denote by $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ the category of paracycles and poset embeddings which respect the automorphism.

The category of graded posets admits an action by the categorical group $B \mathbb {Z}$ , which adds the shift automorphism to any morphism. This restricts to a free action on $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ . There is a canonical functor $\mathsf {PCyc}^{\mathrm {fin}}_{>0} \to \mathsf {Cyc}^{\mathrm {fin}}_{>0}$ sending $(1/n)\mathbb {Z}$ to $[n-1]$ .

Remark 1.7. The paracycle category, denoted $\mathsf {L}$ by [Reference Campion and Ye3] and $\Lambda _\infty $ by [Reference Nikolaus and Scholze9], is the category with the same objects as $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ but with morphisms all order-preserving, automorphism-respecting maps. Connes’ cycle category $\Lambda $ is then defined to be the quotient of $\Lambda _\infty $ by the canonical $B \mathbb {Z}$ -action.

Remark 1.8. Similarly to the case of $\Lambda _\infty $ [Reference Nikolaus and Scholze9, Appendix B] $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ is a full subcategory of the functor category $\mathrm {Fun}(B \mathbb {Z}, \mathsf {Pos})$ , where now $\mathsf {Pos}$ is the category of posets and embeddings between them. As in that case, the action of $B \mathbb {Z}$ on $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ is inherited from the action of the categorical group $B \mathbb {Z}$ on itself.

Just as the functor $\Lambda _\infty \to \Lambda $ exhibits $\Lambda $ as the quotient of $\Lambda _\infty $ by the action of $B \mathbb {Z}$ , the same is true of the functor $\mathsf {PCyc}^{\mathrm {fin}}_{>0} \to \mathsf {Cyc}^{\mathrm {fin}}_{>0}$ :

Lemma 1.9. The canonical functor $\mathsf {PCyc}^{\mathrm {fin}}_{>0} \to \mathsf {Cyc}^{\mathrm {fin}}_{>0}$ exhibits $\mathsf {Cyc}^{\mathrm {fin}}_{>0}$ as the quotient of $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ by the $B \mathbb {Z}$ action. This quotient is preserved by the nerve functor.

Proof As in [Reference Nikolaus and Scholze9, Appendix B], the $B \mathbb {Z}$ action on $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ amounts to a $\mathbb {Z}$ action on the homsets of $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ , given by applying the shift map of the source (equivalently, of the target) object. Moreover, the quotient by the $B \mathbb {Z}$ action is given by quotienting each homset by this $\mathbb {Z}$ action. The map $\mathrm {Map}_{\mathsf {PCyc}^{\mathrm {fin}}_{>0}}((1/m)\mathbb {Z}, (1/n)\mathbb {Z}) \to \mathrm {Map}_{\mathsf {Cyc}^{\mathrm {fin}}_{>0}}([m-1], [n-1])$ is clearly surjective. Moreover, two morphisms $f,g$ are identified under this map if and only if they differ by a shift. Thus this map quotients by the $\mathbb {Z}$ action as desired. As a quotient which is the identity on objects and full, this quotient is preserved by the nerve functor.

Remark 1.10. We might enlarge the category $\mathsf {Cyc}_{>0}^{\mathrm {fin}}$ to allow for certain non-injective maps. One way to do this would be to allow for monotone maps, i.e., $f:C\to D$ such that $R_D(f(x), f(y), f(z))\rightarrow R_C(x,y,z)$ . However, this would not result in a category equivalent to Connes’ category $\Lambda $ . For example, there is a unique monotone map $[n] \to [0]$ for each finite cyclically ordered set $[n]$ , but in $\Lambda $ there are $n+1$ distinct morphisms $[n] \to [0]$ . It is only the monomorphisms of $\Lambda $ which are well-described as maps of structures.

1.3 The homotopy type of nonempty cyclic sets

In this subsection, we show that the homotopy types of $\mathsf {Cyc}_{>0}^{\mathrm {fin}}$ and $\mathsf {Cyc}_{>0}$ are $BS^1 = \mathbb {C} \mathbb {P}^\infty $ . The idea is to show that the homotopy type of $\mathsf {PCyc}_{>0}^{\mathrm {fin}}$ is contractible and use that $\mathsf {Cyc}_{>0}^{\mathrm {fin}}$ is the (homotopy) orbits of the latter by the free action of $S^1 = B \mathbb {Z}$ from Definition 1.6. This method of proof is well-known [Reference Campion and Ye3, Reference Nikolaus and Scholze9] in the case of $\Lambda $ and $\Lambda _\infty $ ; we verify here that the same proof works when we restrict to categories of monomorphisms.

We begin by showing that $\mathsf {PCyc}_{>0}^{\mathrm {fin}}$ is contractible by comparing it to the semisimplex category $\Delta ^{\mathrm {inj}}$ of nonempty finite linear orders and embeddings between them. The analog of the following lemma for the inclusion $\Delta \to \Lambda _\infty $ of the simplex category into the paracycle category is well-known. The proof for the categories of monomorphisms is the same (although there is an error in the proof of [Reference Nikolaus and Scholze9, Theorem B.3], since the intersection $\mathcal {C}_{[t,t+1)} \cap \mathcal {C}_{[s,s+1)}$ is often empty):

Lemma 1.11 [Reference Campion and Ye3, 8.5.15], [Reference Nikolaus and Scholze9, Theorem B.3].

The canonical functor $\Delta ^{\mathrm {inj}} \to \mathsf {PCyc}^{\mathrm {fin}}_{>0}$ is homotopy initial $($ i.e., it satisfies the dual hypotheses of Quillen’s Theorem A $)$ and in particular induces a homotopy equivalence of classifying spaces.

Proof For Quillen’s Theorem A, see [Reference Quillen10, Theorem A]. Let $(1/n)\mathbb {Z} \in \mathsf {PCyc}^{\mathrm {fin}}_{>0}$ , and consider the slice category $\Delta ^{\mathrm {inj}} \downarrow (1/n)\mathbb {Z}$ . For any $a,b\in (1/n)\mathbb {Z}$ with $a < b$ , consider the full subcategory $\mathcal {C}_{[a,b)}$ spanned by those maps $f : (1/k)\mathbb {Z} \to (1/n)\mathbb {Z}$ such that the image of $\{0,1/k,\dots ,(k-1)/k\}$ is contained in the half-open interval $[a,b)$ . Observe that every $f \in \mathcal {C}$ is contained in $\mathcal {C}_{[a,a+1)}$ for some $a \in (1/n)\mathbb {Z}$ . We will induct on $b-a$ to show that $\mathcal {C}_{[a,b)}$ is contractible. In the base case, if $b \leq a+1$ , then $\mathcal {C}_{[a,b)}$ is isomorphic to $\Delta ^{\mathrm {inj}} \downarrow [m]$ where $m = n(b-a)$ . So $\mathcal {C}_{[a,b)}$ has a terminal object and hence is contractible. For the inductive step, for any $a < b-1$ , the square

is both a pushout and pullback, even after taking nerves, and it comprises cofibrations of simplical sets. Thus it is a homotopy pushout. By induction it is a homotopy pushout of contractible simplicial sets, and hence $\mathcal {C}_{[a,b)}$ is contractible as well, completing the induction. Passing to the (filtered) colimit, $\cup _{a<b} \mathcal {C}_{[a,b)} = \Delta ^{\mathrm {inj}} \downarrow (1/n)\mathbb {Z}$ , this category is weakly contractible as desired.

Corollary 1.12 [Reference Campion and Ye3, Reference Nikolaus and Scholze9].

The category $\mathsf {PCyc}^{\mathrm {fin}}_{>0}$ is weakly contractible.

Proof This follows from Lemma 1.11 and the fact that $\Delta ^{\mathrm {inj}}$ is weakly contractible [Reference Maltsiniotis8, 1.7.24].

Corollary 1.13 [Reference Campion and Ye3, Reference Cisinski4, Reference Nikolaus and Scholze9].

The category $\mathsf {Cyc}^{\mathrm {fin}}_{>0}$ has the homotopy type of $BS^1 = K(\mathbb {Z},2) = \mathbb {C}\mathbb {P}^\infty $ .

Proof This follows from Corollary 1.12 and Lemma 1.9, since $B\mathbb {Z}$ is equivalent as a topological group to $S^1$ .

Corollary 1.14. The category $\mathsf {Cyc}_{>0}$ has the homotopy type of $BS^1 = K(\mathbb {Z},2) = \mathbb {C} \mathbb {P}^\infty $ .

Proof This follows from Corollary 1.13 and Lemma 1.3, since for any category $\mathcal {C}$ we have $|\mathcal {C}| \simeq |\operatorname {\mathrm {Ind}}(\mathcal {C})|$ (this follows from Quillen’s Theorem A as for any $X \in \operatorname {\mathrm {Ind}}(\mathcal {C})$ , the category $\mathcal {C} \downarrow X$ is filtered and hence contractible).

2 Dense cyclically ordered sets

In this section, we introduce the theory of dense cyclically ordered sets (Definition 2.1). We then compute the homotopy type of the category of models thereof (Corollary 2.8).

2.1 Completeness and quantifier elimination

Definition 2.1. Let T be the theory, in the language of cyclically ordered sets $\mathcal {L}_{\mathsf {Cyc}}$ , of a dense cyclically ordered set with at least two elements. More explicitly, the density condition is expressed as the following:

$$\begin{align*}\forall x,z \, (x\neq z\rightarrow \exists y \,R(x,y,z)). \end{align*}$$

The following follows from the back-and-forth argument in dense linear orders without endpoints.

Fact 2.2. T has a unique countable model up to isomorphism, which is $\mathbb {Q}/\mathbb {Z}$ with the obvious cyclic ordering given by $<$ in $\mathbb {Q}$ . Moreover, T admits quantifier elimination in $\mathcal {L}_{\mathsf {Cyc}}$ .

We will use $\mathsf {DCyc}$ to denote the category of models of T where the morphisms are elementary embeddings. By quantifier elimination, the arrows are exactly the $\mathcal {L}_{\mathsf {Cyc}}$ -embeddings. In other words, $\mathsf {DCyc}$ is the full subcategory of $\mathsf {Cyc}_{>0}$ whose objects consist of the dense ones.

2.2 The homotopy type of dense cyclically ordered sets

Definition 2.3. Given a cyclically ordered set C, let $T(C) = C \times \{0,1\}$ . We identify C with $C \times \{0\} \subseteq T(C)$ ; call the inclusion map $\iota _C: C \to T(C)$ . Give $T(C)$ the cyclic structure where the ordering is such that $(c,1)$ is placed in the cut immediately after c with respect to C. More precisely, this means that $R((x,0),(x,1),y)$ for any y distinct from $(x,0)$ , $(x,1)$ . If $f:C\to D$ is an embedding of cyclically ordered sets, $T(f):T(C)\to T(D)$ is the map that sends $(c,i)$ to $(f(c),i)$ for $i=0,1$ .

The following lemma is immediate.

Lemma 2.4. $T(C)$ is a cyclically ordered set, and $C \to T(C)$ is an embedding of cyclically ordered sets. The construction $C \mapsto T(C)$ is functorial, and the embedding $C \to T(C)$ is natural. Moreover, if C is nonempty, then $T(C)$ has at least two elements.

Definition 2.5. For a cyclically ordered set C, define $T^\infty (C) = \cup _n T^n(C)$ where the inclusion maps are given by $\iota $ ; continue to call the inclusion $\iota : C \to T^\infty (C)$ . $T^\infty (f)$ is also defined accordingly.

Lemma 2.6. $T^\infty (C)$ is a cyclically ordered set, and $C \to T^\infty (C)$ is an embedding of cyclically ordered sets. The construction $C \mapsto T^\infty (C)$ , $f\mapsto T^\infty (f)$ is functorial, and the embedding $\iota : C \to T^\infty (C)$ is natural. Moreover, $T^\infty (C)$ is an object in $\mathsf {DCyc}$ if C is nonempty.

Proof The naturality follows from Lemma 2.4. So it suffices to show that $T^\infty (C)$ is dense. Let $x \neq y \in T^\infty (C)$ . By construction, there is $n\in \mathbb {N}$ such that $x, y \in T^n(C)$ . If there is $z \in T^n(C)$ with $R(x,z,y)$ , then we are done. Otherwise, observe that in $T^{n+1}(C)$ , $R((x,0), (x,1), (y,0))$ holds.

Corollary 2.7. The functor $T^\infty : \mathsf {Cyc}_{>0} \to \mathsf {DCyc}$ and the inclusion functor $i : \mathsf {DCyc} \to \mathsf {Cyc}_{>0}$ induce inverse homotopy equivalences after passing to classifying spaces.

Proof We have natural transformations $\iota : \mathrm {id} \Rightarrow iT^\infty $ and $\iota : \mathrm {id} \Rightarrow T^\infty i$ .

Corollary 2.8. We have $|\mathsf {DCyc}| \simeq BS^1 = K(\mathbb {Z},2) = \mathbb {C} \mathbb {P}^\infty $ . In particular, $\mathsf {DCyc}$ is an elementary class whose classifying space is not aspherical.

Proof $BS^1 = |\mathsf {Cyc}_{>0}| \simeq |\mathsf {DCyc}|$ by Corollary 1.14 and Corollary 2.7, respectively.

Remark 2.9. If we tried to include the empty cyclically ordered set into $\mathsf {Cyc}^{\mathrm {fin}}_{>0}$ , the functor $T^\infty $ would not turn the empty one into a nonempty one. So we wouldn’t be able to relate our category homotopically to a category where emptiness is ruled out by the theory.

Remark 2.10. Dense cyclically ordered sets are canonical examples where the $0$ -definable set $x=x$ forks over $\varnothing $ . However, the exact relationship between forking and the higher homotopy remains mysterious. Another canonical example of forking $\neq $ dividing comes from the theory of infinite atomic Boolean algebras T. It has quantifier elimination in $\mathcal {L}=\{\wedge ,\vee ,^c,0,1,(A_n)_{n\in \mathbb {N}_{>0}}\}$ where each $A_n$ is to be interpreted as the predicate for n-atoms: the join of n distinct atoms. An element a is infinite if it is above infinitely many atoms, and coinfinite if $a^c$ is infinite. Note that any $a,b$ that are infinite and coinfinite have the same type over $\varnothing $ . The predicate $A_1(x)$ does not divide but forks since one can find an infinite and coinfinite element $a A_1(x)\rightarrow x\wedge a=x$ or $x\wedge a^c=x$ and the formula $x\wedge a=x$ divides for any infinite and coinfinite a. On the other hand, the classifying space of the category of models of infinite atomic Boolean algebra $\mathsf {Mod}(T)$ is contractible. To see this, note that there is a functor F from the category of infinite sets with embeddings to $\mathsf {Mod}(T)$ by sending each set A to $\mathcal {P}^{\mathrm {fin}}(A)$ and associate with each map $f:A \to B$ the map $\mathcal {P}^{\mathrm {fin}}(A)\to \mathcal {P}^{\mathrm {fin}}(B)$ induced by f on the atoms. There is also the “forgetful” functor U from $\mathsf {Mod}(T)$ to the category of infinite sets by sending each atomic Boolean algebra to its set of atoms. There are obvious natural transformations from the identity to $UF$ , and from the identity to $FU$ , so and thus the classifying spaces of these categories are homotopy equivalent.

Acknowledgements

We would like to express our gratitude to the anonymous referee for feedback and suggestions for improvement.

Funding

TC is grateful for the support of the ARO under MURI Grant W911NF-20-1-0082.

References

Campion, T., Cousins, G., and Ye, J., Classifying spaces and the Lascar group, this Journal, vol. 86 (2021), no. 4, 1396–1431.Google Scholar
Campion, T. and Ye, J., Homotopy types of abstract elementary classes . Journal of Pure and Applied Algebra , vol. 225 (2021), no. 5, Article no. 106461, 9 pp.CrossRefGoogle Scholar
Cisinski, D.-C., Les préfaisceaux comme modèles des types d’homotopie . Astérisque , vol. 308 (2006), pp. xxiv + 390.Google Scholar
Connes, A., Cohomologie cyclique et foncteurs ${}^n$ . Comptes Rendus de l’Académie des Sciences—Series I—Mathematics , vol. 296 (1983), no. 23, pp. 953958.Google Scholar
Harnik, V. and Harrington, L., Fundamentals of forking . Annals of Pure and Applied Logic , vol. 26 (1984), no. 3, pp. 245286.CrossRefGoogle Scholar
Kim, B. and Pillay, A., Simple theories . Annals of Pure and Applied Logic , vol. 88 (1997), nos. 2–3, pp. 149164.CrossRefGoogle Scholar
Lascar, D., On the category of models of a complete theory, this Journal, vol. 47 (1982), no. 2, pp. 249–266.Google Scholar
Maltsiniotis, G., La théorie de l’homotopie de Grothendieck . Astérisque , vol. 301 (2005), pp. 1140.Google Scholar
Nikolaus, T. and Scholze, P., On topological cyclic homology . Acta Mathematica , vol. 221 (2018), no. 2, pp. 203409.CrossRefGoogle Scholar
Quillen, D., Higher algebraic K-theory. I . In Algebraic K-theory, I: Higher K-theories (Proc. Conf., Battelle Memorial Inst., Seattle, Wash., 1972) , Lecture Notes in Mathematics, vol. 341, Springer, Berlin, 1973, pp. 85147.Google Scholar
Tent, K. and Ziegler, M., A course in model theory , Lecture Notes in Logic, vol. 40, Association for Symbolic Logic, La Jolla; Cambridge University Press, Cambridge, 2012.CrossRefGoogle Scholar