supremum and summation Inequality

67 Views Asked by At

I am trying to prove an Inequality $$ \sup_{k \ge 1} \mid x_k \, \mid ^{q-p} \le \, (\mid \sum_{k \ge 1} \mid x_k \mid ^p) ^{q-p \over p} $$ where $1 \le p \le q < \infty$ How should I proceed

1

There are 1 best solutions below

4
On BEST ANSWER

It is a matter of the fact that \begin{align*} \sup|x_{k}|\leq\left(\sum|x_{k}|^{r}\right)^{1/r} \end{align*} for $r\geq 1$.

One shall note that \begin{align*} |x_{k}|=(|x_{k}|^{r})^{1/r}\leq\left(\sum|x_{k}|^{r}\right)^{1/r} \end{align*} for all $k$.