By using nonstandard analysis, and in particular iterated hyperextensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for applications in Ramsey theory of numbers. To illustrate the use of our technique, we give a (rather) short proof of Milliken-Taylor’s Theorem and a ultrafilter version of Rado’s Theorem about partition regularity of diophantine equations.
Iterated hyper-extensions and an idempotent ultrafilter proof of Rado’s Theorem
DI NASSO, MAURO
2015-01-01
Abstract
By using nonstandard analysis, and in particular iterated hyperextensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for applications in Ramsey theory of numbers. To illustrate the use of our technique, we give a (rather) short proof of Milliken-Taylor’s Theorem and a ultrafilter version of Rado’s Theorem about partition regularity of diophantine equations.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
iterated.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
195.42 kB
Formato
Adobe PDF
|
195.42 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.