Proving the sequence $(x_n)$ ($n in mathbb N$) with $x_0$ $in$ ($0$,$frac{1}{2}$) and...












1












$begingroup$



Let $f:mathbb R^*tomathbb R$ be $f(x)=dfrac{e^frac1x}{x^2}$. Prove that the sequence $(x_n)$ ($ninmathbb N$) with $$x_0inleft(0,frac12right), x_{n+1}=fleft(frac1{x_n}right)$$ is bounded and $limlimits_{ntoinfty}x_n=0$.




I think the problem can be solved working from the inequality $0lt x_0 lt frac{1}{2}$ and doing that I realize that the upper bound of the terms shrinks and that should be "clear" but what would be a mathematically accepted proof?



Just to make sure I am no getting anything wrong here is my "calculations":
$0lt x_0 lt 1/2$

Raising terms to the power of -$1$:
$2lt frac{1}{x_0}ltinfty$

Applying f to every term:
$0lt x_1lt f(2)$

Then doing the same thing again results:
$0lt x_2lt fbiggl(frac{4}{e^{frac{1}{2}}}biggr)$
$frac{4}{e^{frac{1}{2}}} gt 2$ and given that $f$ is decreasing for any $x gt -1/2$ then ultimately the value of the upper bound is actually shrinking.



I am guessing this is not enough to prove the convergence of the sequence, right?






real-analysis limits







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    So $x_{n+1}=g(x_n)$ where $g(x)=x^2e^x$. For what values of $x$, $g(x)<x$ holds?
    $endgroup$
    – Song
    Jan 3 at 8:05
















1












$begingroup$



Let $f:mathbb R^*tomathbb R$ be $f(x)=dfrac{e^frac1x}{x^2}$. Prove that the sequence $(x_n)$ ($ninmathbb N$) with $$x_0inleft(0,frac12right), x_{n+1}=fleft(frac1{x_n}right)$$ is bounded and $limlimits_{ntoinfty}x_n=0$.




I think the problem can be solved working from the inequality $0lt x_0 lt frac{1}{2}$ and doing that I realize that the upper bound of the terms shrinks and that should be "clear" but what would be a mathematically accepted proof?



Just to make sure I am no getting anything wrong here is my "calculations":
$0lt x_0 lt 1/2$

Raising terms to the power of -$1$:
$2lt frac{1}{x_0}ltinfty$

Applying f to every term:
$0lt x_1lt f(2)$

Then doing the same thing again results:
$0lt x_2lt fbiggl(frac{4}{e^{frac{1}{2}}}biggr)$
$frac{4}{e^{frac{1}{2}}} gt 2$ and given that $f$ is decreasing for any $x gt -1/2$ then ultimately the value of the upper bound is actually shrinking.



I am guessing this is not enough to prove the convergence of the sequence, right?






real-analysis limits







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    So $x_{n+1}=g(x_n)$ where $g(x)=x^2e^x$. For what values of $x$, $g(x)<x$ holds?
    $endgroup$
    – Song
    Jan 3 at 8:05














1












1








1





$begingroup$



Let $f:mathbb R^*tomathbb R$ be $f(x)=dfrac{e^frac1x}{x^2}$. Prove that the sequence $(x_n)$ ($ninmathbb N$) with $$x_0inleft(0,frac12right), x_{n+1}=fleft(frac1{x_n}right)$$ is bounded and $limlimits_{ntoinfty}x_n=0$.




I think the problem can be solved working from the inequality $0lt x_0 lt frac{1}{2}$ and doing that I realize that the upper bound of the terms shrinks and that should be "clear" but what would be a mathematically accepted proof?



Just to make sure I am no getting anything wrong here is my "calculations":
$0lt x_0 lt 1/2$

Raising terms to the power of -$1$:
$2lt frac{1}{x_0}ltinfty$

Applying f to every term:
$0lt x_1lt f(2)$

Then doing the same thing again results:
$0lt x_2lt fbiggl(frac{4}{e^{frac{1}{2}}}biggr)$
$frac{4}{e^{frac{1}{2}}} gt 2$ and given that $f$ is decreasing for any $x gt -1/2$ then ultimately the value of the upper bound is actually shrinking.



I am guessing this is not enough to prove the convergence of the sequence, right?






real-analysis limits







share|cite|improve this question











$endgroup$





Let $f:mathbb R^*tomathbb R$ be $f(x)=dfrac{e^frac1x}{x^2}$. Prove that the sequence $(x_n)$ ($ninmathbb N$) with $$x_0inleft(0,frac12right), x_{n+1}=fleft(frac1{x_n}right)$$ is bounded and $limlimits_{ntoinfty}x_n=0$.




I think the problem can be solved working from the inequality $0lt x_0 lt frac{1}{2}$ and doing that I realize that the upper bound of the terms shrinks and that should be "clear" but what would be a mathematically accepted proof?



Just to make sure I am no getting anything wrong here is my "calculations":
$0lt x_0 lt 1/2$

