scispace - formally typeset
Open AccessBook

Categories for the Working Mathematician

TLDR
In this article, the authors present a table of abstractions for categories, including Axioms for Categories, Functors, Natural Transformations, and Adjoints for Preorders.
Abstract
I. Categories, Functors and Natural Transformations.- 1. Axioms for Categories.- 2. Categories.- 3. Functors.- 4. Natural Transformations.- 5. Monics, Epis, and Zeros.- 6. Foundations.- 7. Large Categories.- 8. Hom-sets.- II. Constructions on Categories.- 1. Duality.- 2. Contravariance and Opposites.- 3. Products of Categories.- 4. Functor Categories.- 5. The Category of All Categories.- 6. Comma Categories.- 7. Graphs and Free Categories.- 8. Quotient Categories.- III. Universals and Limits.- 1. Universal Arrows.- 2. The Yoneda Lemma.- 3. Coproducts and Colimits.- 4. Products and Limits.- 5. Categories with Finite Products.- 6. Groups in Categories.- IV. Adjoints.- 1. Adjunctions.- 2. Examples of Adjoints.- 3. Reflective Subcategories.- 4. Equivalence of Categories.- 5. Adjoints for Preorders.- 6. Cartesian Closed Categories.- 7. Transformations of Adjoints.- 8. Composition of Adjoints.- V. Limits.- 1. Creation of Limits.- 2. Limits by Products and Equalizers.- 3. Limits with Parameters.- 4. Preservation of Limits.- 5. Adjoints on Limits.- 6. Freyd's Adjoint Functor Theorem.- 7. Subobjects and Generators.- 8. The Special Adjoint Functor Theorem.- 9. Adjoints in Topology.- VI. Monads and Algebras.- 1. Monads in a Category.- 2. Algebras for a Monad.- 3. The Comparison with Algebras.- 4. Words and Free Semigroups.- 5. Free Algebras for a Monad.- 6. Split Coequalizers.- 7. Beck's Theorem.- 8. Algebras are T-algebras.- 9. Compact Hausdorff Spaces.- VII. Monoids.- 1. Monoidal Categories.- 2. Coherence.- 3. Monoids.- 4. Actions.- 5. The Simplicial Category.- 6. Monads and Homology.- 7. Closed Categories.- 8. Compactly Generated Spaces.- 9. Loops and Suspensions.- VIII. Abelian Categories.- 1. Kernels and Cokernels.- 2. Additive Categories.- 3. Abelian Categories.- 4. Diagram Lemmas.- IX. Special Limits.- 1. Filtered Limits.- 2. Interchange of Limits.- 3. Final Functors.- 4. Diagonal Naturality.- 5. Ends.- 6. Coends.- 7. Ends with Parameters.- 8. Iterated Ends and Limits.- X. Kan Extensions.- 1. Adjoints and Limits.- 2. Weak Universality.- 3. The Kan Extension.- 4. Kan Extensions as Coends.- 5. Pointwise Kan Extensions.- 6. Density.- 7. All Concepts are Kan Extensions.- Table of Terminology.

read more

Citations
More filters
Book ChapterDOI

From Graph Grammars to High Level Replacement Systems

TL;DR: The algebraic approach to graph grammars is extended to include several new types of replacement systems, especially the replacement of algebraic specifications which were recently introduced for a rule-based approach to modular system design.
Journal ArticleDOI

An algebraic theory of normal forms

TL;DR: A general theory of normal forms is presented, based on a categorial result (Dubuc, 1974) for the free monoid construction, mainly for proposictional modal logic, although it seems to have a wider range of applications.
Book

Tensor Categories and Endomorphisms of von Neumann Algebras: with Applications to Quantum Field Theory

TL;DR: In this article, the authors propose a model for algebraic quantum field theory with hard boundaries and transparent boundaries, and apply it to algebraic QFT, including the Braided Product of Two Full Centres of two full centres.
Proceedings ArticleDOI

Kindergarten Quantum Mechanics: Lecture Notes

TL;DR: The picture calculus as discussed by the authors is an extension of Dirac's notation, and has a purely algebraic counterpart in terms of Strongly Compact Closed Categories (SCCC) which subsumes my Logic of Entanglement.
Journal ArticleDOI

Parallelism detection and transformation techniques useful for VLSI algorithms

TL;DR: An algorithm model is introduced in which the time/space characteristics of an algorithm are implicitly represented by a set of data dependencies and the concepts of execution ordering, syntactical algorithm equivalence, algorithm transformation, and dependent computations are defined.
Trending Questions (1)
How india is working to improve international trade with neighbors?

The given text does not provide any information about how India is working to improve international trade with its neighbors.