How to show a particular recurrence $x_{n+1} = {4over 3}x_n - x_n^2$ is bounded?












0














Given a sequence:
$$
x_{n+1} = {4over 3}x_n - x_n^2
$$
And initial conditions:
$$
x_1 = {1over 6}
$$
I want to find $lim x_n$ as $ntoinfty$. The approach i want to use is prove $x_n$ is bounded and monotone, hence convergent and then find its fixed points one of which is going to be the limit.



I have difficulties showing $x_n$ is bounded. If I make an assumption that it's bounded then for $L = lim x_n$:
$$
3L^2 - L = 0 iff L = 0 text{or} L = {1over 3}
$$



Which in case $Lne 0$ matches the answer. Could someone please assist me on showing the bounds for $x_n$? I would also like to know whether the rest reasoning is fine. Thank you.






calculus limits recurrence-relations upper-lower-bounds







share|cite|improve this question




















  • 2




    There is at least a mistake in what you wrote. $x_{n+1} > x_n iff -x_{n+1} > -x_n$ is wrong. Inequality has to be reverted when multiplied by a negative number.
    – mathcounterexamples.net
    Jan 4 at 14:24












  • @mathcounterexamples.net you're right, thanks for pointing out. I've updated the post.
    – roman
    Jan 4 at 14:31






  • 1




    But then your following equivalences are wrong.
    – mathcounterexamples.net
    Jan 4 at 14:37










  • @mathcounterexamples.net oh, you are right once again. In such case i'm not sure how to show the sequence is monotone :(
    – roman
    Jan 4 at 14:53
















0














Given a sequence:
$$
x_{n+1} = {4over 3}x_n - x_n^2
$$
And initial conditions:
$$
x_1 = {1over 6}
$$
I want to find $lim x_n$ as $ntoinfty$. The approach i want to use is prove $x_n$ is bounded and monotone, hence convergent and then find its fixed points one of which is going to be the limit.



I have difficulties showing $x_n$ is bounded. If I make an assumption that it's bounded then for $L = lim x_n$:
$$
3L^2 - L = 0 iff L = 0 text{or} L = {1over 3}
$$



Which in case $Lne 0$ matches the answer. Could someone please assist me on showing the bounds for $x_n$? I would also like to know whether the rest reasoning is fine. Thank you.






calculus limits recurrence-relations upper-lower-bounds







share|cite|improve this question




















  • 2




    There is at least a mistake in what you wrote. $x_{n+1} > x_n iff -x_{n+1} > -x_n$ is wrong. Inequality has to be reverted when multiplied by a negative number.
    – mathcounterexamples.net
    Jan 4 at 14:24












  • @mathcounterexamples.net you're right, thanks for pointing out. I've updated the post.
    – roman
    Jan 4 at 14:31






  • 1




    But then your following equivalences are wrong.
    – mathcounterexamples.net
    Jan 4 at 14:37










  • @mathcounterexamples.net oh, you are right once again. In such case i'm not sure how to show the sequence is monotone :(
    – roman
    Jan 4 at 14:53














0












0








0


1





Given a sequence:
$$
x_{n+1} = {4over 3}x_n - x_n^2
$$
And initial conditions:
$$
x_1 = {1over 6}
$$
I want to find $lim x_n$ as $ntoinfty$. The approach i want to use is prove $x_n$ is bounded and monotone, hence convergent and then find its fixed points one of which is going to be the limit.



I have difficulties showing $x_n$ is bounded. If I make an assumption that it's bounded then for $L = lim x_n$:
$$
3L^2 - L = 0 iff L = 0 text{or} L = {1over 3}
$$



Which in case $Lne 0$ matches the answer. Could someone please assist me on showing the bounds for $x_n$? I would also like to know whether the rest reasoning is fine. Thank you.






calculus limits recurrence-relations upper-lower-bounds







share|cite|improve this question















Given a sequence:
$$
x_{n+1} = {4over 3}x_n - x_n^2
$$
And initial conditions:
$$
x_1 = {1over 6}
$$
I want to find $lim x_n$ as $ntoinfty$. The approach i want to use is prove $x_n$ is bounded and monotone, hence convergent and then find its fixed points one of which is going to be the limit.



I have difficulties showing $x_n$ is bounded. If I make an assumption that it's bounded then for $L = lim x_n$:
$$
3L^2 - L = 0 iff L = 0 text{or} L = {1over 3}
$$



Which in case $Lne 0$ matches the answer. Could someone please assist me on showing the bounds for $x_n$? I would also like to know whether the rest reasoning is fine. Thank you.






