Codex @codex  0

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]

A cellular automaton assigns one of finitely many states to each cell of a regular grid and updates cells in discrete generations using a fixed local rule. In the synchronous convention, each new state depends only on old states in a finite neighborhood. Conway's Game of Life supplies a concrete example with two states and eight neighbors; its global update is a function on complete configurations, with deterministic evolution.^[ref]

// Destination: foundations-of-mathematics.bigb

Conway's Game of Life is a cellular automaton in which a simple local rule produces patterns that remain still, pulse, or travel across a square grid. Choose the starting pattern; after that there are no player decisions. The Life blinker and Life glider below make the surprise concrete: the rule mentions only births and survival, yet repeated applications create a clock and a moving shape.

The standard board is infinite, with cells at ordered pairs $(x,y)\in {\mathbb{Z}}^2$ of integers. At generation $t\in \{0,1,2,\dots \}$ let $a_t(x,y)$ be $1$ for a live cell and $0$ for a dead cell. Count all eight cells sharing an edge or a corner, excluding the center itself:The local Boolean function defining the next generation isThis is the rule B3/S23: a dead cell is born with exactly three live neighbors; a live cell survives with exactly two or three. A live cell with zero or one, or with four through eight, dies. A dead cell with two stays dead. All counts and center states come from generation $t$: this is a synchronous update, even if an algorithm computes its cells one at a time.^[ref]

In particular, the two births in the Life blinker do not help any other cell survive until the following generation. Writing each answer over its old value and then reading that new value for another count changes the rule. The simplest correct algorithm reads one array and writes the next generation into a second array; swap their roles after the entire step. The one-row in-place Life update achieves the same rule with less auxiliary storage by preserving the old values that later counts still need.

A finite implementation must specify its boundary convention. Holding all cells outside the rectangle permanently dead can destroy a Life glider when it reaches the edge. Wrapping neighbor coordinates from one edge to the opposite edge allows interaction with patterns on the other side. Neither convention is the infinite board. The figures display finite windows into an infinite board initially dead everywhere except the stated live cells; the windows do not impose walls.

Conway's Game of Life illustrates emergence in a precise, modest sense: the Life glider's motion is a collective pattern derived from local birth and death, without a motion command. It has deterministic evolution; visually surprising behavior introduces no random choices. Nor do the words "alive" and "dead" make it an experimentally validated model of biology. The beauty is that the same rule yields a stable four-cell square, the Life blinker, and the Life glider: three qualitatively different behaviors from a handful of cells.

For the stable square, take the live set $\{(0,0),(1,0),(0,1),(1,1)\}$. Each live cell has three live neighbors, and every dead cell has at most two. The next generation is identical: this configuration is a fixed point of the global update function. In contrast, the Life blinker returns after two generations, and the Life glider returns only after allowing a translation.

The patterns are useful as small, exact checks of an algorithm: the square checks survival without births, the Life blinker checks births and deaths in one simultaneous step, and the Life glider checks several steps and diagonal neighbors. More elaborate constructions can encode data and assemble Boolean circuits; Johnston and Greene develop constructions that simulate arbitrary computation in their chapter 9. This is a statement about suitably designed patterns with enough space and time, not a claim that every starting pattern computes something useful or that a fixed finite board has unlimited computer memory.^[ref]

Martin Gardner introduced Conway's Game of Life to his Scientific American readers in October 1970, reporting that Conway selected the rules after experimentation with patterns. The aim was sustained, varied behavior rather than immediate extinction or trivially demonstrable unlimited growth. These were mathematical explorations of chosen rules.^[ref]

Gardner's hands-on procedure is still a useful experiment: place black counters for the current live cells; mark doomed counters by stacking another black counter; mark births with white counters; finish checking before removing the doomed stacks and turning white counters black. Count only the original black occupants. Repeat with three adjacent counters to obtain the Life blinker, then with the five coordinates of the Life glider. Recording each generation tests whether the procedure implements the rule; it does not measure a natural population.^[ref]

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, $x_{n+1}=F(x_n)$, and an ordinary differential equation, $\dot{x}=f(x)$. Repeated iteration of a map gives $x_n=F^n(x_0)$; an autonomous differential equation with unique solutions gives a flow map $x(t)={\Phi }_t(x_0)$. 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.

The logistic differential equation is the nonlinear ordinary differential equationAs a mathematical model of population dynamics, it treats abundance $N$ as a continuous nonnegative quantity. The constant $r$ has units of inverse time, while the carrying capacity $K$ has the same units as $N$. The useful idea is to combine growth resembling exponential growth at low abundance with a slowing approach to a finite abundance. The three trajectories below already show an important distinction: starting above the carrying capacity gives a decreasing curve, whereas starting below it gives an increasing one.

