Chaos in Newtons Method












4












$begingroup$


Im trying to prove that Newtons method applied to ${rm f}left(, x,right)
=x^{2} + c$, is chaotic for $c > 0$.



I know I need to prove:


(a) The periodic points of ${rm f}$ are dense in $X$,


(b) ${rm f}$ is topologically transitive and


(c) ${rm f}$ exhibits sensitive dependence on initial conditions.



and have the following definitons for (a), (b) and (c).



(a) Let $G subset X$ where $X$ is a metric space with metric ${rm d}$. Then $G$ is said to be dense in $X$ if, for any given $x in X$ and $epsilon > 0,exists y in g$ such that ${rm d}left(, x,y,right) < epsilon$. Equivalently, $G$ is dense in $X$, if for any given $x in X,exists {x_{n}} subset G$ such that
$x_{n} to x$ in $X$ as $n to infty$.



(b) The function ${rm f}:X to X$ is topologically transitive if for all open sets $U$ and $V$ in $X$, $exists x in U$ and a natural number $n$ such that ${rm f}^{n}left(, x,right)$ is in $V$.



(c) Let $X$ be a metric space with metric ${rm d}$. The function
${rm f}:X to X$ exhibits sensitive dependence on initial conditions if
$exists delta > 0$ such that $forall x in X$ and $forall epsilon > 0$, there is a $y in X$ and a natural number $n$ such that ${rm d}left(, x,y,right) < epsilon$ and ${rm d}left(,{rm f}^{n}left(, x,right),{rm f}^{n}left(, y,right)right) > delta$.



Struggling to get started as I can't find any examples of anyone doing this sort of thing anywhere. Most books have this sort of thing as an exercise but with no solutions.



Any help would be brilliant !.










share|cite|improve this question











$endgroup$












  • $begingroup$
    A remark: (a), (b), (c) are needed not for $f$ but for $g(x)=x-f(x)/f'(x)$, which is $g(x)=frac12(x-c/x)$. Starting from scratch, this looks like a lot of work.
    $endgroup$
    – user147263
    Dec 1 '14 at 1:31








  • 1




    $begingroup$
    Looks very closely related to this question. Same user, different account?
    $endgroup$
    – Mark McClure
    Dec 1 '14 at 13:06
















4












$begingroup$


Im trying to prove that Newtons method applied to ${rm f}left(, x,right)
=x^{2} + c$, is chaotic for $c > 0$.



I know I need to prove:


(a) The periodic points of ${rm f}$ are dense in $X$,


(b) ${rm f}$ is topologically transitive and


(c) ${rm f}$ exhibits sensitive dependence on initial conditions.



and have the following definitons for (a), (b) and (c).



(a) Let $G subset X$ where $X$ is a metric space with metric ${rm d}$. Then $G$ is said to be dense in $X$ if, for any given $x in X$ and $epsilon > 0,exists y in g$ such that ${rm d}left(, x,y,right) < epsilon$. Equivalently, $G$ is dense in $X$, if for any given $x in X,exists {x_{n}} subset G$ such that
$x_{n} to x$ in $X$ as $n to infty$.



(b) The function ${rm f}:X to X$ is topologically transitive if for all open sets $U$ and $V$ in $X$, $exists x in U$ and a natural number $n$ such that ${rm f}^{n}left(, x,right)$ is in $V$.



(c) Let $X$ be a metric space with metric ${rm d}$. The function
${rm f}:X to X$ exhibits sensitive dependence on initial conditions if
$exists delta > 0$ such that $forall x in X$ and $forall epsilon > 0$, there is a $y in X$ and a natural number $n$ such that ${rm d}left(, x,y,right) < epsilon$ and ${rm d}left(,{rm f}^{n}left(, x,right),{rm f}^{n}left(, y,right)right) > delta$.



Struggling to get started as I can't find any examples of anyone doing this sort of thing anywhere. Most books have this sort of thing as an exercise but with no solutions.



Any help would be brilliant !.










share|cite|improve this question











$endgroup$












  • $begingroup$
    A remark: (a), (b), (c) are needed not for $f$ but for $g(x)=x-f(x)/f'(x)$, which is $g(x)=frac12(x-c/x)$. Starting from scratch, this looks like a lot of work.
    $endgroup$
    – user147263
    Dec 1 '14 at 1:31








  • 1




    $begingroup$
    Looks very closely related to this question. Same user, different account?
    $endgroup$
    – Mark McClure
    Dec 1 '14 at 13:06














