Notre Dame Journal of Formal Logic

Proof Mining in Topological Dynamics

Philipp Gerhardy


A famous theorem by van der Waerden states the following: Given any finite coloring of the integers, one color contains arbitrarily long arithmetic progressions. Equivalently, for every q,k, there is an N = N(q,k) such that for every q-coloring of an interval of length N one color contains a progression of length k. An obvious question is what is the growth rate of N = N(q,k). Some proofs, like van der Waerden's combinatorial argument, answer this question directly, while the topological proof by Furstenberg and Weiss does not. We present an analysis of (Girard's variant of) Furstenberg and Weiss's proof based on monotone functional interpretation, both yielding bounds and providing a general illustration of proof mining in topological dynamics. The bounds do not improve previous results by Girard, but only—as is also revealed by the analysis—because the combinatorial proof and the topological dynamics proof in principle are identical.

Article information

Notre Dame J. Formal Logic, Volume 49, Number 4 (2008), 431-446.

First available in Project Euclid: 17 October 2008

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03 03F

mathematical logic proof mining van der Waerden combinatorics topological dynamics


Gerhardy, Philipp. Proof Mining in Topological Dynamics. Notre Dame J. Formal Logic 49 (2008), no. 4, 431--446. doi:10.1215/00294527-2008-022.

Export citation


  • [1] Furstenberg, H., Recurrence in Ergodic Theory and Combinatorial Number Theory, Princeton University Press, Princeton, 1981.
  • [2] Furstenberg, H., and B. Weiss, "Topological dynamics and combinatorial number theory", Journal d'Analyse Mathématique, vol. 34 (1978), pp. 61--85.
  • [3] Furstenberg, H., "Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions", Journal d'Analyse Mathématique, vol. 31 (1977), pp. 204--56.
  • [4] Gerhardy, P., and U. Kohlenbach, "General logical metatheorems for functional analysis", Transactions of the American Mathematical Society, vol. 360 (2008), pp. 2615--60.
  • [5] Girard, J.-Y., Proof Theory and Logical Complexity, vol. 1 of Studies in Proof Theory. Monographs, Bibliopolis, Naples, 1987.
  • [6] Gowers, W. T., "A new proof of Szemerédi's theorem", Geometric and Functional Analysis, vol. 11 (2001), pp. 465--588.
  • [7] Kohlenbach, U., "Applied Proof Theory: Proof Interpretations and Their Use in Mathematics", to appear in Springer Monographs in Mathematics, 2008.
  • [8] Kohlenbach, U., "Some logical metatheorems with applications in functional analysis", Transactions of the American Mathematical Society, vol. 357 (2005), pp. 89--128.
  • [9] Landman, B. M., and A. Robertson, Ramsey Theory on the Integers, vol. 24 of Student Mathematical Library, American Mathematical Society, Providence, 2004.
  • [10] McCutcheon, R., Elemental Methods in Ergodic Ramsey Theory, vol. 1722 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1999.
  • [11] Shelah, S., "Primitive recursive bounds for Van der Waerden numbers", Journal of the American Mathematical Society, vol. 1 (1988), pp. 683--97.
  • [12] Szemerédi, E., "On sets of integers containing no $k$" elements in arithmetic progression. Collection of articles in memory of Juriĭ Vladimirovič Linnik, Acta Arithmetica, vol. 27 (1975), pp. 199--245.
  • [13] Troelstra, A. S., editor, Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, vol. 344 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1973.
  • [14] van der Waerden, B. L., "Beweis einer baudetschen Vermutung", Nieuw Archief voor Wiskunde, vol. 15 (1927), pp. 212--16.