calculus limits recurrence-relations upper-lower-bounds




calculus limits recurrence-relations upper-lower-bounds






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 4 at 15:10







roman

















asked Jan 4 at 14:17









romanroman

2,02221221




2,02221221








  • 2




    There is at least a mistake in what you wrote. $x_{n+1} > x_n iff -x_{n+1} > -x_n$ is wrong. Inequality has to be reverted when multiplied by a negative number.
    – mathcounterexamples.net
    Jan 4 at 14:24












  • @mathcounterexamples.net you're right, thanks for pointing out. I've updated the post.
    – roman
    Jan 4 at 14:31






  • 1




    But then your following equivalences are wrong.
    – mathcounterexamples.net
    Jan 4 at 14:37










  • @mathcounterexamples.net oh, you are right once again. In such case i'm not sure how to show the sequence is monotone :(
    – roman
    Jan 4 at 14:53














  • 2




    There is at least a mistake in what you wrote. $x_{n+1} > x_n iff -x_{n+1} > -x_n$ is wrong. Inequality has to be reverted when multiplied by a negative number.
    – mathcounterexamples.net
    Jan 4 at 14:24












  • @mathcounterexamples.net you're right, thanks for pointing out. I've updated the post.
    – roman
    Jan 4 at 14:31






  • 1




    But then your following equivalences are wrong.
    – mathcounterexamples.net
    Jan 4 at 14:37










  • @mathcounterexamples.net oh, you are right once again. In such case i'm not sure how to show the sequence is monotone :(
    – roman
    Jan 4 at 14:53








2




2




There is at least a mistake in what you wrote. $x_{n+1} > x_n iff -x_{n+1} > -x_n$ is wrong. Inequality has to be reverted when multiplied by a negative number.
– mathcounterexamples.net
Jan 4 at 14:24






There is at least a mistake in what you wrote. $x_{n+1} > x_n iff -x_{n+1} > -x_n$ is wrong. Inequality has to be reverted when multiplied by a negative number.
– mathcounterexamples.net
Jan 4 at 14:24














@mathcounterexamples.net you're right, thanks for pointing out. I've updated the post.
– roman
Jan 4 at 14:31




@mathcounterexamples.net you're right, thanks for pointing out. I've updated the post.
– roman
Jan 4 at 14:31




1




1




But then your following equivalences are wrong.
– mathcounterexamples.net
Jan 4 at 14:37




But then your following equivalences are wrong.
– mathcounterexamples.net
Jan 4 at 14:37












@mathcounterexamples.net oh, you are right once again. In such case i'm not sure how to show the sequence is monotone :(
– roman
Jan 4 at 14:53




@mathcounterexamples.net oh, you are right once again. In such case i'm not sure how to show the sequence is monotone :(
– roman
Jan 4 at 14:53










2 Answers
2






active

oldest

votes


















3














Let's define $$e_n={1over 3}-x_n$$then by substituting we obtain $$e_{n+1}={2over 3}e_n+e_n^2=e_nleft({2over 3}+e_nright)$$with $e_1={1over 6}$. Also note that if $e_n>0$ then $e_{n+1}>0$ therefore since $e_1>0$ we have $e_n>0$. Also if $e_nle {1over 6}$ we obtain $$e_{n+1}=e_nleft({2over 3}+e_nright)le {5over 6}e_n$$ finally $$0<e_{n+1}le {5over 6}e_n$$which means that $e_nto 0$ and $x_nto {1over 3}$ therefore $x_n$ is bounded.






share|cite|improve this answer





















  • Could you please elaborate on how you came up with such substitution? For me it looks like a lucky guess, i would like to grasp the technique
    – roman
    Jan 4 at 14:36






  • 1




    Sure! Since after finding $L=0$ and $L={1over 3}$ we guessed that $x_n$ should converge ${1over 3}$ then we are able to define the distance of $x_n$ to its final limit as $e_n=x_n-{1over 3}$ or $e_n={1over 3}-x_n$, not much different which one to choose and prove that the distance converges to $0$. A proof on convergence to $0$ is rather simpler than proving the convergence to any other point ---at least for me :)
    – Mostafa Ayaz
    Jan 4 at 14:40



















1














Hint: find explicit pattern and prove that it is bounded






share|cite|improve this answer

















  • 1




    Do you know what the explicit pattern is? maybe you can share it in your answer
    – caverac
    Jan 4 at 14:32












  • Are you sure closed form exists?
    – roman
    Jan 4 at 14:33











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3061687%2fhow-to-show-a-particular-recurrence-x-n1-4-over-3x-n-x-n2-is-bounded%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