4












4








4





$begingroup$


Im trying to prove that Newtons method applied to ${rm f}left(, x,right)
=x^{2} + c$, is chaotic for $c > 0$.



I know I need to prove:


(a) The periodic points of ${rm f}$ are dense in $X$,


(b) ${rm f}$ is topologically transitive and


(c) ${rm f}$ exhibits sensitive dependence on initial conditions.



and have the following definitons for (a), (b) and (c).



(a) Let $G subset X$ where $X$ is a metric space with metric ${rm d}$. Then $G$ is said to be dense in $X$ if, for any given $x in X$ and $epsilon > 0,exists y in g$ such that ${rm d}left(, x,y,right) < epsilon$. Equivalently, $G$ is dense in $X$, if for any given $x in X,exists {x_{n}} subset G$ such that
$x_{n} to x$ in $X$ as $n to infty$.



(b) The function ${rm f}:X to X$ is topologically transitive if for all open sets $U$ and $V$ in $X$, $exists x in U$ and a natural number $n$ such that ${rm f}^{n}left(, x,right)$ is in $V$.



(c) Let $X$ be a metric space with metric ${rm d}$. The function
${rm f}:X to X$ exhibits sensitive dependence on initial conditions if
$exists delta > 0$ such that $forall x in X$ and $forall epsilon > 0$, there is a $y in X$ and a natural number $n$ such that ${rm d}left(, x,y,right) < epsilon$ and ${rm d}left(,{rm f}^{n}left(, x,right),{rm f}^{n}left(, y,right)right) > delta$.



Struggling to get started as I can't find any examples of anyone doing this sort of thing anywhere. Most books have this sort of thing as an exercise but with no solutions.



Any help would be brilliant !.










share|cite|improve this question











$endgroup$




Im trying to prove that Newtons method applied to ${rm f}left(, x,right)
=x^{2} + c$, is chaotic for $c > 0$.



I know I need to prove:


(a) The periodic points of ${rm f}$ are dense in $X$,


(b) ${rm f}$ is topologically transitive and


(c) ${rm f}$ exhibits sensitive dependence on initial conditions.



and have the following definitons for (a), (b) and (c).



(a) Let $G subset X$ where $X$ is a metric space with metric ${rm d}$. Then $G$ is said to be dense in $X$ if, for any given $x in X$ and $epsilon > 0,exists y in g$ such that ${rm d}left(, x,y,right) < epsilon$. Equivalently, $G$ is dense in $X$, if for any given $x in X,exists {x_{n}} subset G$ such that
$x_{n} to x$ in $X$ as $n to infty$.



(b) The function ${rm f}:X to X$ is topologically transitive if for all open sets $U$ and $V$ in $X$, $exists x in U$ and a natural number $n$ such that ${rm f}^{n}left(, x,right)$ is in $V$.



(c) Let $X$ be a metric space with metric ${rm d}$. The function
${rm f}:X to X$ exhibits sensitive dependence on initial conditions if
$exists delta > 0$ such that $forall x in X$ and $forall epsilon > 0$, there is a $y in X$ and a natural number $n$ such that ${rm d}left(, x,y,right) < epsilon$ and ${rm d}left(,{rm f}^{n}left(, x,right),{rm f}^{n}left(, y,right)right) > delta$.



Struggling to get started as I can't find any examples of anyone doing this sort of thing anywhere. Most books have this sort of thing as an exercise but with no solutions.



Any help would be brilliant !.







dynamical-systems chaos-theory newton-raphson






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 14 '18 at 21:04









Adam

1,1951919




1,1951919










asked Nov 30 '14 at 16:53









NeilNeil

314




314












  • $begingroup$
    A remark: (a), (b), (c) are needed not for $f$ but for $g(x)=x-f(x)/f'(x)$, which is $g(x)=frac12(x-c/x)$. Starting from scratch, this looks like a lot of work.
    $endgroup$
    – user147263
    Dec 1 '14 at 1:31








  • 1




    $begingroup$
    Looks very closely related to this question. Same user, different account?
    $endgroup$
    – Mark McClure
    Dec 1 '14 at 13:06


















  • $begingroup$
    A remark: (a), (b), (c) are needed not for $f$ but for $g(x)=x-f(x)/f'(x)$, which is $g(x)=frac12(x-c/x)$. Starting from scratch, this looks like a lot of work.
    $endgroup$
    – user147263
    Dec 1 '14 at 1:31








  • 1




    $begingroup$
    Looks very closely related to this question. Same user, different account?
    $endgroup$
    – Mark McClure
    Dec 1 '14 at 13:06
















