Feigenbaum function

From HandWiki
Short description: Concept in dynamical systems

In the study of dynamical systems the term Feigenbaum function has been used to describe two different functions introduced by the physicist Mitchell Feigenbaum:[1]

Idea

Period-doubling route to chaos

In the logistic map,

xn+1=rxn(1−xn),

 

 

 

 

(1)

we have a function fr(x)=rx(1−x), and we want to study what happens when we iterate the map many times. The map might fall into a fixed point, a fixed cycle, or chaos. When the map falls into a stable fixed cycle of length n, we would find that the graph of frn and the graph of x↦x intersects at n points, and the slope of the graph of frn is bounded in (−1,+1) at those intersections.

For example, when r=3.0, we have a single intersection, with slope bounded in (−1,+1), indicating that it is a stable single fixed point.

As r increases to beyond r=3.0, the intersection point splits to two, which is a period doubling. For example, when r=3.4, there are three intersection points, with the middle one unstable, and the two others stable.

As r approaches r=3.45, another period-doubling occurs in the same way. The period-doublings occur more and more frequently, until at a certain r≈3.56994567, the period doublings become infinite, and the map becomes chaotic. This is the period-doubling route to chaos.

Relationship between xn+2 and xn when a=2.7. Before the period doubling bifurcation occurs. The orbit converges to the fixed point xf2.
Relationship between xn+2 and xn when a=3. The tangent slope at the fixed point xf2. is exactly 1, and a period doubling bifurcation occurs.
Relationship between xn+2 and xn when a=3.3. The fixed point xf2 becomes unstable, splitting into a periodic-2 stable cycle.
When r=3.0, we have a single intersection, with slope exactly +1, indicating that it is about to undergo a period-doubling.
When r=3.4, there are three intersection points, with the middle one unstable, and the two others stable.
When r=3.45, there are three intersection points, with the middle one unstable, and the two others having slope exactly +1, indicating that it is about to undergo another period-doubling.
When r≈3.56994567, there are infinitely many intersections, and we have arrived at chaos via the period-doubling route.

Scaling limit

File:Logistic map approaching the scaling limit.webm

At the point of chaos r*=3.5699⋯, as we repeat the period-doublingsfr*1,fr*2,fr*4,fr*8,fr*16,…, the graphs seem to resemble each other, except that they are shrunken towards the middle, and rotated by 180 degrees, converging to a fractal.

Looking at the images, one can notice that at the point of chaos r*=3.5699⋯, the curve of fr*∞ looks like a fractal. Furthermore, as we repeat the period-doublingsfr*1,fr*2,fr*4,fr*8,fr*16,…, the graphs seem to resemble each other, except that they are shrunken towards the middle, and rotated by 180 degrees.

This suggests to us a scaling limit: if we repeatedly double the function, then scale it up by α for a certain constant α:f(x)↦−αf(f(−x/α)) then at the limit, we would end up with a function g that satisfies g(x)=−αg(g(−x/α)). Further, as the period-doubling intervals become shorter and shorter, the ratio between two period-doubling intervals converges to a limit, the first Feigenbaum constant δ=4.6692016⋯.File:Logistic scaling with varying scaling factor.webm

At the point of chaos r*=3.5699⋯, as we repeat the functional equation iteration f(x)↦−αf(f(−x/α)) with α=2.5029…, we find that the map does converge to a limit.

The constant

α

can be numerically found by trying many possible values. For the wrong values, the map does not converge to a limit, but when it is

α=2.5029…

, it converges. This is the second Feigenbaum constant.

Chaotic regime

In the chaotic regime, fr∞, the limit of the iterates of the map, becomes chaotic dark bands interspersed with non-chaotic bright bands. File:Logistic map in the chaotic regime.webm

Other scaling limits

