DOCSLIB.ORG

Decomposition-Space Slices Are Toposes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Decomposition-Space Slices Are Toposes Decomposition-space slices are toposes Joachim Kock ∗ David I. Spivak † Abstract We show that the category of decomposition spaces and CULF maps is locally a topos. Precisely, the slice category over any decomposition space D is a presheaf D topos, namely Decomp∕D ≃ Psh(tw ). 1 Introduction Decomposition spaces were introduced for purposesin combinatorics by Gálvez, Kock, and Tonks [7, 8, 9], and purposes in homological algebra, representation theory, and geometry by Dyckerhoff and Kapranov [4], who call them unital 2-Segal spaces. They are simplicial sets (or simplicial ∞-groupoids) with aproperty that expresses the ability to (co-associatively) decompose, just as in categories one can (associatively) compose. In particular, decomposition spaces induce coalgebras. The most nicely-behaved class of morphisms between decomposition spaces is that of CULF maps. These preserve decompositions in an appropriate way so as to induce coalgebra homomorphisms. Apart from the coalgebraic aspect, not so much is known about the category Decomp of decomposition spaces and CULF maps, and it may appear a bit peculiar. For exam- ple, the product of two decomposition spaces as simplicial sets is not the categorical product in Decomp—the projections generally fail to be CULF. Similarly, the termi- nal simplicial set (which is a decomposition space) is not terminal in Decomp. The simplicial-set product should rather be considered as a tensor product for decomposi- tion spaces. The present contribution advances the categorical study of decomposition spaces arXiv:1807.06000v3 [math.CT] 2 Sep 2019 by establishing that Decomp is locally a topos, meaning that all its slices are toposes— even presheaf toposes. More precisely we show: Main Theorem (Theorem 4.5). For D a decomposition space, there is a natural equivalence of categories ∼ D Decomp∕D → Psh(tw( )). (1) Here tw(D) is the twistedarrow category of D, obtained by edgewise subdivision—this is readily seen to be (the nerve of) a category, cf. Lemma 2.1 below. ∗ Kock was supported by grants MTM2016-80439-P (AEI/FEDER, UE) of Spain and 2017-SGR-1725 of Catalonia. † Spivak was supported by AFOSR grants FA9550–14–1–0031 and FA9550–17–1–0058. 1 The functor in the direction displayed in Eq. (1) is simply applying the twisted arrow category construction. The functor going in the other direction is the surprise. We construct it by exploiting an interesting natural transformation between the category of elements of the nerve and the twisted arrow category of a decomposition space: el ◦N Decomp⇓ Cat. tw Its component D ∶ el(ND) → tw(D) at a decomposition space D sends an n-simplex of D to its long edge. (In the category case, this map goes back to Thomason’s notebooks [18, p.152]; it was exploited by Gálvez–Neumann–Tonks [10] to exhibit Baues–Wirsching cohomology as a special case of Gabriel–Zisman cohomology.) The crucial property of is that it is a cartesian natural transformation. Our proof of the Main Theorem describes the inverse to twD as being essentially—modulo some ∗ technical translations involving elements, presheaves, and nerves—given by D. Theimportance ofthis resultresidesin making a hugebodyof work in topostheory available to study decomposition spaces, such as for example the ability to define new decomposition spaces from old by using the internal language. It also opens up interesting questions such as how the subobject classifier [15], isotropy group [6], etc. of the topos Decomp∕D relate to the combinatorial structure of the decomposition space D. The Main Theorem can be considered surprising in view of the well-known failure of such a result for categories. Lamarche (1996) had suggested that categories CULF over a fixed base category C form a topos, but Johnstone [11] found a counter-example, and corrected the statement by identifying the precise—though quite restrictive— conditions that C must satisfy. Independent proofs of this result (and related condi- tions) were provided by Bunge–Niefield [3] and Bunge–Fiore [2], who were motivated by CULF functors as a notion of duration of processes, as already considered by Law- vere [13]. The present work also grew out of interest in dynamical systems [17]. Our main theorem can be seen as a different realization of Lamarche’s insight, allowing more general domains, thus indicating a role of decomposition spaces in category theory. From this perspective, the point is that the natural setting for CULF functors are decomposition spaces rather than categories: a simplicial set CULF over a category is a decomposition space, but not always a category. 2 Preliminaries Simplicial sets. Although decomposition spaces naturally pertain to the realm of ∞- categories and simplicial ∞-groupoids, we work in the present note with 1-categories and simplicial sets, both for simplicity and in order to situate decomposition spaces (actually just “decomposition sets”) in the setting of classical category theory and topos theory. All the results should generalize to ∞-categories (in the form of Segal spaces) and general decomposition spaces, and the proof ideas should also scale to this 2 context, although the precise form of the proofs does not: where presently we exploit objects-and-arrows arguments, more uniform simplicial arguments are required in the ∞-case. We leave that generalization open. Thus our setting is the category sSet = Psh(∆) of simplicial sets, i.e. functors ∆op → Set and their natural transformations. Small categories fully faithfully em- bed as simplicial sets via the nerve functor N ∶ Cat → sSet, and decomposition spaces are defined as certain more general simplicial sets, as we now recall. Active and inert maps. The category ∆ has an active-inert factorization system: the active maps, written g ∶ [m] ⇥ [n], are those that preserve end-points, g(0) = 0 and g(m) = n; the inert maps, written f ∶ [m] ↣ [n], are those that are distance preserving, f(i+1) = f(i) + 1 for 0 ≤ i ≤ m − 1. The active maps are generated by the codegeneracy i i maps s ∶ Xn → Xn+1 (for all 0 ≤ i ≤ n) and the inner coface maps d ∶ Xn → Xn−1 (for all 0 <i<n); the inert maps are generated by the outer coface maps d⊥ = d0 and d⊤ = dn. (This orthogonal factorization system is an instance of the important general notion of generic-free factorization system of Weber [20] who referred to the two classes as generic and free. The active-inert terminology is due to Lurie [14].) Decomposition spaces. Active and inert maps in ∆ admit pushouts along each other, and the resulting maps are again active and inert. A decomposition space [7] is a simplicial set (or more generally a simplicial groupoid or ∞-groupoid) X ∶ ∆op → Set that takes all such active-inert pushouts to pullbacks: ⎛ ¨ ⎞ [n ] [n] Xn¨ Xn ⎜ ⌟ ⎟ ⌟ X ⎜ ⎟ = ⎜ ⎟ ⎜ ¨ ⎟ ⎝ [m ] [m] ⎠ Xm¨ Xm. CULF maps. A simplicial map F ∶ Y → X between simplicial sets is called CULF [7] when it is cartesian on active maps (i.e. the naturality squares are pullbacks), or, equivalently, is right-orthogonal to all active maps Δ[m] ⇥ Δ[n]. The CULF maps between (nerves of) categories are precisely the discrete Conduché fibrations (see [11]). If D is a decomposition space (e.g. a category) and F ∶ E → D is CULF, then also E is a decomposition space (but not in general a category). We denote by Decomp the category of decomposition spaces and CULF maps. Right fibrations and presheaves. A simplicial map is called a right fibration if it is cartesian on bottom coface maps (or equivalently, right-orthogonal to the class of last-vertex inclusion maps Δ[0] → Δ[n]). (This in fact implies that it is cartesian on all codegeneracy and coface maps except the top coface maps. In particular, a right fibration is CULF.) When restricted to categories, this notion coincides with that of discrete fibration. We denote by RFib the category of small categories and right C fibrations. Note that for any category , the inclusion functor RFib∕C → Cat∕C is full. 3 For any small category C there is an adjunction C ) ∶ Cat∕C ⇆ Psh( ) ∶ with ⊢ ); the presheaf )(F ) associated to a functor F ∶ D → C is given by taking the left Kan extension )(F ) ≔ LanF (1) of the terminal presheaf 1 ∈ Psh(D) along F . The notation is chosen because )◦ ≅ id. For any X ∈ Psh(C), we denote X by C X ∶ el(X) → , and refer to el(X) as the category of elements; an object of el(X) is a pair (c, x) where c ∈ C and x ∈ X(c), and a morphism (c¨, x¨) → (c, x) is a morphism ¨ C ¨ f ∶ c → c in with X(f)(x) = x . The projection functor X is always a right C ¨ fibration, and ) restricts to an equivalence of categories RFib∕C ≃ Psh( ). If X → X is a map of presheaves, el(X¨) → el(X) is a right fibration. Thus we have a functor el∶ Psh(C) → RFib. We will make particular use of this for the case C = ∆: el∶ sSet → RFib. Twisted arrow categories. For C a small category, the twisted arrow category tw(C) (cf. [12]) is the category of elements of the Hom functor Cop × C → Set. It thus has the arrows of C as objects, and trapezoidal commutative diagrams ⋅ ⋅ f ¨ f ⋅ ⋅ as morphisms from f ¨ to f. The twisted arrow category is a special case of edgewise subdivision of a simplicial set [16], as we now recall. Consider the functor Q∶ ∆ ⟶ ∆ [n] ⟼ [n]op ⋆ [n] = [2n+1]. With the following special notation for the elements of the ordinal [n]op ⋆ [n] = [2n+1], 0 1 ⋯ n (2) 0¨ 1¨ ⋯ n¨, the functor Q is described on arrows by sending a coface map di ∶ [n−1] → [n] to the monotone map that omits the elements i and i¨, and by sending a codegeneracy map si ∶ [n] → [n−1] to the monotone map that repeats both i and i¨.
Load more

