Jump to content

Complex squaring map

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Maxlittle2007 (talk | contribs) at 22:33, 8 August 2009 (Do not confuse power 2 times n with power 2 power n: they are entirely different. It is trivial to check by substitution that power 2 power n is indeed the correct solution.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the complex squaring map, a polynomial mapping of degree two, is a simple and accessible demonstration of chaos in dynamical systems. It can be constructed by performing the following steps:

  1. Choose any complex number on the unit circle whose argument (complex angle) is not a rational fraction of π,
  2. Repeatedly square that number.

This repetition (iteration) produces a sequence of complex numbers that can be described by their complex angle alone. Any choice of starting angle that satisfies (1) above will produce an extremely complicated sequence of angles, that belies the simplicity of the steps. In fact, it can be shown that the sequence will be chaotic, i.e. it is sensitive to the detailed choice of starting angle.

Chaos and the complex squaring map

The informal reason why the iteration is chaotic is that (a) the angle doubles on every iteration and doubling grows very quickly as the angle becomes ever larger, but (b) the angle must be limited to lie on the circle, i.e. the range zero to 2π (radians). Thus, when the angle exceeds 2π, it must wrap to the remainder on division by 2π. Now, π is a transcendental number and the fractional part has no known pattern. Thus, even if the initial angle is chosen such that it has a finite number of digits and is known with complete accuracy, the remainder on division by 2π inherits the lack of pattern in the fractional part of π. The iteration therefore "reads out" the patternless detail of the fractional part of π, and this is in fact the origin of the complexity of the angle sequence.

More formally, the iteration can be written as:

where is the resulting sequence of complex numbers obtained by iterating the steps above, and represents the initial starting number. We can solve this iteration exactly:

Starting with angle θ, we can write the initial term as so that . This makes the successive doubling of the angle clear. Also, the relation makes the wrapping of the angle onto the circle obvious. The doubling-and-wrapping is the same origin of chaos as the stretching-and-folding of the logistic map, for example, and leads to exponential divergence of close starting angles (see Lyapunov exponents). If the initial angle is expanded in a binary representation, then the iteration can be clearly seen to be equivalent to the shift map.

Generalisations

This map is a special case of the complex quadratic map, which has exact solutions for many special cases.[1] The complex map obtained by raising the previous number to any natural number power is also exactly solvable as . In the case p = 2, the dynamics can be mapped to the binary shift map, as described above, but for p > 2, we obtain a shift map in the number base p. For example, p = 10 is a decimal shift map.

See also

References

  1. ^ M. Little, D. Heesch (2004), Chaotic root-finding for a small class of polynomials, Journal of Difference Equations and Applications, 10(11):949–953.