Proving the Lp norm is a norm.
$begingroup$
I want to prove the $L_p$ norm on continuous functions is in fact a norm. I have proven definitiveness and homogeneity but am struggling with the triangle inequality. I am using the fact that if the closed unit ball is convex then the triangle inequality holds.
Attempt so far:
Let $f$,$g$ be two functions in the closed unit ball, let $h=af+(1-a)g$, for some $a in [0,1]$.
Then the $L_p$ norm of $h$ is
$$left(int|af+(1-a)g|^pright)^{1/p}$$
I think i want to try and decompose this into 2 components, one containing the integral of $f$, one containing the integral of $g$ but am unsure how to do this given the power of $p$.
Thanks in advance
Dan
real-analysis norm normed-spaces
$endgroup$
add a comment |
$begingroup$
I want to prove the $L_p$ norm on continuous functions is in fact a norm. I have proven definitiveness and homogeneity but am struggling with the triangle inequality. I am using the fact that if the closed unit ball is convex then the triangle inequality holds.
Attempt so far:
Let $f$,$g$ be two functions in the closed unit ball, let $h=af+(1-a)g$, for some $a in [0,1]$.
Then the $L_p$ norm of $h$ is
$$left(int|af+(1-a)g|^pright)^{1/p}$$
I think i want to try and decompose this into 2 components, one containing the integral of $f$, one containing the integral of $g$ but am unsure how to do this given the power of $p$.
Thanks in advance
Dan
real-analysis norm normed-spaces
$endgroup$
$begingroup$
Please use MathJax.
$endgroup$
– Morgan Rodgers
Jan 16 at 18:22
1
$begingroup$
How did such a poorly written post get upvoted in a matter of seconds ? Please, use MathJax to formulate your questions.
$endgroup$
– Rebellos
Jan 16 at 18:24
$begingroup$
what is mathjax?
$endgroup$
– user601175
Jan 16 at 18:24
$begingroup$
@user601175 I've edited MathJax into your post: you might want to take a look at the code for how it works.
$endgroup$
– user3482749
Jan 16 at 18:25
add a comment |
$begingroup$
I want to prove the $L_p$ norm on continuous functions is in fact a norm. I have proven definitiveness and homogeneity but am struggling with the triangle inequality. I am using the fact that if the closed unit ball is convex then the triangle inequality holds.
Attempt so far:
Let $f$,$g$ be two functions in the closed unit ball, let $h=af+(1-a)g$, for some $a in [0,1]$.
Then the $L_p$ norm of $h$ is
$$left(int|af+(1-a)g|^pright)^{1/p}$$
I think i want to try and decompose this into 2 components, one containing the integral of $f$, one containing the integral of $g$ but am unsure how to do this given the power of $p$.
Thanks in advance
Dan
real-analysis norm normed-spaces
$endgroup$
I want to prove the $L_p$ norm on continuous functions is in fact a norm. I have proven definitiveness and homogeneity but am struggling with the triangle inequality. I am using the fact that if the closed unit ball is convex then the triangle inequality holds.
Attempt so far:
Let $f$,$g$ be two functions in the closed unit ball, let $h=af+(1-a)g$, for some $a in [0,1]$.
Then the $L_p$ norm of $h$ is
$$left(int|af+(1-a)g|^pright)^{1/p}$$
I think i want to try and decompose this into 2 components, one containing the integral of $f$, one containing the integral of $g$ but am unsure how to do this given the power of $p$.
Thanks in advance
Dan
real-analysis norm normed-spaces
real-analysis norm normed-spaces
edited Jan 16 at 18:25
user3482749
4,3291119
4,3291119
asked Jan 16 at 18:20
user601175user601175
114
114
$begingroup$
Please use MathJax.
$endgroup$
– Morgan Rodgers
Jan 16 at 18:22
1
$begingroup$
How did such a poorly written post get upvoted in a matter of seconds ? Please, use MathJax to formulate your questions.
$endgroup$
– Rebellos
Jan 16 at 18:24
$begingroup$
what is mathjax?
$endgroup$
– user601175
Jan 16 at 18:24
$begingroup$
@user601175 I've edited MathJax into your post: you might want to take a look at the code for how it works.
$endgroup$
– user3482749
Jan 16 at 18:25
add a comment |
$begingroup$
Please use MathJax.
$endgroup$
– Morgan Rodgers
Jan 16 at 18:22
1
$begingroup$
How did such a poorly written post get upvoted in a matter of seconds ? Please, use MathJax to formulate your questions.
$endgroup$
– Rebellos
Jan 16 at 18:24
$begingroup$
what is mathjax?
$endgroup$
– user601175
Jan 16 at 18:24
$begingroup$
@user601175 I've edited MathJax into your post: you might want to take a look at the code for how it works.
$endgroup$
– user3482749
Jan 16 at 18:25
$begingroup$
Please use MathJax.
$endgroup$
– Morgan Rodgers
Jan 16 at 18:22
$begingroup$
Please use MathJax.
$endgroup$
– Morgan Rodgers
Jan 16 at 18:22
1
1
$begingroup$
How did such a poorly written post get upvoted in a matter of seconds ? Please, use MathJax to formulate your questions.
$endgroup$
– Rebellos
Jan 16 at 18:24
$begingroup$
How did such a poorly written post get upvoted in a matter of seconds ? Please, use MathJax to formulate your questions.
$endgroup$
– Rebellos
Jan 16 at 18:24
$begingroup$
what is mathjax?
$endgroup$
– user601175
Jan 16 at 18:24
$begingroup$
what is mathjax?
$endgroup$
– user601175
Jan 16 at 18:24
$begingroup$
@user601175 I've edited MathJax into your post: you might want to take a look at the code for how it works.
$endgroup$
– user3482749
Jan 16 at 18:25
$begingroup$
@user601175 I've edited MathJax into your post: you might want to take a look at the code for how it works.
$endgroup$
– user3482749
Jan 16 at 18:25
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
There's a few ways to proceed. Probably the easiest is to not worry about the unit ball, and just prove the triangle inequality directly (that proof is available everywhere, for example on Wikipedia, if you want to look), but you asked for a version via convexity, so I'll give it a go:
First, note that $|af+(1-a)g|_{L_p} leq 1$ if and only if $|af+(1-a)g|_{L_p}^p leq 1$, so we'll deal with the latter, since it gets rid of that awkward power of $1/p$.
At this point, things are relatively easy: first, we note that $x mapsto x^p$ is convex on the non-negative real half-line (feel free to insert a proof of this here if you don't have one already), so (combining this with the triangle inequality for $|cdot|$) we have $|af(x)+(1-a)g(x)|^p leq left(a|f(x)| + (1-a)|g(x)| right)^pleq a|f(x)|^p + (1-a)|g(x)|^p$.
Thus, by standard properties of integrals, the definition of $|cdot|_{L_p}$, and the fact that $f$ and $g$ lie in the closed unit ball, we have
begin{align*}|af+(1-a)g|_{L_p}^p &= int |af(x)+(1-a)g(x)|^pmathrm{d}x \&leq int a|f(x)|^p+(1-a)|g(x)|^pmathrm{d}x
\&= aint|f(x)|^pmathrm{d}x + (1-a)int|g(x)|^pmathrm{d}x
\&= a|f|_{L_p}^p + (1-a)|g|_{L_p}^p
\&leq a + (1 -a)
\&= 1end{align*}
Thus, $|af+(1-a)g|_{L_p} leq 1$ also, so our open unit ball is convex, hence we have the triangle inequality.
$endgroup$
$begingroup$
Thank you very much, i didnt spot that x->x^p is convex
$endgroup$
– user601175
Jan 16 at 18:49
add a comment |
$begingroup$
I can't understand the intuition of taking some functions that belong in the closed unit ball, as $mathcal{L}^p$ is generally the space :
$$mathcal{L}^p = left{f:[a,b] to mathbb R, ; text{measurable} : left(int_a^b |f(x) |^pmathrm{d}xright)^{1/p}< + infty right}$$
Hint :
Let $f,g in mathcal{L}^P$. Then, it is :
begin{align*}
|f+g |_p & = left(int_a^b |f(x) + g(x)|^pmathrm{d}xright)^{1/p} \
&leq left(int_a^b left(|f(x)| + |g(x)| right)^p mathrm{d}x right)^{1/p}
end{align*}
$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%2f3076090%2fproving-the-lp-norm-is-a-norm%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There's a few ways to proceed. Probably the easiest is to not worry about the unit ball, and just prove the triangle inequality directly (that proof is available everywhere, for example on Wikipedia, if you want to look), but you asked for a version via convexity, so I'll give it a go:
First, note that $|af+(1-a)g|_{L_p} leq 1$ if and only if $|af+(1-a)g|_{L_p}^p leq 1$, so we'll deal with the latter, since it gets rid of that awkward power of $1/p$.
At this point, things are relatively easy: first, we note that $x mapsto x^p$ is convex on the non-negative real half-line (feel free to insert a proof of this here if you don't have one already), so (combining this with the triangle inequality for $|cdot|$) we have $|af(x)+(1-a)g(x)|^p leq left(a|f(x)| + (1-a)|g(x)| right)^pleq a|f(x)|^p + (1-a)|g(x)|^p$.
Thus, by standard properties of integrals, the definition of $|cdot|_{L_p}$, and the fact that $f$ and $g$ lie in the closed unit ball, we have
begin{align*}|af+(1-a)g|_{L_p}^p &= int |af(x)+(1-a)g(x)|^pmathrm{d}x \&leq int a|f(x)|^p+(1-a)|g(x)|^pmathrm{d}x
\&= aint|f(x)|^pmathrm{d}x + (1-a)int|g(x)|^pmathrm{d}x
\&= a|f|_{L_p}^p + (1-a)|g|_{L_p}^p
\&leq a + (1 -a)
\&= 1end{align*}
Thus, $|af+(1-a)g|_{L_p} leq 1$ also, so our open unit ball is convex, hence we have the triangle inequality.
$endgroup$
$begingroup$
Thank you very much, i didnt spot that x->x^p is convex
$endgroup$
– user601175
Jan 16 at 18:49
add a comment |
$begingroup$
There's a few ways to proceed. Probably the easiest is to not worry about the unit ball, and just prove the triangle inequality directly (that proof is available everywhere, for example on Wikipedia, if you want to look), but you asked for a version via convexity, so I'll give it a go:
First, note that $|af+(1-a)g|_{L_p} leq 1$ if and only if $|af+(1-a)g|_{L_p}^p leq 1$, so we'll deal with the latter, since it gets rid of that awkward power of $1/p$.
At this point, things are relatively easy: first, we note that $x mapsto x^p$ is convex on the non-negative real half-line (feel free to insert a proof of this here if you don't have one already), so (combining this with the triangle inequality for $|cdot|$) we have $|af(x)+(1-a)g(x)|^p leq left(a|f(x)| + (1-a)|g(x)| right)^pleq a|f(x)|^p + (1-a)|g(x)|^p$.
Thus, by standard properties of integrals, the definition of $|cdot|_{L_p}$, and the fact that $f$ and $g$ lie in the closed unit ball, we have
begin{align*}|af+(1-a)g|_{L_p}^p &= int |af(x)+(1-a)g(x)|^pmathrm{d}x \&leq int a|f(x)|^p+(1-a)|g(x)|^pmathrm{d}x
\&= aint|f(x)|^pmathrm{d}x + (1-a)int|g(x)|^pmathrm{d}x
\&= a|f|_{L_p}^p + (1-a)|g|_{L_p}^p
\&leq a + (1 -a)
\&= 1end{align*}
Thus, $|af+(1-a)g|_{L_p} leq 1$ also, so our open unit ball is convex, hence we have the triangle inequality.
$endgroup$
$begingroup$
Thank you very much, i didnt spot that x->x^p is convex
$endgroup$
– user601175
Jan 16 at 18:49
add a comment |
$begingroup$
There's a few ways to proceed. Probably the easiest is to not worry about the unit ball, and just prove the triangle inequality directly (that proof is available everywhere, for example on Wikipedia, if you want to look), but you asked for a version via convexity, so I'll give it a go:
First, note that $|af+(1-a)g|_{L_p} leq 1$ if and only if $|af+(1-a)g|_{L_p}^p leq 1$, so we'll deal with the latter, since it gets rid of that awkward power of $1/p$.
At this point, things are relatively easy: first, we note that $x mapsto x^p$ is convex on the non-negative real half-line (feel free to insert a proof of this here if you don't have one already), so (combining this with the triangle inequality for $|cdot|$) we have $|af(x)+(1-a)g(x)|^p leq left(a|f(x)| + (1-a)|g(x)| right)^pleq a|f(x)|^p + (1-a)|g(x)|^p$.
Thus, by standard properties of integrals, the definition of $|cdot|_{L_p}$, and the fact that $f$ and $g$ lie in the closed unit ball, we have
begin{align*}|af+(1-a)g|_{L_p}^p &= int |af(x)+(1-a)g(x)|^pmathrm{d}x \&leq int a|f(x)|^p+(1-a)|g(x)|^pmathrm{d}x
\&= aint|f(x)|^pmathrm{d}x + (1-a)int|g(x)|^pmathrm{d}x
\&= a|f|_{L_p}^p + (1-a)|g|_{L_p}^p
\&leq a + (1 -a)
\&= 1end{align*}
Thus, $|af+(1-a)g|_{L_p} leq 1$ also, so our open unit ball is convex, hence we have the triangle inequality.
$endgroup$
There's a few ways to proceed. Probably the easiest is to not worry about the unit ball, and just prove the triangle inequality directly (that proof is available everywhere, for example on Wikipedia, if you want to look), but you asked for a version via convexity, so I'll give it a go:
First, note that $|af+(1-a)g|_{L_p} leq 1$ if and only if $|af+(1-a)g|_{L_p}^p leq 1$, so we'll deal with the latter, since it gets rid of that awkward power of $1/p$.
At this point, things are relatively easy: first, we note that $x mapsto x^p$ is convex on the non-negative real half-line (feel free to insert a proof of this here if you don't have one already), so (combining this with the triangle inequality for $|cdot|$) we have $|af(x)+(1-a)g(x)|^p leq left(a|f(x)| + (1-a)|g(x)| right)^pleq a|f(x)|^p + (1-a)|g(x)|^p$.
Thus, by standard properties of integrals, the definition of $|cdot|_{L_p}$, and the fact that $f$ and $g$ lie in the closed unit ball, we have
begin{align*}|af+(1-a)g|_{L_p}^p &= int |af(x)+(1-a)g(x)|^pmathrm{d}x \&leq int a|f(x)|^p+(1-a)|g(x)|^pmathrm{d}x
\&= aint|f(x)|^pmathrm{d}x + (1-a)int|g(x)|^pmathrm{d}x
\&= a|f|_{L_p}^p + (1-a)|g|_{L_p}^p
\&leq a + (1 -a)
\&= 1end{align*}
Thus, $|af+(1-a)g|_{L_p} leq 1$ also, so our open unit ball is convex, hence we have the triangle inequality.
answered Jan 16 at 18:46
user3482749user3482749
4,3291119
4,3291119
$begingroup$
Thank you very much, i didnt spot that x->x^p is convex
$endgroup$
– user601175
Jan 16 at 18:49
add a comment |
$begingroup$
Thank you very much, i didnt spot that x->x^p is convex
$endgroup$
– user601175
Jan 16 at 18:49
$begingroup$
Thank you very much, i didnt spot that x->x^p is convex
$endgroup$
– user601175
Jan 16 at 18:49
$begingroup$
Thank you very much, i didnt spot that x->x^p is convex
$endgroup$
– user601175
Jan 16 at 18:49
add a comment |
$begingroup$
I can't understand the intuition of taking some functions that belong in the closed unit ball, as $mathcal{L}^p$ is generally the space :
$$mathcal{L}^p = left{f:[a,b] to mathbb R, ; text{measurable} : left(int_a^b |f(x) |^pmathrm{d}xright)^{1/p}< + infty right}$$
Hint :
Let $f,g in mathcal{L}^P$. Then, it is :
begin{align*}
|f+g |_p & = left(int_a^b |f(x) + g(x)|^pmathrm{d}xright)^{1/p} \
&leq left(int_a^b left(|f(x)| + |g(x)| right)^p mathrm{d}x right)^{1/p}
end{align*}
$endgroup$
add a comment |
$begingroup$
I can't understand the intuition of taking some functions that belong in the closed unit ball, as $mathcal{L}^p$ is generally the space :
$$mathcal{L}^p = left{f:[a,b] to mathbb R, ; text{measurable} : left(int_a^b |f(x) |^pmathrm{d}xright)^{1/p}< + infty right}$$
Hint :
Let $f,g in mathcal{L}^P$. Then, it is :
begin{align*}
|f+g |_p & = left(int_a^b |f(x) + g(x)|^pmathrm{d}xright)^{1/p} \
&leq left(int_a^b left(|f(x)| + |g(x)| right)^p mathrm{d}x right)^{1/p}
end{align*}
$endgroup$
add a comment |
$begingroup$
I can't understand the intuition of taking some functions that belong in the closed unit ball, as $mathcal{L}^p$ is generally the space :
$$mathcal{L}^p = left{f:[a,b] to mathbb R, ; text{measurable} : left(int_a^b |f(x) |^pmathrm{d}xright)^{1/p}< + infty right}$$
Hint :
Let $f,g in mathcal{L}^P$. Then, it is :
begin{align*}
|f+g |_p & = left(int_a^b |f(x) + g(x)|^pmathrm{d}xright)^{1/p} \
&leq left(int_a^b left(|f(x)| + |g(x)| right)^p mathrm{d}x right)^{1/p}
end{align*}
$endgroup$
I can't understand the intuition of taking some functions that belong in the closed unit ball, as $mathcal{L}^p$ is generally the space :
$$mathcal{L}^p = left{f:[a,b] to mathbb R, ; text{measurable} : left(int_a^b |f(x) |^pmathrm{d}xright)^{1/p}< + infty right}$$
Hint :
Let $f,g in mathcal{L}^P$. Then, it is :
begin{align*}
|f+g |_p & = left(int_a^b |f(x) + g(x)|^pmathrm{d}xright)^{1/p} \
&leq left(int_a^b left(|f(x)| + |g(x)| right)^p mathrm{d}x right)^{1/p}
end{align*}
answered Jan 16 at 18:32
RebellosRebellos
15.7k31250
15.7k31250
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%2f3076090%2fproving-the-lp-norm-is-a-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
$begingroup$
Please use MathJax.
$endgroup$
– Morgan Rodgers
Jan 16 at 18:22
1
$begingroup$
How did such a poorly written post get upvoted in a matter of seconds ? Please, use MathJax to formulate your questions.
$endgroup$
– Rebellos
Jan 16 at 18:24
$begingroup$
what is mathjax?
$endgroup$
– user601175
Jan 16 at 18:24
$begingroup$
@user601175 I've edited MathJax into your post: you might want to take a look at the code for how it works.
$endgroup$
– user3482749
Jan 16 at 18:25