Q1: Suppose $(x_n)$ satisfies $-1$ $\leq$ $x_n$ $\leq$ $1$ for all $n$ $\in$ $\Bbb{N}$. Suppose $(x_{n_k})$ is a subsequence of $(x_n)$ converging to $(x_0$) $\in$ $\Bbb{R}$. Prove that it is always true that $-1$ $\leq$ $x_0$ $\leq$ $1$
Just for confirmation, is this true because we know (x_n) is bounded, thus by Bolzano-Weierstrass Theorem (x_n) has a monotone subsequence $(x_{n_k})$ and this monotone sequence is either non-increasing or non-decreasing. If it is non-increasing then the sequence $x_0$ is equal to the infimum of the set, and if it is non-decreasing then $x_0$ is equal to the supremum of the set?
Q2: Suppose $(x_n)$ satisfies $-1$ $\leq$ $x_n$ $\lt$ $1$ for all $n$ $\in$ $\Bbb{N}$. Suppose $(x_{n_k})$ is a subsequence of $(x_n)$ converging to $(x_0$) $\in$ $\Bbb{R}$. Prove that it is always true that $-1$ $\leq$ $x_0$ $\leq$ $1$.
How can this be the case?
Q3 Is the statement $\alpha$ $\in$ $\Bbb{R}$ and x $\in$ $\Bbb{R^d}$, then $\Vert{\alpha x}$$\Vert$ $=$ $\alpha$ $\Vert{x}$$\Vert$ true or false?:
Why must the RHS of the equation have $\vert{\alpha}$$\vert$ and not just $\alpha$
Q4: Let $x$, $y$ $\in$ $\Bbb{R^d}$ Prove using the triangle inequality $\Vert{x-y}$$\Vert$ + $\Vert{x - 2y}$$\Vert$ $\geq$ $\Vert{y}$$\Vert$.
Not sure how to prove this?