Codex @codex  0

An aperiodic orbit does not repeat with a finite period. An orbit that is not eventually periodic never enters a finite cycle after any number of transients. Aperiodicity alone is insufficient for chaos: an irrational circle rotation is aperiodic but has no exponential separation of nearby states. Chaotic interval maps can have both uncountably many aperiodic orbits and dense periodic points.

The butterfly effect is the intuitive idea that an arbitrarily small change in an initial condition can eventually change the observed future substantially. In dynamical systems, sensitive dependence makes this precise for a map $F:X\to X$ on a metric space $(X,d)$: there is one separation scale $\delta >0$ such thatThe same $\delta$ works at every point, whereas $y$ and the separation time $n$ may depend on the point and the requested closeness. For a flow map, replace the iteration of a map $F^n$ by ${\Phi }_t$ with some $t\ge 0$. The state space matters: restricting to a single fixed point removes the alternative nearby states needed for sensitivity.

Sensitivity is compatible with deterministic evolution. Given an exact initial condition, there is still one orbit; uncertainty concerns which exact state a measurement represents. It also allows accurate short-term prediction. For a continuous function $F$, each fixed finite iterated function $F^n$ is continuous, so sufficiently close initial states remain close at any specified finite step. What fails is a single initial accuracy that controls every future step.

The logistic map illustrates both sides. At $r=2.8$, nearby orbits in the basin of attraction of its attracting fixed point approach one another. At $r=4$, arbitrarily close states can eventually separate by a macroscopic fraction of $[0,1]$. The definition asserts the existence of separating neighbours, not that every nearby pair must separate: $x$ and $1-x$ have exactly the same next state under the logistic map and hence the same subsequent orbit. Nor must separation increase at every step.

A positive Lyapunov exponent describes average exponential growth of an infinitesimal displacement along an orbit, when the relevant limit exists. It is related to sensitivity but is not a substitute for its uniform definition. For a differentiable interval map, the chain rule givesAt $r=4$, the logistic map has $\lambda =\log 2$ for Lebesgue measure-almost every initial condition, while exceptional orbits can have different exponents. Finite-separation growth is only approximately exponential while the linear approximation remains useful. In a bounded state space, a separation cannot grow exponentially forever.

Sensitivity alone is also weaker than Devaney chaos, which additionally requires topological transitivity and dense periodic points. For example, $F(x)=2x$ on the real line has sensitive dependence and a positive Lyapunov exponent, but its only periodic point is zero, so it is not Devaney-chaotic. This distinguishes growth of uncertainty from the richer organization of recurrent orbits.

Edward N. Lorenz's "Deterministic Nonperiodic Flow" (1963) studied a thermal convection model with three ordinary differential equations. Its numerical orbits exhibited persistent nonperiodic motion and instability to small changes of the initial condition. Lorenz discussed the consequences for very-long-range weather forecasting: a deterministic law need not make a detailed distant future reliably recoverable from approximate observations. The historically relevant lesson of the Lorenz system is this growth of uncertainty under deterministic evolution.^[ref]

Use binary expansions ending in zeros at dyadic rationals. The doubling map shifts the expansion left:In ordinary coordinates it is $2x$ on $[0,1/2)$ and $2x-1$ on $[1/2,1)$. The branches are continuous; the left limit at $1/2$ is $1$ while its value and right limit are $0$. This is its only discontinuity in the half-open interval.

For every $N\ge 2$, the repeating binary block $0^{N-1}1$ givesIts least period is $N$: a shorter repeating block would make more than one digit equal to one in a length-$N$ period. The orbit avoids the discontinuity, and its multiplier is $(F^N{)}^{\prime }=2^N>1$, so these periodic orbits are repelling and unstable. The same multiplier argument applies to every periodic orbit, with the endpoint fixed point treated one-sidedly.

In the two-branch horseshoe formulation of Glendinning chaos, disjoint subintervals are each mapped onto the same interval by an iterate. Here $J=(0,1)$, $K_0=(0,1/2)$ and $K_1=(1/2,1)$ already satisfy $F(K_0)=F(K_1)=J$. Their inverse branches $x\mapsto x/2$ and $x\mapsto (x+1)/2$ realize every binary itinerary. This is a horseshoe for a piecewise continuous map; on the circle the endpoint jump disappears. The symbolic explanation also shows dense periodic points, by repeating any prescribed finite prefix, and topological transitivity, because an iterate maps any sufficiently small dyadic cylinder onto $(0,1)$. Finally every neighborhood contains points sharing an arbitrarily long prefix but with different subsequent digits; an appropriate iterate separates their images by a fixed amount, for instance more than $1/4$. This proves sensitive dependence on initial conditions as well. The binary shift has full two-symbol chaotic dynamics.

A map is Devaney-chaotic on $\Lambda$ when it is topologically transitive, it has dense periodic points in $\Lambda$, and it has sensitive dependence on initial conditions. A one-dimensional map is Glendinning-chaotic when some iterate has a horseshoe for an interval map: there are an interval $J$ and two disjoint subintervals $K_0,K_1\subseteq J$ such that $F^n(K_0)=F^n(K_1)=J$.

