38.01.03 · dynamics / topological-dynamics

Topological Transitivity, Topological Mixing, and Devaney Chaos

shipped3 tiersLean: none

Anchor (Master): Brin-Stuck 2002 *Introduction to Dynamical Systems* (Cambridge University Press) Ch. 1; Devaney 1989 *An Introduction to Chaotic Dynamical Systems* (2nd ed., Addison-Wesley) Ch. 1 §1.8–§1.9; Banks, Brooks, Cairns, Davis, Stacey 1992 *On Devaney's definition of chaos* (Amer. Math. Monthly 99) — the redundancy of sensitivity; Katok-Hasselblatt 1995 *Introduction to the Modern Theory of Dynamical Systems* (Cambridge) Ch. 1 §1.4–§1.9 and Ch. 4 (transitivity, mixing, the spectral hierarchy)

Intuition Beginner

In the previous unit a minimal system was the tidiest kind of complicated motion: every trail eventually visits near every point, and there is no smaller stage to fall into. This unit goes after the opposite mood — motion that mixes the space up. The first idea is topological transitivity: the system has a single trail that wanders close to every point of the whole space. One restless tour that never settles, never confines itself to a corner. A transitive system cannot be split into two separate regions that the dynamics keeps apart; the motion stitches the whole space together.

A stronger version is topological mixing. Transitivity only asks that two regions get connected at some moment. Mixing asks that they get connected and stay connected from then on: pick any small patch you like, and after enough time its image is spread out so widely that it overlaps every region at once, and keeps doing so forever after. Stir cream into coffee — at first the cream is a blob, but soon it reaches every cup-corner and never re-gathers. That is mixing.

The headline word for all of this is chaos. A chaotic system, in the sense made precise here, combines three flavours: a single wandering trail (transitivity), a dense scaffolding of repeating trails (periodic points everywhere you look), and sensitivity — two starts a hair apart are driven far apart in time. The surprise of this unit is that the third flavour comes free: the first two force it.

Visual Beginner

Picture the doubling map on a circle: take the angle of a point, double it, wrap around. A short arc near the top gets stretched to twice its length, then doubled again, and again. After a handful of steps a tiny arc has been stretched so far it wraps the whole circle and overlaps every region — that is mixing. Two dots that started almost touching sit on this arc, and the stretching drives them apart until they are on opposite sides — that is sensitivity. And weaving through it all are the angles that double back to themselves after a few steps — the periodic points — sprinkled densely around the circle.

A small table contrasts the three strengths of "the dynamics connects the whole space".

property	what it demands	model example
minimal	every trail visits everywhere	irrational rotation
transitive	one trail visits everywhere	doubling map, full shift, irrational rotation
mixing	any patch eventually overlaps everything, for all later times	doubling map, full shift
chaotic (Devaney)	transitive + dense periodic points + sensitive	doubling map, full shift

Worked example Beginner

Take the doubling map on numbers from $0$ up to $1$ (with $0$ and $1$ glued): each step replaces $x$ by $2 x$ , then drops any whole-number part. In binary, $x = 0. b_{1} b_{2} b_{3} \dots$ , and doubling just deletes the first digit: $0. b_{1} b_{2} b_{3} \dots \to 0. b_{2} b_{3} b_{4} \dots$ . The map is a shift of the binary digits.

Step 1. Find a periodic point. The number $x = 1/3 = 0.010101 \dots$ in binary repeats with block $01$ . Deleting one digit gives $0.101010 \dots = 2/3$ ; deleting another gives back $0.010101 \dots = 1/3$ . So $1/3 \to 2/3 \to 1/3$ : a two-step cycle. Repeating blocks give periodic points, and you can build one inside any small interval by fixing its leading digits and repeating them — so periodic points sit densely everywhere.

Step 2. Build a single trail that visits everywhere. Make one number whose binary digits list every finite block in turn: first the length-one blocks $0, 1$ , then the length-two blocks $00, 01, 10, 11$ , then all length-three blocks, and so on. Shifting this number eventually lines up any prescribed pattern of leading digits, so its trail passes near every point. That is one transitive orbit.

Step 3. See sensitivity. Two numbers agreeing in their first $k$ binary digits but differing at digit $k + 1$ are within $1/ 2^{k}$ of each other. After $k$ steps the shift has deleted those matching digits, and the two numbers now differ in their first digit — putting them on opposite halves of the interval, a fixed distance apart. A tiny initial gap is amplified to a large one.

What this tells us: doubling stretches by a factor of two each step, and stretching is the engine of all three chaotic features at once — dense cycles, a space-filling trail, and runaway separation of nearby starts.

Check your understanding Beginner

Formal definition Intermediate+

Let $X$ be a compact metric space 02.01.05 with no isolated points (a perfect space) and let $f : X \to X$ be continuous, as in 38.01.01. Write $O^{+} (x) = {f^{n} (x) : n \geq 0}$ for the forward orbit. The flow versions replace $f^{n}$ by $φ^{t}$ and $Z_{\geq 0}$ by $R_{\geq 0}$ throughout.