Recommended publications
  • Simplicial Sets, Nerves of Categories, Kan Complexes, Etc
    SIMPLICIAL SETS, NERVES OF CATEGORIES, KAN COMPLEXES, ETC FOLING ZOU These notes are taken from Peter May's classes in REU 2018. Some notations may be changed to the note taker's preference and some detailed definitions may be skipped and can be found in other good notes such as [2] or [3]. The note taker is responsible for any mistakes. 1. simplicial approach to defining homology Defnition 1. A simplical set/group/object K is a sequence of sets/groups/objects Kn for each n ≥ 0 with face maps: di : Kn ! Kn−1; 0 ≤ i ≤ n and degeneracy maps: si : Kn ! Kn+1; 0 ≤ i ≤ n satisfying certain commutation equalities. Images of degeneracy maps are said to be degenerate. We can define a functor: ordered abstract simplicial complex ! sSet; K 7! Ks; where s Kn = fv0 ≤ · · · ≤ vnjfv0; ··· ; vng (may have repetition) is a simplex in Kg: s s Face maps: di : Kn ! Kn−1; 0 ≤ i ≤ n is by deleting vi; s s Degeneracy maps: si : Kn ! Kn+1; 0 ≤ i ≤ n is by repeating vi: In this way it is very straightforward to remember the equalities that face maps and degeneracy maps have to satisfy. The simplical viewpoint is helpful in establishing invariants and comparing different categories. For example, we are going to define the integral homology of a simplicial set, which will agree with the simplicial homology on a simplical complex, but have the virtue of avoiding the barycentric subdivision in showing functoriality and homotopy invariance of homology. This is an observation made by Samuel Eilenberg. To start, we construct functors: F C sSet sAb ChZ: The functor F is the free abelian group functor applied levelwise to a simplical set.
    [Show full text]
  • The Simplicial Parallel of Sheaf Theory Cahiers De Topologie Et Géométrie Différentielle Catégoriques, Tome 10, No 4 (1968), P
    CAHIERS DE TOPOLOGIE ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES YUH-CHING CHEN Costacks - The simplicial parallel of sheaf theory Cahiers de topologie et géométrie différentielle catégoriques, tome 10, no 4 (1968), p. 449-473 <http://www.numdam.org/item?id=CTGDC_1968__10_4_449_0> © Andrée C. Ehresmann et les auteurs, 1968, tous droits réservés. L’accès aux archives de la revue « Cahiers de topologie et géométrie différentielle catégoriques » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ CAHIERS DE TOPOLOGIE ET GEOMETRIE DIFFERENTIELLE COSTACKS - THE SIMPLICIAL PARALLEL OF SHEAF THEORY by YUH-CHING CHEN I NTRODUCTION Parallel to sheaf theory, costack theory is concerned with the study of the homology theory of simplicial sets with general coefficient systems. A coefficient system on a simplicial set K with values in an abe - . lian category 8 is a functor from K to Q (K is a category of simplexes) ; it is called a precostack; it is a simplicial parallel of the notion of a presheaf on a topological space X . A costack on K is a « normalized» precostack, as a set over a it is realized simplicial K/" it is simplicial « espace 8ta18 ». The theory developed here is functorial; it implies that all &#x3E;&#x3E; homo- logy theories are derived functors. Although the treatment is completely in- dependent of Topology, it is however almost completely parallel to the usual sheaf theory, and many of the same theorems will be found in it though the proofs are usually quite different.
    [Show full text]
  • Fields Lectures: Simplicial Presheaves
    Fields Lectures: Simplicial presheaves J.F. Jardine∗ January 31, 2007 This is a cleaned up and expanded version of the lecture notes for a short course that I gave at the Fields Institute in late January, 2007. I expect the cleanup and expansion processes to continue for a while yet, so the interested reader should check the web site http://www.math.uwo.ca/∼jardine periodi- cally for updates. Contents 1 Simplicial presheaves and sheaves 2 2 Local weak equivalences 4 3 First local model structure 6 4 Other model structures 12 5 Cocycle categories 13 6 Sheaf cohomology 16 7 Descent 22 8 Non-abelian cohomology 25 9 Presheaves of groupoids 28 10 Torsors and stacks 30 11 Simplicial groupoids 35 12 Cubical sets 43 13 Localization 48 ∗This research was supported by NSERC. 1 1 Simplicial presheaves and sheaves In all that follows, C will be a small Grothendieck site. Examples include the site op|X of open subsets and open covers of a topo- logical space X, the site Zar|S of Zariski open subschemes and open covers of a scheme S, or the ´etale site et|S, again of a scheme S. All of these sites have “big” analogues, like the big sites Topop,(Sch|S)Zar and (Sch|S)et of “all” topological spaces with open covers, and “all” S-schemes T → S with Zariski and ´etalecovers, respectivley. Of course, there are many more examples. Warning: All of the “big” sites in question have (infinite) cardinality bounds on the objects which define them so that the sites are small, and we don’t talk about these bounds.
    [Show full text]
  • The 2-Category Theory of Quasi-Categories
    THE 2-CATEGORY THEORY OF QUASI-CATEGORIES EMILY RIEHL AND DOMINIC VERITY Abstract. In this paper we re-develop the foundations of the category theory of quasi- categories (also called 1-categories) using 2-category theory. We show that Joyal’s strict 2-category of quasi-categories admits certain weak 2-limits, among them weak comma objects. We use these comma quasi-categories to encode universal properties relevant to limits, colimits, and adjunctions and prove the expected theorems relating these notions. These universal properties have an alternate form as absolute lifting diagrams in the 2- category, which we show are determined pointwise by the existence of certain initial or terminal vertices, allowing for the easy production of examples. All the quasi-categorical notions introduced here are equivalent to the established ones but our proofs are independent and more “formal”. In particular, these results generalise immediately to model categories enriched over quasi-categories. Contents 1. Introduction 2 1.1. A generalisation 3 1.2. Outline 4 1.3. Acknowledgments 5 2. Background on quasi-categories 6 2.1. Some standard simplicial notation 6 2.2. Quasi-categories 8 2.3. Isomorphisms and marked simplicial sets 10 2.4. Join and slice 14 3. The 2-category of quasi-categories 19 3.1. Relating 2-categories and simplicially enriched categories 19 3.2. The 2-category of quasi-categories 21 3.3. Weak 2-limits 24 arXiv:1306.5144v4 [math.CT] 6 May 2015 3.4. Slices of the category of quasi-categories 33 3.5. A strongly universal characterisation of weak comma objects 37 4.
    [Show full text]
  • Quasicategories 1.1 Simplicial Sets
    Quasicategories 12 November 2018 1.1 Simplicial sets We denote by ∆ the category whose objects are the sets [n] = f0; 1; : : : ; ng for n ≥ 0 and whose morphisms are order-preserving functions [n] ! [m]. A simplicial set is a functor X : ∆op ! Set, where Set denotes the category of sets. A simplicial map f : X ! Y between simplicial sets is a natural transforma- op tion. The category of simplicial sets with simplicial maps is denoted by Set∆ or, more concisely, as sSet. For a simplicial set X, we normally write Xn instead of X[n], and call it the n set of n-simplices of X. There are injections δi :[n − 1] ! [n] forgetting i and n surjections σi :[n + 1] ! [n] repeating i for 0 ≤ i ≤ n that give rise to functions n n di : Xn −! Xn−1; si : Xn+1 −! Xn; called faces and degeneracies respectively. Since every order-preserving function [n] ! [m] is a composite of a surjection followed by an injection, the sets fXngn≥0 k ` together with the faces di and degeneracies sj determine uniquely a simplicial set X. Faces and degeneracies satisfy the simplicial identities: n−1 n n−1 n di ◦ dj = dj−1 ◦ di if i < j; 8 sn−1 ◦ dn if i < j; > j−1 i n+1 n < di ◦ sj = idXn if i = j or i = j + 1; :> n−1 n sj ◦ di−1 if i > j + 1; n+1 n n+1 n si ◦ sj = sj+1 ◦ si if i ≤ j: For n ≥ 0, the standard n-simplex is the simplicial set ∆[n] = ∆(−; [n]), that is, ∆[n]m = ∆([m]; [n]) for all m ≥ 0.
    [Show full text]
  • A Model Structure for Quasi-Categories
    A MODEL STRUCTURE FOR QUASI-CATEGORIES EMILY RIEHL DISCUSSED WITH J. P. MAY 1. Introduction Quasi-categories live at the intersection of homotopy theory with category theory. In particular, they serve as a model for (1; 1)-categories, that is, weak higher categories with n-cells for each natural number n that are invertible when n > 1. Alternatively, an (1; 1)-category is a category enriched in 1-groupoids, e.g., a topological space with points as 0-cells, paths as 1-cells, homotopies of paths as 2-cells, and homotopies of homotopies as 3-cells, and so forth. The basic data for a quasi-category is a simplicial set. A precise definition is given below. For now, a simplicial set X is given by a diagram in Set o o / X o X / X o ··· 0 o / 1 o / 2 o / o o / with certain relations on the arrows. Elements of Xn are called n-simplices, and the arrows di : Xn ! Xn−1 and si : Xn ! Xn+1 are called face and degeneracy maps, respectively. Intuition is provided by simplical complexes from topology. There is a functor τ1 from the category of simplicial sets to Cat that takes a simplicial set X to its fundamental category τ1X. The objects of τ1X are the elements of X0. Morphisms are generated by elements of X1 with the face maps defining the source and target and s0 : X0 ! X1 picking out the identities. Composition is freely generated by elements of X1 subject to relations given by elements of X2. More specifically, if x 2 X2, then we impose the relation that d1x = d0x ◦ d2x.
    [Show full text]
  • Lecture Notes on Simplicial Homotopy Theory
    Lectures on Homotopy Theory The links below are to pdf files, which comprise my lecture notes for a first course on Homotopy Theory. I last gave this course at the University of Western Ontario during the Winter term of 2018. The course material is widely applicable, in fields including Topology, Geometry, Number Theory, Mathematical Pysics, and some forms of data analysis. This collection of files is the basic source material for the course, and this page is an outline of the course contents. In practice, some of this is elective - I usually don't get much beyond proving the Hurewicz Theorem in classroom lectures. Also, despite the titles, each of the files covers much more material than one can usually present in a single lecture. More detail on topics covered here can be found in the Goerss-Jardine book Simplicial Homotopy Theory, which appears in the References. It would be quite helpful for a student to have a background in basic Algebraic Topology and/or Homological Algebra prior to working through this course. J.F. Jardine Office: Middlesex College 118 Phone: 519-661-2111 x86512 E-mail: [email protected] Homotopy theories Lecture 01: Homological algebra Section 1: Chain complexes Section 2: Ordinary chain complexes Section 3: Closed model categories Lecture 02: Spaces Section 4: Spaces and homotopy groups Section 5: Serre fibrations and a model structure for spaces Lecture 03: Homotopical algebra Section 6: Example: Chain homotopy Section 7: Homotopical algebra Section 8: The homotopy category Lecture 04: Simplicial sets Section 9:
    [Show full text]
  • Exposé I – Elements of Parametrized Higher Category Theory
    PARAMETRIZED HIGHER CATEGORY THEORY AND HIGHER ALGEBRA: EXPOSÉ I – ELEMENTS OF PARAMETRIZED HIGHER CATEGORY THEORY CLARK BARWICK, EMANUELE DOTTO, SAUL GLASMAN, DENIS NARDIN, AND JAY SHAH Abstract. We introduce the basic elements of the theory of parametrized ∞-categories and functors between them. These notions are defined as suitable fibrations of ∞-categories and functors between them. We give as many examples as we are able at this stage. Simple operations, such as the formation of opposites and the formation of functor ∞-categories, become slightly more involved in the parametrized setting, but we explain precisely how to perform these constructions. All of these constructions can be performed explicitly, without resorting to such acts of desperation as straightening. The key results of this Exposé are: (1) a universal characterization of the 푇-∞-category of 푇-objects in any ∞-category, (2) the existence of an internal Hom for 푇-∞-categories, and (3) a parametrized Yoneda lemma. Contents 1. Parametrized ∞-categories 1 2. Examples of parametrized ∞-categories 3 3. Parametrized opposites 7 4. Parametrized subcategories 7 5. Constructing 푇-∞-categories via pairings 8 6. A technical result: the strong pushforward 9 7. 푇-objects in ∞-categories 11 8. Parametrized fibrations 14 9. Parametrized functor categories 15 10. The parametrized Yoneda embedding 19 Appendix A. Notational glossary 20 References 21 1. Parametrized ∞-categories Suppose 퐺 a finite group. At a minimum, a 퐺-∞-category should consist of an ∞- category 퐶 along with a weak action 휌 of 퐺. In particular, for every element 푔 ∈ 퐺, one should have an equivalence 휌(푔)∶ 퐶 ∼ 퐶, and for every 푔, ℎ ∈ 퐺, one should have a natu- ral equivalence 휌(푔ℎ) ≃ 휌(푔) ∘ 휌(ℎ), and these natural equivalences should then in turn be constrained by an infinite family of homotopies that express the higher associativity of 휌.
    [Show full text]
  • A Simplicial Set Is a Functor X : a Op → Set, Ie. a Contravariant Set-Valued
    Contents 9 Simplicial sets 1 10 The simplex category and realization 10 11 Model structure for simplicial sets 15 9 Simplicial sets A simplicial set is a functor X : Dop ! Set; ie. a contravariant set-valued functor defined on the ordinal number category D. One usually writes n 7! Xn. Xn is the set of n-simplices of X. A simplicial map f : X ! Y is a natural transfor- mation of such functors. The simplicial sets and simplicial maps form the category of simplicial sets, denoted by sSet — one also sees the notation S for this category. If A is some category, then a simplicial object in A is a functor A : Dop ! A : Maps between simplicial objects are natural trans- formations. 1 The simplicial objects in A and their morphisms form a category sA . Examples: 1) sGr = simplicial groups. 2) sAb = simplicial abelian groups. 3) s(R − Mod) = simplicial R-modules. 4) s(sSet) = s2Set is the category of bisimplicial sets. Simplicial objects are everywhere. Examples of simplicial sets: 1) We’ve already met the singular set S(X) for a topological space X, in Section 4. S(X) is defined by the cosimplicial space (covari- ant functor) n 7! jDnj, by n S(X)n = hom(jD j;X): q : m ! n defines a function ∗ n q m S(X)n = hom(jD j;X) −! hom(jD j;X) = S(X)m by precomposition with the map q : jDmj ! jDmj. The assignment X 7! S(X) defines a covariant func- tor S : CGWH ! sSet; called the singular functor.
    [Show full text]
  • Realizing Diagrams in the Homotopy Category by Means of Diagrams of Simplicial Sets1 W
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 91, Number 3, July 1984 REALIZING DIAGRAMS IN THE HOMOTOPY CATEGORY BY MEANS OF DIAGRAMS OF SIMPLICIAL SETS1 W. G. DWYER AND D. M. KAN ABSTRACT. Given a small category D, we show that a D-diagram X in the homotopy category can be realized by a D-diagram of simplicial sets iff a certain simplicial set rX is nonempty. Moreover, this simplicial set rX can be expressed as the homotopy inverse limit of simplicial sets whose homtopy types are quite well understood. There is also an associated obstruction theory. In the special case that D is a group (i.e. D has only one object and all its maps are invertible) these results reduce to the ones of G. Cooke. 1. Introduction. 1.1. Summary. Let D be a small category. The aim of this note then is to obtain necessary and sufficient conditions in order that a D-diagram X in the homotopy category can be realized by means of a D-diagram of simplicial sets. This is done by constructing a simplicial set rX, which is nonempty iff X can be so realized. To get a hold on the homotopy type of rX, one notes that rX is the homotopy fibre of a map between a simplicial set ir~1cX which classifies certain D-diagrams of simplicial sets associated with X and which was studied in [5], and a simplicial set cX which classifies similar D-diagrams in the homotopy category. As the homotopy types of 7r_1cX and cX can be expressed as homotopy inverse limits of simplicial sets whose homotopy types are quite well understood, the same can therefore be done for rX.
    [Show full text]
  • Path Categories and Quasi-Categories
    Path categories and quasi-categories J.F. Jardine∗ December 14, 2015 Introduction The identification of morphism sets in path categories of simplicial (or cubical) complexes is a central theme of concurrency theory. The path category functor, on the other hand, plays a role in the homotopy theory of quasi-categories that is roughly analogous to that of the fundamental groupoid in standard homotopy theory. Concurrency theory is the study of models of parallel processing systems. One of the prevailing geometric forms of the theory represents systems as fi- nite cubical complexes, called higher dimensional automata. Each r-cell of the complex K represents the simultaneous action of a group of r processors, while the holes in the complex represent constraints on the system, such as areas of memory that cannot be shared. The vertices of K are the states of the system, and the morphisms P (K)(x; y) from x to y in the path category P (K) are the execution paths from the state x to the state y. There is no prevailing view of what higher homotopy invariants should mean in concurrency theory, or even what these invariants should be. The path cat- egory functor is not an artifact of standard homotopy theory, but it is a cen- tral feature of the theory of quasi-categories. The homotopy theory of quasi- categories is constructed abstractly within the category of simplicial sets by methods that originated in homotopy localization theory, and its weak equiva- lences are not described by homotopy groups. Is the homotopy theory of quasi-categories the right venue for the study of higher homotopy phenomena in concurrency theory? Well maybe, but a definitive answer is not presented here.
    [Show full text]
  • Simplicial Sets Are Algorithms
    Simplicial Sets are Algorithms William Troiani Supervisor: Daniel Murfet The University of Melbourne School of Mathematics and Statistics A thesis submitted in partial fulfilment of the requirements of the degree of Master of Science (Mathematics and Statistics) May 2019 Abstract We describe how the Mitchell-Benabou language, also known as the internal language of a topos, can be used to realise simplicial sets as algorithms. A method for describing finite colimits in an arbitrary topos using its associated Mitchell- Benabou language is given. This will be used to provide a map from simplicial sets into the terms and formulas of this internal logic. Also, an example corresponding to the topological space of the triangle is given explicitly. Contents 1 Introduction 2 2 Topoi 4 3 Type theory 8 3.1 Some type theory Lemmas . 12 3.2 The Mitchell-Benabou language . 15 3.3 Applications of the Mitchell-Benabou Language . 18 3.4 Dealing with Subobjects . 21 4 Describing colimits using the Mitchell-Benabou language 27 4.1 Initial object . 29 4.2 Finite Coproducts . 29 4.3 Coequalisers . 33 5 The map from simplicial sets to algorithms 37 5.1 The General Method . 40 6 An Example 43 1 1 Introduction In this thesis we defend the following proposition: simplicial sets are algorithms for constructing topological spaces. Recall that a simplicial set X is a collection of sets fXngn≥0 consisting of n-simplices Xn for each n ≥ 0, together with face and degeneracy maps between these sets satisfying certain equations, see [9, §I.1.xii], [1, §10]. The idea is that simplicial sets are combinatorial models of topological spaces, which can be built up from a set X0 of vertices, a set X1 of edges, a set X2 of triangles, and so on, by gluing these basic spaces together in a particular way.
    [Show full text]