Weighted P-norm
$begingroup$
It is known that $ l^p subseteq l^r $ if $ 1 le p le r < infty $. Also, $ l_w^p $ are spaces where we consider a collection of positive weights, $ w_n > 0 $ for each $ n in mathbb{N} $, that given sequence $ x = (x_n) $, the weighted $p$-norm is
$$ ||x||_{w,p} = big (sum_{n=1}^infty w_n |x_n|^p big )^frac{1}{p} text{.} $$
Prove that if $ sum_{n=1}^infty w_n < infty $, then $ l^1_w not subseteq l^2_w $.One way to prove this is to find a subsequence $ (w_{n_k}), $ so that $ w_{n_k} le frac{1}{2^k} $ and consider elements which are nonzero only at the $ n_k $ coordinates.
the subsequence is probably very easy to think up, but I can just not figure it out... :(
functional-analysis norm lp-spaces
$endgroup$
add a comment |
$begingroup$
It is known that $ l^p subseteq l^r $ if $ 1 le p le r < infty $. Also, $ l_w^p $ are spaces where we consider a collection of positive weights, $ w_n > 0 $ for each $ n in mathbb{N} $, that given sequence $ x = (x_n) $, the weighted $p$-norm is
$$ ||x||_{w,p} = big (sum_{n=1}^infty w_n |x_n|^p big )^frac{1}{p} text{.} $$
Prove that if $ sum_{n=1}^infty w_n < infty $, then $ l^1_w not subseteq l^2_w $.One way to prove this is to find a subsequence $ (w_{n_k}), $ so that $ w_{n_k} le frac{1}{2^k} $ and consider elements which are nonzero only at the $ n_k $ coordinates.
the subsequence is probably very easy to think up, but I can just not figure it out... :(
functional-analysis norm lp-spaces
$endgroup$
add a comment |
$begingroup$
It is known that $ l^p subseteq l^r $ if $ 1 le p le r < infty $. Also, $ l_w^p $ are spaces where we consider a collection of positive weights, $ w_n > 0 $ for each $ n in mathbb{N} $, that given sequence $ x = (x_n) $, the weighted $p$-norm is
$$ ||x||_{w,p} = big (sum_{n=1}^infty w_n |x_n|^p big )^frac{1}{p} text{.} $$
Prove that if $ sum_{n=1}^infty w_n < infty $, then $ l^1_w not subseteq l^2_w $.One way to prove this is to find a subsequence $ (w_{n_k}), $ so that $ w_{n_k} le frac{1}{2^k} $ and consider elements which are nonzero only at the $ n_k $ coordinates.
the subsequence is probably very easy to think up, but I can just not figure it out... :(
functional-analysis norm lp-spaces
$endgroup$
It is known that $ l^p subseteq l^r $ if $ 1 le p le r < infty $. Also, $ l_w^p $ are spaces where we consider a collection of positive weights, $ w_n > 0 $ for each $ n in mathbb{N} $, that given sequence $ x = (x_n) $, the weighted $p$-norm is
$$ ||x||_{w,p} = big (sum_{n=1}^infty w_n |x_n|^p big )^frac{1}{p} text{.} $$
Prove that if $ sum_{n=1}^infty w_n < infty $, then $ l^1_w not subseteq l^2_w $.One way to prove this is to find a subsequence $ (w_{n_k}), $ so that $ w_{n_k} le frac{1}{2^k} $ and consider elements which are nonzero only at the $ n_k $ coordinates.
the subsequence is probably very easy to think up, but I can just not figure it out... :(
functional-analysis norm lp-spaces
functional-analysis norm lp-spaces
edited Dec 22 '18 at 10:01
Davide Giraudo
127k17154268
127k17154268
asked Dec 17 '18 at 3:34
Chase SariaslaniChase Sariaslani
805
805
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $(n_k)$ be the increasing sequence of integers mentioned in the opening post and define
$x_{n_k}=left(w_{n_k}k^2right)^{-1}$ and $x_l=0$ if $l$ is not equal to $n_k$ for some $k$. The series $sum_{k}w_{k}leftlvert x_{k}rightrvert$ is convergent and $sum_{k}w_{n_k}x_{n_k}^2$ is divergent since $w_{n_k}x_{n_k}^2geqslant 2^k/k^4$.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3043501%2fweighted-p-norm%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $(n_k)$ be the increasing sequence of integers mentioned in the opening post and define
$x_{n_k}=left(w_{n_k}k^2right)^{-1}$ and $x_l=0$ if $l$ is not equal to $n_k$ for some $k$. The series $sum_{k}w_{k}leftlvert x_{k}rightrvert$ is convergent and $sum_{k}w_{n_k}x_{n_k}^2$ is divergent since $w_{n_k}x_{n_k}^2geqslant 2^k/k^4$.
$endgroup$
add a comment |
$begingroup$
Let $(n_k)$ be the increasing sequence of integers mentioned in the opening post and define
$x_{n_k}=left(w_{n_k}k^2right)^{-1}$ and $x_l=0$ if $l$ is not equal to $n_k$ for some $k$. The series $sum_{k}w_{k}leftlvert x_{k}rightrvert$ is convergent and $sum_{k}w_{n_k}x_{n_k}^2$ is divergent since $w_{n_k}x_{n_k}^2geqslant 2^k/k^4$.
$endgroup$
add a comment |
$begingroup$
Let $(n_k)$ be the increasing sequence of integers mentioned in the opening post and define
$x_{n_k}=left(w_{n_k}k^2right)^{-1}$ and $x_l=0$ if $l$ is not equal to $n_k$ for some $k$. The series $sum_{k}w_{k}leftlvert x_{k}rightrvert$ is convergent and $sum_{k}w_{n_k}x_{n_k}^2$ is divergent since $w_{n_k}x_{n_k}^2geqslant 2^k/k^4$.
$endgroup$
Let $(n_k)$ be the increasing sequence of integers mentioned in the opening post and define
$x_{n_k}=left(w_{n_k}k^2right)^{-1}$ and $x_l=0$ if $l$ is not equal to $n_k$ for some $k$. The series $sum_{k}w_{k}leftlvert x_{k}rightrvert$ is convergent and $sum_{k}w_{n_k}x_{n_k}^2$ is divergent since $w_{n_k}x_{n_k}^2geqslant 2^k/k^4$.
answered Dec 18 '18 at 17:46
Davide GiraudoDavide Giraudo
127k17154268
127k17154268
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3043501%2fweighted-p-norm%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown