
TL;DR
This paper explores the relationship between big Ramsey degrees in Fra"iss"e structures and the topological dynamics of their automorphism groups, introducing the concept of big Ramsey structures and their implications for universal flows.
Contribution
It introduces the notion of big Ramsey structures and demonstrates their role in establishing unique universal completion flows for automorphism groups.
Findings
Existence of big Ramsey structures implies a unique universal completion flow.
Connections established between big Ramsey degrees and topological dynamics.
Discussion on conditions for the existence of big Ramsey structures.
Abstract
We consider Fra\"iss\'e structures whose objects have finite big Ramsey degree and ask what consequences this has for the dynamics of the automorphism group. Motivated by a theorem of D. Devlin about the partition properties of the rationals, we define the notion of a big Ramsey structure, a single structure which codes the big Ramsey degrees of a given Fra\"iss\'e structure. This in turn leads to the definition of a completion flow; we show that if a Fra\"iss\'e structure admits a big Ramsey structure, then the automorphism group admits a unique universal completion flow. We also discuss the problem of when big Ramsey structures exist and explore connections to the notion of oscillation stability defined by Kechris, Pestov, and Todor\v{c}evi\'c
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.
Big Ramsey degrees and topological dynamics
Andy Zucker
Abstract
We consider Fraïssé structures whose objects have finite big Ramsey degree and ask what consequences this has for the dynamics of the automorphism group. Motivated by a theorem of D. Devlin about the partition properties of the rationals, we define the notion of a big Ramsey structure, a single structure which codes the big Ramsey degrees of a given Fraïssé structure. This in turn leads to the definition of a completion flow; we show that if a Fraïssé structure admits a big Ramsey structure, then the automorphism group admits a unique universal completion flow. We also discuss the problem of when big Ramsey structures exist and explore connections to the notion of oscillation stability defined by Kechris, Pestov, and Todorčević [10]. ††2010 Mathematics Subject Classification. Primary: 22F50; Secondary: 03C15, 03E02, 03E75, 05D10, 37B20, 54D80, 54H20. ††Key words and phrases. Fraïssé theory, Ramsey theory, topological dynamics, topological semigroups. ††The author was partially supported by NSF Grant no. DGE 1252522.
1 Introduction, main definitions, and statements of theorems
Consider the statement of Ramsey’s theorem: for every , we have
[TABLE]
This “arrow notation” is shorthand for the following statement: for any coloring , there is an infinite so that . We often say that is monochromatic for . Ramsey’s theorem can be generalized in many directions. Erdős and Rado [4] considered coloring finite tuples from larger cardinals while demanding larger monochromatic sets. Galvin and Prikry [7], and later Ellentuck [3], considered suitably definable colorings of the infinite subsets of .
The generalization that we will consider in this paper is that of structural Ramsey theory. As a warmup, we will consider the structure of rationals and their linear order. In what follows we will just write . Let us call a subset a dense linear order, or DLO for short, if the ordering on inherited from is dense and contains no maximum or minimum. Note that we do not require that is dense in , nor do we require that is unbounded in . Let us write
[TABLE]
for the statement that for any coloring , there is a DLO which is monochromatic for . While this is a natural sounding generalization of Ramsey’s theorem, it has the downside of being false. Consider a coloring produced as follows: fix an enumeration , which we can consider as a new enumeration order on top of the standard rational order. Now given a pair of rationals, we can ask whether the enumeration order on and agrees or disagrees with the rational order, and we set accordingly. It is not hard to see that no DLO subset is monochromatic for , and therefore .
Remarkably, this counterexample is in a strong sense the worst possible. Galvin [6] proved that for every , the following statement holds:
[TABLE]
This means that for every coloring , there is a DLO subset so that ; we call such an -chromatic for . The proof of this statement uses a Ramsey theorem for trees proved by Milliken [14], which in turn is a generalization of the Halpern-Läuchli theorem. Denis Devlin [2] in his thesis pushed Galvin’s theorem as far as possible. For each , he found the exact number so that for any number of colors , we have
[TABLE]
So for any coloring , there is some DLO which is -chromatic for , but there is a coloring so that each color class is unavoidable, i.e. each color class meets every DLO subset of . We say that is the big Ramsey degree of any -element substructure of . The sequence is given by the odd tangent numbers, the sequence of numbers which describes the Taylor series for the tangent function.
Let us consider . The strategy we used to construct an unavoidable -coloring of also works to produce an unavoidable -coloring of . However, it turns out that . We need to work a bit harder to produce an unavoidable -coloring, but the strategy is similar; we introduce some extra relational symbols on top of and then color a triple of rationals based on the expanded structure it receives. The structure not only works to produce an unavoidable -coloring of , but enjoys a much stronger property. For any , let be the map sending a -tuple to the structure inherited from . Then is an unavoidable -coloring. We call a big Ramsey structure for ; these will be the central objects of study in this paper.
In order to state the formal definitions in full generality, we need some background on first-order structures. A relational language is a set of relational symbols; each symbol comes with a finite arity . All languages in this paper will be relational. Given a language , an -structure is a set along with an interpretation of each symbol in . We will use boldface for structures and lightface for the underlying set unless otherwise specified. If and are -structures, an embedding is any injective map so that for each and each -tuple , we have
[TABLE]
Write for the set of embeddings from to , and write if . If , then we write if the inclusion map is an embedding. An isomorphism is a bijective embedding, and an automorphism is an isomorphism from a structure to itself. We write for , and we write for the group of automorphisms of . A structure is finite or countable if the underlying set is, and we write .
If is a countable -structure, we write . A countable structure is called a Fraïssé structure if for any finite and embedding , there is with . Two facts are worth pointing out, both due to Fraïssé [5]. First, if is a Fraïssé structure, then is a Fraïssé class; this is any class of -structures with the following four properties.
contains only finite structures, contains structures of arbitrarily large finite cardinality, and is closed under isomorphism. 2. 2.
has the Hereditary Property (HP): if and , then . 3. 3.
has the Joint Embedding Property (JEP): if , then there is which embeds both and . 4. 4.
has the Amalgamation Property (AP): if and and are embeddings, there is and embeddings and with .
Second, if is a Fraïssé class, there is up to isomorphism a unique Fraïssé structure with . We call the Fraïssé limit of and write .
Definition 1.1**.**
Let be a Fraïssé structure with . Let , and let . The statement
[TABLE]
says that for any coloring , there is with
. 2. 2.
With notation as above, we say that has big Ramsey degree if is least so that for every , we have . 3. 3.
We say that has finite big Ramsey degree if has big Ramsey degree for some .
For example, we saw earlier that if is the class of finite linear orders and , then the big Ramsey degree of the -element linear order is the -th odd tangent number. We also built a “big Ramsey structure” which somehow captured the correct big Ramsey degree for every finite substructure of . Definition 1.3 is one of the central definitions of this paper.
Definition 1.2**.**
Let be a set, and let be an -structure. Let be injective. Then is the unique -structure with underlying set so that is an embedding.
Definition 1.3**.**
Let be a Fraïssé -structure with . We say that admits a big Ramsey structure if there is a language and an -structure so that the following all hold.
. 2. 2.
Every has finitely many -expansions to a structure ; denote the set of expansions by . 3. 3.
Every has big Ramsey degree . 4. 4.
The function given by witnesses the fact that the big Ramsey degree of is not less than .
Call a structure satisfying (1)-(4) a big Ramsey structure for .
We will see that big Ramsey structures give rise to various new dynamical objects. In particular, we will define the notion of a completion flow and show that big Ramsey structures imply the existence of a universal completion flow. In order to define these objects, we need some background in topological dynamics.
Let be a Hausdorff topological group. A (right) -flow is a compact Hausdorff space equipped with a continuous right action . When the action is understood, we will write or instead of . A -ambit is a pair where is a -flow and is a point with dense orbit. A pre-ambit is any -flow containing a point with dense orbit. In the literature, these are often called point transitive, but the name “pre-ambit” will be more suggestive going forward.
If and are -flows, a -map or map of flows is a continuous map so that for any and , we have . If and are ambits, then a map of ambits is a -map so that . While there may be many -maps from to , there is at most one map of ambits from to . Also notice that any map of ambits is surjective.
Each topological group comes equipped with several compatible uniform structures, including the left uniformity. A typical member of the left uniformity is a set of the form , where is an open symmetric neighborhood of the identity. This will be the only uniform structure we place on for now. A net from is called Cauchy if for every symmetric open containing the identity, there is so that for every , we have . Just like metric spaces, every uniform space admits a completion. We let denote the left completion of ; then enjoys the structure of a topological semigroup. Now if is a -flow, there is a unique extension of the -action to making continuous.
Definition 1.4**.**
Let be a -flow. A point is called a completion point if for every , has dense orbit. The flow is called a completion flow if contains a completion point; the ambit is called a completion ambit if is a completion point of . 2. 2.
A completion flow is called universal if for any other completion flow , there is a surjective -map .
If is a Fraïssé structure, then becomes a topological group when endowed with the topology of pointwise convergence. A typical open neighborhood of the identity is a set of the form , where is some finite subset. The left completion is the semigroup , which we also endow with the topology of pointwise convergence.
For , there are two types of -flows we will often consider. The first is a space of colorings. If , then acts on the set on the left by composition. Now let , and form the space of -colorings of endowed with the product topology. If and , then we define by setting .
The second type of -flow is a space of structures. Let be a language (not necessarily the same language that is in). Let the space of -structures on the set . We give the logic topology, where a typical open set of structures is of the form , where is some finite -structure and is some injection. If and , we define as follows. Let be an -ary relation symbol. If , then we set iff holds. In this level of generality, may not be compact, but the various subspaces of we discuss will always be compact. When speaking about structures in a space of structures, we will often break with our notational convention of using boldface.
Definition 1.5**.**
Let be a Fraïssé -structure, and let be a big Ramsey structure for in a language . Form the space of -structures on , and let be the orbit closure of . We call any ambit isomorphic to a big Ramsey ambit, and we call the underlying flow a big Ramsey flow.
If is a big Ramsey structure and , then is a completion point of (see Proposition 5.1), so every big Ramsey flow is a completion flow.
Before stating the main theorems of this paper, a discussion of the history and motivation is in order. A very fruitful direction of research for the past 15 years has been the interaction between the combinatorics of Fraïssé structures and the dynamical properties of their automorphism groups. One of the first efforts in this direction was due to Pestov [19], where he proved that the group is extremely amenable, meaning that every flow admits a fixed point. His proof makes crucial use of the finite version of Ramsey’s theorem. Kechris, Pestov, and Todorčević [10] then showed that in a very strong sense, the fact that is extremely amenable is actually equivalent to the finite Ramsey theorem. If is a Fraïssé structure, , and , write
[TABLE]
for the statement that for every coloring , there is so that . We say that has small Ramsey degree if is least so that for every with and every , the statement (1) holds. We say that is a Ramsey object if has small Ramsey degree . The first major theorem in [10] states that is extremely amenable iff every is a Ramsey object.
If is a topological group, a -flow is called minimal if every orbit is dense. A minimal flow is called universal if it admits a -map to any other minimal flow. Every topological group admits a universal minimal flow, or UMF, which is unique up to isomorphism. The second major result of [10], which was generalized to the form given here in [18], provided a construction of the UMF of in several cases. Very roughly, if is a Fraïssé -structure, this construction proceeds by exhibiting a Fraïssé expansion in some languange satisfying several conditions. If this can be done, then form the space of -structures on , and let be the orbit closure. Then is the universal minimal flow of . One feature of this construction is that if it can be done, then each must have finite small Ramsey degree.
The current author in [23] then showed that the construction of universal minimal flows in [10] and [18] is in a sense the only one possible and characterized exactly when it could be carried out. It turns out that if is a Fraïssé structure and each has finite small Ramsey degree, then the construction from [10] and [18] is possible. Furthermore, this characterizes exactly when has metrizable UMF.
The main goal of this paper is to attempt to carry out a similar analysis in regards to big Ramsey degree. If and contains all objects of finite big Ramsey degree, does this correspond to having a “nicely described” metrizable universal object in some category of dynamical systems? And can this universal object be described as a space of structures?
Our main theorem is the following.
Theorem 1.6**.**
Let be a Fraïssé structure which admits a big Ramsey structure, and let . Then any big Ramsey flow is a universal completion flow, and any two universal completion flows are isomorphic.
The proof of Theorem 1.6 introduces new techniques in abstract topological dynamics which seem interesting in their own right. In particular, we will define the notion of strong maps between pre-ambits and see that the category of pre-ambits and strong maps enjoys a rich structure. However, there is still much we do not know about completion flows. In particular, the following fundamental question remains open: if is a topological group, does admit a unique universal completion flow?
Theorem 1.6 makes it important to know when a Fraïssé structure admits a big Ramsey structure. An obvious necessary condition is that every have finite big Ramsey degree. Whether or not this is sufficient seems to be a difficult question; we will discuss the key difficulties in section 4. Rather strangely, when is Roelcke precompact, we can say quite a bit about what the big Ramsey ambit should look like if it exists. In particular, we can describe exactly what the age of any big Ramsey structure should be, and we can show that any big Ramsey flow must contain a generic orbit.
The possible gap between having finite big Ramsey degrees and admitting a big Ramsey structure also suggests a useful weakening of the notion of oscillation stability defined in [10]. We will precisely define this notion later, but if and , then is oscillation stabile iff each object in has big Ramsey degree one. By a deep theorem of Hjorth [9], this notion is vacuous for Polish groups; no Polish group can be oscillation stable.
The weakening we propose is as follows; call a topological group completely amenable if admits no non-trivial completion flows. So any completely amenable group is also extremely amenable. The example of shows that the converse does not hold. We will see that if a topological group is oscillation stable, then is completely amenable. However, the converse is not known. The difficulty is similar in nature to the difficulty in showing that for a structure , having finite big Ramsey degrees implies that admits a big Ramsey structure. Therefore the question of whether any Polish group is completely amenable has content.
This paper is organized as follows. Section 2 contains background on compact left-topological semigroups, Samuel compactifications, and automorphism groups of Fraïssé structures. The construction of the Samuel compactification of given in section 2.3 is essential for the rest of the paper. Section 3 defines the lift of an ambit and shows that this lift only depends on the underlying flow. Section 4 contains a variety of combinatorial results about unavoidable colorings. Section 5 uses the ideas of sections 3 and 4 to prove Theorem 1.6. Section 6 contains examples of groups with universal completion flows
After section 6, the nature of the paper changes considerably. Section 7 addresses the question of whether or not big Ramsey structures exist. While the question in general remains open, a number of results are proven which describe what the big Ramsey flow must look like should it exist.
The final section, Section 8, discusses connections to oscillation stability and gathers a list of relevant open questions.
There is also an appendix which contains the proof of Theorem 7.1, an intuitive result with a cumbersome proof.
Acknowledgements
I thank Clinton Conley and James Cummings for helpful discussions, and I thank Lionel Nguyen Van Thé and Jean Larson for pointing me to several examples. I also thank Stevo Todorčević for suggestions on an earlier version of this paper.
2 Background
2.1 Compact left-topological semigroups
An excellent reference on compact left-topological semigroups is the first two chapters of the book by Hindman and Strauss [8]. Readers should note however the left-right switch between that reference and the presentation here.
Let be a semigroup. If , let and denote the left and right multiplication maps, respectively. A non-empty semigroup is a compact left-topolgical semigroup if is also a compact Hausdorff space so that for every , the map is continuous. Given and a subset , we often write and . A right ideal (respectively left ideal) of a semigroup is a subset so that for every , we have (respectively ). An idempotent is any element with .
We will freely use the following facts throughout the paper. In the following, denotes a compact left-topological semigroup.
Fact 2.1**.**
- •
(Ellis-Numakura) contains an idempotent.
- •
If is idempotent and , then . If , then .
- •
Every right ideal contains a closed right ideal; namely if , then is closed and a right ideal. Then by Zorn’s lemma, every right ideal contains a minimal right ideal which must be closed. Every minimal right ideal is a compact left-topological semigroup, so contains an idempotent.
- •
contains minimal left ideals. If is a minimal right ideal and , then is a minimal left ideal. The intersection of any minimal right ideal and any minimal left ideal is a group, hence contains exactly one idempotent.
- •
If and are minimal right ideals and , then there is with an idempotent.
2.2 The Samuel compactification
An excellent reference on the Samuel compactification is Samuel’s original paper [20]. For a more modern presentation focused on topological groups, see Uspenskij [22]. For more on the greatest ambit and topological dynamics, see Auslander [1].
Let be a Hausdorff uniform space. The Samuel compactification of is a compact Hausdorff space along with a uniformly continuous map satisfying the followin universal property: if is any compact Hausdorff space and is uniformly continuous, then there is a unique map making the diagram commute.
X$$Y$$S(X)$$f$$i$$\tilde{f}
The map is always an embedding, so we often identify with its image in and use the term “Samuel compactification” to just refer to the space .
We will be primarily interested in the Samuel compactification of a topological group equipped with its left uniformity. In this case, there is a quick, albeit uninformative, construction of . Let be a set of -ambits. Form the product ; this is a -flow with acting on each coordinate. Now let , and let be the orbit closure. Then is an ambit, and the projection onto coordinate is a map of ambits from to . Suppose that we started with a set of ambits containing a representative of each isomorphism type of ambit; this is possible because there are only set-many compact Hausdorff spaces with a dense set of size at most , and only set-many possible -flow structures to place on each one. Then the ambit admits a map of ambits onto any other -ambit. The point with dense orbit in is just the identity of upon identifying with a subset of . The ambit is often called the greatest ambit for .
The universal property allows us to endow with the structure of a compact left-topological semigroup. If , then is an ambit, so let be the unique map of ambits. The notation is deliberately suggestive; we define this to be the left multiplication map, i.e. for , we set . It is routine to check that this multiplication is associative, and left multiplication is continuous by definition.
We can also use the universal property to have act on -flows. If is a -flow and , then is an ambit; let be the unique map of ambits. If , we then set . This extended action behaves nicely with the semigroup structure on ; if and , we then have .
We end this subsection with a simple lemma about subflows of . If is a pre-ambit, it makes sense to ask about the semigroup properties of points with . In particular, if some point with dense orbit is an idempotent, this has consequences for the dynamics of
Proposition 2.2**.**
Let be a pre-ambit, and assume there is an idempotent with dense orbit. Then if is a -map, then .
Proof.
First note that . Fix . Then by Fact 2.1. So . ∎
2.3 Fraïssé structures and Samuel compactifications
For a more detailed exposition of both the notational conventions developed here and the construction of for , see [23].
For this subsection, fix a Fraïssé structure with . An exhaustion of is a sequence with , , and . When we write , we will assume that is an exhaustion unless otherwise specified. We also assume . For the rest of this subsection, fix an exhaustion of . Let denote the inclusion embedding.
Let . As a shorthand notation, write and . In particular, we have . Also, for any , we have . Notice that acts on on the left by postcomposition. Since is a Fraïssé structure, this action is transitive. We will often write for .
Each gives rise to a dual map given by precomposition, i.e. if , we have . The notation is slightly imprecise, since the range of must be specified to know the domain of the dual map, but this will typically be clear from context. The following basic facts record the properties of dual maps we will use.
Proposition 2.3**.**
**
For , the dual map is surjective. 2. 2.
For every , there is with .
Proof.
For the first item, fix , and let . Find with . Then by definition, we have .
For the second item, fix . Find with . Then we have . ∎
Our main goal for this subsection is to construct and write down an explicit formula for its semigroup multiplication. The construction will require “glueing together” spaces of ultrafilters, so we briefly discuss ultrafilters and the Čech-Stone compactification.
Let be a set. A collection is called an ultrafilter if the following conditions are met.
- •
and
- •
If and , then .
- •
If and , then .
- •
If , then either or .
If only satisfies the first three items, then is called a filter. By Zorn’s lemma, maximal filters exist, and the maximal filters on coincide with the ultrafilters on .
Write for the collection of all ultrafilters on . We endow with a compact Hausdorff, zero-dimensional topology where the typical clopen subset of has the form , where . We can identify as a subset of by identifying each with the ultrafilter . Viewing as a discrete space, the inclusion is called the Čech-Stone compactification of . It satisfies the same universal property as the Samuel compactification of when is given the discrete uniformity. To be explicit, if is any map from to a compact Hausdorff space , there is a unique continuous map making the following diagram commute.
X$$Y$$\beta X$$f$$i$$\tilde{f}
If is a closed subspace, then the collection is a filter on . Conversely, if is a filter on , then is a closed subspace. Given a closed , we have , and if is a filter on , we have . The following fact will be essential going forward. A proof can be found in [8].
Fact 2.4**.**
If is a closed, metrizable subspace, then is finite.
We now turn to the construction of . The main idea of the construction is to view the sets as discrete spaces and consider their Čech-Stone compactifications. Let . Then the dual map extends uniquely to a continuous map . Given , we often write .
Form the inverse limit of the spaces along the maps . This is also a zero-dimensional compact Hausdorff space. Let be the projection onto the -th coordinate; then a typical clopen neighborhood is of the form , where and . We have the following fact due to Pestov [19].
Fact 2.5**.**
From now on, we will identify with . We now proceed to exhibit the right -action on which makes the greatest ambit. This might seem unnatural at first; after all, the left -action on each extends to a left -action on , giving us a left -action on . However, this left -action isn’t continuous when is given its pointwise convergence topology. The right action we describe doesn’t operate on any one ; the various “levels” of the inverse limit will interact with each other in our definition.
For , we often write for .
Definition 2.6**.**
Given and , we define by setting , where is large enough so that . More explicitly, if , , , and , we have
[TABLE]
where is suitably large.
From the definition, we see that this right action is continuous. We embed the left completion into by identifying with the element of with . By regarding as a subset of , we now have the following fact from [23]
Fact 2.7**.**
equipped with the above right action is the greatest -ambit.
We can also write explicitly the left-topological semigroup structure on . Fix . If and are both suitably large, we see that , and we simply write . We write for the map . Notice that is continuous.
The map from to sending to has a unique continuous extention. We denote this extension by , while often writing . More explicitly, if and , we have
[TABLE]
Given and , a useful shorthand is to put . Then we can write iff .
The notation is deliberately suggestive, as this will be the left multiplication by “restricted to level .” If and in , we define by setting , and we write for the map semding to . To check that this operation is the semigroup operation discussed abstractly in the previous subsection, it suffices to prove the following proposition.
Proposition 2.8**.**
Fix . Then is a -map with .
Proof.
By definition is continuous. Fix and . Fix a net with . As the map is continuous, we have . Then as is continuous, we have . But , so once more by continuity of the maps and , we have . It follows that as desired. That is clear. ∎
We end this subsection by recording some basic facts about metrizable subspaces and subflows of . If is metrizable, then so is for every . Fact 2.4 immediately yields the following.
Fact 2.9**.**
is metrizable iff is finite for each .
In the same vein as Proposition 2.2, we can ask about pre-ambits containing an idempotent with dense orbit. In the case , we can say more.
Proposition 2.10**.**
Let be a metrizable pre-ambit, and assume there is an idempotent with dense orbit. If is a surjective -map, then is an isomorphism.
Proof.
By Proposition 2.2, we have . Then the map must be surjective. Since is finite, must be a bijection. It follows that is a bijection, hence an isomorphism. ∎
3 Lifts of ambits and pre-ambits
This section contains most of the dynamical content needed in the proof of Theorem 1.6. We actually develop more than what we will need and in greater generality, since the techniques presented here seem interesting in their own right. Throughout this seciton, let be a Hausdorff topological group, and let denote its left completion.
Definition 3.1**.**
Let be a pre-ambit. The ambit set of is the set . 2. 2.
Let and be pre-ambits. A -map is called strong if for any , we have
Whenever we refer to strong maps, we will always assume that the domain and range are pre-ambits. It is worth pointing out that any strong map between pre-ambits must be surjective. Notice that if is any surjective -map between pre-ambits, then implies that . It is the reverse implication that makes strong maps useful. The following easy proposition hints at why this notion will be useful going forward.
Proposition 3.2**.**
Let be a completion flow, and let be a strong -map. Then is a completion flow.
Proof.
Let be a completion point. Pick with . We claim that is a completion point. Let . Then , so . ∎
The following definition will be our main source of strong maps. Recall that if is an ambit, we write for the unique map of ambits from .
Definition 3.3**.**
Let be an ambit.
The fixed point semigroup of is . It is a closed subsemigroup of , hence a compact, left-topological semigroup in its own right. 2. 2.
A lift of is any subflow which is minimal subject to the property that .
Notice that since is compact, Zorn’s lemma ensures that any ambit admits a lift. The next lemma records some simple observations about lifts.
Lemma 3.4**.**
Let be an ambit, and let be a lift of .
* is a strong -map.* 2. 2.
* is a minimal right ideal of .*
Proof.
For item (1), first note that is surjective since . Let be a point with . Then there is with . Then , so in particular . By the minimality property of lifts, we must have , so is a transitive point.
For item (2), certainly is a right ideal of , so suppose is a minimal right ideal of , and let . By the minimality property of lifts, we must have . Suppose . Then , so . It follows that , so . ∎
The next two propositions show that the choice of lift doesn’t matter. The first shows that any two lifts are isomorphic, and the second limits the nature of -maps between lifts.
Proposition 3.5**.**
Let be an ambit, and let be two lifts of . Then and are isomorphic over , i.e. there is an isomorphism so that the following diagram commutes.
Y_{0}$$Y_{1}$$X$$\psi$$\varphi_{x_{0}}$$\varphi_{x_{0}}
Proof.
Write . Then each is a minimal right ideal of by item (2) of Lemma 3.4. Let be an idempotent. Then the left multiplication is an isomorphism of right ideals of . Using Fact 2.1, let be an idempotent in the same minimal left ideal of as . Then and . It follows that is an isomorphism with inverse . To check that the diagram commutes, let . Then for some . Then . ∎
Proposition 3.6**.**
Let be an ambit, and let be two lifts of . Let be a surjective -map making the diagram from Proposition 3.5 commute. Then is an isomorphism.
Proof.
Once again, write . Each is a minimal right ideal of . Let be an idempotent. Then by Proposition 2.2. As , use Fact 2.1 to find with an idempotent. Since , we have , so in particular, is the identity map on . It follows that is an isomorphism. ∎
We have shown that the lift of any ambit is canonical in the sense of Proposition 3.5. Remarkably, the lift of any pre-ambit is also canonical; if is a preambit and , then the lifts of the ambits and will be isomorphic as well. The rest of this section is spent proving this fact; it will not be needed in the proof of Theorem 1.6, but these ideas will be used in section LABEL:RPLiftSection.
If and are pre-ambits and is a strong map, we call a strong extension of . A strong extension is called universal if given any other strong extension , there is a strong map with .
Y_{0}$$Y_{1}$$X$$\varphi$$\psi_{0}$$\psi_{1}
If and are two strong extensions, we say that and are isomorphic over if there is an isomorphism with .
Theorem 3.7**.**
Let be a pre-ambit. Then there is a universal strong extension . Any two universal strong extensions are isomorphic over .
We call the pre-ambit given by Theorem 3.7 the universal strong extension of . We have previously used the notaion to denote the Samuel compactification, but the context should always be clear. The next two propositions will prove Theorem 3.7. The first produces a universal strong extension of any pre-ambit, and the second shows uniqueness.
The following notation will be useful. If is an ambit, we let be a lift of .
Proposition 3.8**.**
Let be a pre-ambit, and let . Then is a universal strong extension.
Proof.
Let be a pre-ambit, and fix a strong map . Pick with . Then , and . So we may assume that .
We will show that . Using the minimality property of lifts, it suffices to show that . Let , towards showing that . First note that . Then . Since is strong, we have .
Putting everything together, we now have , and is a strong map with . ∎
Proposition 3.9**.**
Let be a pre-ambit. Then any two universal strong extensions are isomorphic over .
Proof.
Let , and form . Suppose that were another universal strong extension. By using the universal property of each map and composing, we obtain a strong map with . It is enough to note that must be an isomorphism, and this follows by Proposition 3.6 ∎
4 Sets and colorings
This section covers the combinatorial content needed going forward. Fix a Fraïssé structure . Set , and let be the left completion. Recall that we have set and
In the introduction, we saw that if , then , the space of -colorings of , has a natural -flow structure. The case deserves a special mention, as we will freely identify with its characteristic function . If and , we have , where . It is helpful to think of as defining a “copy” of inside , and the operation “zooms in” on that copy. For example, if , then .
Recall from subsection 2.3 that if and , we set .
Proposition 4.1**.**
If and , we have .
Proof.
Fix , and let be a net with . Then . It follows that eventually iff , so eventually iff . But eventually . ∎
We now define the key combinatorial notions we will need going forward. Many of these notions describe properties that a subset may or may not have. In the spirit of identifying with , we will say that has one of these properties iff has the property.
Definition 4.2**.**
A set is called large if for some , we have . 2. 2.
A set is called unavoidable if is not large. Equivalently, is large if for every , we have . 3. 3.
A set is called somewhere unavoidable if for some , we have unavoidable. 4. 4.
A set is called scattered if is not somewhere unavoidable. 5. 5.
Fix , and let be a coloring. We call an unavoidable -coloring if and for each , we have either empty or unavoidable. We call an unavoidable coloring if is an unavoidable -coloring for some .
Remark*.*
The term “scattered” comes from the theory of linear orders. A linear order is called scattered if does not embed . We can think of points as embeddings of the singleton linear order; if is a single point, then is scattered in the traditional sense iff it is scattered in our sense.
The next few propositions investigate how objects with these properties behave under images and preimages of the dual maps defined in subsection 2.3. Recall that if , we set given by . If , we often write , or just if there is no ambiguity.
Lemma 4.3**.**
Let . Fix . If and , then .
Proof.
[TABLE]
Lemma 4.4**.**
Let . Fix .
Let . Then has any of the properties from Definition 4.2 (1)-(4) iff has the corresponding property. 2. 2.
Let . If has any of the properties from Definition 4.2 (1)-(3), then also has the corresponding property. If is scattered, then is scattered.
Proof.
First let be large, and fix with . Then . Conversely, assume is large, and find with . But then . Since is surjective, we must have , so is large.
The statement in part (1) of the lemma for “unavoidable” follows immediately.
Now let be somewhere unavoidable. Find with unavoidable. Then is unavoidable, so is somewhere unavoidable. Conversely, assume is somewhere unavoidable, and find with unavoidable. But , so is unavoidable, and is somewhere unavoidable.
The statement in part (1) of the lemma for “scattered” follows immediately.
Now let . Note that the properties (1)-(3) from Definition 4.2 are closed upwards, while being scattered is closed downwards. Noting that , we are done by part (1) of the lemma. ∎
Corollary 4.5**.**
Let , let , and let be an unavoidable coloring. If , then is also unavoidable.
Corollary 4.6**.**
Let . If and have finite big Ramsey degrees and , respectively, then .
We now turn our attention to colorings. We call a coloring of if for some .
Definition 4.7**.**
Let and be colorings of . We say that refines and write if whenever and , then . Refinement is a pre-order. We say and are equivalent and write if and . Equivalence is an equivalence relation. 2. 2.
Fix . Let be a coloring of , and let be a coloring of . We say that strongly refines and write if for every , we have that . 3. 3.
Let and be colorings of . A product coloring of and is any coloring so that for any , we have iff and . It is unique up to equivalence, so we usually call the product coloring.
Lemma 4.8**.**
Let be an unavoidable -coloring of . Then for every , is also an unavoidable -coloring.
Proof.
Immediate from the definition. ∎
Lemma 4.9**.**
Let and be colorings of with . If , then . If and is a coloring of with , then also .
Proof.
It suffices to prove the first part of the lemma. Fix . Let be a net with . If , then eventually . So eventually , and . ∎
Lemma 4.10**.**
Let be a coloring. Then there is with unavoidable.
Proof.
For each , we define inductively as follows. Set . If and has been determined, consider the coloring . If is unavoidable, set . Otherwise, find so that , and set . Then is unavoidable. ∎
When objects in the Fraïssé class have finite big Ramsey degrees, unavoidable colorings gain quite a bit of structure. In particular, if has big Ramsey degree , this means that is the largest number for which there is an unavoidable -coloring of .
Proposition 4.11**.**
Suppose that has finite big Ramsey degree . Let be any coloring of , and let be an unavoidable -coloring of . Then there is so that .
Proof.
Form the product coloring . Use Lemma 4.10 to find with unavoidable. By Lemma 4.8, is an unavoidable -coloring, and by Lemma 4.9,
. Since is the big Ramsey degree, we must have . Then as desired. ∎
Corollary 4.12**.**
Let . Suppose that has finite big Ramsey degree . Let be any coloring of , and let be an unavoidable -coloring of . Then there is with .
As promised in the introduction, we now discuss why having finite big Ramsey degrees doesn’t necessarily show that admits a big Ramsey ambit. To illustrate this difficulty, let us consider some key differences between the study of small Ramsey degrees and big Ramsey degrees. Much as lower bounds to big Ramsey degrees are witnessed by unavoidable colorings, the lower bounds to small Ramsey degrees are witnessed by syndetic colorings. If is a -coloring of , we call syndetic if for some and every , we have .
In general, we cannot strenthen Lemma 4.8 to say that if is an unavoidable -coloring of and , then is also an unavoidable -coloring. However, this does hold for syndetic colorings; if is a syndetic -coloring of and , then is also a syndetic -coloring of .
Now suppose each has finite big Ramsey degree . Using Corollary 4.12, for any , we can find unavoidable -colorings of for each so that whenever . However, for to admit a big Ramsey structure, we need to find unavoidable colorings for every so that whenever (see Theorem 7.1). If each has small Ramsey degree and we wish to do the same with syndetic -colorings of , this is an easy compactness argument precicely because the “strengthened” version of Lemma 4.8 holds for syndetic colorings.
Similarly, suppose there is some so that does not have finite small Ramsey degree. This means that for every , we can find a syndetic -coloring of . Using compactness, it is easy to cook up an “infinite” syndetic coloring, i.e. a partition of into countably many disjoint “syndetic” sets. Such a coloring can then be used to show the existence of a non-metrizable minimal -flow. On the other hand, if does not have finite big Ramsey degree, then for every , there is an unavoidable -coloring. However, it is not clear that there is a partition of into countably many disjoint unavoidable sets, nor is it clear that such a partition yields the existence of a non-metrizable completion flow.
Even though we cannot strengthen Lemma 4.8 in general, there is an important case where we can make such a strenthening.
Proposition 4.13**.**
Let and be unavoidable and colorings of , respectively, with . Let , and assume that is an unavoidable -coloring. Then is an unavoidable -coloring.
Proof.
We may assume that and have range and , respectively. Let be the map so that for and , we have implies . The map induces a -map , where if and , we have . Note that , so since is a -map, we have . Since is unavoidable and , we have that is unavoidable. And since is surjective, we have that is an unavoidable -coloring. ∎
5 Proof of Theorem 1.6
This section culminates with the proof of Theorem 1.6. Along the way, we will need a deeper understanding of the “level-by-level” dynamics of spaces of structures. Throughout this section, fix a Fraïssé -structure which admits a big Ramsey structure in a language . We let be the orbit closure of in the space of -structures on . For each , we let denote the big Ramsey degree of .
We will often refer to “colorings” of whose ranges are finite, but not necessarily contained in ; all the definitions and theorems from the previous section transfer to this more general notion of coloring in the obvious way.
The first easy proposition shows that big Ramsey flows are completion flows.
Proposition 5.1**.**
* is a completion point.*
Proof.
Fix . We need to find with . Let . Since is a big Ramsey structure, we can find with . Let be a cluster point of the . Then as desired. ∎
Recall that is the projection onto level . If is closed, we write . Then we have .
Lemma 5.2**.**
Let be a completion ambit, and let be a lift of . Then is an completion flow, and for every , we have .
Proof.
Write , and fix . Notice that is a completion point of by Proposition 3.2 and by item (1) of Lemma 3.4. Let be given by . Suppose and that is a continuous surjection. Then since is a comletion point, is an unavoidable -coloring, so . In particular, since is zero-dimensional, we must have . ∎
Remark*.*
We didn’t need the big Ramsey structure to prove Lemma 5.2. We only needed the big Ramsey degrees to be finite. So whenever is a Fraïssé structure so that every has finite big Ramsey degree, then every completion flow of is metrizable.
Recall that if is a set, is an -structure and is injective, then is the unique -structure with underlying set so that is an embedding. Also recall that we sometimes break our convention of using boldface for structures when considering points in spaces of structures.
Lemma 5.3**.**
Let , and fix . Let , and let . Then iff .
Proof.
Let be a net with . Then . Since is finite, eventually equals . But also . Therefore we must have . ∎
Definition 5.4**.**
By Lemma 5.3, if , , and , then depends only on . If , we write for the unique expansion with .
Proposition 5.5**.**
Let be a lift of . Then is an isomorphism.
Proof.
By Lemma 5.3, the map sending to is well-defined. Furthermore, since is surjective, must also be surjective, so . By Lemma 5.2 and Proposition 5.1, we must have , and the map is bijective.
Towards a contradiction, assume wasn’t injective, and find with . Find with . But then , a contradiction. ∎
Proof of Theorem 1.6.
Instead of working with , we instead use Proposition 5.5 to work with an isomorphic lift , and let let be the unique point with . Note that is an idempotent and a completion point. By Proposition 2.10, any surjective -map must be an isomorphism. Once we prove that is a universal completion flow, it then follows that any two universal completion flows are isomorphic.
Now let be another completion flow, with a completion point. Using Lemma 5.2, we may assume that with finite for each . For each , let be the coloring given by , and let be the coloring given by . For each , use Proposition 4.11 to find so that for every , we have that .
Since is a completion point, we can find with . Notice that for each , we then have . Let be a cluster point of the sequence . Then for every , we have . By Proposition 4.13, each is an unavoidable -coloring, and . Let be the surjective map so that .
We now show that . Since is an idempotent and by definition of , we have . Then . Since this holds for each , we have as desired.
Consider the -map . To check that is surjective, it suffices to check for each that is surjective. But notice that , and we have seen that the map , i.e. the coloring , is surjective. ∎
6 Examples of universal completion flows
This section brings together some examples of automorphism groups with universal completion flows which can be computed using Theorem 1.6. Unlike the case with small Ramsey degrees, few examples of classes whose big Ramsey behavior has been explicitly described are known, leading to this section being relatively short.
The simplest example of an automorphism group with a metrizable universal completion flow is the group , where is just a countable set with no additional structure. If we let be a subset of size , we see by Ramsey’s theorem that the small Ramsey degree and the big Ramsey degree of are both (recall that we are considering embedding versions of Ramsey degree, so the comes from the automorphisms of ). It follows that the universal minimal flow is the universal completion flow of . This is just the space of linear orders on a countable set. More generally, whenever and is a Fraïssé class where the big and small Ramsey degrees are finite and equal, then is the universal completion flow of . It would be interesting to find other examples of Fraïssé classes where the big and small Ramsey degrees coincide.
6.1 Finite distance ultrametric spaces
Another family of examples are the classes of finite distance ultrametric spaces. Fix with , and let be the class of finite ultrametric spaces with distances from . The big Ramsey behavior of these classes was described by Nguyen Van Thé in [17]. To describe the big Ramsey structure, it is useful to instead work with the class of rooted finite trees of height at most . Structures in are of the form , where is the partial order and is a unary predicate saying that a node is on level of the tree (it should be remarked that this class is not hereditary, but we will discuss Fraïssé classes without HP in the next section). Then is the rooted, countably-branching tree of height . If , then can be identified with the set of leaves of , and . Then we have the following.
Proposition 6.1**.**
Let , where is a linear order in order type which extends the tree order. Then is a big Ramsey structure for .
It follows that , the space of linear orderings on which extend the tree order, is the universal completion flow for . It should be noted that this is not the same space as . Nguyen Van Thé describes in [16]; this is the space of all convex linear orderings on the leaves of . Here, a linear order of the leaves is convex if whenever are leaves with , then the meet of and is an initial segment of .
6.2 The rational linear order
We next consider the example from the introduction, the rational linear order . The group is extremely amenable, but it is not hard to see that admits a non-trivial completion flow; the space of linear orders on is a good example, as for instance any linear order of order type is a completion point. As was mentioned in the introduction, this is not the universal completion flow. A good account of the big Ramsey behavior of can be found in Todorčević’s book [21].
To construct the universal completion flow, first consider the binary tree . If , we set to be the longest common initial segment of both and . We set to be the unique so that . If and , write for the restriction of to domain . We say that and are comparable if either or ; otherwise we say and are incomparable. Define if and are incomparable and , which in the case of the binary tree means and . A subset is an antichain if no two distinct elements of are comparable. Notice that if is an antichain, then is a linear order on .
It is possible to build an antichain so that , and we freely identify with . We now define the -ary relation as follows. If , we set iff . We then have the following.
Proposition 6.2**.**
The structure is a big Ramsey structure for .
We can then interpret the space as a space of total pre-orders on . Let be a total pre-order of , and let be the induced equivalence relation on . Then iff is a linear order, and given , we have , and is -equivalent to the -least of or .
6.3 The random graph
The Random graph, often called the Rado graph, is the Fraïssé limit of the class of all finite graphs. A countable graph is isomorphic to the Rado graph iff for any disjoint and finite , then there is so that for each and for every .
It can be shown that the big Ramsey degree of any finite subgraph of the Rado graph is finite by using Milliken’s tree theorem. To construct a big Ramsey structure, we follow the presentation of Laflamme, Sauer, and Vuksanovic [12]. Once again, we consider the binary tree . We call a subset transversal if for any distinct . If is transversal, we can give a graph structure , where if and , we set iff . Now let be a Rado graph, and fix an enumeration . To each , we associate an element , where for , we set iff .
Theorem 7.6 from [12] now gives us an unavoidable coloring for each finite subgraph. To turn this into a Ramsey structure, we need to perform one extra step. Find a subset of the Rado graph so that is isomorphic to the Rado graph, and so that is an antichain. By doing this, we can ensure that the collection of “non-diagonal” tuples as defined in [12] is empty.
To describe the resulting structure, it will be useful to instead assume that we have mapped into a transversal antichain in which respects the graph structure. With this identification, we now define and the -ary relation as before.
Proposition 6.3**.**
The structure is a big Ramsey structure for the Rado graph .
Similar to the example of the rationals, the space can be described as a space of pairs , where is a linear order of and is a total preorder of . Describing precisely which pairs are in the closure of the big Ramsey structure seems to be somewhat more difficult.
6.4 The orders and the tournament
The last examples we will consider are the dense local order and the orders . The dense local order is a countable tournament, a directed graph where for distinct exactly one of or holds. One way to construct is to consider a countable dense set of points on the unit circle so that no two points are exactly radians apart. Then set iff is less than radians counterclockwise from . Then is isomorphic to .
The big Ramsey behavior of the structure is studied by Laflamme, Nguyen Van Thé, and Sauer in [11]. The trick to analyzing is to instead analyze the structure , where is the rational order, and each is a dense subset of with . The structures are defined similarly; they are rational orders with a distinguished partition into dense pieces. The authors of [11] prove a slight generalization of Milliken’s theorem to obtain big Ramsey results for the structures , the “colored” version alluded to in the title of [11]. However, once this is proven, the big Ramsey structures for are easy to describe; namely, if is a big Ramsey structure for the rational order, then is a big Ramsey structure for .
Using the big Ramsey structure for , one obtains a big Ramsey structure for as follows. Represent as , where is a dense subset of the unit circle as before. Then we can view as a structure with underlying set . We let be those points below the -axis, and be the points above. Let be the unit circle; define the map by setting for and for . Note that is an injection with contained below the -axis. Then for , we set iff is to the right of . Then if is a big Ramsey structure for , then is a big Ramsey structure for .
7 Can we find big Ramsey structures?
Theorem 1.6 makes it important to know when a Fraïssé structure admits a big Ramsey structure. An obvious necessary condition is that every have finite big Ramsey degree. However, this seems far from sufficient. Suppose is a big Ramsey structure and , where each has big Ramsey degree . For each , consider the coloring , where for , we set . Then each is an unavoidable -coloring, and furthermore whenever . As hinted in the discussion near the end of section 4, this is actually sufficient.
Theorem 7.1**.**
Let be a Fraïssé structure, and suppose each has finite big Ramsey degree . Assume that for each , there is an unavoidable -coloring of so that for each . Then admits a big Ramsey structure.
While fairly intuitive, the proof of Theorem 7.1 is surprisingly involved and will be relegated to the appendix. One way of interpreting Theorem 7.1 is that it justifies our approach of always fixing an exhaustion and only paying attention to the . This “non-hereditary” approach can be formalized using the notion of a Fraïssé–HP class, that is a class of finite structures satisfying every property of being a Fraïssé class except perhaps the hereditary property. If is a Fraïssé–HP class, we can still form the Fraïssé limit . This structure has the property that for any with and embedding , there is with . So if is a Fraïssé structure, then the class is a Fraïssé–HP class. In fact, we will use this so frequently that we now adopt it as a notational convention: whenever is a Fraïssé structure with a fixed exhaustion and we write , we intend that .
For the rest of the section, fix a Fraïssé -structure , with and , and assume that each has big Ramsey degree . The theme of this section is that even if we don’t know that admits a big Ramsey structure, we can say many things about what such a structure must look like. We will show that admits a unique big Ramsey expansion class ; if is a big Ramsey structure for , then will be in a suitable sense isomorphic to .
If we add some extra assumptions to , we can say much more about the big Ramsey expansion of . If we know that is Roelcke precompact, then we will show that is itself a Fraïssé–HP class. This is simultaneously fascinating structural information and a frustrating obstacle to actually constructing a big Ramsey structure; we will discuss this at the end of the section.
7.1 The big Ramsey expansion class
An expansion of is a class of -structures for some language satisfying the following requirements.
If , then . 2. 2.
Every admits an expansion, a structure with . We write . 3. 3.
Suppose and with . Then if is an embedding, we have .
An expansion of is called precompact if is finite for each . The expansion is called reasonable if for every embedding with , the dual map given by is surjective. We are overloading the “dual map” notation, but the context should typically be clear. It is worth pointing out that to check if an expansion is precompact, it suffices to check that is finite for each . Similarly, to check if is reasonable, it suffices to check the surjectivity of each for each and .
If and are expansions of in languages and , respectively, then a map of expansions from to is a map satisfying the following.
If is an expansion of , then is also an expansion of . 2. 2.
If and , then .
We call and isomorphic expansions if there is a bijective (equivalently invertible) map of expansions from to . Much more on Fraïssé–HP classes and their expansions can be found in section 5 of [23]. One caution to the interested reader: the definition of expansion given there is missing the analog of item (3) from the definition here. This property of expansions is used implicitly throughout [23] and needs to be included in the definition. I thank Aleksandra Kwiatkowska for pointing this out to me.
We can now begin working towards the definition of the big Ramsey expansion of .
Definition 7.2**.**
Suppose . An -diagram is any map such that and are finite and so that for every , the map is surjective. 2. 2.
Let and be -diagrams. An isomorphism of -diagrams, written , is a pair of bijections and so that the following diagram commutes.
J_{n}\times H_{m}^{n}$$I_{n}\times H_{m}^{n}$$J_{m}$$I_{m}$$\sigma_{n}\times 1$$D_{J}$$D_{I}$$\sigma_{m} 3. 3.
Let . An -diagram based on is a collection satisfying the following properties.
- (a)
Each is a finite set so that for every , is an -diagram. Furthermore, . 2. (b)
If , , , and , then . 4. 4.
Let and be -diagrams based on and , respectively. An isomorphism of -diagrams is a tuple so that for every , is an isomorphism. 5. 5.
If , , and is an -diagram, then the restriction of to is the -diagram .
Example 7.3*.*
Suppose , and let be colorings of ,…,, respectively. For , the diagram of is the map where given and , we set if for any with , we have . The diagram of is the collection 2. 2.
If is a reasonable, precompact expansion of and , then the diagram is given by . We form an -diagram by setting . 3. 3.
Suppose and are two reasonable, precompact expansions of . Then and are isomorphic expansions iff and are isomorphic diagrams.
Proposition 7.4**.**
Suppose . Let and , where for each , we have and unavoidable colorings. Then and are isomorphic -diagrams.
Proof.
Notice first that if and , then , and similarly for and . Use Proposition 4.11 several times to find with for every . For , let be the bijections so that , and set . Now for any , we have the following commutative diagram, showing that is an isomorphism.
[TABLE]
Remark*.*
If , we write for any -diagram based on isomorphic to as in Proposition 7.4.
Proposition 7.5**.**
There is up to isomorphism a unique -diagram with for every .
Proof.
Consider the tree where level is the collection of -diagrams based on isomorphic to . This is an infinite finitely branching tree, so by König’s lemma, T has an infinite branch . Set .
Suppose is another -diagram with for every . Consider the tree where level is the collection of isomorphisms . This is also an infinite finitely branching tree, so let be an infinite branch. Then setting , then is the desired isomorphism. ∎
Remark*.*
We call the big Ramsey diagram of . We usually take to be based on unless otherwise specified.
Proposition 7.6**.**
Let be an -diagram. Then there is up to isomorphism a unique reasonable, precompact expansion of so that .
Proof.
Suppose is based on . For each , set , and fix an enumeration so that . We form a language by introducing for each an -ary relation symbol . If and , we define the expansion of as follows. Let , and let be an -tuple. If , then holds iff the map with is in and if . We then set .
The key observation about this definition is as follows. Suppose , and let be an -tuple. If and holds, then the map with is an embedding of into . Furthermore, we have ; this is a simple consequence of item (3b) of Definition 7.2. With this observation, checking that works is simple. Since each is finite, is precompact. Since for every the map is surjective, is reasonable. Define , where and ; then is an isomorphism.
Now suppose is another expansion of with . Then , so and are isomorphic expansions by item (3) from Example 7.3 ∎
Definition 7.7**.**
We call any reasonable, precompact expansion of with the big Ramsey expansion of .
We end this subsection by showing that if admits a big Ramsey structure , the big Ramsey expansion of is more-or-less the same thing as . We need to briefly discuss what “age” means in the non-hereditary context. Suppose is a language and is an -structure with . Then the age of over is the class . This is a reasonable expansion of .
Theorem 7.8**.**
Suppose that admits a big Ramsey structure , and let be the big Ramsey expansion of . Then and are isomorphic expansions.
Proof.
Write for . First notice that for every , so is precompact. As is also reasonable, we can now form the diagram , and it suffices to show that . For each , consider the coloring of given by . Each is an unavoidable -coloring, and whenever , so we can use these colorings to produce the diagram . Using this representation of , if , , and , we can write . But also . So . ∎
7.2 Roelcke precompact automorphism groups
Definition 7.9**.**
A topological group is said to be Roelcke precompact if for any open with , there is a finite with .
The class of Roelcke precompact automorphism groups is quite robust. For instance, if is a Fraïssé class (with HP) in a finite relational language, then is Roelcke precompact. This subsection first provides some background on what it means for to be Roelcke precompact, in particular, what it means for the class . We then show that if is Roelcke precompact, then the big Ramsey expansion class is in fact a Fraïssé–HP class.
For the rest of this section, fix for some Fraïssé structure . Let be the left completion.
Lemma 7.10**.**
* is Roelcke precompact iff for evey , there is so that for any , there is with and .*
Proof.
Suppose is Roelcke precompact, and fix . Then is an open neighborhood of the identity. Find with . Let be large enough so that for each we have .
Let . By ultrahomogeneity, we may assume that . Find and with . It follows that and as desired.
Conversely, assume that has the property stated in the lemma. Let be an open neighborhood of . We may assume for some . Let witness the property from the lemma, and find so that .
Let . Find and so that and . Find with , and notice that . Since , we have as desired. ∎
Another useful way to think about Roelcke precompactness is via the notion of a “type.” Though the definition we present might look different, this is the same notion of type as from model theory.
Definition 7.11**.**
Let , and let and be -tuples from . We say that and have the same type if there is with for each . A -type on is any equivalence class of -tuples. We write for the type that belongs to. Write for the collection of -types over .
Remark*.*
For and to have the same type, it is sufficient to find with for each .
Lemma 7.12**.**
* is Roelcke precompact iff for every , there are only finitely many -types on .*
Proof.
Assume that there are only finitely many -types. Using ultrahomogeneity, we can find so that is the set of -types on . Find large enough so that for each . Let . Find so that , and find with and . Then and , so is Roelcke precompact by Lemma 7.10.
Conversely, if is Roelcke precompact, use Lemma 7.10 to find as guaranteed by the lemma. Then if , we have for some , so there are only finitely many -types on . ∎
We now fix the big Ramsey expansion class of with the goal of showing that is a Fraïssé–HP class whenever is Roelcke precompact. It remains to show that has the Joint Embedding Property (JEP) and the Amalgamation Property (AP). Both of these properties are defined in the introduction immediately before Definition 1.1. It will be useful to rephrase both of these in terms of the diagram . We start with the JEP. Let be an -diagram based on . We say that has the JEP for diagrams if for any and , there are , , and so that and . It is routine to check that has the JEP for diagrams iff has the JEP.
Theorem 7.13**.**
Assume that is Roelcke precompact, and let be the big Ramsey expansion class of . Then has the JEP.
Proof.
Fix a representation of based on . Fix , and let . Using Roelcke precompactness, find large enough so that . Fix unavoidable colorings so that . For each , set . If for some we have , then we will be done by picking and setting . To see that some is non-empty, pick with and . By choice of , we can find and with and . Then as desired. ∎
We now turn towards the AP. If is an -diagram based on , then we say that has the AP for diagrams if for any , any , and any with for some , then there are , , and with and . Once again, it is routine to check that has the AP for diagrams iff has the AP.
Our strategy for proving that has the AP is adapted from the proof of a theorem of Nešetřil and Rödl [15]. If is a class of finite structures, we say that has the Ramsey Property (RP) if for any , there is with so that . The theorem of Nešetřil and Rödl states that if is a class of finite structures with both the JEP and the RP, then also has the AP. While we are unable to prove that has the RP, we will use ideas from Ramsey theory to power the proof. Namely, if is an unavoidable -coloring of and we write , there is and with .
Theorem 7.14**.**
Assume that is Roelcke precompact, and let be the big Ramsey expansion of . Then has the AP.
Proof.
Fix a representation of based on . Let , , and with for some . Using Roelcke precompactness, find large enough so that . Fix unavoidable colorings so that . Now consider the following partition of into pieces , , , and . If and , we put iff for , we have iff there is with and . Fix some and with . But notice that must equal since both of the sets and are unavoidable.
So fix and with , , and . By choice of , find and so that and . Now setting , we are done. ∎
While we are unable to prove in general that has the RP, we can show this holds if admits a big Ramsey structure . As a consequence, if there is a big Ramsey structure, then has the AP regardless of whether or not is Roelcke precompact by using the Nešetřil–Rödl theorem. Recall that with a big Ramsey structure, , and trivially has the JEP.
Theorem 7.15**.**
Suppose admits a big Ramsey structure . Then the big Ramsey expansion has the RP.
Proof.
Fix and expansions and for some and . By using some and working with the big Ramsey structure instead, we may assume that ; by passing to a possibly larger , we may assume and . It is enough (see section 4 of [23]) to show that , so fix a coloring . Notice that , and write for the two color classes. Find and with . Find with . Then satisfies that as desired. ∎
Corollary 7.16**.**
In the setting of Theorem 7.15, has the AP.
If is a reasonable expansion of in a language , we can form the space of -structures with underlying set such that ; we endow with the logic topology. If is also precompact, then is compact, hence a -flow. If is the big Ramsey expansion of and is any completion point, then is a big Ramsey structure, and the ambit is a big Ramsey ambit.
More generally, if is reasonable, precompact, and has the JEP, then any with has dense orbit, so is a pre-ambit. Furthermore, assume that also has the AP, and let be a Fraïssé limit. Another useful property of structures equivalent to being a Fraïssé structure is the Extension Property. In our non-hereditary context, this reads as follows.
Definition 7.17**.**
A structure has the Extension Property (EP) if for any with , expansions , and any embedding , there is an embedding with .
This formulation has two important corollaries which we now describe. First note that orbits of correspond exactly to isomorphism classes of structures, an any isomorphism between structures in must also be an automorphism of . Now a structure is isomorphic to the Fraïssé limit iff satisfies the EP, and this can easily be phrased as a countable intersection of open conditions. Therefore the orbit of is , and since , the orbit is also dense, therefore comeager.
The second consequence of the EP is that starting from the Fraïssé limit , it is “easy” to obtain any other structure in . Namely, if is any structure, we can repeatedly use the extension property to find with .
These two results conspire to make the search for completion points of difficult. Corollary 7.16 tells us that when is Roelcke precompact, admits a Fraïssé limit , and the orbit of in is comeager. The following proposition shows that in most circumstances, the generic orbit is the wrong orbit to investigate. Recall from the introduction the definition of small Ramsey degree. It is easy to see that since each has finite big Ramsey degree , then each also has finite small Ramsey degree . The key consequence of having small Ramsey degree that we will need is as follows. If is any reasonable, precompact expansion of , then there is with .
Proposition 7.18**.**
For each , let be the small Ramsey degree of . Suppose for some that . Then if is Roelcke precompact and , then is not a big Ramsey structure.
Proof.
As is the small Ramsey degree of , there is some with . In particular, such a is not a big Ramsey structure. Since for some , it follows that cannot be a big Ramsey structure. ∎
Remark*.*
If for every , then we can find for every a syndetic -coloring of with for every . Such a sequence of colorings can then be used to construct the universal minimal flow of (see section 8 of [23]). As syndetic colorings are unavoidable, it follows that is just ; as every orbit is dense, every point is a completion point, so is a big Ramsey flow. A good example to keep in mind is when is a countable set with no structure, and each is a set of size with no structure. Then , is the class of finite linear orders, and is the space of linear orders on .
8 Connections and questions
This section discusses the connections between completion flows and the notion of oscillation stability from [10]. It also gathers a list of open questions.
In this section, the only uniform structure we will consider on a topological group is the left uniformity, and any references to uniform continuity, Cauchy, etc. should be interpreted as such. If is uniformly continuous, then continuously extends to the left completion , and we will also use to denote this extension.
Definition 8.1**.**
Let be a Hausdorff topological group with left completion . A left-uniformly continuous function is called oscillation stable if for every and , there is so that 2. 2.
The topological group is called oscillation stable if every left-uniformly continuous is oscillation stable.
Suppose is a non-trivial completion ambit, and let be any continuous non-constant function. Then the function cannot be oscillation stable. However, given a continuous function which is not oscillation stable, it is not clear that can be described in this fashion. Recall that bounded uniformly continuous functions are precisely those functions which extend continuously to .
Proposition 8.2**.**
Let be a topological group. The following are equivalent.
* admits a non-trivial completion ambit.* 2. 2.
There is a non-constant, uniformly continuous so that for any , there are so that pointwise.
Remark*.*
The pointwise convergence in (2) is only for the functions with domain . In general, we cannot get pointwise convergence on all of .
Proof.
Suppose is a non-trivial completion ambit. Let be continuous, and define via . If , find with . Then .
Suppose satisfies (2). View as a member of equipped with the product topology. acts on this space by right shift. Let denote the orbit closure of , and notice that every member of is uniformly continuous. To be extra careful, let us write to denote various dynamical computations as carried out in . Notice that for any , we have
[TABLE]
Find with pointwise. But , so is a completion point of . ∎
If , then any uniformly continuous function can be uniformly approximated by functions of the form for some . It follows that is oscillation stable iff every has big Ramsey degree , which cannot happen.
It is unknown whether any non-trivial oscillation stable topological groups exist. Hjorth has shown [9] that no Polish group can be oscillation stable; a simpler proof of this result is given by Melleray [13]. As indicated in the introduction, let us propose the following weakening of oscillation stability.
Definition 8.3**.**
Let be a Hausdorff topological group. We call completely amenable if admits no non-trivial completion flows.
Every oscillation stable group is completely amenable, and every completely amenable group is extremely amenable. This brings us to our first question.
Question 8.4**.**
Are there non-trivial topological groups which are completely amenable? Are any non-trivial Polish groups completely amenable? Are any non-trivial groups completely amenable?
If a topological group does admit a non-trivial completion flow, then we can ask about the structure of the collection of completion flows and surjective -maps. We have seen that some groups admit non-trivial universal completion flows which are unique up to isomorphism.
Question 8.5**.**
Let be a topological group. Does admit a universal completion flow? If does admit a universal completion flow, is it unique?
In the case that , where where each has finite big Ramsey degree, we constructed in section 6 the big Ramsey expansion class . If is also Roelcke precompact, we were able to show that has the JEP and the AP.
Question 8.6**.**
Let , where and each has finite big Ramsey degree. Let be the big Ramsey expansion class of . Is there a “dynamical” characterization of ? Is a big Ramsey flow? Is this true if is Roelcke precompact?
Question 8.7**.**
Let , where . Assume some does not have finite big Ramsey degree. Then does admit a non-metrizable completion flow?
We now turn to more specific questions. First suppose that and are topological groups and is a continuous homomorphism with dense image. Then is uniformly continuous when both and are given their left uniform structures, so we may extend to a map from to , which we also denote by . Now suppose that is an -completion-ambit. We may regard as a -flow by setting . Since has dense image, still has dense orbit, and since maps to , is also a -completion-ambit.
We have seen that if , then admits a unique universal completion flow, which furthermore is metrizable. Let be the group of orientation-preserving homeomorphisms of the unit interval; we endow with the compact-open topology. A compatible left-invariant metric is given as follows. If , set . Fix an order-preserving injection with dense image, and use to obtain a continuous homomorphism with dense image. It follows that every -completion-flow is metrizable. The following question in some sense asks if a “continuous” analogue of Devlin’s theorem holds.
Question 8.8**.**
Let be the group of orientation preserving homeomorphisms of the unit interval with the compact-open topology. Is completely amenable? Does admit a unique universal completion flow?
The final question investigates the possibility of “iterated” Ramsey degrees in the following sense. Consider , and let be a big Ramsey structure for . Set . We saw in section 6 that is a Fraïssé–HP class, so has a Fraïssé limit .
Question 8.9**.**
With notation as in the previous paragraph, does admit a big Ramsey structure?
Appendix A Proof of Theorem 7.1
We restate Theorem 7.1 below.
Theorem**.**
Let be a Fraïssé structure, and suppose each has finite big Ramsey degree . Assume that for each , there is an unavoidable -coloring of so that for each . Then admits a big Ramsey structure.
We return to our convention that ; indeed, it was this proposition which justified the “Fraïssé–HP” perspective we took in later sections. In particular, we will need to deal with finite structures not equal to some . Many of the definitions and theorems from section 4 generalize to deal with any finite structures in , and we will freely use the “extended” versions of these theorems.
We will need the following easy lemma, which is very similar to Proposition 5.1
Lemma A.1**.**
With as in the statement of Theorem 7.1, then if , there is with .
Proof.
For each , find so that and agree on . Let be a cluster point of the . Since for every , we have as desired. ∎
Proof of Proposition 7.1.
First notice that each has finite big Ramsey degree, as for some , we have . Let be the big Ramsey degree of .
We produce for every with a coloring of so that the following items hold.
Each is an unavoidable -coloring. 2. 2.
If and , then refines (i.e. ).
Let us show how to complete the proof given these colorings. Suppose is an -stucture. We produce a new language ; for each with , we introduce new relational symbols of arity . We now construct an -structure on the underlying set . If , we set . To interpret the new relational symbols, first fix for each with an enumeration of the underlying set , where . Then if is a -tuple from and , we set iff there is with for each and .
Given and as constructed above, recall that . In order to show that as constructed above is a big Ramsey structure, it is enough to show that every satisfies . We may assume ; let be the enumeration used in the construction of . Notice that if , then for some unique , we have . Call such a an expansion of type . Now suppose are both expansions of type . We will show that . Fix so that and . It is enough to show that for any with , with , any -tuple , and any that holds iff holds.
By symmetry, it is enough to show one implication, so suppose holds. By definition, this means that holds. In particular, the map given by for is an embedding of into , so the map given by is an embedding of into . Notice that . By item (2), we must have that refines . Since , we must have . It follows that holds, so also holds.
We now proceed to construct the colorings satisfying items (1) and (2) above. Fix with , and find large enough so that . Let denote the inclusion embedding. For each , let . We define a reflexive graph on by declaring iff . Define a coloring on by sending to the connected component of in .
First let us argue that is an unavoidable coloring. Fix a connected component of . We can write for some , namely . But then we also have . Now fix towards showing that . Pick , and find with . Then , so .
To see that is an unavoidable -coloring, let be unavoidable. Find with . Using Lemma A.1, find with . By Lemma 4.13, we have an unavoidable -coloring with . We will show that . We must have ; by construction, is the finest possible coloring with . But since is an unavoidable coloring and is an unavoidable -coloring, we must have . In particular, is an unavoidable -coloring as desired. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Auslander, Minimal Flows and Their Extensions , North Holland, 1988.
- 2[2] D. Devlin, Some partition theorems and ultrafilters on ω 𝜔 \omega , Ph.D. Thesis, Dartmouth College, 1979.
- 3[3] E. Ellentuck, A new proof that analytic sets are Ramsey, J. Symbolic Logic , 39 (1974), 163–165.
- 4[4] P. Erdős, R. Rado, A partition calculus in set theory, Bull. Amer. Math. Soc. , 62 (1956), 427–489.
- 5[5] R. Fraïssé, Sur l’extension aux relations de quelques proprietés des ordres, Ann. Sci. École Norm. Sup. 71 (1954), 363–388.
- 6[6] F. Galvin, Partition theorems for the real line. Notices of the Amer. Math. Soc. , 15 (1968), 660.
- 7[7] F. Galvin and K. Prikry, Borel sets and Ramsey’s theorem , J. Symbolic Logic , 38 (1973), 193–198.
- 8[8] N. Hindman and D. Strauss, Algebra in the Stone-Čech Compactification , 2nd Edition, De Gruyter, 2012.
