Extreme value theorem: help with contradiction
$begingroup$
I have a problem understanding the last part of the usual proof of the extreme value theorem (found for example here: Extreme Value Theorem proof help)
It is this part that I have trouble understanding:
Since $g(x)=dfrac1{M−f(x)}leq K$ is equivalent to $f(x)leq M−dfrac1K$, we have contradicted the fact that $M$ was assumed to be the least upper bound of $f$ on $[a,b]$. Hence, there must be a balue $cin[a,b]$ such that $f(c)=M$.
Why is it that we are sure that there exist a c on the interval where the maximum is attained? I mean, don't we just know that the new sup is $M-dfrac1K$, but that it necessarily will not attain a max on the interval? Or do we have to assume that the function $g$ that we create attains a maximum for $f$ to attain a maximum?
real-analysis proof-explanation extreme-value-theorem
$endgroup$
add a comment |
$begingroup$
I have a problem understanding the last part of the usual proof of the extreme value theorem (found for example here: Extreme Value Theorem proof help)
It is this part that I have trouble understanding:
Since $g(x)=dfrac1{M−f(x)}leq K$ is equivalent to $f(x)leq M−dfrac1K$, we have contradicted the fact that $M$ was assumed to be the least upper bound of $f$ on $[a,b]$. Hence, there must be a balue $cin[a,b]$ such that $f(c)=M$.
Why is it that we are sure that there exist a c on the interval where the maximum is attained? I mean, don't we just know that the new sup is $M-dfrac1K$, but that it necessarily will not attain a max on the interval? Or do we have to assume that the function $g$ that we create attains a maximum for $f$ to attain a maximum?
real-analysis proof-explanation extreme-value-theorem
$endgroup$
add a comment |
$begingroup$
I have a problem understanding the last part of the usual proof of the extreme value theorem (found for example here: Extreme Value Theorem proof help)
It is this part that I have trouble understanding:
Since $g(x)=dfrac1{M−f(x)}leq K$ is equivalent to $f(x)leq M−dfrac1K$, we have contradicted the fact that $M$ was assumed to be the least upper bound of $f$ on $[a,b]$. Hence, there must be a balue $cin[a,b]$ such that $f(c)=M$.
Why is it that we are sure that there exist a c on the interval where the maximum is attained? I mean, don't we just know that the new sup is $M-dfrac1K$, but that it necessarily will not attain a max on the interval? Or do we have to assume that the function $g$ that we create attains a maximum for $f$ to attain a maximum?
real-analysis proof-explanation extreme-value-theorem
$endgroup$
I have a problem understanding the last part of the usual proof of the extreme value theorem (found for example here: Extreme Value Theorem proof help)
It is this part that I have trouble understanding:
Since $g(x)=dfrac1{M−f(x)}leq K$ is equivalent to $f(x)leq M−dfrac1K$, we have contradicted the fact that $M$ was assumed to be the least upper bound of $f$ on $[a,b]$. Hence, there must be a balue $cin[a,b]$ such that $f(c)=M$.
Why is it that we are sure that there exist a c on the interval where the maximum is attained? I mean, don't we just know that the new sup is $M-dfrac1K$, but that it necessarily will not attain a max on the interval? Or do we have to assume that the function $g$ that we create attains a maximum for $f$ to attain a maximum?
real-analysis proof-explanation extreme-value-theorem
real-analysis proof-explanation extreme-value-theorem
edited Jan 11 at 11:23


