Category Theory By: Ashley Reynolds. HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors,

Slides:



Advertisements
Similar presentations
T YPE I SOMORPHISM O LA M AHMOUD S UPERVISED BY : D R. M ARCELO F IORE UNIVERSITY OF CAMBRIDGE Computer Laboratory Theory & Semantics Group I NTRODUCTION.
Advertisements

Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Mathematics of Cryptography Part II: Algebraic Structures
Cryptography and Network Security
Copyright © Cengage Learning. All rights reserved.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
Instructor: Hayk Melikya
1 What are Bit Strings? The View from Process Nick Rossiter Northumbria University.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Math 3121 Abstract Algebra I
Traced Premonoidal Categories Nick Benton Microsoft Research Martin Hyland University of Cambridge.
Discrete Mathematics Lecture 4 Harper Langston New York University.
Abstract Some of the so called smallness conditions in algebra as well as in Category Theory, important and interesting for their own and also tightly.
1 Category Theory in a ( E,M ) -category Some aspects of category theory, in particular related to universality, can be developed in any finitely complete.
THE TRANSITION FROM ARITHMETIC TO ALGEBRA: WHAT WE KNOW AND WHAT WE DO NOT KNOW (Some ways of asking questions about this transition)‏
Graphs, relations and matrices
MTH 232 Section 8.1 Algebraic Expressions, Functions, & Equations.
Relations Chapter 9.
The Relationship between Topology and Logic Dr Christopher Townsend (Open University)
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
CSE314 Database Systems Data Modeling Using the Entity- Relationship (ER) Model Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson Ed Slide Set.
In mathematics, a rational number is any number that can be expressed as the quotient or fraction p/q of two integers, with the denominator q not equal.
FINITE FIELDS 7/30 陳柏誠.
 Let A and B be any sets A binary relation R from A to B is a subset of AxB Given an ordered pair (x, y), x is related to y by R iff (x, y) is in R. This.
Copyright © Cengage Learning. All rights reserved.
Tending the Greenhouse Vertical and Horizontal Connections within the Mathematics Curriculum Kimberly M. Childs Stephen F. Austin State University.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
1 2. Independence and Bernoulli Trials Independence: Events A and B are independent if It is easy to show that A, B independent implies are all independent.
Chapter 3 – Set Theory  .
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Categories and Computer Science
 The idea for chapter 4 came from the Masters thesis of my student Janine du Plessis, from Georgia State University,  TRANSFORMATION GROUPS AND DUALITY.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Temperature Readings The equation to convert the temperature from degrees Fahrenheit to degrees Celsius is: c(x) = (x - 32) The equation to convert the.
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
The homology groups of a partial monoid action category Ahmet A. Husainov
Triangulated Categories. Jaber Akbari May 2015.
Lecture 2: Introduction to Category Theory Nick Rossiter, Computing Science, Newcastle University, England
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Copyright © Cengage Learning. All rights reserved.
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
Balanced Category Theory Claudio Pisani Calais, June 2008.
Positively Expansive Maps and Resolution of Singularities Wayne Lawton Department of Mathematics National University of Singapore
The theory behind Functional Programming Functional: based on lambda calculus / combinators, recursion theory, category theory. By contrast with other.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems.
Data Types 2 Arithmetic funtions ans laws.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Alex. Grothendieck Born 28 March 1928  Mathematician and the central figure behind the creation of the modern theory of algebraic geometry. His research.
Winter 2007SEG2101 Chapter 31 Chapter 3 Requirements Specifications.
Classical Control in Quantum Programs Dominique Unruh IAKS, Universität Karlsruhe Founded by the European Project ProSecCo IST
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Chapter 7 Algebraic Structures
The Relation Induced by a Partition
Direct Proof and Counterexample III: Divisibility
Axioms for a category of spaces
IDEALS AND I-SEQUENCES IN THE CATEGORY OF MODULES
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Conditions for Interoperability
The Process Semantics of Time and Space as Anticipation
Presentation transcript:

Category Theory By: Ashley Reynolds

HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors, and natural transformations as part of their work in topology, especially algebraic topology.  Their work was an important part of the transition from intuitive and geometric homology to axiomatic homology theory.  Eilenberg and Mac Lane later wrote that their goal was to understand natural transformations; in order to do that, functors had to be defined, which required categories.

History Continued  These foundational applications of category theory have been worked out in fair detail as a basis for, and justification of, constructive mathematics.  More recent efforts to introduce undergraduates to categories as a foundation for mathematics include William Lawvere and Rosebrugh (2003) and Lawvere and Stephen Schanuel (1997) and Mirroslav Yotov (2012).

What is Category Theory  Category theory is used to formalize mathematics and its concepts as a collection of objects and arrows (also called morphisms). Category theory can be used to formalize concepts of other high-level abstractions such as set theory, field theory, and group theory.  Another definition: Category theory is a relatively young branch of mathematics, stemming from algebraic topology, and designed to describe various structural concepts from different mathematical fields in a uniform way.

