DOCSLIB.ORG

1. Directed Graphs Or Quivers What Is Category Theory? • Graph Theory on Steroids • Comic Book Mathematics • Abstract Nonsense • the Secret Dictionary

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
1. Directed Graphs Or Quivers What Is Category Theory? • Graph Theory on Steroids • Comic Book Mathematics • Abstract Nonsense • the Secret Dictionary 1. Directed graphs or quivers What is category theory? • Graph theory on steroids • Comic book mathematics • Abstract nonsense • The secret dictionary Sets and classes: For S = fX j X2 = Xg, have S 2 S , S2 = S Directed graph or quiver: C = (C0;C1;@0 : C1 ! C0;@1 : C1 ! C0) Class C0 of objects, vertices, points, . Class C1 of morphisms, (directed) edges, arrows, . For x; y 2 C0, write C(x; y) := ff 2 C1 j @0f = x; @1f = yg f 2C1 tail, domain / @0f / @1f o head, codomain op Opposite or dual graph of C = (C0;C1;@0;@1) is C = (C0;C1;@1;@0) Graph homomorphism F : D ! C has object part F0 : D0 ! C0 and morphism part F1 : D1 ! C1 with @i ◦ F1(f) = F0 ◦ @i(f) for i = 0; 1. Graph isomorphism has bijective object and morphism parts. Poset (X; ≤): set X with reflexive, antisymmetric, transitive order ≤ Hasse diagram of poset (X; ≤): x ! y if y covers x, i.e., x 6= y and [x; y] = fx; yg, so x ≤ z ≤ y ) z = x or z = y. Hasse diagram of (N; ≤) is 0 / 1 / 2 / 3 / ::: Hasse diagram of (f1; 2; 3; 6g; j ) is 3 / 6 O O 1 / 2 1 2 2. Categories Category: Quiver C = (C0;C1;@0 : C1 ! C0;@1 : C1 ! C0) with: • composition: 8 x; y; z 2 C0 ; C(x; y) × C(y; z) ! C(x; z); (f; g) 7! g ◦ f • satisfying associativity: 8 x; y; z; t 2 C0 ; 8 (f; g; h) 2 C(x; y) × C(y; z) × C(z; t) ; h ◦ (g ◦ f) = (h ◦ g) ◦ f y iS qq <SSSS g qq << SSS f qqq h◦g < SSSS qq << SSS qq g◦f < SSS xqq << SS z Vo VV < x VVVV << VVVV < VVVV << h VVVV < h◦(g◦f)=(h◦g)◦f VVVV < VVV+ t • identities: 8 x; y; z 2 C0 ; 9 1y 2 C(y; y) : 8 f 2 C(x; y) ; 1y ◦ f = f and 8 g 2 C(y; z) ; g ◦ 1y = g f y o x MM MM 1y g MM MMM f MMM M& zo g y Example: N0 = fxg ; N1 = N ; 1x = 0 ; 8 m; n 2 N ; n◦m = m+n ; | one object, lots of arrows [monoid of natural numbers under addition] 4 x / x Equation: 3 + 5 = 4 + 4 Commuting diagram: 3 4 x / x 5 ( 1 if m ≤ n; Example: N1 = N ; 8 m; n 2 N ; jN(m; n)j = 0 otherwise | lots of objects, lots of arrows [poset (N; ≤) as a category] These two examples are small categories: have a set of morphisms. Example: The category Set has the class of all sets as its object class, with Set(X; Y ) as the set of all functions from X to Y , composition of functions: g ◦ f(x) = g f(x) , usual identities 1X : X ! X; x 7! x. This example is large (not small), but locally small: just a set of arrows between each pair of objects. 3 3. Special morphisms and objects Consider morphism f : x ! y. 0 0 0 • Isom. or invertible: 9 f : y ! x : f ◦f = 1y and f ◦f = 1x. Ex: Bijective function in Set. • Monomorphism: 8 gi : z ! x ; f ◦ g1 = f ◦ g2 ) g1 = g2. Ex: Injective function in Set. • Epimorphism: 8 gi : y ! z ; g1 ◦ f = g2 ◦ f ) g1 = g2. Ex: Surjective function in Set. • Retract or split epimorphism: r : y ! x with r ◦ f = 1x. Ex: r : n 7! maxf0; n − 1g retracts successor function on N. • Section or split monomorphism: s: y ! x with f ◦ s = 1y. Ex: Successor function on N is a section of r : N ! N. • Idempotent: x = @0f = @1f and f ◦ f = f. 2 2 Ex: R ! R ;(x1; x2) 7! (x1; 0) in Set. r ( Lemma. For x h y with r ◦ s = 1y: s • r is an epimorphism. • s is a monomorphism. • s ◦ r is an idempotent (said to split). Isomorphic objects x ∼= y: Have isomorphism f : x ! y. Terminal object > for C has 8 x 2 C0 ; jC(x; >)j = 1. Examples: f0g in Set, upper bound in a poset, . Initial object ? for C has 8 x 2 C0 ; jC(?; x)j = 1. Examples: Ø in Set, lower bound in a poset, Z in Ring,... Zero object 0 for C is both initial and terminal. Examples: f0g in categories of groups, vector spaces, . Groupoid: Category where all morphisms are invertible. Examples: For a set X: • Discrete category (X; f1x j x 2 Xg;@0 : 1x 7! x; @1 : 1x 7! x). • Symmetric group X! of all bijections X ! X. • The collection Inv X of all bijections between subsets of X. 4 4. Functors Functor: A graph homomorphism F : D ! C, thus with restrictions (4.1) 8 x; y 2 D0 ;F1 : D(x; y) ! C(F0x; F0y): f 7! F1f ; respecting identities, compositions: F11x = 1F0x, F1(g ◦ f) = F1g ◦ F1f. ( Isomorphism: F0 and F1 are isomorphisms. Global conditions: ∼ Essentially surjective: 8 c 2 C0 ; 9 d 2 D0 : c = F0d ( Full: Each restriction (4.1) is surjective. Local conditions: Faithful: Each restriction (4.1) is injective. Example: While the forgetful or underlying set functor −1 −1 U : Grp ! Set;[f :(G1; ·; ; 1) ! (G2; ·; ; 1)] 7! [f : G1 ! G2] is faithful, U0 : Grp0 ! Set0 is not injective (same set, different groups). Also U not full: Some functions between groups are not homomorphic. ∗ Example: For a monoid (M; ·; 1M ), write M for the group of invertible elements or units. Then Mon ! Grp; ∗ −1 ∗ −1 [f :(M ; ·; 1) ! (M ; ·; 1)] 7! [fj ∗ :(M ; ·; ; 1) ! (M ; ·; ; 1)] 1 2 M1 1 2 is a functor between large categories, the group of units functor. Moral: Mathematical constructions are functors! Example: A monoid homomorphism f : M1 ! M2 yields a functor between the corresponding small one-object categories. Note (R; ·; 1) ! ([0; 1[; ·; 1); n 7! n2 is full, but not faithful. Example: A functor F :(P1; ≤) ! (P2; ≤) between poset catgeories corresponds to an order-preserving function: x ≤ y in P1 ) F0x ≤ F0y in P2 : Trivially faithful. Example: Inclusion of a subcategory always gives a faithful functor. Full subcategory: The inclusion functor is full. Example: Category FinSet of finite sets is full in Set. Example: Functor (N; ≤) ! FinSet;[n < n+1] 7! [f0; 1; : : : ; n−1g ,! f0; 1; : : : ; n−1; ng] is essentially surjective. 5 5. Natural transformations Given graph maps F; G: D ! C from a graph D to a category C, a natural transformation τ : F ! G is a \vector" (τx j x 2 D0) of components τx : F x ! Gx in C1 such that, for all f : x ! y in D1, the rectangle of the naturality diagram τx x F x / Gx f F f Gf y F y / Gy τy . in D . in C commutes in the category C. Natural isomorphism: Each component τx is an isomorphism in C. Example: For a set A, have a functor LA : Set ! Set;[f : X ! Y ] 7! [A × X ! A × Y ;(a; x) 7! (a; fx)]. Then a function α: A ! B gives a natural transformation α A B α L : L ! L with components LX : A×X ! B ×X;(a; x) 7! (α a; x) and naturality diagram α LX X (a; x) / (α a; x) _ _ f LAf LB f Y (a; fx) α / (α a; fx) LY Example: Category L of (linear transformations between) real vector spaces. Dual space V ∗ = L(V; R) of linear functionals on vector space V . Double dual V ∗∗ = L(V ∗; R) = L(L(V; R); R). Identity functor I : L!L. Double dual functor DD : L!L; V 7! V ∗∗. Natural transformation τ : I ! DD with \evaluation" components ∗∗ τV : V ! V ; v 7! [θ 7! θ(v)]. Gives a natural isomorphism in finite dimensions. Contrast: Given basis fe1; : : : eng of V , define ebi : V ! R; ej 7! δij. ∗ Then V ! V ; ei 7! ebi does not set up a natural isomorphism. 6 6. Duality and contravariant functors Dual or opposite Cop of a category C is built on the dual graph Cop: Same identity morphisms, but composition as shown: f f y o x y / x x O w; xx ww xx ww xx ww g xx g ww xxg◦f ww g◦f or gf xx ww xx ww xx ww z |x In C z w In Cop For Eulerian notation in C, algebraic notation would be natural in Cop. Example: The dual of a one-object monoid category (M; ·; 1M ) is the one-object monoid category of the monoid (M; ◦; 1M ) with x◦y = y ·x. Example: For a set X, the dual of the poset category of P(X); ⊆ is the poset category of P(X); ⊇ . Contravariant functor F : D ! C is a (\covariant" or usual) functor F : D ! Cop or F : Dop ! C. Thus F (1x) = 1F x as usual, but F (g ◦ f) = F f ◦ F g. Generic examples: Locally small C, e.g., Set or lin. trans. cat. L. Fix a dualizing object T 2 C0, e.g., 2 = f0; 1g 2 Set0 or R 2 L0. Functor ∗: C ! Setop; Z 7! Z∗ := C(Z; T ) with (g ◦ f)∗ = f ∗ ◦ g∗: Y o X f f ∗ θ ◦ g θ ◦ g / θ ◦ g ◦ f O O = zz zz zz zz g g∗ T g∗ zz E zz(g◦f)∗ zz zz zz _ _ :zz θ θ z Z From Set, set Z∗ is the power set 2Z of characteristic functions θ. From L, vector space Z∗ is the dual space of linear functionals θ. 7 7. Diagram categories and functor categories Diagram category CD for diagram D and category C has graph maps F; G: D ! C as objects and natural transformations σ : F ! G as morphisms.
Load more

Recommended publications
  • An Exercise on Source and Sink Mutations of Acyclic Quivers∗
    An exercise on source and sink mutations of acyclic quivers∗ Darij Grinberg November 27, 2018 In this note, we will use the following notations (which come from Lampe’s notes [Lampe, §2.1.1]): • A quiver means a tuple Q = (Q0, Q1, s, t), where Q0 and Q1 are two finite sets and where s and t are two maps from Q1 to Q0. We call the elements of Q0 the vertices of the quiver Q, and we call the elements of Q1 the arrows of the quiver Q. For every e 2 Q1, we call s (e) the starting point of e (and we say that e starts at s (e)), and we call t (e) the terminal point of e (and we say that e ends at t (e)). Furthermore, if e 2 Q1, then we say that e is an arrow from s (e) to t (e). So the notion of a quiver is one of many different versions of the notion of a finite directed graph. (Notice that it is a version which allows multiple arrows, and which distinguishes between them – i.e., the quiver stores not just the information of how many arrows there are from a vertex to another, but it actually has them all as distinguishable objects in Q1. Lampe himself seems to later tacitly switch to a different notion of quivers, where edges from a given to vertex to another are indistinguishable and only exist as a number. This does not matter for the next exercise, which works just as well with either notion of a quiver; but I just wanted to have it mentioned.) • The underlying undirected graph of a quiver Q = (Q0, Q1, s, t) is defined as the undirected multigraph with vertex set Q0 and edge multiset ffs (e) , t (e)g j e 2 Q1gmultiset .
    [Show full text]
  • An Introduction to Category Theory and Categorical Logic
    An Introduction to Category Theory and Categorical Logic Wolfgang Jeltsch Category theory An Introduction to Category Theory basics Products, coproducts, and and Categorical Logic exponentials Categorical logic Functors and Wolfgang Jeltsch natural transformations Monoidal TTU¨ K¨uberneetika Instituut categories and monoidal functors Monads and Teooriaseminar comonads April 19 and 26, 2012 References An Introduction to Category Theory and Categorical Logic Category theory basics Wolfgang Jeltsch Category theory Products, coproducts, and exponentials basics Products, coproducts, and Categorical logic exponentials Categorical logic Functors and Functors and natural transformations natural transformations Monoidal categories and Monoidal categories and monoidal functors monoidal functors Monads and comonads Monads and comonads References References An Introduction to Category Theory and Categorical Logic Category theory basics Wolfgang Jeltsch Category theory Products, coproducts, and exponentials basics Products, coproducts, and Categorical logic exponentials Categorical logic Functors and Functors and natural transformations natural transformations Monoidal categories and Monoidal categories and monoidal functors monoidal functors Monads and Monads and comonads comonads References References An Introduction to From set theory to universal algebra Category Theory and Categorical Logic Wolfgang Jeltsch I classical set theory (for example, Zermelo{Fraenkel): I sets Category theory basics I functions from sets to sets Products, I composition
    [Show full text]
  • Graph Theory
    1 Graph Theory “Begin at the beginning,” the King said, gravely, “and go on till you come to the end; then stop.” — Lewis Carroll, Alice in Wonderland The Pregolya River passes through a city once known as K¨onigsberg. In the 1700s seven bridges were situated across this river in a manner similar to what you see in Figure 1.1. The city’s residents enjoyed strolling on these bridges, but, as hard as they tried, no residentof the city was ever able to walk a route that crossed each of these bridges exactly once. The Swiss mathematician Leonhard Euler learned of this frustrating phenomenon, and in 1736 he wrote an article [98] about it. His work on the “K¨onigsberg Bridge Problem” is considered by many to be the beginning of the field of graph theory. FIGURE 1.1. The bridges in K¨onigsberg. J.M. Harris et al., Combinatorics and Graph Theory , DOI: 10.1007/978-0-387-79711-3 1, °c Springer Science+Business Media, LLC 2008 2 1. Graph Theory At first, the usefulness of Euler’s ideas and of “graph theory” itself was found only in solving puzzles and in analyzing games and other recreations. In the mid 1800s, however, people began to realize that graphs could be used to model many things that were of interest in society. For instance, the “Four Color Map Conjec- ture,” introduced by DeMorgan in 1852, was a famous problem that was seem- ingly unrelated to graph theory. The conjecture stated that four is the maximum number of colors required to color any map where bordering regions are colored differently.
    [Show full text]
  • An Application of Graph Theory in Markov Chains Reliability Analysis
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by DSpace at VSB Technical University of Ostrava STATISTICS VOLUME: 12 j NUMBER: 2 j 2014 j JUNE An Application of Graph Theory in Markov Chains Reliability Analysis Pavel SKALNY Department of Applied Mathematics, Faculty of Electrical Engineering and Computer Science, VSB–Technical University of Ostrava, 17. listopadu 15/2172, 708 33 Ostrava-Poruba, Czech Republic [email protected] Abstract. The paper presents reliability analysis which the production will be equal or greater than the indus- was realized for an industrial company. The aim of the trial partner demand. To deal with the task a Monte paper is to present the usage of discrete time Markov Carlo simulation of Discrete time Markov chains was chains and the flow in network approach. Discrete used. Markov chains a well-known method of stochastic mod- The goal of this paper is to present the Discrete time elling describes the issue. The method is suitable for Markov chain analysis realized on the system, which is many systems occurring in practice where we can easily not distributed in parallel. Since the analysed process distinguish various amount of states. Markov chains is more complicated the graph theory approach seems are used to describe transitions between the states of to be an appropriate tool. the process. The industrial process is described as a graph network. The maximal flow in the network cor- Graph theory has previously been applied to relia- responds to the production. The Ford-Fulkerson algo- bility, but for different purposes than we intend.
    [Show full text]
  • Kleisli Database Instances
    KLEISLI DATABASE INSTANCES DAVID I. SPIVAK Abstract. We use monads to relax the atomicity requirement for data in a database. Depending on the choice of monad, the database fields may contain generalized values such as lists or sets of values, or they may contain excep- tions such as various typesi of nulls. The return operation for monads ensures that any ordinary database instance will count as one of these generalized in- stances, and the bind operation ensures that generalized values behave well under joins of foreign key sequences. Different monads allow for vastly differ- ent types of information to be stored in the database. For example, we show that classical concepts like Markov chains, graphs, and finite state automata are each perfectly captured by a different monad on the same schema. Contents 1. Introduction1 2. Background3 3. Kleisli instances9 4. Examples 12 5. Transformations 20 6. Future work 22 References 22 1. Introduction Monads are category-theoretic constructs with wide-ranging applications in both mathematics and computer science. In [Mog], Moggi showed how to exploit their expressive capacity to incorporate fundamental programming concepts into purely functional languages, thus considerably extending the potency of the functional paradigm. Using monads, concepts that had been elusive to functional program- ming, such as state, input/output, and concurrency, were suddenly made available in that context. In the present paper we describe a parallel use of monads in databases. This approach stems from a similarity between categories and database schemas, as presented in [Sp1]. The rough idea is as follows. A database schema can be modeled as a category C, and an ordinary database instance is a functor δ : C Ñ Set.
    [Show full text]
  • Higher-Dimensional Instantons on Cones Over Sasaki-Einstein Spaces and Coulomb Branches for 3-Dimensional N = 4 Gauge Theories
    Two aspects of gauge theories higher-dimensional instantons on cones over Sasaki-Einstein spaces and Coulomb branches for 3-dimensional N = 4 gauge theories Von der Fakultät für Mathematik und Physik der Gottfried Wilhelm Leibniz Universität Hannover zur Erlangung des Grades Doktor der Naturwissenschaften – Dr. rer. nat. – genehmigte Dissertation von Dipl.-Phys. Marcus Sperling, geboren am 11. 10. 1987 in Wismar 2016 Eingereicht am 23.05.2016 Referent: Prof. Olaf Lechtenfeld Korreferent: Prof. Roger Bielawski Korreferent: Prof. Amihay Hanany Tag der Promotion: 19.07.2016 ii Abstract Solitons and instantons are crucial in modern field theory, which includes high energy physics and string theory, but also condensed matter physics and optics. This thesis is concerned with two appearances of solitonic objects: higher-dimensional instantons arising as supersymme- try condition in heterotic (flux-)compactifications, and monopole operators that describe the Coulomb branch of gauge theories in 2+1 dimensions with 8 supercharges. In PartI we analyse the generalised instanton equations on conical extensions of Sasaki- Einstein manifolds. Due to a certain equivariant ansatz, the instanton equations are reduced to a set of coupled, non-linear, ordinary first order differential equations for matrix-valued functions. For the metric Calabi-Yau cone, the instanton equations are the Hermitian Yang-Mills equations and we exploit their geometric structure to gain insights in the structure of the matrix equations. The presented analysis relies strongly on methods used in the context of Nahm equations. For non-Kähler conical extensions, focusing on the string theoretically interesting 6-dimensional case, we first of all construct the relevant SU(3)-structures on the conical extensions and subsequently derive the corresponding matrix equations.
    [Show full text]
  • Quiver Indices and Abelianization from Jeffrey-Kirwan Residues Arxiv
    Prepared for submission to JHEP arXiv:1907.01354v2 Quiver indices and Abelianization from Jeffrey-Kirwan residues Guillaume Beaujard,1 Swapnamay Mondal,2 Boris Pioline1 1 Laboratoire de Physique Th´eoriqueet Hautes Energies (LPTHE), UMR 7589 CNRS-Sorbonne Universit´e,Campus Pierre et Marie Curie, 4 place Jussieu, F-75005 Paris, France 2 International Centre for Theoretical Sciences, Tata Institute of Fundamental Research, Shivakote, Hesaraghatta, Bangalore 560089, India e-mail: fpioline,[email protected], [email protected] Abstract: In quiver quantum mechanics with 4 supercharges, supersymmetric ground states are known to be in one-to-one correspondence with Dolbeault cohomology classes on the moduli space of stable quiver representations. Using supersymmetric localization, the refined Witten index can be expressed as a residue integral with a specific contour prescription, originally due to Jeffrey and Kirwan, depending on the stability parameters. On the other hand, the physical picture of quiver quantum mechanics describing interactions of BPS black holes predicts that the refined Witten index of a non-Abelian quiver can be expressed as a sum of indices for Abelian quivers, weighted by `single-centered invariants'. In the case of quivers without oriented loops, we show that this decomposition naturally arises from the residue formula, as a consequence of applying the Cauchy-Bose identity to the vector multiplet contributions. For quivers with loops, the same procedure produces a natural decomposition of the single-centered invariants, which remains to be elucidated. In the process, we clarify some under-appreciated aspects of the localization formula. Part of the results reported herein have been obtained by implementing the Jeffrey-Kirwan residue formula in a public arXiv:1907.01354v2 [hep-th] 15 Oct 2019 Mathematica code.
    [Show full text]
  • Graph Algorithms in Bioinformatics an Introduction to Bioinformatics Algorithms Outline
    An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Graph Algorithms in Bioinformatics An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Outline 1. Introduction to Graph Theory 2. The Hamiltonian & Eulerian Cycle Problems 3. Basic Biological Applications of Graph Theory 4. DNA Sequencing 5. Shortest Superstring & Traveling Salesman Problems 6. Sequencing by Hybridization 7. Fragment Assembly & Repeats in DNA 8. Fragment Assembly Algorithms An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Section 1: Introduction to Graph Theory An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Knight Tours • Knight Tour Problem: Given an 8 x 8 chessboard, is it possible to find a path for a knight that visits every square exactly once and returns to its starting square? • Note: In chess, a knight may move only by jumping two spaces in one direction, followed by a jump one space in a perpendicular direction. http://www.chess-poster.com/english/laws_of_chess.htm An Introduction to Bioinformatics Algorithms www.bioalgorithms.info 9th Century: Knight Tours Discovered An Introduction to Bioinformatics Algorithms www.bioalgorithms.info 18th Century: N x N Knight Tour Problem • 1759: Berlin Academy of Sciences proposes a 4000 francs prize for the solution of the more general problem of finding a knight tour on an N x N chessboard. • 1766: The problem is solved by Leonhard Euler (pronounced “Oiler”). • The prize was never awarded since Euler was Director of Mathematics at Berlin Academy and was deemed ineligible. Leonhard Euler http://commons.wikimedia.org/wiki/File:Leonhard_Euler_by_Handmann.png An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Introduction to Graph Theory • A graph is a collection (V, E) of two sets: • V is simply a set of objects, which we call the vertices of G.
    [Show full text]
  • Graph Theory Approach to the Vulnerability of Transportation Networks
    algorithms Article Graph Theory Approach to the Vulnerability of Transportation Networks Sambor Guze Department of Mathematics, Gdynia Maritime University, 81-225 Gdynia, Poland; [email protected]; Tel.: +48-608-034-109 Received: 24 November 2019; Accepted: 10 December 2019; Published: 12 December 2019 Abstract: Nowadays, transport is the basis for the functioning of national, continental, and global economies. Thus, many governments recognize it as a critical element in ensuring the daily existence of societies in their countries. Those responsible for the proper operation of the transport sector must have the right tools to model, analyze, and optimize its elements. One of the most critical problems is the need to prevent bottlenecks in transport networks. Thus, the main aim of the article was to define the parameters characterizing the transportation network vulnerability and select algorithms to support their search. The parameters proposed are based on characteristics related to domination in graph theory. The domination, edge-domination concepts, and related topics, such as bondage-connected and weighted bondage-connected numbers, were applied as the tools for searching and identifying the bottlenecks in transportation networks. Furthermore, the algorithms for finding the minimal dominating set and minimal (maximal) weighted dominating sets are proposed. This way, the exemplary academic transportation network was analyzed in two cases: stationary and dynamic. Some conclusions are presented. The main one is the fact that the methods given in this article are universal and applicable to both small and large-scale networks. Moreover, the approach can support the dynamic analysis of bottlenecks in transport networks. Keywords: vulnerability; domination; edge-domination; transportation networks; bondage-connected number; weighted bondage-connected number 1.
    [Show full text]
  • Arxiv:2012.08669V1 [Math.CT] 15 Dec 2020 2 Preface
    Sheaf Theory Through Examples (Abridged Version) Daniel Rosiak December 12, 2020 arXiv:2012.08669v1 [math.CT] 15 Dec 2020 2 Preface After circulating an earlier version of this work among colleagues back in 2018, with the initial aim of providing a gentle and example-heavy introduction to sheaves aimed at a less specialized audience than is typical, I was encouraged by the feedback of readers, many of whom found the manuscript (or portions thereof) helpful; this encouragement led me to continue to make various additions and modifications over the years. The project is now under contract with the MIT Press, which would publish it as an open access book in 2021 or early 2022. In the meantime, a number of readers have encouraged me to make available at least a portion of the book through arXiv. The present version represents a little more than two-thirds of what the professionally edited and published book would contain: the fifth chapter and a concluding chapter are missing from this version. The fifth chapter is dedicated to toposes, a number of more involved applications of sheaves (including to the \n- queens problem" in chess, Schreier graphs for self-similar groups, cellular automata, and more), and discussion of constructions and examples from cohesive toposes. Feedback or comments on the present work can be directed to the author's personal email, and would of course be appreciated. 3 4 Contents Introduction 7 0.1 An Invitation . .7 0.2 A First Pass at the Idea of a Sheaf . 11 0.3 Outline of Contents . 20 1 Categorical Fundamentals for Sheaves 23 1.1 Categorical Preliminaries .
    [Show full text]
  • Graph Theory: Network Flow
    University of Washington Math 336 Term Paper Graph Theory: Network Flow Author: Adviser: Elliott Brossard Dr. James Morrow 3 June 2010 Contents 1 Introduction ...................................... 2 2 Terminology ...................................... 2 3 Shortest Path Problem ............................... 3 3.1 Dijkstra’sAlgorithm .............................. 4 3.2 ExampleUsingDijkstra’sAlgorithm . ... 5 3.3 TheCorrectnessofDijkstra’sAlgorithm . ...... 7 3.3.1 Lemma(TriangleInequalityforGraphs) . .... 8 3.3.2 Lemma(Upper-BoundProperty) . 8 3.3.3 Lemma................................... 8 3.3.4 Lemma................................... 9 3.3.5 Lemma(ConvergenceProperty) . 9 3.3.6 Theorem (Correctness of Dijkstra’s Algorithm) . ....... 9 4 Maximum Flow Problem .............................. 10 4.1 Terminology.................................... 10 4.2 StatementoftheMaximumFlowProblem . ... 12 4.3 Ford-FulkersonAlgorithm . .. 12 4.4 Example Using the Ford-Fulkerson Algorithm . ..... 13 4.5 The Correctness of the Ford-Fulkerson Algorithm . ........ 16 4.5.1 Lemma................................... 16 4.5.2 Lemma................................... 16 4.5.3 Lemma................................... 17 4.5.4 Lemma................................... 18 4.5.5 Lemma................................... 18 4.5.6 Lemma................................... 18 4.5.7 Theorem(Max-FlowMin-CutTheorem) . 18 5 Conclusion ....................................... 19 1 1 Introduction An important study in the field of computer science is the analysis of networks. Internet service providers (ISPs), cell-phone companies, search engines, e-commerce sites, and a va- riety of other businesses receive, process, store, and transmit gigabytes, terabytes, or even petabytes of data each day. When a user initiates a connection to one of these services, he sends data across a wired or wireless network to a router, modem, server, cell tower, or perhaps some other device that in turn forwards the information to another router, modem, etc. and so forth until it reaches its destination.
    [Show full text]
  • Combinatorics and Graph Theory I (Math 688)
    Combinatorics and Graph Theory I (Math 688). Problems and Solutions. May 17, 2006 PREFACE Most of the problems in this document are the problems suggested as home- work in a graduate course Combinatorics and Graph Theory I (Math 688) taught by me at the University of Delaware in Fall, 2000. Later I added several more problems and solutions. Most of the solutions were prepared by me, but some are based on the ones given by students from the class, and from subsequent classes. I tried to acknowledge all those, and I apologize in advance if I missed someone. The course focused on Enumeration and Matching Theory. Many problems related to enumeration are taken from a 1984-85 course given by Herbert S. Wilf at the University of Pennsylvania. I would like to thank all students who took the course. Their friendly criti- cism and questions motivated some of the problems. I am especially thankful to Frank Fiedler and David Kravitz. To Frank – for sharing with me LaTeX files of his solutions and allowing me to use them. I did it several times. To David – for the technical help with the preparation of this version. Hopefully all solutions included in this document are correct, but the whole set is by no means polished. I will appreciate all comments. Please send them to [email protected]. – Felix Lazebnik 1 Problem 1. In how many 4–digit numbers abcd (a, b, c, d are the digits, a 6= 0) (i) a < b < c < d? (ii) a > b > c > d? Solution. (i) Notice that there exists a bijection between the set of our numbers and the set of all 4–subsets of the set {1, 2,..., 9}.
    [Show full text]