The Clowder Project

7.5.5 The Left Unitor

The left unitor of the smash product of pointed sets is the natural isomorphism

whose component

\[ \lambda ^{\mathsf{Sets}_{*}}_{X} \colon S^{0}\wedge X \overset {\scriptstyle \mathord {\sim }}{\dashrightarrow }X \]

at $X\in \operatorname {\mathrm{Obj}}\webleft (\mathsf{Sets}_{*}\webright )$ is given by

\begin{align*} 0\wedge x & \mapsto x_{0},\\ 1\wedge x & \mapsto x \end{align*}

for each $x\in X$.

Well-Definedness

Let $\webleft [\webleft (x,y\webright )\webright ]=\webleft [\webleft (x',y'\webright )\webright ]$ be an element in $S^{0}\wedge X$. Then either:

2.

Both of the following conditions are satisfied:

1. (a)

   We have $x=0$ or $y=x_{0}$.

2. (b)

   We have $x'=0$ or $y'=x_{0}$.

In the first case, $\lambda ^{\mathsf{Sets}_{*}}_{X}$ clearly sends both elements to the same element in $X$. Meanwhile, in the latter case both elements are equal to the basepoint $0\wedge x_{0}$ of $S^{0}\wedge X$, which gets sent to the basepoint $x_{0}$ of $X$.

As just mentioned, we have

and thus $\lambda ^{\mathsf{Sets}_{*}}_{X}$ is a morphism of pointed sets.

The inverse of $\lambda ^{\mathsf{Sets}_{*}}_{X}$ is the morphism

defined by

for each $x\in X$. Indeed:

1. 1.

   Invertibility I. We have

   \begin{align*} \webleft [\lambda ^{\mathsf{Sets}_{*},-1}_{X}\circ \lambda ^{\mathsf{Sets}_{*}}_{X}\webright ]\webleft (0\wedge x\webright ) & = \lambda ^{\mathsf{Sets}_{*},-1}_{X}\webleft (\lambda ^{\mathsf{Sets}_{*}}_{X}\webleft (0\wedge x\webright )\webright )\\ & = \lambda ^{\mathsf{Sets}_{*},-1}_{X}\webleft (x_{0}\webright )\\ & = 1\wedge x_{0}\\ & = 0\wedge x, \end{align*}

   and

   \begin{align*} \webleft [\lambda ^{\mathsf{Sets}_{*},-1}_{X}\circ \lambda ^{\mathsf{Sets}_{*}}_{X}\webright ]\webleft (1\wedge x\webright ) & = \lambda ^{\mathsf{Sets}_{*},-1}_{X}\webleft (\lambda ^{\mathsf{Sets}_{*}}_{X}\webleft (1\wedge x\webright )\webright )\\ & = \lambda ^{\mathsf{Sets}_{*},-1}_{X}\webleft (x\webright )\\ & = 1\wedge x \end{align*}

   for each $x\in X$, and thus we have

   \[ \lambda ^{\mathsf{Sets}_{*},-1}_{X}\circ \lambda ^{\mathsf{Sets}_{*}}_{X}=\operatorname {\mathrm{id}}_{S^{0}\wedge X}. \]
2. 2.

   Invertibility II. We have

   \begin{align*} \webleft [\lambda ^{\mathsf{Sets}_{*}}_{X}\circ \lambda ^{\mathsf{Sets}_{*},-1}_{X}\webright ]\webleft (x\webright ) & = \lambda ^{\mathsf{Sets}_{*}}_{X}\webleft (\lambda ^{\mathsf{Sets}_{*},-1}_{X}\webleft (x\webright )\webright )\\ & = \lambda ^{\mathsf{Sets}_{*},-1}_{X}\webleft (1\wedge x\webright )\\ & = x \end{align*}

   for each $x\in X$, and thus we have

   \[ \lambda ^{\mathsf{Sets}_{*}}_{X}\circ \lambda ^{\mathsf{Sets}_{*},-1}_{X}=\operatorname {\mathrm{id}}_{X}. \]

This shows $\lambda ^{\mathsf{Sets}_{*}}_{X}$ to be invertible.

We need to show that, given a morphism of pointed sets

the diagram

commutes. Indeed, this diagram acts on elements as and and hence indeed commutes, showing $\lambda ^{\mathsf{Sets}_{*}}$ to be a natural transformation.

Since $\lambda ^{\mathsf{Sets}_{*}}$ is natural and $\lambda ^{\mathsf{Sets}_{*},-1}$ is a componentwise inverse to $\lambda ^{\mathsf{Sets}_{*}}$, it follows from Chapter 11: Categories, Item 2 of Proposition 11.9.7.1.2 that $\lambda ^{\mathsf{Sets}_{*},-1}$ is also natural. Thus $\lambda ^{\mathsf{Sets}_{*}}$ is a natural isomorphism.