When r approaches r≈3.8494344, we have another period-doubling approach to chaos, but this time with periods 3, 6, 12, ... This again has the same Feigenbaum constants δ,α. The limit of f(x)↦−αf(f(−x/α)) is also the same function. This is an example of universality.File:Logistic map approaching the period-3 scaling limit.webm We can also consider period-tripling route to chaos by picking a sequence of r1,r2,… such that rn is the lowest value in the period-3n window of the bifurcation diagram. For example, we have r1=3.8284,r2=3.85361,…, with the limit r∞=3.854077963…. This has a different pair of Feigenbaum constants δ=55.26…,α=9.277….[2] And fr∞converges to the fixed point tof(x)↦−αf(f(f(−x/α)))As another example, period-4-pling has a pair of Feigenbaum constants distinct from that of period-doubling, even though period-4-pling is reached by two period-doublings. In detail, define r1,r2,… such that rn is the lowest value in the period-4n window of the bifurcation diagram. Then we have r1=3.960102,r2=3.9615554,…, with the limit r∞=3.96155658717…. This has a different pair of Feigenbaum constants δ=981.6…,α=38.82….

In general, each period-multiplying route to chaos has its own pair of Feigenbaum constants. In fact, there are typically more than one. For example, for period-7-pling, there are at least 9 different pairs of Feigenbaum constants.[2]

Generally, 3δ≈2α2, and the relation becomes exact as both numbers increase to infinity: lim⁡δ/α2=2/3.

Feigenbaum-Cvitanović functional equation

This functional equation arises in the study of one-dimensional maps that, as a function of a parameter, go through a period-doubling cascade. Discovered by Mitchell Feigenbaum and Predrag Cvitanović,[3] the equation is the mathematical expression of the universality of period doubling. It specifies a function g and a parameter α by the relation

g(x)=−αg(g(−x/α))

with the initial conditions{g(0)=1,g′(0)=0,g″(0)<0.For a particular form of solution with a quadratic dependence of the solution near x = 0, α = 2.5029... is one of the Feigenbaum constants.

The power series of g is approximately[4]g(x)=1−1.52763x2+0.104815x4+0.026705x6+O(x8)

Renormalization

The Feigenbaum function can be derived by a renormalization argument.[5]

The Feigenbaum function satisfies[6]g(x)=limn→∞1F(2n)(0)F(2n)(xF(2n)(0)) for any map on the real line F at the onset of chaos.

Scaling function

The Feigenbaum scaling function provides a complete description of the attractor of the logistic map at the end of the period-doubling cascade. The attractor is a Cantor set, and just as the middle-third Cantor set, it can be covered by a finite set of segments, all bigger than a minimal size dn. For a fixed dn the set of segments forms a cover Δn of the attractor. The ratio of segments from two consecutive covers, Δn and Δn+1 can be arranged to approximate a function σ, the Feigenbaum scaling function.

See also

Notes

  1. ↑ Feigenbaum, M. J. (1976) "Universality in complex discrete dynamics", Los Alamos Theoretical Division Annual Report 1975-1976
  2. ↑ 2.0 2.1 Delbourgo, R.; Hart, W.; Kenny, B. G. (1985-01-01). "Dependence of universal constants upon multiplication period in nonlinear maps" (in en). Physical Review A 31 (1): 514–516. doi:10.1103/PhysRevA.31.514. ISSN 0556-2791. PMID 9895509. Bibcode: 1985PhRvA..31..514D. https://link.aps.org/doi/10.1103/PhysRevA.31.514. 
  3. ↑ Footnote on p. 46 of Feigenbaum (1978) states "This exact equation was discovered by P. Cvitanović during discussion and in collaboration with the author."
  4. ↑ Iii, Oscar E. Lanford (May 1982). "A computer-assisted proof of the Feigenbaum conjectures". Bulletin (New Series) of the American Mathematical Society 6 (3): 427–434. doi:10.1090/S0273-0979-1982-15008-X. ISSN 0273-0979. https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society-new-series/volume-6/issue-3/A-computer-assisted-proof-of-the-Feigenbaum-conjectures/bams/1183548786.full. 
  5. ↑ Feldman, David P. (2019). Chaos and dynamical systems. Princeton. ISBN 978-0-691-18939-0. OCLC 1103440222. 
  6. ↑ Weisstein, Eric W.. "Feigenbaum Function" (in en). https://mathworld.wolfram.com/FeigenbaumFunction.html. 

Bibliography