Attractor Created 2026-10-24 Updated 2026-11-05
An attractor is an invariant set approached by nearby trajectories of a dynamical system. A useful precise convention is a compact invariant set that is Lyapunov stable and attracts some open neighborhood: starting sufficiently close keeps the trajectory close for all future times, and the distance to the set tends to zero. Definitions differ over the stability, uniformity and minimality conditions, so those conditions should be stated when they affect an argument.
For the discrete dynamical system on , the fixed point zero is an attractor. If , then ; if is small, every later value is at least as small. Its basin of attraction is exactly . The other fixed point, one, is invariant but repelling: its derivative is two, and arbitrarily close starting values can move away.
An attracting limit cycle is an attractor consisting of a whole repeating orbit. A trajectory can approach that set while continuing to move around it, so attraction to a set does not mean convergence to one stationary point. A strange attractor can have more complicated geometry; attracting nearby trajectories alone does not imply chaos.
Deterministic evolution Created 2026-10-14 Updated 2026-10-20
Evolution is deterministic when a specified initial condition and evolution rule select a unique future orbit. For a discrete dynamical system, applying the same map to the same state gives the same next state. For an ordinary differential equation, uniqueness of the initial value problem is required; merely writing a differential equation does not guarantee it.
Determinism permits both asymptotic stability and sensitive dependence on initial conditions. It does not by itself imply reliable prediction from approximate measurements, and sensitivity does not introduce a random choice into the evolution rule.
Discrete dynamical system Created 2026-09-24 Updated 2026-11-05
A discrete dynamical system specifies a phase space and a map . An initial state determines its forward orbit byThe phase space may be an interval, a plane, a manifold or another suitable set; one-dimensional iteration is one special case. A two-sided orbit additionally needs backward states, which are uniquely determined when is invertible.
A fixed point obeys . A point of least period obeys with no smaller positive return time; its orbit is a periodic orbit. For example, on the real line gives , converging to the attracting fixed point zero. An irrational circle rotation instead gives aperiodic orbits; discrete time alone does not imply chaos.
Dyadic transformation Created 2026-10-14 Updated 2026-11-05
The doubling map is the discrete dynamical systemon the unit circle represented by . In a binary expansion, it shifts the digits one place to the left. This makes a small uncertainty in later digits become a large uncertainty after sufficiently many iterates.
Its Devaney chaos can be checked directly. The periodic points of the doubling map are the grids ; their mesh tends to zero, giving dense periodic points. Every nonempty open arc contains an interval for large enough . Its image under covers the unit circle, proving topological mixing and hence topological transitivity. Finally, for any initial point and arbitrarily large , choose modulo one. Their initial circle metric distance tends to zero, while the distance between and is . This proves sensitive dependence on initial conditions with a fixed separation threshold smaller than .
Dynamical systems Created 2026-09-24 Updated 2026-10-13
The study of dynamical systems asks how a state changes in time: which states persist, which orbits repeat, and how a small perturbation changes the future. A dynamical system combines a state space with an evolution rule. For a seasonal population, the state might be its abundance and one step one generation; for a harmonic oscillator, a state vector includes both position and velocity. Choosing a sufficient state is essential: position alone does not determine where an oscillator moves next.
The two basic descriptions are a discrete dynamical system, , and an ordinary differential equation, . Repeated iteration of a map gives ; an autonomous differential equation with unique solutions gives a flow map . In either case, evolving for two successive durations agrees with evolving for their sum. The logistic map provides a particularly simple discrete dynamical system; the Lorenz system supplies a continuous-time example with a very different geometry.
Deterministic evolution says that the exact rule and exact initial condition specify one future. Predicting that future from measurements is a separate question. An instrument supplies a range of possible initial conditions, and a computation adds small errors. Near an asymptotically stable fixed point, nearby orbits converge and the long-term state can become easier to predict. With sensitive dependence on initial conditions, arbitrarily close starting states can eventually lead to a visible disagreement, even though each follows the same rule.
Much of the usefulness of dynamical systems comes from describing outcomes without writing every solution explicitly. Fixed points identify possible resting states; periodic orbits identify repeating behaviour; stability theory asks whether those behaviours survive small disturbances. A bifurcation diagram shows how changing a bifurcation parameter changes the possible outcomes. This is useful in population dynamics, where a stable abundance and an alternating abundance have different consequences, and in thermal convection, where a steady flow and a changing flow transport heat differently.
The beauty of the subject is that a small formula can organize a large variety of behaviour. The logistic map moves from an attracting fixed point to attracting periodic orbits and then to parameter values supporting sensitive motion. Its period-doubling cascade has a recognizable structure across many unimodal maps. Nevertheless, Devaney chaos, Glendinning chaos, and a positive Lyapunov exponent express different properties; a claim of chaos should specify its definition, its state space, and the parameter values under consideration.
Forecast horizon 2026-10-14
A forecast horizon is the duration over which a prediction meets a specified error tolerance. If an initial uncertainty grows approximately as with positive Lyapunov exponent , then solving for when it reaches a tolerance gives the displayed estimate. Here is the natural logarithm and is measured per step of the discrete dynamical system; for a flow map, use the exponent per unit time instead. The estimate assumes the growth approximation remains valid up to the chosen tolerance and excludes additional model errors.
Reducing by a factor ten buys approximately more steps, rather than multiplying the forecast duration by ten. For typical logistic map orbits at , , so one extra decimal digit buys roughly steps in this approximation. Better measurements help, but their benefit is logarithmic. A forecast of a probability distribution or a stable long-term average asks a different question from predicting each individual state.
Forward-invariant set Created 2026-10-31 Updated 2026-11-05
A forward-invariant set is a subset of a state space that contains every future state of each trajectory starting in it. For a discrete dynamical system with update map , the condition isMathematical induction then gives for every nonnegative integer . For a flow map, the analogous condition is for every forward time for which the solution exists.
Forward invariance does not require equality or backward invariance. For , the interval is forward invariant because , but the inverse image of one is two, outside . By contrast, the singleton is invariant in both directions.
This is useful before an exact solution is available. A forward-invariant positive interval prevents a population model from generating negative states and supplies an upper bound for all later iterates. The positive invariant interval for a cubic biological population map derives such a region by direct inequalities. Being bounded in a forward-invariant set does not alone imply convergence to one equilibrium point.
Forward orbit Created 2026-10-20 Updated 2026-11-05
The forward orbit of a state is the collection of states reached as time advances. For a discrete dynamical system ,For a flow map , the analogous set is over the times for which the solution exists. The initial state is included; its future accumulation points instead form the omega-limit set.
For example, with gives . Zero is approached but is not one of those iterates, so the forward orbit differs from its closure. Forward evolution also need not determine a unique past: sends both and to . The distinction matters when discussing attraction or invariance for a map that cannot be inverted.
Interval map Created 2026-09-24 Updated 2026-09-29
An interval map is a continuous function from a real interval to itself. Its iterates form a one-dimensional discrete dynamical system.
Lyapunov exponent Created 2026-10-14 Updated 2026-11-05
A Lyapunov exponent is the asymptotic exponential growth rate of an infinitesimal tangent displacement along a dynamical system. For a differentiable flow map, a starting point and a nonzero tangent vector , one convention iswhen the limit exists. A discrete dynamical system uses the derivative of the th iterate and divides by instead. The rate can depend on the point and the direction.
For the linear ordinary differential equation , an eigenvector with real eigenvalue evolves as , so its exponent is . Nonreal eigenvalues contribute their real parts to the growth rate. A polynomial factor from a Jordan block does not change the exponent because .
In a smooth velocity field, the tangent displacement obeys . Its instantaneous stretching rate depends on both the current Jacobian matrix and the current direction. Those can change along the trajectory, so averaging instantaneous largest eigenvalues need not give the actual largest Lyapunov exponent.
The infinitesimal qualification matters. Two trajectories at a fixed finite separation cannot grow apart exponentially forever inside a bounded region: their distance is bounded by the region's diameter. A positive tangent exponent instead concerns the derivative obtained by sending the initial perturbation to zero first. Finite errors follow the linear prediction only until they become large enough that nonlinear effects matter. Likewise, growth rates of moments of a random separation need not equal the exponent along a typical trajectory.
The Jacobian matrix at the extinction fixed point iswith characteristic polynomialUnder , , whereas as . Hence its positive eigenvalueis greater than one. Its eigenvector can be taken with both components positive: choose . Thus there are biologically admissible positive perturbations that grow. The extinction fixed point is unstable by linear stability analysis for a discrete dynamical system.
The Jacobian matrix of the update map isIts eigenvalues are and zero. The extinction equilibrium is locally asymptotically stable for and unstable for , by linear stability analysis for a discrete dynamical system. In the latter case, even a small perturbation along grows as .
At , an eigenvalue equals one, so the strict linear criterion does not decide stability. Directly, and . Starting sufficiently close to extinction therefore keeps both coordinates close for all time, proving Lyapunov stability in the nonnegative state space. It is not asymptotically stable, since every nearby is another equilibrium. This distinction makes the statement “stable when fails” precise.
Past exam of the mathematics course of the University of Cambridge 2007 ia Paper 2 2B ii Solution Created 2026-09-24 Updated 2026-10-14
The constant solutions are fixed points of . Solving gives , hence . For a discrete dynamical system, a small perturbation satisfies , whereA multiplier of magnitude less than one contracts perturbations; a multiplier greater than one expands them. Therefore is asymptotically stable, while and are unstable. In particular, if , then , proving convergence to zero without relying solely on the vanishing linear multiplier.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 85 2 a Solution Created 2026-10-03 Updated 2026-10-14
The associated even map is simply . For nonzero , the odd quadratic Lorenz map has the two branches on the positive side and on the negative side. Their limiting values at zero are and , while the prescribed point value is . Thus the branches join continuously only at , where the origin is a fixed point and .
The small fixed point of isFor small negative , and the odd quadratic Lorenz map has two stable fixed points . Their periodic-orbit multiplier is . As these fixed points collide at zero. For small positive , andso a stable symmetric two-cycle is present, with periodic-orbit multiplier . Hence the global transition isThe large fixed points remain unstable near this transition and are not created or destroyed there. The parabola itself is smooth as passes zero; its fixed point crosses the critical point and changes the sign of its periodic-orbit multiplier. The change of orbit type occurs in the sign-lifted discrete dynamical system, whose discontinuity switches orientation.
Positive invariant interval for a cubic biological population map Created 2026-10-31 Updated 2026-11-05
For the discrete dynamical system withevery positive starting value satisfying has positive later iterates. The useful invariant interval is .
First, for every ,because the quadratic has positive leading coefficient and discriminant . Thus a positive first image lies below .
Second, on the cubic product can be negative only for . On that interval its magnitude is at most , so throughout . Together the bounds give . Mathematical induction then keeps all later values in that positive bounded interval.
The hypothesis on the first image is necessary: a positive starting population outside the invariant region need not have a positive image. The interval argument supplies positivity and boundedness; it does not by itself classify the eventual orbit.
Quadratic-map conjugacy to the full tent map 2026-10-31
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.
Real quadratic iteration map 2026-10-31
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.
Recurrent point Created 2026-10-14 Updated 2026-11-05
A recurrent point of a discrete dynamical system returns arbitrarily close to its starting state at arbitrarily late positive times. In a metric space, this means that there is a strictly increasing sequence withEquivalently, every neighborhood of contains for arbitrarily large . A finite early return near the point does not suffice.
Every periodic point is recurrent: if , take . An irrational rotation of the circle gives recurrent points that are not periodic. For with irrational , the pigeonhole principle applied to modulo one supplies an integer with distance from to an integer at most . These approximating must be unbounded, since no fixed positive multiple of an irrational number is an integer. An increasing subsequence therefore gives the required returns for every starting angle.
Recurrence concerns returning close, whereas convergence to an attracting equilibrium point need not give recurrence of any other starting state. The map has zero as a recurrent point, but a nonzero converges to zero rather than back to itself.
Repulsion in a dynamical system Created 2026-10-31 Updated 2026-11-05
Repulsion in a dynamical system describes nearby trajectories moving away from an invariant state or set in forward time. For a scalar discrete dynamical system, a fixed-point multiplier with modulus greater than one gives local repulsion.
Second-order difference equation Created 2026-10-05 Updated 2026-11-05
A second-order difference equation determines the next member of a sequence from its two preceding values, for example . Two initial values are generally needed. Although the state is written with one scalar sequence, the update becomes a first-order discrete dynamical system on pairs:
