If distinct points of a dynamical system on a compact metric space satisfy in one compatible metric, no compatible metric can make an isometry. On a compact space, all compatible metrics give the same asymptotic-pair property by uniform continuity, whereas an isometry preserves the strictly positive distance between distinct points. In a full shift, a constant sequence and a sequence differing at just one coordinate converge to each other under forward shifts, proving this obstruction directly in the product topology.
Cylinder set Created 2026-10-05 Updated 2026-10-07
A cylinder set in a product of spaces restricts a finite collection of coordinates and leaves all other coordinates free. It has the form , where is the coordinate projection onto the finite subproduct. Taking to be a product of open sets gives the basic open cylinders for the product topology. In a finite-alphabet full shift, specifying exact letters at finitely many coordinates gives a clopen set.
Dynamical proof of Hindman's theorem 2026-10-05
Extend a finite coloring of the positive integers to a point of a two-sided full shift. A minimal subsystem of its forward orbit closure, together with the proximal-minimal existence theorem, supplies a minimal point proximal to . Put . If all sums in , the augmented finite-sums set, have color in , their coordinate constraints define a cylinder set containing . The joint return lemma for a proximal minimal pair chooses a new positive term so that all new sums have color in both and . Mathematical induction gives an infinite monochromatic finite-sums set. The new term can exceed the sum of all previous terms, giving unique representations. The proximal-minimal existence theorem is a substantive input to this proof.
Full shift 2026-10-05
The two-sided full shift on a finite alphabet consists of all functions , with the product topology and the left shift. It is a compact metric space. A compatible metric isAgreement on increasingly large finite coordinate sets is equivalent to convergence in this topology. The metric above is compatible but is not invariant under the left shift.
Left shift 2026-10-05
On a two-sided full shift, the left shift is the homeomorphismIts inverse sends to . On a one-sided sequence space, the same forward shift is generally not invertible.
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.
Minimal point 2026-10-05
A point is minimal when its forward orbit closure is a minimal dynamical system. This does not require the point to be a fixed point. In a finite-alphabet full shift, minimal points are exactly the uniformly recurrent sequences.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 30 4 Solution Created 2026-10-03 Updated 2026-10-14
Use the convention that level counts the nonzero shifts, hence an arithmetic progression of length . The SZ property at level means that every measurable set of positive measure satisfiesThis is the averaged multiple-recurrence property, stronger than merely finding one positive intersection. Shifting the indexing convention from terms to terms does not change the all-levels assertion. We work with probability measure-preserving systems.
Here is the Furstenberg correspondence principle construction proving the Szemerédi theorem. Let have positive upper density . Put equal to the indicator of on the positive coordinates and zero elsewhere, and let be the left shift. The binary full shift is a compact metric space in the product topology, and is a homeomorphism. Choose attaining the upper density and define the empirical measuresWe use the standard weak compactness fact that every sequence of Borel probability measures on a compact metric space has a weakly convergent subsequence, where weak convergence means convergence of integrals of continuous functions. Pass to a subsequence with limit . For every continuous , telescoping givesPassing to the limit proves . The cylinder set is clopen, so its indicator is continuous andIf every measure-preserving system has the SZ property at level , there is some for which , where . This is also a clopen cylinder set, so . For some sufficiently large , at least one term of the empirical average is positive: for some . Unwinding the coordinates givesTherefore contains an arithmetic progression of length with positive common difference. Having the SZ property at every level gives the infinite-density form of the Szemerédi theorem.
The finite uniform form follows from the same argument. If, for fixed and , arbitrarily large admitted sets with and no such arithmetic progression, replace above by the indicator of , extended by zero outside that interval. Their empirical measures still have an invariant weak limit with . For every fixed positive , however, , since a point contributing to that cylinder would be an actual progression in . Thus for all positive , contradicting the SZ property. Consequently a sufficiently large depending only on forces the required progression.
A compact measure-preserving system is one for which every observable has relatively compact forward orbit under the Koopman operator . Equivalently, each of these orbits is totally bounded in the global norm; compactness refers to observables, not just to the underlying topological space. For an invertible system it is usual to use all integer times. One may also define compactness by density of almost periodic observables: the two definitions coincide because , so a finite net for an approximating observable is a finite net, with slightly larger radius, for .
To prove the SZ property, fix with , put , and chooseCompactness gives a finite -net for its orbit with centers , where . Let . For every integer , some center satisfies . Since is an isometry, cancellation givesThus the return set meets every interval for . In particular, is a syndetic set with lower density at least . This proves the needed syndetic near returns of an almost periodic observable without any assumption of ergodicity.
For , telescoping and the isometry property giveAs is an indicator, . The union bound therefore givesAll other multiple-intersection measures are nonnegative. Averaging over the bounded-gap set yieldsThus every compact measure-preserving system has the SZ property at every level, including nonergodic systems and, under the forward-orbit definition, noninvertible transformations.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 108 2 Solution Created 2026-10-03 Updated 2026-10-06
The Szemerédi theorem says that for every integer and every , there is such that, for , every with contains a nonconstant arithmetic progressionEquivalently, every subset of the positive integers with positive upper asymptotic density contains arithmetic progressions of every finite length. Length one is immediate.
The Furstenberg multiple recurrence theorem states that for every probability measure-preserving system, every measurable with , and every integer , there is withHere means a preimage, so invertibility is unnecessary. The Furstenberg multiple recurrence theorem also does not assume an ergodic transformation.
We prove the implication to the finite Szemerédi theorem by constructing the Furstenberg correspondence principle explicitly. Suppose, to the contrary, that for fixed and there are and with , but with no length- arithmetic progression of positive common difference. In the binary full shift , encode as , taking all coordinates outside to be zero. Let be the left shift, , and setThe cylinder set is a clopen set, and . The binary full shift is a compact metric space, so compactness of probability measures on a compact metric space gives a subsequence of these empirical measures with weak convergence of probability measures to a Borel probability measure .
For every continuous on the full shift,Passing to the weak limit shows that is an invariant measure for the continuous left shift. Thus is a probability measure-preserving system. Since the indicator function of is continuous, .
Apply the Furstenberg multiple recurrence theorem to . For some , the clopen sethas . Its continuous indicator function gives . For large , at least one in the defining empirical measure therefore belongs to . The choice of left shift impliesso lies in . This contradicts the assumed absence of arithmetic progressions and proves the finite Szemerédi theorem. Applying the finite Szemerédi theorem on intervals where an infinite set has density bounded below proves the stated upper asymptotic density formulation.
For multiple recurrence for circle rotations, write and , with normalized Lebesgue measure , which is the Haar measure of the circle group. Fix a measurable with and . If is rational, there is with the identity, and gives an intersection of measure .
For irrational , the pigeonhole principle applied to in equal arcs gives with . In particular there are arbitrarily small nonzero returns to zero for the irrational rotation of the circle.
We also need translation continuity in L1 on the circle. Given a measurable , approximate its indicator function in the L1 norm by a continuous on the circle group. Such approximation follows from regularity of Lebesgue measure, or approximation by finite unions of intervals. Translation invariance and uniform continuity givewhere the approximation error is first made arbitrarily small. Equivalently, .
Choose a return time so small modulo one that for each ,This is possible because multiplication by each fixed is continuous on the circle group and translation continuity in L1 on the circle applies to the finitely many translates. The union bound now givesThis proves the Furstenberg multiple recurrence theorem for every circle rotation with its normalized Lebesgue measure, including both rational and irrational angles.
Past exam of the nonlinear systems course of the University of Oxford 2023 3 c iii Solution 2026-10-25
The set consists precisely of points whose first positions all lie in . HenceDeleting the first position preserves this condition, proving . For the reverse inclusion, if , take . Then and for every . Thus and . In fact both inverse branches give preimages in . Thereforewhich proves full invariance, not merely forward invariance.
For any infinite symbolic sequence , the itinerary cylinders are nonempty compact nested intervals. The nested interval theorem gives at least one point in their intersection. Every has a unique itinerary because . To justify that the itinerary also determines a unique point, it suffices to show the interval lengths shrink. The fact that logistic inverse branches contract in an angular coordinate works for every ; a direct claim that in the original coordinate would fail for some just above four.
Use the homeomorphism of . The transformed inverse branches areTheir derivatives satisfyThe inequality follows by squaring and using . Thus every length- transformed itinerary cylinder has length at most . Since , its original interval has length at most and shrinks to a point. This gives the claimed one-to-one identification with the one-sided full shift.
Finally part (ii) givesThus acts by the left shift. The identification is a topological conjugacy: matching long prefixes forces closeness by the shrinking estimate, while distinct finite itinerary cylinders are disjoint compact sets and so their inverse coding is continuous. In particular need not be one-to-one on , just as a one-sided left shift has two possible first symbols before any given tail.
Smale horseshoe 2026-10-13
A Smale horseshoe is a compact hyperbolic invariant set of a smooth map with expanding and contracting directions and at least two strips that stretch across a common rectangle. Iterating the strips and their inverse images produces a Cantor-set product on which the dynamics are conjugate to a full shift. It supplies infinitely many saddle periodic orbits and chaotic itineraries; hyperbolicity alone does not make it an attracting invariant set. The geometric construction explains why phase-dependent reinjection near a Shilnikov bifurcation can create chaos even when the associated symmetric amplitude equations have no such mechanism.
Subshift of finite type 2026-10-14
A subshift of finite type is a closed subset of a finite-alphabet full shift defined by finitely many forbidden finite words, with the restricted left shift. After replacing symbols by sufficiently long blocks, its constraints can be described by a zero-one symbolic transition matrix. In this presentation, membership means that every consecutive pair follows an allowed transition. The resulting sequence space is a compact metric space and the restricted left shift is a homeomorphism.
Topological pressure 2026-10-14
For a finite full shift and a potential with summable variations, the displayed symbolic pressure exists and does not depend on the reference tail . The almost-additive partition-function limit proves existence. The function is convex; finite-volume second derivatives are energy variances divided by block length. If , its increments for lie between and , so it is Lipschitz continuous, strictly decreasing, and has one positive zero.
Uniform recurrence Created 2026-10-05 Updated 2026-10-14
A two-sided sequence over a finite alphabet is uniformly recurrent if every finite word over an alphabet occurring in it occurs with bounded gaps. More precisely, for each such word some ensures that every length- interval contains a complete occurrence. This is equivalent to being a minimal point of the full shift: a finite cover of the orbit closure by preimages of a word's cylinder set bounds its return gaps; conversely, bounded gaps pass to all points of the orbit closure and make every forward orbit dense there. The property concerns finite words, not infinite integer intervals.