Is the decimation process time invariant? I'm stuck at exercise 1.18 in Understanding Digital Signal Processing by Richard G. Lyons:


  There is an often-used process in DSP called decimation, and in that process we retain some samples of an $x(n)$ input sequence and discard other $x(n)$ samples. Decimation by a factor of two can be described algebraically by
  $$y(m) = x(2n) \tag{P1-3}$$
  where index $m = 0,1,2,3,. . .$ The decimation defined by Eq.
  (P1-3) means that $y(m)$ is equal to alternate samples (every other
  sample) of $x(n)$. For example: $y(0) = x(0)$, $y(1) = x(2)$, $y(2) = x(4)$,
  $y(3) = x(6)$, $. . .$ and so on. Here is the question: Is that decimation
  process time invariant?
  
  Illustrate your answer by decimating a simple sinusoidal $x(n)$ time-domain sequence by a factor of two to obtain
  $y(m)$. Next,create a shifted-by-one-sample version of $x(n)$ and call it
  $x_{shift}(n)$. That new sequence is defined by (P1-4):
  
  $$x_{shift}(n) = x(n+1) \tag{P1-4}$$
  Finally, decimate $x_{shift}(n)$ according to Eq. (P1-3) to obtain $y_{shift}(m)$. The decimation process is
  time invariant if $y_{shift}(m)$ is equal to a time-shifted version of $y(m)$. That is, decimation is time invariant if
  $$y_{shift}(m) = y(m+1)$$


I'm somewhat confused by the notation $y(m) = x(2n)$--according to the definition of the decimation, I would hve written $y(n) = x(2n)$. Anyway, if I try to resolve the problem as it is stated:


"Illustrate your answer by decimating a simple sinusoidal () time-domain sequence by a factor of two to obtain ()"

Let say $x(n)=sin(\omega n) \text{ with } \omega=2\pi f_0 t_s$
$\implies y(m) = x(2n)=sin(2\omega n)$
"create a shifted-by-one-sample version of $x(n)$ and call it $x_{shift}(n)$"

$x_{shift}(n) = x(n+1) = sin(\omega n+\omega)$
"decimate $x_{shift}(n)$ according to Eq. (P1-3) to obtain $y_{shift}(m)$"

$y_{shift}(m) = x_{shift}(2n) = x(2n+1) = sin(2\omega n +\omega)$
"That is, decimation is time invariant if $y_{shift}(m) = y(m+1)$"

$y(m+1) = x(\text{???})$


Eq (P1-3) doesn't really give a relation between $m$ and $n$. So what is $m+1$? According to the decimation definition given in the exercice, I would be tempted to say that $m+1=2n+2$. But that leads to $y(m+1)=sin(2\omega n +
2\omega) \neq y_{shift}(m)$

Could you pinpoint my mistake or clarify my misunderstanding in this exercise?
Sample rate conversion systems (expansion or decimation) are time-varying operators.

For your example system of decimation by $M$ :

$$ y[n] = T\{x[n]\} = x[Mn] $$

you can easily see that results of shift in the input and output are not the same; i.e.,

$$ y_1[n] = T\{ x[n-d] \} = x[Mn - d] $$

and 

$$ y_d[n] = y[n-d] = x[M(n - d)] \neq y_1[n]$$