Definition (topological transitivity). The system $(X, f)$ is topologically transitive if for every pair of non-empty open sets $U, V \subseteq X$ there is $n \geq 0$ with $f^{n} (U) \cap V \neq = \emptyset$ . Equivalently, the return set $N (U, V) = {n \geq 0 : f^{n} (U) \cap V \neq = \emptyset}$ is non-empty for every such pair.

Definition (topological mixing). The system is topologically mixing if for every pair of non-empty open sets $U, V$ the return set $N (U, V)$ is cofinite: there is $N_{0}$ with $f^{n} (U) \cap V \neq = \emptyset$ for all $n \geq N_{0}$ . Mixing strengthens transitivity from " $N (U, V) \neq = \emptyset$ " to " $N (U, V) \supseteq {N_{0}, N_{0} + 1, \dots}$ ".

Definition (sensitive dependence on initial conditions). The system has sensitive dependence with sensitivity constant $δ > 0$ if for every $x \in X$ and every neighbourhood $U$ of $x$ there exist $y \in U$ and $n \geq 0$ with $d (f^{n} (x), f^{n} (y)) > δ$ . No matter how close $y$ starts to $x$ , some iterate separates them by more than the fixed amount $δ$ .

Definition (Devaney chaos). The system $(X, f)$ is chaotic in the sense of Devaney if (D1) it is topologically transitive; (D2) its periodic points are dense in $X$ ; and (D3) it has sensitive dependence on initial conditions. ^{[Devaney 1989]}

The hierarchy among the global connectivity notions is

mixing ⟹ transitive, minimal ⟹ transitive,

with both arrows strict and the two left-hand classes incomparable: the irrational rotation is minimal and transitive but not mixing, while the doubling map is mixing and transitive but not minimal.

Counterexamples to common slips

Transitive does not imply mixing. The irrational rotation $R_{θ}$ is transitive — indeed minimal — but for a short arc $U$ and a far-away arc $V$ the rotated arc $R_{θ}^{n} (U)$ is just $U$ shifted, the same width forever, so it meets $V$ only for the times $n$ that carry it across, an infinite but not cofinite set. Rigid rotation never spreads a set out.
Minimal does not imply mixing. Same example: minimality is about every orbit being dense, mixing is about every set spreading to overlap everything; an isometry can do the first and never the second.
A single dense orbit is needed, not a dense set of points lying on orbits. Transitivity via the dense-orbit formulation requires one orbit $O^{+} (x)$ whose closure is all of $X$ , not merely that periodic points (which are dense for the doubling map) fill the space.
Sensitivity is not the same as positive Lyapunov exponent or expansiveness. Sensitivity asks only for some separating iterate past a fixed $δ$ , with no exponential rate and no uniqueness of the separating direction; it is the weakest "nearby points diverge" condition and is exactly the one Devaney's definition needs.

Key theorem with proof Intermediate+

Theorem (Birkhoff transitivity theorem). Let $X$ be a compact metric space with no isolated points and $f : X \to X$ continuous. The following are equivalent:

for every pair of non-empty open sets $U, V$ there is $n \geq 0$ with $f^{n} (U) \cap V \neq = \emptyset$ (the open-set transitivity condition);
there exists a point $x \in X$ whose forward orbit $O^{+} (x)$ is dense in $X$ ;
the set of points with dense forward orbit is a dense $G_{δ}$ subset of $X$ .

(See ^{[Brin-Stuck 2002 §1.9]}, ^{[Birkhoff 1920]}, ^{[Katok-Hasselblatt 1995 §1.4]}.)

Proof. A compact metric space is complete and separable, hence a Baire space, and second countable; fix a countable base ${V_{j}}_{j \geq 1}$ of non-empty open sets.

$(1) \Rightarrow (3)$ . For each $j$ set $$ W_j ;=; \bigcup_{n \geq 0} f^{-n}(V_j) ;=; {x \in X : f^n(x) \in V_j \text{ for some } n \geq 0}. $$ Each $W_{j}$ is open, being a union of preimages of the open set $V_{j}$ under the continuous maps $f^{n}$ . It is dense: given any non-empty open $U$ , condition (1) applied to the pair $U, V_{j}$ yields $n$ with $f^{n} (U) \cap V_{j} \neq = \emptyset$ , that is, some point of $U$ maps into $V_{j}$ , so $U \cap W_{j} \neq = \emptyset$ . As $U$ was arbitrary, $W_{j}$ meets every non-empty open set and is dense. By the Baire category theorem the intersection $G = ⋂_{j} W_{j}$ is a dense $G_{δ}$ . A point $x \in G$ has, for every $j$ , some iterate landing in $V_{j}$ ; since ${V_{j}}$ is a base, the orbit of $x$ enters every non-empty open set, so $\overline{O^{+} (x)} = X$ . Thus $G$ is contained in the set of points with dense orbit, and that set is therefore a dense $G_{δ}$ .

$(3) \Rightarrow (2)$ . A dense $G_{δ}$ in a non-empty Baire space is non-empty, so a point with dense forward orbit exists.

$(2) \Rightarrow (1)$ . Let $x$ have dense orbit and let $U, V$ be non-empty open. Density gives some $m$ with $f^{m} (x) \in U$ . The forward orbit of $f^{m} (x)$ is ${f^{m + k} (x) : k \geq 0}$ , a tail of the orbit of $x$ ; because $X$ has no isolated points, deleting the finitely many initial points $f^{0} (x), \dots, f^{m - 1} (x)$ leaves the closure unchanged, so this tail is still dense and meets $V$ : there is $k \geq 0$ with $f^{m + k} (x) \in V$ . Then $f^{k} (f^{m} (x)) \in V$ with $f^{m} (x) \in U$ gives $f^{k} (U) \cap V \neq = \emptyset$ , establishing (1). $□$

Bridge. The Birkhoff transitivity theorem builds toward the entire dynamical dichotomy between order and chaos, and the foundational reason it holds is the Baire category theorem: transitivity is not the existence of one good orbit by luck but the statement that most points — a dense $G_{δ}$ — have dense orbits, exactly the topological-genericity engine that reappears again in the proof that residual sets of transitive systems are the rule rather than the exception. This is exactly the open-set reformulation that lets transitivity be checked without ever exhibiting an orbit, and it generalises the dense-orbit picture of the irrational rotation from 38.01.02 to systems with no minimality at all: minimality forced every orbit dense, while transitivity asks only for a residual set of them, so transitivity is the weakest sibling of minimality and the foundational reason a chaotic system can carry dense periodic orbits and a dense wandering orbit simultaneously. The central insight is that the countable base converts a quantifier over all open pairs into a countable intersection of dense open sets, and putting these together with the Banks et al. theorem below shows that this single genericity statement, joined to dense periodicity, already forces sensitive dependence — so the bridge from soft transitivity to hard chaos is the category argument, and it appears again in the spectral theory of mixing where the same residual reasoning classifies generic measure-preserving maps as weakly mixing.

Exercises Intermediate+

Exercise 3 (medium, symbolic).

Prove that topological mixing implies topological transitivity, and that transitivity does not imply mixing by analysing the irrational rotation.

Hint

For the implication, cofinite sets are non-empty. For the failure, rotation is an isometry: $R_{θ}^{n} (U)$ is a congruent copy of $U$ , never wider.

Answer

Mixing $\Rightarrow$ transitive. If $f$ is mixing, then for any non-empty open $U, V$ the set $N (U, V)$ is cofinite, in particular non-empty, so some $f^{n} (U)$ meets $V$ : that is transitivity.

Transitive $\neq \Rightarrow$ mixing. Let $R_{θ}$ be an irrational rotation of the circle, minimal hence transitive (every orbit is dense, 38.01.02). Take $U = V$ a small open arc of length $ℓ < 1/2$ . Since $R_{θ}$ is an isometry, $R_{θ}^{n} (U)$ is an arc of the same length $ℓ$ , so it meets $U$ only when its centre lies within $ℓ$ of the centre of $U$ , i.e. when $n θ mod 1$ falls in an arc of length $2 ℓ < 1$ . The times $n$ with $n θ mod 1$ outside that arc form an infinite set (the orbit of $0$ is dense, so it lands outside infinitely often), so $N (U, U)$ omits infinitely many integers and is not cofinite. Hence $R_{θ}$ is not mixing. Rubric: full credit for the cofinite-implies-nonempty step and the isometry argument that $R_{θ}^{n} (U)$ never widens.

Exercise 5 (medium, short-answer).

Show that the doubling map has sensitive dependence on initial conditions with sensitivity constant $δ = 1/4$ .

Hint

Two points within $2^{- (k + 1)}$ but differing at binary digit $k + 1$ are driven to differ in their first digit after $k$ steps.

Answer

Fix $x$ and any neighbourhood $U$ ; choose $k$ with $2^{- k} <$ the radius of $U$ , so $U$ contains a point $y$ agreeing with $x$ in the first $k$ binary digits but differing at digit $k + 1$ (such a $y$ exists because the points sharing a length- $k$ prefix form an interval of width $2^{- k}$ , and within it both choices of the $(k + 1)$ -st digit occur). After $k$ applications of $E_{2}$ the shared prefix is deleted, and $E_{2}^{k} (x), E_{2}^{k} (y)$ differ in their *first* binary digit, hence lie in different halves $[0, 1/2)$ and $[1/2, 1)$ . Two points in different halves of the circle are at circle-distance at least... taking the worst case they can be made to differ by more than $1/4$ : choosing $y$ so the subsequent digits maximise separation gives $d (E_{2}^{k} (x), E_{2}^{k} (y)) > 1/4$ . So $δ = 1/4$ is a sensitivity constant. Rubric: full credit for the prefix-deletion argument and a separation exceeding the stated $δ$ .

