Proof that $l^p$ with $1 leq p < infty$ is dense in $c_0$
Proof that $l^p$ with $1 leq p < infty$ is dense in $c_0$
My definition of $c_0$ is the following:
$$ c_0 = left{ x vert lim_{kto infty} x_k = 0right}.$$
I want to prove it like this: every element of $c_0$ can be written as limit of $l^p$.
First question, should I use the $p$ norm or the sup norm?
Second question, how should I start given that I think this statement is true?
general-topology functional-analysis lp-spaces
add a comment |
Proof that $l^p$ with $1 leq p < infty$ is dense in $c_0$
My definition of $c_0$ is the following:
$$ c_0 = left{ x vert lim_{kto infty} x_k = 0right}.$$
I want to prove it like this: every element of $c_0$ can be written as limit of $l^p$.
First question, should I use the $p$ norm or the sup norm?
Second question, how should I start given that I think this statement is true?
general-topology functional-analysis lp-spaces
add a comment |
Proof that $l^p$ with $1 leq p < infty$ is dense in $c_0$
My definition of $c_0$ is the following:
$$ c_0 = left{ x vert lim_{kto infty} x_k = 0right}.$$
I want to prove it like this: every element of $c_0$ can be written as limit of $l^p$.
First question, should I use the $p$ norm or the sup norm?
Second question, how should I start given that I think this statement is true?
general-topology functional-analysis lp-spaces
Proof that $l^p$ with $1 leq p < infty$ is dense in $c_0$
My definition of $c_0$ is the following:
$$ c_0 = left{ x vert lim_{kto infty} x_k = 0right}.$$
I want to prove it like this: every element of $c_0$ can be written as limit of $l^p$.
First question, should I use the $p$ norm or the sup norm?
Second question, how should I start given that I think this statement is true?
general-topology functional-analysis lp-spaces
general-topology functional-analysis lp-spaces
edited Nov 20 '18 at 21:38


Davide Giraudo
125k16150259
125k16150259
asked Nov 20 '18 at 21:24
qcc101
458113
458113
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
The space $c_0$ is usually considered as a subspace of $ell^infty$, and hence automatically inherits the sup-norm.
For any given $x = (x_1, x_2, ldots) in c_0$, you can truncate it to obtain an $ell^p$ sequence, i.e. you can consider
$$ hat x^{(n)} = (x_1, x_2, ldots, x_n , 0, 0 ,ldots) in ell^p. $$
Then
$$ Vert hat x^{(n)} - xVert_{infty} = sup_{j geq n+1} |x_j|, $$
which can evidently be made arbitrarily small by taking $n$ to be large, since $x_j to 0$ as $j to infty$.
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%2f3006923%2fproof-that-lp-with-1-leq-p-infty-is-dense-in-c-0%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
The space $c_0$ is usually considered as a subspace of $ell^infty$, and hence automatically inherits the sup-norm.
For any given $x = (x_1, x_2, ldots) in c_0$, you can truncate it to obtain an $ell^p$ sequence, i.e. you can consider
$$ hat x^{(n)} = (x_1, x_2, ldots, x_n , 0, 0 ,ldots) in ell^p. $$
Then
$$ Vert hat x^{(n)} - xVert_{infty} = sup_{j geq n+1} |x_j|, $$
which can evidently be made arbitrarily small by taking $n$ to be large, since $x_j to 0$ as $j to infty$.
add a comment |
The space $c_0$ is usually considered as a subspace of $ell^infty$, and hence automatically inherits the sup-norm.
For any given $x = (x_1, x_2, ldots) in c_0$, you can truncate it to obtain an $ell^p$ sequence, i.e. you can consider
$$ hat x^{(n)} = (x_1, x_2, ldots, x_n , 0, 0 ,ldots) in ell^p. $$
Then
$$ Vert hat x^{(n)} - xVert_{infty} = sup_{j geq n+1} |x_j|, $$
which can evidently be made arbitrarily small by taking $n$ to be large, since $x_j to 0$ as $j to infty$.
add a comment |
The space $c_0$ is usually considered as a subspace of $ell^infty$, and hence automatically inherits the sup-norm.
For any given $x = (x_1, x_2, ldots) in c_0$, you can truncate it to obtain an $ell^p$ sequence, i.e. you can consider
$$ hat x^{(n)} = (x_1, x_2, ldots, x_n , 0, 0 ,ldots) in ell^p. $$
Then
$$ Vert hat x^{(n)} - xVert_{infty} = sup_{j geq n+1} |x_j|, $$
which can evidently be made arbitrarily small by taking $n$ to be large, since $x_j to 0$ as $j to infty$.
The space $c_0$ is usually considered as a subspace of $ell^infty$, and hence automatically inherits the sup-norm.
For any given $x = (x_1, x_2, ldots) in c_0$, you can truncate it to obtain an $ell^p$ sequence, i.e. you can consider
$$ hat x^{(n)} = (x_1, x_2, ldots, x_n , 0, 0 ,ldots) in ell^p. $$
Then
$$ Vert hat x^{(n)} - xVert_{infty} = sup_{j geq n+1} |x_j|, $$
which can evidently be made arbitrarily small by taking $n$ to be large, since $x_j to 0$ as $j to infty$.
answered Nov 20 '18 at 21:32
MisterRiemann
5,7841624
5,7841624
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3006923%2fproof-that-lp-with-1-leq-p-infty-is-dense-in-c-0%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