How can $O(fg)=fO(g)$
$begingroup$
So it is known that $mathcal{O}(fg)=fcdot mathcal{O}(g)$. But what if $f$ is always negative, say a constant? Then $h=mathcal{O}(fg)$ implies there exist $C>0, x_0$ such that $|h(x)|le Cg(x)f(x)$ for $xge x_0$, and $g(x)f(x)$ are strictly positive for $xge x_0$. But this means that, in this case, $g(x)$ is always negative for $xge x_0$, since $f$ is always negative. Now what this means is that if some function is $mathcal{O}(g)$ then $g$ must take positive values too (by definition of how big-oh works), otherwise there can't be $mathcal{O}(g)$. Thus if $h=fmathcal{O}(g)$ then $|h(x)|le f(x)cdot Dcdot g(x)$ with $D>0$ and $g>0$ for these values of $x$, so that $|h(x)|$ is negative, which cannot be.
So what is it that I'm misunderstanding here?
real-analysis asymptotics computational-mathematics
$endgroup$
add a comment |
$begingroup$
So it is known that $mathcal{O}(fg)=fcdot mathcal{O}(g)$. But what if $f$ is always negative, say a constant? Then $h=mathcal{O}(fg)$ implies there exist $C>0, x_0$ such that $|h(x)|le Cg(x)f(x)$ for $xge x_0$, and $g(x)f(x)$ are strictly positive for $xge x_0$. But this means that, in this case, $g(x)$ is always negative for $xge x_0$, since $f$ is always negative. Now what this means is that if some function is $mathcal{O}(g)$ then $g$ must take positive values too (by definition of how big-oh works), otherwise there can't be $mathcal{O}(g)$. Thus if $h=fmathcal{O}(g)$ then $|h(x)|le f(x)cdot Dcdot g(x)$ with $D>0$ and $g>0$ for these values of $x$, so that $|h(x)|$ is negative, which cannot be.
So what is it that I'm misunderstanding here?
real-analysis asymptotics computational-mathematics
$endgroup$
add a comment |
$begingroup$
So it is known that $mathcal{O}(fg)=fcdot mathcal{O}(g)$. But what if $f$ is always negative, say a constant? Then $h=mathcal{O}(fg)$ implies there exist $C>0, x_0$ such that $|h(x)|le Cg(x)f(x)$ for $xge x_0$, and $g(x)f(x)$ are strictly positive for $xge x_0$. But this means that, in this case, $g(x)$ is always negative for $xge x_0$, since $f$ is always negative. Now what this means is that if some function is $mathcal{O}(g)$ then $g$ must take positive values too (by definition of how big-oh works), otherwise there can't be $mathcal{O}(g)$. Thus if $h=fmathcal{O}(g)$ then $|h(x)|le f(x)cdot Dcdot g(x)$ with $D>0$ and $g>0$ for these values of $x$, so that $|h(x)|$ is negative, which cannot be.
So what is it that I'm misunderstanding here?
real-analysis asymptotics computational-mathematics
$endgroup$
So it is known that $mathcal{O}(fg)=fcdot mathcal{O}(g)$. But what if $f$ is always negative, say a constant? Then $h=mathcal{O}(fg)$ implies there exist $C>0, x_0$ such that $|h(x)|le Cg(x)f(x)$ for $xge x_0$, and $g(x)f(x)$ are strictly positive for $xge x_0$. But this means that, in this case, $g(x)$ is always negative for $xge x_0$, since $f$ is always negative. Now what this means is that if some function is $mathcal{O}(g)$ then $g$ must take positive values too (by definition of how big-oh works), otherwise there can't be $mathcal{O}(g)$. Thus if $h=fmathcal{O}(g)$ then $|h(x)|le f(x)cdot Dcdot g(x)$ with $D>0$ and $g>0$ for these values of $x$, so that $|h(x)|$ is negative, which cannot be.
So what is it that I'm misunderstanding here?
real-analysis asymptotics computational-mathematics
real-analysis asymptotics computational-mathematics
asked Jan 24 at 3:41
sequencesequence
4,25731437
4,25731437
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
$mathcal{O}(g)$ only makes sense if $g(x)$ is strictly positive for sufficiently large $x$, and similarly $mathcal{O}(fg)$ only makes sense if $f(x)g(x)$ is positive for sufficiently large $x$. So the statement $fmathcal{O}(g)=mathcal{O}(fg)$ only makes sense if both $f(x)$ and $g(x)$ are strictly positive for sufficiently large $x$.
$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%2f3085421%2fhow-can-ofg-fog%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
$mathcal{O}(g)$ only makes sense if $g(x)$ is strictly positive for sufficiently large $x$, and similarly $mathcal{O}(fg)$ only makes sense if $f(x)g(x)$ is positive for sufficiently large $x$. So the statement $fmathcal{O}(g)=mathcal{O}(fg)$ only makes sense if both $f(x)$ and $g(x)$ are strictly positive for sufficiently large $x$.
$endgroup$
add a comment |
$begingroup$
$mathcal{O}(g)$ only makes sense if $g(x)$ is strictly positive for sufficiently large $x$, and similarly $mathcal{O}(fg)$ only makes sense if $f(x)g(x)$ is positive for sufficiently large $x$. So the statement $fmathcal{O}(g)=mathcal{O}(fg)$ only makes sense if both $f(x)$ and $g(x)$ are strictly positive for sufficiently large $x$.
$endgroup$
add a comment |
$begingroup$
$mathcal{O}(g)$ only makes sense if $g(x)$ is strictly positive for sufficiently large $x$, and similarly $mathcal{O}(fg)$ only makes sense if $f(x)g(x)$ is positive for sufficiently large $x$. So the statement $fmathcal{O}(g)=mathcal{O}(fg)$ only makes sense if both $f(x)$ and $g(x)$ are strictly positive for sufficiently large $x$.
$endgroup$
$mathcal{O}(g)$ only makes sense if $g(x)$ is strictly positive for sufficiently large $x$, and similarly $mathcal{O}(fg)$ only makes sense if $f(x)g(x)$ is positive for sufficiently large $x$. So the statement $fmathcal{O}(g)=mathcal{O}(fg)$ only makes sense if both $f(x)$ and $g(x)$ are strictly positive for sufficiently large $x$.
answered Jan 24 at 4:08
kccukccu
10.6k11228
10.6k11228
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%2f3085421%2fhow-can-ofg-fog%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