Categories for the Working Mathematician

This section is empty…

Exercises

Exercise 1.4.1

Let s be a fixed set, and ts the set of all functions st. Show that tts is the object restriction of a functor 𝐒𝐞𝐭𝐒𝐞𝐭, and that application et:ts×st, defined by efx=fx, defines a natural transformation.

Let F:𝐒𝐞𝐭𝐒𝐞𝐭 be the endofunctor defined on objects by Fx=xs, and on morphisms by Ff=ggf.

Functorality of F comes easy: identity is preserved:

\begin{align*} F \id{x} &= g \mapsto g\id{x} \\ &= g \mapsto g, \end{align*} ParseError: Expected 'EOF', got '&' at position 25: …ign*} F \id{x} &̲= g \mapsto g\i…

and composition is respected:

aauuu}:3

Exercise 1.4.2

If H is a fixed group, show that GH×G defines a functor H×:\Grp\Grp and that each morphism f:HK defines a natural transformation H×K×.

The functor H× is defined on objects by GH×g and on morphisms by \phi \mapsto \id{H} \times \phi ParseError: Function "\id" is not trusted at position 14: \phi \mapsto \̲i̲d̲{H} \times \phi, lifting homomorphisms. into the right-hand side of the direct product and leaving H unaffected. Identity and composition are preserved/respected:

\begin{tabular}{p{4cm}p{3cm}} {\begin{align*} & \left(H \times -\right) \id{G} \\ = &\id{H} \times \id{G} \\ = &\id{H \times G} \end{align*}} & {\begin{align*} & \left[\left(H\times -\right) \phi\right]\left[\left(H\times -\right) \psi \right] \\ = & \left(\id{H} \times \phi\right) \left(\id{H} \times \psi \right) \\ = & \left(\id{H} \times \phi\psi \right) \\ = & \left(H\times -\right)\left(\phi\psi\right). \end{align*}} \end{tabular} ParseError: No such environment: tabular at position 7: \begin{̲t̲a̲b̲u̲l̲a̲r̲}̲{p{4cm}p{3cm}} …

Given a group homomorphism f:HK, the arrows \eta_G = f \times \id{G} ParseError: Unexpected end of input in a macro argument, expected '}' at end of input: …f \times \id{G} define a natural transformation.

Exercise 1.5.6

Show that all idempotents in 𝐒𝐞𝐭 split.

Let f:AA be an idempotent function. We will factor f into two new functions whose composite is f, but with a detour through f's image.

Restrict f's codomain to its image, yielding g:AImagef. By definition of the image, every element has a fiber in A, making g a surjection.

Define h:ImagefA as the inclusion of f's image back into its codomain. Trivially an injection!!!!!!!

Now, g, being a restriction of f, behaves exactly like f and differs only in signature. Similarly, the inclusion h behaves exactly like the identity function, again differing only in signature. Composing them under this new light, we get gh=f1=f.

Finally, we can substitute gh=f into the equation for f's idempotence:

gh=ghgh.

As g is surjective, it is also right-cancellable:

h=hgh,

and h is a surjection, making it left-cancellable:

1=hg.

quetzal ed deez or whatever.