Metrically Ramsey ultrafilters
Igor Protasov, Ksenia Protasova

TL;DR
This paper investigates ultrafilters in metric spaces, introducing the concept of metrically Ramsey ultrafilters, and explores their properties, existence, and relation to classical Ramsey ultrafilters, especially on the natural numbers.
Contribution
It establishes the existence of countable subsets in ultrametric spaces ensuring ultrafilters are metrically Ramsey and examines properties of metrically Ramsey ultrafilters on natural numbers.
Findings
Every infinite ultrametric space has a countable subset related to metrically Ramsey ultrafilters.
Every metrically Ramsey ultrafilter on natural numbers contains a member with no 2-term arithmetic progression.
If such an ultrafilter has a thin member, it maps to a classical Ramsey ultrafilter via a specific function.
Abstract
Given a metric space , we say that a mapping is an isometric coloring if implies . A free ultrafilter on an infinite metric space is called metrically Ramsey if, for every isometric coloring of , there is a member such that the set is -monochrome. We prove that each infinite ultrametric space has a countable subset such that each free ultrafilter on satisfying is metrically Ramsey. On the other hand, it is an open question whether every metrically Ramsey ultrafilter on the natural numbers with the metric is a Ramsey ultrafilter. We prove that every metrically Ramsey ultrafilter on has a member with no arithmetic progression of lengthβ¦
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.
Metrically Ramsey ultrafilters
Igor Protasov and Ksenia Protasova
Abstract
Given a metric space , we say that a mapping is an isometric coloring if implies . A free ultrafilter on an infinite metric space is called metrically Ramsey if, for every isometric coloring of , there is a member such that the set is -monochrome. We prove that each infinite ultrametric space has a countable subset such that each free ultrafilter on satisfying is metrically Ramsey. On the other hand, it is an open question whether every metrically Ramsey ultrafilter on the natural numbers with the metric is a Ramsey ultrafilter. We prove that every metrically Ramsey ultrafilter on has a member with no arithmetic progression of length 2, and if has a thin member then there is a mapping such that is a Ramsey ultrafilter.
Classification: 03E05, 54E35
Keywords: selective ultrafilter, metrically Ramsey ultrafilter, ultrametric space.
β β journal: Journal of LaTeXΒ Templates
Let be an infinite set and let be some family of -colorings of the set of all two-element subsets of . We say that a free ultrafilter on is *Ramsey with respect to * if, for any coloring , there exists such that is -monochrome. In the case in which is the family of all -colorings of , we get the classical definition of Ramsey ultrafilters. It is well-known that is a Ramsey ultrafilter if and only if is selective, i.e. for every partition of either for some or there exists such that for each .
Given a metric space , we say that a mapping is an isometric coloring if implies . We note that every isometric coloring is uniquely defined by some mapping . Indeed, we take an arbitrary , choose such that and put . On the other hand, for , we define by .
We say that a free ultrafilter on an infinite metric space is metrically Ramsey if is Ramsey with respect to all isometric colorings of .
Let be a group and let be a -space with the action , . A coloring is called -invariant if for all and . A free ultrafilter of is called -Ramsey if is Ramsey with respect to the family of all -invariant colorings of .
We consider the special case: is a metric space and is a group of isometries of . Clearly, every isometric coloring of is -invariant. If is metrically 2-transitive (if then there is such that ) then every -invariant coloring of is an isometric coloring.
We take the group of integers, put and consider the action on by . Is every -Ramsey ultrafilter selective? This question appeared in [5] and, to our knowledge, remains open. We endow with the metric . By above paragraph an ultrafilter on is -Ramsey if and only if is metrically Ramsey. Is every metrically Ramsey ultrafilter on -selective? This is an equivalent form of the above question. The case of evidently equivalent to the case of .
Surprisingly or not, the case of ultrametric spaces is cardinally different and much more easy to explore. We recall that a metric is an ultrametric if for all . We prove that every infinite ultrametric space has a countable subset such that any ultrafilter on satisfying is metrically Ramsey.
1 Equidistance subsets
We say that a subset of a metric space is an equidistance subset if there is such that for all distinct . If is an equidistance subset of then every free ultrafilter on such that is metrically Ramsey.
Propozition 1.1. Every infinite metric space with finite scale , has a countable equidistance subset.
Proof.
We define a coloring by and apply the classical Ramsey theorem [2, p.16]. β
For an ultrametric space and , we use the equivalence \ \sim_{r}\ defined by if and only if . Then is partitioned into classes of -equivalence . If then . If , and then .
Propozition 1.2. Let be an infinite ultrametric space with finite scale . If is regular then has an equidistance subset of cardinality . If is singular then, for every cardinal there is an equidistance subset of cardinality .
Proof.
Let , . We proceed on induction by . For , the statement is evident: .
To make the inductive step from to , we partition into classes of -equivalence . If then we pick one element and put , so for all distinct . Assume that . If is regular, we take so that and apply the inductive assumption to . If is singular then we take such that and use the inductive assumption. β
Remark 1.1. If in Proposition 1.2. is singular, we cannot state that there is an equidistance subset of cardinality . We take an arbitrary singular cardinal , put and partition so that and for each . We define an ultrametric on by , if , x\neq y\ and if , . if is an equidistance subset of then either for some , or for each . Hence, .
Proposition 1.3. For every infinite cardinal , there exists a metric space such that , and every equidistance subset of is of cardinality .
Proof.
We put and apply [4, Theorem 6.2] to define a coloring with no monochrome for . Then we define a metric on by and for all distinct . β
Propozition 1.4. Let be a metric space with infinite scale , . If then there is an equidistance subset of such that .
Proof.
We define a coloring by and apply the Erds-Rado theorem [4, Theorem 6.4]. β
Proposition 1.5. For every infinite metric space , there exists an injective sequence in such that one of the following conditions is satisfied:
* the sequence is increasing;*
* the sequence is decreasing;*
* for every n\in\omega\ and all , , , we have .*
Proof.
We assume that there exists such that the set is infinite, . We choose a countable subset of such that and for all distinct . The set contains either increasing or decreasing sequence . For each , we choose such that . Then the sequence satisfies either or .
In the alternative case, the set is finite for each . We fix and choose a countable subset such that . We pick and choose a countable subset such that and so on. After steps, we get the sequence satisfying . β
Proposition 1.6. Let be an infinite metric space and let be a family of non-empty pairwise disjoint subsets of such that for all and distinct . Let be a metrically Ramsey ultrafilter on such that and for each . Then the following statements hold:
* there exists such that for each ;*
* if for all distinct then there is a mapping such that the ultrafilter is selective;*
* if for each there exists such that , , then there exists an ultrafilter on such that and is not metrically Ramsey. *
Proof.
By the assumption, the sets and are disjoint. We take an arbitrary mapping such that , , and consider the isometric coloring of defined by . Since is metrically Ramsey, there is such that is -monochrome. Clearly, for each .
We define by the rule: if then , if then . We take an arbitrary coloring and define a coloring as follows. If , , then . If then . By the assumption, the coloring is isometric. We choose such that and is -monochrome and for each . Then and is -monochrome, so is a Ramsey ultrafilter.
We consider the family of all filters on such that and, for every and , there exists such that . By the Zorn Lemma, this family has maximal by inclusion element . It is easy to verify that is ultrafilter. By , is not metrically Ramsey. β
2 The ultrametric case
Proposition 2.1. For every infinite ultrametric space , there exists a countable subset of such that every free ultrafilter on satisfying is metrically Ramsey.
Proof.
We choose the sequence given by Proposition 1.5, put , fix an arbitrary mapping and take an arbitrary free ultrafilter satisfying .
We assume that either or of Proposition 1.5 hold for . We define a mapping by and choose such that . Since is an ultrametric, in the case we have for all , and in the case we have for all . In both cases, if then .
If satisfies of Proposition 1.5 then we define a mapping by , and repeat above arguments. β
Proposition 2.2. For a free ultrafilter on an infinite set , the following statements are equivalent:
* is selective;*
* is metrically Ramsey for each ultrametric on such that .*
Proof.
The implication is evident. We assume that is not selective and choose a partition of such that for each , and for every , there is such that . We define an ultrametric on by , if , for some , and if belong to different cells of the partition . We define a coloring by . Then the set is not -monochrome for each so is not metrically Ramsey and . β
Proposition 2.3. Let be an infinite ultrametric space with finite scale , . Then the following statements are equivalent:
* every free ultrafilter on is metrically Ramsey;*
* for every , the partition of into classes of -equivalence has only finite number of infinite classes and there is such that for each finite class from .*
Proof.
. If has infinitely many infinite classes or the set is a finite class from is infinite we apply Proposition to get a free ultrafilter on which is not metrically Ramsey.
. We proceed on induction by . For , the statement is evident.
To make the inductive step from to , take an arbitrary free ultrafilter on and we consider the partition . Let X_{1},\ldots,X_{m}\ be the set of all infinite classes from . If then we take and apply the inductive assumption. If then we choose such that and for each finite class . Then is an equidistance set so is metrically Ramsey. β
3 The case of
Proposition 3.1. *Let be a metrically Ramsey ultrafilter on and let be a mapping such that for each . Then there exists a member having no subsets of the form . In particular , some member of has no arithmetic progressions of length 2. *
Proof.
We consider a directed graph with the set of vertices and the set of edges . Since , is the disjoint union of directed trees such that each vertex of has at most one input edges. Using this observation, it is easy to partition so that , .
The partition defines an isometric coloring by if and only if . We take a subset such that the set is -monochrome and assume that for some . We note that , , but and belong to different subsets , so and we get a contradiction with the choice of . β
Let be metrically Ramsey ultrafilter on . Assume that there is such that for all distinct . Then every -coloring of can be extended to some isometric coloring of . Hence, is a Ramsey ultrafilter.
We say that a subset of is thin if (t_{n+1}-t_{n})\longrightarrow\infty\ as .
Proposition 3.2. If a metrically Ramsey ultrafilter on has a thin subset then there exists a mapping such that the ultrafilter is selective and is finite-to-one on some member .
Proof.
Let . Assume that we have chosen two sequences (a_{n})_{n\in\omega},\ (b_{n})_{n\in\omega}\ in such that
(1)\ \ a_{n}<b_{n}<a_{n+1}<b_{n+1}\ for each ;
(2)\ for all and distinct ;
for all distinct , ;
for all and distinct ;
for all distinct , ;
We put , and note that and with corresponding partitions satisfy Proposition 1.6 . Since either or , Proposition 1.6 gives the mapping such that is selective. By the construction of , is finite-to-one on or respectively.
It remains to construct and . We put , and assume that we have chosen . Since is thin, we can choose so that and for all distinct . Then we choose so that and for all distinct . After steps, we get the desired . β
4 Comments and open questions
- In connection with Proposition 3.1, we mention [5, Corollary 2]: every metrically Ramsey ultrafilter on has a member with no subsets of the form , .
In connection with Proposition 3.2, we ask
Question 4.1. Let be a metrically Ramsey ultrafilter on . Does there exist a thin subset ?
Question 4.2. Assume that a metrically Ramsey ultrafilter on has a thin member. Is selective?
- Let be an Abelian group. A coloring is called a PS-coloring if, for , implies . A free ultrafilter on is called a PS-*ultrafilter * if is Ramsey with respect to all PS-colorings of . The PS-ultrafilters were introduced and studied in [5], for exposition of [6] see [1, Chapter 10].
If has a finite set of elements of order 2 then every PS-ultrafilter on is selective. If is infinite then, under Martinβs Axiom, there is a non-selective PS-ultrafilter on . If there exists PS-ultrafilter on some countable group then there is a -point in .
Now we consider the countable Boolean group , . We note that a coloring is a PS-coloring if and only if is -invariant. Thus, a free ultrafilter on is a PS-ultrafilter if and only if is -Ramsey. By above paragraph, in the models of ZFC with no P-points in , there are no -Ramsey ultrafilters. However, every strongly summable ultrafilter on is a -ultrafilter. For strongly summable ultrafilters on Abelian groups see [3].
On the other hand, is the direct of copies of , and has the natural structure of ultrametric space , where . By Proposition 2.1, there are plenty metrically Ramsey ultrafilters on in ZFC. Applying Proposition 1.6 (iii), we can find ultrafilters on which are not metrically Ramsey.
- By [4, Theorem 6.2], there is a coloring such that if and is -monochrome then .
We endow with the natural metric and ask
Question 4.3. Does there exist an isometric coloring such that if is monochrome then ?.
We endow the Cantor cube with the standard metric and ask
Question 4.4. Does there exist an isometric coloring such that if is monochrome then ?.
REFERENCES
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Filali, I. Protasov, Ultrafilters and topologies on groups , Mat. Stud. Monogr. Ser., vol. 13, VNTL, Lviv, 2010.
- 2[2] R. Graham, B. Rotschild, J. Spencer, Ramsey Theory , Willey, New York, 1980.
- 3[3] N. Hindman, I. Protasov, D. Strauss, Strongly summable ultrafilters on Abelian groups , Mat. Stud. 10 (1998), 121-132.
- 4[4] K. Kunen, Combinatories , in: Handbook in Mathematical Logic , Vol. 90 (Studies in Logic on faundation of Mathematics, J. Barwise (editor)), Elsevier, 1982.
- 5[5] O. Petrenko, I. Protasov, Selective and Ramsey ultrafilters on G πΊ G -spaces , Notre Dame J. Formal Logic, to appear, preprint (Ar Xiv: 1310.1827).
- 6[6] I.Protasov, Ultrafilters and partitions of Abelian groups , Ucr. Mat.Zh. 53 (2001), 85-93, translation in Ukr. Math.J. 53 (2001), 99-107.