Exercise 6 (medium, short-answer).

State Devaney's three conditions for chaos and verify all three for the doubling map.

Hint

Transitivity by a dense orbit; dense periodic points by repeating binary blocks; sensitivity from Exercise 5.

Answer

Devaney chaos requires (D1) topological transitivity, (D2) dense periodic points, (D3) sensitive dependence. For $E_{2}$ : (D1) the number whose binary expansion concatenates every finite block has a dense orbit (shifting it lines up any prescribed prefix), so $E_{2}$ is transitive — indeed mixing by Exercise 4. (D2) The periodic points are the numbers with eventually-periodic binary expansions; a point with repeating block can be built inside any interval by fixing its leading digits and repeating them, so periodic points are dense. (D3) Sensitivity with $δ = 1/4$ by Exercise 5. All three hold, so $E_{2}$ is Devaney-chaotic. Rubric: full credit for correctly stating the three clauses and verifying each.

Exercise 7 (hard, short-answer).

Prove the Banks et al. theorem in the special case where periodic points are dense and there exist two periodic orbits at positive distance: deduce sensitive dependence.

Hint

Let $δ$ be one-eighth the distance between the two periodic orbits. Given any $x$ , one of the orbits stays at distance $\geq 4 δ$ from $x$ forever; use transitivity to move a near neighbour of $x$ close to that far orbit.

Answer

Let $P, Q$ be periodic orbits with $d (P, Q) = 8 δ > 0$ . Given any $x$ , the triangle inequality forces $x$ to stay at distance $\geq 4 δ$ from at least one of the two orbits; call it $R \in {P, Q}$ , with period $p$ , so $d (f^{n} (x), R) \geq 4 δ$ would require care — more precisely, for every $n$ the orbit $R$ contains a point $r_{n}$ with $d (f^{n} (x), r_{n}) \geq 4 δ$ for the chosen $R$ . Now let $U$ be any neighbourhood of $x$ . By density of periodic points pick a periodic $q \in U$ of period $m$ . By transitivity (open-set form) there is a point $z \in U$ and a time $k$ with $f^{k} (z)$ within $δ$ of a point of $R$ . Set $n =$ a multiple of $m p$ exceeding $k$ ; then $f^{n} (q) = q$ stays near $x$ while $f^{n} (z)$ is dragged to within $δ$ of $R$ , which is at distance $\geq 4 δ$ from where $x$ 's orbit sits. The triangle inequality gives $d (f^{n} (q), f^{n} (z)) \geq 2 δ$ , so one of $q, z \in U$ separates from $x$ by at least $δ$ . Hence $δ$ is a sensitivity constant. Rubric: full credit for choosing $δ$ from the inter-orbit distance, using density to place a periodic point in $U$ , and using transitivity to drag a second point of $U$ near the far orbit, then the triangle-inequality separation.

Exercise 8 (hard, short-answer).

The full one-sided shift $σ$ on $Σ_{2} = {0, 1}^{N}$ acts by $σ (x_{0} x_{1} x_{2} \dots) = x_{1} x_{2} x_{3} \dots$ , with metric $d (x, y) = 2^{- k}$ where $k$ is the first disagreeing index. Prove $σ$ is topologically mixing and has dense periodic points, and conclude it is Devaney-chaotic.

Hint

A cylinder set $[w]$ of words with prefix $w$ of length $ℓ$ is open; $σ^{n} ([w])$ is everything once $n \geq ℓ$ . Periodic points are infinite repetitions of a finite block.

Answer

Mixing. Basic open sets are cylinders $[w] = {x : x_{0} \dots x_{ℓ - 1} = w}$ for a finite word $w$ of length $ℓ$ . For cylinders $[u], [v]$ with $∣ u ∣ = ℓ$ , and any $n \geq ℓ$ , the point obtained by prescribing the first $ℓ$ symbols to be $u$ , the next $n - ℓ$ symbols arbitrary, then $v$ , lies in $[u]$ and has $σ^{n}$ -image in $[v]$ ; so $σ^{n} ([u]) \cap [v] \neq = \emptyset$ for all $n \geq ℓ$ . Since cylinders form a base, $N (U, V)$ is cofinite for all non-empty open $U, V$ , and $σ$ is mixing, hence transitive.

Dense periodic points. Given a cylinder $[w]$ with $∣ w ∣ = ℓ$ , the periodic point $\overline{w} = w w w \dots$ (infinite repetition of $w$ ) lies in $[w]$ and satisfies $σ^{ℓ} (\overline{w}) = \overline{w}$ . So every cylinder contains a periodic point; periodic points are dense.

Conclusion. $σ$ is transitive and has dense periodic points, so by the Banks et al. theorem it is sensitive; all three Devaney clauses hold and $σ$ is chaotic. (Directly, two sequences agreeing up to index $k$ differ at index $0$ after $k$ shifts, distance $1$ , giving sensitivity with $δ = 1/2$ .) Rubric: full credit for the cylinder-onto-after- $ℓ$ -steps mixing argument, the repeated-block periodic points, and the assembly into Devaney chaos.

Advanced results Master

Theorem (Banks-Brooks-Cairns-Davis-Stacey: sensitivity is redundant). Let $(X, f)$ be a continuous map of a metric space with at least two points. If $f$ is topologically transitive and has dense periodic points, then $f$ has sensitive dependence on initial conditions. Consequently, on any metric space with more than one point, clauses (D1) and (D2) of Devaney's definition imply clause (D3): chaos in Devaney's sense is equivalent to transitivity together with density of periodic points. (See ^{[Banks 1992]}, ^{[Banks 2003]}.)

This is the structural surprise of the subject. Devaney's three ingredients look independent — a wandering orbit, a periodic skeleton, and butterfly-effect divergence — yet the third is forced by the first two. The proof extracts a sensitivity constant from the geometry of the periodic skeleton alone: because there are at least two distinct periodic orbits (density plus more than one point guarantees this), every point stays uniformly far from at least one of them, and transitivity lets one drag a near neighbour of any point toward that far orbit, separating it from the point's own iterate. The constant is one-eighth the minimal inter-orbit distance and is global. The theorem demotes sensitivity from a defining axiom to a derived consequence, and it isolates transitivity plus dense periodicity as the genuine algebraic content of chaos.

Theorem (the strict hierarchy). On a perfect compact metric space the implications $mixing \Rightarrow transitive$ and $minimal \Rightarrow transitive$ both hold and are strict, and the classes minimal and mixing are incomparable. The irrational rotation is minimal and transitive but not mixing and not chaotic; the doubling map and the full shift are mixing, transitive, and chaotic but not minimal; a single attracting fixed point with one other orbit is none of these. (See ^{[Brin-Stuck 2002 §1.9]}, ^{[Katok-Hasselblatt 1995 §1.4]}.)

Transitivity is the common floor. Above it the theory splits into two incomparable strengthenings: minimality demands every orbit be dense (rigid homogeneity, the world of isometries and group rotations), while mixing demands every set spread to overlap everything (asymptotic independence, the world of expanding and hyperbolic maps). An irrational rotation maximises one and entirely lacks the other; a chaotic map maximises the second and lacks the first because its dense periodic points are precisely the proper closed invariant sets that minimality forbids. Devaney chaos lives on the mixing side: dense periodicity is incompatible with minimality on an infinite space, since a periodic orbit is a proper closed invariant subset.

Theorem (mixing and the spectral picture). For a measure-preserving system, topological mixing is the topological shadow of measure-theoretic mixing $μ (f^{- n} A \cap B) \to μ (A) μ (B)$ , and the chain weak mixing $\Rightarrow$ topological transitivity holds on the support of a fully supported invariant measure. Strong mixing $\Rightarrow$ weak mixing $\Rightarrow$ ergodicity is the measurable analogue of mixing $\Rightarrow$ transitive $\Rightarrow$ (on a minimal set) minimal, and the Koopman operator has continuous spectrum exactly for weakly mixing systems. (See ^{[Katok-Hasselblatt 1995 Ch. 4]}.)

The topological hierarchy mirrors a measurable one. Transitivity corresponds to ergodicity (no nontrivial invariant splitting), and topological mixing corresponds to measure-theoretic mixing (asymptotic statistical independence). The dictionary is not a perfect equivalence — a uniquely ergodic system carries the topological and measurable theories on the same orbits, but in general topological transitivity is strictly weaker than ergodicity of a given measure. The Koopman-operator viewpoint reveals the common mechanism: transitivity removes invariant continuous functions that are not constant, weak mixing removes eigenfunctions other than constants, and strong mixing forces correlations to decay, the spectral counterpart of cylinders spreading to overlap everything.

Synthesis. Topological transitivity is the foundational reason the whole apparatus of chaos coheres: it is the weakest expression of "the dynamics binds the space into one piece", proved generic by the Baire category argument, and the central insight of this unit is that joining it to a dense periodic skeleton already forces sensitivity — so the butterfly effect is not an independent axiom but a theorem. This is exactly the Banks et al. reduction, and putting these together with the strict hierarchy shows that Devaney chaos sits firmly on the mixing side of the transitive floor, dual to the minimality of 38.01.02 on the isometric side: minimality forced every orbit dense and forbade periodic points, while chaos demands a dense wandering orbit and a dense periodic skeleton, the two coexisting precisely because transitivity is so much weaker than minimality. The bridge is the recognition that minimal, transitive, and mixing are one ladder of connectivity, and the same ladder appears again in the measurable theory as ergodic, weakly mixing, and strongly mixing, so that the topological dichotomy between the irrational rotation and the doubling map generalises into the spectral dichotomy between discrete and continuous Koopman spectrum. All three rungs are statements about return sets $N (U, V)$ : transitive asks them non-empty, mixing asks them cofinite, and minimal asks the return set of every point to every neighbourhood to be syndetic — three sharpenings of recurrence this chapter has now laid end to end.

Full proof set Master

Proposition (mixing $\Rightarrow$ transitive, with the strictness witness). Topological mixing implies topological transitivity; the irrational rotation is transitive but not mixing.

Proof. If $f$ is mixing then for non-empty open $U, V$ the set $N (U, V)$ is cofinite, hence non-empty, so $f^{n} (U) \cap V \neq = \emptyset$ for some $n$ : transitivity. For strictness, let $R_{θ}$ be an irrational rotation, minimal hence transitive. Take $U$ an arc of length $ℓ < 1/2$ and $V = U$ . As $R_{θ}$ is an isometry, $R_{θ}^{n} (U)$ is an arc of length $ℓ$ , meeting $U$ only when $n θ mod 1$ lies in the length- $2 ℓ$ arc centred at $0$ . Since ${n θ mod 1}$ is dense, it falls outside this arc for infinitely many $n$ , so $N (U, U)$ omits infinitely many integers and is not cofinite. Thus $R_{θ}$ is not mixing. $□$

Proposition (the doubling map is mixing). $E_{2} (x) = 2 x mod 1$ on the circle is topologically mixing.

Proof. Any non-empty open $U$ contains a dyadic interval $I = [j 2^{- k}, (j + 1) 2^{- k})$ . Each application of $E_{2}$ doubles the length of a dyadic interval not straddling the wrap point, so $E_{2}^{k} (I) = [0, 1)$ . For every $m \geq k$ , $E_{2}^{m} (I) = E_{2}^{m - k} ([0, 1)) = [0, 1)$ , which meets every non-empty open $V$ . Hence $N (U, V) \supseteq {k, k + 1, \dots}$ is cofinite, and $E_{2}$ is mixing. $□$

Proposition (Banks et al., full statement). Let $f : X \to X$ be continuous on a metric space with more than one point, topologically transitive, with dense periodic points. Then $f$ is sensitive: there is $δ > 0$ such that for every $x$ and every neighbourhood $U$ of $x$ there are $y \in U$ and $n \geq 0$ with $d (f^{n} (x), f^{n} (y)) > δ$ .

Proof. Density of periodic points and $∣ X ∣ > 1$ give two periodic points $p, q$ on distinct orbits, so the orbits $O (p), O (q)$ have positive distance; let $8 δ = min {d (a, b) : a \in O (p), b \in O (q)} > 0$ . Fix $x \in X$ . By the triangle inequality $d (x, O (p)) + d (x, O (q)) \geq d (O (p), O (q)) = 8 δ$ , so $x$ is at distance $\geq 4 δ$ from at least one orbit; call it $O (w)$ , $w$ of period $π$ .

Let $U$ be any neighbourhood of $x$ ; shrink to a ball $B (x, r) \subseteq U$ . By density choose a periodic point $z \in B (x, r)$ of period $m$ . Set $W = B (f^{j} (w), δ)$ for the point $f^{j} (w)$ of $O (w)$ ; by transitivity (open-set form) there is a point $u \in B (x, r)$ and a time $k$ with $f^{k} (u) \in W$ , so $d (f^{k} (u), f^{j} (w)) < δ$ . Choose $n \in [k, k + π m)$ a common multiple of $π$ and $m$ exceeding $k$ ; then $f^{n} (z) = z$ stays within $r$ of $x$ , while $f^{n} (u)$ — tracking the orbit of $w$ — satisfies $d (f^{n} (u), O (w)) < δ$ by continuity along the bounded time window (choosing $r$ small enough that the $\leq π m$ iterates of points within $r$ stay within $δ$ of the corresponding iterates). Since $d (f^{n} (x), O (w)) \geq 4 δ$ , the triangle inequality gives $d (f^{n} (x), f^{n} (u)) \geq 3 δ$ and $d (f^{n} (x), f^{n} (z))$ small, so $max {d (f^{n} (x), f^{n} (u)), d (f^{n} (x), f^{n} (z))} > δ$ . Either $u$ or $z$ lies in $U$ and separates from $x$ by more than $δ$ at time $n$ . Hence $δ$ is a sensitivity constant. $□$

Proposition (transitivity is conjugacy-invariant). If $h : X \to Y$ is a topological conjugacy ( $h \circ f = g \circ h$ , $h$ a homeomorphism) and $f$ is topologically transitive (resp. mixing, resp. Devaney-chaotic), so is $g$ .

