DOCSLIB.ORG

A Double-Dimensional Approach to Formal Category Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Double-Dimensional Approach to Formal Category Theory A double-dimensional approach to formal category theory Seerp Roald Koudenburg∗ Draft as of October 24, 2019 Notes • The recent paper “Augmented virtual double categories”, avail- able as arxiv:1910.11189, contains a streamlined and ex- panded version of Sections 1, 2 and 3 below; I encourage read- ers of these sections to read the new paper instead. • The first version of this draft (November 2015) used the term “hypervirtual double category” for its main notion, where presently “augmented virtual double category” is used instead. Abstract Whereas formal category theory is classically considered within a 2-cate- gory, in this paper a double-dimensional approach is taken. More precisely we develop such theory within the setting of augmented virtual double cat- egories, a notion extending that of virtual double category (also known as fc-multicategory) by adding cells with nullary target. This paper starts by introducing the notion of augmented virtual double category, followed by describing its basic theory and its relation to other types of double category. After this the notion of ‘weak’ Kan extension within an augmented virtual double category is considered, together with three strength- enings. The first of these generalises Borceux-Kelly’s notion of Kan extension along enriched functors, the second one generalises Street’s notion of point- wise Kan extension in 2-categories, and the third is a combination of the other arXiv:1511.04070v2 [math.CT] 25 Oct 2019 two; these stronger notions are compared. The notion of yoneda embedding is then considered in an augmented virtual double category, and compared to that of a good yoneda structure on a 2-category; the latter in the sense of Street-Walters and Weber. Conditions are given ensuring that a yoneda em- b b bedding y: A → A defines A as the free small cocompletion of A, in a suitable sense. In the second half we consider formal category theory in the presence of algebraic structures. In detail: to a monad T on an augmented virtual double K T T category several augmented virtual double categories -Alg(v,w) of -al- gebras are associated, one for each pair of types of weak coherence satisfied ∗Part of this paper was written during a visit to Macquarie University, where its main results formed the subject of a series of talks at the Australian Category Seminar; I am grateful to the Macquarie University Research Centre for its funding of my visit. I would like to thank Richard Garner, Mark Weber and Ramón Abud Alcalá for helpful discussions, and Robert Paré for suggesting the term “augmented virtual double category”. 1 by the T -algebras and their morphisms respectively. This is followed by the study of the creation of, amongst others, left Kan extensions by the forgetful T → K functors -Alg(v,w) . The main motivation of this paper is the description of conditions ensuring that yoneda embeddings in K lift along these forgetful functors, as well as ensuring that such lifted algebraic yoneda embeddings T again define free small cocompletions, now in -Alg(v,w). As a first example we apply the previous to monoidal structures on categories, hence recovering Day convolution of presheaves and Im-Kelly’s result on free monoidal cocom- pletion, as well as obtaining a “monoidal Yoneda lemma”. Motivation Central to classical category theory is the Yoneda lemma which, for a locally small category A, describes the position of the representable presheaves A(–, x) within the category A of all presheaves Aop → Set. More precisely, in its “parametrised” form, the Yoneda lemma states that the yoneda embedding y: A → A: x 7→ A(–, x) satisfies the followingb property: any profunctor J : A −7−→ B—that is a functor J : Aop × B → Set—induces a functor J λ : B → A equipped with bijectionsb λ ∼ A(y x, J y) = J(x,b y), λ ∼ λ that combine to form an isomorphismb A(y –,J –) = J of profunctors. Indeed, J can be defined as J λy := J(–,y). The main observation motivating thisb paper is that, given a monoidal structure ⊗ on A, the above “lifts” to a “monoidal Yoneda lemma” as follows. Recall that a monoidal structure on A induces such a structure ⊗ on A, that is given by Day convolution [Day70] u,v∈A b b (p ⊗ q)(x) := A(x, u ⊗ v) × pu × qv, where p, q ∈ A, Z and withb respect to which y : A → A forms a pseudomonoidal functor—thatb is, it comes equipped with coherent isomorphisms ¯y: y x ⊗ y y =∼ y(x ⊗ y). Thus a pseudomonoidal functor, (y, ¯y): (A, ⊗b) → (A, ⊗) satisfies the following monoidal variant of the property above: any lax monoidal profunctorb J : A −7−→ B—equipped ¯ with coherent morphisms J : J(x1,y1) × J(x2b,yb2) → J(x1 ⊗ x2,y1 ⊗ y2)—induces a lax monoidal functor J λ : B → A equipped with an isomorphism of lax monoidal profunctors A(y –,J λ –) =∼ J. In detail: we can take J λ to be as defined before, λ λ λ λ equipped with coherence morphismsb J¯ : J y1⊗J y2 ⇒ J (y1⊗y2) that are induced by the compositesb id ×J¯ b A(x, u⊗v)×J(u,y1)×J(v,y2) −−−→ A(x, u⊗v)×J(u⊗v,y1 ⊗y2) → J(x, y1 ⊗y2), where the unlabelled morphism is induced by the functoriality of J in A. The principal aim of this paper is to formalise the way in which the classical Yoneda lemma in the presence of a monoidal structure leads to the monoidal Yoneda lemma, as described above; thus allowing us to (a) generalise the above to other types of algebra, such as double categories and representable topological spaces; (b) characterise lax monoidal profunctors J whose induced lax monoidal functors J λ are pseudomonoidal, and likewise for other types of algebraic morphism; (c) recover classical results in the setting of monoidal categories, such as (y, ¯y) exhibiting (A, ⊗) as the “free monoidal cocompletion” of (A, ⊗) (see [IK86]), and generalise these to other types of algebra. b b 2 Augmented virtual double categories While the classical Yoneda lemma has been formalised in the setting of 2-cate- gories, in the sense of the yoneda structures of Street and Walters [SW78] (see also [Web07]), it is unclear how the monoidal Yoneda lemma, as described above, fits into this framework. Indeed the problem is that it concerns two types of morphism between monoidal categories, both lax monoidal functors and lax monoidal pro- functors, and it is not clear how to arrange both types into a 2-category equipped with a yoneda structure. In particular lax monoidal structures on representable profunctors C(f –, –), where f : A → C is a functor, correspond to colax monoidal structures on f (see Theorem 6.15 below for the generalisation of this to other types of algebra). The natural setting in which to consider two types of morphism is that of a (pseudo-)double category, where one type is regarded as being horizontal and the other as being vertical, while one considers square-shaped cells J A B f φ g C D K between them. Double categories however form a structure that is too strong for some of the types of algebra that we would like to consider, as it requires compo- sitions for both types of morphism while, for example, the composite of “double profunctors” J : A −7−→ B and H : B −7−→ E, between double categories A, B and E, does in general not exist. While the latter is a consequence of, roughly speaking, the algebraic structures of J and H being incompatible in general, composites of profunctor-like morphisms may also fail to exist because of size issues. Indeed, recall from [FS95] that, for a locally small category A, the category of presheaves A need not be locally small. Consequently in describing the classical Yoneda lemma for locally small categories it is, on one hand, necessary to consider categories A,b B, . that might have large hom-sets while, on the other hand, the property satisfied by the yoneda embedding is stated in terms of ‘small’ profunctors—that is small- set-valued functors J : Aop × B → Set—between such categories; in general, such profunctors do not compose either. This classical situation is typical: for a descrip- tion of most of the variations of the Yoneda lemma given in this paper, one considers a double-dimensional setting whose objects A, B, . are “large in size” while the size of the horizontal morphisms J : A −7−→ B between them is “small”. In view of the previous we, instead of double categories, consider a weaker notion as the right notion for our double-dimensional approach to formal category theory. This weaker notion is extends slightly that of ‘virtual double category’ [CS10] which, analogous to the generalisation of monoidal category to ‘multicategory’, does not require a horizontal composition but, instead of the square-shaped cells above, has cells of the form below, with a sequence of horizontal morphisms as horizontal source. Introduced by Burroni [Bur71] under the name ‘fc-catégorie’, where fc denotes the ‘free category’-monad, virtual double categories have also been called ‘fc-multicategories’ [Lei04]. J1 Jn A0 A1 ··· An′ An f φ g C D K Both settings mentioned above can be considered as a virtual double category: there 3 is a virtual double category with (possibly large) categories as objects, functors as vertical morphisms and small profunctors as horizontal morphisms, and likewise one with (possibly large) double categories, ‘double functors’ and ‘small’ double profunctors. These virtual double categories however miss an ingredient crucial to the theory of (double) categories: they do not contain transformations f ⇒ g between (double) functors f and g : A → C into (double) categories C with large hom-sets.
Load more

