For , the fixed points are and when the latter is defined. On the physical interval the nonzero branch exists for , meeting zero at . Their multipliers are and , respectively. Thus zero is linearly attracting for and repelling for ; the positive point is linearly attracting for and repelling for . At and the relevant multiplier has magnitude one, so linearization is inconclusive. At , attracts small positive points to zero nonlinearly.
Factoring and removing its fixed-point factors gives . Its distinct roots areThey map to each other, giving a genuine two-cycle only beyond . The cycle multiplier isSolving in givesAt , the two roots coalesce with , where the fixed-point multiplier is : a supercritical period-doubling bifurcation creates the attracting two-cycle. At the upper endpoint its multiplier reaches , marking the next loss of linear stability. The two-cycle is superstable at , where . At exactly the fixed point remains weakly attracting through higher-order terms: for , the second iterate is , showing alternating perturbations decay slowly.
For a nearby orbit, linearized separation satisfies . Repeated use of the chain rule gives to first order. Taking the logarithm of its magnitude and dividing by gives the exponential growth rateThe infinitesimal-perturbation limit is taken before interpreting long-time growth; finite separations eventually leave the linear regime. The limit is assumed to exist, with a limsup used when needed.
On a -cycle, blocks of successive derivatives repeat. If , the remainder of fewer than terms has vanishing contribution to the long-time average andLinear attraction means , giving . A superstable cycle has , meaning at least one derivative in the cycle vanishes. Its infinitesimal return multiplier is zero and the corresponding logarithmic exponent is . This concerns the derivative cocycle; actual finite perturbations can converge by higher-order rather than literally vanishing in one step.
In the two-symbol shift representation, is fixed under a shift and codes the fixed point labelled . The constant all-ones sequence supplies the analogous example. The dot only marks the present position; shifting it advances one iterate. The assertion uses the faithful orbit coding assumed in the question.
Use the primitive repeating word . One shift changes the sequence and three shifts return it, so the least period is three. A word such as repeated would instead have least period one; primitivity is what distinguishes a true three-cycle from a periodic notation for a fixed point.
The sequence has exactly one and otherwise zero entries. Under forward shifts that exceptional symbol moves out of every fixed observation window; the same happens under backward shifts in the other direction. Thus both temporal limits are the all-zero fixed sequence, while the orbit itself is nonconstant: it is homoclinic to that fixed point. The bi-infinite coding specifies a chosen full orbit even when the original interval map is not invertible.
Choose , with zeros on the entire left tail and ones on the entire right tail. Forward shifts converge in the symbolic metric to the all-one fixed point, while backward shifts converge to the all-zero fixed point. Its two limiting invariant states differ, so it is a heteroclinic orbit. Reversing the two tails reverses these asymptotic roles.
One explicit future itinerary is obtained by concatenating all binary words, ordered first by length and then lexicographically:Extend it arbitrarily to negative indices, for example by zeros. Every finite binary block occurs in its forward itinerary, and indeed occurs arbitrarily far out as a subword of longer words. Its shift orbit is therefore dense in the full two-symbol shift space. It is not eventually periodic: arbitrarily long runs of zeros and ones occur, together with all other finite words.
The full shift has sensitive dependence because sequences agreeing on an arbitrarily large initial window can differ just beyond it, and shifting brings that disagreement into view. Thus this itinerary supplies a dense aperiodic orbit in the chaotic symbolic system assumed by the question. A merely nonrepeating sequence would not be enough: restricted aperiodic sequences can have much simpler, nonchaotic orbit closures. Nor does symbolic description alone assign a numerical Lyapunov exponent without information about the underlying map and its coding.
Articles by others on the same topic
There are currently no matching articles.