Skip to main content
added 2 characters in body
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459

You do not need the shift invariance, what is important is that $\|\Lambda\|=\Lambda((1,1,\ldots))=1$. Denote ${\bf 1}:=(1,1,\ldots)$

Denote ${\bf 1}=(1,1,\ldots)$, ${\bf a}=(a_1,a_2,\ldots)$, $\Lambda(a)=\theta$. Assume at first that $\theta$ is not real (here we do not need that $a_n$'s are non-negative, it is sufficient that they are real). Then for small real $t$ we have $\|{\bf 1}+it{\bf a}\|=1+o(t)$, while $|\Lambda({\bf 1}+it{\bf a})|=|1+it\theta|\geqslant \Re(1+it\theta)=1-t\Im \theta$, and if we choose sign of $t$ opposite to the sign of $\Im \theta$, we get $|\Lambda({\bf 1}+it{\bf a})|>\|\Lambda({\bf 1}+it{\bf a})\|$ for small $t$ of the chosen sign, a contradiction.

Now if additionally $a_n\geqslant 0$ for all $n$, and $\theta<0$, do a similar trick comparing $\Lambda({\bf 1}-t{\bf a})=1-t\theta$ and $\|{\bf 1}-t{\bf a}\|\leqslant 1$ for small positive $t$.

You do not need shift invariance, what is important is that $\|\Lambda\|=\Lambda((1,1,\ldots))=1$. Denote ${\bf 1}:=(1,1,\ldots)$

Denote ${\bf a}=(a_1,a_2,\ldots)$, $\Lambda(a)=\theta$. Assume at first that $\theta$ is not real (here we do not need that $a_n$'s are non-negative, it is sufficient that they are real). Then for small real $t$ we have $\|{\bf 1}+it{\bf a}\|=1+o(t)$, while $|\Lambda({\bf 1}+it{\bf a})|=|1+it\theta|\geqslant \Re(1+it\theta)=1-t\Im \theta$, and if we choose sign of $t$ opposite to sign of $\Im \theta$, we get $|\Lambda({\bf 1}+it{\bf a})|>\|\Lambda({\bf 1}+it{\bf a})\|$ for small $t$ of the chosen sign, a contradiction.

Now if additionally $a_n\geqslant 0$ for all $n$, and $\theta<0$, do a similar trick comparing $\Lambda({\bf 1}-t{\bf a})=1-t\theta$ and $\|{\bf 1}-t{\bf a}\|\leqslant 1$ for small positive $t$.

You do not need the shift invariance, what is important is that $\|\Lambda\|=\Lambda((1,1,\ldots))=1$.

Denote ${\bf 1}=(1,1,\ldots)$, ${\bf a}=(a_1,a_2,\ldots)$, $\Lambda(a)=\theta$. Assume at first that $\theta$ is not real (here we do not need that $a_n$'s are non-negative, it is sufficient that they are real). Then for small real $t$ we have $\|{\bf 1}+it{\bf a}\|=1+o(t)$, while $|\Lambda({\bf 1}+it{\bf a})|=|1+it\theta|\geqslant \Re(1+it\theta)=1-t\Im \theta$, and if we choose sign of $t$ opposite to the sign of $\Im \theta$, we get $|\Lambda({\bf 1}+it{\bf a})|>\|\Lambda({\bf 1}+it{\bf a})\|$ for small $t$ of the chosen sign, a contradiction.

Now if additionally $a_n\geqslant 0$ for all $n$, and $\theta<0$, do a similar trick comparing $\Lambda({\bf 1}-t{\bf a})=1-t\theta$ and $\|{\bf 1}-t{\bf a}\|\leqslant 1$ for small positive $t$.

Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459

You do not need shift invariance, what is important is that $\|\Lambda\|=\Lambda((1,1,\ldots))=1$. Denote ${\bf 1}:=(1,1,\ldots)$

Denote ${\bf a}=(a_1,a_2,\ldots)$, $\Lambda(a)=\theta$. Assume at first that $\theta$ is not real (here we do not need that $a_n$'s are non-negative, it is sufficient that they are real). Then for small real $t$ we have $\|{\bf 1}+it{\bf a}\|=1+o(t)$, while $|\Lambda({\bf 1}+it{\bf a})|=|1+it\theta|\geqslant \Re(1+it\theta)=1-t\Im \theta$, and if we choose sign of $t$ opposite to sign of $\Im \theta$, we get $|\Lambda({\bf 1}+it{\bf a})|>\|\Lambda({\bf 1}+it{\bf a})\|$ for small $t$ of the chosen sign, a contradiction.

Now if additionally $a_n\geqslant 0$ for all $n$, and $\theta<0$, do a similar trick comparing $\Lambda({\bf 1}-t{\bf a})=1-t\theta$ and $\|{\bf 1}-t{\bf a}\|\leqslant 1$ for small positive $t$.