Homework 2

Problem 1

Analytically Study the Period 2 orbits of the Logistic Map, where f(x) = rx(1-x).

We first find the period two orbit. [Note: This is also done at the site http://mathworld.wolfram.com/LogisticMap.html]

x
=
f(f(x))
=
r(f(x)(1-f(x))
=
r2x(1-x)(1-rx(1-x)).
Putting all terms on one side and factoring,
0
=
r2x(1-x)(1-rx(1-x))-x.
=
x[r2(1-x)(1-rx(1-x))-x]
=
x[-r3x3+2r3x2-r2(1+r)x+(r2-1)]
=
-r3x[x-(1-r-1][x2-(1+r-1)x+r-1(1+r-1].
The first two factors gives the fixed points, so we need only solve
[x2-(1+r-1)x+r-1(1+r-1] = 0.
The solutions are given by
x±
=
1
2
[1+ 1
r
±Ö
(1+r-1)2-4r-1(1+r-1)
 
=
1
2r
[1+r ±   ________
Ö(r-3)(r+1)
 
].
These period two points exist for r > 3. However, we need to know that x± Î [0,1] for 3 < r £ 4.

We now examine the stability of this orbit {x0, x1, x0, x1,x0, ... }.

1
>
|f¢(x+)f¢(x-)|
=
|r(1-2x+)r(1-2x-)|
=
|r(1- 1
r
[1+r +   ________
Ö(r-3)(r+1)
 
])r(1- 1
r
[1+r -   ________
Ö(r-3)(r+1)
 
])|
=
|(-1-   ________
Ö(r-3)(r+1)
 
)(-1+   ________
Ö(r-3)(r+1)
 
)|
=
|(r-3)(r+1)-1|
=
|r2-2r-4|.
Therefore, we need -1 < r2-2r-4 < 1. So, r2-2r-3 > 0 or r2-2r-5 < 0. The first inequality can be factored, (r-3)(r+1) > 0; therefore, we find r > 3. The second inequality can be factored also. Solving r2-2r-5 = 0, yields roots 1±Ö6. The inequality becomes (r-(1+Ö6))(r-(1-Ö6)) < 0. For values of r > 3, we find that r < 1+Ö6.
 

Other Problems of Interest

The following are solutions to unassigned problems this year. Problem 1.15 demonstrates Proof by Induction on n. That is, (1) Prove it true for n=0. (2) Assume it true for n=k and prove it true for n=k+1. Problem 1.17 looks at lengths of itineraries for the logistic map.

1.15
As per the hint, we will do a proof by induction on n. The statement to prove is

Pn: The nth point in the orbit generated by iterations of G(x) = 4x(1-x) is xn = 1/2 - 1/2cos(2ncos-1(1-2x0)).

Prove P0 true.

1
2
- 1
2
cos(20cos-1(1-2x0))
=
1
2
- 1
2
cos(cos-1(1-2x0))
=
1
2
- 1
2
(1-2x0))
=
x0.
So, P0 is true

Prove Pk true Þ Pk+1 true.

We assume that

xk = 1
2
- 1
2
cos(2kcos-1(1-2x0)).
We want to conclude that
xk+1 = 1
2
- 1
2
cos(2k+1cos-1(1-2x0))
gives the same result as xk+1 = G(xk). So, we compute

xk+1
=
G(xk)
=
4xk(1-xk)
=
4[ 1
2
- 1
2
cos(2kcos-1(1-2x0))](1-[ 1
2
- 1
2
cos(2kcos-1(1-2x0))])
=
[1 - cos(2kcos-1(1-2x0))][1+cos(2kcos-1(1-2x0))]
=
1 - cos2(2kcos-1(1-2x0))
=
sin2(2kcos-1(1-2x0))
=
1
2
[1 -cos2(2(2kcos-1(1-2x0)))]
=
1
2
- 1
2
cos(2k+1cos-1(1-2x0)).
Therefore we have proven that if Pk is true then Pk+1 true for any number k.

So, by the Principle of Mathematical Induction on n, we can now say that statement Pn is true for all n ³ 0. [Note, that this last sentence is needed to complete the proof.]

1.17

In this problem we are looking at the length of the itinerary interval for G(x) given by LLLLL... L has length [1-cos(p/2k]/2. Thus, we need to find the range of x0 such that 0 < Gn(x0) < 1/2, for 0 £ n < k.

0
<
xn = Gn(x0) < 1
2
0
<
1
2
- 1
2
cos(2ncos-1(1-2x0)) < 1
2
0
<
1 -cos(2ncos-1(1-2x0)) < 1
1
>
cos(2ncos-1(1-2x0)) > 0
- p
2
<
2ncos-1(1-2x0) < p
2
- p
2n+1
<
cos-1(1-2x0) < p
2n+1
cos( p
2n+1
)
<
1-2x0 < 1
-cos( p
2n+1
)
>
2x0-1 > -1
1 -cos( p
2n+1
)
>
2x0 > 0
1
2
[1-cos( p
2n+1
)]
>
x0 > 0.
Therefore, letting k = n+1, we have shown that for x0 Î (0, 1/2[1-cos([(p)/( 2k)])]) 0 < xn < 1/2, 0 £ n < k. The length of the interval is obviously 1/2[1 -cos([(p)/( 2k)])].


File translated from TEX by TTH, version 2.25.
On 26 Sep 1999, 14:10.