Skip to content

Commit 69b2ee5

Browse files
committed
Fix typos
1 parent 8e662c5 commit 69b2ee5

6 files changed

Lines changed: 27 additions & 27 deletions

File tree

book/C0-Preface.tex

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -13,14 +13,14 @@ \chapter{Preface}\label{chapter.0}
1313

1414
Categorical systems theory is an emerging field of mathematics which seeks to apply the methods of category theory to general systems theory. General systems theory is the study of systems --- ways things can be and change, and models thereof --- in full generality. The difficulty is that there doesn't seem to be a single core idea of what it means to be a ``system''. Different people have, for different purposes, come up with a vast array of different modeling techniques and definitions that could be called ``systems''. There is often little the same in the precise content of these definitions, though there are still strong, if informal, analogies to be made accross these different fields. This makes coming up with a mathematical theory of general systems tantalizing but difficult: what, after all, is a system in general?
1515

16-
Category theory has been describe as the mathematics of formal analogy making. It allows us to make analogies between fields by focusing not on content of the objects of those fields, but by the ways that the objects of those fields relate to one another. Categorical systems theory applies this idea to general systems theory, avoiding the issue of not having a contentful definition of system by instead focusing on the ways that systems interact with eachother and their environment.
16+
Category theory has been described as the mathematics of formal analogy making. It allows us to make analogies between fields by focusing not on content of the objects of those fields, but by the ways that the objects of those fields relate to one another. Categorical systems theory applies this idea to general systems theory, avoiding the issue of not having a contentful definition of system by instead focusing on the ways that systems interact with each other and their environment.
1717

1818
These are the main ideas of categorical systems theory:
1919
\begin{enumerate}
2020
\item Any system interacts with its environment through an \emph{interface}, which can be described separately from the system itself.
2121
\item All interactions of a system with its environment take place through its interface, so that from the point of view of the environment, all we need to know about a system is what is going on at the interface.
2222
\item Systems interact with other systems through their respective interfaces. So, to understand complex systems in terms of their component subsystems, we need to understand the ways that interfaces can be connected. We call these ways that interfaces can be connected \emph{composition patterns}.
23-
\item Given a composition pattern describing how some interface are to be connected, and some systems with those interfaces, we should have a \emph{composite} system which consists of those subsystems interacting according to the composition pattern. The ability to form composite systems of interacting component systems is called \emph{modularity}, and is a well known boon in the design of complex systems.
23+
\item Given a composition pattern describing how some interfaces are to be connected, and some systems with those interfaces, we should have a \emph{composite} system which consists of those subsystems interacting according to the composition pattern. The ability to form composite systems of interacting component systems is called \emph{modularity}, and is a well known boon in the design of complex systems.
2424
\end{enumerate}
2525

2626
In a sense, the definitions of categorical systems theory are all about \emph{modularity} --- how can systems be composed of subsystems. On the other hand, the theorems of categorical systems theory often take the form of \emph{compositionality} results. These say that certain facts and features of composite systems can be understood or calculated in terms of their component systems and the composition pattern.
@@ -35,9 +35,9 @@ \chapter{Preface}\label{chapter.0}
3535
\item What does it mean to be a system? Does it have a notion of states, or of behaviors? Or is it a diagram describing the way some primitive parts are organized?
3636
\item What should the interface of a system be?
3737
\item How can interfaces be connected in composition patterns?
38-
\item How are systems composed through composition patterns between their interfaces.
38+
\item How are systems composed through composition patterns between their interfaces?
3939
\item What is a map between systems, and how does it affect their interfaces?
40-
\item When can maps between systems be composed along the same composition patterns as the systems.
40+
\item When can maps between systems be composed along the same composition patterns as the systems?
4141
\end{itemize}
4242
\end{informal}
4343

@@ -91,12 +91,12 @@ \chapter{Preface}\label{chapter.0}
9191
\item Can the kinds of input a
9292
system takes in depend on what it's putting out, and how do they depend on it?
9393
\item What sorts of changes are possible in a given state?
94-
\item What does it mean for states to change.
94+
\item What does it mean for states to change?
9595
\item How should the way the state changes vary with the input?
9696
\end{itemize}
9797
\end{informal}
9898

