Prove that this function is a contraction
$begingroup$
Let $f in C^2([a,b])$ be a function with the following properties:
(i) $f(a)f(b) <0 $
(ii) $f'(x) neq 0$ $forall x$
(iii) $frac{|f(a)|} {|f'(a)|} <(b-a)$ and $frac{|f(b)|} {|f'(b)|} <(b-a)$
(iv) $ f''(x) leq 0$ $forall x$
Then $h(x) := x-frac{f(x)} {f'(x)} $ is a contraction.
What I did is:
Suppose wlog $f(a)<0<f(b)$ and so $f'(x)>0$. We have
$|h'(x)| leq... leq L<1$
I don't know how to do the middle part, maybe we have $frac{|f(x)|} {|f'(x)|} <(b-a)$ $forall x$? (not sure)
Curiosity: thie statement will prove a theorem of converge for the Newton method
calculus functions contraction-operator
$endgroup$
add a comment |
$begingroup$
Let $f in C^2([a,b])$ be a function with the following properties:
(i) $f(a)f(b) <0 $
(ii) $f'(x) neq 0$ $forall x$
(iii) $frac{|f(a)|} {|f'(a)|} <(b-a)$ and $frac{|f(b)|} {|f'(b)|} <(b-a)$
(iv) $ f''(x) leq 0$ $forall x$
Then $h(x) := x-frac{f(x)} {f'(x)} $ is a contraction.
What I did is:
Suppose wlog $f(a)<0<f(b)$ and so $f'(x)>0$. We have
$|h'(x)| leq... leq L<1$
I don't know how to do the middle part, maybe we have $frac{|f(x)|} {|f'(x)|} <(b-a)$ $forall x$? (not sure)
Curiosity: thie statement will prove a theorem of converge for the Newton method
calculus functions contraction-operator
$endgroup$
$begingroup$
We can prove that $frac{|f(x)|}{|f'(x)|} < b-a$ for all $x$. Indeed, $f$ is increasing since $f' >0$ while $f'$ is decreasing by assumption, so that $frac{f}{f'}$ is increasing. Since the inequality is satisfied at both endpoints, it must be true for all $x in [a,b]$.
$endgroup$
– Michh
Dec 29 '18 at 5:43
add a comment |
$begingroup$
Let $f in C^2([a,b])$ be a function with the following properties:
(i) $f(a)f(b) <0 $
(ii) $f'(x) neq 0$ $forall x$
(iii) $frac{|f(a)|} {|f'(a)|} <(b-a)$ and $frac{|f(b)|} {|f'(b)|} <(b-a)$
(iv) $ f''(x) leq 0$ $forall x$
Then $h(x) := x-frac{f(x)} {f'(x)} $ is a contraction.
What I did is:
Suppose wlog $f(a)<0<f(b)$ and so $f'(x)>0$. We have
$|h'(x)| leq... leq L<1$
I don't know how to do the middle part, maybe we have $frac{|f(x)|} {|f'(x)|} <(b-a)$ $forall x$? (not sure)
Curiosity: thie statement will prove a theorem of converge for the Newton method
calculus functions contraction-operator
$endgroup$
Let $f in C^2([a,b])$ be a function with the following properties:
(i) $f(a)f(b) <0 $
(ii) $f'(x) neq 0$ $forall x$
(iii) $frac{|f(a)|} {|f'(a)|} <(b-a)$ and $frac{|f(b)|} {|f'(b)|} <(b-a)$
(iv) $ f''(x) leq 0$ $forall x$
Then $h(x) := x-frac{f(x)} {f'(x)} $ is a contraction.
What I did is:
Suppose wlog $f(a)<0<f(b)$ and so $f'(x)>0$. We have
$|h'(x)| leq... leq L<1$
I don't know how to do the middle part, maybe we have $frac{|f(x)|} {|f'(x)|} <(b-a)$ $forall x$? (not sure)
Curiosity: thie statement will prove a theorem of converge for the Newton method
calculus functions contraction-operator
calculus functions contraction-operator
edited Dec 28 '18 at 4:24
Naj Kamp
asked Dec 28 '18 at 4:09
Naj KampNaj Kamp
1178
1178
$begingroup$
We can prove that $frac{|f(x)|}{|f'(x)|} < b-a$ for all $x$. Indeed, $f$ is increasing since $f' >0$ while $f'$ is decreasing by assumption, so that $frac{f}{f'}$ is increasing. Since the inequality is satisfied at both endpoints, it must be true for all $x in [a,b]$.
$endgroup$
– Michh
Dec 29 '18 at 5:43
add a comment |
$begingroup$
We can prove that $frac{|f(x)|}{|f'(x)|} < b-a$ for all $x$. Indeed, $f$ is increasing since $f' >0$ while $f'$ is decreasing by assumption, so that $frac{f}{f'}$ is increasing. Since the inequality is satisfied at both endpoints, it must be true for all $x in [a,b]$.
$endgroup$
– Michh
Dec 29 '18 at 5:43
$begingroup$
We can prove that $frac{|f(x)|}{|f'(x)|} < b-a$ for all $x$. Indeed, $f$ is increasing since $f' >0$ while $f'$ is decreasing by assumption, so that $frac{f}{f'}$ is increasing. Since the inequality is satisfied at both endpoints, it must be true for all $x in [a,b]$.
$endgroup$
– Michh
Dec 29 '18 at 5:43
$begingroup$
We can prove that $frac{|f(x)|}{|f'(x)|} < b-a$ for all $x$. Indeed, $f$ is increasing since $f' >0$ while $f'$ is decreasing by assumption, so that $frac{f}{f'}$ is increasing. Since the inequality is satisfied at both endpoints, it must be true for all $x in [a,b]$.
$endgroup$
– Michh
Dec 29 '18 at 5:43
add a comment |
0
active
oldest
votes
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%2f3054561%2fprove-that-this-function-is-a-contraction%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3054561%2fprove-that-this-function-is-a-contraction%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$
We can prove that $frac{|f(x)|}{|f'(x)|} < b-a$ for all $x$. Indeed, $f$ is increasing since $f' >0$ while $f'$ is decreasing by assumption, so that $frac{f}{f'}$ is increasing. Since the inequality is satisfied at both endpoints, it must be true for all $x in [a,b]$.
$endgroup$
– Michh
Dec 29 '18 at 5:43