A one-dimensional discrete dynamical system iterates a map . A fixed point satisfies , while a point of least period satisfies but no corresponding equation for a smaller positive period.
A map is noninvertible when it is not one-to-one and onto on the phase space under consideration. Forward iteration can be well-defined while backward states are absent or nonunique. A zero Jacobian multiplier can provide strong contraction at a fixed point. For the Lozi family, setting sends the whole plane into a line after one iteration, illustrating why a discrete saddle may have a zero stable multiplier without a unique local backward evolution.
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.
A piecewise affine planar map whose derivative changes across . Away from that line its Jacobian is , with determinant . For it is invertible; at an iteration collapses the image onto a line. The switching line requires piecewise analysis rather than applying a smooth-map theorem across it without checking its hypotheses.
The positive fixed point exists when and equals ; the negative one exists when and equals . Equality on either boundary does not give a branch, because its fixed-point equation becomes . For a genuine two-cycle and , subtracting its scalar equations rules out equal signs of the two first coordinates. Solving with gives the displayed coordinates and second coordinates , . Their signs require exactly . The cycle is unique up to interchanging its two points. Degenerate boundary parameter lines can support additional period-two families and are outside this statement.
An iterate is the result of repeatedly applying a self-map to an initial state. The th iterate of is , where the superscript denotes composition.
A planar diffeomorphism is area-preserving if the phase-space area of every measurable set is unchanged. The change-of-variables formula proves this property when everywhere, and conversely gives that determinant condition for a smooth map preserving all sufficiently small areas. Such a map cannot have an asymptotically attracting fixed point with a positive-area local basin: iterates of a small invariant neighborhood would have to enter arbitrarily small disks while retaining its phase-space area. For a map with constant positive determinant , invariance of a bounded region of positive phase-space area instead forces .
This triangular planar map has diagonal Jacobian matrix entries one and determinant one, for differentiable . Its inverse subtracts , so it is an area-preserving map. The analogous vertical map has the same property. Their composition preserves area even when the shifts are nonlinear, as in the logarithmic area-preserving seasonal predator-prey map.
For , the origin multipliers are , . A nonzero fixed point has , , and . Since the map is odd, a symmetric two-cycle has ; it satisfies and . Eliminating from the two map equations gives these identities directly. They locate the side of each pitchfork or flip without relying on a potentially misleading cubic sign in the original coordinates. At the second identity becomes , giving the quartic amplitude scaling of a generalized flip bifurcation.
The Hénon map is a two-parameter quadratic planar map, conventionally . The alternative family has constant Jacobian determinant . When , the change , gives the conventional parameters , . Fixed points in the alternative normalization satisfy and . Its invertibility requires ; at it preserves area.
At the Hénon map has unit Jacobian determinant. The upper fixed point is linearly elliptic for , and its newborn two-cycle is elliptic for . These are neutral multiplier statements, not attraction. The endpoints have double multipliers and . Constant-area scaling also excludes a simple invariant closed curve enclosing positive area when and : invariance of its interior would require both and . Thus the elliptic stability boundary is a conservative degeneracy, not a generic dissipative Neimark-Sacker bifurcation. Arbitrary non-area-preserving perturbations can change this behavior even though generic fold and flip curves persist.
For the Hénon map with , fixed points exist at . Their multipliers satisfy . The Jury stability criterion gives asymptotic stability only for the upper branch, with and . The two-cycle has alternating values satisfying and . Its second-iterate trace is and determinant , so it is attracting for until . The fixed-point fold and first flip are nondegenerate away from endpoints and persist under small smooth perturbations.
If is even and an orbit does not hit zero before its final iterate, induction gives . The step uses oddness of on nonzero arguments. A one-sided assigned value of can invalidate that step after a critical hit; for , , , the claimed second-iterate formula would give while the actual value is .
// Target: dynamical-systems.bigb
For a noncritical least-period- cycle of , the multiplier sign is . A positive multiplier gives two symmetry-related period- cycles of the odd quadratic Lorenz map; a negative multiplier gives one period- cycle. Their multipliers are respectively and . Distinct points of a quadratic-map cycle cannot have the same absolute value, since the map is even and acts bijectively on its cycle; this proves the asserted least periods.
// Target: dynamical-systems.bigb
Away from zero this discontinuous map is odd, and its branch derivatives are . With the convention , its value at zero is , so it is not odd at zero unless . A global transition at turns two small stable fixed points into one stable symmetric two-cycle. Its unsigned dynamics can be related to the even quadratic map , provided critical hits are treated separately.
// Target: dynamical-systems.bigb
The two-cycle of has points and multiplier . Crossing changes its sign and passes through the critical cycle . The sign lift therefore changes from two stable two-cycles to one stable four-cycle. The second iterate is continuous at zero at the transition, but retains jumps at the nonzero preimages of zero. Thus the return-map interpretation concerns a neighborhood of zero, not continuity of the whole second iterate on the real line.
// Target: dynamical-systems.bigb
The displayed map has a symmetric periodic orbit for , with multiplier . For , put . The two additional period-two orbits are and their negatives. Their multiplier is , so they are stable for and undergo a period-doubling bifurcation at . At these points coincide with fixed points, not genuine two-cycles.
For a partial function with , its th iterated function is defined only when each intermediate application is defined. Put , , and use the displayed recursion for the domain of a function. Simplifying an algebraic expression for does not restore points excluded by an intermediate application. For example, has on ; the simplified expression has a larger natural domain of a function.
The sine fixed-point iteration converges to zero from every real starting value. After one step, , and . Since for , the absolute values form a bounded monotone sequence. Its limit satisfies by continuity, forcing . This proves convergence even though the sine is not a contraction mapping on any interval containing zero in its interior.
A map on can satisfy and still have no orbit tending to zero. Partition the domain into and define on . Every interval is invariant under the iteration of a map, and has a positive limit. The discontinuities at interval boundaries prevent that limit from being a fixed point. In contrast, continuity of a self-map satisfying permits passage to a positive orbit limit and would force an impossible fixed point.
Topological entropy measures the exponential growth rate of distinguishable orbit segments of a dynamical system.
For a two-dimensional hyperbolic toral automorphism, the stable and unstable eigenvalues obey . In a sufficiently small Bowen ball, lifting to the stable and unstable coordinates gives widths proportional to and . Its normalized Haar measure is therefore proportional to , uniformly in the centre. Maximal separated sets cover by radius- Bowen balls and pack disjoint radius- Bowen balls, so their exponential growth rate is . Smallness of must exclude nonzero lattice jumps between successive lifted iterates; this is essential to the ball-volume argument.
For a continuous map on a compact metric space, the Bowen metric compares the first points of two forward orbits. Its radius- ball is . If is the largest cardinality of an -separated set in this metric, then topological entropy is . The uniform continuity of the identity between two compatible metrics gives the comparison of separated-set counts needed for independence of the original metric.
A radius- ball for a Bowen metric consists of the points whose first iterates stay within of the corresponding iterates of the centre. Balls at a fixed small radius distinguish forward orbit segments at that observational resolution.
A dynamical system has positive topological entropy when ; this expresses exponential orbit complexity.
A continuous interval map has positive topological entropy if and only if some positive iterate has a horseshoe for an interval map.
An interval map is a continuous function from a real interval to itself. Its iterates form a one-dimensional discrete dynamical system.
The family has fixed points . Its upper branch attracts linearly for and loses stability in a period-doubling bifurcation. The resulting two-cycle has points and multiplier , attracting for . At , the map is conjugate on to the full tent map.
The homeomorphism maps to and satisfies , where is the full tent map and . This transfers dense periodic points, topological mixing and sensitivity to the quadratic interval map. The related circle map only gives a semiconjugacy from doubling, because and is not injective.
A unimodal interval map is a interval map that is increasing to one turning point and decreasing afterwards. For a differentiable map with a maximum at zero, a critical point of even order means with . The critical order distinguishes universality classes of period-doubling cascades.
// Target: dynamical-systems.bigb
For a normalized even unimodal interval map with and , defineThis returns the second iterate near the critical point to the original spatial and height normalization. Then . A restrictive-interval condition is also needed for the composition to remain unimodal and map into itself; normalization alone is not sufficient.
// Target: dynamical-systems.bigb
Fix and write with absolutely summable real coefficients. The coefficient space is a Banach space under . The normalized even maps form an affine copy of that space and are analytic where . On any smaller coefficient disk, the tail beyond degree is bounded by for a radius ratio . Analytic composition and Cauchy estimates on smaller domains permit certified derivative and truncation bounds. A small ball about an admissible map must additionally preserve the quadratic critical maximum and restrictive-interval conditions; the coefficient norm alone does not impose them.
// Target: banach-space.bigb
A Feigenbaum fixed point is an even analytic unimodal interval map with , a critical maximum of even order , andIn the quadratic class . Its spatial scaling uses the Feigenbaum constants convention ; the values depend on the critical order. The central restrictive intervals are successively reduced by under renormalization. This fixed point describes the limiting shape of repeatedly renormalized maps at a period-doubling accumulation.
// Target: dynamical-systems.bigb
An approximate analytic fixed point of the period-doubling renormalization operator can be certified by a frozen Newton correction for a fixed-point equation. A coefficient Banach space, rigorous residual and derivative bounds, and an a posteriori contraction ball give existence and local uniqueness in the full function space. Interval arithmetic controls finite computations; analytic estimates control the infinite coefficient tail.
// Target: dynamical-systems.bigb
Suppose , with even and . Expanding the period-doubling renormalization operator exactly at zero gives . Approximating globally by gives and , hence . For , , and . The coefficient relation is a polynomial-truncation approximation, not an exact identity for the full analytic fixed point.
// Target: numerical-analysis.bigb
At the normalized quadratic fixed point , one expanding eigenvalue of and a contracting complement give a stable manifold of finite codimension one. A generic one-parameter family crosses that manifold transversely at its cascade accumulation. Its unstable coordinate is initially proportional to parameter distance and multiplies by per renormalization, yielding . Stable components disappear, while the fixed point's orientation-reversing scale yields signed spatial ratios .
// Target: dynamical-systems.bigb
For a real number , the beta transformation is the interval mapon . Each interval of continuity is expanding with slope .
The full tent map on the unit interval isIts two affine branches expand lengths by two, and it preserves Lebesgue measure.
For with , the largest closed interval mapped onto itself is . It equals the image of . Every point outside enters after one iterate, because . It subsequently remains in .
// Target: dynamical-systems.bigb
If , every nondegenerate subinterval of eventually maps onto . Away from the critical point, lengths multiply by ; one fold loses at most a factor of two. If an interval and its image both contain zero, its second image is . Otherwise every two steps increase length by at least , which cannot continue inside bounded . Applying the intermediate value theorem to an interval that covers itself then gives a periodic point in every subinterval.
// Target: dynamical-systems.bigb
For , the interval is invariant under the second iterate of the tent map. The affine coordinate conjugates that restriction to the tent map with parameter . Its two linear pieces give the identity directly. This turns the two-iterate horseshoe threshold into a four-iterate threshold and explains why chaotic invariant sets need not have periodic points near the original nonzero fixed point.
For , set and . The tent map sends to , with disjoint interiors, and . Directly,Successive squaring eventually brings every into . A horseshoe for an interval map of an iterate in the renormalized coordinate lifts to a horseshoe of an iterate of the original map.
// Target: dynamical-systems.bigb
Given a finite measurable partition of an interval, the itinerary of records which partition element contains each iterate . Prescribing a finite initial word defines an itinerary cylinder. For the full tent map, every length- binary cylinder has Lebesgue measure up to endpoint conventions, so its itinerary process is a fair i.i.d. Bernoulli process.
An itinerary cylinder is the set of points whose first finitely many itinerary symbols equal a prescribed finite word. Such cylinders generate the symbolic σ-algebra and pull back to finite intersections of inverse images of partition elements.
The logistic map repeatedly applies a quadratic function:The closed interval is a positively invariant set: . An orbit is the entire resulting sequence , not just one application of the formula. For example, with and , the first states are , approaching the fixed point .
As a simple model of population dynamics, is a scaled abundance in generation . When abundance is small, is close to ; increasing abundance reduces this per-capita multiplier. The falling side of the quadratic function represents sufficiently severe crowding reducing the next generation. The scale is not generally the carrying capacity: the positive fixed point is . The logistic map is a discrete-generation model; the continuous-time logistic growth equation has a different evolution rule and does not produce its period-doubling cascade.
The practical question is how abundance behaves after the initial adjustment: does it settle, alternate, or continue varying? The same formula permits all these possibilities. The following figure shows three orbits, their cobweb plots, and a bifurcation diagram. In a cobweb plot, moving vertically to calculates the next state, and moving horizontally to makes that value the input for the next step.
The fixed points solve :The second fixed point is in for and coincides with zero at . The derivative is , so the fixed-point multipliers are at zero and at . The fixed point stability for an iteration test gives an attracting zero for , and a locally asymptotically stable positive fixed point for . A multiplier of modulus one needs a nonlinear argument; the strict derivative test alone settles neither nor .
This derivative test has a direct interpretation. A small error obeysAt , the leading multiplier is : the error changes sign, explaining the alternating approach, while its magnitude eventually shrinks by approximately a factor per step. At , the multiplier is , and the positive fixed point repels nearby states. However, a different outcome has asymptotic stability: the logistic map two-cycle attracts nearby orbits.
For , the attracting period-two orbit has the two valuesAt they are approximately and , with and . Their periodic-orbit multiplier is , so a small displacement shrinks over two steps even though the fixed point is unstable. The brief algebraic justification is to factor , remove the fixed point factors, and multiply the two derivatives using the chain rule.
At , the positive fixed-point multiplier passes through and a period-doubling bifurcation creates the period-two orbit. At , its periodic-orbit multiplier passes through and an attracting period-four periodic orbit emerges. At , the period-four values are approximately in that order. Further period-doubling bifurcations accumulate near . Beyond that value there are also parameter windows with attracting periodic orbits, including a period-three window near . Neither a crowded numerical plot nor a parameter beyond the accumulation value proves sensitive dependence on initial conditions on the attracting set.
The endpoint supplies an analytically transparent example. The homeomorphism satisfieswhere is the full tent map. Thus these maps have topological conjugacy; stretching and folding in the tent map explain sensitive dependence on initial conditions and Devaney chaos for on . This does not make every individual orbit nonperiodic: stays fixed, and follows . Sensitivity means that these exceptional orbits also have arbitrarily close initial states that eventually depart substantially.
Robert M. May's "Simple mathematical models with very complicated dynamics" (1976), Nature 261, pp. 459–467, reviewed how simple deterministic recurrence relations can pass from stable abundances through period-doubling cascades to irregular behaviour. May presented the logistic map as an especially accessible example and discussed the relevance of such models to population dynamics. The paper explicitly describes itself as a review of results found by several researchers, bringing their findings together for a broad scientific audience.[ref]
For the real logistic map with , let be its two inverse branches from to the disjoint subintervals on which . With the homeomorphism , these becomeDirect differentiation givessince . Thus length- itinerary cylinders have angular diameter at most , and ordinary diameter at most because . The nested interval theorem then gives exactly one point for each infinite itinerary. This proves the coding by the one-sided full shift even when the ordinary-coordinate inverse branches are not contractions.
For the logistic map , factor and remove its two fixed points. The remaining quadratic equation is . Its distinct roots form a periodic orbit of period two when . The periodic-orbit multiplier is , so this orbit is asymptotically stable for . It is born at a period-doubling bifurcation at .
A point is periodic for an interval map when for some positive integer . Its least such is its period, and the finite setis its periodic orbit.
For an interval map, this is the usual periodic point condition. Its least positive return time is the period.
For closed intervals and , write under when . The intermediate value theorem implies that there is a closed subinterval with .
For a continuous function from an interval to itself with a three-cycle , reflection if needed gives . Set . The intermediate value theorem gives and . Successive closed-interval pullbacks realize every cyclic covering word by a point fixed under the corresponding iterate. The word has a unique visit to the interior of per cycle, forcing least period ; the only boundary ambiguity is the original three-cycle, which realizes and cannot realize any other such word. A covering of by itself also gives a fixed point. Thus every positive least period occurs.
The covering words and both occur under the interval coverings in period three implies all periods. Their points cannot be the boundary three-cycle. Each has least period five, because five is prime and each itinerary visits both intervals. Their respective one and two visits to the interior of distinguish the orbits even after cyclic changes of starting point.
Every closed walkin a directed covering graph of an interval map has a point with and . This follows by successively pulling back through the covering relations and applying the fixed-point property of a closed interval. If the itinerary has least period and avoids shared endpoints, lies on an -cycle.
If is the adjacency matrix of a directed covering graph, then counts its pointed closed walks of length . For a prime number , subtracting the constant walks and identifying the cyclic choices of starting point givesprimitive closed itineraries of length .
For cycle points ordered , successive gap vertices have arrows , , , . Their transition-matrix traces through length four are , forcing periods one, two and four but not three. The affine interpolation through ordered values has no three-cycle: its only length-three closed interval itinerary is , on which the map is and its third iterate has only its fixed point. Two distinct length-four return words at vertex one give a horseshoe for the fourth iterate.
A five-cycle whose points are in orbit order along the real line gives four interval vertices with arrows and . The transition-matrix traces for lengths one through four are . Primitive closed words force at least one fixed point, one two-cycle, two three-cycles and three four-cycles. The second iterate has a two-branch horseshoe for an interval map on vertices two and three. The map itself need not have a one-step horseshoe: the unimodal affine example for , for has precisely this five-cycle and has no two disjoint self-covering branches.
For prescribed values at ordered points , the connect-the-dots interval map is the unique piecewise linear function obtained by linear interpolation between consecutive data points.
The Jury criterion tests whether every root of a real discrete-time characteristic polynomial lies strictly inside the unit circle. For , this is equivalent to , , and .
For a period- orbit of a differentiable map, the multiplier isThe orbit is locally asymptotically stable when the modulus of this product is less than one.
A period-doubling bifurcation occurs when a fixed-point multiplier crosses and a nearby period-two orbit is created. Under the generic nondegeneracy conditions, the orbit amplitude is proportional to the square root of the parameter displacement.
A period-doubling cascade is a succession of period-doubling bifurcations creating attracting periods , with bifurcation parameters tending to an accumulation value. Superstable periodic orbits inside successive stability intervals give a second parameter sequence with the same limiting parameter-scaling ratio in a quadratic universality class.
// Target: dynamical-systems.bigb
For a generic quadratic period-doubling cascade, the Feigenbaum constants are the limiting parameter ratio and spatial ratio . With the successive superstable period- parameters and the signed central-orbit spacing,The positive convention gives and . The orientation-reversing spatial scale at the Feigenbaum renormalization fixed point is .
// Target: dynamical-systems.bigb
A generalized flip is a codimension-two period-doubling point with a simple multiplier , a vanishing cubic coefficient in its scalar centre-manifold map, and a nonzero quintic coefficient. In the odd normal form , symmetric two-cycles solve . The discriminant of this quadratic in produces a fold of two-cycles where its positive roots collide. For , , this fold is , , . At the amplitude is proportional to .
For near , write . Then . The small two-cycle is attracting on if and repelling on if . Vanishing of gives a degenerate flip requiring higher terms.
For a real map , the second iterate isIf , sufficiently small nonzero retains its sign under and strictly decreases in absolute value. Its iterates therefore converge to zero, proving local asymptotic stability even though . If , the second iterate moves small positive points away from zero, proving instability. The zero-coefficient case requires higher-order terms. With strictly stable transverse directions, the centre manifold theorem for a discrete dynamical system applies this scalar test to a higher-dimensional discrete dynamical system.
Articles by others on the same topic
There are currently no matching articles.
