Translation invariant filters and van der Waerden's Theorem
Combinatorics
2020-01-17 v2
Abstract
We present a self-contained proof of a strong version of van der Waerden's Theorem. By using translation invariant filters that are maximal with respect to inclusion, a simple inductive argument shows the existence of "piecewise syndetically"-many monochromatic arithmetic progressions of any length k in every finite coloring of the natural numbers. All the presented constructions are constructive in nature, in the sense that the involved maximal filters are defined by recurrence on suitable countable algebras of sets. No use of the axiom of choice or of Zorn's Lemma is needed.
Keywords
Cite
@article{arxiv.1808.01500,
title = {Translation invariant filters and van der Waerden's Theorem},
author = {Mauro Di Nasso},
journal= {arXiv preprint arXiv:1808.01500},
year = {2020}
}