Recommended publications
  • Compositional Game Theory, Compositionally
    Compositional Game Theory, Compositionally Robert Atkey Bruno Gavranovic´ Neil Ghani Clemens Kupke Jérémy Ledent Fredrik Nordvall Forsberg The MSP Group, University of Strathclyde Glasgow, Écosse Libre We present a new compositional approach to compositional game theory (CGT) based upon Arrows, a concept originally from functional programming, closely related to Tambara modules, and operators to build new Arrows from old. We model equilibria as a module over an Arrow and define an operator to build a new Arrow from such a module over an existing Arrow. We also model strategies as graded Arrows and define an operator which builds a new Arrow by taking the colimit of a graded Arrow. A final operator builds a graded Arrow from a graded bimodule. We use this compositional approach to CGT to show how known and previously unknown variants of open games can be proven to form symmetric monoidal categories. 1 Introduction A new strain of game theory — Compositional Game Theory (CGT) — was introduced recently [9]. At its core, CGT involves a completely new representation of games — open games — with operators for constructing larger and more complex games from smaller, simpler (and hence easier to reason about) ones. Despite recent substantial interest and further development [13, 10, 7, 6, 4, 11, 14], open games remain complex structures, e.g. the simplest form of an open game is an 8-tuple consisting of 4 ports, a set of strategies, play and coplay functions and an equilibrium predicate. More advanced versions [4] require sophisticated structures such as coends. This causes problems: (i) complex definitions lead to complex and even error prone proofs; (ii) proofs are programs and overly complex proofs turn into overly complex programs; (iii) even worse, this complexity deters experimentation and innovation, for instance the authors of [10] were deterred from trying alternative definitions as the work became prohibitive; and (iv) worse still, this complexity suggests we do not fully understand the mathematical structure of open games.
    [Show full text]
  • Nearly Locally Presentable Categories Are Locally Presentable Is Equivalent to Vopˇenka’S Principle
    NEARLY LOCALLY PRESENTABLE CATEGORIES L. POSITSELSKI AND J. ROSICKY´ Abstract. We introduce a new class of categories generalizing locally presentable ones. The distinction does not manifest in the abelian case and, assuming Vopˇenka’s principle, the same happens in the regular case. The category of complete partial orders is the natural example of a nearly locally finitely presentable category which is not locally presentable. 1. Introduction Locally presentable categories were introduced by P. Gabriel and F. Ulmer in [6]. A category K is locally λ-presentable if it is cocomplete and has a strong generator consisting of λ-presentable objects. Here, λ is a regular cardinal and an object A is λ-presentable if its hom-functor K(A, −): K → Set preserves λ-directed colimits. A category is locally presentable if it is locally λ-presentable for some λ. This con- cept of presentability formalizes the usual practice – for instance, finitely presentable groups are precisely groups given by finitely many generators and finitely many re- lations. Locally presentable categories have many nice properties, in particular they are complete and co-wellpowered. Gabriel and Ulmer [6] also showed that one can define locally presentable categories by using just monomorphisms instead all morphisms. They defined λ-generated ob- jects as those whose hom-functor K(A, −) preserves λ-directed colimits of monomor- phisms. Again, this concept formalizes the usual practice – finitely generated groups are precisely groups admitting a finite set of generators. This leads to locally gener- ated categories, where a cocomplete category K is locally λ-generated if it has a strong arXiv:1710.10476v2 [math.CT] 2 Apr 2018 generator consisting of λ-generated objects and every object of K has only a set of strong quotients.
    [Show full text]
  • AN INTRODUCTION to CATEGORY THEORY and the YONEDA LEMMA Contents Introduction 1 1. Categories 2 2. Functors 3 3. Natural Transfo
    AN INTRODUCTION TO CATEGORY THEORY AND THE YONEDA LEMMA SHU-NAN JUSTIN CHANG Abstract. We begin this introduction to category theory with definitions of categories, functors, and natural transformations. We provide many examples of each construct and discuss interesting relations between them. We proceed to prove the Yoneda Lemma, a central concept in category theory, and motivate its significance. We conclude with some results and applications of the Yoneda Lemma. Contents Introduction 1 1. Categories 2 2. Functors 3 3. Natural Transformations 6 4. The Yoneda Lemma 9 5. Corollaries and Applications 10 Acknowledgments 12 References 13 Introduction Category theory is an interdisciplinary field of mathematics which takes on a new perspective to understanding mathematical phenomena. Unlike most other branches of mathematics, category theory is rather uninterested in the objects be- ing considered themselves. Instead, it focuses on the relations between objects of the same type and objects of different types. Its abstract and broad nature allows it to reach into and connect several different branches of mathematics: algebra, geometry, topology, analysis, etc. A central theme of category theory is abstraction, understanding objects by gen- eralizing rather than focusing on them individually. Similar to taxonomy, category theory offers a way for mathematical concepts to be abstracted and unified. What makes category theory more than just an organizational system, however, is its abil- ity to generate information about these abstract objects by studying their relations to each other. This ability comes from what Emily Riehl calls \arguably the most important result in category theory"[4], the Yoneda Lemma. The Yoneda Lemma allows us to formally define an object by its relations to other objects, which is central to the relation-oriented perspective taken by category theory.
    [Show full text]
  • Monads and Interpolads in Bicategories
    Theory and Applications of Categories, Vol. 3, No. 8, 1997, pp. 182{212. MONADS AND INTERPOLADS IN BICATEGORIES JURGEN¨ KOSLOWSKI Transmitted by R. J. Wood ABSTRACT. Given a bicategory, Y , with stable local coequalizers, we construct a bicategory of monads Y -mnd by using lax functors from the generic 0-cell, 1-cell and 2-cell, respectively, into Y . Any lax functor into Y factors through Y -mnd and the 1-cells turn out to be the familiar bimodules. The locally ordered bicategory rel and its bicategory of monads both fail to be Cauchy-complete, but have a well-known Cauchy- completion in common. This prompts us to formulate a concept of Cauchy-completeness for bicategories that are not locally ordered and suggests a weakening of the notion of monad. For this purpose, we develop a calculus of general modules between unstruc- tured endo-1-cells. These behave well with respect to composition, but in general fail to have identities. To overcome this problem, we do not need to impose the full struc- ture of a monad on endo-1-cells. We show that associative coequalizing multiplications suffice and call the resulting structures interpolads. Together with structure-preserving i-modules these form a bicategory Y -int that is indeed Cauchy-complete, in our sense, and contains the bicategory of monads as a not necessarily full sub-bicategory. Inter- polads over rel are idempotent relations, over the suspension of set they correspond to interpolative semi-groups, and over spn they lead to a notion of \category without identities" also known as \taxonomy".
    [Show full text]
  • Friday September 20 Lecture Notes
    Friday September 20 Lecture Notes 1 Functors Definition Let C and D be categories. A functor (or covariant) F is a function that assigns each C 2 Obj(C) an object F (C) 2 Obj(D) and to each f : A ! B in C, a morphism F (f): F (A) ! F (B) in D, satisfying: For all A 2 Obj(C), F (1A) = 1FA. Whenever fg is defined, F (fg) = F (f)F (g). e.g. If C is a category, then there exists an identity functor 1C s.t. 1C(C) = C for C 2 Obj(C) and for every morphism f of C, 1C(f) = f. For any category from universal algebra we have \forgetful" functors. e.g. Take F : Grp ! Cat of monoids (·; 1). Then F (G) is a group viewed as a monoid and F (f) is a group homomorphism f viewed as a monoid homomor- phism. e.g. If C is any universal algebra category, then F : C! Sets F (C) is the underlying sets of C F (f) is a morphism e.g. Let C be a category. Take A 2 Obj(C). Then if we define a covariant Hom functor, Hom(A; ): C! Sets, defined by Hom(A; )(B) = Hom(A; B) for all B 2 Obj(C) and f : B ! C, then Hom(A; )(f) : Hom(A; B) ! Hom(A; C) with g 7! fg (we denote Hom(A; ) by f∗). Let us check if f∗ is a functor: Take B 2 Obj(C). Then Hom(A; )(1B) = (1B)∗ : Hom(A; B) ! Hom(A; B) and for g 2 Hom(A; B), (1B)∗(g) = 1Bg = g.
    [Show full text]
  • Higher Correspondences, Simplicial Maps and Inner Fibrations
    Higher correspondences, simplicial maps and inner fibrations Redi Haderi [email protected] May 2020 Abstract In this essay we propose a realization of Lurie’s claim that inner fi- brations p : X → C are classified by C-indexed diangrams in a ”higher category” whose objects are ∞-categories, morphisms are correspondences between them and higher morphisms are higher correspondences. We will obtain this as a corollary of a more general result which classifies all sim- plicial maps. Correspondences between ∞-categories, and simplicial sets in general, are a generalization of the concept of profunctor (or bimodule) for cat- egories. While categories, functors and profunctors are organized in a double category, we will exibit simplicial sets, simplicial maps, and corre- spondences as part of a simpliclal category. This allows us to make precise statements and proofs. Our main tool is the theory of double colimits. arXiv:2005.11597v1 [math.AT] 23 May 2020 1 Notation and terminology We will mostly observe standard notation and terminology. Generic categories are denoted by calligraphic capital letters C, D etc., while particular categories are denoted by the name of their objects in bold characters. For example Set, Cat, sSet are the categories of sets, categories and simplicial sets. ∆ denotes the category of finite ordinals and order preserving maps as usual, n while ∆ denotes the standard n-simplex. For a simplicial set X, Xn refers to its set of n-simplices. Given the nature of our discussion the term ”simplicial category” means simplicial object in the category of categories. We refer to simplicially enriched categories as sSet-categories.
    [Show full text]
  • Adjoint and Representable Functors
    What underlies dual-process cognition? Adjoint and representable functors Steven Phillips ([email protected]) Mathematical Neuroinformatics Group, Human Informatics Research Institute, National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba, Ibaraki 305-8566 JAPAN Abstract & Stanovich, 2013, for the model and responses to the five criticisms). According to this model, cognition defaults to Despite a general recognition that there are two styles of think- ing: fast, reflexive and relatively effortless (Type 1) versus slow, Type 1 processes that can be intervened upon by Type 2 pro- reflective and effortful (Type 2), dual-process theories of cogni- cesses in response to task demands. However, this model is tion remain controversial, in particular, for their vagueness. To still far from the kinds of formal, computational explanations address this lack of formal precision, we take a mathematical category theory approach towards understanding what under- that prevail in cognitive science. lies the relationship between dual cognitive processes. From our category theory perspective, we show that distinguishing ID Criticism of dual-process theories features of Type 1 versus Type 2 processes are exhibited via adjoint and representable functors. These results suggest that C1 Theories are multitudinous and definitions vague category theory provides a useful formal framework for devel- C2 Type 1/2 distinctions do not reliably align oping dual-process theories of cognition. C3 Cognitive styles vary continuously, not discretely Keywords: dual-process; Type 1; Type 2; category theory; C4 Single-process theories provide better explanations category; functor; natural transformation; adjoint C5 Evidence for dual-processing is unconvincing Introduction Table 2: Five criticisms of dual-process theories (Evans & Intuitively, at least, human cognition involves two starkly dif- Stanovich, 2013).
    [Show full text]
  • Profunctors, Open Maps and Bisimulation
    BRICS RS-04-22 Cattani & Winskel: Profunctors, Open Maps and Bisimulation BRICS Basic Research in Computer Science Profunctors, Open Maps and Bisimulation Gian Luca Cattani Glynn Winskel BRICS Report Series RS-04-22 ISSN 0909-0878 October 2004 Copyright c 2004, Gian Luca Cattani & Glynn Winskel. BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS Department of Computer Science University of Aarhus Ny Munkegade, building 540 DK–8000 Aarhus C Denmark Telephone: +45 8942 3360 Telefax: +45 8942 3255 Internet: [email protected] BRICS publications are in general accessible through the World Wide Web and anonymous FTP through these URLs: http://www.brics.dk ftp://ftp.brics.dk This document in subdirectory RS/04/22/ Profunctors, Open Maps and Bisimulation∗ Gian Luca Cattani DS Data Systems S.p.A., Via Ugozzolo 121/A, I-43100 Parma, Italy. Email: [email protected]. Glynn Winskel University of Cambridge Computer Laboratory, Cambridge CB3 0FD, England. Email: [email protected]. October 2004 Abstract This paper studies fundamental connections between profunctors (i.e., dis- tributors, or bimodules), open maps and bisimulation. In particular, it proves that a colimit preserving functor between presheaf categories (corresponding to a profunctor) preserves open maps and open map bisimulation. Consequently, the composition of profunctors preserves open maps as 2-cells.
    [Show full text]
  • 1 Category Theory
    {-# LANGUAGE RankNTypes #-} module AbstractNonsense where import Control.Monad 1 Category theory Definition 1. A category consists of • a collection of objects • and a collection of morphisms between those objects. We write f : A → B for the morphism f connecting the object A to B. • Morphisms are closed under composition, i.e. for morphisms f : A → B and g : B → C there exists the composed morphism h = f ◦ g : A → C1. Furthermore we require that • Composition is associative, i.e. f ◦ (g ◦ h) = (f ◦ g) ◦ h • and for each object A there exists an identity morphism idA such that for all morphisms f : A → B: f ◦ idB = idA ◦ f = f Many mathematical structures form catgeories and thus the theorems and con- structions of category theory apply to them. As an example consider the cate- gories • Set whose objects are sets and morphisms are functions between those sets. • Grp whose objects are groups and morphisms are group homomorphisms, i.e. structure preserving functions, between those groups. 1.1 Functors Category theory is mainly interested in relationships between different kinds of mathematical structures. Therefore the fundamental notion of a functor is introduced: 1The order of the composition is to be read from left to right in contrast to standard mathematical notation. 1 Definition 2. A functor F : C → D is a transformation between categories C and D. It is defined by its action on objects F (A) and morphisms F (f) and has to preserve the categorical structure, i.e. for any morphism f : A → B: F (f(A)) = F (f)(F (A)) which can also be stated graphically as the commutativity of the following dia- gram: F (f) F (A) F (B) f A B Alternatively we can state that functors preserve the categorical structure by the requirement to respect the composition of morphisms: F (idC) = idD F (f) ◦ F (g) = F (f ◦ g) 1.2 Natural transformations Taking the construction a step further we can ask for transformations between functors.
    [Show full text]
  • Colimits and Profunctors
    Colimits and Profunctors Robert Par´e Dalhousie University [email protected] June 14, 2012 The Problem For two diagrams I JJ Γ Φ A what is the most general kind of morphism Γ / Φ which will produce a morphism lim Γ lim Φ? −! / −! Answer: A morphism lim Γ lim Φ. −! / −! Want something more syntactic? E.g. F IIJ/ J Γ Φ A The Problem For two diagrams I JJ Γ Φ A what is the most general kind of morphism Γ / Φ which will produce a morphism lim Γ lim Φ? −! / −! Answer: A morphism lim Γ lim Φ. −! / −! Want something more syntactic? E.g. F IIJφ / J +3 Γ Φ A Example A0 B0 g0 g1 f f 0 1 A / B B 1 p1 1 2 f h k A B p1f0 = g0p2 p1f1 = g0p3 g1p2 = g1p3 Thus we get hp1f0 = hg0p2 = kg1p2 = kg1p3 = hg0p3 = hp1f1 So there is a unique p such that pf = hp1. Problems I Different schemes (number of arrows, placement, equations) may give the same p I It might be difficult to compose such schemes On the positive side I It is equational so for any functor F : A / B for which the coequalizer and pushout below exist we get an induced morphism q The Problem (Refined) For two diagrams I JJ Γ Φ A what is the most general kind of morphism Γ / Φ which will produce a morphism lim F Γ lim F Φ −! / −! for every F : A B for which the lim's exist? / −! I Should be natural in F (in a way to be specified) op Take F to be the Yoneda embedding Y : A / SetA .
    [Show full text]
  • Combinatorial Species and Labelled Structures Brent Yorgey University of Pennsylvania, [email protected]
    University of Pennsylvania ScholarlyCommons Publicly Accessible Penn Dissertations 1-1-2014 Combinatorial Species and Labelled Structures Brent Yorgey University of Pennsylvania, [email protected] Follow this and additional works at: http://repository.upenn.edu/edissertations Part of the Computer Sciences Commons, and the Mathematics Commons Recommended Citation Yorgey, Brent, "Combinatorial Species and Labelled Structures" (2014). Publicly Accessible Penn Dissertations. 1512. http://repository.upenn.edu/edissertations/1512 This paper is posted at ScholarlyCommons. http://repository.upenn.edu/edissertations/1512 For more information, please contact [email protected]. Combinatorial Species and Labelled Structures Abstract The theory of combinatorial species was developed in the 1980s as part of the mathematical subfield of enumerative combinatorics, unifying and putting on a firmer theoretical basis a collection of techniques centered around generating functions. The theory of algebraic data types was developed, around the same time, in functional programming languages such as Hope and Miranda, and is still used today in languages such as Haskell, the ML family, and Scala. Despite their disparate origins, the two theories have striking similarities. In particular, both constitute algebraic frameworks in which to construct structures of interest. Though the similarity has not gone unnoticed, a link between combinatorial species and algebraic data types has never been systematically explored. This dissertation lays the theoretical groundwork for a precise—and, hopefully, useful—bridge bewteen the two theories. One of the key contributions is to port the theory of species from a classical, untyped set theory to a constructive type theory. This porting process is nontrivial, and involves fundamental issues related to equality and finiteness; the recently developed homotopy type theory is put to good use formalizing these issues in a satisfactory way.
    [Show full text]
  • Locally Cartesian Closed Categories, Coalgebras, and Containers
    U.U.D.M. Project Report 2013:5 Locally cartesian closed categories, coalgebras, and containers Tilo Wiklund Examensarbete i matematik, 15 hp Handledare: Erik Palmgren, Stockholms universitet Examinator: Vera Koponen Mars 2013 Department of Mathematics Uppsala University Contents 1 Algebras and Coalgebras 1 1.1 Morphisms .................................... 2 1.2 Initial and terminal structures ........................... 4 1.3 Functoriality .................................... 6 1.4 (Co)recursion ................................... 7 1.5 Building final coalgebras ............................. 9 2 Bundles 13 2.1 Sums and products ................................ 14 2.2 Exponentials, fibre-wise ............................. 18 2.3 Bundles, fibre-wise ................................ 19 2.4 Lifting functors .................................. 21 2.5 A choice theorem ................................. 22 3 Enriching bundles 25 3.1 Enriched categories ................................ 26 3.2 Underlying categories ............................... 29 3.3 Enriched functors ................................. 31 3.4 Convenient strengths ............................... 33 3.5 Natural transformations .............................. 41 4 Containers 45 4.1 Container functors ................................ 45 4.2 Natural transformations .............................. 47 4.3 Strengths, revisited ................................ 50 4.4 Using shapes ................................... 53 4.5 Final remarks ................................... 56 i Introduction
    [Show full text]