Proving such a function is always constant
$begingroup$
Let $I subset R$ be an interval. Let $f : I to R$ be a continuous function.
Assume that $I := [a, b]$. Assume that for all $c, d in [a, b]$ such that $c < d$, there exists $e in [c,d]$ such that $f(e) = f(a)$ or $f(e) = f(b)$. Prove that $f$ is a constant.
Consider this statement: For all $c in [a,b], f(c) in {f(a),f(b)}$
I figured that proving this statement would allow me to prove the function to be constant, but I'm unable to do so. Any thoughts?
real-analysis
$endgroup$
add a comment |
$begingroup$
Let $I subset R$ be an interval. Let $f : I to R$ be a continuous function.
Assume that $I := [a, b]$. Assume that for all $c, d in [a, b]$ such that $c < d$, there exists $e in [c,d]$ such that $f(e) = f(a)$ or $f(e) = f(b)$. Prove that $f$ is a constant.
Consider this statement: For all $c in [a,b], f(c) in {f(a),f(b)}$
I figured that proving this statement would allow me to prove the function to be constant, but I'm unable to do so. Any thoughts?
real-analysis
$endgroup$
$begingroup$
Are (or were) you unable to prove the result from your statement, your statement from the given information or both?
$endgroup$
– PJTraill
Nov 22 '18 at 21:53
$begingroup$
The latter actually. @PJTraill
$endgroup$
– Ahmad Lamaa
Nov 23 '18 at 1:43
add a comment |
$begingroup$
Let $I subset R$ be an interval. Let $f : I to R$ be a continuous function.
Assume that $I := [a, b]$. Assume that for all $c, d in [a, b]$ such that $c < d$, there exists $e in [c,d]$ such that $f(e) = f(a)$ or $f(e) = f(b)$. Prove that $f$ is a constant.
Consider this statement: For all $c in [a,b], f(c) in {f(a),f(b)}$
I figured that proving this statement would allow me to prove the function to be constant, but I'm unable to do so. Any thoughts?
real-analysis
$endgroup$
Let $I subset R$ be an interval. Let $f : I to R$ be a continuous function.
Assume that $I := [a, b]$. Assume that for all $c, d in [a, b]$ such that $c < d$, there exists $e in [c,d]$ such that $f(e) = f(a)$ or $f(e) = f(b)$. Prove that $f$ is a constant.
Consider this statement: For all $c in [a,b], f(c) in {f(a),f(b)}$
I figured that proving this statement would allow me to prove the function to be constant, but I'm unable to do so. Any thoughts?
real-analysis
real-analysis
edited Nov 23 '18 at 0:18
Namaste
1
1
asked Nov 22 '18 at 15:37
Ahmad LamaaAhmad Lamaa
1326
1326
$begingroup$
Are (or were) you unable to prove the result from your statement, your statement from the given information or both?
$endgroup$
– PJTraill
Nov 22 '18 at 21:53
$begingroup$
The latter actually. @PJTraill
$endgroup$
– Ahmad Lamaa
Nov 23 '18 at 1:43
add a comment |
$begingroup$
Are (or were) you unable to prove the result from your statement, your statement from the given information or both?
$endgroup$
– PJTraill
Nov 22 '18 at 21:53
$begingroup$
The latter actually. @PJTraill
$endgroup$
– Ahmad Lamaa
Nov 23 '18 at 1:43
$begingroup$
Are (or were) you unable to prove the result from your statement, your statement from the given information or both?
$endgroup$
– PJTraill
Nov 22 '18 at 21:53
$begingroup$
Are (or were) you unable to prove the result from your statement, your statement from the given information or both?
$endgroup$
– PJTraill
Nov 22 '18 at 21:53
$begingroup$
The latter actually. @PJTraill
$endgroup$
– Ahmad Lamaa
Nov 23 '18 at 1:43
$begingroup$
The latter actually. @PJTraill
$endgroup$
– Ahmad Lamaa
Nov 23 '18 at 1:43
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
We will proceed by contradiction:
I assume you want to prove that the function is constant given the statement
$c in [a, b] Rightarrow f(c) in {f(a), f(b) }$
if that's the case, then we get a continuous function to a discrete space.
If the function takes more than one value, the image of our function will be$ {f(a), f(b)}$ which is disconnected. But continous functions preserve connectedness.
Contradiction Q.E.D.
$endgroup$
$begingroup$
I suppose here $f(c)in[f(a), f(b)]$. Otherwise the function is discontinuous assuming $f(a)neq f(b)$.
$endgroup$
– Yadati Kiran
Nov 22 '18 at 15:52
1
$begingroup$
Yes, assuming $f(a) neq (fb) $ would mean it is discontinous, which is precisely the contradiction we're using that in fact $f(a)$ must be equal to $f(b)$ and the function is in fact constant. [think about the fact that if in the end both of them were to not be the same, the function would not be constant anyway ]
$endgroup$
– Aleks J
Nov 22 '18 at 15:55
add a comment |
$begingroup$
Let $c$ in $(a,b)$ and let $epsilon$ be a positive real number such that $[c-epsilon,c+epsilon]subseteq[a,b]$. Define a sequence of intervals $(I_n)_{ninmathbb{N}}$ by the formula $I_n=[c-frac{epsilon}{n},c+frac{epsilon}{n}]$. By hypothesis, there exists a sequence of points $(c_n)_{ninmathbb{N}}$ such that $c_nin I_n$ and $f(c_n)in{f(a),f(b)}$. Then $c_n$ tends to $c$ and, by continuity of $f$, we have that $f(c)in{f(a),f(b)}$. Thus, by continuity, $f$ is constant because it takes values in a discrete space.
$endgroup$
$begingroup$
@PJTraill Yes, I corrected it.
$endgroup$
– Dante Grevino
Nov 22 '18 at 23:41
add a comment |
$begingroup$
The set $D:=f^{-1}(f(a))cup f^{-1}(f(b))$ is closed by continuity of $f$ and dense in $I$ by the special property. Clearly $D$ does not intersect the open set $Isetminus D$. By defnition of dense, this means that $Isetminus D$ is empty. Hence $I=D$. This makes $I$ the union of the two non-empty closed sets $f^{-1}(f(a))$, $f^{-1}(f(b))$. As $I$ is connected, these sets must overlap, which means that $f(a)=f(b)$ and ultimately that $f^{-1}(f(a))=I$, i.e., $f$ is constant.
$endgroup$
add a comment |
$begingroup$
You need to use intermediate value property of continuous functions.
Suppose $f(a) =f(b) $. If $f$ is not constant in $[a, b] $ then there is some value of $f$ which differs from $f(a) =f(b) $ and let's suppose this value $f(c) > f(a) $ (the case $f(c) <f(a) $ is handled in a similar manner). By continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ are greater than $f(a) $. And this contradicts the given hypotheses. Thus $f$ must be a constant function.
The case when $f(a) neq f(b) $ leads us to a contradiction as shown next. Let's us assume $f(a) <f(b) $ and choose $k$ such that $f(a) <k<f(b) $. By intermediate value property there is a $cin(a, b) $ for which $f(c) =k$. And by continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ lie strictly between $f(a)$ and $f(b) $. This contradiction shows that we must have $f(a) =f(b) $ and as shown earlier the function is constant.
$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%2f3009279%2fproving-such-a-function-is-always-constant%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
We will proceed by contradiction:
I assume you want to prove that the function is constant given the statement
$c in [a, b] Rightarrow f(c) in {f(a), f(b) }$
if that's the case, then we get a continuous function to a discrete space.
If the function takes more than one value, the image of our function will be$ {f(a), f(b)}$ which is disconnected. But continous functions preserve connectedness.
Contradiction Q.E.D.
$endgroup$
$begingroup$
I suppose here $f(c)in[f(a), f(b)]$. Otherwise the function is discontinuous assuming $f(a)neq f(b)$.
$endgroup$
– Yadati Kiran
Nov 22 '18 at 15:52
1
$begingroup$
Yes, assuming $f(a) neq (fb) $ would mean it is discontinous, which is precisely the contradiction we're using that in fact $f(a)$ must be equal to $f(b)$ and the function is in fact constant. [think about the fact that if in the end both of them were to not be the same, the function would not be constant anyway ]
$endgroup$
– Aleks J
Nov 22 '18 at 15:55
add a comment |
$begingroup$
We will proceed by contradiction:
I assume you want to prove that the function is constant given the statement
$c in [a, b] Rightarrow f(c) in {f(a), f(b) }$
if that's the case, then we get a continuous function to a discrete space.
If the function takes more than one value, the image of our function will be$ {f(a), f(b)}$ which is disconnected. But continous functions preserve connectedness.
Contradiction Q.E.D.
$endgroup$
$begingroup$
I suppose here $f(c)in[f(a), f(b)]$. Otherwise the function is discontinuous assuming $f(a)neq f(b)$.
$endgroup$
– Yadati Kiran
Nov 22 '18 at 15:52
1
$begingroup$
Yes, assuming $f(a) neq (fb) $ would mean it is discontinous, which is precisely the contradiction we're using that in fact $f(a)$ must be equal to $f(b)$ and the function is in fact constant. [think about the fact that if in the end both of them were to not be the same, the function would not be constant anyway ]
$endgroup$
– Aleks J
Nov 22 '18 at 15:55
add a comment |
$begingroup$
We will proceed by contradiction:
I assume you want to prove that the function is constant given the statement
$c in [a, b] Rightarrow f(c) in {f(a), f(b) }$
if that's the case, then we get a continuous function to a discrete space.
If the function takes more than one value, the image of our function will be$ {f(a), f(b)}$ which is disconnected. But continous functions preserve connectedness.
Contradiction Q.E.D.
$endgroup$
We will proceed by contradiction:
I assume you want to prove that the function is constant given the statement
$c in [a, b] Rightarrow f(c) in {f(a), f(b) }$
if that's the case, then we get a continuous function to a discrete space.
If the function takes more than one value, the image of our function will be$ {f(a), f(b)}$ which is disconnected. But continous functions preserve connectedness.
Contradiction Q.E.D.
answered Nov 22 '18 at 15:48
Aleks J Aleks J
1796
1796
$begingroup$
I suppose here $f(c)in[f(a), f(b)]$. Otherwise the function is discontinuous assuming $f(a)neq f(b)$.
$endgroup$
– Yadati Kiran
Nov 22 '18 at 15:52
1
$begingroup$
Yes, assuming $f(a) neq (fb) $ would mean it is discontinous, which is precisely the contradiction we're using that in fact $f(a)$ must be equal to $f(b)$ and the function is in fact constant. [think about the fact that if in the end both of them were to not be the same, the function would not be constant anyway ]
$endgroup$
– Aleks J
Nov 22 '18 at 15:55
add a comment |
$begingroup$
I suppose here $f(c)in[f(a), f(b)]$. Otherwise the function is discontinuous assuming $f(a)neq f(b)$.
$endgroup$
– Yadati Kiran
Nov 22 '18 at 15:52
1
$begingroup$
Yes, assuming $f(a) neq (fb) $ would mean it is discontinous, which is precisely the contradiction we're using that in fact $f(a)$ must be equal to $f(b)$ and the function is in fact constant. [think about the fact that if in the end both of them were to not be the same, the function would not be constant anyway ]
$endgroup$
– Aleks J
Nov 22 '18 at 15:55
$begingroup$
I suppose here $f(c)in[f(a), f(b)]$. Otherwise the function is discontinuous assuming $f(a)neq f(b)$.
$endgroup$
– Yadati Kiran
Nov 22 '18 at 15:52
$begingroup$
I suppose here $f(c)in[f(a), f(b)]$. Otherwise the function is discontinuous assuming $f(a)neq f(b)$.
$endgroup$
– Yadati Kiran
Nov 22 '18 at 15:52
1
1
$begingroup$
Yes, assuming $f(a) neq (fb) $ would mean it is discontinous, which is precisely the contradiction we're using that in fact $f(a)$ must be equal to $f(b)$ and the function is in fact constant. [think about the fact that if in the end both of them were to not be the same, the function would not be constant anyway ]
$endgroup$
– Aleks J
Nov 22 '18 at 15:55
$begingroup$
Yes, assuming $f(a) neq (fb) $ would mean it is discontinous, which is precisely the contradiction we're using that in fact $f(a)$ must be equal to $f(b)$ and the function is in fact constant. [think about the fact that if in the end both of them were to not be the same, the function would not be constant anyway ]
$endgroup$
– Aleks J
Nov 22 '18 at 15:55
add a comment |
$begingroup$
Let $c$ in $(a,b)$ and let $epsilon$ be a positive real number such that $[c-epsilon,c+epsilon]subseteq[a,b]$. Define a sequence of intervals $(I_n)_{ninmathbb{N}}$ by the formula $I_n=[c-frac{epsilon}{n},c+frac{epsilon}{n}]$. By hypothesis, there exists a sequence of points $(c_n)_{ninmathbb{N}}$ such that $c_nin I_n$ and $f(c_n)in{f(a),f(b)}$. Then $c_n$ tends to $c$ and, by continuity of $f$, we have that $f(c)in{f(a),f(b)}$. Thus, by continuity, $f$ is constant because it takes values in a discrete space.
$endgroup$
$begingroup$
@PJTraill Yes, I corrected it.
$endgroup$
– Dante Grevino
Nov 22 '18 at 23:41
add a comment |
$begingroup$
Let $c$ in $(a,b)$ and let $epsilon$ be a positive real number such that $[c-epsilon,c+epsilon]subseteq[a,b]$. Define a sequence of intervals $(I_n)_{ninmathbb{N}}$ by the formula $I_n=[c-frac{epsilon}{n},c+frac{epsilon}{n}]$. By hypothesis, there exists a sequence of points $(c_n)_{ninmathbb{N}}$ such that $c_nin I_n$ and $f(c_n)in{f(a),f(b)}$. Then $c_n$ tends to $c$ and, by continuity of $f$, we have that $f(c)in{f(a),f(b)}$. Thus, by continuity, $f$ is constant because it takes values in a discrete space.
$endgroup$
$begingroup$
@PJTraill Yes, I corrected it.
$endgroup$
– Dante Grevino
Nov 22 '18 at 23:41
add a comment |
$begingroup$
Let $c$ in $(a,b)$ and let $epsilon$ be a positive real number such that $[c-epsilon,c+epsilon]subseteq[a,b]$. Define a sequence of intervals $(I_n)_{ninmathbb{N}}$ by the formula $I_n=[c-frac{epsilon}{n},c+frac{epsilon}{n}]$. By hypothesis, there exists a sequence of points $(c_n)_{ninmathbb{N}}$ such that $c_nin I_n$ and $f(c_n)in{f(a),f(b)}$. Then $c_n$ tends to $c$ and, by continuity of $f$, we have that $f(c)in{f(a),f(b)}$. Thus, by continuity, $f$ is constant because it takes values in a discrete space.
$endgroup$
Let $c$ in $(a,b)$ and let $epsilon$ be a positive real number such that $[c-epsilon,c+epsilon]subseteq[a,b]$. Define a sequence of intervals $(I_n)_{ninmathbb{N}}$ by the formula $I_n=[c-frac{epsilon}{n},c+frac{epsilon}{n}]$. By hypothesis, there exists a sequence of points $(c_n)_{ninmathbb{N}}$ such that $c_nin I_n$ and $f(c_n)in{f(a),f(b)}$. Then $c_n$ tends to $c$ and, by continuity of $f$, we have that $f(c)in{f(a),f(b)}$. Thus, by continuity, $f$ is constant because it takes values in a discrete space.
edited Nov 22 '18 at 23:38
answered Nov 22 '18 at 15:54
Dante GrevinoDante Grevino
1,1741112
1,1741112
$begingroup$
@PJTraill Yes, I corrected it.
$endgroup$
– Dante Grevino
Nov 22 '18 at 23:41
add a comment |
$begingroup$
@PJTraill Yes, I corrected it.
$endgroup$
– Dante Grevino
Nov 22 '18 at 23:41
$begingroup$
@PJTraill Yes, I corrected it.
$endgroup$
– Dante Grevino
Nov 22 '18 at 23:41
$begingroup$
@PJTraill Yes, I corrected it.
$endgroup$
– Dante Grevino
Nov 22 '18 at 23:41
add a comment |
$begingroup$
The set $D:=f^{-1}(f(a))cup f^{-1}(f(b))$ is closed by continuity of $f$ and dense in $I$ by the special property. Clearly $D$ does not intersect the open set $Isetminus D$. By defnition of dense, this means that $Isetminus D$ is empty. Hence $I=D$. This makes $I$ the union of the two non-empty closed sets $f^{-1}(f(a))$, $f^{-1}(f(b))$. As $I$ is connected, these sets must overlap, which means that $f(a)=f(b)$ and ultimately that $f^{-1}(f(a))=I$, i.e., $f$ is constant.
$endgroup$
add a comment |
$begingroup$
The set $D:=f^{-1}(f(a))cup f^{-1}(f(b))$ is closed by continuity of $f$ and dense in $I$ by the special property. Clearly $D$ does not intersect the open set $Isetminus D$. By defnition of dense, this means that $Isetminus D$ is empty. Hence $I=D$. This makes $I$ the union of the two non-empty closed sets $f^{-1}(f(a))$, $f^{-1}(f(b))$. As $I$ is connected, these sets must overlap, which means that $f(a)=f(b)$ and ultimately that $f^{-1}(f(a))=I$, i.e., $f$ is constant.
$endgroup$
add a comment |
$begingroup$
The set $D:=f^{-1}(f(a))cup f^{-1}(f(b))$ is closed by continuity of $f$ and dense in $I$ by the special property. Clearly $D$ does not intersect the open set $Isetminus D$. By defnition of dense, this means that $Isetminus D$ is empty. Hence $I=D$. This makes $I$ the union of the two non-empty closed sets $f^{-1}(f(a))$, $f^{-1}(f(b))$. As $I$ is connected, these sets must overlap, which means that $f(a)=f(b)$ and ultimately that $f^{-1}(f(a))=I$, i.e., $f$ is constant.
$endgroup$
The set $D:=f^{-1}(f(a))cup f^{-1}(f(b))$ is closed by continuity of $f$ and dense in $I$ by the special property. Clearly $D$ does not intersect the open set $Isetminus D$. By defnition of dense, this means that $Isetminus D$ is empty. Hence $I=D$. This makes $I$ the union of the two non-empty closed sets $f^{-1}(f(a))$, $f^{-1}(f(b))$. As $I$ is connected, these sets must overlap, which means that $f(a)=f(b)$ and ultimately that $f^{-1}(f(a))=I$, i.e., $f$ is constant.
answered Nov 22 '18 at 20:19
Hagen von EitzenHagen von Eitzen
283k23272507
283k23272507
add a comment |
add a comment |
$begingroup$
You need to use intermediate value property of continuous functions.
Suppose $f(a) =f(b) $. If $f$ is not constant in $[a, b] $ then there is some value of $f$ which differs from $f(a) =f(b) $ and let's suppose this value $f(c) > f(a) $ (the case $f(c) <f(a) $ is handled in a similar manner). By continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ are greater than $f(a) $. And this contradicts the given hypotheses. Thus $f$ must be a constant function.
The case when $f(a) neq f(b) $ leads us to a contradiction as shown next. Let's us assume $f(a) <f(b) $ and choose $k$ such that $f(a) <k<f(b) $. By intermediate value property there is a $cin(a, b) $ for which $f(c) =k$. And by continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ lie strictly between $f(a)$ and $f(b) $. This contradiction shows that we must have $f(a) =f(b) $ and as shown earlier the function is constant.
$endgroup$
add a comment |
$begingroup$
You need to use intermediate value property of continuous functions.
Suppose $f(a) =f(b) $. If $f$ is not constant in $[a, b] $ then there is some value of $f$ which differs from $f(a) =f(b) $ and let's suppose this value $f(c) > f(a) $ (the case $f(c) <f(a) $ is handled in a similar manner). By continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ are greater than $f(a) $. And this contradicts the given hypotheses. Thus $f$ must be a constant function.
The case when $f(a) neq f(b) $ leads us to a contradiction as shown next. Let's us assume $f(a) <f(b) $ and choose $k$ such that $f(a) <k<f(b) $. By intermediate value property there is a $cin(a, b) $ for which $f(c) =k$. And by continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ lie strictly between $f(a)$ and $f(b) $. This contradiction shows that we must have $f(a) =f(b) $ and as shown earlier the function is constant.
$endgroup$
add a comment |
$begingroup$
You need to use intermediate value property of continuous functions.
Suppose $f(a) =f(b) $. If $f$ is not constant in $[a, b] $ then there is some value of $f$ which differs from $f(a) =f(b) $ and let's suppose this value $f(c) > f(a) $ (the case $f(c) <f(a) $ is handled in a similar manner). By continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ are greater than $f(a) $. And this contradicts the given hypotheses. Thus $f$ must be a constant function.
The case when $f(a) neq f(b) $ leads us to a contradiction as shown next. Let's us assume $f(a) <f(b) $ and choose $k$ such that $f(a) <k<f(b) $. By intermediate value property there is a $cin(a, b) $ for which $f(c) =k$. And by continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ lie strictly between $f(a)$ and $f(b) $. This contradiction shows that we must have $f(a) =f(b) $ and as shown earlier the function is constant.
$endgroup$
You need to use intermediate value property of continuous functions.
Suppose $f(a) =f(b) $. If $f$ is not constant in $[a, b] $ then there is some value of $f$ which differs from $f(a) =f(b) $ and let's suppose this value $f(c) > f(a) $ (the case $f(c) <f(a) $ is handled in a similar manner). By continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ are greater than $f(a) $. And this contradicts the given hypotheses. Thus $f$ must be a constant function.
The case when $f(a) neq f(b) $ leads us to a contradiction as shown next. Let's us assume $f(a) <f(b) $ and choose $k$ such that $f(a) <k<f(b) $. By intermediate value property there is a $cin(a, b) $ for which $f(c) =k$. And by continuity there is an interval of type $[c-delta, c+delta] $ where all values of $f$ lie strictly between $f(a)$ and $f(b) $. This contradiction shows that we must have $f(a) =f(b) $ and as shown earlier the function is constant.
answered Nov 23 '18 at 3:03
Paramanand SinghParamanand Singh
50.9k557168
50.9k557168
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%2f3009279%2fproving-such-a-function-is-always-constant%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$
Are (or were) you unable to prove the result from your statement, your statement from the given information or both?
$endgroup$
– PJTraill
Nov 22 '18 at 21:53
$begingroup$
The latter actually. @PJTraill
$endgroup$
– Ahmad Lamaa
Nov 23 '18 at 1:43