Group Actions on Bicategories and Topological Quantum Field Theories
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Profunctors in Mal'cev Categories and Fractions of Functors
PROFUNCTORS IN MALTCEV CATEGORIES AND FRACTIONS OF FUNCTORS S. MANTOVANI, G. METERE, E. M. VITALE ABSTRACT. We study internal profunctors and their normalization under various conditions on the base category. In the Maltcev case we give an easy characterization of profunctors. Moreover, when the base category is efficiently regular, we characterize those profunctors which are fractions of internal functors with respect to weak equiva- lences. 1. Introduction In this paper we study internal profunctors in a category C; from diverse points of view. We start by analyzing their very definition in the case C is Maltcev. It is well known that the algebraic constraints inherited by the Maltcev condition make internal categorical constructions often easier to deal with. For instance, internal cate- gories are groupoids, and their morphisms are just morphisms of the underlying reflective graphs. Along these lines, internal profunctors, that generalize internal functors are in- volved in a similar phenomenon: it turns out (Proposition 3.1) that in Maltcev categories one of the axioms defining internal profunctors can be obtained by the others. Our interest in studying internal profunctors in this context, comes from an attempt to describe internally monoidal functors of 2-groups as weak morphisms of internal groupoids. In the case of groups, the problem has been solved by introducing the notion of butterfly by B. Noohi in [22] (see also [2] for a stack version). In [1] an internal version of butterflies has been defined in a semi-abelian context, and it has been proved that they give rise to the bicategory of fractions of Grpd(C) (the 2-category of internal groupoids and internal functors) with respect to weak equivalences. -
Two Constructions in Monoidal Categories Equivariantly Extended Drinfel’D Centers and Partially Dualized Hopf Algebras
Two constructions in monoidal categories Equivariantly extended Drinfel'd Centers and Partially dualized Hopf Algebras Dissertation zur Erlangung des Doktorgrades an der Fakult¨atf¨urMathematik, Informatik und Naturwissenschaften Fachbereich Mathematik der Universit¨atHamburg vorgelegt von Alexander Barvels Hamburg, 2014 Tag der Disputation: 02.07.2014 Folgende Gutachter empfehlen die Annahme der Dissertation: Prof. Dr. Christoph Schweigert und Prof. Dr. Sonia Natale Contents Introduction iii Topological field theories and generalizations . iii Extending braided categories . vii Algebraic structures and monoidal categories . ix Outline . .x 1. Algebra in monoidal categories 1 1.1. Conventions and notations . .1 1.2. Categories of modules . .3 1.3. Bialgebras and Hopf algebras . 12 2. Yetter-Drinfel'd modules 25 2.1. Definitions . 25 2.2. Equivalences of Yetter-Drinfel'd categories . 31 3. Graded categories and group actions 39 3.1. Graded categories and (co)graded bialgebras . 39 3.2. Weak group actions . 41 3.3. Equivariant categories and braidings . 48 4. Equivariant Drinfel'd center 51 4.1. Half-braidings . 51 4.2. The main construction . 55 4.3. The Hopf algebra case . 61 5. Partial dualization of Hopf algebras 71 5.1. Radford biproduct and projection theorem . 71 5.2. The partial dual . 73 5.3. Examples . 75 A. Category theory 89 A.1. Basic notions . 89 A.2. Adjunctions and monads . 91 i ii Contents A.3. Monoidal categories . 92 A.4. Modular categories . 97 References 99 Introduction The fruitful interplay between topology and algebra has a long tradi- tion. On one hand, invariants of topological spaces, such as the homotopy groups, homology groups, etc. -
Categorical Proof of Holomorphic Atiyah-Bott Formula
Categorical proof of Holomorphic Atiyah-Bott formula Grigory Kondyrev, Artem Prikhodko Abstract Given a 2-commutative diagram FX X / X ϕ ϕ Y / Y FY in a symmetric monoidal (∞, 2)-category E where X, Y ∈ E are dualizable objects and ϕ admits a right adjoint we construct a natural morphism TrE(FX ) / TrE(FY ) between the traces of FX and FY respectively. We then apply this formalism to the case when E is the (∞, 2)-category of k-linear presentable categories which in combination of various calculations in the setting of derived algebraic geometry gives a categorical proof of the classical Atiyah-Bott formula (also known as the Holomorphic Lefschetz fixed point formula). Contents 1 Dualizable objects and traces 4 1.1 Traces in symmetric monoidal (∞, 1)-categories .. .. .. .. .. .. .. 4 1.2 Traces in symmetric monoidal (∞, 2)-categories .. .. .. .. .. .. .. 5 2 Traces in algebraic geometry 11 2.1 Duality for Quasi-Coherent sheaves . .............. 11 2.2 Calculatingthetrace. .. .. .. .. .. .. .. .. .......... 13 3 Holomorphic Atiyah-Bott formula 16 3.1 Statement of Atiyah-Bott formula . ............ 17 3.2 ProofofAtiyah-Bottformula . ........... 19 arXiv:1607.06345v3 [math.AG] 12 Nov 2019 Introduction The well-known Lefschetz fixed point theorem [Lef26, Formula 71.1] states that for a compact manifold f M and an endomorphism M / M with isolated fixed points there is an equality 2dim M i ∗ L(f) := (−1) tr(f|Hi(X,Q))= degx(1 − f) (1) Xi=0 x=Xf(x) The formula (1) made huge impact on algebraic geometry in 20th century leading Grothendieck and co- authors to development of ´etale cohomology theory and their spectacular proof of Weil’s conjectures. -
PULLBACK and BASE CHANGE Contents
PART II.2. THE !-PULLBACK AND BASE CHANGE Contents Introduction 1 1. Factorizations of morphisms of DG schemes 2 1.1. Colimits of closed embeddings 2 1.2. The closure 4 1.3. Transitivity of closure 5 2. IndCoh as a functor from the category of correspondences 6 2.1. The category of correspondences 6 2.2. Proof of Proposition 2.1.6 7 3. The functor of !-pullback 8 3.1. Definition of the functor 9 3.2. Some properties 10 3.3. h-descent 10 3.4. Extension to prestacks 11 4. The multiplicative structure and duality 13 4.1. IndCoh as a symmetric monoidal functor 13 4.2. Duality 14 5. Convolution monoidal categories and algebras 17 5.1. Convolution monoidal categories 17 5.2. Convolution algebras 18 5.3. The pull-push monad 19 5.4. Action on a map 20 References 21 Introduction Date: September 30, 2013. 1 2 THE !-PULLBACK AND BASE CHANGE 1. Factorizations of morphisms of DG schemes In this section we will study what happens to the notion of the closure of the image of a morphism between schemes in derived algebraic geometry. The upshot is that there is essentially \nothing new" as compared to the classical case. 1.1. Colimits of closed embeddings. In this subsection we will show that colimits exist and are well-behaved in the category of closed subschemes of a given ambient scheme. 1.1.1. Recall that a map X ! Y in Sch is called a closed embedding if the map clX ! clY is a closed embedding of classical schemes. -
Epapyrus PDF Document
KyungpooJ‘ Math ]. Volume 18. Number 2 ,December. 1978 ON REFLECTIVE SUBCATEGORIES By Cho, Y ong-Seung Let α be a given fulI subcategory of '?!. Under what conditions does there ‘exist a smalIest, replete, reflective subcategory α* of '?! for which α* contains α? The answer to this question is unknown. Even if '?! is the category of uniform spaces and uniform maps, it is an open question. J. F. Kennison :answered to the above question partialIy, in case '?! is a complete category with a well-founded bicategory structure and α is a fulI, replete and closed under the formation of products (1]. In this paper, the author could construct a ’ smalIest, replete, reflective subcategory α* of '?! for which α육 contains α under 'other conditions except the fact that α is full. Throughout this paper, our definitions and notations are based on ((1] , (5] , [6] , [10] , [11]). The class of all epimorphisms of '?! will be denoted by Efr and M '6' the class of alI monomorphisms of '?!. DEFINITION. Let '?! be a category and let 1 and P be classes of morphisms 'on '?!. Then (I, P) is a bz'category structure on '?! provided that: B-l) Every isomorphism is in Inp. B-2) [ and P are closed under the composition of morphisms. B-3) Every morphism 1 can be factored as 1=지 lowith 11 ε 1 and 1。, εP. Moreover this factorization is unique to within an isomorphism in the sense that if I=gh and gε 1 and hEP then there exists an isomorphism e for which ,elo= 1z and ge=/1• B-4) PCE B-5) ICM DEFINITION. -
Day Convolution for Monoidal Bicategories
Day convolution for monoidal bicategories Alexander S. Corner School of Mathematics and Statistics University of Sheffield A thesis submitted for the degree of Doctor of Philosophy August 2016 i Abstract Ends and coends, as described in [Kel05], can be described as objects which are universal amongst extranatural transformations [EK66b]. We describe a cate- gorification of this idea, extrapseudonatural transformations, in such a way that bicodescent objects are the objects which are universal amongst such transfor- mations. We recast familiar results about coends in this new setting, providing analogous results for bicodescent objects. In particular we prove a Fubini theorem for bicodescent objects. The free cocompletion of a category C is given by its category of presheaves [Cop; Set]. If C is also monoidal then its category of presheaves can be pro- vided with a monoidal structure via the convolution product of Day [Day70]. This monoidal structure describes [Cop; Set] as the free monoidal cocompletion of C. Day's more general statement, in the V-enriched setting, is that if C is a promonoidal V-category then [Cop; V] possesses a monoidal structure via the convolution product. We define promonoidal bicategories and go on to show that if A is a promonoidal bicategory then the bicategory of pseudofunctors Bicat(Aop; Cat) is a monoidal bicategory. ii Acknowledgements First I would like to thank my supervisor Nick Gurski, who has helped guide me from the definition of a category all the way into the wonderful, and often confusing, world of higher category theory. Nick has been a great supervisor and a great friend to have had through all of this who has introduced me to many new things, mathematical and otherwise. -
Most Human Things Go in Pairs. Alcmaeon, ∼ 450 BC
Most human things go in pairs. Alcmaeon, 450 BC ∼ true false good bad right left up down front back future past light dark hot cold matter antimatter boson fermion How can we formalize a general concept of duality? The Chinese tried yin-yang theory, which inspired Leibniz to develop binary notation, which in turn underlies digital computation! But what's the state of the art now? In category theory the fundamental duality is the act of reversing an arrow: • ! • • • We use this to model switching past and future, false and true, small and big... Every category has an opposite op, where the arrows are C C reversed. This is a symmetry of the category of categories: op : Cat Cat ! and indeed the only nontrivial one: Aut(Cat) = Z=2 In logic, the simplest duality is negation. It's order-reversing: if P implies Q then Q implies P : : and|ignoring intuitionism!|it's an involution: P = P :: Thus if is a category of propositions and proofs, we C expect a functor: : op : C ! C with a natural isomorphism: 2 = 1 : ∼ C This has two analogues in quantum theory. One shows up already in the category of finite-dimensional vector spaces, FinVect. Every vector space V has a dual V ∗. Taking the dual is contravariant: if f : V W then f : W V ! ∗ ∗ ! ∗ and|ignoring infinite-dimensional spaces!|it's an involution: V ∗∗ ∼= V This kind of duality is captured by the idea of a -autonomous ∗ category. Recall that a symmetric monoidal category is roughly a category with a unit object I and a tensor product C 2 C : ⊗ C × C ! C that is unital, associative and commutative up to coherent natural isomorphisms. -
Coherence for Braided and Symmetric Pseudomonoids
Coherence for braided and symmetric pseudomonoids Dominic Verdon School of Mathematics, University of Bristol December 4, 2018 Abstract Computads for unbraided, braided, and symmetric pseudomonoids in semistrict monoidal bicategories are defined. Biequivalences characterising the monoidal bicategories generated by these computads are proven. It is shown that these biequivalences categorify results in the theory of monoids and commutative monoids, and generalise the standard coher- ence theorems for braided and symmetric monoidal categories to braided and symmetric pseudomonoids in any weak monoidal bicategory. 1 Introduction 1.1 Overview Braided and symmetric pseudomonoids. Naked, braided and symmetric pseudomonoids are categorifications of noncommutative and commutative monoids, obtained by replacing equal- ity with coherent isomorphism. In the symmetric monoidal bicategory Cat of categories, func- tors and natural transformations, such structures are precisely naked, braided and symmetric monoidal categories. Naked, braided and symmetric pseudomonoids are more general, however, as they can be defined in any monoidal bicategory with the requisite braided structure [30]. Pseudomonoids in braided and symmetric monoidal bicategories arise in a variety of mathe- matical settings. By categorification of the representation theory of Hopf algebras, bicategories encoding the data of a four-dimensional topological field theory can be obtained as represen- tation categories of certain `Hopf' pseudomonoids [32, 8]. Pseudomonoids have also appeared recently in the the theory of surface foams, where certain pseudomonoids in a braided monoidal category represent knotted foams in four-dimensional space [7]. Many properties of monoidal categories can be formulated externally as structures on pseudomonoids; for instance, Street showed that Frobenius pseudomonoids correspond to star-autonomous categories [36], giving rise to a diagrammatic calculus for linear logic [13]. -
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. -
Constructing Symmetric Monoidal Bicategories Functorially
Constructing symmetric monoidal bicategories. functorially Constructing symmetric monoidal bicategories functorially Michael Shulman Linde Wester Hansen AMS Sectional Meeting UC Riverside Applied Category Theory Special Session November 9, 2019 Constructing symmetric monoidal bicategories. functorially Outline 1 Constructing symmetric monoidal bicategories. 2 . functorially Constructing symmetric monoidal bicategories. functorially Symmetric monoidal bicategories Symmetric monoidal bicategories are everywhere! 1 Rings and bimodules 2 Sets and spans 3 Sets and relations 4 Categories and profunctors 5 Manifolds and cobordisms 6 Topological spaces and parametrized spectra 7 Sets and (decorated/structured) cospans 8 Sets and open Markov processes 9 Vector spaces and linear relations Constructing symmetric monoidal bicategories. functorially What is a symmetric monoidal bicategory? A symmetric monoidal bicategory is a bicategory B with 1 A functor ⊗: B × B ! B 2 A pseudonatural equivalence (A ⊗ B) ⊗ C ' A ⊗ (B ⊗ C) 3 An invertible modification ((AB)C)D (A(BC))D A((BC)D) π + (AB)(CD) A(B(CD)) 4 = 5 more data and axioms for units, braiding, syllepsis. Constructing symmetric monoidal bicategories. functorially Surely it can't be that bad In all the examples I listed before, the monoidal structures 1 tensor product of rings 2 cartesian product of sets 3 cartesian product of spaces 4 disjoint union of sets 5 ... are actually associative up to isomorphism, with strictly commuting pentagons, etc. But a bicategory doesn't know how to talk about isomorphisms, only equivalences! We need to add extra data: ring homomorphisms, functions, linear maps, etc. Constructing symmetric monoidal bicategories. functorially Double categories A double category is an internal category in Cat. It has: 1 objects A; B; C;::: 2 loose morphisms A −7−! B that compose weakly 3 tight morphisms A ! B that compose strictly 4 2-cells shaped like squares: A j / B : + C j / D No one can agree on which morphisms to draw horizontally or vertically. -
Exercise Sheet
Exercises on Higher Categories Paolo Capriotti and Nicolai Kraus Midlands Graduate School, April 2017 Our course should be seen as a very first introduction to the idea of higher categories. This exercise sheet is a guide for the topics that we discuss in our four lectures, and some exercises simply consist of recalling or making precise concepts and constructions discussed in the lectures. The notion of a higher category is not one which has a single clean def- inition. There are numerous different approaches, of which we can only discuss a tiny fraction. In general, a very good reference is the nLab at https://ncatlab.org/nlab/show/HomePage. Apart from that, a very incomplete list for suggested further reading is the following (all available online). For an overview over many approaches: – Eugenia Cheng and Aaron Lauda, Higher-Dimensional Categories: an illustrated guide book available online, cheng.staff.shef.ac.uk/guidebook Introductions to simplicial sets: – Greg Friedman, An Elementary Illustrated Introduction to Simplicial Sets very gentle introduction, arXiv:0809.4221. – Emily Riehl, A Leisurely Introduction to Simplicial Sets a slightly more advanced introduction, www.math.jhu.edu/~eriehl/ssets.pdf Quasicategories: – Jacob Lurie, Higher Topos Theory available as paperback (ISBN-10: 0691140499) and online, arXiv:math/0608040 Operads (not discussed in our lectures): – Tom Leinster, Higher Operads, Higher Categories available as paperback (ISBN-10: 0521532159) and online, 1 arXiv:math/0305049 Note: Exercises are ordered by topic and can be done in any order, unless an exercise explicitly refers to a previous one. We recommend to do the exercises marked with an arrow ⇒ first. -
Categories with Fuzzy Sets and Relations
Categories with Fuzzy Sets and Relations John Harding, Carol Walker, Elbert Walker Department of Mathematical Sciences New Mexico State University Las Cruces, NM 88003, USA jhardingfhardy,[email protected] Abstract We define a 2-category whose objects are fuzzy sets and whose maps are relations subject to certain natural conditions. We enrich this category with additional monoidal and involutive structure coming from t-norms and negations on the unit interval. We develop the basic properties of this category and consider its relation to other familiar categories. A discussion is made of extending these results to the setting of type-2 fuzzy sets. 1 Introduction A fuzzy set is a map A : X ! I from a set X to the unit interval I. Several authors [2, 6, 7, 20, 22] have considered fuzzy sets as a category, which we will call FSet, where a morphism from A : X ! I to B : Y ! I is a function f : X ! Y that satisfies A(x) ≤ (B◦f)(x) for each x 2 X. Here we continue this path of investigation. The underlying idea is to lift additional structure from the unit interval, such as t-norms, t-conorms, and negations, to provide additional structure on the category. Our eventual aim is to provide a setting where processes used in fuzzy control can be abstractly studied, much in the spirit of recent categorical approaches to processes used in quantum computation [1]. Order preserving structure on I, such as t-norms and conorms, lifts to provide additional covariant structure on FSet. In fact, each t-norm T lifts to provide a symmetric monoidal tensor ⊗T on FSet.