If $|c|>2$ and $z_n=z_n-1^2+c$ with $z_0=0$ then $z_n rightarrow infty$
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Let $c in mathbbC$ and $f(z)=z^2+c$. Then define a sequence: $z_0=0$, $z_n=f(z_n-1)$ for all $n in mathbbN$. Show that $|c|>2 Rightarrow z_n rightarrow infty$. I had no clue which theorem I could use in this case in order to show this. I'd be thankful for any advice.
complex-analysis
add a comment |Â
up vote
1
down vote
favorite
Let $c in mathbbC$ and $f(z)=z^2+c$. Then define a sequence: $z_0=0$, $z_n=f(z_n-1)$ for all $n in mathbbN$. Show that $|c|>2 Rightarrow z_n rightarrow infty$. I had no clue which theorem I could use in this case in order to show this. I'd be thankful for any advice.
complex-analysis
(Terrible title.) No need for a "theorem" here, just find a lower bound for $|z_n|$ in terms of $|z_n-1|$ and iterate.
â Did
Aug 22 at 11:26
2
Please refer to "escape criterion" here.
â Ng Chung Tak
Aug 22 at 18:25
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Let $c in mathbbC$ and $f(z)=z^2+c$. Then define a sequence: $z_0=0$, $z_n=f(z_n-1)$ for all $n in mathbbN$. Show that $|c|>2 Rightarrow z_n rightarrow infty$. I had no clue which theorem I could use in this case in order to show this. I'd be thankful for any advice.
complex-analysis
Let $c in mathbbC$ and $f(z)=z^2+c$. Then define a sequence: $z_0=0$, $z_n=f(z_n-1)$ for all $n in mathbbN$. Show that $|c|>2 Rightarrow z_n rightarrow infty$. I had no clue which theorem I could use in this case in order to show this. I'd be thankful for any advice.
complex-analysis
edited Aug 22 at 11:26
Did
243k23208443
243k23208443
asked Aug 22 at 11:23
Thesinus
22629
22629
(Terrible title.) No need for a "theorem" here, just find a lower bound for $|z_n|$ in terms of $|z_n-1|$ and iterate.
â Did
Aug 22 at 11:26
2
Please refer to "escape criterion" here.
â Ng Chung Tak
Aug 22 at 18:25
add a comment |Â
(Terrible title.) No need for a "theorem" here, just find a lower bound for $|z_n|$ in terms of $|z_n-1|$ and iterate.
â Did
Aug 22 at 11:26
2
Please refer to "escape criterion" here.
â Ng Chung Tak
Aug 22 at 18:25
(Terrible title.) No need for a "theorem" here, just find a lower bound for $|z_n|$ in terms of $|z_n-1|$ and iterate.
â Did
Aug 22 at 11:26
(Terrible title.) No need for a "theorem" here, just find a lower bound for $|z_n|$ in terms of $|z_n-1|$ and iterate.
â Did
Aug 22 at 11:26
2
2
Please refer to "escape criterion" here.
â Ng Chung Tak
Aug 22 at 18:25
Please refer to "escape criterion" here.
â Ng Chung Tak
Aug 22 at 18:25
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2890931%2fif-c2-and-z-n-z-n-12c-with-z-0-0-then-z-n-rightarrow-infty%23new-answer', 'question_page');
);
Post as a guest
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
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
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
(Terrible title.) No need for a "theorem" here, just find a lower bound for $|z_n|$ in terms of $|z_n-1|$ and iterate.
â Did
Aug 22 at 11:26
2
Please refer to "escape criterion" here.
â Ng Chung Tak
Aug 22 at 18:25