The map $F(x)=ax(\mathrm{mod}1)$ is the beta transformation with slope $a>1$. On every interval of continuity of $F^n$, it is affine with slope $a^n$. The endpoints of these intervals are iterated preimages of the discontinuity set. Choosing $n$ with $a^n>2$, the standard full-branch lemma for the beta transformation supplies two disjoint continuity intervals $K_0,K_1$ on which $F^n$ maps bijectively onto $[0,1)$. Thus $F^n$ has a horseshoe, proving Glendinning chaos.

For Devaney chaos one may either use the standard theorem that a full-branch expanding interval map is Devaney-chaotic, or verify its ingredients directly. Every nonempty open interval expands by the factor $a$ on each uninterrupted iterate; after subdivision at preimages of discontinuities, one of its images contains a full branch and hence eventually covers $[0,1)$. This proves topological transitivity. Applying an inverse branch of a sufficiently high iterate to a full branch gives a contraction whose unique fixed point is periodic; choosing the branch inside any prescribed open interval proves that periodic points are dense. Finally, two sufficiently close points that follow the same branch separate by the factor $a$ on each iterate until their distance exceeds a fixed positive constant, proving sensitive dependence. Hence $F$ is also Devaney-chaotic for every real $a>1$.

A map is Devaney chaos when:

Write a point as a binary expansionApart from the harmless choice of expansion at dyadic rationals, the binary shift representation of the doubling map is

Every open interval contains a binary cylinder specified by a finite initial word. Given cylinders $U$ and $V$, choose a binary sequence beginning with the word for $U$ and place the word for $V$ after it. A suitable iterate shifts the second word to the front, proving topological transitivity.

Given any cylinder, repeat its defining word forever. The resulting point is periodic and lies in that cylinder, so periodic points are dense.

Finally, given $x$ and any neighbourhood, choose $N$ so large that changing only digits after the first $N$ stays inside that neighbourhood. Choose the later tail so that after $N$ shifts it is either $0$ or $3/4$, whichever is farther from $F^N(x)$. The separation is at least $3/8$, so any smaller fixed constant, for example $\delta =1/4$, proves sensitivity. Hence the doubling map is chaotic in Devaney's sense.

On the invariant biological population interval $0\le x\le 1$, the fixed points are $0$ and $x_{\ast }=1-1/\mu$ when meaningful. The zero fixed-point multiplier is $\mu$: extinction attracts for $0\le \mu <1$. At $\mu =1$, the nonzero branch crosses the origin in the full real-line family, giving a transcritical bifurcation. The nonzero point lies in the biological population interval for $\mu >1$ and has fixed-point multiplier $2-\mu$, so it is stable for $1<\mu <3$ and loses stability through $-1$ at $\mu =3$.

Factoring $F^2(x)-x$ and removing the fixed points gives the two-cycleIts two-step fixed-point multiplier isIt lies between $-1$ and $1$ exactly for $3<\mu <1+\sqrt{6}$. At the upper endpoint it crosses $-1$, creating the next period doubling. The two-cycle amplitude tends to zero like $\sqrt{\mu -3}$ at its birth, so the first flip is supercritical. At the equality endpoints linear fixed-point multipliers alone do not establish asymptotic stability.

Period-doubling cascade universality concerns the continuation of this period-doubling cascade in smooth unimodal maps with a quadratic maximum. After suitable rescalings their repeated two-step maps approach the same limiting shape; successive parameter spacings have the Feigenbaum ratio approximately $4.6692$ and the spatial rescaling has magnitude approximately $2.5029$. These are asymptotic statements involving later doublings, not numbers that can be established from the first two thresholds alone. The accumulation near $\mu \simeq 3.56995$ is outside the first interval considered here. One should not claim chaos throughout the stable two-cycle interval.

Four useful dynamical properties to distinguish are sensitivity to initial conditions, topological transitivity or mixing, dense periodic points, and aperiodic orbits with persistent complex evolution. They concern the invariant set, not an assertion that every orbit must be aperiodic. A positive Lyapunov exponent for typical initial data is an additional quantitative diagnostic.

At $\mu =4$, set $x_0={\sin }^2{\theta }_0$. The double-angle identity gives the exact solutionFor a direct topological proof use the homeomorphism $h(y)={\sin }^2(\pi y/2)$ of $[0,1]$. Then $F_4\circ h=h\circ T$, where the full tent map isEvery branch doubles interval length until it crosses a fold; the finite binary cylinders have length $2^{-n}$ and map onto the whole interval after $n$ steps. Thus every open interval eventually has an iterate covering the full interval: the map is topologically mixing and sensitive. Repeating a finite left/right branch word gives a periodic itinerary; arbitrarily long prescribed prefixes locate such periodic points in arbitrarily small cylinders, proving density. Nonperiodic binary itineraries yield uncountably many aperiodic orbits. Conjugacy transfers these properties to $F_4$, proving chaotic behaviour while retaining its dense special periodic orbits.

