Attracting and repelling fixed points and periodic cycles

[9/100%]
Show
LaTeX

We call a fixed point x∗x^{*} of the map ff attracting if for all x0x_{0} taken from some neighborhood of the point x∗x^{*}, the sequence xn=fn(x0)x_{n}=f^{n}\left(x_{0}\right) converges to the point x∗x^{*}. If for some neighborhood UU of the fixed point x∗x^{*} and an arbitrary point x0∈U,x0≠x∗x_{0} \in U, x_{0} \neq x^{*}, there is an index nn such that xn∉Ux_{n} \notin U, then the point x∗x^{*} is called repelling.

Let x∗x^{*} be a fixed point of the map ff, and suppose ff is differentiable at x∗x^{*}. Prove that

?
(a)

if ∣f′(x∗)∣<1\left|f^{\prime }\left(x^{*}\right)\right|<1, then x∗x^{*} is attracting;

(b)

if ∣f′(x∗)∣>1\left|f^{\prime }\left(x^{*}\right)\right|>1, then x∗x^{*} is repelling;

(c)

show by examples that a fixed point may be neither attracting nor repelling.

For which values of the parameter aa and for which x0∈Rx_{0} \in \mathbb {R} does the sequence of iterates xn=fn(x0)x_{n}=f^{n}\left(x_{0}\right) converge, if

?
(a)

f(x)=1+axf(x)=1+a x;

(b)

f(x)=1−a∣x∣(a>0)f(x)=1-a\left|x\right|(a>0);

(c)

f(x)=1−ax2(a>0)f(x)=1-a x^{2}(a>0);

(d)

f(x)=ax(a>0)f(x)=a^{x}(a>0).

The set {xn=fn(x0)∣n∈N}\left\{ x_{n}=f^{n}\left(x_{0}\right) \mid n \in \mathbb {N}\right\} is called the trajectory of the point x0x_{0}. If the trajectory is finite, then there exists n∈Nn \in \mathbb {N} such that the points x0,x1,…,xn−1x_{0}, x_{1}, \ldots , x_{n-1} are pairwise distinct, while xn=x0,xn+1=x1,…x_{n}=x_{0}, x_{n+1}=x_{1}, \ldots; in this case x0x_{0} is called a periodic point, the number nn its period, and the tuple (x0,…,xn−1)\left(x_{0}, \ldots , x_{n-1}\right) an nn-cycle.

Let (x0∗,x1∗,…,xn−1∗)−n\left(x_{0}^{*}, x_{1}^{*}, \ldots , x_{n-1}^{*}\right)-n-cycle of the map ff be given. Prove that

?
(a)

if ∣(fn)′(x0∗)∣<1\left|\left(f^{n}\right)^{\prime }\left(x_{0}^{*}\right)\right|<1, then for x0x_{0} taken from some neighborhood of x0∗x_{0}^{*}, the relation

fmn+k(x0)⟶m→∞xk∗,k=0,…,n−1; f^{m n+k}\left(x_{0}\right) \underset {m \rightarrow \infty }{\longrightarrow } x_{k}^{*}, \quad k=0, \ldots , n-1 ;

holds;

(b)

if ∣(fn)′(x0∗)∣>1\left|\left(f^{n}\right)^{\prime }\left(x_{0}^{*}\right)\right|>1, then for some ε>0\varepsilon >0 and any x0∈(x0∗−ε,x0∗+ε),x0≠x0∗\quad x_{0} \in \left(x_{0}^{*}-\varepsilon , x_{0}^{*}+\varepsilon \right), \quad x_{0} \neq x_{0}^{*}, there is an index mm such that ∣fm(x0)−xk∗∣⩾ε\left|f^{m}\left(x_{0}\right)-x_{k}^{*}\right| \geqslant \varepsilon for all k=0,…,n−1k=0, \ldots , n-1.

The set {xn=fn(x0)∣n∈N}\left\{ x_{n}=f^{n}\left(x_{0}\right) \mid n \in \mathbb {N}\right\} is called the trajectory of the point x0x_{0}. If the trajectory is finite, then there exists n∈Nn \in \mathbb {N} such that the points x0,x1,…,xn−1x_{0}, x_{1}, \ldots , x_{n-1} are pairwise distinct, while xn=x0,xn+1=x1,…x_{n}=x_{0}, x_{n+1}=x_{1}, \ldots; in this case x0x_{0} is called a periodic point, the number nn its period, and the tuple (x0,…,xn−1)\left(x_{0}, \ldots , x_{n-1}\right) an nn-cycle.

Prove that for n⩾2n \geqslant 2 the Chebyshev polynomial TnT_{n} (see problems I.2.20 and 1.16 b)), defined on [−1,1]\left[-1,1\right], has cycles of arbitrary order.

?

A fixed point x∗x^{*} of a map ff is called attracting if for all x0x_{0} from some neighborhood of x∗x^{*} the sequence xn=fn(x0)x_{n}=f^{n}\left(x_{0}\right) converges to x∗x^{*}, and repelling if for some neighborhood UU of it and every point x0∈Ux_{0} \in U, x0≠x∗x_{0} \neq x^{*}, there is an index nn such that xn∉Ux_{n} \notin U. If the points x0,x1,…,xn−1x_{0}, x_{1}, \ldots , x_{n-1}, where xk=fk(x0)x_{k}=f^{k}\left(x_{0}\right), are pairwise distinct while xn=x0x_{n}=x_{0}, then the tuple (x0,…,xn−1)\left(x_{0}, \ldots , x_{n-1}\right) is called an nn-cycle and nn the period of x0x_{0}; the nn-cycle is called attracting if x0x_{0} is an attracting fixed point of fnf^{n}, and repelling if x0x_{0} is a repelling fixed point of fnf^{n}.