3














Let's define $$e_n={1over 3}-x_n$$then by substituting we obtain $$e_{n+1}={2over 3}e_n+e_n^2=e_nleft({2over 3}+e_nright)$$with $e_1={1over 6}$. Also note that if $e_n>0$ then $e_{n+1}>0$ therefore since $e_1>0$ we have $e_n>0$. Also if $e_nle {1over 6}$ we obtain $$e_{n+1}=e_nleft({2over 3}+e_nright)le {5over 6}e_n$$ finally $$0<e_{n+1}le {5over 6}e_n$$which means that $e_nto 0$ and $x_nto {1over 3}$ therefore $x_n$ is bounded.






share|cite|improve this answer





















  • Could you please elaborate on how you came up with such substitution? For me it looks like a lucky guess, i would like to grasp the technique
    – roman
    Jan 4 at 14:36






  • 1




    Sure! Since after finding $L=0$ and $L={1over 3}$ we guessed that $x_n$ should converge ${1over 3}$ then we are able to define the distance of $x_n$ to its final limit as $e_n=x_n-{1over 3}$ or $e_n={1over 3}-x_n$, not much different which one to choose and prove that the distance converges to $0$. A proof on convergence to $0$ is rather simpler than proving the convergence to any other point ---at least for me :)
    – Mostafa Ayaz
    Jan 4 at 14:40
















3














Let's define $$e_n={1over 3}-x_n$$then by substituting we obtain $$e_{n+1}={2over 3}e_n+e_n^2=e_nleft({2over 3}+e_nright)$$with $e_1={1over 6}$. Also note that if $e_n>0$ then $e_{n+1}>0$ therefore since $e_1>0$ we have $e_n>0$. Also if $e_nle {1over 6}$ we obtain $$e_{n+1}=e_nleft({2over 3}+e_nright)le {5over 6}e_n$$ finally $$0<e_{n+1}le {5over 6}e_n$$which means that $e_nto 0$ and $x_nto {1over 3}$ therefore $x_n$ is bounded.






share|cite|improve this answer





















  • Could you please elaborate on how you came up with such substitution? For me it looks like a lucky guess, i would like to grasp the technique
    – roman
    Jan 4 at 14:36






  • 1




    Sure! Since after finding $L=0$ and $L={1over 3}$ we guessed that $x_n$ should converge ${1over 3}$ then we are able to define the distance of $x_n$ to its final limit as $e_n=x_n-{1over 3}$ or $e_n={1over 3}-x_n$, not much different which one to choose and prove that the distance converges to $0$. A proof on convergence to $0$ is rather simpler than proving the convergence to any other point ---at least for me :)
    – Mostafa Ayaz
    Jan 4 at 14:40














3












3








3






Let's define $$e_n={1over 3}-x_n$$then by substituting we obtain $$e_{n+1}={2over 3}e_n+e_n^2=e_nleft({2over 3}+e_nright)$$with $e_1={1over 6}$. Also note that if $e_n>0$ then $e_{n+1}>0$ therefore since $e_1>0$ we have $e_n>0$. Also if $e_nle {1over 6}$ we obtain $$e_{n+1}=e_nleft({2over 3}+e_nright)le {5over 6}e_n$$ finally $$0<e_{n+1}le {5over 6}e_n$$which means that $e_nto 0$ and $x_nto {1over 3}$ therefore $x_n$ is bounded.






share|cite|improve this answer












Let's define $$e_n={1over 3}-x_n$$then by substituting we obtain $$e_{n+1}={2over 3}e_n+e_n^2=e_nleft({2over 3}+e_nright)$$with $e_1={1over 6}$. Also note that if $e_n>0$ then $e_{n+1}>0$ therefore since $e_1>0$ we have $e_n>0$. Also if $e_nle {1over 6}$ we obtain $$e_{n+1}=e_nleft({2over 3}+e_nright)le {5over 6}e_n$$ finally $$0<e_{n+1}le {5over 6}e_n$$which means that $e_nto 0$ and $x_nto {1over 3}$ therefore $x_n$ is bounded.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 4 at 14:31









Mostafa AyazMostafa Ayaz

14.3k3937




