Prove that $\{s_n\}$ convergence implies $\{|s_n|\}$ convergence? Prove that $\{s_n\}$ convergence implies $\{\left|s_n\right|\}$ convergence?

Proof. Let $\{s_n\}$ be a sequence of real numbers. We show that $s_n \to s$ implies $|s_n| \to t$ for $s, t \in \Bbb{R}$. By the Cauchy criterion then $\exists p, q \in \Bbb{N}$ s.t. $\left|\sum_{n=p}^q s_n\right| < \epsilon$.

I don't know how to continue.
I need to show $$\left|\sum_{n=p}^q \left|s_n\right|\right| < \epsilon$$
But that latter sequence is larger than the former...so I can't use comparison test.
This is from Rudin, Chapter 3 exercise 1.
 A: Suppose $(s_n)$ is a sequence of real numbers and $s_n\to s$. There are three cases, depending on whether $s>0$, $s<0$, or $s=0$. 
Suppose first that $s\ne0$. Recall that $s_n\to s$ means that for any $\epsilon>0$ there is an $N$ such that if $n>N$ then $|s_n-s|<\epsilon$. Specifically, let $\epsilon=|s|$ (or any positive number less than $|s|$). Since $|s|=|s-0|$, the condition $|s_n-s|<|s|$ (valid for all $n>N$) means that $s_n$ is closer to $s$ than $s$ is to $0$, so $s_n$ and $s$ must have the same sign. In the first case, where $s>0$, this means that $|s_n|=s_n$ for all $n>N$, so $|s_n|\to s$. In the second case, where $s<0$, we have $|s_n|=-s_n$ for all $n>N$, so $|s_n|\to -s$.
We are left with the case where $s=0$. Again, that $s_n\to 0$ means that for any $\epsilon>0$ there is an $N$ such that for all $n>N$, we have $|s_n-0|<\epsilon$. But 
 $$ |s_n-0|=|s_n|=|s_n|-0=||s_n|-0|, $$
and we have shown that for all $\epsilon>0$ there is an $N$ such that if $n>N$ then $||s_n|-0|<\epsilon$, that is, $|s_n|\to 0$.
Finally, note that in all cases we have that $|s_n|\to|s|$. What we have shown is a particular instance of a general fact, namely, that if $f$ is continuous at a point $s$, $(s_n)$ is a sequence of points such that $s_n\to s$, and all the $s_n$ are in the domain of $f$, then $f(s_n)\to f(s)$. In this case, $f(x)=|x|$. Actually, in the setting we are discussing, the converse holds, so continuity of $f$ at $s$ is equivalent to this fact, that is, if $s$ is in the domain of $f$, then $f$ is continuous at $s$ iff whenever $s_n\to s$ and all the $s_n$ are in the domain of $f$, then $f(s_n)\to f(s)$. So we can take the argument above as a (convoluted) proof that $f(x)=|x|$ is continuous.
A: Hmmm... With one case and only one case: assume that $s_n\to\ell$, that is, that $|s_n-\ell|\to0$. Then $||s_n|-|\ell||\leqslant|s_n-\ell|$ for every $n$ hence $||s_n|-|\ell||\to0$, that is, $|s_n|\to|\ell|$.

Keyword: Second triangular inequality.

