Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: learning: questions

Topic: Conceptual Mathematics: Exercises Help


view this post on Zulip Fintan Halpenny (May 22 2021 at 07:52):

image-2e6194a8-a887-4db6-b219-b7e87bced3d1.jpg

view this post on Zulip Fintan Halpenny (May 22 2021 at 07:53):

Hey all, I'm working through Conceptual Mathematics (and loving it). I'm getting a bit stuck on some exercises so I thought it might be helpful to start a topic for help on them if others are also going through the book :)

To kick it off, I'm having trouble interpreting exercise 3 in session 15 (page 179 of the 2nd edition). I'm a bit confused about the setup and the definitions of "evaluation at 0" and "iteration".

view this post on Zulip Ralph Sarkis (May 22 2021 at 08:59):

The elements in the left hand side are functions f:NYf: \mathbb{N} \rightarrow Y making the square below commute.
image.png

The elements in the right hand side are elements yYy \in Y viewed as functions y:1Yy: \mathbf{1} \rightarrow Y.

The goal of the exercise is to show that the elements in the LHS are in correspondence with the elements in the RHS. Starting with f:NYf: \mathbb{N} \rightarrow Y in the LHS, there is a straightforward way to obtain an element of YY, apply ff to 0N0 \in \mathbb{N} to obtain f(0)Yf(0) \in Y, this is "evaluation at 0".

The other direction is less straightforward. First, we observe that any f:NYf: \mathbb{N} \rightarrow Y in the LHS is completely determined by f(0)f(0). Indeed, by the commutativity of the square above, you can derive the value of f(1)f(1) by f(1)=f(σ(0))=β(f(0))f(1) = f(\sigma(0)) = \beta(f(0)), the value of f(2)f(2) by f(2)=f(σ(1))=β(f(1))f(2) = f(\sigma(1)) = \beta(f(1)) and so on. More concisely, you can define f(n)=βn(f(0))f(n) = \beta^n(f(0)) where βn\beta^n denotes the iteration of β\beta nn times, i.e.: βn=βnβ\beta^n = \beta \circ \stackrel{n}{\cdots} \circ \beta. Now, if you are given yYy \in Y, you can set f(0)=yf(0) = y and iterate β\beta to find all the other values of ff. This yields the direction LHS -> RHS.

Finally, the exercise asks you to show the two operation we just described are inverses. Namely, if you start with yYy \in Y, you define ff as above and you evaluate it at 0, you should obtain yy. Conversely, if you start with gg in the LHS and you evaluate at 0 and define ff as above setting f(0)=g(0)f(0) = g(0) you should conclude f=gf = g.

view this post on Zulip Fintan Halpenny (May 30 2021 at 08:32):

Thanks for the help @Ralph Sarkis :blush: it's all coming together with your explanation and diving further into the book 🤿