DOCSLIB.ORG

Logics of Worlds a Mathematical Interlude

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Logics of Worlds a Mathematical Interlude Logics of Worlds a mathematical interlude background image credit: Shafarevich's Conjecture London Tsai 1 / 40 Topics Pictures of Structure Categories Toposes Morphisms Functors Bundles Relations Natural Sheaves Quotients Transformations Elementary and Lattices Yoneda Lemma Grothendieck Toposes Topologies Limits Quotient spaces Adjunctions Covers Comma Categories Manifolds Algebras Logic 2 / 40 Morphisms A morphism is a type of mathematical object which has a domain and codomain. If the codomain of a morphism 푓 and the domain of the morphism 푔 are the same, we can form a new morphism 푔 ∘ 푓 . In set theory, a morphism is a function: Q: How many dierent morphisms exist between two sets? 3 / 40 Morphisms A morphism 푓 is mono (injective) i it is left-cancelable, i.e. when it satis|es 푓 ∘ 푔 = 푓 ∘ ℎ ⟹ 푔 = ℎ . For sets, this looks like: A morphism f is epi (surjective) iy it is right-cancelable, i.e. when it satis|es ℎ ∘ 푓 = 푔 ∘ 푓 ⟹ 푔 = ℎ . For sets, this looks like: 4 / 40 Morphisms An identity morphism 푖푑퐴 has the same domain and codomain and is both left and right cancelable for any morphisms it composes with. An isomorphism 푓 : 퐴 → 퐵 is a morphism which has an inverse, i.e. when −1 −1 푓 ∘ 푓 = 푖푑퐴 and 푓 ∘ 푓 = 푖푑퐵 . We can also say 푓 is invertible. Sometimes only one of the above conditions is true (then 푓 is said to have a left or right inverse only). Sets are isomorphic i they have the same cardinality. An endomorphism has the same domain and codomain. An automorphism is an invertible endomorphism. Q: How can permutations and combinations be thought of as morphisms? 5 / 40 Morphisms Generally, we care less about speci|c morphisms and more about equivalence classes of morphisms satisfying some condition. Finding a unique morphism that satis|es a condition is a very special and important case. The conditions or constraints we are allowed to put on morphisms can, in the most general sense, be called (categorical) structure. The structure of a mathematical object can be derived from its morphisms - it is just the structure of morphisms which take it as a codomain. 6 / 40 Morphisms Just as we can compose morphisms, we can also "decompose" them, or factor them into their constitutive parts. Commutative diagrams are important mainly because they let us "look inside" a morphism, meaning, we can look at the constraints of a morphism by looking at the constraints of its factors. 7 / 40 Relations Properties of relations: re}exivity: 푎푅푎 symmetry: 푎푅푏 ⟹ 푏푅푎 anti-symmetry: 푎푅푏 ∧ 푏푅푎 ⟹ 푎 = 푏 transitivity: 푎푅푏 ∧ 푏푅푐 ⟹ 푎푅푐 A relation which is re}exive and transitive is a pre-order. partial order relations are re}exive, transitive, anti-symmetric (typically written as ≤) total order relations are partial orders in which, for any two elements 푎 and 푏, either 푎푅푏 or 푏푅푎 (typically written as <) equivalence relations are re}exive, transitive, and symmetric (typically written as ≡) Equivalence relations produce equivalence classes of objects, essentially partitioning a space. 8 / 40 Relations An example of an equivalence relation depicted as a matrix of some set 푋 × 푋 : 9 / 40 Relations Here are some possible ways of conceiving a relation from a morphism viewpoint: 1. An injective function 푅 : 퐴 → 푋 × 푌 which "selects" ordered pairs of elements (푥, 푦). This can be extended to n-ary relations in 푋 × 푋×. 푋 . 2. The pre-image of any function establishes an equivalence relation on the domain. 3. A function 푅 : 푋 → 푌 where 푥푅푦 ⟺ 푅(푥) = 푦 for 푥 ∈ 푋, 푦 ∈ 푌 . This seems to be the standard in category theory literature since composition is a natural consequence of the transitivity condition of relations. So the properties of relations can be generalized as properties of morphisms. Except we want to adopt an "extrinsic" view which characterizes these properties in terms of composition. Option 3 in that sense gives a "natural" interpretation of composition. We can also talk about morphisms which "do not quite |t" a relation, that is, they can be viewed as a restriction of some proper relation morphism. 10 / 40 Posets A poset is a set with a partial order relation. Posets can be depicted in a Hasse diagram: Weisstein, Eric W. "Hasse Diagram." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/HasseDiagram.html A function between posets that preserves order is called monotonic. Preserving order doesn't necessarily require injectivity (nor surjectivity), it only requires that 푎 ≤ 푏 → 푓(푎) ≤ 푓(푏) . 11 / 40 Posets - Adjoints Given a monotone function 퐹 : 퐶 → 퐷, a right adjoint of 퐹 is 푅 : 퐷 → 퐶 such that 퐹(푐) ≤ 푑 ⟺ 푐 ≤ 푅(푑) and a left adjoint 퐿 satis|es 푐 ≤ 퐿(푑) ⟺ 퐹(푐) ≤ 푑 for all 푐 ∈ 퐶 and 푑 ∈ 퐷 no adjoint adjoint 12 / 40 Posets - Adjoints - Galois connnection A Galois connection is formed by any pair of left and right adjoint functions. There are monotone and antitone (order-reversing, so the RHS becomes ≥) Galois connections. As a historical note, the original Galois connection is antitone and can be written as: 퐸 ↦ 퐺푎푙(퐿/퐸) ⟺ 퐺 ↦ 퐹푖푥(퐺) where 퐸 is a sub|eld of a |eld extension 퐿/퐾 퐺푎푙(퐿/퐸) are the automorphisms of 퐿 that preserve 퐸 퐺 is a subgroup of 퐺푎푙(퐿/퐾) 퐹푖푥(퐺) is a sub|eld of 퐿 consisting of elements that are preserved by automorphisms in 퐺 See: https://en.wikipedia.org/wiki/Fundamental_theorem_of_Galois_theory 13 / 40 Quotients An equivalence relation can be viewed as a morphism, called a quotient, which takes an object to its equivalence classes. Quotients are always epimorphisms. Why? 14 / 40 Lattices A lattice is a poset in which any two elements have a unique join (least upper bound) and meet (greatest lower bound). A complete lattice P is a lattice where every subset of P has a unique join and meet. A semilattice has only meets or joins, but not both. not a lattice A lattice chain A lattice |lter An important example of a complete lattice is the set of subsets, or the power set of some set 퐴. In that case, joins are unions and meets are intersections, top is 퐴 and bottom empty set. 15 / 40 Lattices The distributive law doesn't necessarily hold in lattices. In other words, if joins are denoted with ∨ and meets are denoted with ∧, the following doesn't necessarily hold: 푎 ∧ (푏 ∨ 푐) = (푎 ∧ 푏) ∨ (푎 ∧ 푐) A frame is a lattice in which the above holds. A locale is a frame with the order reversed. A morphism between two lattices is called a lattice homomorphism if it preserves joins and meets. 16 / 40 Topologies An open set is a set of points without a boundary. This means for any point we choose in that set, we can |nd a sphere around it that is also entirely in the set. A topology is a bounded lattice of open sets closed under in|nite numbers of unions and |nite intersections. 17 / 40 Topologies A set along with a topology (of open sets in the set) is a topological space. Terminological note: For any property 휙 and some 푓 : 퐶 → 퐷 we say that 푓 preserves 휙 when 휙(퐶) ⟹ 휙(푖푚(푓)) and we say that 푓 re}ects 휙 when 휙(푖푚(푓)) ⟹ 휙(퐶). A function between two topological spaces that re}ects open sets is called continuous. A topological space 푆 is called a metric space if there exists a morphism 푑 : 푆 × 푆 → 푅 that takes any two points of S to a distance in 푅 and satis|es: 1. 푑(푥, 푦) = 0 ⟺ 푥 = 푦 2. 푑(푥, 푦) = 푑(푦, 푥) 3. 푑(푥, 푧) ≤ 푑(푥, 푦) + 푑(푦, 푧) 18 / 40 Quotient Spaces A quotient space is the result of a quotient morphism on a space. Also see the real projective plane: https://en.wikipedia.org/wiki/Real_projective_plane 19 / 40 Covers A cover of a subset Y of X is a collection of subsets of X which together contain Y. A re|nement V of a cover U is a cover consisting of 푉푖 such that for every 푈푖 ∈ 푈 , 푉푖 ⊂ 푈푖 . The re|nement relation is therefore a partial order on the set of covers of Y. In topology, covers can be used to characterize spaces. The following picture depicts the notion of "commuting sections" of covers. 20 / 40 Manifold One type of topological space is a manifold, which locally looks like Euclidean space but can globally be very messy. This local vs. global theme can be characterized as a morphism from a space called the tangent space to the manifold. Locality in this case is then described by the point-wise sections of this map. 21 / 40 Algebras An algebra is a complete lattice in which every element is the join of compact elements. Another de|nition, more common and closely related, is that an algebra is a set together with operators on its elements. Operators take 푛 elements of a set (where 푛 is called the arity) and produce another element in the set. This property that no matter what operators are applied, we always "remain in" the set, is called closure. 22 / 40 Logics A boolean algebra is often used in conjunction with a set of propositions (themselves a collection of symbols that can be combined together according to certain rules). The simplest boolean algebra can also be speci|ed in terms of a truth table. a b 푎 ∧ 푏 푎 ∨ 푏 ¬푎 푎 → 푏 F F F F T T T F F T F F F T F T T T T T T T F T However, we can have boolean algebras of more than two elements.
Load more

