Can we multiply both sides of a limit equation?
$begingroup$
Compute $lim_{x to -1} f(x)$ for a function $f: mathbb R to mathbb R$ such that
$$4 = lim_{x to -1} frac{f(x)+2}{x+1} - frac{x}{x^2-1} tag{1}$$
$$ = lim_{x to -1} frac{f(x)+2}{x+1} - frac{frac{x}{x-1}}{x+1}$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
- Solution 1: My approach is that the numerator $f(x)+2 - frac{x}{x-1}$ must approach zero as $x to -1$ because the denominator approaches zero as $x to -1$ and so $lim_{x to -1} f(x) = -frac{3}{2}$.
Are we allowed to do the following, which seems to be the required solution, instead? This does not seem very rigorous, and I have a feeling there are obvious counterexamples. Of course, we can use $varepsilon-delta$ to check our answer, but I would like to know if and how this can be generalised for any function $f: mathbb R to mathbb R$.
- Solution 2: Observe
$$0 = lim_{x to -1} x+1$$
Then
$$4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
$$implies 0 = 0 cdot 4 = (lim_{x to -1} x+1) cdot 4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} lim_{x to -1} x+1$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} x+1 = lim_{x to -1} (f(x)+2 - frac{x}{x-1})$$
$$ = lim_{x to -1} f(x) + lim_{x to -1} 2 - lim_{x to -1} frac{x}{x-1} = lim_{x to -1} f(x)+2 - frac12 = lim_{x to -1} f(x)+ frac32$$
$$implies - frac32 = lim_{x to -1} f(x) tag{2}$$
I suspect the preceding solution is not rigorous, and this is a case where we have only a guess and must check our answer by proving $(1)$, by computation since $varepsilon-delta$ is actually not yet allowed, assuming $(2)$, so if one does then preceding solution, then one must follow up with a computation. I'm not quite sure what the problem is, but it might be that we don't know $lim_{x to -1} f(x)$ exists in the first place.
Is the fact that the domain and range are both $mathbb R$ relevant? I think of a counterexample like $f: {7,8,10} to {1,2}$ or $f: C to mathbb Q^c$ where $C$ is the Cantor set.
real-analysis calculus limits alternative-proof
$endgroup$
add a comment |
$begingroup$
Compute $lim_{x to -1} f(x)$ for a function $f: mathbb R to mathbb R$ such that
$$4 = lim_{x to -1} frac{f(x)+2}{x+1} - frac{x}{x^2-1} tag{1}$$
$$ = lim_{x to -1} frac{f(x)+2}{x+1} - frac{frac{x}{x-1}}{x+1}$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
- Solution 1: My approach is that the numerator $f(x)+2 - frac{x}{x-1}$ must approach zero as $x to -1$ because the denominator approaches zero as $x to -1$ and so $lim_{x to -1} f(x) = -frac{3}{2}$.
Are we allowed to do the following, which seems to be the required solution, instead? This does not seem very rigorous, and I have a feeling there are obvious counterexamples. Of course, we can use $varepsilon-delta$ to check our answer, but I would like to know if and how this can be generalised for any function $f: mathbb R to mathbb R$.
- Solution 2: Observe
$$0 = lim_{x to -1} x+1$$
Then
$$4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
$$implies 0 = 0 cdot 4 = (lim_{x to -1} x+1) cdot 4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} lim_{x to -1} x+1$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} x+1 = lim_{x to -1} (f(x)+2 - frac{x}{x-1})$$
$$ = lim_{x to -1} f(x) + lim_{x to -1} 2 - lim_{x to -1} frac{x}{x-1} = lim_{x to -1} f(x)+2 - frac12 = lim_{x to -1} f(x)+ frac32$$
$$implies - frac32 = lim_{x to -1} f(x) tag{2}$$
I suspect the preceding solution is not rigorous, and this is a case where we have only a guess and must check our answer by proving $(1)$, by computation since $varepsilon-delta$ is actually not yet allowed, assuming $(2)$, so if one does then preceding solution, then one must follow up with a computation. I'm not quite sure what the problem is, but it might be that we don't know $lim_{x to -1} f(x)$ exists in the first place.
Is the fact that the domain and range are both $mathbb R$ relevant? I think of a counterexample like $f: {7,8,10} to {1,2}$ or $f: C to mathbb Q^c$ where $C$ is the Cantor set.
real-analysis calculus limits alternative-proof
$endgroup$
add a comment |
$begingroup$
Compute $lim_{x to -1} f(x)$ for a function $f: mathbb R to mathbb R$ such that
$$4 = lim_{x to -1} frac{f(x)+2}{x+1} - frac{x}{x^2-1} tag{1}$$
$$ = lim_{x to -1} frac{f(x)+2}{x+1} - frac{frac{x}{x-1}}{x+1}$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
- Solution 1: My approach is that the numerator $f(x)+2 - frac{x}{x-1}$ must approach zero as $x to -1$ because the denominator approaches zero as $x to -1$ and so $lim_{x to -1} f(x) = -frac{3}{2}$.
Are we allowed to do the following, which seems to be the required solution, instead? This does not seem very rigorous, and I have a feeling there are obvious counterexamples. Of course, we can use $varepsilon-delta$ to check our answer, but I would like to know if and how this can be generalised for any function $f: mathbb R to mathbb R$.
- Solution 2: Observe
$$0 = lim_{x to -1} x+1$$
Then
$$4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
$$implies 0 = 0 cdot 4 = (lim_{x to -1} x+1) cdot 4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} lim_{x to -1} x+1$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} x+1 = lim_{x to -1} (f(x)+2 - frac{x}{x-1})$$
$$ = lim_{x to -1} f(x) + lim_{x to -1} 2 - lim_{x to -1} frac{x}{x-1} = lim_{x to -1} f(x)+2 - frac12 = lim_{x to -1} f(x)+ frac32$$
$$implies - frac32 = lim_{x to -1} f(x) tag{2}$$
I suspect the preceding solution is not rigorous, and this is a case where we have only a guess and must check our answer by proving $(1)$, by computation since $varepsilon-delta$ is actually not yet allowed, assuming $(2)$, so if one does then preceding solution, then one must follow up with a computation. I'm not quite sure what the problem is, but it might be that we don't know $lim_{x to -1} f(x)$ exists in the first place.
Is the fact that the domain and range are both $mathbb R$ relevant? I think of a counterexample like $f: {7,8,10} to {1,2}$ or $f: C to mathbb Q^c$ where $C$ is the Cantor set.
real-analysis calculus limits alternative-proof
$endgroup$
Compute $lim_{x to -1} f(x)$ for a function $f: mathbb R to mathbb R$ such that
$$4 = lim_{x to -1} frac{f(x)+2}{x+1} - frac{x}{x^2-1} tag{1}$$
$$ = lim_{x to -1} frac{f(x)+2}{x+1} - frac{frac{x}{x-1}}{x+1}$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
- Solution 1: My approach is that the numerator $f(x)+2 - frac{x}{x-1}$ must approach zero as $x to -1$ because the denominator approaches zero as $x to -1$ and so $lim_{x to -1} f(x) = -frac{3}{2}$.
Are we allowed to do the following, which seems to be the required solution, instead? This does not seem very rigorous, and I have a feeling there are obvious counterexamples. Of course, we can use $varepsilon-delta$ to check our answer, but I would like to know if and how this can be generalised for any function $f: mathbb R to mathbb R$.
- Solution 2: Observe
$$0 = lim_{x to -1} x+1$$
Then
$$4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1}$$
$$implies 0 = 0 cdot 4 = (lim_{x to -1} x+1) cdot 4 = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} lim_{x to -1} x+1$$
$$ = lim_{x to -1} frac{f(x)+2 - frac{x}{x-1}}{x+1} x+1 = lim_{x to -1} (f(x)+2 - frac{x}{x-1})$$
$$ = lim_{x to -1} f(x) + lim_{x to -1} 2 - lim_{x to -1} frac{x}{x-1} = lim_{x to -1} f(x)+2 - frac12 = lim_{x to -1} f(x)+ frac32$$
$$implies - frac32 = lim_{x to -1} f(x) tag{2}$$
I suspect the preceding solution is not rigorous, and this is a case where we have only a guess and must check our answer by proving $(1)$, by computation since $varepsilon-delta$ is actually not yet allowed, assuming $(2)$, so if one does then preceding solution, then one must follow up with a computation. I'm not quite sure what the problem is, but it might be that we don't know $lim_{x to -1} f(x)$ exists in the first place.
Is the fact that the domain and range are both $mathbb R$ relevant? I think of a counterexample like $f: {7,8,10} to {1,2}$ or $f: C to mathbb Q^c$ where $C$ is the Cantor set.
real-analysis calculus limits alternative-proof
real-analysis calculus limits alternative-proof
edited Jan 19 at 15:43
Mitjackson
asked Jan 19 at 15:15
MitjacksonMitjackson
365
365
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If $l:=lim_{xto a}g(x),,m:=lim_{xto a}h(x)$ exist and aren't $pminfty$, you can indeed write $lm:=lim_{xto a}g(x)h(x)$. In the case $l=0$ note that, when $x$ is close enough to $a$ to constrain $h$ to some interval around $m$, this upper-bounds $|h|$ (say with $|h|ge U,,U<infty$) so $|g|lefrac{epsilon}{U}to|g|leepsilon$. Note that as long as the domain and range are such that $|g|,,|h|$ can be bounded and one is arbitrarily small in the limit, we're fine.
$endgroup$
$begingroup$
Is solution 2 considered complete? What's an example where $|g|$ or $|h|$ isn't bounded please? What about an example of an $f: A to B$ where the above doesn't work? Thanks!
$endgroup$
– Mitjackson
Jan 19 at 15:57
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%2f3079448%2fcan-we-multiply-both-sides-of-a-limit-equation%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$
If $l:=lim_{xto a}g(x),,m:=lim_{xto a}h(x)$ exist and aren't $pminfty$, you can indeed write $lm:=lim_{xto a}g(x)h(x)$. In the case $l=0$ note that, when $x$ is close enough to $a$ to constrain $h$ to some interval around $m$, this upper-bounds $|h|$ (say with $|h|ge U,,U<infty$) so $|g|lefrac{epsilon}{U}to|g|leepsilon$. Note that as long as the domain and range are such that $|g|,,|h|$ can be bounded and one is arbitrarily small in the limit, we're fine.
$endgroup$
$begingroup$
Is solution 2 considered complete? What's an example where $|g|$ or $|h|$ isn't bounded please? What about an example of an $f: A to B$ where the above doesn't work? Thanks!
$endgroup$
– Mitjackson
Jan 19 at 15:57
add a comment |
$begingroup$
If $l:=lim_{xto a}g(x),,m:=lim_{xto a}h(x)$ exist and aren't $pminfty$, you can indeed write $lm:=lim_{xto a}g(x)h(x)$. In the case $l=0$ note that, when $x$ is close enough to $a$ to constrain $h$ to some interval around $m$, this upper-bounds $|h|$ (say with $|h|ge U,,U<infty$) so $|g|lefrac{epsilon}{U}to|g|leepsilon$. Note that as long as the domain and range are such that $|g|,,|h|$ can be bounded and one is arbitrarily small in the limit, we're fine.
$endgroup$
$begingroup$
Is solution 2 considered complete? What's an example where $|g|$ or $|h|$ isn't bounded please? What about an example of an $f: A to B$ where the above doesn't work? Thanks!
$endgroup$
– Mitjackson
Jan 19 at 15:57
add a comment |
$begingroup$
If $l:=lim_{xto a}g(x),,m:=lim_{xto a}h(x)$ exist and aren't $pminfty$, you can indeed write $lm:=lim_{xto a}g(x)h(x)$. In the case $l=0$ note that, when $x$ is close enough to $a$ to constrain $h$ to some interval around $m$, this upper-bounds $|h|$ (say with $|h|ge U,,U<infty$) so $|g|lefrac{epsilon}{U}to|g|leepsilon$. Note that as long as the domain and range are such that $|g|,,|h|$ can be bounded and one is arbitrarily small in the limit, we're fine.
$endgroup$
If $l:=lim_{xto a}g(x),,m:=lim_{xto a}h(x)$ exist and aren't $pminfty$, you can indeed write $lm:=lim_{xto a}g(x)h(x)$. In the case $l=0$ note that, when $x$ is close enough to $a$ to constrain $h$ to some interval around $m$, this upper-bounds $|h|$ (say with $|h|ge U,,U<infty$) so $|g|lefrac{epsilon}{U}to|g|leepsilon$. Note that as long as the domain and range are such that $|g|,,|h|$ can be bounded and one is arbitrarily small in the limit, we're fine.
answered Jan 19 at 15:46
J.G.J.G.
27k22843
27k22843
$begingroup$
Is solution 2 considered complete? What's an example where $|g|$ or $|h|$ isn't bounded please? What about an example of an $f: A to B$ where the above doesn't work? Thanks!
$endgroup$
– Mitjackson
Jan 19 at 15:57
add a comment |
$begingroup$
Is solution 2 considered complete? What's an example where $|g|$ or $|h|$ isn't bounded please? What about an example of an $f: A to B$ where the above doesn't work? Thanks!
$endgroup$
– Mitjackson
Jan 19 at 15:57
$begingroup$
Is solution 2 considered complete? What's an example where $|g|$ or $|h|$ isn't bounded please? What about an example of an $f: A to B$ where the above doesn't work? Thanks!
$endgroup$
– Mitjackson
Jan 19 at 15:57
$begingroup$
Is solution 2 considered complete? What's an example where $|g|$ or $|h|$ isn't bounded please? What about an example of an $f: A to B$ where the above doesn't work? Thanks!
$endgroup$
– Mitjackson
Jan 19 at 15:57
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%2f3079448%2fcan-we-multiply-both-sides-of-a-limit-equation%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