$begingroup$
A remark: (a), (b), (c) are needed not for $f$ but for $g(x)=x-f(x)/f'(x)$, which is $g(x)=frac12(x-c/x)$. Starting from scratch, this looks like a lot of work.
$endgroup$
– user147263
Dec 1 '14 at 1:31






$begingroup$
A remark: (a), (b), (c) are needed not for $f$ but for $g(x)=x-f(x)/f'(x)$, which is $g(x)=frac12(x-c/x)$. Starting from scratch, this looks like a lot of work.
$endgroup$
– user147263
Dec 1 '14 at 1:31






1




1




$begingroup$
Looks very closely related to this question. Same user, different account?
$endgroup$
– Mark McClure
Dec 1 '14 at 13:06




$begingroup$
Looks very closely related to this question. Same user, different account?
$endgroup$
– Mark McClure
Dec 1 '14 at 13:06










1 Answer
1






active

oldest

votes


















2












$begingroup$

I recommend that you use the notion of dynamically conjugacy - an extremely important tool in dynamics. The function $f$ is said to be dynamically conjugate to $g$ if there is a function $varphi$ such that $fcircvarphi = varphicirc g$. It's not hard to show that this implies $f^ncircvarphi = varphicirc g^n$. As a result, $varphi$ maps an orbit of $g$ starting at $z_0$ to an orbit of $f$ starting at $varphi(z_0)$ so that the dynamics of $f$ and $g$ will be closely related. Typically, the conjugacy $varphi$ is assumed to have some nice properties. The nicer $varphi$, the closer the relationship between $f$ and $g$.



For example, let $f_c(z)=z^2+c$ so that the Newton's method iteration function is $$n_c(z)=frac{z}{2}-frac{c}{2,z}.$$
It turns out that $n_c(z)$ is conjugate to $n_1$ via $varphi(z)=sqrt{c},z$. We can show this with a couple simple computations:



begin{align}
n_c(varphi(z)) &= frac{sqrt{c},z}{2} - frac{c}{2sqrt{c},z} =
frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z} \
varphi(n_1(z)) &= sqrt{c}left(frac{z}{2}-frac{1}{2,z}right) =
frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z}.
end{align}



Since these are equal, we have the conjugacy you were looking for. Note that this already helps your cause - if you can show that $n_1$ is a chaotic map on the line, then so is $n_c$ for any choice of $c$. Thus, you can focus on just the one choice of $c$.



