supremum of a function with integral
$begingroup$
Let $mathcal F$ be the set of continuous functions $f:[0,1]to mathbb R$ and $max_{0le xle1} |f(x)|=1$. Now let $mathcal I:mathcal Fto R,mathcal I(f)=int_0^1f(x)dx-f(0)+f(1)$. Firstly I had to show $mathcal I(f)<3,forall f in mathcal F$ and this is pretty easy. Now I have to determine $sup({mathcal I(f)}|fin mathcal F)$. Doesn't result that the supremum is $3$ from the statement before? I know that I am surely wrong. Can somebody give me some tips on how can I get the supremum, please?
calculus supremum-and-infimum
$endgroup$
add a comment |
$begingroup$
Let $mathcal F$ be the set of continuous functions $f:[0,1]to mathbb R$ and $max_{0le xle1} |f(x)|=1$. Now let $mathcal I:mathcal Fto R,mathcal I(f)=int_0^1f(x)dx-f(0)+f(1)$. Firstly I had to show $mathcal I(f)<3,forall f in mathcal F$ and this is pretty easy. Now I have to determine $sup({mathcal I(f)}|fin mathcal F)$. Doesn't result that the supremum is $3$ from the statement before? I know that I am surely wrong. Can somebody give me some tips on how can I get the supremum, please?
calculus supremum-and-infimum
$endgroup$
add a comment |
$begingroup$
Let $mathcal F$ be the set of continuous functions $f:[0,1]to mathbb R$ and $max_{0le xle1} |f(x)|=1$. Now let $mathcal I:mathcal Fto R,mathcal I(f)=int_0^1f(x)dx-f(0)+f(1)$. Firstly I had to show $mathcal I(f)<3,forall f in mathcal F$ and this is pretty easy. Now I have to determine $sup({mathcal I(f)}|fin mathcal F)$. Doesn't result that the supremum is $3$ from the statement before? I know that I am surely wrong. Can somebody give me some tips on how can I get the supremum, please?
calculus supremum-and-infimum
$endgroup$
Let $mathcal F$ be the set of continuous functions $f:[0,1]to mathbb R$ and $max_{0le xle1} |f(x)|=1$. Now let $mathcal I:mathcal Fto R,mathcal I(f)=int_0^1f(x)dx-f(0)+f(1)$. Firstly I had to show $mathcal I(f)<3,forall f in mathcal F$ and this is pretty easy. Now I have to determine $sup({mathcal I(f)}|fin mathcal F)$. Doesn't result that the supremum is $3$ from the statement before? I know that I am surely wrong. Can somebody give me some tips on how can I get the supremum, please?
calculus supremum-and-infimum
calculus supremum-and-infimum
edited Jan 31 at 18:45


Julián Aguirre
69.5k24297
69.5k24297
asked Jan 31 at 18:01
GaboruGaboru
5078
5078
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The fact that $mathcal I(f)<3$ implies that $sup{mathcal I(f)mid fin mathcal F}le3$. To show that the supremum is equal to $3$, you have to find for every $epsilon>0$ a function $finmathcal F$ such that $mathcal I(f)ge3-epsilon$. This can be done for instance with functions like
$$
f_delta(x)=begin{cases}
dfrac{2}{delta},x-1 & 0le xledelta,\
1 & delta<xle1.
end{cases}
$$
$endgroup$
add a comment |
$begingroup$
obvious part is that $forall fin mathcal F $
$$|mathcal I(f) | leq |int_0^1f(x)dx|+|f(0)|+|f(1)| leq 1+1+1leq 3$$
inequality here is not strict ( $leq$ instead of $<$)
Thus, we have shown that $sup({mathcal I(f)}|fin mathcal F) leq 3$
To prove that it is equal to 3 we need to find a function $g$ or a sequence $g_n$ of functions in $mathcal F $, such that
$$mathcal I(g) = 3; quad or quad lim_{n rightarrow infty} mathcal I(g_n) = 3$$
(this would prove that $sup({mathcal I(f)}|fin mathcal F) geq 3$, which would solve the problem)
First thing that comes to mind is the function $g$ defined as $g(t) = 1, ; forall t in (0, 1]$ and $g(0)=-1$. Then $mathcal I(g)$ would be equal to 3, but function $g$ is not contionious.
Only one step is left to complete the solution: approximate $g$ with a sequence $g_n$ of functions from $mathcal F$ such that $lim_{n rightarrow infty} mathcal I(g_n) = 3$
$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%2f3095237%2fsupremum-of-a-function-with-integral%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$
The fact that $mathcal I(f)<3$ implies that $sup{mathcal I(f)mid fin mathcal F}le3$. To show that the supremum is equal to $3$, you have to find for every $epsilon>0$ a function $finmathcal F$ such that $mathcal I(f)ge3-epsilon$. This can be done for instance with functions like
$$
f_delta(x)=begin{cases}
dfrac{2}{delta},x-1 & 0le xledelta,\
1 & delta<xle1.
end{cases}
$$
$endgroup$
add a comment |
$begingroup$
The fact that $mathcal I(f)<3$ implies that $sup{mathcal I(f)mid fin mathcal F}le3$. To show that the supremum is equal to $3$, you have to find for every $epsilon>0$ a function $finmathcal F$ such that $mathcal I(f)ge3-epsilon$. This can be done for instance with functions like
$$
f_delta(x)=begin{cases}
dfrac{2}{delta},x-1 & 0le xledelta,\
1 & delta<xle1.
end{cases}
$$
$endgroup$
add a comment |
$begingroup$
The fact that $mathcal I(f)<3$ implies that $sup{mathcal I(f)mid fin mathcal F}le3$. To show that the supremum is equal to $3$, you have to find for every $epsilon>0$ a function $finmathcal F$ such that $mathcal I(f)ge3-epsilon$. This can be done for instance with functions like
$$
f_delta(x)=begin{cases}
dfrac{2}{delta},x-1 & 0le xledelta,\
1 & delta<xle1.
end{cases}
$$
$endgroup$
The fact that $mathcal I(f)<3$ implies that $sup{mathcal I(f)mid fin mathcal F}le3$. To show that the supremum is equal to $3$, you have to find for every $epsilon>0$ a function $finmathcal F$ such that $mathcal I(f)ge3-epsilon$. This can be done for instance with functions like
$$
f_delta(x)=begin{cases}
dfrac{2}{delta},x-1 & 0le xledelta,\
1 & delta<xle1.
end{cases}
$$
answered Jan 31 at 18:52