Raising terms to the power of -$1$:
$2lt frac{1}{x_0}ltinfty$

Applying f to every term:
$0lt x_1lt f(2)$

Then doing the same thing again results:
$0lt x_2lt fbiggl(frac{4}{e^{frac{1}{2}}}biggr)$
$frac{4}{e^{frac{1}{2}}} gt 2$ and given that $f$ is decreasing for any $x gt -1/2$ then ultimately the value of the upper bound is actually shrinking.



I am guessing this is not enough to prove the convergence of the sequence, right?






real-analysis limits




real-analysis limits






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 3 at 7:59









Saad

19.7k92352




19.7k92352










asked Jan 3 at 7:50









Radu GabrielRadu Gabriel

463




463








  • 1




    $begingroup$
    So $x_{n+1}=g(x_n)$ where $g(x)=x^2e^x$. For what values of $x$, $g(x)<x$ holds?
    $endgroup$
    – Song
    Jan 3 at 8:05














  • 1




    $begingroup$
    So $x_{n+1}=g(x_n)$ where $g(x)=x^2e^x$. For what values of $x$, $g(x)<x$ holds?
    $endgroup$
    – Song
    Jan 3 at 8:05








1




1




$begingroup$
So $x_{n+1}=g(x_n)$ where $g(x)=x^2e^x$. For what values of $x$, $g(x)<x$ holds?
$endgroup$
– Song
Jan 3 at 8:05




$begingroup$
So $x_{n+1}=g(x_n)$ where $g(x)=x^2e^x$. For what values of $x$, $g(x)<x$ holds?
$endgroup$
– Song
Jan 3 at 8:05










1 Answer
1






active

oldest

votes


















2












$begingroup$

Let's denote $g(x)=fleft(frac{1}{x}right)=x^2 e^x$.



We have to study the sequence
$$x_{n+1} = g(x_n)$$



where $x_0 in (0,1/2)$.



You can prove that $g$ is strictly increasing on $[0,1/2)$, that $g(x) <x$ on $(0,1/2)$ and that the equation $g(x) = x$ has $0$ for unique solution on the interval $[0,1/2)$.



Hence for $x_0 in (0,1/2)$, the sequence $(x_n)$ is strictly decreasing and bounded below by $0$. Therefore it converges. As $g$ is continuous, $(x_n)$ converges to a fix point of $g$, that is towards $0$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You've helped me a lot. Just to be sure though, my logic was right but the answer wouldn't have been enough, right?
    $endgroup$
    – Radu Gabriel
    Jan 3 at 8:26






  • 1




    $begingroup$
    @RaduGabriel Yes, you started well but you're missing precise arguments to prove convergence.
    $endgroup$
    – mathcounterexamples.net
    Jan 3 at 9:00











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%2f3060343%2fproving-the-sequence-x-n-n-in-mathbb-n-with-x-0-in-0-frac1%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









2












$begingroup$

Let's denote $g(x)=fleft(frac{1}{x}right)=x^2 e^x$.



We have to study the sequence
$$x_{n+1} = g(x_n)$$



where $x_0 in (0,1/2)$.



You can prove that $g$ is strictly increasing on $[0,1/2)$, that $g(x) <x$ on $(0,1/2)$ and that the equation $g(x) = x$ has $0$ for unique solution on the interval $[0,1/2)$.



Hence for $x_0 in (0,1/2)$, the sequence $(x_n)$ is strictly decreasing and bounded below by $0$. Therefore it converges. As $g$ is continuous, $(x_n)$ converges to a fix point of $g$, that is towards $0$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You've helped me a lot. Just to be sure though, my logic was right but the answer wouldn't have been enough, right?
    $endgroup$
    – Radu Gabriel
    Jan 3 at 8:26






  • 1




    $begingroup$
    @RaduGabriel Yes, you started well but you're missing precise arguments to prove convergence.
    $endgroup$
    – mathcounterexamples.net
    Jan 3 at 9:00
















2












$begingroup$

Let's denote $g(x)=fleft(frac{1}{x}right)=x^2 e^x$.



We have to study the sequence
$$x_{n+1} = g(x_n)$$



where $x_0 in (0,1/2)$.



You can prove that $g$ is strictly increasing on $[0,1/2)$, that $g(x) <x$ on $(0,1/2)$ and that the equation $g(x) = x$ has $0$ for unique solution on the interval $[0,1/2)$.



Hence for $x_0 in (0,1/2)$, the sequence $(x_n)$ is strictly decreasing and bounded below by $0$. Therefore it converges. As $g$ is continuous, $(x_n)$ converges to a fix point of $g$, that is towards $0$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You've helped me a lot. Just to be sure though, my logic was right but the answer wouldn't have been enough, right?
    $endgroup$
    – Radu Gabriel
    Jan 3 at 8:26






  • 1




    $begingroup$
    @RaduGabriel Yes, you started well but you're missing precise arguments to prove convergence.
    $endgroup$
    – mathcounterexamples.net
    Jan 3 at 9:00














