skip to main content
Skip header Section
Category Theory for the SciencesOctober 2014
Publisher:
  • The MIT Press
ISBN:978-0-262-02813-4
Published:10 October 2014
Pages:
304
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

Category theory was invented in the 1940s to unify and synthesize different areas in mathematics, and it has proven remarkably successful in enabling powerful communication between disparate fields and subfields within mathematics. This book shows that category theory can be useful outside of mathematics as a rigorous, flexible, and coherent modeling language throughout the sciences. Information is inherently dynamic; the same ideas can be organized and reorganized in countless ways, and the ability to translate between such organizational structures is becoming increasingly important in the sciences. Category theory offers a unifying framework for information modeling that can facilitate the translation of knowledge between disciplines. Written in an engaging and straightforward style, and assuming little background in mathematics, the book is rigorous but accessible to non-mathematicians. Using databases as an entry to category theory, it begins with sets and functions, then introduces the reader to notions that are fundamental in mathematics: monoids, groups, orders, and graphs -- categories in disguise. After explaining the "big three" concepts of category theory -- categories, functors, and natural transformations -- the book covers other topics, including limits, colimits, functor categories, sheaves, monads, and operads. The book explains category theory by examples and exercises rather than focusing on theorems and proofs. It includes more than 300 exercises, with selected solutions. Category Theory for the Sciences is intended to create a bridge between the vast array of mathematical concepts used by mathematicians and the models and frameworks of such scientific disciplines as computation, neuroscience, and physics.

Cited By

  1. Zennaro F, Turrini P and Damoulas T Quantifying consistency and information loss for causal abstraction learning Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (5750-5757)
  2. Christiansen S and Hu K (2023). Finite Element Systems for Vector Bundles: Elasticity and Curvature, Foundations of Computational Mathematics, 23:2, (545-596), Online publication date: 1-Apr-2023.
  3. Ohmori K (2021). Formalization of Kublai Khan’s globalization using Kunii’s incrementally modular abstraction hierarchy, The Visual Computer: International Journal of Computer Graphics, 37:12, (2989-2997), Online publication date: 1-Dec-2021.
  4. Uotila V, Lu J, Gawlick D, Liu Z, Das S and Pogossiants G (2021). MultiCategory, Proceedings of the VLDB Endowment, 14:12, (2663-2666), Online publication date: 1-Jul-2021.
  5. Gillet A, Leclercq É and Cullot N Lambda+, the Renewal of the Lambda Architecture: Category Theory to the Rescue Advanced Information Systems Engineering, (381-396)
  6. Motara Y High-Level Modelling for Typed Functional Programming Trends in Functional Programming, (69-94)
  7. Jobczyk K and Gaiczyński P The natural transformations with fuzzified commutativity 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), (1-6)
  8. Caterina G and Gangle R A New Syntax for Diagrammatic Logic: A Generic Figures Approach Numerical Computations: Theory and Algorithms, (43-58)
  9. Xue G, Liu J, Wu L and Yao S (2018). A graph based technique of process partitioning, Journal of Web Engineering, 17:1-2, (121-140), Online publication date: 1-Mar-2018.
  10. Ernadote D Ontology-based pattern for system engineering Proceedings of the ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems, (248-258)
  11. Robinson M (2017). Sheaves are the canonical data structure for sensor integration, Information Fusion, 36:C, (208-224), Online publication date: 1-Jul-2017.
  12. ACM
    AbdelGawad M Towards a Java Subtyping Operad Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs, (1-6)
  13. ACM
    Al-Fedaghi S Sets with members as machines with things that flow Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing, (1-10)
  14. Harris D (2016). Foundations of reusable and interoperable facet models using category theory, Information Systems Frontiers, 18:5, (953-965), Online publication date: 1-Oct-2016.
  15. ACM
    Gawlick D, Chan E, Ghoneimy A and Liu Z (2015). Mastering Situation Awareness, ACM SIGMOD Record, 44:3, (19-24), Online publication date: 3-Dec-2015.
  16. ACM
    Harris D Modeling Faceted Browsing with Category Theory to Support Interoperability and Reuse Proceedings of the 15th ACM/IEEE-CS Joint Conference on Digital Libraries, (275-276)
  17. Kewley R and McDonnell J Distributed reactive simulation Proceedings of the 2014 Annual Simulation Symposium, (1-5)
  18. Harris D Modeling Integration and Reuse of Heterogeneous Terminologies in Faceted Browsing Systems 2016 IEEE 17th International Conference on Information Reuse and Integration (IRI), (58-66)
Contributors
  • Massachusetts Institute of Technology

Recommendations

Van Van Dyke Parunak

One can erect a system of mathematics on various foundations. Euclid provided the first known formal system, based on geometric notions such as points in a space, straight lines, and distance. Classical probability theory is grounded in the idea of sets, set membership, and operations between sets such as union and intersection. Category theory offers yet another foundation, based on the idea of morphisms, that is, mappings among objects. Category theory is a relative newcomer, invented in the 1940s to help explain the common features among structures in different branches of mathematics. Since a mathematical theory is itself an abstraction, discussions of the relations among such theories are even more abstract, leading some of the originators of the formalism to describe it fondly as “general abstract nonsense.” Apart from tentative applications in physics (in representing Feynman diagrams) and computer science (to provide a formal definition of types), in both cases dealing with highly theoretical problems, the theory has not yet attracted a following beyond the circle of pure mathematicians. Spivak's book promises to change this state of affairs in two ways. First, it abounds in concrete examples and informal explanations (offering not only definitions, propositions, and theorems, but also examples, slogans(!), and numerous exercises, all worked out in detail). It often presents the same concept several times, first with concrete examples and then more abstractly. As a result, even readers with little exposure to abstract mathematics can follow it with a little application. Second, it motivates the theory by the running example of “ologs,” or “otology logs,” a knowledge representation formalism that maps readily to category theory on the one hand and to databases on the other. This example is broadly applicable in any scientific domain, addressing common problems such as analyzing the relation between theory and experimental data, schema alignment, and ontology mapping. Ordinary engineers must grapple with such problems every day, and category theory offers powerful tools to help them. This combination of pedagogical accessibility and a hook to realistic, common problems results in a volume that will appeal both to budding mathematicians who seek an easy introduction to the theory, and to anyone who must deal with structured information in the real world. The first four chapters introduce the reader to the history of category theory, and some of the basic concepts, using the category of sets for formal exposition and the olog as a running example. After introducing the reader to products, coproducts, and the associated (co)limits, it works through a series of mathematical structures, including monoids, groups, graphs, and orders, culminating in a category-theoretical exposition of the notion of a database. The title of chapter 4 captures the spirit of these chapters: “Categories and Functors, Without Admitting It.” With this tutorial foundation in place, chapters 5 and 6 go back over the same ground, but with more rigor. Now Spivak not only admits to categories, functors, and natural transformations, but defines them formally, with links back to the more intuitive explanations in the first four chapters. The culmination of chapter 5 is the proof that categories and schemata are equivalent, thus urging anybody who is designing a database schema to leverage category theory in the process. Chapter 6 formalizes other notions introduced in the first four chapters, such as limits and colimits, and chapter 7 introduces higher-level topics including adjoint functors, monads, and operads. By this time, the reader is not only comfortable enough to move on to the more formal literature in category theory, but also motivated by an understanding of how the theory can impact practical issues in managing structured information. The volume is intended to be read sequentially. The index is quite sparse, hinting that this is a textbook, not a reference work. Those who take the time to work through the exercises will come away with a clear intuition into the power of category theory and strong motivation to apply it to their own applications. More reviews about this item: Amazon Online Computing Reviews Service

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.