Shift Operator has no "square root"?

Solution 1:

Suppose that $R^2=T$. Then $\ker R\subseteq\ker T=\Bbb Re_0$, where $e_0=\langle 1,0,0,\ldots\rangle$. Clearly $\ker R$ is non-trivial, so $\ker R=\ker T$. Moreover, $T$ is surjective, so $R$ must also be surjective. In particular, $e_0=Rx$ for some $x\in\ell^1(\Bbb N)\setminus\ker T$, and therefore $R^2x=Re_0=0\ne Tx$.

Now suppose that $R^2=S$, and let $V=\operatorname{ran}S$; clearly $\operatorname{ran}R\supseteq V$. $R$ cannot be surjective, so $\operatorname{ran}R=V$. But then $\operatorname{ran}\left(R\upharpoonright V\right)=\operatorname{ran}S=V$, so for each $x\in\ell^1(\Bbb N)\setminus V$ there must be a $y\in V$ such that $Rx=Ry$. However, $S$ is injective, so $R$ must also be injective.

Solution 2:

I don't think it is obvious. For $T$, in theory, we might shift $x_2$ to position $n, x_n$ to position $3, x_3$ to position $n+1$ and so on. The problem comes with the "and so on". Let $x_2$ go to position $n$. Then we must have $x_n$ goes to position $1, x_1$ to position $n-1, x_{n+1}$ to position $2$, $x_3$ to position $n+1$ and so on. So $R(x_1,x_2,x_3,\dots )=(x_{n-1}x_n,x_{n+1},x_{n+2}\dots x_2,x_3,x_4,\dots)$. But now we have position $n-1$ holding $x_{2n-3}$ and $R(x_1,x_2,x_3,\dots )=(x_{n-1},x_n,x_{n+1},x_{n+2}\dots ,x_{2n-4},x_{2n-3},x_2,x_3,x_4,\dots,x_{n-4},x_{n-3},x_{n-2}\dots)$ and we have accounted for the first $2n-3$ entries so far. Unfortunately, position $2n-3$ will end up having $x_1$ in it, so this fails.