Prove $p_n(x) rightarrow sqrtx$ uniformly as $n rightarrow infty$ The 2019 Stack Overflow Developer Survey Results Are InShow that a next polynomial function sequence converges uniformly to $sqrtx$Is this sequence monotonically increasing?Help on recursion relation (when applying $n$ times)How to prove a sequence of a function converges uniformly?Convergence of monotone $f_n:[0, infty) rightarrow [0,1]$ to continuous, monotone $g$ is uniformProve $f_n(x_n) rightarrow L$ as $n rightarrow infty$Pointwise convergence to infinity implies uniformly convergence?How should I prove a uniformly continuous sequence of real-valued continuous function is equicontinuous?Show that $f_n(cdot)$ is uniformly convergent.Show that sequence is uniformly bounded and equicontinuous.the sequence $f_n$ is uniformly convergent$2p_n+1(t)= t^2+2p_n(t)-p_n(t)^2$ uniformly convergent to $|t|$If $f_n rightarrow f$ pointwise, then $f_n rightarrow f$ uniformly, given $exists C$ such that $|f_n(x) - f_n(y)| le C|x-y|$.
Pokemon Turn Based battle (Python)
What do I do when my TA workload is more than expected?
Can we generate random numbers using irrational numbers like π and e?
Why can't devices on different VLANs, but on the same subnet, communicate?
How to type this arrow in math mode?
Why isn't the circumferential light around the M87 black hole's event horizon symmetric?
What could be the right powersource for 15 seconds lifespan disposable giant chainsaw?
Is it safe to harvest rainwater that fell on solar panels?
Short story: child made less intelligent and less attractive
The phrase "to the numbers born"?
Old scifi movie from the 50s or 60s with men in solid red uniforms who interrogate a spy from the past
Why does the nucleus not repel itself?
If I score a critical hit on an 18 or higher, what are my chances of getting a critical hit if I roll 3d20?
Why not take a picture of a closer black hole?
What is the motivation for a law requiring 2 parties to consent for recording a conversation
Is it okay to consider publishing in my first year of PhD?
Will it cause any balance problems to have PCs level up and gain the benefits of a long rest mid-fight?
What information about me do stores get via my credit card?
Does adding complexity mean a more secure cipher?
How to support a colleague who finds meetings extremely tiring?
Is it ethical to upload a automatically generated paper to a non peer-reviewed site as part of a larger research?
What force causes entropy to increase?
What to do when moving next to a bird sanctuary with a loosely-domesticated cat?
What does もの mean in this sentence?
Prove $p_n(x) rightarrow sqrtx$ uniformly as $n rightarrow infty$
The 2019 Stack Overflow Developer Survey Results Are InShow that a next polynomial function sequence converges uniformly to $sqrtx$Is this sequence monotonically increasing?Help on recursion relation (when applying $n$ times)How to prove a sequence of a function converges uniformly?Convergence of monotone $f_n:[0, infty) rightarrow [0,1]$ to continuous, monotone $g$ is uniformProve $f_n(x_n) rightarrow L$ as $n rightarrow infty$Pointwise convergence to infinity implies uniformly convergence?How should I prove a uniformly continuous sequence of real-valued continuous function is equicontinuous?Show that $f_n(cdot)$ is uniformly convergent.Show that sequence is uniformly bounded and equicontinuous.the sequence $f_n$ is uniformly convergent$2p_n+1(t)= t^2+2p_n(t)-p_n(t)^2$ uniformly convergent to $|t|$If $f_n rightarrow f$ pointwise, then $f_n rightarrow f$ uniformly, given $exists C$ such that $|f_n(x) - f_n(y)| le C|x-y|$.
$begingroup$
Define $(p_n)_n$ recursively by $p_0(x) = 0$ and $p_n+1(x) = p_n(x) + frac12(x - p_n(x)^2)$. Prove that $p_n(x) rightarrow sqrtx$ uniformly for $0 leq x leq 1$ as $n rightarrow infty$.
I'm not sure where to go with this. I can show inductively that $forall n, 0 leq p_n(x) leq 1$ for $0 leq x leq 1$, and I think that $p_n(x)$ is increasing with $n$, but I have no idea whether this helps me. I know that I need to show that
$forall epsilon>0: exists N in mathbbN: forall n geq N: forall xin [0,1]: big|p_n(x) - sqrtxbig| < epsilon$
Edit: I just had a thought. I'm given a version of Dini's theorem that reads
Let $X$ be a compact metric space, $(f_n)_n$ a sequence of real-valued continuous functions on $X$, $f$ a continuous function on $X$ such that:
(i) $f_n rightarrow f$ pointwise on $X$, and
(ii) $f_n(x) geq f_n+1(x) $ for all $x in X, n in mathbbN$.
Then: $f_n rightarrow f$ uniformly on $X$.
Obviously, (ii) is not true for my sequence, but what if I took $f_n(x) = -p_n(x)$ and $f(x) = - sqrtx$? Then I could prove (ii) to be true, I know that $[0,1]$ is compact, and $f_n(x)$ is real-valued. The only part I would need to prove is (i), which is where I get confused. Correct me if I'm wrong, but after that I could say that since $(-p_n)_n rightarrow -sqrtx$, then $(p_n)_n rightarrow sqrtx$. Any advice?
real-analysis
$endgroup$
add a comment |
$begingroup$
Define $(p_n)_n$ recursively by $p_0(x) = 0$ and $p_n+1(x) = p_n(x) + frac12(x - p_n(x)^2)$. Prove that $p_n(x) rightarrow sqrtx$ uniformly for $0 leq x leq 1$ as $n rightarrow infty$.
I'm not sure where to go with this. I can show inductively that $forall n, 0 leq p_n(x) leq 1$ for $0 leq x leq 1$, and I think that $p_n(x)$ is increasing with $n$, but I have no idea whether this helps me. I know that I need to show that
$forall epsilon>0: exists N in mathbbN: forall n geq N: forall xin [0,1]: big|p_n(x) - sqrtxbig| < epsilon$
Edit: I just had a thought. I'm given a version of Dini's theorem that reads
Let $X$ be a compact metric space, $(f_n)_n$ a sequence of real-valued continuous functions on $X$, $f$ a continuous function on $X$ such that:
(i) $f_n rightarrow f$ pointwise on $X$, and
(ii) $f_n(x) geq f_n+1(x) $ for all $x in X, n in mathbbN$.
Then: $f_n rightarrow f$ uniformly on $X$.
Obviously, (ii) is not true for my sequence, but what if I took $f_n(x) = -p_n(x)$ and $f(x) = - sqrtx$? Then I could prove (ii) to be true, I know that $[0,1]$ is compact, and $f_n(x)$ is real-valued. The only part I would need to prove is (i), which is where I get confused. Correct me if I'm wrong, but after that I could say that since $(-p_n)_n rightarrow -sqrtx$, then $(p_n)_n rightarrow sqrtx$. Any advice?
real-analysis
$endgroup$
add a comment |
$begingroup$
Define $(p_n)_n$ recursively by $p_0(x) = 0$ and $p_n+1(x) = p_n(x) + frac12(x - p_n(x)^2)$. Prove that $p_n(x) rightarrow sqrtx$ uniformly for $0 leq x leq 1$ as $n rightarrow infty$.
I'm not sure where to go with this. I can show inductively that $forall n, 0 leq p_n(x) leq 1$ for $0 leq x leq 1$, and I think that $p_n(x)$ is increasing with $n$, but I have no idea whether this helps me. I know that I need to show that
$forall epsilon>0: exists N in mathbbN: forall n geq N: forall xin [0,1]: big|p_n(x) - sqrtxbig| < epsilon$
Edit: I just had a thought. I'm given a version of Dini's theorem that reads
Let $X$ be a compact metric space, $(f_n)_n$ a sequence of real-valued continuous functions on $X$, $f$ a continuous function on $X$ such that:
(i) $f_n rightarrow f$ pointwise on $X$, and
(ii) $f_n(x) geq f_n+1(x) $ for all $x in X, n in mathbbN$.
Then: $f_n rightarrow f$ uniformly on $X$.
Obviously, (ii) is not true for my sequence, but what if I took $f_n(x) = -p_n(x)$ and $f(x) = - sqrtx$? Then I could prove (ii) to be true, I know that $[0,1]$ is compact, and $f_n(x)$ is real-valued. The only part I would need to prove is (i), which is where I get confused. Correct me if I'm wrong, but after that I could say that since $(-p_n)_n rightarrow -sqrtx$, then $(p_n)_n rightarrow sqrtx$. Any advice?
real-analysis
$endgroup$
Define $(p_n)_n$ recursively by $p_0(x) = 0$ and $p_n+1(x) = p_n(x) + frac12(x - p_n(x)^2)$. Prove that $p_n(x) rightarrow sqrtx$ uniformly for $0 leq x leq 1$ as $n rightarrow infty$.
I'm not sure where to go with this. I can show inductively that $forall n, 0 leq p_n(x) leq 1$ for $0 leq x leq 1$, and I think that $p_n(x)$ is increasing with $n$, but I have no idea whether this helps me. I know that I need to show that
$forall epsilon>0: exists N in mathbbN: forall n geq N: forall xin [0,1]: big|p_n(x) - sqrtxbig| < epsilon$
Edit: I just had a thought. I'm given a version of Dini's theorem that reads
Let $X$ be a compact metric space, $(f_n)_n$ a sequence of real-valued continuous functions on $X$, $f$ a continuous function on $X$ such that:
(i) $f_n rightarrow f$ pointwise on $X$, and
(ii) $f_n(x) geq f_n+1(x) $ for all $x in X, n in mathbbN$.
Then: $f_n rightarrow f$ uniformly on $X$.
Obviously, (ii) is not true for my sequence, but what if I took $f_n(x) = -p_n(x)$ and $f(x) = - sqrtx$? Then I could prove (ii) to be true, I know that $[0,1]$ is compact, and $f_n(x)$ is real-valued. The only part I would need to prove is (i), which is where I get confused. Correct me if I'm wrong, but after that I could say that since $(-p_n)_n rightarrow -sqrtx$, then $(p_n)_n rightarrow sqrtx$. Any advice?
real-analysis
real-analysis
edited Dec 7 '15 at 22:35
Claycrusher
asked Dec 7 '15 at 4:42
ClaycrusherClaycrusher
35819
35819
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
By the recursion formula, we have
$$p_n + 1(x) - sqrtx = (p_n(x) - sqrtx)left[1 - frac12(p_n(x) + sqrtx)right].$$
Use this recursion $n$ times, it follows that
$$p_n(x) - sqrtx = (p_0(x) - sqrtx)prod_k = 0^n - 1left[1 - frac12(p_k(x) + sqrtx)right]. tag1$$
We shall show that for each $k$, it holds that
$$0 leq 1 - frac12(p_k(x) + sqrtx) leq 1 - frac12sqrtx. tag2$$
It is easy to see that $p_n(x) geq 0$ for $x in [0, 1]$ (as you stated, it in fact holds that $0 leq p_n(x) leq 1$, which can be proved inductively), hence the right inequality of $(2)$ holds. To show the left side inequality, notice that
beginalign
& 2 - p_k(x) - sqrtx \
= & 2 - p_k - 1(x) - frac12x + frac12p_k - 1^2(x) - sqrtx \
= & frac12(p_k - 1(x) - 1)^2 + frac32 - frac12x - sqrtx \
geq & frac12(p_k - 1(x) - 1)^2 geq 0.
endalign
Therefore $(2)$ holds. Consequently, we can obtain an upper bound of the right hand side of $(1)$:
beginalign
& |p_n(x) - sqrtx| \
= & sqrtx prod_k = 0^n - 1left| 1 - frac12(p_k(x) + sqrtx)right| \
leq & sqrtxleft(1 - frac12sqrtxright)^n tag3
endalign
Since the right side of $(3)$ converges to $0$ uniformly as $n to infty$, the result follows.
$endgroup$
$begingroup$
Thank you for your answer. It took reading through a couple times, but I think I get it, and it's brilliant. I'm hoping to find an approach using Dini's theorem, which I've added to the original question, but honestly I think this proof is way cooler.
$endgroup$
– Claycrusher
Dec 7 '15 at 22:30
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%2f1563679%2fprove-p-nx-rightarrow-sqrtx-uniformly-as-n-rightarrow-infty%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$
By the recursion formula, we have
$$p_n + 1(x) - sqrtx = (p_n(x) - sqrtx)left[1 - frac12(p_n(x) + sqrtx)right].$$
Use this recursion $n$ times, it follows that
$$p_n(x) - sqrtx = (p_0(x) - sqrtx)prod_k = 0^n - 1left[1 - frac12(p_k(x) + sqrtx)right]. tag1$$
We shall show that for each $k$, it holds that
$$0 leq 1 - frac12(p_k(x) + sqrtx) leq 1 - frac12sqrtx. tag2$$
It is easy to see that $p_n(x) geq 0$ for $x in [0, 1]$ (as you stated, it in fact holds that $0 leq p_n(x) leq 1$, which can be proved inductively), hence the right inequality of $(2)$ holds. To show the left side inequality, notice that
beginalign
& 2 - p_k(x) - sqrtx \
= & 2 - p_k - 1(x) - frac12x + frac12p_k - 1^2(x) - sqrtx \
= & frac12(p_k - 1(x) - 1)^2 + frac32 - frac12x - sqrtx \
geq & frac12(p_k - 1(x) - 1)^2 geq 0.
endalign
Therefore $(2)$ holds. Consequently, we can obtain an upper bound of the right hand side of $(1)$:
beginalign
& |p_n(x) - sqrtx| \
= & sqrtx prod_k = 0^n - 1left| 1 - frac12(p_k(x) + sqrtx)right| \
leq & sqrtxleft(1 - frac12sqrtxright)^n tag3
endalign
Since the right side of $(3)$ converges to $0$ uniformly as $n to infty$, the result follows.
$endgroup$
$begingroup$
Thank you for your answer. It took reading through a couple times, but I think I get it, and it's brilliant. I'm hoping to find an approach using Dini's theorem, which I've added to the original question, but honestly I think this proof is way cooler.
$endgroup$
– Claycrusher
Dec 7 '15 at 22:30
add a comment |
$begingroup$
By the recursion formula, we have
$$p_n + 1(x) - sqrtx = (p_n(x) - sqrtx)left[1 - frac12(p_n(x) + sqrtx)right].$$
Use this recursion $n$ times, it follows that
$$p_n(x) - sqrtx = (p_0(x) - sqrtx)prod_k = 0^n - 1left[1 - frac12(p_k(x) + sqrtx)right]. tag1$$
We shall show that for each $k$, it holds that
$$0 leq 1 - frac12(p_k(x) + sqrtx) leq 1 - frac12sqrtx. tag2$$
It is easy to see that $p_n(x) geq 0$ for $x in [0, 1]$ (as you stated, it in fact holds that $0 leq p_n(x) leq 1$, which can be proved inductively), hence the right inequality of $(2)$ holds. To show the left side inequality, notice that
beginalign
& 2 - p_k(x) - sqrtx \
= & 2 - p_k - 1(x) - frac12x + frac12p_k - 1^2(x) - sqrtx \
= & frac12(p_k - 1(x) - 1)^2 + frac32 - frac12x - sqrtx \
geq & frac12(p_k - 1(x) - 1)^2 geq 0.
endalign
Therefore $(2)$ holds. Consequently, we can obtain an upper bound of the right hand side of $(1)$:
beginalign
& |p_n(x) - sqrtx| \
= & sqrtx prod_k = 0^n - 1left| 1 - frac12(p_k(x) + sqrtx)right| \
leq & sqrtxleft(1 - frac12sqrtxright)^n tag3
endalign
Since the right side of $(3)$ converges to $0$ uniformly as $n to infty$, the result follows.
$endgroup$
$begingroup$
Thank you for your answer. It took reading through a couple times, but I think I get it, and it's brilliant. I'm hoping to find an approach using Dini's theorem, which I've added to the original question, but honestly I think this proof is way cooler.
$endgroup$
– Claycrusher
Dec 7 '15 at 22:30
add a comment |
$begingroup$
By the recursion formula, we have
$$p_n + 1(x) - sqrtx = (p_n(x) - sqrtx)left[1 - frac12(p_n(x) + sqrtx)right].$$
Use this recursion $n$ times, it follows that
$$p_n(x) - sqrtx = (p_0(x) - sqrtx)prod_k = 0^n - 1left[1 - frac12(p_k(x) + sqrtx)right]. tag1$$
We shall show that for each $k$, it holds that
$$0 leq 1 - frac12(p_k(x) + sqrtx) leq 1 - frac12sqrtx. tag2$$
It is easy to see that $p_n(x) geq 0$ for $x in [0, 1]$ (as you stated, it in fact holds that $0 leq p_n(x) leq 1$, which can be proved inductively), hence the right inequality of $(2)$ holds. To show the left side inequality, notice that
beginalign
& 2 - p_k(x) - sqrtx \
= & 2 - p_k - 1(x) - frac12x + frac12p_k - 1^2(x) - sqrtx \
= & frac12(p_k - 1(x) - 1)^2 + frac32 - frac12x - sqrtx \
geq & frac12(p_k - 1(x) - 1)^2 geq 0.
endalign
Therefore $(2)$ holds. Consequently, we can obtain an upper bound of the right hand side of $(1)$:
beginalign
& |p_n(x) - sqrtx| \
= & sqrtx prod_k = 0^n - 1left| 1 - frac12(p_k(x) + sqrtx)right| \
leq & sqrtxleft(1 - frac12sqrtxright)^n tag3
endalign
Since the right side of $(3)$ converges to $0$ uniformly as $n to infty$, the result follows.
$endgroup$
By the recursion formula, we have
$$p_n + 1(x) - sqrtx = (p_n(x) - sqrtx)left[1 - frac12(p_n(x) + sqrtx)right].$$
Use this recursion $n$ times, it follows that
$$p_n(x) - sqrtx = (p_0(x) - sqrtx)prod_k = 0^n - 1left[1 - frac12(p_k(x) + sqrtx)right]. tag1$$
We shall show that for each $k$, it holds that
$$0 leq 1 - frac12(p_k(x) + sqrtx) leq 1 - frac12sqrtx. tag2$$
It is easy to see that $p_n(x) geq 0$ for $x in [0, 1]$ (as you stated, it in fact holds that $0 leq p_n(x) leq 1$, which can be proved inductively), hence the right inequality of $(2)$ holds. To show the left side inequality, notice that
beginalign
& 2 - p_k(x) - sqrtx \
= & 2 - p_k - 1(x) - frac12x + frac12p_k - 1^2(x) - sqrtx \
= & frac12(p_k - 1(x) - 1)^2 + frac32 - frac12x - sqrtx \
geq & frac12(p_k - 1(x) - 1)^2 geq 0.
endalign
Therefore $(2)$ holds. Consequently, we can obtain an upper bound of the right hand side of $(1)$:
beginalign
& |p_n(x) - sqrtx| \
= & sqrtx prod_k = 0^n - 1left| 1 - frac12(p_k(x) + sqrtx)right| \
leq & sqrtxleft(1 - frac12sqrtxright)^n tag3
endalign
Since the right side of $(3)$ converges to $0$ uniformly as $n to infty$, the result follows.
edited Dec 7 '15 at 5:48
answered Dec 7 '15 at 5:33
ZhanxiongZhanxiong
8,94911033
8,94911033
$begingroup$
Thank you for your answer. It took reading through a couple times, but I think I get it, and it's brilliant. I'm hoping to find an approach using Dini's theorem, which I've added to the original question, but honestly I think this proof is way cooler.
$endgroup$
– Claycrusher
Dec 7 '15 at 22:30
add a comment |
$begingroup$
Thank you for your answer. It took reading through a couple times, but I think I get it, and it's brilliant. I'm hoping to find an approach using Dini's theorem, which I've added to the original question, but honestly I think this proof is way cooler.
$endgroup$
– Claycrusher
Dec 7 '15 at 22:30
$begingroup$
Thank you for your answer. It took reading through a couple times, but I think I get it, and it's brilliant. I'm hoping to find an approach using Dini's theorem, which I've added to the original question, but honestly I think this proof is way cooler.
$endgroup$
– Claycrusher
Dec 7 '15 at 22:30
$begingroup$
Thank you for your answer. It took reading through a couple times, but I think I get it, and it's brilliant. I'm hoping to find an approach using Dini's theorem, which I've added to the original question, but honestly I think this proof is way cooler.
$endgroup$
– Claycrusher
Dec 7 '15 at 22:30
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%2f1563679%2fprove-p-nx-rightarrow-sqrtx-uniformly-as-n-rightarrow-infty%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