99-
We will make this definition fully formal in \cref{Chapter.3}, after introducing enough category theory to state it. Once we have made the definition of systems theory formal, we can make the definition of system. But what is interesting about dynamical systems is how they \emph{behave}.
99+
We will make this definition fully formal in \cref{Chapter.3}, after introducing enough category theory to state it. Once we have made the definition of systems theory formal, we can make the definition of system formal. But what is interesting about dynamical systems is how they \emph{behave}.
100100
\begin{informal}\label{inf:behavior}
101101
A \emph{behavior} of a dynamical system is a particular way its states can
102102
change according to its dynamics.
@@ -123,7 +123,7 @@ \chapter{Preface}\label{chapter.0}
123123
it with the first one and then with the second one.
124124
\item Suppose that we have a pair of
125125
wiring patterns and compatible charts between them. If we
126-
take a bunch of behaviors whose charts are compatable according to the first
126+
take a bunch of behaviors whose charts are compatible according to the first
127127
wiring pattern, wire them together, and then compose with a behavior of the
128128
second chart, we get the same thing as if we compose them all with behaviors
129129
of the first chart, noted that they were compatible with the second wiring

book/C1-.tex

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -86,7 +86,7 @@ \section{Introduction}\label{sec.chap1_intro}
8686
\item Can the kinds of input a
8787
system takes in depend on what it's putting out, and how do they depend on it?
8888
\item What sorts of changes are possible in a given state?
89-
\item What does it mean for states to change.
89+
\item What does it mean for states to change?
9090
\item How should the way the state changes vary with the input?
9191
\end{itemize}
9292
\end{informal}
@@ -113,7 +113,7 @@ \section{Introduction}\label{sec.chap1_intro}
113113

114114
The dynamical systems we will see in this book are \emph{open} in the sense that
115115
they take in inputs from their environment and expose outputs back to their
116-
environment. Because of this, our systems can interact with eachother. One
116+
environment. Because of this, our systems can interact with each other. One
117117
system can take what the other system outputs as part of its input, and the
118118
other can take what the first outputs as part of its input. For example, when we
119119
have a conversation, I take what I hear from you and use it to change how I
@@ -387,7 +387,7 @@ \subsection{Deterministic systems}\label{sec.deterministic_system}
387387
\draw[label] node [right=2pt of Outer_out1] {$\Set{DinerState}$};
388388
\end{tikzpicture}
389389
\end{equation}
390-
If we want to, we can peak into the clock with display and see that it is itself
390+
If we want to, we can peek into the clock with display and see that it is itself
391391
made out of a clock wired to a display:
392392
\begin{equation}\label{eqn.diner_system_box}
393393
\begin{tikzpicture}[oriented WD, every fit/.style={inner xsep=\bbx, inner ysep=\bby}, bbx = 1cm, bby =.3cm, bb min width=1cm, bb port length=4pt, bb port sep=1, baseline=(Outer.center)]
@@ -553,7 +553,7 @@ \subsection{Deterministic systems}\label{sec.deterministic_system}
553553
\end{example}
554554

555555
\begin{example}\label{ex.moore_machine}
556-
Not only is the term \emph{Moore machine} is used for the mathematical notion of
556+
Not only is the term \emph{Moore machine} used for the mathematical notion of
557557
deterministic system we've just presented, but it is also used for actual,
558558
real-life circuits which are designed on that principle.
559559

@@ -1471,7 +1471,7 @@ \subsection{Deterministic and differential systems as lenses}
14711471
resulting node. When we wire together systems presented as transition diagrams,
14721472
the dynamics then involve reading the input labels of all inner systems, moving
14731473
along all the arrows with those labels, and then outputing the labels at each
1474-
state, possible into the input of another system.
1474+
state, possibly into the input of another system.
14751475

14761476
\begin{exercise}\label{ex.wiring_transition_diagrams}
14771477
Here are two systems, $\Sys{S_1}$ and $\Sys{S_2}$ presented in terms of
@@ -1986,7 +1986,7 @@ \subsection{Wiring diagrams as lenses in categories of arities}\label{sec:wiring
19861986
Wiring diagrams are designed to
19871987
express the flow of variables through the system; how they are to be copied from
19881988
one port to another, how they are to be shuffled about, and (though we haven't
1989-
had need for this yet) how they are to be deleted or forgotton.
1989+
had need for this yet) how they are to be deleted or forgotten.
19901990