José Carlos Santos
160k22126232
160k22126232
asked Jan 11 at 11:14
user5744148user5744148
112
112
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Because we don't have a new $sup f$. By definition, $M=sup f$ and that proof proves that if there was no such $c$, then we would have $bigl(forall xin[a,b]bigr):f(x)leqslant M-frac1K$, which is impossible, because it would follow from that that $sup fleqslant M-frac1K<M=sup f.$$$
$endgroup$
$begingroup$
Okey, so the existence of the contradiction of that M is not the sup, also contradicts our assumption that f does not attain a maximum on the interval?
$endgroup$
– user5744148
Jan 11 at 11:50
$begingroup$
Yes, that's it.
$endgroup$
– José Carlos Santos
Jan 11 at 11:53
$begingroup$
So, is that because of the nature of the contradiction proof. That if one our assumptions is proved wrong, then all of our assumptions are wrong?
$endgroup$
– user5744148
Jan 11 at 12:12
$begingroup$
No. We make an assumption. Then, if we deduce from it a statement that we know that it is false, the assumption is false.
$endgroup$
– José Carlos Santos
Jan 11 at 12:14
add a comment |
$begingroup$
We have $M= sup f([a,b])$. If we assume that there is no $c in [a,b]$ with $f(c)=M$, then we have $f(x) <M$ for all $x in [a,b]$ . In the above proof this leads to $f(x) le M- frac{1}{K}$ for all $x in [a,b]$. Hence
$M = sup f([a,b]) le M- frac{1}{K}$, a contradiction.
$endgroup$
$begingroup$
Yes, it is that contradiction that I have a problem with. How come that we can say that just because we have found a contradiction regarding the sup, we can also say that it is a contradiction of our assumption that f does not attain a maximum?
$endgroup$
– user5744148
Jan 11 at 11:53
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%2f3069726%2fextreme-value-theorem-help-with-contradiction%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$
Because we don't have a new $sup f$. By definition, $M=sup f$ and that proof proves that if there was no such $c$, then we would have $bigl(forall xin[a,b]bigr):f(x)leqslant M-frac1K$, which is impossible, because it would follow from that that $sup fleqslant M-frac1K<M=sup f.$$$
$endgroup$
$begingroup$
Okey, so the existence of the contradiction of that M is not the sup, also contradicts our assumption that f does not attain a maximum on the interval?
$endgroup$
– user5744148
Jan 11 at 11:50
$begingroup$
Yes, that's it.
$endgroup$
– José Carlos Santos
Jan 11 at 11:53
$begingroup$
So, is that because of the nature of the contradiction proof. That if one our assumptions is proved wrong, then all of our assumptions are wrong?
$endgroup$
– user5744148
Jan 11 at 12:12
$begingroup$
No. We make an assumption. Then, if we deduce from it a statement that we know that it is false, the assumption is false.
$endgroup$
– José Carlos Santos
Jan 11 at 12:14
add a comment |
$begingroup$
Because we don't have a new $sup f$. By definition, $M=sup f$ and that proof proves that if there was no such $c$, then we would have $bigl(forall xin[a,b]bigr):f(x)leqslant M-frac1K$, which is impossible, because it would follow from that that $sup fleqslant M-frac1K<M=sup f.$$$
$endgroup$
$begingroup$
Okey, so the existence of the contradiction of that M is not the sup, also contradicts our assumption that f does not attain a maximum on the interval?
$endgroup$
– user5744148
Jan 11 at 11:50
$begingroup$
Yes, that's it.
$endgroup$
– José Carlos Santos
Jan 11 at 11:53
$begingroup$
So, is that because of the nature of the contradiction proof. That if one our assumptions is proved wrong, then all of our assumptions are wrong?
$endgroup$
– user5744148
Jan 11 at 12:12
$begingroup$
No. We make an assumption. Then, if we deduce from it a statement that we know that it is false, the assumption is false.
$endgroup$
– José Carlos Santos
Jan 11 at 12:14
add a comment |
$begingroup$
Because we don't have a new $sup f$. By definition, $M=sup f$ and that proof proves that if there was no such $c$, then we would have $bigl(forall xin[a,b]bigr):f(x)leqslant M-frac1K$, which is impossible, because it would follow from that that $sup fleqslant M-frac1K<M=sup f.$$$
$endgroup$
Because we don't have a new $sup f$. By definition, $M=sup f$ and that proof proves that if there was no such $c$, then we would have $bigl(forall xin[a,b]bigr):f(x)leqslant M-frac1K$, which is impossible, because it would follow from that that $sup fleqslant M-frac1K<M=sup f.$$$
answered Jan 11 at 11:21


