Part of proof that supremum norm is (positive) definite. $||f||_infty =0 implies f=0$.
$begingroup$
I want to prove that for a bounded function $f$, we have:
$$ ||f||_infty =0 implies f=0. $$
Simply observe that if we denote the domain of definition by $D$:
$$ ||f||_infty = sup_{x in D}|f(x)|$$
We know that the supremum is the least upper bound, so for any $y in D $:
$$ |f(y)| leq sup_{x in D} |f(x)|=0$$
But we also know that the Euclidean metric is positive definite, so
$|f(y) |geq 0$, and we get that for all $y in D$ we have $|f(y)|=0$, but now again by positive definiteness:
$$|f(y)|=0 iff f(y)=0.$$
Is my reasoning correct?
real-analysis proof-verification supremum-and-infimum
$endgroup$
add a comment |
$begingroup$
I want to prove that for a bounded function $f$, we have:
$$ ||f||_infty =0 implies f=0. $$
Simply observe that if we denote the domain of definition by $D$:
$$ ||f||_infty = sup_{x in D}|f(x)|$$
We know that the supremum is the least upper bound, so for any $y in D $:
$$ |f(y)| leq sup_{x in D} |f(x)|=0$$
But we also know that the Euclidean metric is positive definite, so
$|f(y) |geq 0$, and we get that for all $y in D$ we have $|f(y)|=0$, but now again by positive definiteness:
$$|f(y)|=0 iff f(y)=0.$$
Is my reasoning correct?
real-analysis proof-verification supremum-and-infimum
$endgroup$
1
$begingroup$
It's correct, but for a proof this simple I would want to see the dummy variable that is being dropped from the argument: If $Vert fVert_{infty}=0$ then $0=Vert fVert_{infty}=sup_{x}|f(x)|geq|f(y)|$ for any $y$.
$endgroup$
– parsiad
Dec 16 '18 at 21:38
1
$begingroup$
This is Quite OK.
$endgroup$
– szw1710
Dec 16 '18 at 21:38
$begingroup$
Is this what you meant? I think that's a useful addition parsiad.
$endgroup$
– Wesley Strik
Dec 16 '18 at 21:40
add a comment |
$begingroup$
I want to prove that for a bounded function $f$, we have:
$$ ||f||_infty =0 implies f=0. $$
Simply observe that if we denote the domain of definition by $D$:
$$ ||f||_infty = sup_{x in D}|f(x)|$$
We know that the supremum is the least upper bound, so for any $y in D $:
$$ |f(y)| leq sup_{x in D} |f(x)|=0$$
But we also know that the Euclidean metric is positive definite, so
$|f(y) |geq 0$, and we get that for all $y in D$ we have $|f(y)|=0$, but now again by positive definiteness:
$$|f(y)|=0 iff f(y)=0.$$
Is my reasoning correct?
real-analysis proof-verification supremum-and-infimum
$endgroup$
I want to prove that for a bounded function $f$, we have:
$$ ||f||_infty =0 implies f=0. $$
Simply observe that if we denote the domain of definition by $D$:
$$ ||f||_infty = sup_{x in D}|f(x)|$$
We know that the supremum is the least upper bound, so for any $y in D $:
$$ |f(y)| leq sup_{x in D} |f(x)|=0$$
But we also know that the Euclidean metric is positive definite, so
$|f(y) |geq 0$, and we get that for all $y in D$ we have $|f(y)|=0$, but now again by positive definiteness:
$$|f(y)|=0 iff f(y)=0.$$
Is my reasoning correct?
real-analysis proof-verification supremum-and-infimum
real-analysis proof-verification supremum-and-infimum
edited Dec 16 '18 at 22:35
Wesley Strik
asked Dec 16 '18 at 21:30
Wesley StrikWesley Strik
2,017423
2,017423
1
$begingroup$
It's correct, but for a proof this simple I would want to see the dummy variable that is being dropped from the argument: If $Vert fVert_{infty}=0$ then $0=Vert fVert_{infty}=sup_{x}|f(x)|geq|f(y)|$ for any $y$.
$endgroup$
– parsiad
Dec 16 '18 at 21:38
1
$begingroup$
This is Quite OK.
$endgroup$
– szw1710
Dec 16 '18 at 21:38
$begingroup$
Is this what you meant? I think that's a useful addition parsiad.
$endgroup$
– Wesley Strik
Dec 16 '18 at 21:40
add a comment |
1
$begingroup$
It's correct, but for a proof this simple I would want to see the dummy variable that is being dropped from the argument: If $Vert fVert_{infty}=0$ then $0=Vert fVert_{infty}=sup_{x}|f(x)|geq|f(y)|$ for any $y$.
$endgroup$
– parsiad
Dec 16 '18 at 21:38
1
$begingroup$
This is Quite OK.
$endgroup$
– szw1710
Dec 16 '18 at 21:38
$begingroup$
Is this what you meant? I think that's a useful addition parsiad.
$endgroup$
– Wesley Strik
Dec 16 '18 at 21:40
1
1
$begingroup$
It's correct, but for a proof this simple I would want to see the dummy variable that is being dropped from the argument: If $Vert fVert_{infty}=0$ then $0=Vert fVert_{infty}=sup_{x}|f(x)|geq|f(y)|$ for any $y$.
$endgroup$
– parsiad
Dec 16 '18 at 21:38
$begingroup$
It's correct, but for a proof this simple I would want to see the dummy variable that is being dropped from the argument: If $Vert fVert_{infty}=0$ then $0=Vert fVert_{infty}=sup_{x}|f(x)|geq|f(y)|$ for any $y$.
$endgroup$
– parsiad
Dec 16 '18 at 21:38
1
1
$begingroup$
This is Quite OK.
$endgroup$
– szw1710
Dec 16 '18 at 21:38
$begingroup$
This is Quite OK.
$endgroup$
– szw1710
Dec 16 '18 at 21:38
$begingroup$
Is this what you meant? I think that's a useful addition parsiad.
$endgroup$
– Wesley Strik
Dec 16 '18 at 21:40
$begingroup$
Is this what you meant? I think that's a useful addition parsiad.
$endgroup$
– Wesley Strik
Dec 16 '18 at 21:40
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes it is correct, alternatively, as suggested by Quiliup, We can immediately conclude that since for all $y in D$ $$|f(y)|leq 0$$
By positive definiteness of the Euclidean norm it must hold that for all $y in D$ we have $|f(y)|=0$ and hence $f(y)=0$.
$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%2f3043193%2fpart-of-proof-that-supremum-norm-is-positive-definite-f-infty-0-impli%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$
Yes it is correct, alternatively, as suggested by Quiliup, We can immediately conclude that since for all $y in D$ $$|f(y)|leq 0$$
By positive definiteness of the Euclidean norm it must hold that for all $y in D$ we have $|f(y)|=0$ and hence $f(y)=0$.
$endgroup$
add a comment |
$begingroup$
Yes it is correct, alternatively, as suggested by Quiliup, We can immediately conclude that since for all $y in D$ $$|f(y)|leq 0$$
By positive definiteness of the Euclidean norm it must hold that for all $y in D$ we have $|f(y)|=0$ and hence $f(y)=0$.
$endgroup$
add a comment |
$begingroup$
Yes it is correct, alternatively, as suggested by Quiliup, We can immediately conclude that since for all $y in D$ $$|f(y)|leq 0$$
By positive definiteness of the Euclidean norm it must hold that for all $y in D$ we have $|f(y)|=0$ and hence $f(y)=0$.
$endgroup$
Yes it is correct, alternatively, as suggested by Quiliup, We can immediately conclude that since for all $y in D$ $$|f(y)|leq 0$$
By positive definiteness of the Euclidean norm it must hold that for all $y in D$ we have $|f(y)|=0$ and hence $f(y)=0$.
answered Dec 16 '18 at 23:16
Wesley StrikWesley Strik
2,017423
2,017423
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%2f3043193%2fpart-of-proof-that-supremum-norm-is-positive-definite-f-infty-0-impli%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
1
$begingroup$
It's correct, but for a proof this simple I would want to see the dummy variable that is being dropped from the argument: If $Vert fVert_{infty}=0$ then $0=Vert fVert_{infty}=sup_{x}|f(x)|geq|f(y)|$ for any $y$.
$endgroup$
– parsiad
Dec 16 '18 at 21:38
1
$begingroup$
This is Quite OK.
$endgroup$
– szw1710
Dec 16 '18 at 21:38
$begingroup$
Is this what you meant? I think that's a useful addition parsiad.
$endgroup$
– Wesley Strik
Dec 16 '18 at 21:40