19911991

19921992

@@ -1999,7 +1999,7 @@ \subsection{Wiring diagrams as lenses in categories of arities}\label{sec:wiring
19991999

20002000
\begin{definition}\label{defn:category.of.arities}
20012001
The category $\arity$ of arities is the free cartesian category generated by
2002-
a single object $\XX$. That is, $\arity$ constains an object $\XX$, called
2002+
a single object $\XX$. That is, $\arity$ contains an object $\XX$, called
20032003
the \emph{generic object}, and for any finite set $I$, there is an $I$-fold
20042004
power $\XX^I$ of $\XX$. The only maps are those that can be defined from the
20052005
product structure by pairing and projection.
@@ -2112,7 +2112,7 @@ \subsection{Wiring diagrams as lenses in categories of arities}\label{sec:wiring
21122112
\XX^{\ord{2}}$ given by $\fun{swap} : \ord{2} \to \ord{2}$ defined by $0
21132113
\mapsto 1$ and $1 \mapsto 0$.
21142114
\item What map corresponds to the map $1 : \ord{1} \to \ord{2}$ picking out
2115-
$1 \in \ord{2} = \{1, 2\}$? What about $2 : \ord{1} \to \ord{2}$.
2115+
$1 \in \ord{2} = \{1, 2\}$? What about $2 : \ord{1} \to \ord{2}$?
21162116
\item Convince yourself that \emph{any} map $\XX^I \to \XX^J$ you can express with the
21172117
universal property of products can be expressed by choosing an appropriate
21182118
$f : J \to I$.
@@ -2506,7 +2506,7 @@ \subsection{Wiring diagrams as lenses in categories of arities}\label{sec:wiring
25062506

25072507
\begin{exercise}
25082508
We blew through that isomorphism $\arity_{\cat{T}} \cong (\Cat{Fin} \downarrow
2509-
\cat{T})\op$ quickly, but its not entirely trivial. The category $\Cat{Fin} \downarrow
2509+
\cat{T})\op$ quickly, but it's not entirely trivial. The category $\Cat{Fin} \downarrow
25102510
\cat{T}$ has objects functions $\tau : I \to \cat{T}$ where $I$ is a finite
25112511
set, and a morphism is a commuting triangle like this:
25122512
\[

book/C3-.tex

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -433,7 +433,7 @@ \subsubsection{Steady states in the deterministic systems theory}
433433
While the steady states of a wired together system can be calculated from those
434434
of its components, this is not true for steady-looking trajectories.
435435
Intuitively, this is because the internal systems can be exposing changing
436-
outputs between eachother even while the eventual external output remains
436+
outputs between each other even while the eventual external output remains
437437
unchanged.
438438
\end{remark}
439439

@@ -1743,7 +1743,7 @@ \subsection{The double category of arenas in the deterministic systems theory}
17431743
\end{equation}
17441744
\end{proposition}
17451745
\begin{proof}
1746-
This is a simple matter of checking the definitions against eachother. The
1746+
This is a simple matter of checking the definitions against each other. The
17471747
defining equations of \cref{def.double_category_of_arenas_discrete} specialize
17481748
to the defining equations of \cref{def.behavior_discrete}.
17491749
\end{proof}
@@ -2628,7 +2628,7 @@ \section{Theories of Dynamical Systems}\label{sec.doctrines}
26282628
\item Can the kinds of input a
26292629
system takes in depend on what it's putting out, and how do they depend on it?
26302630
\item What sorts of changes are possible in a given state?
2631-
\item What does it mean for states to change.
2631+
\item What does it mean for states to change?
26322632
\item How should the way the state changes vary with the input?
26332633
\end{enumerate}
26342634
\end{informal}

book/C4-.tex

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ \section{Introduction}
3232
\item Can the kinds of input a
3333
system takes in depend on what it's putting out, and how do they depend on it?
3434
\item What sorts of changes are possible in a given state?
35-
\item What does it mean for states to change.
35+
\item What does it mean for states to change?
3636
\item How should the way the state changes vary with the input?
3737
\end{enumerate}
3838
\end{informal}
@@ -1970,7 +1970,7 @@ \subsection{Definition}
19701970
\item Can the kinds of input a
19711971
system takes in depend on what it's putting out, and how do they depend on it?
19721972
\item What sorts of changes are possible in a given state?
1973-
\item What does it mean for states to change.
1973+
\item What does it mean for states to change?
19741974
\item How should the way the state changes vary with the input?
19751975
\end{enumerate}
19761976
\end{informal}

book/C5-.tex

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -43,7 +43,7 @@ \section{Introduction}
4343
compositionality theorem concerning any sort of behavior in any systems theory.
4444

4545
But the behaviors of the component systems must be compatible with
46-
eachother: if a system $\Sys{S_1}$ has its parameters set by the exposed
46+
each other: if a system $\Sys{S_1}$ has its parameters set by the exposed
4747
variables of a system $\Sys{S_2}$, then a behavior $\phi_1$ of $\Sys{S_1}$ will be
4848
compatible with a behavior $\phi_2$ of $\Sys{S_2}$ when $\phi_2$ is a behavior
4949
for the parameters charted by the variables exposed by $\phi_1$.
@@ -1478,7 +1478,7 @@ \subsection{How behaviors of systems wire together: representable doubly indexed
14781478
it with the first one and then with the second one.
14791479
\item (Functorial Interchange) This asks us to suppose that we have a pair of
14801480
wiring patterns and compatible charts between them (a square in $\Cat{Arena}$). The law then says that if we
1481-
take a bunch of behaviors whose charts are compatable according to the first
1481+
take a bunch of behaviors whose charts are compatible according to the first
14821482
wiring pattern, wire them together, and then compose with a behavior of the
14831483
second chart, we get the same thing as if we compose them all with behaviors
14841484
of the first chart, noted that they were compatible with the second wiring

book/C6-.tex

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -29,9 +29,9 @@ \section{Introduction}
2929
\item What does it mean to be a system? Does it have a notion of states, or of behaviors? Or is it a diagram describing the way some primitive parts are organized?
3030
\item What should the interface of a system be?
3131
\item How can interfaces be connected in composition patterns?
32-
\item How are systems composed through composition patterns between their interfaces.
32+
\item How are systems composed through composition patterns between their interfaces?
3333
\item What is a map between systems, and how does it affect their interfaces?
34-
\item When can maps between systems be composed along the same composition patterns as the systems.
34+
\item When can maps between systems be composed along the same composition patterns as the systems?
3535
\end{itemize}
3636
\end{informal}
3737

@@ -192,7 +192,7 @@ \section{The Behavioral Approach to Systems Theory}\label{sec:behavioral.approac
192192
that the parameters of the original differential system
193193
$\Sys{LK}$ are considered as exposed variables of state in the behavioral
194194
approach. This is because the behavioral approach composes systems by setting
195-
exposed variables equal to eachother, so the parameters must be considered as
195+
exposed variables equal to each other, so the parameters must be considered as
196196
exposed variables so that they can be set equal to other variables.
197197
\end{remark}
198198

@@ -2208,7 +2208,7 @@ \subsection{Port-plugging systems theories: Labelled graphs}
22082208
The category $\Cat{Graph}$ of graphs is the category of presheaves on the category $0 \rightrightarrows 1$ consisting of two objects $0$ and $1$ and two arrows $s$ and $t$ from $0$ to $1$.
22092209
\end{proposition}
22102210
\begin{proof}
2211-
This is a matter of checking definitions against eachother. A presheaf $G$ on that small category would consists of two sets $G(0)$ and $G(1)$ together with two functions $G(s), G(t) : G(1) \rightrightarrows G(0)$ --- precisely a graph. Furthermore, a natural transformation between these presheaves will be a graph map.
2211+
This is a matter of checking definitions against each other. A presheaf $G$ on that small category would consists of two sets $G(0)$ and $G(1)$ together with two functions $G(s), G(t) : G(1) \rightrightarrows G(0)$ --- precisely a graph. Furthermore, a natural transformation between these presheaves will be a graph map.
22122212
\end{proof}
22132213

22142214
As a corollary, we note that the category of graphs has all limits and colimits, and that they may be calculated in the category of sets. That is, the (co)limit of a diagram of graphs has as nodes the (co)limit of the diagram of sets of nodes, and similarly for its edges. In particular, the category of graphs is has all finite colimits.

0 commit comments

Comments
 (0)