José Carlos SantosJosé Carlos Santos
160k22126232
160k22126232
$begingroup$
Okey, so the existence of the contradiction of that M is not the sup, also contradicts our assumption that f does not attain a maximum on the interval?
$endgroup$
– user5744148
Jan 11 at 11:50
$begingroup$
Yes, that's it.
$endgroup$
– José Carlos Santos
Jan 11 at 11:53
$begingroup$
So, is that because of the nature of the contradiction proof. That if one our assumptions is proved wrong, then all of our assumptions are wrong?
$endgroup$
– user5744148
Jan 11 at 12:12
$begingroup$
No. We make an assumption. Then, if we deduce from it a statement that we know that it is false, the assumption is false.
$endgroup$
– José Carlos Santos
Jan 11 at 12:14
add a comment |
$begingroup$
Okey, so the existence of the contradiction of that M is not the sup, also contradicts our assumption that f does not attain a maximum on the interval?
$endgroup$
– user5744148
Jan 11 at 11:50
$begingroup$
Yes, that's it.
$endgroup$
– José Carlos Santos
Jan 11 at 11:53
$begingroup$
So, is that because of the nature of the contradiction proof. That if one our assumptions is proved wrong, then all of our assumptions are wrong?
$endgroup$
– user5744148
Jan 11 at 12:12
$begingroup$
No. We make an assumption. Then, if we deduce from it a statement that we know that it is false, the assumption is false.
$endgroup$
– José Carlos Santos
Jan 11 at 12:14
$begingroup$
Okey, so the existence of the contradiction of that M is not the sup, also contradicts our assumption that f does not attain a maximum on the interval?
$endgroup$
– user5744148
Jan 11 at 11:50
$begingroup$
Okey, so the existence of the contradiction of that M is not the sup, also contradicts our assumption that f does not attain a maximum on the interval?
$endgroup$
– user5744148
Jan 11 at 11:50
$begingroup$
Yes, that's it.
$endgroup$
– José Carlos Santos
Jan 11 at 11:53
$begingroup$
Yes, that's it.
$endgroup$
– José Carlos Santos
Jan 11 at 11:53
$begingroup$
So, is that because of the nature of the contradiction proof. That if one our assumptions is proved wrong, then all of our assumptions are wrong?
$endgroup$
– user5744148
Jan 11 at 12:12
$begingroup$
So, is that because of the nature of the contradiction proof. That if one our assumptions is proved wrong, then all of our assumptions are wrong?
$endgroup$
– user5744148
Jan 11 at 12:12
$begingroup$
No. We make an assumption. Then, if we deduce from it a statement that we know that it is false, the assumption is false.
$endgroup$
– José Carlos Santos
Jan 11 at 12:14
$begingroup$
No. We make an assumption. Then, if we deduce from it a statement that we know that it is false, the assumption is false.
$endgroup$
– José Carlos Santos
Jan 11 at 12:14
add a comment |
$begingroup$
We have $M= sup f([a,b])$. If we assume that there is no $c in [a,b]$ with $f(c)=M$, then we have $f(x) <M$ for all $x in [a,b]$ . In the above proof this leads to $f(x) le M- frac{1}{K}$ for all $x in [a,b]$. Hence
$M = sup f([a,b]) le M- frac{1}{K}$, a contradiction.
$endgroup$
$begingroup$
Yes, it is that contradiction that I have a problem with. How come that we can say that just because we have found a contradiction regarding the sup, we can also say that it is a contradiction of our assumption that f does not attain a maximum?
$endgroup$
– user5744148
Jan 11 at 11:53
add a comment |
$begingroup$
We have $M= sup f([a,b])$. If we assume that there is no $c in [a,b]$ with $f(c)=M$, then we have $f(x) <M$ for all $x in [a,b]$ . In the above proof this leads to $f(x) le M- frac{1}{K}$ for all $x in [a,b]$. Hence
$M = sup f([a,b]) le M- frac{1}{K}$, a contradiction.
$endgroup$
$begingroup$
Yes, it is that contradiction that I have a problem with. How come that we can say that just because we have found a contradiction regarding the sup, we can also say that it is a contradiction of our assumption that f does not attain a maximum?
$endgroup$
– user5744148
Jan 11 at 11:53
add a comment |
$begingroup$
We have $M= sup f([a,b])$. If we assume that there is no $c in [a,b]$ with $f(c)=M$, then we have $f(x) <M$ for all $x in [a,b]$ . In the above proof this leads to $f(x) le M- frac{1}{K}$ for all $x in [a,b]$. Hence
$M = sup f([a,b]) le M- frac{1}{K}$, a contradiction.
$endgroup$
We have $M= sup f([a,b])$. If we assume that there is no $c in [a,b]$ with $f(c)=M$, then we have $f(x) <M$ for all $x in [a,b]$ . In the above proof this leads to $f(x) le M- frac{1}{K}$ for all $x in [a,b]$. Hence
$M = sup f([a,b]) le M- frac{1}{K}$, a contradiction.
answered Jan 11 at 11:22


FredFred
46k1848
46k1848
$begingroup$
Yes, it is that contradiction that I have a problem with. How come that we can say that just because we have found a contradiction regarding the sup, we can also say that it is a contradiction of our assumption that f does not attain a maximum?
$endgroup$
– user5744148
Jan 11 at 11:53
add a comment |
$begingroup$
Yes, it is that contradiction that I have a problem with. How come that we can say that just because we have found a contradiction regarding the sup, we can also say that it is a contradiction of our assumption that f does not attain a maximum?
$endgroup$
– user5744148
Jan 11 at 11:53
$begingroup$
Yes, it is that contradiction that I have a problem with. How come that we can say that just because we have found a contradiction regarding the sup, we can also say that it is a contradiction of our assumption that f does not attain a maximum?
$endgroup$
– user5744148
Jan 11 at 11:53
$begingroup$
Yes, it is that contradiction that I have a problem with. How come that we can say that just because we have found a contradiction regarding the sup, we can also say that it is a contradiction of our assumption that f does not attain a maximum?
$endgroup$
– user5744148
Jan 11 at 11:53
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%2f3069726%2fextreme-value-theorem-help-with-contradiction%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