2












2








2





$begingroup$

Let's denote $g(x)=fleft(frac{1}{x}right)=x^2 e^x$.



We have to study the sequence
$$x_{n+1} = g(x_n)$$



where $x_0 in (0,1/2)$.



You can prove that $g$ is strictly increasing on $[0,1/2)$, that $g(x) <x$ on $(0,1/2)$ and that the equation $g(x) = x$ has $0$ for unique solution on the interval $[0,1/2)$.



Hence for $x_0 in (0,1/2)$, the sequence $(x_n)$ is strictly decreasing and bounded below by $0$. Therefore it converges. As $g$ is continuous, $(x_n)$ converges to a fix point of $g$, that is towards $0$.






share|cite|improve this answer











$endgroup$



Let's denote $g(x)=fleft(frac{1}{x}right)=x^2 e^x$.



We have to study the sequence
$$x_{n+1} = g(x_n)$$



where $x_0 in (0,1/2)$.



You can prove that $g$ is strictly increasing on $[0,1/2)$, that $g(x) <x$ on $(0,1/2)$ and that the equation $g(x) = x$ has $0$ for unique solution on the interval $[0,1/2)$.



Hence for $x_0 in (0,1/2)$, the sequence $(x_n)$ is strictly decreasing and bounded below by $0$. Therefore it converges. As $g$ is continuous, $(x_n)$ converges to a fix point of $g$, that is towards $0$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 3 at 8:26

























answered Jan 3 at 8:18









mathcounterexamples.netmathcounterexamples.net

25.8k21953




25.8k21953












  • $begingroup$
    You've helped me a lot. Just to be sure though, my logic was right but the answer wouldn't have been enough, right?
    $endgroup$
    – Radu Gabriel
    Jan 3 at 8:26






  • 1




    $begingroup$
    @RaduGabriel Yes, you started well but you're missing precise arguments to prove convergence.
    $endgroup$
    – mathcounterexamples.net
    Jan 3 at 9:00


















  • $begingroup$
    You've helped me a lot. Just to be sure though, my logic was right but the answer wouldn't have been enough, right?
    $endgroup$
    – Radu Gabriel
    Jan 3 at 8:26






  • 1




    $begingroup$
    @RaduGabriel Yes, you started well but you're missing precise arguments to prove convergence.
    $endgroup$
    – mathcounterexamples.net
    Jan 3 at 9:00
















$begingroup$
You've helped me a lot. Just to be sure though, my logic was right but the answer wouldn't have been enough, right?
$endgroup$
– Radu Gabriel
Jan 3 at 8:26




$begingroup$
You've helped me a lot. Just to be sure though, my logic was right but the answer wouldn't have been enough, right?
$endgroup$
– Radu Gabriel
Jan 3 at 8:26




1




1




$begingroup$
@RaduGabriel Yes, you started well but you're missing precise arguments to prove convergence.
$endgroup$
– mathcounterexamples.net
Jan 3 at 9:00




$begingroup$
@RaduGabriel Yes, you started well but you're missing precise arguments to prove convergence.
$endgroup$
– mathcounterexamples.net
Jan 3 at 9:00


















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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060343%2fproving-the-sequence-x-n-n-in-mathbb-n-with-x-0-in-0-frac1%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

'app-layout' is not a known element: how to share Component with different Modules

Image
0 My application was working fine until I decided to go with lazy loading: So, my shared component looks like this: import { Component, Renderer2 } from '@angular/core'; export interface FormModel { captcha?: string; } @Component({ selector: 'app-layout', templateUrl: './app-layout.component.html', styleUrls: ['./app-layout.css'] }) export class FullLayoutComponent { } app-layout.component.ts I am using this component in my Another component say school-home.component.html like this: <app-layout> </app-layout> and it was working fine until I created a Module school-home.module.ts like this: import { NgModule } from '@angular/core'; import { CommonModule } from '@angular/common'; import { SchoolhomeRoutingModule ...
Read more

android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

Image
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 This is a simple project showing cubes on Unity, exported to android project and imported on Android studio. On maifest file it showed following warning: Expecting <uses-feature android:name="android.software.leanback" android:required="false" /> tag I have no information about it. And also on default emptyview android project does not use/mention this feature. I know it is required by TV's and such but why its not added by default? Why is this? And Should I concern about it? android unity3d ...
Read more

WPF add header to Image with URL pettitions [duplicate]

Image
up vote 0 down vote favorite This question already has an answer here: Image source URI requiring authorization 3 answers Add header to all* HTTP requests on a machine 1 answer first of all sorry for my english. Recently I added some security in the backend of my project, and now I need to send a validation code(apiKey) inside the headers to retrieve the images. I have a problem with ALL images in my project that I had attached in my UI. For example, before I had: <Image Height="90" Source="{Binding Video.Thumbnail}"/> Now I need to change my code to create a CUSTOM petition add the apiKey in the header:...
Read more