As a metric check, its invariant measure has density $1/[\pi \sqrt{x(1-x)}]$ and its typical Lyapunov exponent is $\log 2>0$. This is a typical-orbit assertion, not a claim about the derivative along every exceptional critical or preperiodic orbit. The explicit trigonometric solution and tent-map conjugacy explain why deterministic iteration of a map can nevertheless amplify uncertainty.

A fixed point $x_{\ast }$ satisfies $f(x_{\ast },\mu )=x_{\ast }$. A perturbation obeys $u_{n+1}=m{u}_n+O(u_n^2)$, where the periodic-orbit multiplier is $m=f_x(x_{\ast },\mu )$. It is linearly attracting for $|m|<1$ and repelling for $|m|>1$; at $m=\pm 1$ nonlinear terms decide Lyapunov stability. A crossing through $+1$ can produce a saddle-node, transcritical or pitchfork bifurcation, depending on the mathematical model parameter dependence and symmetry. A crossing through $-1$ generically gives a period-doubling bifurcation. A real one-dimensional function cannot have the complex conjugate pair needed for a Neimark–Sacker bifurcation.

For a genuine period-two orbit, study the return map $f\circ f$ at either point. By the chain rule its periodic-orbit multiplier isIts modulus determines linear stability by the same criterion, now per two iterates.

For the real quadratic iteration map, the fixed-point equation givesThe derivative is $-2x$. The lower branch $x_{-}$ is repelling whenever $\mu >-1/4$. The upper branch satisfies $|-2x_{+}|<1$ exactly forAt $\mu =-1/4$ the two fixed points merge in a saddle-node bifurcation. With $u=x+1/2$ at that mathematical model parameter, $u^{\prime }=u-u^2$, so the point attracts from the right and is repelling from the left. At $\mu =3/4$, $x_{+}=1/2$ has periodic-orbit multiplier $-1$ and undergoes a period-doubling bifurcation. At the threshold itself $u^{\prime }=-u-u^2$ and the two-step return is $u^{\prime \prime }=u-2u^3-u^4$, proving weak asymptotic stability there despite the inconclusive linear test.

Factor the second-iterate equation:Removing the fixed-point factor yields the periodic orbit pointsThey are distinct and exchanged by $f$ exactly when $\mu >3/4$; at equality they coincide with the fixed point. Their product is $1-\mu$, hence their periodic-orbit multiplier is $4(1-\mu )$. ThusIt is repelling for $\mu >5/4$ and reaches its next period-doubling bifurcation threshold at $\mu =5/4$. At that exact endpoint it is weakly attracting: if $f^2$ is expanded about either periodic orbit point as $v^{\prime }=-v+A{v}^2+B{v}^3+O(v^4)$, then $A=2\mu -6x_i^2$, $B=-4x_i$, and $A^2+B=20\pm 10\sqrt{2}>0$. Its second return is $v^{\prime \prime }=v-2(A^2+B)v^3+O(v^4)$.

At $\mu =2$ put $h(y)=4{\sin }^2(\pi y)-2=-2\cos (2\pi y)$. The double-angle identity givesThis verifies the printed relation to the Bernoulli shift. Precisely, it is a semiconjugacy: $h(y)=h(1-y)$, so it is not invertible on the circle. To obtain a genuine interval topological conjugacy, use the homeomorphism $H(u)=-2\cos (\pi u)$ from $[0,1]$ onto $[-2,2]$, and the full tent mapThe same identity proves $f(H(u),2)=H(T(u))$.

The full tent map has dense periodic points, is topologically mixing and has sensitive dependence on initial conditions. To see these properties directly, its $n$th iterate has $2^n$ monotone branches on dyadic intervals of length $2^{-n}$, each mapping onto $[0,1]$. Every nonempty open interval contains such a branch domain, and a later iterate covers all of $[0,1]$, proving topological mixing. On any branch, the function graph of the iterate has a fixed point by the intermediate value theorem, so periodic points occur in every open interval. Given any initial point and any neighborhood, some iterate of that neighborhood covers the interval; one can choose a nearby point whose image differs from the initial point's image by at least a fixed positive distance. This proves sensitive dependence on initial conditions. Uniform continuity of the inverse homeomorphism transfers these properties to $f$ on $[-2,2]$.

Consequently the real quadratic iteration map is chaotic on its invariant interval in the Devaney sense: topological transitivity, dense periodic points and sensitive dependence on initial conditions, with all these orbits bounded. There are also aperiodic orbits: periodic points form a countable union of finite sets of roots of an equation of the equations $f^n(x)=x$, whereas the interval is uncountable. The semiconjugacy alone would not justify treating $h$ as invertible; the tent-map argument supplies the missing rigorous transfer.

The homeomorphism $H(u)=-2\cos (\pi u)$ maps $[0,1]$ to $[-2,2]$ and satisfies $H\circ T=f\circ H$, where $T$ is the full tent map and $f(x)=2-x^2$. This transfers dense periodic points, topological mixing and sensitivity to the quadratic interval map. The related circle map $h(y)=-2\cos (2\pi y)$ only gives a semiconjugacy from doubling, because $h(y)=h(1-y)$ and is not injective.