Categories and Natural Transformations
|
|
- Violet O’Neal’
- 5 years ago
- Views:
Transcription
1 Categories and Natural Transormations Ethan Jerzak 17 August Introduction The motivation or studying Category Theory is to ormalise the underlying similarities between a broad range o mathematical ideas and use these generalities to gain insights into these more speciic structures. Because o its ormalised generality, we can use categories to understand traditionally vague concepts like natural and canonical more precisely. This paper will provide the basic concept o categories, introduce the language needed to study categories, and study some examples o amiliar mathematical objects which can be categorized. Particular emphasis will go to the concept o natural transormations, an important concept or relating dierent categories. 2 Categories 2.1 Deinition A category C is a collection o objects, denoted Ob(C ), together with a set o morphisms, denoted C (X, Y ), or each pair o objects X, Y Ob(C ). These morphisms must satisy the ollowing axioms: 1. For each X, Y, Z Ob(C ), there is a composition unction : C (Y, Z) C (X, Y ) C (X, Z) We can denote this morphism as simply g 2. For each X Ob(C ), there exists a distinguished element 1 X C (X, X) such that or any Y, Z Ob(C ) and C (Y, X), g C (X, Z) we have 1 X = and g 1 X = g 3. Composition is associative: h (g ) = (h g) Remark: We oten write X C instead o X Ob(C ) Remark: We say a category C is small i the collection Ob(C ) orms a set. 1
2 2.2 Examples We discover categories in many areas o mathematics. The most obvious examples ollow: 1. Sets: The objects are simply sets, and the morphisms are unctions between sets. 2. Groups: The objects are groups, and the morphisms are homomorphisms. 3. Abelian Groups: The objects are abelian groups, and the morphisms are homomorphisms. 4. Topological Spaces: In this non-algebraic example, the objects are topological spaces, and the morphisms are continuous maps. 5. Monoid: This example is less intuitive. Consider a category with one object, Ob(C ) =. The set o morphisms C (, ) orm a structure which has an identity morphism along with an associative composition unction. Such a category, then, is exactly a monoid in which the elements are the morphisms o the object in this category. 6. Group: We again consider a category with one object. I we require, in addition to the normal categorical axioms, that each morphism have an inverse morphism, we obtain a single group, the elements o which are the morphisms rom this one object to itsel. And so on. Most algebraic structures with the obvious designations given to objects and morphisms orm categories, although it is not always entirely obvious how to write the extra structure they exhibit in categorical terms. Note that only examples ive and six are small categories; examples one through our are large (since, or example, there is no set o all sets). 2.3 Commutative Diagrams Sometimes it is more useul to state the axioms o categories in terms o commutative diagrams instead o equivalent unctions. The axioms, stated thus, ollow: 1. Identity Axiom: For each X Ob(C ), there exists a distinguished element 1 X C (X, X) such that or any Y, Z Ob(C ) and C (Y, X), g C (X, Z) the ollowing diagram commutes: Y X 1 X g X g Z 2
3 2. Associativity Axiom: For all X, Y, W, Z C, and : X Y, g : Y W, and h : W Z, the ollowing diagram commutes: X Y h g g g W h Z 2.4 Isomorphisms A morphism : X Y is an isomorphism i there exists a morphism g : Y X such that g = Id Y and g = Id X. 3 Functors As we would expect, in order to make this study a ruitul one, some extra structure and sorting are required. In this section we will deine and describe maps between categories, which give us grounds on which to inally deine naturality and ormalise the notion o sameness. 3.1 Deinition Let C and D be categories. A (covariant) unctor F : C D is a morphism that makes the ollowing associations: to each C Ob(C ), it associates an object F (C) D, and to each morphism C (C, C ) it associates a morphism F () D(F (C), F (C )) such that: 1. F (1 C ) = 1 F (C) or all C Ob(C) 2. F (g ) = F (g) F () or all : C C, g : C C 3.2 Examples 1. Constant Functor This unctor maps every object C Ob(C ) to one object D Ob(D), and every morphism in C to the identity morphism on D. 2. Forgetul Functor Generally, the orgetul unctor is one which goes rom a category with more structure to one with less, orgetting that extra structure. For example, the orgetul unctor which takes groups to sets takes the elements o groups to their underlying sets, and the homomorphisms between the groups to generic unctions, stripping away the group structure and leaving only the set underneath. This unctor is deined or almost all o the examples we mentioned: We could take abelian groups to groups, or groups to monoids. 3
4 3. Free Functor This is the opposite notion o a orgetul unctor. Free unctors impose extra structure on categories with less. For example, a ree unctor could take the category o sets to the category o groups by taking each set to the ree group generated by that set, and the unctions to homomorphisms between these ree groups. 3.3 Contra-variant unctors The dierence between a contra-variant unctor and a (covariant) unctor is the morphism that F associates C (C, C ). The same axioms hold, except that each C (C, C ) gets sent to a morphism, F () D(F (C ), F (C)). That is, a covariant unctor preserves the direction o our arrows, while a contravariant unctor reverses them. 3.4 Example Let X Sets. Consider the unctor F (, X) : Sets Sets, where denotes any set, deined on objects by F : Y {unctions : Y X}. Now or morphisms, suppose we have F (Y, X) and F (Z, X). The question is how to deine this relationship, given a unction : Y Z. We want to know, given this unction, is it more natural to deine F (Y, X) F (Z, X) or F (Y, X) F (Z, X)? Looking at the ollowing diagram which states this relationship more explicitly, the answer becomes clear: Y Z g X g {unctions:z X} That is, given a map : Y Z, and a map g : Z X, we can induce a map g : Y X. The correct way to deine the relationship between F (Y, X) and F (Z, X), then, is F (Y, X) F (Z, X) g g, orming a perectly acceptable contra-variant unctor. 3.5 Elementary Properties We can derive some properties immediately rom the axioms. For example: 1. F transorms each commutative diagram in C to a commutative diagram in D. That all o the objects in the diagram in C get sent to objects in an equivalent diagram in D is obvious rom the deinition o a unctor. Similarly, or every arrow C C in a commutative diagram in C, the unctor F will associate a morphism 4
5 F () D(F (C), F (C )). Any property requiring the identity morphism in C will be associated with the identity morphism in D, and any composition in C goes to an equivilant composition in D. Thus every combination o maps between objects in C is preserved in the equivalent diagram in D, making that diagram in D commute. 4 Natural Transormations A morphism between categories is a unctor; a map between unctors (both o which must have the same input and output categories) is a natural transormation. 4.1 Deinition Let F and G be unctors rom C to D. A natural transormation η : F G is a collection o maps η C : F (C) G(C), one or each C C, such that or any C, C C and any C (C, C ), the ollowing diagram commutes: F (C) F () F (C ) η C η C G(C) G() G(C ) That is, whether we irst take the unctor F on an object C and then take η into G(C ), or whether we irst take η into G and then use the unctor G to go into G(C ), is irrelevant; we will obtain the same morphism rom F (C). Remark: Unsurprisingly, a natural transormation is a natural isomorphism when each η C is an isomorphism. 4.2 Example Consider the statement every group is naturally isomorphic to its opposite group. (The opposite group G op o G has the same underlying set, and the operations reversed: a b G b op a G op ) This can clearly be deined in terms o a unctor rom groups to groups, such that op = or any group homomorphism : G H. In order or this to deine a unctor, we need op : G op H op to be a homomorphism. To see that this is in act the case, we observe that, or all a, b G and : G H: op (a op b) = (b a) = op (a) op op (b) This statement also shows us clearly what we need to do to veriy naturality: we must show that the identity unctor between groups is naturally isomorphic to the opposite unctor, 5
6 deined above. Thus we must give an isomorphism η G : G G op such that the relevant diagram deining naturality commutes. Proo: Let η G (a) = a 1 or all a G. We have (ab) 1 = b 1 a 1 and (a 1 ) 1 = a, showing that our η G is its own inverse. Now set : G H, a group homomorphism. We can write the ollowing diagram, keeping in mind that op = and (a) 1 = (a 1 ) or group homomorphisms. G H η G η H G op op H op Showing naturality. Now, to show that this is not only a natural transormation but an isomorphism, we must show that each η G actually has an inverse. Consider the morphism η G op. This must be deined on group elements as η G op(b) = b 1. But by our deinition o G op, b 1 G. Thus, η 1 G = η Gop or all G, showing that this transormation is an isomorphism. 5 Products o Categories Suppose we have two categories, C and D. The product, C D, gives us another category, deined as ollows: The objects Ob(C D) are Ob(C ) Ob(D) For all pairs o objects (C 1, D 1 ), (C 2, D 2 ), the set (C D)[(C 1, D 1 ), (C 2, D 2 )] = C (C 1, C 2 ) D(D 1, D 2 ) The identity morphism Id(C, D) we deine as (Id C, Id D ) Composition is deined componentwise as expected. 6 Arbitrary Categories, Applications We can deine categories indiscriminately, by representing objects as graph vertices and morphisms as edges. Recall that in our deinition o a monoid as a category, we had a category with one object and morphisms rom that object to itsel. We can represent this graphically as one vertex, with many arrows pointing rom that vertex to itsel (necessarily including the identity arrow), plus an additional composition deinition. Now consider the ollowing arrangement: 6
7 Id 0 0 α 1 Id 1 This certainly deines a category E : we have two objects, each with an identity morphism, and a set o morphisms C (0, 1) = {α}, and the set C (1, 0) = { }. This graph also imposes all o the compositions o morphisms: or example, Id 1 α is orced to be α. Proposition: Let C, D be categories. The ollowing are equivalent: 1. Two unctors, C F G D, and a natural transormation η : F G 2. C E H D, or H a unctor, and E the category with two objects deined above. Proo: Let H(C, 0) = F (C) and H(C, 1) = G(C) or all C C. This is all we need to deine operations o objects; as we can see, all the inormation contained in those two unctors F, G : C D is represented by this deinition; or F, look at what H does with any C together with 0 object, and or G, look at C with 1. Now, make the ollowing equalities, or : C C : 1. H(C, 0) = F (C) 2. H(C, 0) = F (C ) 3. H(, Id 0 ) = F () 4. H(C, 1) = G(C) 5. H(C, 1) = G(C ) 6. H(, Id 1 ) = G() 7. H(Id C, α) = η C With these deinitions in hand, we shall irst show that (2) implies (1), and then that (1) implies (2). Based on the deinition o a unctor, the ollowing diagram commutes in (2): H(Id C,α) H(C, 0) H(,Id 0 ) H(C, 0) H(C, 1) H(,Id 1) H(C, 1) H(Id C,α) 7
8 But observe that, simply by deinition, those diagram is exactly: F (C) F () F (C ) η C η C G(C) G() G(C ) Which is what we wanted. To see that (1) implies (2), simply start with the bottom diagram, look at our deinitions table, and see that it is exactly the top diagram. 7 Another Natural Isomorphism Proposition: Every inite dimensional vector space is naturally isomorphic to its double dual. (The dual o a vector space is the set o linear transormations rom the vector space to its ground ield. This actually orms a vector space, the dual o which is the double dual or the original space.) In categorical terms, this states that there is a natural isomorphism between the identity unctor Id : V ect k V ect k and the unctor DD : V ect k V eck k, where k is the ground ield o V and DD denotes the unction sending V to its double dual, DDV (which is also a vector space over k). Let us deine a unction η V : Id(V ) DD(V ), i.e. η V : V DDV. Given a λ DV (a linear transormation rom V to its ground ield k) and v V, deine η V (v)(λ) = λ(v) For convenience, denote η V (v) = eval v. First, we will show that this is an isomorphism, and then we will show that it is natural. To get a better grasp o the types o unctors we are looking at, suppose we have a D : V DV. The natural way to deine the composition is: V V T k T DV Thus D((T )) = T. This shows that unctors D : V DV are contra-variant. Taking that same unctor twice, into DDV, yields a covariant unctor. Let e 1...e k be a basis o V, and deine T ei by T ei (e j ) = { 1 i = j 0 i j. 8
9 The set o T ei orms a basis or DV, which shows that V and DV have the same dimension. Suppose v 0. We can write v in terms o a chosen basis: v = a 1 e a n e n. At least one o these coeicients must be nonzero, since v 0. So i a i 0, let T = T ei. Then T ei (v) = T (a 1 e a n e n ) = a i 0. Thus eval v is nonzero. This also shows that η V : V DDV is injective since every nonzero vector gets sent to something nonzero. We have shown that V and DDV are inite dimensional with the same dimension, so η V must be an isomorphism. To show that η is natural, suppose we have : V V. Now the consider the diagram V V η V η V DDV DD DDV We must show that this commutes. Suppose, then, that we have a v V. We must show that whichever way we go round the diagram, we get the same element o DDV. Going clockwise, we obtain (v) V and then eval (v). Going counterclockwise, we obtain irst eval v, and then DD(eval v ). But DD(eval v ) = eval v D. For any T DV, (eval v D)(T ) = eval v (D(T )) = eval v (T ) = T v = T (v). Note that or any T DV, eval (v) (T ) = T (v). Thereore we obtain the same element o DDV going either way around the diagram; the diagram commutes. Amen. 8 Further Possibilities This paper has given the merest o introductions to category theory, with a ew examples and statements. We can accomplish much more, relating more sophisticated concepts in mathematics, using this branch; or that, however, you shall have to consult the textbooks, as I have none o the required background. Reerences [1] Berrick and Keating, Categories and Modules, 2000, [2] Guillou and Skiadas, WOMP 2004: Category Theory, [3] Peter May s lectures, class notes. 9
GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS
GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS CHRIS HENDERSON Abstract. This paper will move through the basics o category theory, eventually deining natural transormations and adjunctions
More informationCATEGORIES. 1.1 Introduction
1 CATEGORIES 1.1 Introduction What is category theory? As a irst approximation, one could say that category theory is the mathematical study o (abstract) algebras o unctions. Just as group theory is the
More information1 Categories, Functors, and Natural Transformations. Discrete categories. A category is discrete when every arrow is an identity.
MacLane: Categories or Working Mathematician 1 Categories, Functors, and Natural Transormations 1.1 Axioms or Categories 1.2 Categories Discrete categories. A category is discrete when every arrow is an
More informationDescent on the étale site Wouter Zomervrucht, October 14, 2014
Descent on the étale site Wouter Zomervrucht, October 14, 2014 We treat two eatures o the étale site: descent o morphisms and descent o quasi-coherent sheaves. All will also be true on the larger pp and
More informationHSP SUBCATEGORIES OF EILENBERG-MOORE ALGEBRAS
HSP SUBCATEGORIES OF EILENBERG-MOORE ALGEBRAS MICHAEL BARR Abstract. Given a triple T on a complete category C and a actorization system E /M on the category o algebras, we show there is a 1-1 correspondence
More informationCategory Theory. Categories. Definition.
Category Theory Category theory is a general mathematical theory of structures, systems of structures and relationships between systems of structures. It provides a unifying and economic mathematical modeling
More informationSEPARATED AND PROPER MORPHISMS
SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN The notions o separatedness and properness are the algebraic geometry analogues o the Hausdor condition and compactness in topology. For varieties over the
More informationGENERAL ABSTRACT NONSENSE
GENERAL ABSTRACT NONSENSE MARCELLO DELGADO Abstract. In this paper, we seek to understand limits, a uniying notion that brings together the ideas o pullbacks, products, and equalizers. To do this, we will
More informationVALUATIVE CRITERIA BRIAN OSSERMAN
VALUATIVE CRITERIA BRIAN OSSERMAN Intuitively, one can think o separatedness as (a relative version o) uniqueness o limits, and properness as (a relative version o) existence o (unique) limits. It is not
More informationCategory Theory. Course by Dr. Arthur Hughes, Typset by Cathal Ormond
Category Theory Course by Dr. Arthur Hughes, 2010 Typset by Cathal Ormond Contents 1 Types, Composition and Identities 3 1.1 Programs..................................... 3 1.2 Functional Laws.................................
More informationVALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS
VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Recall that or prevarieties, we had criteria or being a variety or or being complete in terms o existence and uniqueness o limits, where
More informationSEPARATED AND PROPER MORPHISMS
SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Last quarter, we introduced the closed diagonal condition or a prevariety to be a prevariety, and the universally closed condition or a variety to be complete.
More informationLIMITS AND COLIMITS. m : M X. in a category G of structured sets of some sort call them gadgets the image subset
5 LIMITS ND COLIMITS In this chapter we irst briely discuss some topics namely subobjects and pullbacks relating to the deinitions that we already have. This is partly in order to see how these are used,
More informationMath 248B. Base change morphisms
Math 248B. Base change morphisms 1. Motivation A basic operation with shea cohomology is pullback. For a continuous map o topological spaces : X X and an abelian shea F on X with (topological) pullback
More information(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results
(C) The rationals and the reals as linearly ordered sets We know that both Q and R are something special. When we think about about either o these we usually view it as a ield, or at least some kind o
More informationTangent Categories. David M. Roberts, Urs Schreiber and Todd Trimble. September 5, 2007
Tangent Categories David M Roberts, Urs Schreiber and Todd Trimble September 5, 2007 Abstract For any n-category C we consider the sub-n-category T C C 2 o squares in C with pinned let boundary This resolves
More informationCategories and functors
Lecture 1 Categories and functors Definition 1.1 A category A consists of a collection ob(a) (whose elements are called the objects of A) for each A, B ob(a), a collection A(A, B) (whose elements are called
More informationTowards a Flowchart Diagrammatic Language for Monad-based Semantics
Towards a Flowchart Diagrammatic Language or Monad-based Semantics Julian Jakob Friedrich-Alexander-Universität Erlangen-Nürnberg julian.jakob@au.de 21.06.2016 Introductory Examples 1 2 + 3 3 9 36 4 while
More informationThe Clifford algebra and the Chevalley map - a computational approach (detailed version 1 ) Darij Grinberg Version 0.6 (3 June 2016). Not proofread!
The Cliord algebra and the Chevalley map - a computational approach detailed version 1 Darij Grinberg Version 0.6 3 June 2016. Not prooread! 1. Introduction: the Cliord algebra The theory o the Cliord
More informationRepresentation Theory of Hopf Algebroids. Atsushi Yamaguchi
Representation Theory o H Algebroids Atsushi Yamaguchi Contents o this slide 1. Internal categories and H algebroids (7p) 2. Fibered category o modules (6p) 3. Representations o H algebroids (7p) 4. Restrictions
More informationMath 216A. A gluing construction of Proj(S)
Math 216A. A gluing construction o Proj(S) 1. Some basic deinitions Let S = n 0 S n be an N-graded ring (we ollows French terminology here, even though outside o France it is commonly accepted that N does
More informationThe basics of frame theory
First version released on 30 June 2006 This version released on 30 June 2006 The basics o rame theory Harold Simmons The University o Manchester hsimmons@ manchester.ac.uk This is the irst part o a series
More information2. ETA EVALUATIONS USING WEBER FUNCTIONS. Introduction
. ETA EVALUATIONS USING WEBER FUNCTIONS Introduction So ar we have seen some o the methods or providing eta evaluations that appear in the literature and we have seen some o the interesting properties
More informationPhysics 2B Chapter 17 Notes - First Law of Thermo Spring 2018
Internal Energy o a Gas Work Done by a Gas Special Processes The First Law o Thermodynamics p Diagrams The First Law o Thermodynamics is all about the energy o a gas: how much energy does the gas possess,
More informationFinite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)
Electronic Notes in Theoretical Computer Science 270 (1) (2011) 113 119 www.elsevier.com/locate/entcs Finite Dimensional Hilbert Spaces are Complete or Dagger Compact Closed Categories (Extended bstract)
More informationSpan, Cospan, and Other Double Categories
ariv:1201.3789v1 [math.ct] 18 Jan 2012 Span, Cospan, and Other Double Categories Susan Nieield July 19, 2018 Abstract Given a double category D such that D 0 has pushouts, we characterize oplax/lax adjunctions
More informationAn Introduction to Topos Theory
An Introduction to Topos Theory Ryszard Paweł Kostecki Institute o Theoretical Physics, University o Warsaw, Hoża 69, 00-681 Warszawa, Poland email: ryszard.kostecki % uw.edu.pl June 26, 2011 Abstract
More informationMADE-TO-ORDER WEAK FACTORIZATION SYSTEMS
MADE-TO-ORDER WEAK FACTORIZATION SYSTEMS EMILY RIEHL The aim o this note is to briely summarize techniques or building weak actorization systems whose right class is characterized by a particular liting
More informationTHE SNAIL LEMMA ENRICO M. VITALE
THE SNIL LEMM ENRICO M. VITLE STRCT. The classical snake lemma produces a six terms exact sequence starting rom a commutative square with one o the edge being a regular epimorphism. We establish a new
More informationJoseph Muscat Categories. 1 December 2012
Joseph Muscat 2015 1 Categories joseph.muscat@um.edu.mt 1 December 2012 1 Objects and Morphisms category is a class o objects with morphisms : (a way o comparing/substituting/mapping/processing to ) such
More informationUMS 7/2/14. Nawaz John Sultani. July 12, Abstract
UMS 7/2/14 Nawaz John Sultani July 12, 2014 Notes or July, 2 2014 UMS lecture Abstract 1 Quick Review o Universals Deinition 1.1. I S : D C is a unctor and c an object o C, a universal arrow rom c to S
More informationCategorical Background (Lecture 2)
Cateorical Backround (Lecture 2) February 2, 2011 In the last lecture, we stated the main theorem o simply-connected surery (at least or maniolds o dimension 4m), which hihlihts the importance o the sinature
More informationThe Uniformity Principle on Traced Monoidal Categories
Electronic Notes in Theoretical Computer Science 69 (2003) URL: http://www.elsevier.nl/locate/entcs/volume69.html 19 pages The Uniormity Principle on Traced Monoidal Categories Masahito Hasegawa Research
More informationCATEGORY THEORY. Cats have been around for 70 years. Eilenberg + Mac Lane =. Cats are about building bridges between different parts of maths.
CATEGORY THEORY PROFESSOR PETER JOHNSTONE Cats have been around for 70 years. Eilenberg + Mac Lane =. Cats are about building bridges between different parts of maths. Definition 1.1. A category C consists
More informationUniversity of Cape Town
The copyright o this thesis rests with the. No quotation rom it or inormation derived rom it is to be published without ull acknowledgement o the source. The thesis is to be used or private study or non-commercial
More informationMath 754 Chapter III: Fiber bundles. Classifying spaces. Applications
Math 754 Chapter III: Fiber bundles. Classiying spaces. Applications Laurențiu Maxim Department o Mathematics University o Wisconsin maxim@math.wisc.edu April 18, 2018 Contents 1 Fiber bundles 2 2 Principle
More informationCARTESIAN DIFFERENTIAL CATEGORIES
Theory and Applications o Categories, Vol. 22, No. 23, 2009, pp. 622 672. CARTESIAN DIFFERENTIAL CATEGORIES R.F. BLUTE, J.R.B. COCKETT AND R.A.G. SEELY Abstract. This paper revisits the authors notion
More informationDUALITY AND SMALL FUNCTORS
DUALITY AND SMALL FUNCTORS GEORG BIEDERMANN AND BORIS CHORNY Abstract. The homotopy theory o small unctors is a useul tool or studying various questions in homotopy theory. In this paper, we develop the
More information1 Categorical Background
1 Categorical Background 1.1 Categories and Functors Definition 1.1.1 A category C is given by a class of objects, often denoted by ob C, and for any two objects A, B of C a proper set of morphisms C(A,
More informationDe Rham Cohomology. Smooth singular cochains. (Hatcher, 2.1)
II. De Rham Cohomology There is an obvious similarity between the condition d o q 1 d q = 0 for the differentials in a singular chain complex and the condition d[q] o d[q 1] = 0 which is satisfied by the
More informationDerivation, f-derivation and generalized derivation of KUS-algebras
PURE MATHEMATICS RESEARCH ARTICLE Derivation, -derivation and generalized derivation o KUS-algebras Chiranjibe Jana 1 *, Tapan Senapati 2 and Madhumangal Pal 1 Received: 08 February 2015 Accepted: 10 June
More informationProbabilistic Observations and Valuations (Extended Abstract) 1
Replace this ile with prentcsmacro.sty or your meeting, or with entcsmacro.sty or your meeting. Both can be ound at the ENTCS Macro Home Page. Probabilistic Observations and Valuations (Extended Abstract)
More informationGrothendieck construction for bicategories
Grothendieck construction or bicategories Igor Baković Rudjer Bošković Institute Abstract In this article, we give the generalization o the Grothendieck construction or pseudo unctors given in [5], which
More informationTHE HOMOTOPY THEORY OF EQUIVALENCE RELATIONS
THE HOMOTOPY THEORY OF EQUIVALENCE RELATIONS FINNUR LÁRUSSON Abstract. We give a detailed exposition o the homotopy theory o equivalence relations, perhaps the simplest nontrivial example o a model structure.
More informationClassification of effective GKM graphs with combinatorial type K 4
Classiication o eective GKM graphs with combinatorial type K 4 Shintarô Kuroki Department o Applied Mathematics, Faculty o Science, Okayama Uniervsity o Science, 1-1 Ridai-cho Kita-ku, Okayama 700-0005,
More informationINTERSECTION THEORY CLASSES 20 AND 21: BIVARIANT INTERSECTION THEORY
INTERSECTION THEORY CLASSES 20 AND 21: BIVARIANT INTERSECTION THEORY RAVI VAKIL CONTENTS 1. What we re doin this week 1 2. Precise statements 2 2.1. Basic operations and properties 4 3. Provin thins 6
More informationIntroduction to Categorical Quantum Mechanics. Chris Heunen and Jamie Vicary
Introduction to Categorical Quantum Mechanics Chris Heunen and Jamie Vicary February 20, 2013 ii Preace Physical systems cannot be studied in isolation, since we can only observe their behaviour with respect
More information1 Recall. Algebraic Groups Seminar Andrei Frimu Talk 4: Cartier Duality
1 ecall Assume we have a locally small category C which admits finite products and has a final object, i.e. an object so that for every Z Ob(C), there exists a unique morphism Z. Note that two morphisms
More informationDiagrammatic Methods for the Specification and Verification of Quantum Algorithms
Diagrammatic Methods or the Speciication and Veriication o Quantum lgorithms William Zeng Quantum Group Department o Computer Science University o Oxord Quantum Programming and Circuits Workshop IQC, University
More informationON KAN EXTENSION OF HOMOLOGY AND ADAMS COCOMPLETION
Bulletin o the Institute o Mathematics Academia Sinica (New Series) Vol 4 (2009), No 1, pp 47-66 ON KAN ETENSION OF HOMOLOG AND ADAMS COCOMPLETION B AKRUR BEHERA AND RADHESHAM OTA Abstract Under a set
More informationAbstract structure of unitary oracles for quantum algorithms
Abstract structure o unitary oracles or quantum algorithms William Zeng 1 Jamie Vicary 2 1 Department o Computer Science University o Oxord 2 Centre or Quantum Technologies, University o Singapore and
More informationArrow-theoretic differential theory
Arrow-theoretic dierential theory Urs Schreiber August 17, 2007 Abstract We propose and study a notion o a tangent (n + 1)-bundle to an arbitrary n-category Despite its simplicity, this notion turns out
More informationCS 361 Meeting 28 11/14/18
CS 361 Meeting 28 11/14/18 Announcements 1. Homework 9 due Friday Computation Histories 1. Some very interesting proos o undecidability rely on the technique o constructing a language that describes the
More informationReview D: Potential Energy and the Conservation of Mechanical Energy
MSSCHUSETTS INSTITUTE OF TECHNOLOGY Department o Physics 8. Spring 4 Review D: Potential Energy and the Conservation o Mechanical Energy D.1 Conservative and Non-conservative Force... D.1.1 Introduction...
More informationVariations on a Casselman-Osborne theme
Variations on a Casselman-Osborne theme Dragan Miličić Introduction This paper is inspired by two classical results in homological algebra o modules over an enveloping algebra lemmas o Casselman-Osborne
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More informationPower-Set Functors and Saturated Trees
Power-Set Functors and Saturated Trees Jiří Adámek 1, Stean Milius 1, Lawrence S. Moss 2, and Lurdes Sousa 3 1 Institut ür Theoretische Inormatik, Technische Universität Braunschweig Germany 2 Department
More informationProgramming Languages in String Diagrams. [ one ] String Diagrams. Paul-André Melliès. Oregon Summer School in Programming Languages June 2011
Programming Languages in String Diagrams [ one ] String Diagrams Paul-ndré Melliès Oregon Summer School in Programming Languages June 2011 String diagrams diagrammatic account o logic and programming 2
More informationTHE COALGEBRAIC STRUCTURE OF CELL COMPLEXES
Theory and pplications o Categories, Vol. 26, No. 11, 2012, pp. 304 330. THE COLGEBRIC STRUCTURE OF CELL COMPLEXES THOMS THORNE bstract. The relative cell complexes with respect to a generating set o coibrations
More informationA CHARACTERIZATION OF CENTRAL EXTENSIONS IN THE VARIETY OF QUANDLES VALÉRIAN EVEN, MARINO GRAN AND ANDREA MONTOLI
Pré-Publicações do Departamento de Matemática Universidade de Coimbra Preprint Number 15 12 CHRCTERIZTION OF CENTRL EXTENSIONS IN THE VRIETY OF QUNDLES VLÉRIN EVEN, MRINO GRN ND NDRE MONTOLI bstract: The
More informationOn a Closed Formula for the Derivatives of e f(x) and Related Financial Applications
International Mathematical Forum, 4, 9, no. 9, 41-47 On a Closed Formula or the Derivatives o e x) and Related Financial Applications Konstantinos Draais 1 UCD CASL, University College Dublin, Ireland
More informationFeedback Linearization
Feedback Linearization Peter Al Hokayem and Eduardo Gallestey May 14, 2015 1 Introduction Consider a class o single-input-single-output (SISO) nonlinear systems o the orm ẋ = (x) + g(x)u (1) y = h(x) (2)
More informationExtreme Values of Functions
Extreme Values o Functions When we are using mathematics to model the physical world in which we live, we oten express observed physical quantities in terms o variables. Then, unctions are used to describe
More informationProblem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS
Problem Set Problems on Unordered Summation Math 5323, Fall 2001 Februray 15, 2001 ANSWERS i 1 Unordered Sums o Real Terms In calculus and real analysis, one deines the convergence o an ininite series
More informationNOTES ON ATIYAH S TQFT S
NOTES ON ATIYAH S TQFT S J.P. MAY As an example of categorification, I presented Atiyah s axioms [1] for a topological quantum field theory (TQFT) to undergraduates in the University of Chicago s summer
More informationExercises on chapter 0
Exercises on chapter 0 1. A partially ordered set (poset) is a set X together with a relation such that (a) x x for all x X; (b) x y and y x implies that x = y for all x, y X; (c) x y and y z implies that
More informationAlgebraic Geometry
MIT OpenCourseWare http://ocw.mit.edu 18.726 Algebraic Geometry Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.726: Algebraic Geometry
More informationarxiv: v1 [math.ct] 27 Oct 2017
arxiv:1710.10238v1 [math.ct] 27 Oct 2017 Notes on clans and tribes. Joyal October 30, 2017 bstract The purpose o these notes is to give a categorical presentation/analysis o homotopy type theory. The notes
More informationIn the index (pages ), reduce all page numbers by 2.
Errata or Nilpotence and periodicity in stable homotopy theory (Annals O Mathematics Study No. 28, Princeton University Press, 992) by Douglas C. Ravenel, July 2, 997, edition. Most o these were ound by
More informationELEMENTS IN MATHEMATICS FOR INFORMATION SCIENCE NO.14 CATEGORY THEORY. Tatsuya Hagino
1 ELEMENTS IN MTHEMTICS FOR INFORMTION SCIENCE NO.14 CTEGORY THEORY Tatsuya Haino haino@sc.keio.ac.jp 2 Set Theory Set Theory Foundation o Modern Mathematics a set a collection o elements with some property
More informationLecture : Feedback Linearization
ecture : Feedbac inearization Niola Misovic, dipl ing and Pro Zoran Vuic June 29 Summary: This document ollows the lectures on eedbac linearization tought at the University o Zagreb, Faculty o Electrical
More information3. Categories and Functors We recall the definition of a category: Definition 3.1. A category C is the data of two collections. The first collection
3. Categories and Functors We recall the definition of a category: Definition 3.1. A category C is the data of two collections. The first collection is called the objects of C and is denoted Obj(C). Given
More informationSECTION 5: EILENBERG ZILBER EQUIVALENCES AND THE KÜNNETH THEOREMS
SECTION 5: EILENBERG ZILBER EQUIVALENCES AND THE KÜNNETH THEOREMS In this section we will prove the Künneth theorem which in principle allows us to calculate the (co)homology of product spaces as soon
More informationDirect Limits. Mathematics 683, Fall 2013
Direct Limits Mathematics 683, Fall 2013 In this note we define direct limits and prove their basic properties. This notion is important in various places in algebra. In particular, in algebraic geometry
More informationEXAMPLES AND EXERCISES IN BASIC CATEGORY THEORY
EXAMPLES AND EXERCISES IN BASIC CATEGORY THEORY 1. Categories 1.1. Generalities. I ve tried to be as consistent as possible. In particular, throughout the text below, categories will be denoted by capital
More information1 Differentiable manifolds and smooth maps
1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set
More information2-DIMENSIONAL TOPOLOGICAL QUANTUM FIELD THEORIES AND FROBENIUS ALGEBRAS. Contents 1. The main theorem 1
2-DIMENSIONL TOPOLOGICL QUNTUM FIELD THEORIES ND FROBENIUS LGEBRS CROLINE TERRY bstract. Category theory provides a more abstract and thus more general setting for considering the structure of mathematical
More informationCOMMUTATIVE ALGEBRA LECTURE 1: SOME CATEGORY THEORY
COMMUTATIVE ALGEBRA LECTURE 1: SOME CATEGORY THEORY VIVEK SHENDE A ring is a set R with two binary operations, an addition + and a multiplication. Always there should be an identity 0 for addition, an
More information3 3 Lemma and Protomodularity
Ž. Journal o Algebra 236, 778795 2001 doi:10.1006jabr.2000.8526, available online at http:www.idealibrary.com on 3 3 Lemma and Protomodularity Dominique Bourn Uniersite du Littoral, 220 a. de l Uniersite,
More informationRoberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points
Roberto s Notes on Dierential Calculus Chapter 8: Graphical analysis Section 1 Extreme points What you need to know already: How to solve basic algebraic and trigonometric equations. All basic techniques
More informationTHE GORENSTEIN DEFECT CATEGORY
THE GORENSTEIN DEFECT CATEGORY PETTER ANDREAS BERGH, DAVID A. JORGENSEN & STEFFEN OPPERMANN Dedicated to Ranar-Ola Buchweitz on the occasion o his sixtieth birthday Abstract. We consider the homotopy cateory
More informationsset(x, Y ) n = sset(x [n], Y ).
1. Symmetric monoidal categories and enriched categories In practice, categories come in nature with more structure than just sets of morphisms. This extra structure is central to all of category theory,
More informationA NOTE ON HENSEL S LEMMA IN SEVERAL VARIABLES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3185 3189 S 0002-9939(97)04112-9 A NOTE ON HENSEL S LEMMA IN SEVERAL VARIABLES BENJI FISHER (Communicated by
More informationA Peter May Picture Book, Part 1
A Peter May Picture Book, Part 1 Steve Balady Auust 17, 2007 This is the beinnin o a larer project, a notebook o sorts intended to clariy, elucidate, and/or illustrate the principal ideas in A Concise
More informationSpecial types of Riemann sums
Roberto s Notes on Subject Chapter 4: Deinite integrals and the FTC Section 3 Special types o Riemann sums What you need to know already: What a Riemann sum is. What you can learn here: The key types o
More informationGabriel-Ulmer Duality and Lawvere Theories Enriched over a General Base
Under consideration or publication in J. Functional Programming 1 Gabriel-Ulmer Duality and Lawvere Theories Enriched over a General Base STEPHEN LACK School o Computing and Mathematics, University o Western
More informationON PROPERTY-LIKE STRUCTURES
Theory and Applications o Categories, Vol. 3, No. 9, 1997, pp. 213 250. ON PROPERTY-LIKE STRUCTURES G. M. KELLY AND STEPHEN LACK Transmitted by R. J. Wood ABSTRACT. A category may bear many monoidal structures,
More informationThe categorical origins of Lebesgue integration
The categorical origins of Lebesgue integration Tom Leinster University of Edinburgh These slides: on my web page Broad context One function of category theory: to show that in many cases, that which is
More informationCHOW S LEMMA. Matthew Emerton
CHOW LEMMA Matthew Emerton The aim o this note is to prove the ollowing orm o Chow s Lemma: uppose that : is a separated inite type morphism o Noetherian schemes. Then (or some suiciently large n) there
More informationON THE CONSTRUCTION OF FUNCTORIAL FACTORIZATIONS FOR MODEL CATEGORIES
ON THE CONSTRUCTION OF FUNCTORIAL FACTORIZATIONS FOR MODEL CATEGORIES TOBIAS BARTHEL AND EMIL RIEHL Abstract. We present general techniques or constructing unctorial actorizations appropriate or model
More informationABSOLUTELY PURE REPRESENTATIONS OF QUIVERS
J. Korean Math. Soc. 51 (2014), No. 6, pp. 1177 1187 http://dx.doi.org/10.4134/jkms.2014.51.6.1177 ABSOLUTELY PURE REPRESENTATIONS OF QUIVERS Mansour Aghasi and Hamidreza Nemati Abstract. In the current
More informationReview of Prerequisite Skills for Unit # 2 (Derivatives) U2L2: Sec.2.1 The Derivative Function
UL1: Review o Prerequisite Skills or Unit # (Derivatives) Working with the properties o exponents Simpliying radical expressions Finding the slopes o parallel and perpendicular lines Simpliying rational
More informationHomotopy, Quasi-Isomorphism, and Coinvariants
LECTURE 10 Homotopy, Quasi-Isomorphism, an Coinvariants Please note that proos o many o the claims in this lecture are let to Problem Set 5. Recall that a sequence o abelian groups with ierential is a
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationHow to glue perverse sheaves
How to glue perverse sheaves A.A. Beilinson The aim o this note [0] is to give a short, sel-contained account o the vanishing cycle constructions o perverse sheaves; e.g., or the needs o [1]. It diers
More informationPOLARIZED CATEGORY THEORY, MODULES, AND GAME SEMANTICS. Contents. Introduction
Theory and Applications o Categories, Vol. 18, No. 2, 2007, pp. 4 101. Contents POLARIZED CATEGORY THEORY, MODULES, AND GAME SEMANTICS J.R.B. COCKETT AND R.A.G. SEELY Abstract. Motivated by an analysis
More informationELEG 3143 Probability & Stochastic Process Ch. 4 Multiple Random Variables
Department o Electrical Engineering University o Arkansas ELEG 3143 Probability & Stochastic Process Ch. 4 Multiple Random Variables Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Two discrete random variables
More informationRELATIVE GOURSAT CATEGORIES
RELTIVE GOURST CTEGORIES JULI GOEDECKE ND TMR JNELIDZE bstract. We deine relative Goursat cateories and prove relative versions o the equivalent conditions deinin reular Goursat cateories. These include
More informationON THE CONSTRUCTION OF LIMITS AND COLIMITS IN -CATEGORIES
ON THE CONSTRUCTION OF LIMITS ND COLIMITS IN -CTEGORIES EMILY RIEHL ND DOMINIC VERITY bstract. In previous work, we introduce an axiomatic ramework within which to prove theorems about many varieties o
More informationCLASS NOTES MATH 527 (SPRING 2011) WEEK 6
CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 BERTRAND GUILLOU 1. Mon, Feb. 21 Note that since we have C() = X A C (A) and the inclusion A C (A) at time 0 is a coibration, it ollows that the pushout map i
More information