Julián AguirreJulián Aguirre
69.5k24297
69.5k24297
add a comment |
add a comment |
$begingroup$
obvious part is that $forall fin mathcal F $
$$|mathcal I(f) | leq |int_0^1f(x)dx|+|f(0)|+|f(1)| leq 1+1+1leq 3$$
inequality here is not strict ( $leq$ instead of $<$)
Thus, we have shown that $sup({mathcal I(f)}|fin mathcal F) leq 3$
To prove that it is equal to 3 we need to find a function $g$ or a sequence $g_n$ of functions in $mathcal F $, such that
$$mathcal I(g) = 3; quad or quad lim_{n rightarrow infty} mathcal I(g_n) = 3$$
(this would prove that $sup({mathcal I(f)}|fin mathcal F) geq 3$, which would solve the problem)
First thing that comes to mind is the function $g$ defined as $g(t) = 1, ; forall t in (0, 1]$ and $g(0)=-1$. Then $mathcal I(g)$ would be equal to 3, but function $g$ is not contionious.
Only one step is left to complete the solution: approximate $g$ with a sequence $g_n$ of functions from $mathcal F$ such that $lim_{n rightarrow infty} mathcal I(g_n) = 3$
$endgroup$
add a comment |
$begingroup$
obvious part is that $forall fin mathcal F $
$$|mathcal I(f) | leq |int_0^1f(x)dx|+|f(0)|+|f(1)| leq 1+1+1leq 3$$
inequality here is not strict ( $leq$ instead of $<$)
Thus, we have shown that $sup({mathcal I(f)}|fin mathcal F) leq 3$
To prove that it is equal to 3 we need to find a function $g$ or a sequence $g_n$ of functions in $mathcal F $, such that
$$mathcal I(g) = 3; quad or quad lim_{n rightarrow infty} mathcal I(g_n) = 3$$
(this would prove that $sup({mathcal I(f)}|fin mathcal F) geq 3$, which would solve the problem)
First thing that comes to mind is the function $g$ defined as $g(t) = 1, ; forall t in (0, 1]$ and $g(0)=-1$. Then $mathcal I(g)$ would be equal to 3, but function $g$ is not contionious.
Only one step is left to complete the solution: approximate $g$ with a sequence $g_n$ of functions from $mathcal F$ such that $lim_{n rightarrow infty} mathcal I(g_n) = 3$
$endgroup$
add a comment |
$begingroup$
obvious part is that $forall fin mathcal F $
$$|mathcal I(f) | leq |int_0^1f(x)dx|+|f(0)|+|f(1)| leq 1+1+1leq 3$$
inequality here is not strict ( $leq$ instead of $<$)
Thus, we have shown that $sup({mathcal I(f)}|fin mathcal F) leq 3$
To prove that it is equal to 3 we need to find a function $g$ or a sequence $g_n$ of functions in $mathcal F $, such that
$$mathcal I(g) = 3; quad or quad lim_{n rightarrow infty} mathcal I(g_n) = 3$$
(this would prove that $sup({mathcal I(f)}|fin mathcal F) geq 3$, which would solve the problem)
First thing that comes to mind is the function $g$ defined as $g(t) = 1, ; forall t in (0, 1]$ and $g(0)=-1$. Then $mathcal I(g)$ would be equal to 3, but function $g$ is not contionious.
Only one step is left to complete the solution: approximate $g$ with a sequence $g_n$ of functions from $mathcal F$ such that $lim_{n rightarrow infty} mathcal I(g_n) = 3$
$endgroup$
obvious part is that $forall fin mathcal F $
$$|mathcal I(f) | leq |int_0^1f(x)dx|+|f(0)|+|f(1)| leq 1+1+1leq 3$$
inequality here is not strict ( $leq$ instead of $<$)
Thus, we have shown that $sup({mathcal I(f)}|fin mathcal F) leq 3$
To prove that it is equal to 3 we need to find a function $g$ or a sequence $g_n$ of functions in $mathcal F $, such that
$$mathcal I(g) = 3; quad or quad lim_{n rightarrow infty} mathcal I(g_n) = 3$$
(this would prove that $sup({mathcal I(f)}|fin mathcal F) geq 3$, which would solve the problem)
First thing that comes to mind is the function $g$ defined as $g(t) = 1, ; forall t in (0, 1]$ and $g(0)=-1$. Then $mathcal I(g)$ would be equal to 3, but function $g$ is not contionious.
Only one step is left to complete the solution: approximate $g$ with a sequence $g_n$ of functions from $mathcal F$ such that $lim_{n rightarrow infty} mathcal I(g_n) = 3$
answered Jan 31 at 19:02
asdfasdf
561
561
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%2f3095237%2fsupremum-of-a-function-with-integral%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