Now to show that $n_1$ is a chaotic map, you can show that it is dynamically conjugate to some function that is known to be chaotic. I'll let you fill out the details, but here are some possibilities.




  • The complex squaring function $g(z)=z^2$ is known to be chaotic on the unit circle. Your function $n_1$ is conjugate to $g$ via the appropriate Mobius transformation.

  • The squaring function is conjugate to $f_{-2}(z)=z^2-2$ via the conjugacy $varphi(z)=z+1/z$. Furthermore, $varphi$ maps the unit circle to the interval $[-2,2]$. Thus, $f_{-2}$ is chaotic on that interval. If you happen to know already that $f_{-2}$ is chaotic on the interval (perhaps by studying it's relationship to the logistic function), then you can compose this conjugacy with the Mobius transformation above to obtain a conjugacy between $n_1$ and $f_{-2}$ thus showing that $n_1$ is chaotic. The advantage is that your final argument can avoid complex variables altogether.

  • The doubling function $d(x) = 2x mod 1$ is chaotic on the interval $[0,1)$. There's a fairly obvious conjugacy between the squaring function on the circle and the doubling function on the interval arising from the fact that the squaring function doubles the complex argument. By composition, $n_1$ is conjugate to the doubling function. Again, this would allow you to bypass the use of complex arithmetic, if desired. The advantage here is that the doubling function is very well known to be chaotic.

  • The Bernoulli map is a chaotic map in symbolic dynamics. While it requires some advanced notions from metric topology, it is super simple to see that it is a chaotic map, once those ideas are understood. It's not at all hard to show that the doubling function is conjugate to the Bernoulli map via it's itinerary map. Again via composition, you could set up a conjugacy between $n_1$ and the Bernoulli map.






share|cite|improve this answer









$endgroup$













    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%2f1045208%2fchaos-in-newtons-method%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$

    I recommend that you use the notion of dynamically conjugacy - an extremely important tool in dynamics. The function $f$ is said to be dynamically conjugate to $g$ if there is a function $varphi$ such that $fcircvarphi = varphicirc g$. It's not hard to show that this implies $f^ncircvarphi = varphicirc g^n$. As a result, $varphi$ maps an orbit of $g$ starting at $z_0$ to an orbit of $f$ starting at $varphi(z_0)$ so that the dynamics of $f$ and $g$ will be closely related. Typically, the conjugacy $varphi$ is assumed to have some nice properties. The nicer $varphi$, the closer the relationship between $f$ and $g$.



    For example, let $f_c(z)=z^2+c$ so that the Newton's method iteration function is $$n_c(z)=frac{z}{2}-frac{c}{2,z}.$$
    It turns out that $n_c(z)$ is conjugate to $n_1$ via $varphi(z)=sqrt{c},z$. We can show this with a couple simple computations:



    begin{align}
    n_c(varphi(z)) &= frac{sqrt{c},z}{2} - frac{c}{2sqrt{c},z} =
    frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z} \
    varphi(n_1(z)) &= sqrt{c}left(frac{z}{2}-frac{1}{2,z}right) =
    frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z}.
    end{align}



    Since these are equal, we have the conjugacy you were looking for. Note that this already helps your cause - if you can show that $n_1$ is a chaotic map on the line, then so is $n_c$ for any choice of $c$. Thus, you can focus on just the one choice of $c$.



    Now to show that $n_1$ is a chaotic map, you can show that it is dynamically conjugate to some function that is known to be chaotic. I'll let you fill out the details, but here are some possibilities.




    • The complex squaring function $g(z)=z^2$ is known to be chaotic on the unit circle. Your function $n_1$ is conjugate to $g$ via the appropriate Mobius transformation.

    • The squaring function is conjugate to $f_{-2}(z)=z^2-2$ via the conjugacy $varphi(z)=z+1/z$. Furthermore, $varphi$ maps the unit circle to the interval $[-2,2]$. Thus, $f_{-2}$ is chaotic on that interval. If you happen to know already that $f_{-2}$ is chaotic on the interval (perhaps by studying it's relationship to the logistic function), then you can compose this conjugacy with the Mobius transformation above to obtain a conjugacy between $n_1$ and $f_{-2}$ thus showing that $n_1$ is chaotic. The advantage is that your final argument can avoid complex variables altogether.

    • The doubling function $d(x) = 2x mod 1$ is chaotic on the interval $[0,1)$. There's a fairly obvious conjugacy between the squaring function on the circle and the doubling function on the interval arising from the fact that the squaring function doubles the complex argument. By composition, $n_1$ is conjugate to the doubling function. Again, this would allow you to bypass the use of complex arithmetic, if desired. The advantage here is that the doubling function is very well known to be chaotic.

    • The Bernoulli map is a chaotic map in symbolic dynamics. While it requires some advanced notions from metric topology, it is super simple to see that it is a chaotic map, once those ideas are understood. It's not at all hard to show that the doubling function is conjugate to the Bernoulli map via it's itinerary map. Again via composition, you could set up a conjugacy between $n_1$ and the Bernoulli map.






    share|cite|improve this answer









    $endgroup$


















      2












      $begingroup$

      I recommend that you use the notion of dynamically conjugacy - an extremely important tool in dynamics. The function $f$ is said to be dynamically conjugate to $g$ if there is a function $varphi$ such that $fcircvarphi = varphicirc g$. It's not hard to show that this implies $f^ncircvarphi = varphicirc g^n$. As a result, $varphi$ maps an orbit of $g$ starting at $z_0$ to an orbit of $f$ starting at $varphi(z_0)$ so that the dynamics of $f$ and $g$ will be closely related. Typically, the conjugacy $varphi$ is assumed to have some nice properties. The nicer $varphi$, the closer the relationship between $f$ and $g$.



      For example, let $f_c(z)=z^2+c$ so that the Newton's method iteration function is $$n_c(z)=frac{z}{2}-frac{c}{2,z}.$$
      It turns out that $n_c(z)$ is conjugate to $n_1$ via $varphi(z)=sqrt{c},z$. We can show this with a couple simple computations:



      begin{align}
      n_c(varphi(z)) &= frac{sqrt{c},z}{2} - frac{c}{2sqrt{c},z} =
      frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z} \
      varphi(n_1(z)) &= sqrt{c}left(frac{z}{2}-frac{1}{2,z}right) =
      frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z}.
      end{align}



      Since these are equal, we have the conjugacy you were looking for. Note that this already helps your cause - if you can show that $n_1$ is a chaotic map on the line, then so is $n_c$ for any choice of $c$. Thus, you can focus on just the one choice of $c$.



      Now to show that $n_1$ is a chaotic map, you can show that it is dynamically conjugate to some function that is known to be chaotic. I'll let you fill out the details, but here are some possibilities.




      • The complex squaring function $g(z)=z^2$ is known to be chaotic on the unit circle. Your function $n_1$ is conjugate to $g$ via the appropriate Mobius transformation.

      • The squaring function is conjugate to $f_{-2}(z)=z^2-2$ via the conjugacy $varphi(z)=z+1/z$. Furthermore, $varphi$ maps the unit circle to the interval $[-2,2]$. Thus, $f_{-2}$ is chaotic on that interval. If you happen to know already that $f_{-2}$ is chaotic on the interval (perhaps by studying it's relationship to the logistic function), then you can compose this conjugacy with the Mobius transformation above to obtain a conjugacy between $n_1$ and $f_{-2}$ thus showing that $n_1$ is chaotic. The advantage is that your final argument can avoid complex variables altogether.

      • The doubling function $d(x) = 2x mod 1$ is chaotic on the interval $[0,1)$. There's a fairly obvious conjugacy between the squaring function on the circle and the doubling function on the interval arising from the fact that the squaring function doubles the complex argument. By composition, $n_1$ is conjugate to the doubling function. Again, this would allow you to bypass the use of complex arithmetic, if desired. The advantage here is that the doubling function is very well known to be chaotic.

      • The Bernoulli map is a chaotic map in symbolic dynamics. While it requires some advanced notions from metric topology, it is super simple to see that it is a chaotic map, once those ideas are understood. It's not at all hard to show that the doubling function is conjugate to the Bernoulli map via it's itinerary map. Again via composition, you could set up a conjugacy between $n_1$ and the Bernoulli map.






      share|cite|improve this answer









      $endgroup$
















        2












        2








        2





        $begingroup$

        I recommend that you use the notion of dynamically conjugacy - an extremely important tool in dynamics. The function $f$ is said to be dynamically conjugate to $g$ if there is a function $varphi$ such that $fcircvarphi = varphicirc g$. It's not hard to show that this implies $f^ncircvarphi = varphicirc g^n$. As a result, $varphi$ maps an orbit of $g$ starting at $z_0$ to an orbit of $f$ starting at $varphi(z_0)$ so that the dynamics of $f$ and $g$ will be closely related. Typically, the conjugacy $varphi$ is assumed to have some nice properties. The nicer $varphi$, the closer the relationship between $f$ and $g$.



        For example, let $f_c(z)=z^2+c$ so that the Newton's method iteration function is $$n_c(z)=frac{z}{2}-frac{c}{2,z}.$$
        It turns out that $n_c(z)$ is conjugate to $n_1$ via $varphi(z)=sqrt{c},z$. We can show this with a couple simple computations:



        begin{align}
        n_c(varphi(z)) &= frac{sqrt{c},z}{2} - frac{c}{2sqrt{c},z} =
        frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z} \
        varphi(n_1(z)) &= sqrt{c}left(frac{z}{2}-frac{1}{2,z}right) =
        frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z}.
        end{align}



        Since these are equal, we have the conjugacy you were looking for. Note that this already helps your cause - if you can show that $n_1$ is a chaotic map on the line, then so is $n_c$ for any choice of $c$. Thus, you can focus on just the one choice of $c$.



        Now to show that $n_1$ is a chaotic map, you can show that it is dynamically conjugate to some function that is known to be chaotic. I'll let you fill out the details, but here are some possibilities.




        • The complex squaring function $g(z)=z^2$ is known to be chaotic on the unit circle. Your function $n_1$ is conjugate to $g$ via the appropriate Mobius transformation.

        • The squaring function is conjugate to $f_{-2}(z)=z^2-2$ via the conjugacy $varphi(z)=z+1/z$. Furthermore, $varphi$ maps the unit circle to the interval $[-2,2]$. Thus, $f_{-2}$ is chaotic on that interval. If you happen to know already that $f_{-2}$ is chaotic on the interval (perhaps by studying it's relationship to the logistic function), then you can compose this conjugacy with the Mobius transformation above to obtain a conjugacy between $n_1$ and $f_{-2}$ thus showing that $n_1$ is chaotic. The advantage is that your final argument can avoid complex variables altogether.

        • The doubling function $d(x) = 2x mod 1$ is chaotic on the interval $[0,1)$. There's a fairly obvious conjugacy between the squaring function on the circle and the doubling function on the interval arising from the fact that the squaring function doubles the complex argument. By composition, $n_1$ is conjugate to the doubling function. Again, this would allow you to bypass the use of complex arithmetic, if desired. The advantage here is that the doubling function is very well known to be chaotic.

        • The Bernoulli map is a chaotic map in symbolic dynamics. While it requires some advanced notions from metric topology, it is super simple to see that it is a chaotic map, once those ideas are understood. It's not at all hard to show that the doubling function is conjugate to the Bernoulli map via it's itinerary map. Again via composition, you could set up a conjugacy between $n_1$ and the Bernoulli map.






        share|cite|improve this answer









        $endgroup$



        I recommend that you use the notion of dynamically conjugacy - an extremely important tool in dynamics. The function $f$ is said to be dynamically conjugate to $g$ if there is a function $varphi$ such that $fcircvarphi = varphicirc g$. It's not hard to show that this implies $f^ncircvarphi = varphicirc g^n$. As a result, $varphi$ maps an orbit of $g$ starting at $z_0$ to an orbit of $f$ starting at $varphi(z_0)$ so that the dynamics of $f$ and $g$ will be closely related. Typically, the conjugacy $varphi$ is assumed to have some nice properties. The nicer $varphi$, the closer the relationship between $f$ and $g$.



        For example, let $f_c(z)=z^2+c$ so that the Newton's method iteration function is $$n_c(z)=frac{z}{2}-frac{c}{2,z}.$$
        It turns out that $n_c(z)$ is conjugate to $n_1$ via $varphi(z)=sqrt{c},z$. We can show this with a couple simple computations:



        begin{align}
        n_c(varphi(z)) &= frac{sqrt{c},z}{2} - frac{c}{2sqrt{c},z} =
        frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z} \
        varphi(n_1(z)) &= sqrt{c}left(frac{z}{2}-frac{1}{2,z}right) =
        frac{sqrt{c},z}{2} - frac{sqrt{c}}{2,z}.
        end{align}



        Since these are equal, we have the conjugacy you were looking for. Note that this already helps your cause - if you can show that $n_1$ is a chaotic map on the line, then so is $n_c$ for any choice of $c$. Thus, you can focus on just the one choice of $c$.



        Now to show that $n_1$ is a chaotic map, you can show that it is dynamically conjugate to some function that is known to be chaotic. I'll let you fill out the details, but here are some possibilities.




        • The complex squaring function $g(z)=z^2$ is known to be chaotic on the unit circle. Your function $n_1$ is conjugate to $g$ via the appropriate Mobius transformation.

        • The squaring function is conjugate to $f_{-2}(z)=z^2-2$ via the conjugacy $varphi(z)=z+1/z$. Furthermore, $varphi$ maps the unit circle to the interval $[-2,2]$. Thus, $f_{-2}$ is chaotic on that interval. If you happen to know already that $f_{-2}$ is chaotic on the interval (perhaps by studying it's relationship to the logistic function), then you can compose this conjugacy with the Mobius transformation above to obtain a conjugacy between $n_1$ and $f_{-2}$ thus showing that $n_1$ is chaotic. The advantage is that your final argument can avoid complex variables altogether.

        • The doubling function $d(x) = 2x mod 1$ is chaotic on the interval $[0,1)$. There's a fairly obvious conjugacy between the squaring function on the circle and the doubling function on the interval arising from the fact that the squaring function doubles the complex argument. By composition, $n_1$ is conjugate to the doubling function. Again, this would allow you to bypass the use of complex arithmetic, if desired. The advantage here is that the doubling function is very well known to be chaotic.

        • The Bernoulli map is a chaotic map in symbolic dynamics. While it requires some advanced notions from metric topology, it is super simple to see that it is a chaotic map, once those ideas are understood. It's not at all hard to show that the doubling function is conjugate to the Bernoulli map via it's itinerary map. Again via composition, you could set up a conjugacy between $n_1$ and the Bernoulli map.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 1 '14 at 14:16









        Mark McClureMark McClure

        23.7k34472




        23.7k34472






























            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%2f1045208%2fchaos-in-newtons-method%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

            Plaza Victoria

            Puebla de Zaragoza

            Musa