research

Borel sets of Rado graphs and Ramsey's Theorem

Abstract

The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset X[ω]ω\mathcal{X}\subseteq [\omega]^{\omega}, where [ω]ω[\omega]^{\omega} is endowed with the metric topology, each infinite subset XωX\subseteq \omega contains an infinite subset YXY\subseteq X such that [Y]ω[Y]^{\omega} is either contained in X\mathcal{X} or disjoint from X\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.Comment: Substantially revised exposition. Statements of theorems are now in optimal form. All proofs remain the sam

    Similar works

    Full text

    thumbnail-image

    Available Versions