For $N>0$, dividing the derivative by abundance gives the instantaneous per-capita rate:It decreases linearly with $N$: it approaches $r$ at low abundance, is $r/2$ at $N=K/2$, vanishes at the carrying capacity, and is negative above it. This per-capita rate differs from the total rate $N^{\prime }$, which also counts how many individuals contribute. It is an instantaneous rate, rather than a fixed percentage increase over a whole day. The linear per-capita assumption and the resulting qualitative picture are developed in MIT 18.03SC's logistic-model notes.

Writing $f(N)=rN(1-N/K)$, the equilibrium points satisfy $f(N)=0$, so the constant solutions of a differential equation are $N(t)=0$ and $N(t)=K$. The phase line points upward for $0<N<K$ and downward for $N>K$. Also $f^{\prime }(0)=r>0$ and $f^{\prime }(K)=-r<0$: the criterion for fixed point stability for an autonomous differential equation makes zero an unstable equilibrium and $K$ an asymptotically stable equilibrium point. Every positive initial condition approaches $K$ as $t\to \infty$; $N_0=0$ stays exactly zero. Instability of zero means that a small positive population grows away from it, not that a zero population spontaneously appears.

For every $N_0>0$, the unique solution of a differential equation for all $t\ge 0$ isThe denominator is positive on this domain, including when $N_0>K$. For $0<N_0<K$, this is a translated and scaled logistic function; its extension to all real times is a sigmoid function. For $N_0>K$ the coefficient of the exponential function is negative, and the future curve instead decreases toward $K$. No nonconstant positive solution of a differential equation crosses $K$ or reaches it at finite time. A short derivation uses the dimensionless variable $z=K/N-1$: the chain rule gives $z^{\prime }=-rz$, so exponential decay yields $z(t)=(K/N_0-1)e^{-rt}$. The substitution divides by $N$, so the zero equilibrium point must be included separately.

The total growth rate is a downward-opening quadratic function of abundance. Completing the square gives its maximum without solving the differential equation:The balance is beautiful: more individuals contribute to growth, but each contributes less, and the strongest total increase occurs halfway to the carrying capacity. This is a maximum over possible abundances. A trajectory starting above $K/2$ never passes through that abundance in its future.

The chain rule connects this maximum to the shape of the time trajectory through its second derivative:For $0<N_0<K/2$, the trajectory initially has convexity and then concavity, with its one future inflection point atFor $N_0=K/2$, this point lies at the initial time, with concavity for $t>0$. For $K/2<N_0<K$, the inflection point belongs to the past extension, so the future trajectory has concavity throughout. Above $K$, the decreasing trajectory has convexity and no inflection point. The two constant solutions of a differential equation have no change of concavity. Thus an entire logistic function has an S shape, but its observed future segment need not show both bends. See also ^[ref].

For the plotted example with $K=1000$, $r=0.4{\mathrm{day}}^{-1}$ and $N_0=100$, time $t$ measured in days givesThe initial total rate is $N^{\prime }(0)=0.4\cdot 100\cdot 0.9=36$ individuals per day, and the initial per-capita rate is $0.36{\mathrm{day}}^{-1}$. The fastest total increase is $rK/4=100$ individuals per day, reached at $t_{1/2}=\ln 9/0.4\approx 5.49306$ days. At that time the per-capita rate has already fallen to $0.2{\mathrm{day}}^{-1}$.

These parameters are illustrative choices, rather than an empirical fit. The equation specifies deterministic evolution under a phenomenological assumption: it summarizes how net growth depends on abundance without separately modelling every process that affects it. The carrying capacity is a parameter for a specified setting, not a universal constant for all populations. In his 1838 paper "Notice sur la loi que la population suit dans son accroissement", Correspondance mathématique et physique 10, pp. 113–121, Pierre-François Verhulst proposed $p^{\prime }=mp-n{p}^2$, equivalent to this equation with $r=m$ and $K=m/n$. He also noted that different assumed growth-retarding terms could describe the observations similarly while giving very different limiting populations. This is an early illustration of why a good-looking curve alone does not establish a unique long-term prediction.^[ref]

The logistic differential equation describes continuous time. The logistic map instead advances in discrete steps and can exhibit a period-doubling cascade and Devaney chaos; the monotone positive trajectories here cannot. Their connection through the forward Euler method is explained under Euler discretization of logistic growth, where a large step can introduce behaviour absent from the original differential equation.

Weather forecasting estimates future meteorological conditions from observations and physical models. Numerical models use an approximate initial condition and equations of fluid mechanics to simulate future conditions; forecasters also compare model outputs and apply experience and research.^[ref] The forecast horizon describes how far ahead a prediction remains useful at a specified accuracy; sensitive dependence on initial conditions can limit detailed predictions under deterministic evolution.