Recommended publications
  • 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 .
    [Show full text]
  • Homological Algebra in Characteristic One Arxiv:1703.02325V1
    Homological algebra in characteristic one Alain Connes, Caterina Consani∗ Abstract This article develops several main results for a general theory of homological algebra in categories such as the category of sheaves of idempotent modules over a topos. In the analogy with the development of homological algebra for abelian categories the present paper should be viewed as the analogue of the development of homological algebra for abelian groups. Our selected prototype, the category Bmod of modules over the Boolean semifield B := f0, 1g is the replacement for the category of abelian groups. We show that the semi-additive category Bmod fulfills analogues of the axioms AB1 and AB2 for abelian categories. By introducing a precise comonad on Bmod we obtain the conceptually related Kleisli and Eilenberg-Moore categories. The latter category Bmods is simply Bmod in the topos of sets endowed with an involution and as such it shares with Bmod most of its abstract categorical properties. The three main results of the paper are the following. First, when endowed with the natural ideal of null morphisms, the category Bmods is a semi-exact, homological category in the sense of M. Grandis. Second, there is a far reaching analogy between Bmods and the category of operators in Hilbert space, and in particular results relating null kernel and injectivity for morphisms. The third fundamental result is that, even for finite objects of Bmods the resulting homological algebra is non-trivial and gives rise to a computable Ext functor. We determine explicitly this functor in the case provided by the diagonal morphism of the Boolean semiring into its square.
    [Show full text]
  • Basic Categorial Constructions 1. Categories and Functors
    (November 9, 2010) Basic categorial constructions Paul Garrett [email protected] http:=/www.math.umn.edu/~garrett/ 1. Categories and functors 2. Standard (boring) examples 3. Initial and final objects 4. Categories of diagrams: products and coproducts 5. Example: sets 6. Example: topological spaces 7. Example: products of groups 8. Example: coproducts of abelian groups 9. Example: vectorspaces and duality 10. Limits 11. Colimits 12. Example: nested intersections of sets 13. Example: ascending unions of sets 14. Cofinal sublimits Characterization of an object by mapping properties makes proof of uniqueness nearly automatic, by standard devices from elementary category theory. In many situations this means that the appearance of choice in construction of the object is an illusion. Further, in some cases a mapping-property characterization is surprisingly elementary and simple by comparison to description by construction. Often, an item is already uniquely determined by a subset of its desired properties. Often, mapping-theoretic descriptions determine further properties an object must have, without explicit details of its construction. Indeed, the common impulse to overtly construct the desired object is an over- reaction, as one may not need details of its internal structure, but only its interactions with other objects. The issue of existence is generally more serious, and only addressed here by means of example constructions, rather than by general constructions. Standard concrete examples are considered: sets, abelian groups, topological spaces, vector spaces. The real reward for developing this viewpoint comes in consideration of more complicated matters, for which the present discussion is preparation. 1. Categories and functors A category is a batch of things, called the objects in the category, and maps between them, called morphisms.
    [Show full text]
  • FINITE CATEGORIES with PUSHOUTS 1. Introduction
    Theory and Applications of Categories, Vol. 30, No. 30, 2015, pp. 1017{1031. FINITE CATEGORIES WITH PUSHOUTS D. TAMBARA Abstract. Let C be a finite category. For an object X of C one has the hom-functor Hom(−;X) of C to Set. If G is a subgroup of Aut(X), one has the quotient functor Hom(−;X)=G. We show that any finite product of hom-functors of C is a sum of hom- functors if and only if C has pushouts and coequalizers and that any finite product of hom-functors of C is a sum of functors of the form Hom(−;X)=G if and only if C has pushouts. These are variations of the fact that a finite category has products if and only if it has coproducts. 1. Introduction It is well-known that in a partially ordered set the infimum of an arbitrary subset exists if and only if the supremum of an arbitrary subset exists. A categorical generalization of this is also known. When a partially ordered set is viewed as a category, infimum and supremum are respectively product and coproduct, which are instances of limits and colimits. A general theorem states that a category has small limits if and only if it has small colimits under certain smallness conditions ([Freyd and Scedrov, 1.837]). We seek an equivalence of this sort for finite categories. As finite categories having products are just partially ordered sets, we ought to replace the existence of product by some weaker condition. Let C be a category. For an object X of C, hX denotes the hom-functor Hom(−;X) of C to the category Set.
    [Show full text]
  • Notes on Category Theory (In Progress)
    Notes on Category Theory (in progress) George Torres Last updated February 28, 2018 Contents 1 Introduction and Motivation 3 2 Definition of a Category 3 2.1 Examples . .4 3 Functors 4 3.1 Natural Transformations . .5 3.2 Adjoint Functors . .5 3.3 Units and Counits . .6 3.4 Initial and Terminal Objects . .7 3.4.1 Comma Categories . .7 4 Representability and Yoneda's Lemma 8 4.1 Representables . .9 4.2 The Yoneda Embedding . 10 4.3 The Yoneda Lemma . 10 4.4 Consequences of Yoneda . 11 5 Limits and Colimits 12 5.1 (Co)Products, (Co)Equalizers, Pullbacks and Pushouts . 13 5.2 Topological limits . 15 5.3 Existence of limits and colimits . 15 5.4 Limits as Representable Objects . 16 5.5 Limits as Adjoints . 16 5.6 Preserving Limits and GAFT . 18 6 Abelian Categories 19 6.1 Homology . 20 6.1.1 Biproducts . 21 6.2 Exact Functors . 23 6.3 Injective and Projective Objects . 26 6.3.1 Projective and Injective Modules . 27 6.4 The Chain Complex Category . 28 6.5 Homological dimension . 30 6.6 Derived Functors . 32 1 CONTENTS CONTENTS 7 Triangulated and Derived Categories 35 ||||||||||| Note to the reader: This is an ongoing collection of notes on introductory category theory that I have kept since my undergraduate years. They are aimed at students with an undergraduate level background in topology and algebra. These notes started as lecture notes for the Fall 2015 Category Theory tutorial led by Danny Shi at Harvard. There is no single textbook that these notes follow, but Categories for the Working Mathematician by Mac Lane and Lang's Algebra are good standard resources.
    [Show full text]
  • The Bicategory of Topoi, and Spectra
    Reprints in Theory and Applications of Categories, No. 25, 2016, pp. 1{16. THE BICATEGORY OF TOPOI AND SPECTRA J. C. COLE Author's note. The present appearance of this paper is largely due to Olivia Caramello's tracking down a citation of Michel Coste which refers to this paper as \to appear...". This \reprint" is in fact the first time it has been published { after more than 35 years! My apologies for lateness therefore go to Michel, and my thanks to Olivia! Thanks also to Anna Carla Russo who did the typesetting, and to Tim Porter who remembered how to contact me. The \spectra" referred to in the title are right adjoints to forgetful functors between categories of topoi-with-structure. Examples are the local-rings spectrum of a ringed topos, the etale spectrum of local-ringed topos, and many others besides. The general idea is to solve a universal problem which has no solution in the ambient set theory, but does have a solution when we allow a change of topos. The remarkable fact is that the general theorems may be proved abstractly from no more than the fact that Topoi is finitely complete, in a sense appropriate to bicategories. 1 Bicategories 1.1 A 2-category is a Cat-enriched category: it has hom-categories (rather than hom- sets) and composition is functorial, so than the composite of a diagram f g A B óα C D denoted f ¦ α ¦ g is unambiguously defined. In a 2-category A, as well as the (ordinary) finite limits obtained from a terminal object and pullbacks, we consider limits of diagrams having 2-cells.
    [Show full text]
  • Basic Category Theory
    Basic Category Theory TOMLEINSTER University of Edinburgh arXiv:1612.09375v1 [math.CT] 30 Dec 2016 First published as Basic Category Theory, Cambridge Studies in Advanced Mathematics, Vol. 143, Cambridge University Press, Cambridge, 2014. ISBN 978-1-107-04424-1 (hardback). Information on this title: http://www.cambridge.org/9781107044241 c Tom Leinster 2014 This arXiv version is published under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International licence (CC BY-NC-SA 4.0). Licence information: https://creativecommons.org/licenses/by-nc-sa/4.0 c Tom Leinster 2014, 2016 Preface to the arXiv version This book was first published by Cambridge University Press in 2014, and is now being published on the arXiv by mutual agreement. CUP has consistently supported the mathematical community by allowing authors to make free ver- sions of their books available online. Readers may, in turn, wish to support CUP by buying the printed version, available at http://www.cambridge.org/ 9781107044241. This electronic version is not only free; it is also freely editable. For in- stance, if you would like to teach a course using this book but some of the examples are unsuitable for your class, you can remove them or add your own. Similarly, if there is notation that you dislike, you can easily change it; or if you want to reformat the text for reading on a particular device, that is easy too. In legal terms, this text is released under the Creative Commons Attribution- NonCommercial-ShareAlike 4.0 International licence (CC BY-NC-SA 4.0). The licence terms are available at the Creative Commons website, https:// creativecommons.org/licenses/by-nc-sa/4.0.
    [Show full text]
  • Comma Categories
    Comma Categories Ross Tate February 12, 2018 F1 F2 Definition. Given functors A1 −! B − A2, the comma category F1 # F2 is comprised of the following: m Objects A triple hA1 2 ObA1 ;A2 2 ObA1 ; m 2 HomB(F1(A1);F2(A2))i, often just written F1A1 −! F2A2. 0 m 0 m 0 0 Morphisms Given two objects F1A1 −! F2A2 and F1A1 −−! F2A2, a morphism from m to m is a pair 0 0 hf1 2 HomA1 (A1;A1); f2 2 HomA2 (A2;A2)i such that following square commutes: m F1A1 F2A2 F1f1 F2f2 0 0 m 0 F1A1 F2A2 Morphisms are often simply depicted by this square. Identity The identity on object m : F1A1 ! F2A2 is the following: m F1A1 F2A2 F1id A1 F2id A2 m F1A1 F2A2 0 0 Composition The composition of morphims hf1; f2i and hf1; f2i is the following: m F1A1 F2A2 F1f1 F2f2 0 0 m 0 F1A1 F2A2 0 0 F1f1 F2f2 00 00 m 00 F1A1 F2A2 Definition. In the case where either F1 or F2 is actually the identity functor on B, then one typically uses the notations B # F2 or F1 # B rather than IdB # F2 or F1 # IdB. In general, as an abuse of notation, one often denotes the identity functor on a category with the category itself. Similarly, one often denotes the identity morphism on an object with the object itself. Definition.1 is the category with a single object (?) and a single morphism (?) on that object. 1 Example. Given functors 1 −! Set Id−−−Set Set (where the former is the constant functor picking out the singleton set 1), the comma category 1 # Set is also known as pSet, the category of pointed sets.
    [Show full text]
  • Functors and Natural Transformations
    Functors and natural transformations functors ; category morphisms natural transformations ; functor morphisms Andrzej Tarlecki: Category Theory, 2018 - 90 - Functors A functor F: K ! K0 from a category K to a category K0 consists of: • a function F: jKj ! jK0j, and • for all A; B 2 jKj, a function F: K(A; B) ! K0(F(A); F(B)) such that: Make explicit categories in which we work at various places here • F preserves identities, i.e., F(idA) = idF(A) for all A 2 jKj, and • F preserves composition, i.e., F(f;g) = F(f);F(g) for all f : A ! B and g : B ! C in K. We really should differentiate between various components of F Andrzej Tarlecki: Category Theory, 2018 - 91 - Examples • identity functors: IdK : K ! K, for any category K 0 0 • inclusions: IK,!K0 : K ! K , for any subcategory K of K 0 0 0 • constant functors: CA : K ! K , for any categories K; K and A 2 jK j, with CA(f) = idA for all morphisms f in K • powerset functor: P: Set ! Set given by − P(X) = fY j Y ⊆ Xg, for all X 2 jSetj − P(f): P(X) ! P(X0) for all f : X ! X0 in Set, P(f)(Y ) = ff(y) j y 2 Y g for all Y ⊆ X op • contravariant powerset functor: P−1 : Set ! Set given by − P−1(X) = fY j Y ⊆ Xg, for all X 2 jSetj 0 0 − P−1(f): P(X ) ! P(X) for all f : X ! X in Set, 0 0 0 0 P−1(f)(Y ) = fx 2 X j f(x) 2 Y g for all Y ⊆ X Andrzej Tarlecki: Category Theory, 2018 - 92 - Examples, cont'd.
    [Show full text]
  • Comma Category
    FORMALIZED MATHEMATICS Vol.2,No.5, November–December 1991 Universit´e Catholique de Louvain Comma Category Grzegorz Bancerek Agata Darmochwa l Warsaw University, Bia lystok Warsaw University IM PAN, Warszawa Summary. Comma category of two functors is introduced. MML Identifier: COMMACAT. The terminology and notation used in this paper have been introduced in the following articles: [9], [10], [1], [5], [2], [7], [4], [3], [6], and [8]. We now define four new functors. Let x be arbitrary. The functor x1,1 is defined by: (Def.1) x1,1 = (x1)1. The functor x1,2 is defined as follows: (Def.2) x1,2 = (x1)2. The functor x2,1 is defined by: (Def.3) x2,1 = (x2)1. The functor x2,2 is defined as follows: (Def.4) x2,2 = (x2)2. In the sequel x, x1, x2, y, y1, y2 are arbitrary. One can prove the following proposition (1) hhhhx1, x2ii, yii1,1 = x1 and hhhhx1, x2ii, yii1,2 = x2 and hhx, hhy1, y2iiii2,1 = y1 and hhx, hhy1, y2iiii2,2 = y2. Let D1, D2, D3 be non-empty sets, and let x be an element of [:[: D1, D2 :], D3 :]. Then x1,1 is an element of D1. Then x1,2 is an element of D2. Let D1, D2, D3 be non-empty sets, and let x be an element of [: D1, [: D2, D3 :]:]. Then x2,1 is an element of D2. Then x2,2 is an element of D3. For simplicity we follow a convention: C, D, E are categories, c is an object of C, d is an object of D, x is arbitrary, f is a morphism of E, g is a morphism of C, h is a morphism of D, F is a functor from C to E, and G is a functor from D to E.
    [Show full text]
  • Category Theory in Context
    Category theory in context Emily Riehl The aim of theory really is, to a great extent, that of systematically organizing past experience in such a way that the next generation, our students and their students and so on, will be able to absorb the essential aspects in as painless a way as possible, and this is the only way in which you can go on cumulatively building up any kind of scientific activity without eventually coming to a dead end. M.F. Atiyah, “How research is carried out” Contents Preface 1 Preview 2 Notational conventions 2 Acknowledgments 2 Chapter 1. Categories, Functors, Natural Transformations 5 1.1. Abstract and concrete categories 6 1.2. Duality 11 1.3. Functoriality 14 1.4. Naturality 20 1.5. Equivalence of categories 25 1.6. The art of the diagram chase 32 Chapter 2. Representability and the Yoneda lemma 43 2.1. Representable functors 43 2.2. The Yoneda lemma 46 2.3. Universal properties 52 2.4. The category of elements 55 Chapter 3. Limits and Colimits 61 3.1. Limits and colimits as universal cones 61 3.2. Limits in the category of sets 67 3.3. The representable nature of limits and colimits 71 3.4. Examples 75 3.5. Limits and colimits and diagram categories 79 3.6. Warnings 81 3.7. Size matters 81 3.8. Interactions between limits and colimits 82 Chapter 4. Adjunctions 85 4.1. Adjoint functors 85 4.2. The unit and counit as universal arrows 90 4.3. Formal facts about adjunctions 93 4.4.
    [Show full text]
  • Limits, Colimits and How to Calculate Them in the Category of Modules Over a Pid
    LIMITS, COLIMITS AND HOW TO CALCULATE THEM IN THE CATEGORY OF MODULES OVER A PID. KAIRUI WANG Abstract. The goal of this paper is to introduce methods that allow us to calculate certain limits and colimits in the category of modules over a principal ideal domain. We start with a quick review of basic categorical language and duality. Then we develop the concept of universal morphisms and derive limits and colimits as special cases. The completeness and cocompleteness theorems give us methods to calculate the morphisms associated with limits and colimits in general. To use these methods, we then specialize to the case of finitely generated modules over a PID. We first develop the Smith normal form as a computational tool and prove the structure theorem for finitely generated modules over a PID. Lastly, we discuss how to use the abstract methods suggested by the completeness and cocompleteness theorems in the context of RMod. Contents 1. Basic Definitions and Concepts 1 2. Universality 3 3. Limits and Colimits 5 4. Smith Normal Form and Finitely Generated Modules over a PID 9 5. Finding Limits and Colimits of Special Modules 13 Acknowledgments 15 References 15 1. Basic Definitions and Concepts We begin with a quick review of the definitions of category, functor and natural transformation. Definition 1.1. A category C consists of a class Ob(C) whose elements are called objects, where for each pair of objects X; Y 2 Ob(C), there is a set Hom(X; Y ) whose elements are called morphisms; 1 and for each object X, there is a morphism 1X : X ! X called the identity morphism on X.
    [Show full text]