Definitions  A category is a collection of data that satisfy some particular properties. So, saying that such and so forms a category is merely short for asserting that such and so satisfy all the axioms of a category.  A category is: the following data, subject to certain axioms.  A collection of things called objects. By default, A, B, C, … vary over objects.  A collection of things called morphisms, sometimes called arrows. By default, f, g, h, …, and later on α,β, φ, ψ, χ, …, very over morphisms.  A relation on morphisms and pairs of objects, called typing of the morphisms. By default, the relation is denoted f: A → B, for morphisms f and objects A, B. In this case we also say that A → B is the type of f, and that f is a morphism from A to B. In the view of the axioms below we may define the source and target by src f = A and tgt f = B whenever f: A → B.

Definitions (Cont.)  A category is: the following data, subject to certain axioms. (cont.)  A binary partial operation on morphisms, called composition. By default, f ; g is the notation of the composition of morphisms f and g. An alternative notation is g ◦ f, and even g f, with the convention f ; g = g ◦ f = g f.  For each object A a distinguished morphism, called an identity on A. By default, id A, or id when A is clear from the context, denotes the identity on object A. A category with objects X, Y, Z and morphisms f, g, g ∘ f, and three identity morphisms (not shown) 1 X, 1 Y and 1 Z.

Axioms that hold for a Category  There are three typing axioms, and two axioms for equality. The typing axioms are these:  f: A → B and f: A ′ → B′ A = A ′ and B = B ′ Unique Type  f: A → B and g: B → C f ; g : A → CComposition Type  id A : A → A Identity Type  Axioms for equality:  ( f ; g ) ; h = f ; ( g ; h)Composition- Assoc  id ; f = f = f ; id Identity

Uses of Categories  Categories can be seen in  Sets  Groups and pre-orders  Cartesian closed categories, and Topoi  Constructing new categories  Functors

Diagrams  An important tool in the practice of Category Theory is the use of diagrams for representing equations. In a diagram a morphism f Є C [a,b] is drawn as an arrow from a to b labeled as f.  A diagram commutes if the composition of the morphism along any path between two fixed objects is equal. For example, the associative and identity laws of the definition of “category” may be nicely visualized by the following diagrams:

Diagrams Cont.  Diagrams are a typical way, in Category Theory, to describe equational reasoning and turn out to be a particularly effective when dealing with several equations at a time.  In particular, assertions such as “if diagram 1 and … diagram n commutes” expression conditional statements about equalities.

Category Theory Research  The researches developed by the category theory group fit into five main lines: 1) localizations of presheaf categories and algebraic categories ; 2) non-abelian and higher order homological algebra ; 3) descent theory and Galois theories ; 4) semi-abelian and homological categories ; 5) accessible categories ;

Localizations of Presheaf Categories and Algebraic Categories  A new impulsion to the research in this area has been given by the theory of the exact completion, applied to obtain new results on (essential) localizations of monadic categories and algebraic categories, and to give a uniform approach to some classical results (Giraud characterization of topos, Gabriel-Popescu representation theorem for Grothendieck categories and Freyd representation theorems in abelian categories).  It has been used also in universal algebra, especially in connection with Malcev varieties and quasi-varieties. More recently, a complete classification of localizations and geometric morphisms of algebraic and presheaf categories has been obtained.

Non-Abelian and Higher Order Homological Algebra  A categorical approach to ring theory consists in replacing R-algebras with small enriched categories. In this line, our research group has developed a theory of Azumaya categories, together with the associated Brauer group. The more delicate treatment of the Brauer-Taylor group has also been achieved, and related new problems involving "categories without units" have been investigated.

Descent Theory and Galois Theories  The classical descent theory for ring homomorphisms admits a description in terms of monads, allowing to study it in much more general contexts. We investigate in particular a possible refinement of this classical theory in terms of the pure spectrum of the ring. We have also solved the descent problem in the case of algebraic fibrations and of internal functors in a lextensive category.

Semi-Abelian and Homological Categories  The discovery of an internal notion of crossed module opens a new perspective for the developments of this theory in the context of semi- abelian categories and offers a unified approach to the study of the homological properties of crossed modules, crossed rings and other structures internal to varieties of algebras. Encouraging results in the classification of central extensions of precrossed modules have also been obtained.

Accessible Categories  Accessible categories are the categories of models of sketchable theories. Our group has been involved in various research projects in this area: an enriched theory of accessible categories, a Morita theorem for sketches, a classification of accessible categories independent of cardinal arithmetic, a study of injectivity in accessible categories, a characterisation of von Neumann varieties, a study of filtered enriched colimits over finitely presentable bases.

Resources   