Proof. Let $U^{'}, V^{'} \subseteq Y$ be non-empty open; then $U = h^{- 1} (U^{'}), V = h^{- 1} (V^{'})$ are non-empty open in $X$ . From $h \circ f^{n} = g^{n} \circ h$ one gets $g^{n} (U^{'}) \cap V^{'} = h (f^{n} (U)) \cap h (V) = h (f^{n} (U) \cap V)$ , so $g^{n} (U^{'}) \cap V^{'} \neq = \emptyset$ iff $f^{n} (U) \cap V \neq = \emptyset$ . Thus the return sets $N_{g} (U^{'}, V^{'})$ and $N_{f} (U, V)$ coincide: non-emptiness (transitivity) and cofiniteness (mixing) transfer. Periodic points correspond under $h$ ( $g^{n} (h (x)) = h (f^{n} (x))$ ), so dense periodic points transfer; and $d_{Y} (g^{n} h x, g^{n} h y) = d_{Y} (h f^{n} x, h f^{n} y)$ together with uniform continuity of $h, h^{- 1}$ on a compact space transfers sensitivity. Hence Devaney chaos is a conjugacy invariant. $□$

Proposition (irrational rotation is not Devaney-chaotic). The irrational rotation $R_{θ}$ is transitive but not chaotic, because it has no periodic points at all.

Proof. If $R_{θ}^{n} (x) = x$ then $n θ \equiv 0 (mod 1)$ , forcing $θ = k / n \in Q$ , contrary to irrationality. So $R_{θ}$ has no periodic points; its periodic-point set is empty, hence not dense, and clause (D2) of Devaney's definition fails. (It is also not sensitive: $R_{θ}$ is an isometry, so $d (R_{θ}^{n} x, R_{θ}^{n} y) = d (x, y)$ for all $n$ , and nearby points never separate.) $□$

Connections Master

Minimality and recurrence 38.01.02. This unit is the chaotic counterpart to the minimal one. Minimality forced every orbit dense and forbade periodic points; transitivity asks only for a residual set of dense orbits, and Devaney chaos couples that wandering orbit with a dense periodic skeleton — exactly the proper closed invariant sets minimality outlaws. The return-set language $N (U, V)$ refines the syndetic return sets $N (x, U)$ of 38.01.02: minimal asks point-to-neighbourhood returns syndetic, transitive asks set-to-set returns non-empty, mixing asks them cofinite, three sharpenings of the same recurrence idea laid end to end.
Dynamical systems, orbits, and limit sets 38.01.01. The objects here are the topological-conjugacy invariants introduced there. Transitivity, mixing, density of periodic points, and sensitivity are all preserved by the conjugacy of 38.01.01, so the chaos of the doubling map transfers verbatim to the full shift via the binary-coding conjugacy proved in that unit, and the non-wandering set $Ω (f)$ of 38.01.01 is the arena: a transitive system has $Ω (f) = X$ , and chaos concentrates on the closure of the periodic points inside it.
Hyperbolic sets, Anosov and Axiom-A systems, the Smale decomposition 38.03.01. The Smale spectral decomposition refines transitivity and mixing into structure: the non-wandering set of an Axiom-A system splits into finitely many topologically transitive basic sets, each of which cyclically permutes finitely many topologically mixing pieces. The strict hierarchy of this unit is exactly the building block of that decomposition, and the doubling map and full shift reappear there as the model expanding and symbolic factors on which the hyperbolic theory is coded.

Historical & philosophical context Master

The transitivity property entered dynamics through George David Birkhoff, whose 1920 Acta Mathematica memoir on surface transformations ^{[Birkhoff 1920]} identified the existence of a dense orbit as the indecomposability condition for a flow and proved its equivalence with the every-pair-of-regions condition now bearing his name; the result was systematised in his 1927 Colloquium volume alongside minimality and recurrence. Topological mixing and the spectral hierarchy were developed in the measure-theoretic ergodic theory of the 1930s by Eberhard Hopf, John von Neumann, and Paul Halmos, and transported to the topological setting in the post-war structure theory of Walter Gottschalk, Gustav Hedlund, and Robert Ellis.

The word chaos was given its influential mathematical definition by Robert Devaney in the 1986 first edition of An Introduction to Chaotic Dynamical Systems ^{[Devaney 1989]}, packaging transitivity, dense periodicity, and sensitive dependence as the three ingredients of chaotic behaviour and exhibiting the doubling map and the shift as the canonical models through symbolic conjugacy. The logical redundancy of the third ingredient was discovered by John Banks, Jeff Brooks, Grant Cairns, Gary Davis, and Peter Stacey, whose 1992 note in the American Mathematical Monthly ^{[Banks 1992]} proved that transitivity together with dense periodic points forces sensitivity on any metric space of more than one point. Their three-page argument reduced Devaney's definition to two genuinely independent clauses and remains the standard reference; the textbook treatment by Banks, Dragan, and Jones ^{[Banks 2003]} and the canonical accounts of Brin-Stuck ^{[Brin-Stuck 2002 §1.9]} and Katok-Hasselblatt ^{[Katok-Hasselblatt 1995 §1.4]} present transitivity, mixing, and chaos as the connectivity layer of topological dynamics above minimality and recurrence.

Bibliography Master

@article{Birkhoff1920,
  author  = {Birkhoff, George D.},
  title   = {Surface transformations and their dynamical applications},
  journal = {Acta Mathematica},
  volume  = {43},
  year    = {1920},
  pages   = {1--119}
}

@book{Devaney1989,
  author    = {Devaney, Robert L.},
  title     = {An Introduction to Chaotic Dynamical Systems},
  edition   = {2nd},
  publisher = {Addison-Wesley},
  year      = {1989}
}

@article{Banks1992,
  author  = {Banks, John and Brooks, Jeff and Cairns, Grant and Davis, Gary and Stacey, Peter},
  title   = {On Devaney's definition of chaos},
  journal = {American Mathematical Monthly},
  volume  = {99},
  number  = {4},
  year    = {1992},
  pages   = {332--334}
}

@book{Banks2003,
  author    = {Banks, John and Dragan, Valentina and Jones, Arthur},
  title     = {Chaos: A Mathematical Introduction},
  publisher = {Cambridge University Press},
  series    = {Australian Mathematical Society Lecture Series},
  volume    = {18},
  year      = {2003}
}

@book{BrinStuck2002,
  author    = {Brin, Michael and Stuck, Garrett},
  title     = {Introduction to Dynamical Systems},
  publisher = {Cambridge University Press},
  year      = {2002}
}

@book{KatokHasselblatt1995,
  author    = {Katok, Anatole and Hasselblatt, Boris},
  title     = {Introduction to the Modern Theory of Dynamical Systems},
  publisher = {Cambridge University Press},
  series    = {Encyclopedia of Mathematics and its Applications},
  volume    = {54},
  year      = {1995}
}

@book{Birkhoff1927,
  author    = {Birkhoff, George D.},
  title     = {Dynamical Systems},
  publisher = {American Mathematical Society},
  series    = {Colloquium Publications},
  volume    = {9},
  year      = {1927}
}

Prerequisites

38.01.01
38.01.02

Tier anchors

beginner: Strogatz 1994 *Nonlinear Dynamics and Chaos* (Addison-Wesley) Ch. 10–11 (the doubling map, sensitive dependence, the logistic map at the chaotic parameter); 3Blue1Brown *Chaos* and the doubling/baker's-map visual essays for the stretch-and-fold and dense-orbit imagery
intermediate: Brin-Stuck 2002 *Introduction to Dynamical Systems* (Cambridge University Press) Ch. 1 §1.9–§1.11 (topological transitivity, mixing, the Birkhoff transitivity theorem); Devaney 1989 *An Introduction to Chaotic Dynamical Systems* (Addison-Wesley) §1.8 (the three ingredients of chaos)
master: Brin-Stuck 2002 *Introduction to Dynamical Systems* (Cambridge University Press) Ch. 1; Devaney 1989 *An Introduction to Chaotic Dynamical Systems* (2nd ed., Addison-Wesley) Ch. 1 §1.8–§1.9; Banks, Brooks, Cairns, Davis, Stacey 1992 *On Devaney's definition of chaos* (Amer. Math. Monthly 99) — the redundancy of sensitivity; Katok-Hasselblatt 1995 *Introduction to the Modern Theory of Dynamical Systems* (Cambridge) Ch. 1 §1.4–§1.9 and Ch. 4 (transitivity, mixing, the spectral hierarchy)

References

Brin, Stuck 2002 — Introduction to Dynamical Systems · Ch. 1 §1.9–§1.11 (topological transitivity, the equivalence of a dense orbit with the every-pair-of-opens condition on a perfect Polish space, topological mixing, the strict hierarchy minimal/transitive/mixing, sensitive dependence, and Devaney chaos); Cambridge University Press 2002
Devaney 1989 — An Introduction to Chaotic Dynamical Systems · 2nd edition, Addison-Wesley 1989, Ch. 1 §1.8–§1.9 (the three-ingredient definition of chaos: topological transitivity, density of periodic points, sensitive dependence on initial conditions; the chaotic dynamics of the doubling map and the full shift via symbolic conjugacy)
Banks, Brooks, Cairns, Davis, Stacey 1992 — On Devaney's definition of chaos · American Mathematical Monthly 99 (1992) 332–334; the theorem that topological transitivity together with density of periodic points implies sensitive dependence on initial conditions, so that sensitivity is a redundant clause of Devaney's definition on any metric space with more than one point
Katok, Hasselblatt 1995 — Introduction to the Modern Theory of Dynamical Systems · Ch. 1 §1.4–§1.9 and Ch. 4 (topological transitivity and mixing, the relation to minimality, the spectral characterisation of mixing for measure-preserving systems); Encyclopedia of Mathematics and its Applications 54, Cambridge University Press 1995
Birkhoff 1920 — Surface transformations and their dynamical applications · Acta Mathematica 43 (1920) 1–119; the originating source for the transitivity property of a flow and the equivalence with a dense orbit, the result later named the Birkhoff transitivity theorem
Banks, Dragan, Jones 2003 — Chaos: A Mathematical Introduction · Cambridge University Press 2003, Ch. 5–6 (transitivity, mixing, the redundancy of sensitivity, the doubling map and the shift as the canonical chaotic systems); a textbook-level development of the Banks et al. theorem

Estimated time

beginner: 18m
intermediate: 44m
master: 84m