A Universal Property of the Convolution Monoidal Structure
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Table of Contents
UNIVERSAL PROPERTY & CASUALTY INSURANCE COMPANY MASSACHUSETTS PERSONAL PROPERTY MANUAL HOMEOWNERS PROGRAM EDITION 02/15 TABLE OF CONTENTS RULE CONTENT PAGE NO. 1 Application of Program Rules 1 2 Reserved for Future Use 1 3 Extent of Coverage 1 4 Reserved for Future Use 1 5 Policy Fee 1 6 Reserved for Future Use 1 7 Policy Period, Minimum Premium and Waiver of Premium 1 8 Rounding of Premiums 1 9 Changes and Mid-Term Premium Adjustments 2 10 Effective Date and Important Notices 2 11 Protective Device Credits 2 12 Townhouses or Rowhouses 2 13 Underwriting Surcharges 3 14 Mandatory Additional Charges 3 15 Payment and Payment Plan Options 4 16 Building Code Compliance 5 100 Reserved for Future Use 5 101 Limits of Liability and Coverage Relationship 6 102 Description of Coverages 6 103 Mandatory Coverages 7 104 Eligibility 7 105 Secondary Residence Premises 9 106 Reserved for Future Use 9 107 Construction Definitions 9 108 Seasonal Dwelling Definition 9 109 Single Building Definition 9 201 Policy Period 9 202 Changes or Cancellations 9 203 Manual Premium Revision 9 204 Reserved for Future Use 10 205 Reserved for Future Use 10 206 Transfer or Assignment 10 207 Reserved for Future Use 10 208 Premium Rounding Rule 10 209 Reserved for Future Use 10 300 Key Factor Interpolation Computation 10 301 Territorial Base Rates 11 401 Reserved for Future Use 20 402 Personal Property (Coverage C ) Replacement Cost Coverage 20 403 Age of Home 20 404 Ordinance or Law Coverage - Increased Limits 21 405 Debris Removal – HO 00 03 21 406 Deductibles 22 407 Additional -
Arxiv:1705.02246V2 [Math.RT] 20 Nov 2019 Esyta Ulsubcategory Full a That Say [15]
WIDE SUBCATEGORIES OF d-CLUSTER TILTING SUBCATEGORIES MARTIN HERSCHEND, PETER JØRGENSEN, AND LAERTIS VASO Abstract. A subcategory of an abelian category is wide if it is closed under sums, summands, kernels, cokernels, and extensions. Wide subcategories provide a significant interface between representation theory and combinatorics. If Φ is a finite dimensional algebra, then each functorially finite wide subcategory of mod(Φ) is of the φ form φ∗ mod(Γ) in an essentially unique way, where Γ is a finite dimensional algebra and Φ −→ Γ is Φ an algebra epimorphism satisfying Tor (Γ, Γ) = 0. 1 Let F ⊆ mod(Φ) be a d-cluster tilting subcategory as defined by Iyama. Then F is a d-abelian category as defined by Jasso, and we call a subcategory of F wide if it is closed under sums, summands, d- kernels, d-cokernels, and d-extensions. We generalise the above description of wide subcategories to this setting: Each functorially finite wide subcategory of F is of the form φ∗(G ) in an essentially φ Φ unique way, where Φ −→ Γ is an algebra epimorphism satisfying Tord (Γ, Γ) = 0, and G ⊆ mod(Γ) is a d-cluster tilting subcategory. We illustrate the theory by computing the wide subcategories of some d-cluster tilting subcategories ℓ F ⊆ mod(Φ) over algebras of the form Φ = kAm/(rad kAm) . Dedicated to Idun Reiten on the occasion of her 75th birthday 1. Introduction Let d > 1 be an integer. This paper introduces and studies wide subcategories of d-abelian categories as defined by Jasso. The main examples of d-abelian categories are d-cluster tilting subcategories as defined by Iyama. -
Universal Properties, Free Algebras, Presentations
Universal Properties, Free Algebras, Presentations Modern Algebra 1 Fall 2016 Modern Algebra 1 (Fall 2016) Universal Properties, Free Algebras, Presentations 1 / 14 (1) f ◦ g exists if and only if dom(f ) = cod(g). (2) Composition is associative when it is defined. (3) dom(f ◦ g) = dom(g), cod(f ◦ g) = cod(f ). (4) If A = dom(f ) and B = cod(f ), then f ◦ idA = f and idB ◦ f = f . (5) dom(idA) = cod(idA) = A. (1) Ob(C) = O is a class whose members are called objects, (2) Mor(C) = M is a class whose members are called morphisms, (3) ◦ : M × M ! M is a binary partial operation called composition, (4) id : O ! M is a unary function assigning to each object A 2 O a morphism idA called the identity of A, (5) dom; cod : M ! O are unary functions assigning to each morphism f objects called the domain and codomain of f respectively. The laws defining categories are: Defn (Category) A category is a 2-sorted partial algebra C = hO; M; ◦; id; dom; codi where Modern Algebra 1 (Fall 2016) Universal Properties, Free Algebras, Presentations 2 / 14 (1) f ◦ g exists if and only if dom(f ) = cod(g). (2) Composition is associative when it is defined. (3) dom(f ◦ g) = dom(g), cod(f ◦ g) = cod(f ). (4) If A = dom(f ) and B = cod(f ), then f ◦ idA = f and idB ◦ f = f . (5) dom(idA) = cod(idA) = A. (2) Mor(C) = M is a class whose members are called morphisms, (3) ◦ : M × M ! M is a binary partial operation called composition, (4) id : O ! M is a unary function assigning to each object A 2 O a morphism idA called the identity of A, (5) dom; cod : M ! O are unary functions assigning to each morphism f objects called the domain and codomain of f respectively. -
Notes and Solutions to Exercises for Mac Lane's Categories for The
Stefan Dawydiak Version 0.3 July 2, 2020 Notes and Exercises from Categories for the Working Mathematician Contents 0 Preface 2 1 Categories, Functors, and Natural Transformations 2 1.1 Functors . .2 1.2 Natural Transformations . .4 1.3 Monics, Epis, and Zeros . .5 2 Constructions on Categories 6 2.1 Products of Categories . .6 2.2 Functor categories . .6 2.2.1 The Interchange Law . .8 2.3 The Category of All Categories . .8 2.4 Comma Categories . 11 2.5 Graphs and Free Categories . 12 2.6 Quotient Categories . 13 3 Universals and Limits 13 3.1 Universal Arrows . 13 3.2 The Yoneda Lemma . 14 3.2.1 Proof of the Yoneda Lemma . 14 3.3 Coproducts and Colimits . 16 3.4 Products and Limits . 18 3.4.1 The p-adic integers . 20 3.5 Categories with Finite Products . 21 3.6 Groups in Categories . 22 4 Adjoints 23 4.1 Adjunctions . 23 4.2 Examples of Adjoints . 24 4.3 Reflective Subcategories . 28 4.4 Equivalence of Categories . 30 4.5 Adjoints for Preorders . 32 4.5.1 Examples of Galois Connections . 32 4.6 Cartesian Closed Categories . 33 5 Limits 33 5.1 Creation of Limits . 33 5.2 Limits by Products and Equalizers . 34 5.3 Preservation of Limits . 35 5.4 Adjoints on Limits . 35 5.5 Freyd's adjoint functor theorem . 36 1 6 Chapter 6 38 7 Chapter 7 38 8 Abelian Categories 38 8.1 Additive Categories . 38 8.2 Abelian Categories . 38 8.3 Diagram Lemmas . 39 9 Special Limits 41 9.1 Interchange of Limits . -
Universal Property & Casualty Insurance Company
UNIVERSAL PROPERTY & CASUALTY INSURANCE COMPANY FLORIDA PERSONAL PROPERTY MANUAL DWELLING SECTION TABLE OF CONTENTS RULE CONTENT PAGE NO. 1 Introduction 1 2 Applications for Insurance 1 3 Extent of Coverage 6 4 Cancellations 6 5 Policy Fee 7 6 Commissions 8 7 Policy Period, Minimum Premium and Waiver of Premium 8 8 Rounding of Premiums 8 9 Changes and Mid-Term Premium Adjustments 8 10 Effective Date and Important Notices 8 11 Protective Device Discounts 9 12 Townhouse or Rowhouse 9 13 Underwriting Surcharges 10 14 Mandatory Additional Charges 10 15 Payment and Payment Plan Options 11 16 Building Code Compliance 12 100 Additional Underwriting Requirements – Dwelling Program 15 101 Forms, Coverage, Minimum Limits of Liability 16 102 Perils Insured Against 17 103 Eligibility 18 104 Reserved for Future Use 19 105 Seasonal Dwelling Definition 19 106 Construction Definitions 19 107 Single Building Definition 19 201 Policy Period 20 202 Changes or Cancellations 20 203 Manual Premium Revision 20 204 Multiple Locations 20 205 Reserved for Future Use 20 206 Transfer or Assignment 20 207 Reserved for Future Use 20 208 Reserved for Future Use 20 209 Whole Dollar Premium Rule 20 301 Base Premium Computation 21 302 Vandalism and Malicious Mischief – DP 00 01 Only 32 303 Reserved for Future Use 32 304 Permitted Incidental Occupancies 32 306 Hurricane Rates 33 402 Superior Construction 36 403 Reserved for Future Use 36 404 Dwelling Under Construction 36 405 Reserved for Future Use 36 406 Water Back-up and Sump Discharge or Overflow - Florida 36 407 Deductibles -
Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1
Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1: A directed set I is a set with a partial order ≤ such that for every i; j 2 I there is k 2 I such that i ≤ k and j ≤ k. Let R be a ring. A directed system of R-modules indexed by I is a collection of R modules fMi j i 2 Ig with a R module homomorphisms µi;j : Mi ! Mj for each pair i; j 2 I where i ≤ j, such that (i) for any i 2 I, µi;i = IdMi and (ii) for any i ≤ j ≤ k in I, µi;j ◦ µj;k = µi;k. We shall denote a directed system by a tuple (Mi; µi;j). The direct limit of a directed system is defined using a universal property. It exists and is unique up to a unique isomorphism. Theorem 2 (Direct limits). Let fMi j i 2 Ig be a directed system of R modules then there exists an R module M with the following properties: (i) There are R module homomorphisms µi : Mi ! M for each i 2 I, satisfying µi = µj ◦ µi;j whenever i < j. (ii) If there is an R module N such that there are R module homomorphisms νi : Mi ! N for each i and νi = νj ◦µi;j whenever i < j; then there exists a unique R module homomorphism ν : M ! N, such that νi = ν ◦ µi. The module M is unique in the sense that if there is any other R module M 0 satisfying properties (i) and (ii) then there is a unique R module isomorphism µ0 : M ! M 0. -
Relations: Categories, Monoidal Categories, and Props
Logical Methods in Computer Science Vol. 14(3:14)2018, pp. 1–25 Submitted Oct. 12, 2017 https://lmcs.episciences.org/ Published Sep. 03, 2018 UNIVERSAL CONSTRUCTIONS FOR (CO)RELATIONS: CATEGORIES, MONOIDAL CATEGORIES, AND PROPS BRENDAN FONG AND FABIO ZANASI Massachusetts Institute of Technology, United States of America e-mail address: [email protected] University College London, United Kingdom e-mail address: [email protected] Abstract. Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic interpretation for diagrams is given in terms of relations or corelations (generalised equivalence relations) of some kind. In this paper we show how semantic categories of both relations and corelations can be characterised as colimits of simpler categories. This modular perspective is important as it simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams. Moreover, our general result unifies various theorems that are independently found in literature and are relevant for program semantics, quantum computation and control theory. 1. Introduction Network-style diagrammatic languages appear in diverse fields as a tool to reason about computational models of various kinds, including signal processing circuits, quantum pro- cesses, Bayesian networks and Petri nets, amongst many others. In the last few years, there have been more and more contributions towards a uniform, formal theory of these languages which borrows from the well-established methods of programming language semantics. A significant insight stemming from many such approaches is that a compositional analysis of network diagrams, enabling their reduction to elementary components, is more effective when system behaviour is thought of as a relation instead of a function. -
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. -
DUAL TANGENT STRUCTURES for ∞-TOPOSES In
DUAL TANGENT STRUCTURES FOR 1-TOPOSES MICHAEL CHING Abstract. We describe dual notions of tangent bundle for an 1-topos, each underlying a tangent 1-category in the sense of Bauer, Burke and the author. One of those notions is Lurie's tangent bundle functor for presentable 1-categories, and the other is its adjoint. We calculate that adjoint for injective 1-toposes, where it is given by applying Lurie's tangent bundle on 1-categories of points. In [BBC21], Bauer, Burke, and the author introduce a notion of tangent 1- category which generalizes the Rosick´y[Ros84] and Cockett-Cruttwell [CC14] axiomatization of the tangent bundle functor on the category of smooth man- ifolds and smooth maps. We also constructed there a significant example: diff the Goodwillie tangent structure on the 1-category Cat1 of (differentiable) 1-categories, which is built on Lurie's tangent bundle functor. That tan- gent structure encodes the ideas of Goodwillie's calculus of functors [Goo03] and highlights the analogy between that theory and the ordinary differential calculus of smooth manifolds. The goal of this note is to introduce two further examples of tangent 1- categories: one on the 1-category of 1-toposes and geometric morphisms, op which we denote Topos1, and one on the opposite 1-category Topos1 which, following Anel and Joyal [AJ19], we denote Logos1. These two tangent structures each encode a notion of tangent bundle for 1- toposes, but from dual perspectives. As described in [AJ19, Sec. 4], one can view 1-toposes either from a `geometric' or `algebraic' point of view. -
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. -
Toward a Non-Commutative Gelfand Duality: Boolean Locally Separated Toposes and Monoidal Monotone Complete $ C^{*} $-Categories
Toward a non-commutative Gelfand duality: Boolean locally separated toposes and Monoidal monotone complete C∗-categories Simon Henry February 23, 2018 Abstract ** Draft Version ** To any boolean topos one can associate its category of internal Hilbert spaces, and if the topos is locally separated one can consider a full subcategory of square integrable Hilbert spaces. In both case it is a symmetric monoidal monotone complete C∗-category. We will prove that any boolean locally separated topos can be reconstructed as the classifying topos of “non-degenerate” monoidal normal ∗-representations of both its category of internal Hilbert spaces and its category of square integrable Hilbert spaces. This suggest a possible extension of the usual Gelfand duality between a class of toposes (or more generally localic stacks or localic groupoids) and a class of symmetric monoidal C∗-categories yet to be discovered. Contents 1 Introduction 2 2 General preliminaries 3 3 Monotone complete C∗-categories and booleantoposes 6 4 Locally separated toposes and square integrable Hilbert spaces 7 5 Statementofthemaintheorems 9 arXiv:1501.07045v1 [math.CT] 28 Jan 2015 6 From representations of red togeometricmorphisms 13 6.1 Construction of the geometricH morphism on separating objects . 13 6.2 Functorialityonseparatingobject . 20 6.3 ConstructionoftheGeometricmorphism . 22 6.4 Proofofthe“reduced”theorem5.8 . 25 Keywords. Boolean locally separated toposes, monotone complete C*-categories, recon- struction theorem. 2010 Mathematics Subject Classification. 18B25, 03G30, 46L05, 46L10 . email: [email protected] 1 7 On the category ( ) and its representations 26 H T 7.1 The category ( /X ) ........................ 26 7.2 TensorisationH byT square integrable Hilbert space . -
Monoidal Functors, Equivalence of Monoidal Categories
14 1.4. Monoidal functors, equivalence of monoidal categories. As we have explained, monoidal categories are a categorification of monoids. Now we pass to categorification of morphisms between monoids, namely monoidal functors. 0 0 0 0 0 Definition 1.4.1. Let (C; ⊗; 1; a; ι) and (C ; ⊗ ; 1 ; a ; ι ) be two monoidal 0 categories. A monoidal functor from C to C is a pair (F; J) where 0 0 ∼ F : C ! C is a functor, and J = fJX;Y : F (X) ⊗ F (Y ) −! F (X ⊗ Y )jX; Y 2 Cg is a natural isomorphism, such that F (1) is isomorphic 0 to 1 . and the diagram (1.4.1) a0 (F (X) ⊗0 F (Y )) ⊗0 F (Z) −−F− (X−)−;F− (Y− )−;F− (Z!) F (X) ⊗0 (F (Y ) ⊗0 F (Z)) ? ? J ⊗0Id ? Id ⊗0J ? X;Y F (Z) y F (X) Y;Z y F (X ⊗ Y ) ⊗0 F (Z) F (X) ⊗0 F (Y ⊗ Z) ? ? J ? J ? X⊗Y;Z y X;Y ⊗Z y F (aX;Y;Z ) F ((X ⊗ Y ) ⊗ Z) −−−−−−! F (X ⊗ (Y ⊗ Z)) is commutative for all X; Y; Z 2 C (“the monoidal structure axiom”). A monoidal functor F is said to be an equivalence of monoidal cate gories if it is an equivalence of ordinary categories. Remark 1.4.2. It is important to stress that, as seen from this defini tion, a monoidal functor is not just a functor between monoidal cate gories, but a functor with an additional structure (the isomorphism J) satisfying a certain equation (the monoidal structure axiom).