Let $x=(x_n)\in \ell^1$. Then one can show that $x\in\ell^p,\,\forall p\geq1$. I must prove that $\lim_{p\to 1^+}||x||_p = ||x||_1$, where $||\cdot||_p$ and $||\cdot||_1$ denote the usual $\ell^p$ and $\ell^1$ norms. I've managed to show that $\limsup_{p\to1^+}||x||_p\leq||x||_1$, but I'm having difficulty proving $\liminf_{p\to1^+}||x||_p\geq||x||_1$. My teacher told me to try using the fact that given $\epsilon>0$ there exists $N\in\mathbb{N}$ such that $\sum_{n=N+1}^\infty|x_n|^p<\epsilon$, and then that $\lim_{p\to1^+}\sum_{n=1}^N|x_n|^p = \sum_{n=1}^N|x_n|$, but that doesn't seem to help, since you end up with the same inequality. Any tips?
2026-05-15 08:34:50.1778834090
Limit $\ell^p$ norms
70 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SEQUENCES-AND-SERIES
- How to show that $k < m_1+2$?
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Negative Countdown
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Show that the sequence is bounded below 3
- A particular exercise on convergence of recursive sequence
- Proving whether function-series $f_n(x) = \frac{(-1)^nx}n$
- Powers of a simple matrix and Catalan numbers
- Convergence of a rational sequence to a irrational limit
- studying the convergence of a series:
Related Questions in NORMED-SPACES
- How to prove the following equality with matrix norm?
- Closure and Subsets of Normed Vector Spaces
- Exercise 1.105 of Megginson's "An Introduction to Banach Space Theory"
- derive the expectation of exponential function $e^{-\left\Vert \mathbf{x} - V\mathbf{x}+\mathbf{a}\right\Vert^2}$ or its upper bound
- Minimum of the 2-norm
- Show that $\Phi$ is a contraction with a maximum norm.
- Understanding the essential range
- Mean value theorem for functions from $\mathbb R^n \to \mathbb R^n$
- Metric on a linear space is induced by norm if and only if the metric is homogeneous and translation invariant
- Gradient of integral of vector norm
Related Questions in LP-SPACES
- Absolutely continuous functions are dense in $L^1$
- Understanding the essential range
- Problem 1.70 of Megginson's "An Introduction to Banach Space Theory"
- Showing a sequence is in $\ell^1$
- How to conclude that $\ell_\infty$ is not separable from this exercise?
- Calculating the gradient in $L^p$ space when $0<p<1$ and the uderlying set is discrete and finite
- $f_{n} \in L^{p}(X),$ such that $\lVert f_{n}-f_{n+1}\rVert_{p} \leq \frac{1}{n^2}$. Prove $f_{n}$ converges a.e.
- Find a sequence converging in distribution but not weakly
- Elementary use of Hölder inequality
- Identify $\operatorname{co}(\{e_n:n\in\mathbb N\})$ and $\overline{\operatorname{co}}(\{e_n : n\in\mathbb N\})$ in $c_0$ and $\ell^p$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
geometry
circles
algebraic-number-theory
functions
real-analysis
elementary-set-theory
proof-verification
proof-writing
number-theory
elementary-number-theory
puzzle
game-theory
calculus
multivariable-calculus
partial-derivative
complex-analysis
logic
set-theory
second-order-logic
homotopy-theory
winding-number
ordinary-differential-equations
numerical-methods
derivatives
integration
definite-integrals
probability
limits
sequences-and-series
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Fix $\epsilon > 0$. We can find $N$ sufficiently large so that
$$ \sum_{n=N+1}^\infty |x_n|^p < \epsilon.$$
Now we can write
$$\|x\|_p^p = \sum_{n=1}^\infty |x_n|^p = \sum_{n=1}^N |x_n|^p + \sum_{n=N+1}^\infty |x_n|^p < \sum_{n=1}^N |x_n|^p + \epsilon.$$
Taking the $p$th root of both sides,
$$\|x\|_p < \sum_{n=1}^N |x_n| + \epsilon^{1/p} \leq \sum_{n=1}^\infty |x_n| + \epsilon^{1/p} = \|x\|_1 + \epsilon^{1/p}.$$
Take $p \rightarrow 1^+$ to get $\limsup_{p \rightarrow 1^+} \|x\|_p \leq \|x\|_1 + \epsilon$ for all $\epsilon > 0$, hence $\limsup_{p \rightarrow 1^+} \|x\|_p \leq \|x\|_1$.
For the other direction, fix $\epsilon> 0$ and observe that there is an $N$ large enough so that
$$ \sum_{n=N+1}^\infty |x_n| < \epsilon.$$
Now we can write
$$\|x\|_1 = \sum_{n=1}^N |x_n| + \sum_{n=N+1}^\infty |x_n| < \sum_{n=1}^N |x_n| + \epsilon.$$
Since there are only finitely many terms we need to worry about, we can choose a constant $C$ so that $|Cx_n| \geq 1$ (or $|Cx_n| = 0$ if $x_n = 0$) for $1 \leq n \leq N$. For $p \geq 1$ this gives us
$$\|Cx\|_1 < \sum_{n=1}^N |Cx_n| + |C| \epsilon \leq \sum_{n=1}^n |Cx_n|^p + |C| \epsilon = |C|^p \sum_{n=1}^N |x_n|^p + |C| \epsilon.$$ Divide both sides by $|C|$ to get
$$ \|x\|_1 \leq |C|^{p-1}\sum_{n=1}^N |x_n|^p + \epsilon \leq |C|^{p-1} \|x\|_p^p + \epsilon.$$
Now take $p$th roots to get
$$\|x\|_1^{1/p} \leq |C|^{(p-1)/p} \|x\|_p + \epsilon^{1/p}.$$
Let $p \rightarrow 1^+$ to get
$$ \|x\|_1 \leq \liminf_{p \rightarrow 1^+} \|x\|_p + \epsilon.$$
This holds for all $\epsilon > 0$, so let $\epsilon \rightarrow 0$ to get our desired answer.