Math 2.0

Dynamical systems and ergodic theory Ergodic theory Theorem

Furstenberg's multiple recurrence theorem

Builds on Probability spaceMeasure-preserving transformationPoincaré recurrence theoremSzemerédi's theorem

Statement

Let (X,ℬ,μ)(X, \mathcal{B}, \mu) be a probability space and let T ⁣:X→XT \colon X \to X be a measure-preserving transformation. Let A∈ℬA \in \mathcal{B} with μ(A)>0\mu(A) > 0, and let k≥1k \ge 1 be an integer. Then lim inf⁡N→∞1N∑n=1Nμ(A∩T−nA∩T−2nA∩⋯∩T−knA)>0.\liminf_{N \to \infty} \frac{1}{N} \sum_{n=1}^{N} \mu\big(A \cap T^{-n}A \cap T^{-2n}A \cap \cdots \cap T^{-kn}A\big) > 0. In particular, there is an integer n≥1n \ge 1 with μ(A∩T−nA∩⋯∩T−knA)>0\mu(A \cap T^{-n}A \cap \cdots \cap T^{-kn}A) > 0.

Remarks

For k=1k = 1 the weaker conclusion is the Poincaré recurrence theorem, and the average form follows from the mean ergodic theorem. For general kk the proof goes through a structure theorem. One first reduces to ergodic systems. Every ergodic system is built from a trivial system by a possibly transfinite tower of compact extensions, followed possibly by one weakly mixing extension. The property holds for compact extensions, where orbits come back almost periodically. It also holds for weakly mixing extensions, where the sets T−inAT^{-in}A behave as if independent. Then it passes up the tower and to limits. Example: for an irrational rotation and an arc AA of length ℓ\ell, take nn with nαn\alpha within ℓ/(2k)\ell/(2k) of an integer. Then A∩T−nA∩⋯∩T−knAA \cap T^{-n}A \cap \cdots \cap T^{-kn}A contains an arc of length at least ℓ/2\ell/2. Example: for a Bernoulli scheme and a cylinder set AA, independence gives μ(A∩T−nA∩⋯∩T−knA)=μ(A)k+1\mu(A \cap T^{-n}A \cap \cdots \cap T^{-kn}A) = \mu(A)^{k+1} once nn exceeds the length of the cylinder. The hypothesis μ(X)<∞\mu(X) < \infty cannot be dropped: the translation x↦x+1x \mapsto x + 1 on ℝ\R with Lebesgue measure and A=[0,1)A = [0, 1) gives A∩T−nA=∅A \cap T^{-n}A = \emptyset for every n≥1n \ge 1.

Going deeper

For a student

Furstenberg proved the theorem in 1977 to give an ergodic-theoretic proof of Szemerédi's theorem. The Furstenberg correspondence principle turns a set of integers of positive upper density into a set AA of positive measure in a measure-preserving system. It does so in such a way that a positive value of μ(A∩T−nA∩⋯∩T−knA)\mu(A \cap T^{-n}A \cap \cdots \cap T^{-kn}A) yields an arithmetic progression a,a+n,…,a+kna, a+n, \dots, a+kn in the original set. The method grew into ergodic Ramsey theory, with extensions to several commuting transformations, which gives multidimensional Szemerédi theorems, and to polynomial times.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Almost everywhere concept
  2. Finite measure concept
  3. Limit superior concept
  4. Measure-preserving transformation concept
  5. Probability space concept
  6. Poincaré recurrence theorem statement
  7. Szemerédi's theorem statement
  8. Furstenberg's multiple recurrence theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Szemer%C3%A9di%27s_theorem
About this page
TagE459H2B2EM
URIm2://E459H2B2EM
Kindstatement, theorem
WritingW0 stub
MSC37A05, 37A30, 11B25
StatusThis copy of the site has no build data. Run m2 status E459H2B2EM.
AboutMeasure-preserving transformation
UsesProbability space, Measure-preserving transformation, Poincaré recurrence theorem, Szemerédi's theorem

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.