Category theory and structuralism

Slides:



Advertisements
Similar presentations
Functions Reading: Epp Chp 7.1, 7.2, 7.4
Advertisements

Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Copyright © Cengage Learning. All rights reserved.
Transitive Closure Theorem 1. Let R be a relation on a set A. Then R  is the transitive closure of R. the reachability relation R * of a relation R on.
Instructor: Hayk Melikya
(CSC 102) Discrete Structures Lecture 14.
Discrete Mathematics Lecture # 16 Inverse of Relations.
Functions Section 2.3 of Rosen Fall 2008
Assume f: A  B and g: B  C are functions. Which are defined? (1) f  g (2) g  f(3) both(4) neither.
1 CA 208 Logic Ex4 Commutativity (P  Q)  Associativity P  (Q  R)  (P  Q)  R Distributivity P  (Q  R)  Idempotency.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
Copyright © Cengage Learning. All rights reserved.
The Relationship between Topology and Logic Dr Christopher Townsend (Open University)
Algebra Quick Test June Put the numbers one to 12 down the page This is a speed test. We will then go through it together.
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
FUNCTION Discrete Mathematics Asst. Prof. Dr. Choopan Rattanapoka.
1 2 Sets and Functions. The symbol means ‘is an element of’. Introduction to Set Theory In Mathematics, the word set refers to a group of numbers or other.
Math 1304 Calculus I 2.5 – Continuity. Definition of Continuity Definition: A function f is said to be continuous at a point a if and only if the limit.
Copyright © Peter Cappello Mathematical Induction Goals Explain & illustrate construction of proofs of a variety of theorems using mathematical induction.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Functions Math 123 September 24-26, Another boring topic? Functions are one of the mathematical concepts that students understand the least. Why.
MAT 1234 Calculus I Section 1.8 Continuity
Categories and Computer Science
Mathematics for Computing Lecture 8: Functions Dr Andrew Purkiss-Trew Cancer Research UK
1 Annoucement n Skills you need: (1) (In Thinking) You think and move by Logic Definitions Mathematical properties (Basic algebra etc.) (2) (In Exploration)
Functions Section 2.3 of Rosen Spring 2012 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions: Use Piazza.
1 Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 1 The Foundations: Logic, Sets,
MENU REVIEW GAME QUIZ RELATION AND FUNCTIONS >> DOMAIN, CODOMAIN, RANGE DOMAIN, CODOMAIN, RANGE THE NUMBER OF MAPPING TWO SETS THE NUMBER OF MAPPING TWO.
1.4 Sets Definition 1. A set is a group of objects . The objects in a set are called the elements, or members, of the set. Example 2 The set of positive.
Functions Reading: Chapter 6 (94 – 107) from the text book 1.
Math Chapter 6 Part II. POWER SETS In mathematics, given a set S, the power set of S, written P(S) or 2 n(S), is the set of all subsets of S. Remember.
Agenda Week 10 Lecture coverage: –Functions –Types of Function –Composite function –Inverse of a function.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
Chapter 1 Introduction to Geometry. Slide Getting Started Points – To name a point always use Lines – All lines are and extend in both directions.
Week 7 - Monday.  What did we talk about last time?  Sets.
 R  A×B,R is a relation from A to B , DomR  A 。  (a,b)  R (a, c)  R  (a,b)  R (a, c)  R unless b=c  function  DomR=A , (everywhere)function.
11 DISCRETE STRUCTURES DISCRETE STRUCTURES UNIT 5 SSK3003 DR. ALI MAMAT 1.
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.
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 2: Subgroups and Isomorphism
Lecture # 12. Nondeterministic Finite Automaton (NFA) Definition: An NFA is a TG with a unique start state and a property of having single letter as label.
Discrete Mathematics CS 2610 January 27, part 2.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
Functions – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Functions Reading: Kolman, Section 5.1.
DEFINITIONS For a function F : A  B, the inverse of F is the following relation from B to A: F –1 = {(x, y) : (y, x)  F}. For functions F : A  B and.
August 2003 CIS102/LECTURE 9/FKS 1 Mathematics for Computing Lecture 9 LOGIC Chapter 3.
1 Lecture 5 Functions. 2 Functions in real applications Curve of a bridge can be described by a function Converting Celsius to Fahrenheit.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Discrete Mathematics Lecture # 17 Function. Relations and Functions  A function F from a set X to a set Y is a relation from X to Y that satisfies the.
EXAMPLE FORMULA DEFINITION 1.
Relations and Functions
Applied Discrete Mathematics Week 2: Functions and Sequences
Chapter 2 Sets and Functions.
Lecture 9 Theory of AUTOMATA
Elementary Properties of Groups
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Set Operations Section 2.2.
Applied Discrete Mathematics Week 2: Proofs
DISCRETE COMPUTATIONAL STRUCTURES
Composition OF Functions.
Composition of Functions
Applied Discrete Mathematics Week 3: Sets
Composition OF Functions.
Chapter 1: Linear Functions, Equations, and Inequalities
The Fundamental Theorems of Calculus
Lecture # 18 Types of Functions
Recap Lecture 4 Regular expression of EVEN-EVEN language, Difference between a* + b* and (a+b)*, Equivalent regular expressions; sum, product and closure.
Lecture # 16 Inverse of Relations
Presentation transcript:

Category theory and structuralism Binghui, Shen

An introduction to Category theory An introduction to Structuralism Why Further development

Definition of a category A category consists of the following data: • Objects: A,B, C, . . . • Arrows: f, g, h, . . . • For each arrow f, there are given objects dom(f), cod(f) called the domain and codomain of f. We write f : A → B to indicate that A = dom(f) and B = cod(f)

Definition of a category Given arrows f : A → B and g : B → C, that is, with cod(f) = dom(g) there is given an arrow g ◦ f : A → C called the composite of f and g. For each object A, there is given an arrow 1A : A → A called the identity arrow of A

Definition of a category Associativity: h ◦ (g ◦ f) = (h ◦ g) ◦ f for all f : A → B, g : B → C, h : C → D. Unit: f ◦ 1A = f = 1B ◦ f for all f : A → B.

Some Examples Functions of sets: Let f be a function from set A to set B f : A → B. Now suppose we also have a function g : B → C, then there is a composite function g ◦ f : A → C, (g ◦ f)(a) = g(f(a)) a ∈ A.

Some Examples Functions of sets: Now this operation “◦” of composition of functions is associative. Suppose: h : C → D

Some Examples Functions of sets: we can compare (h ◦ g) ◦ f and h ◦ (g ◦ f) as indicated in the diagram given above. Two functions are always identical, (h ◦ g) ◦ f = h ◦ (g ◦ f) since for any a ∈ A, we have ((h ◦ g) ◦ f)(a) = h(g(f(a))) = (h ◦ (g ◦ f))(a)

Some Examples Functions of sets: Finally, note that every set A has an identity function 1A : A → A 1A(a) = a.

Some Examples A deductive system of logic there is an associated category of proofs, the objects are formulas: ϕ, ψ, . . . An arrow from ϕ to ψ is a deduction of ψ from the assumption ϕ.

Some Examples A deductive system of logic Composition of arrows is given by putting together such deductions, which is associative. The identity arrows 1ϕ is ϕ to ϕ

STRUCTURALISM The essence of a natural number is its relations to other natural numbers a system is a collection of objects with certain relations among them. structure is the abstract form of a system, highlighting the interrelationships among the objects mathematics is the deductive study of structures as such.