Skip to main content

Section 2.3 Session 3

This week’s reading basically confirmed my generalization from Article 1. I found it somewhat interesting how I instictively happened to use a "vector norm" notation, \(||A||\text{,}\) for the size of domain and codomain while L&S goes through both "number sign", \(\#A\text{,}\) and "absolute value", \(|A|\text{.}\) It seems so natural to want a symbol for "number of elements".
For present, I suppose I’ll follow the book’s convention and save myself two extra characters. It does leave me wondering what kind of distance metrics might be useful for talking about the "sameness" of two maps.

Example 2.3.1. Exercise 1.

...Two of the expressions make sense...
Solution.
So the trick with the map composition is to evaluate them from "right to left". The expression for (a) of \(k \circ h \circ g \circ f\) could be translated into a sequence of steps as follows:
  1. Apply map \(A \overset{f}{\longrightarrow} B\)
  2. Apply map \(B \overset{g}{\longrightarrow} A\)
  3. Apply map \(A \overset{h}{\longrightarrow} C\)
  4. Apply map \(C \overset{k}{\longrightarrow} B\)
Notice how the codomain of each step matches the domain of the following step. Our composite map follows a path from \(A \overset{f}{\longrightarrow} B \overset{g}{\longrightarrow} A \overset{h}{\longrightarrow} C \overset{k}{\longrightarrow} B\text{,}\) so it’s domain is the "source" \(A\) and codomain is the "destination" \(B\text{.}\) Alternatively written, \(A \xrightarrow{k \circ h \circ g \circ f} B\text{.}\)
Moving on to (b), something interesting happens when we attempt to list out the steps of \(k \circ f \circ g\text{:}\)
  1. Apply map \(B \overset{g}{\longrightarrow} A\)
  2. Apply map \(A \overset{f}{\longrightarrow} B\)
  3. Apply map \(C \overset{k}{\longrightarrow} B\)
Notice how the codomain for step 2 of \(B\) is not the same as the domain of \(C\) in step 3. This map composition is not well defined because the map \(k\) will not have a valid input to work with.
Having already identified the one that "doesn’t make sense", let’s move directly onto identifying the domain and codomain of the final composition (c) \(g \circ f \circ g \circ k \circ h\text{.}\) Applied from right to left, this gives us:
\begin{equation*} A \overset{h}{\longrightarrow} C \overset{k}{\longrightarrow} B \overset{g}{\longrightarrow} A \overset{f}{\longrightarrow} B \overset{g}{\longrightarrow} A \end{equation*}
As expected, the domains and codomains link up correctly at each step. This means that the domain of \(g \circ f \circ g \circ k \circ h\) is \(A\) (same as the domain of the first map applied, \(h\)) and the codomain is \(A\) (same as the codomain of the last map applied, \(g\)).

Example 2.3.2. Exercise 2.

...follow the arrows in the diagram with your finger...
Solution.
Let’s start by recreating the source diagram:
Figure 2.3.3. Recreation of diagram used in L&S Session 3 Exercise 2
For composition (a), the path would look like this:
Figure 2.3.4. Recreation of finger tracing steps for L&S Session 3 Exercise 2 Part (a)
For composition (b) we can only trace out the first two steps. The final map fails because the arrow is pointing the wrong direction.
Figure 2.3.5. Recreation of finger tracing steps for L&S Session 3 Exercise 2 Part (b)
Our final composition is interesting in that takes us through map \(g\) twice.
Figure 2.3.6. Recreation of finger tracing steps for L&S Session 3 Exercise 2 Part (c)