We find that the algebra of exponents comes from the notin of ‘map object,’ and we explore other universal mapping properties including that of ‘truth-value’ objects.

A map of sets is a process for getting from one set to another. We investigate the composition of maps (following one process by a second process), and find that the algebra of composition of maps resembles the algebra of multiplication of numbers, but its interpretation is much richer.

The goal of this book has been to show how the notion of composition of maps leads to the most natural account of the fundamental notions of mathematics, from multiplication, addition, and exponentiation, through the basic notions of logic and of connectivity.

Your further work with mathematics may apply it to physics, computer science or to other fields. In each of these, illuminating guides to the formulation and solution of problems often come from explicit recognition of structures occurring in commutative algebra, functional analysis, algebraic topology, etcetera. Clarifying unification of these branches has been developed during the last 60 years, using the categorical methods that you have begun to learn. To begin to deepen your knowledge of categories, here are four appendices which, although too brief for learning the subjects thoroughly, outline some important connections, in formulations which you will recognize in your subsequent encounters with mathematical topics.

Appendix I A general description of the geometry of figures in a space and the algebra of functions on a space, together with their basic functorial behavior.

Appendix II The description of Adjoint Functors and how they are exemplified in the categories of directed graphs and dynamical systems.

Appendix III A very brief history of the emergence of the theory of categories from within various mathematical subjects.

Appendix IV An annotated bibliography to guide you through elementary texts, monographs, and historical sources.

May you enjoy the fruits of your perseverance.

Connectedness versus discreteness

Besides map spaces and the truth space, another construction that is characterized by a ‘higher universal mapping property’ objectifies the counting of connected components. Reflexive graphs and discrete dynamical systems, though very different categories, support this ‘same’ construction. For example, we say that dots d and d′ in a reflexive graph are connected if for some n ≥ 0 there are

The graph as a whole is connected if it has at least one dot and any two dots in it are connected; it is noteworthy that to prove a given graph to be connected may involve arbitrarily long chains of elementary connections ai, even though the structural operators s, t, i are finite in number (Sessions 13 to 15).

By contrast, this aspect of steps without limit does not arise in the same way for dynamical systems, even though the dynamical systems themselves involve infinitely many structural operators αn, effecting evolution of a system for n units of time. We say that the states x, y are connected if there are n, m such that αnx = αmy, and that the system is connected if it has at least one state and every two states are connected.