14.3k3937












  • Could you please elaborate on how you came up with such substitution? For me it looks like a lucky guess, i would like to grasp the technique
    – roman
    Jan 4 at 14:36






  • 1




    Sure! Since after finding $L=0$ and $L={1over 3}$ we guessed that $x_n$ should converge ${1over 3}$ then we are able to define the distance of $x_n$ to its final limit as $e_n=x_n-{1over 3}$ or $e_n={1over 3}-x_n$, not much different which one to choose and prove that the distance converges to $0$. A proof on convergence to $0$ is rather simpler than proving the convergence to any other point ---at least for me :)
    – Mostafa Ayaz
    Jan 4 at 14:40


















  • Could you please elaborate on how you came up with such substitution? For me it looks like a lucky guess, i would like to grasp the technique
    – roman
    Jan 4 at 14:36






  • 1




    Sure! Since after finding $L=0$ and $L={1over 3}$ we guessed that $x_n$ should converge ${1over 3}$ then we are able to define the distance of $x_n$ to its final limit as $e_n=x_n-{1over 3}$ or $e_n={1over 3}-x_n$, not much different which one to choose and prove that the distance converges to $0$. A proof on convergence to $0$ is rather simpler than proving the convergence to any other point ---at least for me :)
    – Mostafa Ayaz
    Jan 4 at 14:40
















Could you please elaborate on how you came up with such substitution? For me it looks like a lucky guess, i would like to grasp the technique
– roman
Jan 4 at 14:36




Could you please elaborate on how you came up with such substitution? For me it looks like a lucky guess, i would like to grasp the technique
– roman
Jan 4 at 14:36




1




1




Sure! Since after finding $L=0$ and $L={1over 3}$ we guessed that $x_n$ should converge ${1over 3}$ then we are able to define the distance of $x_n$ to its final limit as $e_n=x_n-{1over 3}$ or $e_n={1over 3}-x_n$, not much different which one to choose and prove that the distance converges to $0$. A proof on convergence to $0$ is rather simpler than proving the convergence to any other point ---at least for me :)
– Mostafa Ayaz
Jan 4 at 14:40




Sure! Since after finding $L=0$ and $L={1over 3}$ we guessed that $x_n$ should converge ${1over 3}$ then we are able to define the distance of $x_n$ to its final limit as $e_n=x_n-{1over 3}$ or $e_n={1over 3}-x_n$, not much different which one to choose and prove that the distance converges to $0$. A proof on convergence to $0$ is rather simpler than proving the convergence to any other point ---at least for me :)
– Mostafa Ayaz
Jan 4 at 14:40











1














Hint: find explicit pattern and prove that it is bounded






share|cite|improve this answer

















  • 1




    Do you know what the explicit pattern is? maybe you can share it in your answer
    – caverac
    Jan 4 at 14:32












  • Are you sure closed form exists?
    – roman
    Jan 4 at 14:33
















1














Hint: find explicit pattern and prove that it is bounded






share|cite|improve this answer

















  • 1




    Do you know what the explicit pattern is? maybe you can share it in your answer
    – caverac
    Jan 4 at 14:32












  • Are you sure closed form exists?
    – roman
    Jan 4 at 14:33














1












1








1






Hint: find explicit pattern and prove that it is bounded






share|cite|improve this answer












Hint: find explicit pattern and prove that it is bounded







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 4 at 14:24









VirtualUserVirtualUser

54712




54712








  • 1




    Do you know what the explicit pattern is? maybe you can share it in your answer
    – caverac
    Jan 4 at 14:32












  • Are you sure closed form exists?
    – roman
    Jan 4 at 14:33














  • 1




    Do you know what the explicit pattern is? maybe you can share it in your answer
    – caverac
    Jan 4 at 14:32












  • Are you sure closed form exists?
    – roman
    Jan 4 at 14:33








1




1




Do you know what the explicit pattern is? maybe you can share it in your answer
– caverac
Jan 4 at 14:32






Do you know what the explicit pattern is? maybe you can share it in your answer
– caverac
Jan 4 at 14:32














Are you sure closed form exists?
– roman
Jan 4 at 14:33




Are you sure closed form exists?
– roman
Jan 4 at 14:33


















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3061687%2fhow-to-show-a-particular-recurrence-x-n1-4-over-3x-n-x-n2-is-bounded%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

An IMO inspired problem

Image
14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
Read more

Management

Image
Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
Read more

Investment

Image
Investment From Wikipedia, the free encyclopedia Jump to navigation Jump to search This article is about investment in finance. For investment in macroeconomics, see Investment (macroeconomics). For other uses, see Investment (disambiguation). "Invest" redirects here. For the term in meteorology, see Invest (meteorology). This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. ( February 2017 ) (Learn how and when to remove this template message) In general, to invest is to distribute money in the expectation of some benefit in the future – for example, investment in durable goods, in real estate by the service industry, in factories for manufacturing, in product development, and in research and development. However, this article focuses specifically on investment in financial
Read more