Find the values of the parameter aa for which the map f(x)=1−a∣x∣(x∈R)f(x)=1-a\left|x\right|(x \in \mathbb {R}) has

?
(a)

a 2-cycle;

(b)

a 4-cycle;

(c)

a 3-cycle,

and determine when these cycles are attracting.

A fixed point x∗x^{*} of a map ff is called attracting if for all x0x_{0} from some neighborhood of x∗x^{*} the sequence xn=fn(x0)x_{n}=f^{n}\left(x_{0}\right) converges to x∗x^{*}, and repelling if for some neighborhood UU of it and every point x0∈Ux_{0} \in U, x0≠x∗x_{0} \neq x^{*}, there is an index nn such that xn∉Ux_{n} \notin U. If the points x0,x1,…,xn−1x_{0}, x_{1}, \ldots , x_{n-1}, where xk=fk(x0)x_{k}=f^{k}\left(x_{0}\right), are pairwise distinct while xn=x0x_{n}=x_{0}, then the tuple (x0,…,xn−1)\left(x_{0}, \ldots , x_{n-1}\right) is called an nn-cycle and nn the period of x0x_{0}; the nn-cycle is called attracting if x0x_{0} is an attracting fixed point of fnf^{n}, and repelling if x0x_{0} is a repelling fixed point of fnf^{n}.

Let a>0,f(x)=1−ax2(x∈R)a>0, f(x)=1-a x^{2}(x \in \mathbb {R}). Determine for which values of the parameter aa an attracting fixed point and an attracting 2-cycle exist. Find the "birth moments" of the 2-, 4- and 3-cycles (i.e., the lower bounds on the values of aa for which these cycles exist).

?

A fixed point x∗x^{*} of a map ff is called attracting if for all x0x_{0} from some neighborhood of x∗x^{*} the sequence xn=fn(x0)x_{n}=f^{n}\left(x_{0}\right) converges to x∗x^{*}, and repelling if for some neighborhood UU of it and every point x0∈Ux_{0} \in U, x0≠x∗x_{0} \neq x^{*}, there is an index nn such that xn∉Ux_{n} \notin U. If the points x0,x1,…,xn−1x_{0}, x_{1}, \ldots , x_{n-1}, where xk=fk(x0)x_{k}=f^{k}\left(x_{0}\right), are pairwise distinct while xn=x0x_{n}=x_{0}, then the tuple (x0,…,xn−1)\left(x_{0}, \ldots , x_{n-1}\right) is called an nn-cycle and nn the period of x0x_{0}; the nn-cycle is called attracting if x0x_{0} is an attracting fixed point of fnf^{n}, and repelling if x0x_{0} is a repelling fixed point of fnf^{n}.

Let f(x)=bx(1−x)(x∈[0,1]),0<b⩽4f(x)=b x(1-x)(x \in [0,1]), 0<b \leqslant 4. Find the lower bound of the values of the parameter bb for which ff has

?
(a)

an attracting 2-cycle;

(b)

a repelling 2-cycle;

(c)

a 4-cycle;

(d)

a 3-cycle.

The set {xn=fn(x0)∣n∈N}\left\{ x_{n}=f^{n}\left(x_{0}\right) \mid n \in \mathbb {N}\right\} is called the trajectory of the point x0x_{0}. If the trajectory is finite, then there exists n∈Nn \in \mathbb {N} such that the points x0,x1,…,xn−1x_{0}, x_{1}, \ldots , x_{n-1} are pairwise distinct, while xn=x0,xn+1=x1,…x_{n}=x_{0}, x_{n+1}=x_{1}, \ldots; in this case x0x_{0} is called a periodic point, the number nn its period, and the tuple (x0,…,xn−1)\left(x_{0}, \ldots , x_{n-1}\right) an nn-cycle.

Let x0∈(0,1)x_{0} \in (0,1) be a fixed point of a continuous map f:[0,1]→[0,1]f:\left[0,1\right] \rightarrow [0,1]. Prove that if the one-sided derivatives f±′(x0)f_{ \pm }^{\prime }\left(x_{0}\right) are negative and f+′(x0)f−′(x0)>1f_{+}^{\prime }\left(x_{0}\right) f_{-}^{\prime }\left(x_{0}\right)>1, then ff has a 2-cycle. In particular, a 2-cycle exists if f′(x0)<−1f^{\prime }\left(x_{0}\right)<-1.

?

The set {xn=fn(x0)∣n∈N}\left\{ x_{n}=f^{n}\left(x_{0}\right) \mid n \in \mathbb {N}\right\} is called the trajectory of the point x0x_{0}. If the trajectory is finite, then there exists n∈Nn \in \mathbb {N} such that the points x0,x1,…,xn−1x_{0}, x_{1}, \ldots , x_{n-1} are pairwise distinct, while xn=x0,xn+1=x1,…x_{n}=x_{0}, x_{n+1}=x_{1}, \ldots; in this case x0x_{0} is called a periodic point, the number nn its period, and the tuple (x0,…,xn−1)\left(x_{0}, \ldots , x_{n-1}\right) an nn-cycle.

Let gg be a piecewise smooth map of the interval [0,1]\left[0,1\right] into itself. Prove that if ∣g′(x)∣⩾a>1\left|g^{\prime }(x)\right| \geqslant a>1 at all points where the derivative exists, then gg has a 2n2^{n}-cycle for every n∈Nn \in \mathbb {N}. Show by an example that this fails if the smoothness of the map is violated on a countable set of points.

?

References

[МГЛ+04] Макаров Б.М., Голузина М.Г., Лодкин А.А., Подкорытов А.Н. Избранные задачи по вещественному анализу. 2-е изд., Невский Диалект; БХВ-Петербург, 2004.