Deducing the Density Hales-Jewett Theorem from an Infinitary Removal Lemma

作者：Austin Tim^*

来源：Journal of Theoretical Probability, 2011, 24(3): 615-633.

DOI：10.1007/s10959-011-0373-4

• Exchangeability
• Ergodic Ramsey theory
• Density Hales-Jewett

We offer a new proof of Furstenberg and Katznelson's density version of the Hales-Jewett Theorem:
Theorem For any delta > 0 there is some N (0)>= 1 such that whenever A subset of[k] (N) with N >= N (0) and |A|>=delta k (N) , A contains a combinatorial line, that is, for some I subset of[N] nonempty and w (0)is an element of[k]([N]\I) we have A superset of{w : w vertical bar[N]\I = w(0), w vertical bar(I) = const.}
Following Furstenberg and Katznelson, we first show that this result is equivalent to a 'multiple recurrence' assertion for a class of probability measures enjoying a certain kind of stationarity. However, we then give a quite different proof of this latter assertion through a reduction to an infinitary removal lemma in the spirit of Tao (J. Anal. Math. 103, 1-45, 2007) (and also its recent re-interpretation in (J. Anal. Math., to appear)). This reduction is based on a structural analysis of these stationary laws closely analogous to the classical representation theorems for various partially exchangeable stochastic processes in the sense of Hoover (Relations on probability spaces and arrays of random variables, 1979), Aldous (in Exchangeability in Probability and Statistics, 165-170, 1982; Lecture Notes in Math. 1117, 1-198, 1985) and Kallenberg (J. Theor. Probab. 5(4), 727-765, 1992). However, the underlying combinatorial arguments used to prove this theorem are rather different from those required to work with exchangeable arrays, and involve crucially an observation that arose during ongoing work by a collaborative team of authors (http://gowers.wordpress.com/) to give a purely finitary proof of the above theorem.

• 出版日期2011-9