Corner, Alexander S. (2016) Day convolution for monoidal bicategories. PhD thesis, University of Sheffield.
Abstract
Ends and coends can be described as objects which are universal amongst extranatural transformations. 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 [C^op ,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. This monoidal structure describes [C^op ,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 [C^op ,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(A^op ,Cat) is a monoidal bicategory.
Metadata
Supervisors: | Gurski, Nick |
---|---|
Awarding institution: | University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Science (Sheffield) > School of Mathematics and Statistics (Sheffield) |
Identification Number/EthosID: | uk.bl.ethos.707102 |
Depositing User: | Alexander S. Corner |
Date Deposited: | 31 Mar 2017 13:57 |
Last Modified: | 12 Oct 2018 09:36 |
Download
Alexander_Corner_PhD_Thesis
Filename: Alexander_Corner_PhD_Thesis.pdf
Licence:
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 2.5 License
Export
Statistics
You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.