User:Michiexile/MATH198/Lecture 1
From HaskellWiki
Michiexile (Talk | contribs) |
Michiexile (Talk | contribs) |
||
Line 26: | Line 26: | ||
==Category== |
==Category== |
||
+ | |||
+ | ===Graphs=== |
||
+ | |||
+ | * Graph is vertices and edges. Each edge has source and target. |
||
+ | * Notation: <math>G</math> a graph, <math>G_0</math> the vertices, <math>G_1</math> the edges. |
||
+ | * Some examples. |
||
+ | * Complete structure given by <math>G_0</math>, <math>G_1</math> and the two functions <math>s,t:G_1\to G_0</math>. |
||
+ | |||
+ | * Endoarrow, empty graph, discrete graph, complete graph, small graph, large graph, set theoretical traps, finite graph, simple graphs. |
||
+ | |||
+ | * Homomorphism: Map edges to edges, vertices to vertices, respects source and target maps. |
||
+ | |||
+ | * Paths: A path from the node <math>x</math> to the node <math>y</math> is some sequence of edges <math>(f_1,\dots,f_n)</math> with: |
||
+ | ** <math>s(f_1)=x</math> |
||
+ | ** <math>t(f_n)=y</math> |
||
+ | ** <math>s(f_i) = t(f_{i-1})</math> for all other <math>i</math>. |
||
+ | |||
+ | * For any node <math>x</math>, there is a unique path from <math>x</math> to <math>x</math> of length 0: <math>()</math>. |
||
+ | * For any edge <math>f</math>, there is a unique path from <math>s(f)</math> to <math>t(f)</math> of length 1. |
||
+ | |||
+ | * We denote by <math>G_k</math> the set of all paths in <math>G</math> of length <math>k</math>. |
||
+ | * This is compatible with out previous definition of <math>G_0,G_1</math>. |
||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ---- |
||
===Graphs and paths=== |
===Graphs and paths=== |
Revision as of 12:05, 8 September 2009
Contents |
1 Welcome, administrativia
2 Introduction
2.1 Why this course?
An introduction to Haskell will usually come with pointers toward Category Theory as a useful tool, though not with much more than the mention of the subject. This course is intended to fill that gap, and provide an introduction to Category Theory that ties into Haskell and functional programming as a source of examples and applications.
2.2 What will we cover?
The definition of categories, special objects and morphisms, functors, natural transformation, (co-)limits and special cases of these, adjunctions, freeness and presentations as categorical constructs, monads and Kleisli arrows, recursion with categorical constructs.
Maybe, just maybe, if we have enough time, we'll finish with looking at the definition of a topos, and how this encodes logic internal to a category. Applications to fuzzy sets.
2.3 What do we require?
Our examples will be drawn from discrete mathematics, logic, Haskell programming and linear algebra. I expect the following concepts to be at least vaguely familiar to anyone taking this course:
- Sets
- Functions
- Permutations
- Groups
- Partially ordered sets
- Vector spaces
- Linear maps
- Matrices
- Homomorphisms
3 Category
3.1 Graphs
- Graph is vertices and edges. Each edge has source and target.
- Notation: G a graph, G_{0} the vertices, G_{1} the edges.
- Some examples.
- Complete structure given by G_{0}, G_{1} and the two functions .
- Endoarrow, empty graph, discrete graph, complete graph, small graph, large graph, set theoretical traps, finite graph, simple graphs.
- Homomorphism: Map edges to edges, vertices to vertices, respects source and target maps.
- Paths: A path from the node x to the node y is some sequence of edges with:
- s(f_{1}) = x
- t(f_{n}) = y
- s(f_{i}) = t(f_{i − 1}) for all other i.
- For any node x, there is a unique path from x to x of length 0: ().
- For any edge f, there is a unique path from s(f) to t(f) of length 1.
- We denote by G_{k} the set of all paths in G of length k.
- This is compatible with out previous definition of G_{0},G_{1}.
3.2 Graphs and paths
A graph is a collection G_{0} of vertices and a collection G_{1} of arrows. The structure of the graph is captured in the existence of two functions, that we shall call source and target, both going from G_{1} to G_{1}. In other words, each arrow has a source and a target.
We denote by [v,w] the collection of arrows with source v and target w.
We extend the notation, and denote by G_{i} the collection of all paths of length i. Such a path is a sequence of arrows, such that for each j, target(f_{j − 1}) = source(f_{j}).
3.3 Definition of a category
A category is a graph with some special structure:
- Each [v,w] is a set and equipped with a composition operation . In other words, any two arrows, such that the target of one is the source of the other, can be composed to give a new arrow with target and source from the ones left out.
We write if .
=>
- The composition of arrows is associative.
- Each vertex v has a dedicated arrow 1_{v} with source and target v, called the identity arrow.
- Each identity arrow is a left- and right-identity for the composition operation.
The composition of with is denoted by . A mnemonic here is that you write things so associativity looks right. Hence, (gf)(x) = g(f(x)). This will make more sense once we get around to generalized elements later on.
3.4 Examples
- The empty category with no vertices and no arrows.
- The category 1 with a single vertex and only its identity arrow.
- The category 2 with two objects, their identity arrows and the arrow .
- For vertices take vector spaces. For arrows, take linear maps. This is a category, the identity arrow is just the identity map f(x) = x and composition is just function composition.
- For vertices take finite sets. For arrows, take functions.
- For vertices take logical propositions. For arrows take proofs in propositional logic. The identity arrow is the empty proof: P proves P without an actual proof. And if you can prove P using Q and then R using P, then this composes to a proof of R using Q.
- For vertices, take data types. For arrows take (computable) functions. This forms a category, in which we can discuss an abstraction that mirrors most of Haskell. There are issues making Haskell not quite a category on its own, but we get close enough to draw helpful conclusions and analogies.
- Suppose P is a set equipped with a partial ordering relation <. Then we can form a category out of this set with elements for vertices and with a single element in [v,w] if and only if v<w. Then the transitivity and reflexivity of partial orderings show that this forms a category.
Some language we want settled:
A category is concrete if it is like the vector spaces and the sets among the examples - the collection of all sets-with-specific-additional-structure equipped with all functions-respecting-that-structure. We require already that [v,w] is always a set.
A category is small if the collection of all vertices, too, is a set.