Finite Ramsey degrees and Fra\"iss\'e expansions with the Ramsey property
Lionel Nguyen Van Th\'e

TL;DR
This paper offers a new proof, using classical Fra"iss"e theory, that structures with finite Ramsey degrees can be expanded to have the Ramsey property, simplifying previous dynamic-based methods.
Contribution
It provides an alternative proof for the existence of Fra"iss"e expansions with the Ramsey property, avoiding ultrafilter dynamics.
Findings
New proof based on classical Fra"iss"e tools
Establishes existence of expansions with Ramsey property
Simplifies previous dynamic-based approach
Abstract
By a result of Zucker, every Fra\"iss\'e structure for which the elements of have finite Ramsey degrees admits a Fra\"iss\'e precompact expansion whose age has the Ramsey property. While the original method uses dynamics in spaces of ultrafilters, the purpose of the present short note is to provide a different proof, based on classical tools from Fra\"iss\'e theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Limits and Structures in Graph Theory
Finite Ramsey degrees and Fraïssé expansions with the Ramsey property
Lionel Nguyen Van Thé
Aix Marseille Univ, CNRS, Centrale Marseille, I2M UMR 7373, 13453 Marseille, France
(Date: May 2017)
Abstract.
By a result of Zucker, every Fraïssé structure F for which the elements of have finite Ramsey degrees admits a Fraïssé precompact expansion whose age has the Ramsey property. While the original method uses dynamics in spaces of ultrafilters, the purpose of the present short note is to provide a different proof, based on classical tools from Fraïssé theory.
Key words and phrases:
2010 Mathematics Subject Classification:
Primary: 05D10 ; Secondary: 03C15, 54H20.
This work has been partially supported by the GrupoLoco project (ANR-11-JS01-0008) funded by the French Government, managed by the French National Research Agency (ANR)
1. Introduction
Recent works in structural Ramsey theory have largely been influenced by the paper [Kechris05] of Kechris-Pestov-Todorcevic which exhibited a strong connection with topological dynamics. When studying it, it became apparent that of particular interest are those Fraïssé structures F whose elements of have a finite Ramsey degree. (For background and notations, see Section 2.) On the surface, this property is only a slight weakening of the now classical Ramsey property introduced by Nešetřil and Rödl. However, practice suggests that it could be substantially less restrictive, and knowing exactly to which extent this is so remains open, despite the recent progress made on the model theoretic side (for example, Evans proved that -categoricity of F is not sufficient [Evans15]), on the combinatorial side (see [Hubicka16] by Hubička and Nešetřil, where the scope of the main technique to prove the Ramsey property is made broader still) and on the dynamical side (see [Zucker16] by Zucker, [Melleray16] by Melleray-Tsankov-Nguyen Van Thé and [BenYaacov16c] by Ben Yaacov-Melleray-Tsankov).
One method to make sure that a Fraïssé structure F has finite Ramsey degrees is to construct a precompact expansion so that has the Ramsey property. It turns out that every Fraïssé structure with finite Ramsey degrees arises that way:
Theorem** (Zucker [Zucker16]).**
Let F be a Fraïssé structure. TFAE:
- i)
Every element of has a finite Ramsey degree. 2. ii)
The structure F admits a Fraïssé precompact expansion whose age has the Ramsey property, the expansion property relative to , and is made of rigid elements.
The original proof of this result uses topological dynamics in spaces of ultrafilters. The purpose of the present short note is to provide a different proof, based on classical tools from Fraïssé theory as well as some additional results from [NVT13a].
2. Background and notation
The purpose of this section is to introduce the terminology that will be used in order to show the main result of the paper. It is based on [NVT13a], which itself rests on [Kechris05]. The reader will be assumed to have some familiarity with Fraïssé theory. Given a first order language , the age of a countable -structure F is the class of all of its finite substructures (up to isomorphism). The structure F itself is a Fraïssé structure when it is countable, every finite subset of F generates a finite substructure of F (F is locally finite), and every isomorphism between finite substructures of F extends to an automorphism of F (F is ultrahomogeneous). Given structures A, B, C in that language, write when A and B are isomorphic, and define the set of all copies of A in C as
[TABLE]
Given a class of -structures, has a finite Ramsey degree (in ) when there exists an integer such that for every , every , there exists such that for every map (usually referred to as a -coloring of ) there is such that takes at most -many colors on . When for some Fraïssé structure F, this is equivalent to the fact that for every -coloring of , there is such that takes at most -many colors on . When in addition for every , has the Ramsey property.
Consider now an expansion of with at most countably many relational symbols. Say that an expansion of in is precompact when any only has finitely many expansions in . Similarly, say that a Fraïssé structure is a precompact expansion of F when is a precompact expansion of . Finally, say that satisfies the expansion property relative to if, for every , there exists such that every expansion of A in embeds in every expansion of B in .
3. Proof of the main result
With the terminology of the previous section in mind, we are now ready to provide a proof of Zucker’s theorem using classical techniques. The implication is obvious so we concentrate on . The first step makes use of an ingenious technique due to Kříž in [Kriz91]:
Definition 1**.**
Let .
For , say that B is -A-Ramsey when for every , and every -coloring of , there exists such that takes at most -many values on .
For an equivalence relation on , say that B is -A-Ramsey when for every , -coloring of , there exists an embedding such that:
[TABLE]
Lemma 1**.**
Let , . Assume that B is -A-Ramsey. Then B is -A-Ramsey for some equivalence relation on with at most -many classes.
Proof.
Let denote the (finite) set of all equivalence relations on with at most -many classes. We assume that B is not -A-Ramsey for any , and show that B is not -A-Ramsey.
By assumption, for every , there exists and witnessing that B is not -A-Ramsey, i.e. for every embedding , there exist in such that .
Let be the finite coloring defined by .
We claim that for every , takes at least -many values on . Let an embedding such that . Define on by:
[TABLE]
By construction of , disagrees with each on at least one pair of elements of . It follows that , as required. ∎
Writing the Ramsey degree in , it follows that every is -A-Ramsey for some equivalence relation on with at most -many classes.
Lemma 2**.**
For every , there is an equivalence relation on with at most -many classes such that every finite substructure B of F is -A- Ramsey. (where denotes the restriction of to .)
Proof.
Write and let denote the substructure of F supported by . By Lemma 1, each is -A-Ramsey for some equivalence relation on with at most -many classes. Observe that if , then is also -A- Ramsey. Thus, the set becomes a finitely branching tree when equipped with the relation
[TABLE]
By König’s lemma, this tree admits an infinite branch, whose union is of the form . The relation as required. ∎
From that point on, the proof makes use of several results from [NVT13a]. For each , we now add predicates, , one for each equivalence class of . Write for the family where A ranges over and . Note that every element of only has finitely many expansions in . Next, let be a linear ordering on F, and consider the logic action of on the compact space
[TABLE]
Pick with minimal orbit closure in that space. Then, is a linear ordering on F, and writing , the family is a partition of for every . Let .
Lemma 3**.**
Let . Then A has at least -many expansions in .
Proof.
Let witness the fact that is the Ramsey degree of A in . This means that there is taking at least -many values on whenever . Let . Because , we have (see [NVT13a]*Proposition 6). It follows that if denotes the equivalence relation induced on by , then is -A-Ramsey. Hence, there is an embedding such that the value of depends only on the -class of in . By choice of , it follows that is made up of at least many -classes. In other words, at least -many expansions of A appear in the substructure of supported by . This is valid for every copy of B in F, so every expansion of B in contains at least -many expansions of A. As a result, this is also the case for every expansion of B in , and A has at least -many expansions in . ∎
Clearly, has the hereditary property and the joint embedding property. It has the expansion property relative to because has minimal orbit closure (see [NVT13a]*Theorem 4). By the previous lemma, every has a finite Ramsey degree in whose value is at most the number of non-isomorphic expansions of A in . According to [NVT13a]*Proposition 8, these conditions guarantee that has the Ramsey property, and is therefore a Fraïssé class. As such, it has a Fraïssé limit, which we write . To finish the proof, it suffices to show that is an expansion of F.
Lemma 4**.**
The structure is an expansion of F.
Proof.
It suffices to show that the reduct of to the language of F is Fraïssé. Indeed, , so will follow.
To show that is Fraïssé, following [Kechris05]*5.2, it suffices to show that has the following reasonability property: For every embedding between elements of , and every expansion of A in , there exists an expansion of B in so that induces an embedding from to .
Let us first check that this condition is sufficient. Let be an inclusion embedding between finite substructures of , and be an embedding. Then supports a substructure of , and this can be pulled back to A to define an expansion of A in . By reasonability, expand B to so that induces an embedding from to , as required. Because is Fraïssé, extends to , which induces extending .
We now show that the reasonability property holds. Let be an embedding between elements of , and an expansion of A in . Because , we can find a substructure of isomorphic to ; call it , and let be an isomorphism. Then induces an isomorphism from A to , and by ultrahomogeneity of F, there is such that . Then supports in an expansion of B. Pulling this back to B via , we see that is as required. ∎
Acknowledgements
I am grateful to András Pongrácz, whose sharp eye caught a gap in the first proof of the main result of this paper, and to Claude Laflamme and Andy Zucker, for their comments on the first draft. I would also like to express my gratitude to Jan Hubička and Jaroslav Nešetřil for their invitation to lecture at the Ramsey DocCourse and publish this work.
References
