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.

Translation Invariant Filters and van der Waerden’s Theorem

Di Nasso M.
2020-01-01

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.
File in questo prodotto:
File Dimensione Formato  
vdW-preprint.pdf

accesso aperto

Tipologia: Documento in Pre-print
Licenza: Creative commons
Dimensione 294.99 kB
Formato Adobe PDF
294.99 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/1022932
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact