Borel sets of Rado graphs and Ramsey's Theorem
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2019
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910623697207296 |
|---|---|
| author | Dobrinen, Natasha |
| author_facet | Dobrinen, Natasha |
| contents | The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset $\mathcal{X}\subseteq [ω]^ω$, where $[ω]^ω$ is endowed with the metric topology, each infinite subset $X\subseteq ω$ contains an infinite subset $Y\subseteq X$ such that $[Y]^ω$ is either contained in $\mathcal{X}$ or disjoint from $\mathcal{X}$. Kechris, Pestov, and Todorcevic point out in their seminal 2005 paper the dearth of similar results for homogeneous structures. Such results are a necessary step to the larger goal of finding a correspondence between structures with infinite dimensional Ramsey properties and topological dynamics, extending their correspondence between the Ramsey property and extreme amenability. In this article, we prove an analogue of the Galvin-Prikry theorem for the Rado graph. Any such infinite dimensional Ramsey theorem is subject to constraints following from the 2006 work of Laflamme, Sauer, and Vuksanovic. The proof uses techniques developed for the author's work on the Ramsey theory of the Henson graphs as well as some new methods for fusion sequences, used to bypass the lack of a certain amalgamation property enjoyed by the Baire space. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1904_00266 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Borel sets of Rado graphs and Ramsey's Theorem Dobrinen, Natasha Combinatorics Logic 05D10, 03E02, 03E75 The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset $\mathcal{X}\subseteq [ω]^ω$, where $[ω]^ω$ is endowed with the metric topology, each infinite subset $X\subseteq ω$ contains an infinite subset $Y\subseteq X$ such that $[Y]^ω$ is either contained in $\mathcal{X}$ or disjoint from $\mathcal{X}$. Kechris, Pestov, and Todorcevic point out in their seminal 2005 paper the dearth of similar results for homogeneous structures. Such results are a necessary step to the larger goal of finding a correspondence between structures with infinite dimensional Ramsey properties and topological dynamics, extending their correspondence between the Ramsey property and extreme amenability. In this article, we prove an analogue of the Galvin-Prikry theorem for the Rado graph. Any such infinite dimensional Ramsey theorem is subject to constraints following from the 2006 work of Laflamme, Sauer, and Vuksanovic. The proof uses techniques developed for the author's work on the Ramsey theory of the Henson graphs as well as some new methods for fusion sequences, used to bypass the lack of a certain amalgamation property enjoyed by the Baire space. |
| title | Borel sets of Rado graphs and Ramsey's Theorem |
| topic | Combinatorics Logic 05D10, 03E02, 03E75 |
| url | https://arxiv.org/abs/1904.00266 |