If $xin[a,b],$ then $|x|leq max{|a|,|b|}$
$begingroup$
The following seems to be quite known:
If $xin[a,b],$ then $|x|leq max{|a|,|b|}$
I do use it while treating problems on series of functions but how does it come about? Any hint please?
real-analysis sequences-and-series absolute-value
$endgroup$
add a comment |
$begingroup$
The following seems to be quite known:
If $xin[a,b],$ then $|x|leq max{|a|,|b|}$
I do use it while treating problems on series of functions but how does it come about? Any hint please?
real-analysis sequences-and-series absolute-value
$endgroup$
$begingroup$
Sorry, can you tell me why you're voting for a close? Perhaps, I'll change somethings.
$endgroup$
– Omojola Micheal
Dec 29 '18 at 15:50
5
$begingroup$
$|x|$ is the distance of $x$ from $0$, it seems obvious that the distance of $x$ from $0$ would be less than the maximum of distance of $a$ and $b$ from $0$.
$endgroup$
– Jakobian
Dec 29 '18 at 15:50
add a comment |
$begingroup$
The following seems to be quite known:
If $xin[a,b],$ then $|x|leq max{|a|,|b|}$
I do use it while treating problems on series of functions but how does it come about? Any hint please?
real-analysis sequences-and-series absolute-value
$endgroup$
The following seems to be quite known:
If $xin[a,b],$ then $|x|leq max{|a|,|b|}$
I do use it while treating problems on series of functions but how does it come about? Any hint please?
real-analysis sequences-and-series absolute-value
real-analysis sequences-and-series absolute-value
asked Dec 29 '18 at 15:37
Omojola MichealOmojola Micheal
1,753324
1,753324
$begingroup$
Sorry, can you tell me why you're voting for a close? Perhaps, I'll change somethings.
$endgroup$
– Omojola Micheal
Dec 29 '18 at 15:50
5
$begingroup$
$|x|$ is the distance of $x$ from $0$, it seems obvious that the distance of $x$ from $0$ would be less than the maximum of distance of $a$ and $b$ from $0$.
$endgroup$
– Jakobian
Dec 29 '18 at 15:50
add a comment |
$begingroup$
Sorry, can you tell me why you're voting for a close? Perhaps, I'll change somethings.
$endgroup$
– Omojola Micheal
Dec 29 '18 at 15:50
5
$begingroup$
$|x|$ is the distance of $x$ from $0$, it seems obvious that the distance of $x$ from $0$ would be less than the maximum of distance of $a$ and $b$ from $0$.
$endgroup$
– Jakobian
Dec 29 '18 at 15:50
$begingroup$
Sorry, can you tell me why you're voting for a close? Perhaps, I'll change somethings.
$endgroup$
– Omojola Micheal
Dec 29 '18 at 15:50
$begingroup$
Sorry, can you tell me why you're voting for a close? Perhaps, I'll change somethings.
$endgroup$
– Omojola Micheal
Dec 29 '18 at 15:50
5
5
$begingroup$
$|x|$ is the distance of $x$ from $0$, it seems obvious that the distance of $x$ from $0$ would be less than the maximum of distance of $a$ and $b$ from $0$.
$endgroup$
– Jakobian
Dec 29 '18 at 15:50
$begingroup$
$|x|$ is the distance of $x$ from $0$, it seems obvious that the distance of $x$ from $0$ would be less than the maximum of distance of $a$ and $b$ from $0$.
$endgroup$
– Jakobian
Dec 29 '18 at 15:50
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
If $xge0$ then $bge0$, hence $$|x|=xle b=|b|lemax(|a|,|b|).$$Similarly if $x<0$ then $a<0$, hence $$|x|=-xle-a=|a|lemax(|a|,|b|).$$
$endgroup$
$begingroup$
Can't it be $xin [-5,4]$ for example, which means that $x$ can also be positive and negative as well ?
$endgroup$
– Rebellos
Dec 29 '18 at 15:50
$begingroup$
@Rebellos Huh???? Saying $xin[-5,4]$ does not say that $x$ is both positive and negative - that's total nonsense.
$endgroup$
– David C. Ullrich
Dec 29 '18 at 15:52
$begingroup$
Very straightforward proof +1
$endgroup$
– Jakobian
Dec 29 '18 at 15:56
$begingroup$
@DavidC.Ullrich You hadn't added the second line when I commented :) Still, it's a correct proof. +1 now.
$endgroup$
– Rebellos
Dec 29 '18 at 15:56
2
$begingroup$
@Rebellos $x$ is fixed
$endgroup$
– Jakobian
Dec 29 '18 at 16:14
|
show 2 more comments
$begingroup$
Since $x in [a,b]$, it is $a<b$ (or even $a leq b$ if you want to be more strict for a trivial case).
If $text{sgn}(a) = text{sgn}(b)=1$, then $max{|a|,|b|} = |b| implies |x| leq max{|a|,|b|}$.
If $text{sgn}(a) = text{sgn}(b)=-1$, then $max{|a|,|b|} = |a| implies |x| leq max{|a|,|b|}$.
In the case of $text{sgn}(a) neq text{sgn}(b)$, that means that $a$ would be negative. But, in that case, it can be $|a| > |b|$. Then, for $|x|$, it would be : $|x| leq |a| implies |x| leq max{|a|,|b|}$.
So, for all cases, we have that : $|x| leq max{|a|,|b|}$.
Edit (Alternativelly) : The comment of Jakobian is really nice to consider for a really straightforward proof. What the absolute value $|x|$ means is the distance of $x$ from $0$. But since $x in [a,b]$, then this distance cannot be larger than the distance of $a$ from zero $(|a|)$ or the distance of $b$ from zero $(|b|)$.
$endgroup$
1
$begingroup$
I do not understand your first statement. If I have $a=-3$ and $b=-2$, then the maximum of $|a|$ and $|b|$ would be $|a|=3$, not $|b|=2$.
$endgroup$
– Noble Mushtak
Dec 29 '18 at 15:45
$begingroup$
@NobleMushtak Sure, edited. I missed a line.
$endgroup$
– Rebellos
Dec 29 '18 at 15:46
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%2f3055953%2fif-x-ina-b-then-x-leq-max-a-b%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$
If $xge0$ then $bge0$, hence $$|x|=xle b=|b|lemax(|a|,|b|).$$Similarly if $x<0$ then $a<0$, hence $$|x|=-xle-a=|a|lemax(|a|,|b|).$$
$endgroup$
$begingroup$
Can't it be $xin [-5,4]$ for example, which means that $x$ can also be positive and negative as well ?
$endgroup$
– Rebellos
Dec 29 '18 at 15:50
$begingroup$
@Rebellos Huh???? Saying $xin[-5,4]$ does not say that $x$ is both positive and negative - that's total nonsense.
$endgroup$
– David C. Ullrich
Dec 29 '18 at 15:52
$begingroup$
Very straightforward proof +1
$endgroup$
– Jakobian
Dec 29 '18 at 15:56
$begingroup$
@DavidC.Ullrich You hadn't added the second line when I commented :) Still, it's a correct proof. +1 now.
$endgroup$
– Rebellos
Dec 29 '18 at 15:56
2
$begingroup$
@Rebellos $x$ is fixed
$endgroup$
– Jakobian
Dec 29 '18 at 16:14
|
show 2 more comments
$begingroup$
If $xge0$ then $bge0$, hence $$|x|=xle b=|b|lemax(|a|,|b|).$$Similarly if $x<0$ then $a<0$, hence $$|x|=-xle-a=|a|lemax(|a|,|b|).$$
$endgroup$
$begingroup$
Can't it be $xin [-5,4]$ for example, which means that $x$ can also be positive and negative as well ?
$endgroup$
– Rebellos
Dec 29 '18 at 15:50
$begingroup$
@Rebellos Huh???? Saying $xin[-5,4]$ does not say that $x$ is both positive and negative - that's total nonsense.
$endgroup$
– David C. Ullrich
Dec 29 '18 at 15:52
$begingroup$
Very straightforward proof +1
$endgroup$
– Jakobian
Dec 29 '18 at 15:56
$begingroup$
@DavidC.Ullrich You hadn't added the second line when I commented :) Still, it's a correct proof. +1 now.
$endgroup$
– Rebellos
Dec 29 '18 at 15:56
2
$begingroup$
@Rebellos $x$ is fixed
$endgroup$
– Jakobian
Dec 29 '18 at 16:14
|
show 2 more comments
$begingroup$
If $xge0$ then $bge0$, hence $$|x|=xle b=|b|lemax(|a|,|b|).$$Similarly if $x<0$ then $a<0$, hence $$|x|=-xle-a=|a|lemax(|a|,|b|).$$
$endgroup$
If $xge0$ then $bge0$, hence $$|x|=xle b=|b|lemax(|a|,|b|).$$Similarly if $x<0$ then $a<0$, hence $$|x|=-xle-a=|a|lemax(|a|,|b|).$$
edited Dec 29 '18 at 15:50
answered Dec 29 '18 at 15:47
David C. UllrichDavid C. Ullrich
59.3k43893
59.3k43893
$begingroup$
Can't it be $xin [-5,4]$ for example, which means that $x$ can also be positive and negative as well ?
$endgroup$
– Rebellos
Dec 29 '18 at 15:50
$begingroup$
@Rebellos Huh???? Saying $xin[-5,4]$ does not say that $x$ is both positive and negative - that's total nonsense.
$endgroup$
– David C. Ullrich
Dec 29 '18 at 15:52
$begingroup$
Very straightforward proof +1
$endgroup$
– Jakobian
Dec 29 '18 at 15:56
$begingroup$
@DavidC.Ullrich You hadn't added the second line when I commented :) Still, it's a correct proof. +1 now.
$endgroup$
– Rebellos
Dec 29 '18 at 15:56
2
$begingroup$
@Rebellos $x$ is fixed
$endgroup$
– Jakobian
Dec 29 '18 at 16:14
|
show 2 more comments
$begingroup$
Can't it be $xin [-5,4]$ for example, which means that $x$ can also be positive and negative as well ?
$endgroup$
– Rebellos
Dec 29 '18 at 15:50
$begingroup$
@Rebellos Huh???? Saying $xin[-5,4]$ does not say that $x$ is both positive and negative - that's total nonsense.
$endgroup$
– David C. Ullrich
Dec 29 '18 at 15:52
$begingroup$
Very straightforward proof +1
$endgroup$
– Jakobian
Dec 29 '18 at 15:56
$begingroup$
@DavidC.Ullrich You hadn't added the second line when I commented :) Still, it's a correct proof. +1 now.
$endgroup$
– Rebellos
Dec 29 '18 at 15:56
2
$begingroup$
@Rebellos $x$ is fixed
$endgroup$
– Jakobian
Dec 29 '18 at 16:14
$begingroup$
Can't it be $xin [-5,4]$ for example, which means that $x$ can also be positive and negative as well ?
$endgroup$
– Rebellos
Dec 29 '18 at 15:50
$begingroup$
Can't it be $xin [-5,4]$ for example, which means that $x$ can also be positive and negative as well ?
$endgroup$
– Rebellos
Dec 29 '18 at 15:50
$begingroup$
@Rebellos Huh???? Saying $xin[-5,4]$ does not say that $x$ is both positive and negative - that's total nonsense.
$endgroup$
– David C. Ullrich
Dec 29 '18 at 15:52
$begingroup$
@Rebellos Huh???? Saying $xin[-5,4]$ does not say that $x$ is both positive and negative - that's total nonsense.
$endgroup$
– David C. Ullrich
Dec 29 '18 at 15:52
$begingroup$
Very straightforward proof +1
$endgroup$
– Jakobian
Dec 29 '18 at 15:56
$begingroup$
Very straightforward proof +1
$endgroup$
– Jakobian
Dec 29 '18 at 15:56
$begingroup$
@DavidC.Ullrich You hadn't added the second line when I commented :) Still, it's a correct proof. +1 now.
$endgroup$
– Rebellos
Dec 29 '18 at 15:56
$begingroup$
@DavidC.Ullrich You hadn't added the second line when I commented :) Still, it's a correct proof. +1 now.
$endgroup$
– Rebellos
Dec 29 '18 at 15:56
2
2
$begingroup$
@Rebellos $x$ is fixed
$endgroup$
– Jakobian
Dec 29 '18 at 16:14
$begingroup$
@Rebellos $x$ is fixed
$endgroup$
– Jakobian
Dec 29 '18 at 16:14
|
show 2 more comments
$begingroup$
Since $x in [a,b]$, it is $a<b$ (or even $a leq b$ if you want to be more strict for a trivial case).
If $text{sgn}(a) = text{sgn}(b)=1$, then $max{|a|,|b|} = |b| implies |x| leq max{|a|,|b|}$.
If $text{sgn}(a) = text{sgn}(b)=-1$, then $max{|a|,|b|} = |a| implies |x| leq max{|a|,|b|}$.
In the case of $text{sgn}(a) neq text{sgn}(b)$, that means that $a$ would be negative. But, in that case, it can be $|a| > |b|$. Then, for $|x|$, it would be : $|x| leq |a| implies |x| leq max{|a|,|b|}$.
So, for all cases, we have that : $|x| leq max{|a|,|b|}$.
Edit (Alternativelly) : The comment of Jakobian is really nice to consider for a really straightforward proof. What the absolute value $|x|$ means is the distance of $x$ from $0$. But since $x in [a,b]$, then this distance cannot be larger than the distance of $a$ from zero $(|a|)$ or the distance of $b$ from zero $(|b|)$.
$endgroup$
1
$begingroup$
I do not understand your first statement. If I have $a=-3$ and $b=-2$, then the maximum of $|a|$ and $|b|$ would be $|a|=3$, not $|b|=2$.
$endgroup$
– Noble Mushtak
Dec 29 '18 at 15:45
$begingroup$
@NobleMushtak Sure, edited. I missed a line.
$endgroup$
– Rebellos
Dec 29 '18 at 15:46
add a comment |
$begingroup$
Since $x in [a,b]$, it is $a<b$ (or even $a leq b$ if you want to be more strict for a trivial case).
If $text{sgn}(a) = text{sgn}(b)=1$, then $max{|a|,|b|} = |b| implies |x| leq max{|a|,|b|}$.
If $text{sgn}(a) = text{sgn}(b)=-1$, then $max{|a|,|b|} = |a| implies |x| leq max{|a|,|b|}$.
In the case of $text{sgn}(a) neq text{sgn}(b)$, that means that $a$ would be negative. But, in that case, it can be $|a| > |b|$. Then, for $|x|$, it would be : $|x| leq |a| implies |x| leq max{|a|,|b|}$.
So, for all cases, we have that : $|x| leq max{|a|,|b|}$.
Edit (Alternativelly) : The comment of Jakobian is really nice to consider for a really straightforward proof. What the absolute value $|x|$ means is the distance of $x$ from $0$. But since $x in [a,b]$, then this distance cannot be larger than the distance of $a$ from zero $(|a|)$ or the distance of $b$ from zero $(|b|)$.
$endgroup$
1
$begingroup$
I do not understand your first statement. If I have $a=-3$ and $b=-2$, then the maximum of $|a|$ and $|b|$ would be $|a|=3$, not $|b|=2$.
$endgroup$
– Noble Mushtak
Dec 29 '18 at 15:45
$begingroup$
@NobleMushtak Sure, edited. I missed a line.
$endgroup$
– Rebellos
Dec 29 '18 at 15:46
add a comment |
$begingroup$
Since $x in [a,b]$, it is $a<b$ (or even $a leq b$ if you want to be more strict for a trivial case).
If $text{sgn}(a) = text{sgn}(b)=1$, then $max{|a|,|b|} = |b| implies |x| leq max{|a|,|b|}$.
If $text{sgn}(a) = text{sgn}(b)=-1$, then $max{|a|,|b|} = |a| implies |x| leq max{|a|,|b|}$.
In the case of $text{sgn}(a) neq text{sgn}(b)$, that means that $a$ would be negative. But, in that case, it can be $|a| > |b|$. Then, for $|x|$, it would be : $|x| leq |a| implies |x| leq max{|a|,|b|}$.
So, for all cases, we have that : $|x| leq max{|a|,|b|}$.
Edit (Alternativelly) : The comment of Jakobian is really nice to consider for a really straightforward proof. What the absolute value $|x|$ means is the distance of $x$ from $0$. But since $x in [a,b]$, then this distance cannot be larger than the distance of $a$ from zero $(|a|)$ or the distance of $b$ from zero $(|b|)$.
$endgroup$
Since $x in [a,b]$, it is $a<b$ (or even $a leq b$ if you want to be more strict for a trivial case).
If $text{sgn}(a) = text{sgn}(b)=1$, then $max{|a|,|b|} = |b| implies |x| leq max{|a|,|b|}$.
If $text{sgn}(a) = text{sgn}(b)=-1$, then $max{|a|,|b|} = |a| implies |x| leq max{|a|,|b|}$.
In the case of $text{sgn}(a) neq text{sgn}(b)$, that means that $a$ would be negative. But, in that case, it can be $|a| > |b|$. Then, for $|x|$, it would be : $|x| leq |a| implies |x| leq max{|a|,|b|}$.
So, for all cases, we have that : $|x| leq max{|a|,|b|}$.
Edit (Alternativelly) : The comment of Jakobian is really nice to consider for a really straightforward proof. What the absolute value $|x|$ means is the distance of $x$ from $0$. But since $x in [a,b]$, then this distance cannot be larger than the distance of $a$ from zero $(|a|)$ or the distance of $b$ from zero $(|b|)$.
edited Dec 29 '18 at 15:54
answered Dec 29 '18 at 15:43
RebellosRebellos
14.5k31246
14.5k31246
1
$begingroup$
I do not understand your first statement. If I have $a=-3$ and $b=-2$, then the maximum of $|a|$ and $|b|$ would be $|a|=3$, not $|b|=2$.
$endgroup$
– Noble Mushtak
Dec 29 '18 at 15:45
$begingroup$
@NobleMushtak Sure, edited. I missed a line.
$endgroup$
– Rebellos
Dec 29 '18 at 15:46
add a comment |
1
$begingroup$
I do not understand your first statement. If I have $a=-3$ and $b=-2$, then the maximum of $|a|$ and $|b|$ would be $|a|=3$, not $|b|=2$.
$endgroup$
– Noble Mushtak
Dec 29 '18 at 15:45
$begingroup$
@NobleMushtak Sure, edited. I missed a line.
$endgroup$
– Rebellos
Dec 29 '18 at 15:46
1
1
$begingroup$
I do not understand your first statement. If I have $a=-3$ and $b=-2$, then the maximum of $|a|$ and $|b|$ would be $|a|=3$, not $|b|=2$.
$endgroup$
– Noble Mushtak
Dec 29 '18 at 15:45
$begingroup$
I do not understand your first statement. If I have $a=-3$ and $b=-2$, then the maximum of $|a|$ and $|b|$ would be $|a|=3$, not $|b|=2$.
$endgroup$
– Noble Mushtak
Dec 29 '18 at 15:45
$begingroup$
@NobleMushtak Sure, edited. I missed a line.
$endgroup$
– Rebellos
Dec 29 '18 at 15:46
$begingroup$
@NobleMushtak Sure, edited. I missed a line.
$endgroup$
– Rebellos
Dec 29 '18 at 15:46
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%2f3055953%2fif-x-ina-b-then-x-leq-max-a-b%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$
Sorry, can you tell me why you're voting for a close? Perhaps, I'll change somethings.
$endgroup$
– Omojola Micheal
Dec 29 '18 at 15:50
5
$begingroup$
$|x|$ is the distance of $x$ from $0$, it seems obvious that the distance of $x$ from $0$ would be less than the maximum of distance of $a$ and $b$ from $0$.
$endgroup$
– Jakobian
Dec 29 '18 at 15:50