There are no bounded linear functional on $L^p(mathbb{R})$ if $0<p<1.$
Consider $L^p(mathbb{R})$ where $0<p<1$.
Why there are no bounded linear functional on $L^p(mathbb{R})$?
i.e.
If $l$ is linear functional $l:L^p(mathbb{R})to mathbb{C}$ such that $|l(f)|leq M|f|_{p}$ for all $f$ and some $M>0$, then $l=0$.
Why?
Hint: Let $F(x)=l(mathcal{X}_{[0,x]})$, and consider $F(x)-F(y)$
functional-analysis measure-theory lp-spaces
add a comment |
Consider $L^p(mathbb{R})$ where $0<p<1$.
Why there are no bounded linear functional on $L^p(mathbb{R})$?
i.e.
If $l$ is linear functional $l:L^p(mathbb{R})to mathbb{C}$ such that $|l(f)|leq M|f|_{p}$ for all $f$ and some $M>0$, then $l=0$.
Why?
Hint: Let $F(x)=l(mathcal{X}_{[0,x]})$, and consider $F(x)-F(y)$
functional-analysis measure-theory lp-spaces
add a comment |
Consider $L^p(mathbb{R})$ where $0<p<1$.
Why there are no bounded linear functional on $L^p(mathbb{R})$?
i.e.
If $l$ is linear functional $l:L^p(mathbb{R})to mathbb{C}$ such that $|l(f)|leq M|f|_{p}$ for all $f$ and some $M>0$, then $l=0$.
Why?
Hint: Let $F(x)=l(mathcal{X}_{[0,x]})$, and consider $F(x)-F(y)$
functional-analysis measure-theory lp-spaces
Consider $L^p(mathbb{R})$ where $0<p<1$.
Why there are no bounded linear functional on $L^p(mathbb{R})$?
i.e.
If $l$ is linear functional $l:L^p(mathbb{R})to mathbb{C}$ such that $|l(f)|leq M|f|_{p}$ for all $f$ and some $M>0$, then $l=0$.
Why?
Hint: Let $F(x)=l(mathcal{X}_{[0,x]})$, and consider $F(x)-F(y)$
functional-analysis measure-theory lp-spaces
functional-analysis measure-theory lp-spaces
edited Nov 21 '18 at 6:25
asked Nov 21 '18 at 5:24
eraldcoil
363111
363111
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
This question surely was already answered here. In the case $0 <p <1$ the usual definition of the $L^p$-norm is not a norm, because the $Delta$-inequality isn't satisfied. If $0< p <1$ the space $L^p(mathbb{R})$ is only a metric space with invariant metric given by
$$|f|_p := int |f|^p d lambda.$$
If $l$ is a continuous functional, we know that $|l(f)| < 1$ for $f in B_delta(0)$ and some $delta >0$. By rescaling and using linearity, we see that $$|l(f)| le M |f|_p^{1/p}$$
with $M= delta^{-1}$. Now decompose $[a,b]$ in $n$ disjoint intervals $I_1,ldots,I_n$ with lenght $(b-a)/n$. Then we have
$$|l(1_{[a,b]})| le sum_{k=1}^n |l(1_{I_i})| le nM |l(1_{I_i})|_p = (b-a)^{1/p} n^{1-1/p}.$$
Since $0<p<1$, we see that $1-1/p$ is negative. Thus, letting $n rightarrow infty$, we get $l(1_{[a,b]}) =0$. Since all linear combinations of such intervals are dense in $L^p$ (also for $0<p<1$), we see that $l$ is trivial.
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%2f3007297%2fthere-are-no-bounded-linear-functional-on-lp-mathbbr-if-0p1%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
This question surely was already answered here. In the case $0 <p <1$ the usual definition of the $L^p$-norm is not a norm, because the $Delta$-inequality isn't satisfied. If $0< p <1$ the space $L^p(mathbb{R})$ is only a metric space with invariant metric given by
$$|f|_p := int |f|^p d lambda.$$
If $l$ is a continuous functional, we know that $|l(f)| < 1$ for $f in B_delta(0)$ and some $delta >0$. By rescaling and using linearity, we see that $$|l(f)| le M |f|_p^{1/p}$$
with $M= delta^{-1}$. Now decompose $[a,b]$ in $n$ disjoint intervals $I_1,ldots,I_n$ with lenght $(b-a)/n$. Then we have
$$|l(1_{[a,b]})| le sum_{k=1}^n |l(1_{I_i})| le nM |l(1_{I_i})|_p = (b-a)^{1/p} n^{1-1/p}.$$
Since $0<p<1$, we see that $1-1/p$ is negative. Thus, letting $n rightarrow infty$, we get $l(1_{[a,b]}) =0$. Since all linear combinations of such intervals are dense in $L^p$ (also for $0<p<1$), we see that $l$ is trivial.
add a comment |
This question surely was already answered here. In the case $0 <p <1$ the usual definition of the $L^p$-norm is not a norm, because the $Delta$-inequality isn't satisfied. If $0< p <1$ the space $L^p(mathbb{R})$ is only a metric space with invariant metric given by
$$|f|_p := int |f|^p d lambda.$$
If $l$ is a continuous functional, we know that $|l(f)| < 1$ for $f in B_delta(0)$ and some $delta >0$. By rescaling and using linearity, we see that $$|l(f)| le M |f|_p^{1/p}$$
with $M= delta^{-1}$. Now decompose $[a,b]$ in $n$ disjoint intervals $I_1,ldots,I_n$ with lenght $(b-a)/n$. Then we have
$$|l(1_{[a,b]})| le sum_{k=1}^n |l(1_{I_i})| le nM |l(1_{I_i})|_p = (b-a)^{1/p} n^{1-1/p}.$$
Since $0<p<1$, we see that $1-1/p$ is negative. Thus, letting $n rightarrow infty$, we get $l(1_{[a,b]}) =0$. Since all linear combinations of such intervals are dense in $L^p$ (also for $0<p<1$), we see that $l$ is trivial.
add a comment |
This question surely was already answered here. In the case $0 <p <1$ the usual definition of the $L^p$-norm is not a norm, because the $Delta$-inequality isn't satisfied. If $0< p <1$ the space $L^p(mathbb{R})$ is only a metric space with invariant metric given by
$$|f|_p := int |f|^p d lambda.$$
If $l$ is a continuous functional, we know that $|l(f)| < 1$ for $f in B_delta(0)$ and some $delta >0$. By rescaling and using linearity, we see that $$|l(f)| le M |f|_p^{1/p}$$
with $M= delta^{-1}$. Now decompose $[a,b]$ in $n$ disjoint intervals $I_1,ldots,I_n$ with lenght $(b-a)/n$. Then we have
$$|l(1_{[a,b]})| le sum_{k=1}^n |l(1_{I_i})| le nM |l(1_{I_i})|_p = (b-a)^{1/p} n^{1-1/p}.$$
Since $0<p<1$, we see that $1-1/p$ is negative. Thus, letting $n rightarrow infty$, we get $l(1_{[a,b]}) =0$. Since all linear combinations of such intervals are dense in $L^p$ (also for $0<p<1$), we see that $l$ is trivial.
This question surely was already answered here. In the case $0 <p <1$ the usual definition of the $L^p$-norm is not a norm, because the $Delta$-inequality isn't satisfied. If $0< p <1$ the space $L^p(mathbb{R})$ is only a metric space with invariant metric given by
$$|f|_p := int |f|^p d lambda.$$
If $l$ is a continuous functional, we know that $|l(f)| < 1$ for $f in B_delta(0)$ and some $delta >0$. By rescaling and using linearity, we see that $$|l(f)| le M |f|_p^{1/p}$$
with $M= delta^{-1}$. Now decompose $[a,b]$ in $n$ disjoint intervals $I_1,ldots,I_n$ with lenght $(b-a)/n$. Then we have
$$|l(1_{[a,b]})| le sum_{k=1}^n |l(1_{I_i})| le nM |l(1_{I_i})|_p = (b-a)^{1/p} n^{1-1/p}.$$
Since $0<p<1$, we see that $1-1/p$ is negative. Thus, letting $n rightarrow infty$, we get $l(1_{[a,b]}) =0$. Since all linear combinations of such intervals are dense in $L^p$ (also for $0<p<1$), we see that $l$ is trivial.
answered Nov 22 '18 at 15:47
p4sch
4,770217
4,770217
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%2f3007297%2fthere-are-no-bounded-linear-functional-on-lp-mathbbr-if-0p1%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