Is f1+f2 unimodal if f1 and f2 is monotonic?
$begingroup$
I have recently encountered one programming problem which was reduced to find minimum value of function.Function f was sum of two functions f1 and f2 and f1 is strictly increasing and f2 is strictly decreasing. How can I prove that f1+f2 is unimodal from given information? I tried to think intuitively by considering slopes of f1 and f2 but I am not able to prove above fact. Can anyone give some approach or explanation? Thanks.
total-unimodularity
$endgroup$
add a comment |
$begingroup$
I have recently encountered one programming problem which was reduced to find minimum value of function.Function f was sum of two functions f1 and f2 and f1 is strictly increasing and f2 is strictly decreasing. How can I prove that f1+f2 is unimodal from given information? I tried to think intuitively by considering slopes of f1 and f2 but I am not able to prove above fact. Can anyone give some approach or explanation? Thanks.
total-unimodularity
$endgroup$
1
$begingroup$
Do you mean one was increasing and one was decreasing? If they are both increasing, so is the sum, so the maximum comes at the top end of the allowable interval.
$endgroup$
– Ross Millikan
Jan 8 at 17:44
$begingroup$
edited. Thanks for pointing out
$endgroup$
– Parth Patel
Jan 8 at 17:49
$begingroup$
I don't think this is true. It's easy to construct a counter-example, using piecewise linear functions.
$endgroup$
– verret
Jan 8 at 20:25
add a comment |
$begingroup$
I have recently encountered one programming problem which was reduced to find minimum value of function.Function f was sum of two functions f1 and f2 and f1 is strictly increasing and f2 is strictly decreasing. How can I prove that f1+f2 is unimodal from given information? I tried to think intuitively by considering slopes of f1 and f2 but I am not able to prove above fact. Can anyone give some approach or explanation? Thanks.
total-unimodularity
$endgroup$
I have recently encountered one programming problem which was reduced to find minimum value of function.Function f was sum of two functions f1 and f2 and f1 is strictly increasing and f2 is strictly decreasing. How can I prove that f1+f2 is unimodal from given information? I tried to think intuitively by considering slopes of f1 and f2 but I am not able to prove above fact. Can anyone give some approach or explanation? Thanks.
total-unimodularity
total-unimodularity
edited Jan 8 at 17:49
Parth Patel
asked Jan 8 at 17:32
Parth PatelParth Patel
367
367
1
$begingroup$
Do you mean one was increasing and one was decreasing? If they are both increasing, so is the sum, so the maximum comes at the top end of the allowable interval.
$endgroup$
– Ross Millikan
Jan 8 at 17:44
$begingroup$
edited. Thanks for pointing out
$endgroup$
– Parth Patel
Jan 8 at 17:49
$begingroup$
I don't think this is true. It's easy to construct a counter-example, using piecewise linear functions.
$endgroup$
– verret
Jan 8 at 20:25
add a comment |
1
$begingroup$
Do you mean one was increasing and one was decreasing? If they are both increasing, so is the sum, so the maximum comes at the top end of the allowable interval.
$endgroup$
– Ross Millikan
Jan 8 at 17:44
$begingroup$
edited. Thanks for pointing out
$endgroup$
– Parth Patel
Jan 8 at 17:49
$begingroup$
I don't think this is true. It's easy to construct a counter-example, using piecewise linear functions.
$endgroup$
– verret
Jan 8 at 20:25
1
1
$begingroup$
Do you mean one was increasing and one was decreasing? If they are both increasing, so is the sum, so the maximum comes at the top end of the allowable interval.
$endgroup$
– Ross Millikan
Jan 8 at 17:44
$begingroup$
Do you mean one was increasing and one was decreasing? If they are both increasing, so is the sum, so the maximum comes at the top end of the allowable interval.
$endgroup$
– Ross Millikan
Jan 8 at 17:44
$begingroup$
edited. Thanks for pointing out
$endgroup$
– Parth Patel
Jan 8 at 17:49
$begingroup$
edited. Thanks for pointing out
$endgroup$
– Parth Patel
Jan 8 at 17:49
$begingroup$
I don't think this is true. It's easy to construct a counter-example, using piecewise linear functions.
$endgroup$
– verret
Jan 8 at 20:25
$begingroup$
I don't think this is true. It's easy to construct a counter-example, using piecewise linear functions.
$endgroup$
– verret
Jan 8 at 20:25
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You can't prove it because it isn't true. $f1$ could increase rapidly for a while as $f2$ is slowly decreasing, leading the sum to increase, then $f2$ could decrease rapidly for a while while $f1$ is slowly increasing, making the sum decrease. Repeat this and you can have as many peaks in the sum as you want. An example is below. $f1$ is in blue, $f2$ is in red, $f1+f2$ is in yellow and is bimodal
$endgroup$
add a comment |
$begingroup$
If $f_1$ is an increasing and $f_2$ is decreasing it is not necessarily true that $g(x):= f_1(x) + f_2(x)$ is unimodal. Consider the following example: $f_1(x) = x$ when $x<1$, $f(x) = 4x$ when $xgeq 1$, and $f_2(x) = -x^2$. Then $g(x)=x-x^2$ when $x<1$ and $g(x) = 4x-x^2$ when $xgeq 1$. The function $g(x)$ has two local maxima at $(1/2,1/4)$ and $(2, 4)$.
$endgroup$
add a comment |
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%2f3066482%2fis-f1f2-unimodal-if-f1-and-f2-is-monotonic%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$
You can't prove it because it isn't true. $f1$ could increase rapidly for a while as $f2$ is slowly decreasing, leading the sum to increase, then $f2$ could decrease rapidly for a while while $f1$ is slowly increasing, making the sum decrease. Repeat this and you can have as many peaks in the sum as you want. An example is below. $f1$ is in blue, $f2$ is in red, $f1+f2$ is in yellow and is bimodal
$endgroup$
add a comment |
$begingroup$
You can't prove it because it isn't true. $f1$ could increase rapidly for a while as $f2$ is slowly decreasing, leading the sum to increase, then $f2$ could decrease rapidly for a while while $f1$ is slowly increasing, making the sum decrease. Repeat this and you can have as many peaks in the sum as you want. An example is below. $f1$ is in blue, $f2$ is in red, $f1+f2$ is in yellow and is bimodal
$endgroup$
add a comment |
$begingroup$
You can't prove it because it isn't true. $f1$ could increase rapidly for a while as $f2$ is slowly decreasing, leading the sum to increase, then $f2$ could decrease rapidly for a while while $f1$ is slowly increasing, making the sum decrease. Repeat this and you can have as many peaks in the sum as you want. An example is below. $f1$ is in blue, $f2$ is in red, $f1+f2$ is in yellow and is bimodal
$endgroup$
You can't prove it because it isn't true. $f1$ could increase rapidly for a while as $f2$ is slowly decreasing, leading the sum to increase, then $f2$ could decrease rapidly for a while while $f1$ is slowly increasing, making the sum decrease. Repeat this and you can have as many peaks in the sum as you want. An example is below. $f1$ is in blue, $f2$ is in red, $f1+f2$ is in yellow and is bimodal
answered Jan 8 at 18:00
Ross MillikanRoss Millikan
301k24200375
301k24200375
add a comment |
add a comment |
$begingroup$
If $f_1$ is an increasing and $f_2$ is decreasing it is not necessarily true that $g(x):= f_1(x) + f_2(x)$ is unimodal. Consider the following example: $f_1(x) = x$ when $x<1$, $f(x) = 4x$ when $xgeq 1$, and $f_2(x) = -x^2$. Then $g(x)=x-x^2$ when $x<1$ and $g(x) = 4x-x^2$ when $xgeq 1$. The function $g(x)$ has two local maxima at $(1/2,1/4)$ and $(2, 4)$.
$endgroup$
add a comment |
$begingroup$
If $f_1$ is an increasing and $f_2$ is decreasing it is not necessarily true that $g(x):= f_1(x) + f_2(x)$ is unimodal. Consider the following example: $f_1(x) = x$ when $x<1$, $f(x) = 4x$ when $xgeq 1$, and $f_2(x) = -x^2$. Then $g(x)=x-x^2$ when $x<1$ and $g(x) = 4x-x^2$ when $xgeq 1$. The function $g(x)$ has two local maxima at $(1/2,1/4)$ and $(2, 4)$.
$endgroup$
add a comment |
$begingroup$
If $f_1$ is an increasing and $f_2$ is decreasing it is not necessarily true that $g(x):= f_1(x) + f_2(x)$ is unimodal. Consider the following example: $f_1(x) = x$ when $x<1$, $f(x) = 4x$ when $xgeq 1$, and $f_2(x) = -x^2$. Then $g(x)=x-x^2$ when $x<1$ and $g(x) = 4x-x^2$ when $xgeq 1$. The function $g(x)$ has two local maxima at $(1/2,1/4)$ and $(2, 4)$.
$endgroup$
If $f_1$ is an increasing and $f_2$ is decreasing it is not necessarily true that $g(x):= f_1(x) + f_2(x)$ is unimodal. Consider the following example: $f_1(x) = x$ when $x<1$, $f(x) = 4x$ when $xgeq 1$, and $f_2(x) = -x^2$. Then $g(x)=x-x^2$ when $x<1$ and $g(x) = 4x-x^2$ when $xgeq 1$. The function $g(x)$ has two local maxima at $(1/2,1/4)$ and $(2, 4)$.
answered Jan 8 at 18:00
irchansirchans
1,22949
1,22949
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%2f3066482%2fis-f1f2-unimodal-if-f1-and-f2-is-monotonic%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$
Do you mean one was increasing and one was decreasing? If they are both increasing, so is the sum, so the maximum comes at the top end of the allowable interval.
$endgroup$
– Ross Millikan
Jan 8 at 17:44
$begingroup$
edited. Thanks for pointing out
$endgroup$
– Parth Patel
Jan 8 at 17:49
$begingroup$
I don't think this is true. It's easy to construct a counter-example, using piecewise linear functions.
$endgroup$
– verret
Jan 8 at 20:25