Abstract
Continuing investigations initiated by the first author, we associate relational structures for metric spaces and investigate their model theoretic properties. In this paper, we consider ultrametric spaces. Among others, we show that any elementary substructure of the relational structure associated with a totally bounded ultrametric space is dense in X. Further, we provide an explicit upper bound for a splitting chain of atomic types in ultrametric spaces of a finite spectrum. For ultrametric spaces, these results improve previous ones of the present authors and may have further practical applications in designing similarity detecting algorithms.
MSC:
03C45; 03C66
1. Introduction
Let be a metric space. First, we recall a well-known method that associates a relational structure to . If d is a distance of , that is, , then the binary relation is defined to be
Thus, the relational structure completely describes and, at the same time, it can be treated as a first order relational structure.
We also recall that the metric space is an ultrametric space if and only if
holds for all . Furthermore, a metric space is defined to be totally bounded iff, for all , there exists a finite set such that, for all , there exists with , or in another words, the union of the finitely many open -balls centered in the elements of covers X.
Investigations related to the present work have been initiated and motivated in [,]. The present results may have practical applications e.g., in designing similarity detecting algorithms. More concretely, consider the following setting:
- X is a set of instances of an abstract data type and
- is a distance function on X measuring similarity of elements of X (that is, if is small for some , then a and b are “similar”).
The similarity detecting problem is the following. We are given a fixed set and, for an input , we would like to find some (or all) elements which are “similar enough to x”, that is, for which is smaller than a previously fixed . Very often, X may be infinite and A is finite but huge. The challenge is how to represent A. In these problems, usually the metric space is compact or at least totally bounded and often, it has an ultrametric distance function. For further details, we refer to [,]. More applications of finite metric spaces can be found in [,,].
Structural investigations of may help to find suitable representations for finite subspaces of . In particular, “small” substructures of similar to the whole play a central role. Hence, elementary substructures of , reflection principles and model theoretic stability for formulas of low complexity (atomic formulas, universal formulas, etc.) are particularly interesting.
From the results of [], one can easily obtain that, if is a totally bounded metric space, then is -stable in the model theoretic sense (where is the set of all atomic formulas of the language of ). The proof of this was reconstructed in [] (see Theorem 2.3 therein), where, similarly to [], we find an “almost isometry” from our space into a finite dimensional Euclidean space. In addition, in Theorem 2.4 of [], we also characterized dense in itself, totally bounded metric spaces in terms of stability properties of their associated relational structures. Moreover, by [], stability of generalized Urysohn spaces can be charactized by ultrametrizability.
In the present work, we will investigate totally bounded ultrametric spaces. As we mentioned at the end of the previous paragraph, according to Theorem 2.4 of [], for a dense in itself metric space , certain stability properties of are equivalent with total boundedness of . Hence, this assumption seems to be reasonable. Furthermore, as we mentioned above, from the point of view of applications, total boundedness of seems to be a mild assumption as well.
The main results of the present work are as follows. In Theorem 1, we prove that, if is a totally bounded metric space and is an elementary substructure of , then Y is dense in X. According to the remark right after the proof of Theorem 1, this theorem is not true in general (total boundedness cannot be deleted from the hypotheses). In Theorem 3, we give an explicit upper bound for the length of a splitting chain of atomic types; this may be used to design and analyze similarity detecting algorithms for ultrametic spaces with finite spectrum (we postpone related investigations later). In Corollary 3, we show that, if is totally bounded, then one-point extensions of -saturated elementary substructures of remain (-saturated) elementary substructures. As a byproduct statement, in Corollary 2, we show that, for a totally bounded , the associated relational structure is not only -stable, but, in fact, stable in the model theoretical sense. For ultrametric spaces, this improves the results presented in []. We do not know if Corollary 2 remains true without assuming that is totally bounded.
The structure of the paper is rather simple: we close this section by fixing our notation. Section 2 contains general model theoretical investigations and Section 3 is devoted to investigate ultrametric spaces of the finite spectrum.
Notation
Our notation is mostly standard, but the following list may help. In general, for topological or model theoretic notions not recalled here, we refer to [] (and respectively to [] or []).
Throughout this, denotes the set of natural numbers. In addition, and denote the set of real numbers, and the set of positive real numbers, respectively.
Let be a metric space, and let be a non-negative real number. As usual, the open -ball at a is the set
If is a first order language, then denotes the set of formulas of .
2. Stability
Studying combinatorial and model theoretic properties of metric and ultrametric spaces has a great tradition (see, e.g., Section 6.4 of [], [,], and the references therein). In this section, we investigate model theoretic stability of certain ultrametric spaces.
In this section, unless otherwise stated, and denote finite sets of formulas. As usual, we do not make a strict distinction between logically equivalent (but syntactically different) formulas.
We assume that the reader is familiar with the notion of structures, types, partial types, etc. For related definitions, we refer to [,].
Definition 1.
Let be a structure, let and let p be a partial type over Y. We recall from [] that, by definition, p is -splitting over X iff there are and such that but .
Furthermore, p splits over X iff it -splits over X where denotes the set of all formulas of the language of .
Remark 1.
Keeping the notation of Definition 1, the following properties of splitting are immediate.
- (1)
- If p-splits over X and , then p -splits over X.
- (2)
- If p-splits over X and , then p-splits over .
Lemma 1.
Suppose is a structure, and . Suppose are formulas.
- (1)
- If -splits over X, then -splits over X.
- (2)
- If -splits over X, then -splits over X.
Proof.
that is, . However, then and show that -splits over X. □
To show assume -splits over X. Then, there exist such that
Thus, showing that -splits over X.
The proof of is similar: assume -splits over X. Then, there exist such that
In particular, . By symmetry, we may assume
We will use the following notation. If is a set of formulas, then
Lemma 2.
Suppose is a structure, , X is finite and . Suppose
- (a)
- if , and then there exists such that and
- (b)
- for all finite , each Δ-type over can be realized in Y.
If -splits over X, then -splits over X.
Proof.
Assume -splits over X. Then, there exist and such that
By , there exists with . Let (where the variable v corresponds to c and corresponds to ). Then, c witnesses that . Furthermore, as , we obtain . Then, is a -type over .
Hence, implies that there exists a realization of , in particular,
However, then and show that -splits over X (we note that because of the last part of (1)). □
Theorem 1.
Suppose is a totally bounded metric space. If is an elementary substructure of , then Y is dense in X.
Proof.
Since is assumed to be totally bounded, it follows that, for each , there exists and
However, (2) can be formalized in the language of . Hence,
Finally, as is an elementary substructure of , it follows that is an -net in as well. □
It is natural to ask if Theorem 1 remains true without assuming that is totally bounded. The following example shows that this condition cannot be completely eliminated, that is, some extra conditions for must be assumed in order to reach the desired conclusion.
Let A be any uncountably infinite set and let X be the set of all functions from into A. For any , define to be
It is straightforward to check that is an ultrametric space. As , the language of is countable. Hence, there exists a countable elementary substructure of . Finally, we show that Y is not dense in X. To do so, let . Since Y is countable, so is R and hence there exists . Let be such that . However, then, clearly, Y and are disjoint (recall that denoting the open ball centered at g with radius ).
Lemma 3.
Suppose is a metric space and let Δ be the set of atomic formulas of the language of . Let and . Let be the function interchanging a and b and leaving all elements of B fixed. Suppose in addition that
- (1)
- ;
- (2)
- the types and do not split over ;
- (3)
- if a Δ-type over can be realized in B, then it also can be realized in .
Then, f is a partial isomorphism of (that is, f is an isomorphism between the substructures of generated by its domain and range).
Proof.
Let , be arbitrary. If or , then, clearly,
.
Hence, without loss of generality, we may assume that and .
By (3), there is an element such that . In addition, we have
hence iff , as desired. □
Lemma 4.
Suppose is an ultrametric space and let Δ be the set of atomic formulas of the language of . Suppose and are such that
Then, .
Proof.
Let be arbitrary. Then,
Furthermore, suppose seeking a contradiction that . Then, we would have
which is impossible. It follows that holds for any , as desired. □
Notational Convention. In order to make our notation more reader friendly, till the end of the present section, we will apply the following notational conventions. If is a metric space, then, for simplicity, we will denote by and the underlying set of by A. Furthermore, will denote the set of atomic formulas of the language of .
Lemma 5.
Let be a totally bounded ultrametric space. With the above notational convention, suppose, for each and , there exists a finite such that does not -split over X.
If Y is the universe of an -saturated elementary substructure of and , then generates an -saturated elementary substructure of .
Proof.
If , then the statement is obvious. Hence, in the rest of the proof, we assume . Throughout this proof, if , then the substructure of generated by U will be denoted by .
First, we shall show that
To do so, assume , and is a formula such that . It is enough to check that there exists such that . If , then we are done, so we may assume .
Observe that, by assumption, there exists a finite subset such that does not -split over . We claim that, in fact,
To check this, assume, seeking a contradiction, that there are such that but . Let
Since and , we have . Furthermore, by Lemma 1, there exists such that . By Lemma 4, and . As is an elementary substructure of , there exist such that
and
In particular, -splits over . However, then, by Lemma 4, would -split over , which is impossible by the choice of (and because ). Hence, is true.
Note that there are finitely many -types over and each of them can be realized in , hence in as well. Let be finite such that all -types over can be realized in . For each finite set, , let be a realization of
in . Finally, let be the function interchanging a and and leaving all elements of fixed. We claim that, for all s,
To check this, observe that the conditions of Lemma 3 are satisfied by our construction.
Now, consider the case when . By , is still an automorphism of . It follows that . However, by construction, and . Thus, has been established.
It remains to show that is an elementary substructure of . To do so, assume and is a formula such that . We shall show
Let s be any finite subset of Y containing the range of . Then, by construction, and . Since Y generates an elementary substructure of , we also have . Furthermore, by , is an elementary substructure of hence . Finally, by , is an automorphism of mapping onto a and leaving fixed. Therefore, , that is, holds, as desired.
To show that is -saturated, assume is finite and p is a type over . We shall show that p can be realized in . By the previous parts, is a type over . Since is assumed to be -saturated, there exists that realizes . However, then realizes p and we are done. □
Now, for certain ultrametric spaces, we can improve Lemma 2.
Lemma 6.
Assume the hypotheses of Lemma 5. Let Γ and Φ be any finite set of formulas. With the notational convention before Lemma 5, suppose , X is finite and . Suppose Y generates an -saturated substructure of .
If -splits over X, then -splits over X.
Proof.
By Lemma 5, generates an -saturated elementary substructure of , hence Lemma 2(a) and (b) are satisfied. □
Theorem 2.
Assume the hypotheses of Lemma 5. With the notational convention before Lemma 5, let and such that Y is the universe of an -saturated elementary substructure of .
If does not -split over X, then does not split over X.
Proof.
Let , and, if has already been defined for some , then let
.
To complete the proof, we shall show that, for all ,
We apply induction on n. For , holds by assumption. Next, assume is true for some . Let be arbitrary. Then, (the contrapositive forms of) Lemmas 1 and 6 imply respectively that
- does not -split over X;
- does not -split over X and
- does not -split over X.
Consequently, remains true for , and the induction is complete.
Finally observe that, if would split over X, then, for some , would -split over X. Hence, the proof is complete. □
The next corollary, in our context, is a kind of converse of Lemma 2.7 of Chapter I.2 of []. The idea of the proof is similar to the methods applied in [].
Corollary 1.
Assume the hypotheses of Lemma 5. Then, is stable.
In more detail, suppose is a totally bounded ultrametric space and with the notational convention before Lemma 5, suppose, for each and , there exists a finite such that does not -split over X. Then, is stable.
Proof.
.
It is enough to show that, if is an elementary extension of and is the universe of an -saturated elementary substructure of with , then the number of types over Y is at most (in fact, precisely) . Without loss of generality, we may assume that is -saturated.
For each finite subset , choose with and which is the universe of an -saturated elementary substructure of with cardinality . By assumption, for all , there exists a finite such that
For each , let . Clearly,
Combining this with our saturation assumption on , it is enough to show that
To do so, assume and . By Theorem 2, does not split over and similarly (by ), does not split over . Suppose ; we shall show . Let be a realization of in (such a realization exists because is -saturated). Since does not split over , it follows that . Combining this with , we obtain . However, does not split over , whence , as desired. □
3. Ultrametric Spaces of Finite Spectrum
In somewhat different contexts, variants of the next theorem appear in [].
Theorem 3.
Let be an ultrametric space of finite spectrum, let and let be the set of atomic formulas of . Then, for each , there exists a finite such that does not -split over B. In addition, .
If is an ultrametric space with an arbitrary spectrum, then the same conclusion holds for all finite reducts of .
Proof.
.
.
hence, by (b), we obtain . In addition,
.
which is impossible because, by stipulation (c) of our construction, . This contradiction completes the proof.
Fix and assume, seeking a contradiction, that there is no B satisfying the conclusion of the theorem. For each we define finite subsets and by recursion such that the following stipulations are satisfied:
- (a)
- is finite;
- (b)
- ;
- (c)
- .
Let ; then, clearly, (a)–(c) are satisfied. Assume and have already been defined for all , such that (a)–(c) are satisfied. According to the indirect assumption in the first sentence of the present proof,
It follows that there exist such that but . Define to be . Clearly, (a)–(c) remain true.
In this way, has been defined for all . Let
Clearly, and for each , we have . However, then, by the pigeon hole principle, there exist and such that
Now, observe that
Therefore,
The last sentence of the theorem can be proved similarly. □
Corollary 2.
Totally bounded ultrametric spaces are stable.
Proof.
Since is stable if and only if all of its finite reducts are stable, one can combine Corollary 1 and Theorem 3. □
Corollary 3.
If is a totally bounded metric space, is an -saturated elementary substructure of and is arbitrary, then generates an -saturated elementary substructure of .
Proof.
Combine Lemma 5 and Theorem 3. □
Author Contributions
Investigation, G.S. and K.A.-S. All authors have read and agreed to the published version of the manuscript.
Funding
Supported by the Hungarian National Foundation for Scientific Research grants K129211.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Sági, G. Almost injective Mappings of Totally Bounded Metric Spaces into Finite Dimensional Euclidean Spaces. Adv. Pure Math. 2019, 9, 555–566. [Google Scholar] [CrossRef]
- Sági, G.; Al-Sabti, K. Totally bounded metric spaces and similarity detecting algorithms. In Proceedings of the 15th International Scientific Conference on Informatics, Poprad, Slovakia, 20–22 November 2019; Steingartner, W., Korečko, S., Szakál, A., Eds.; IEEE: Piscataway, NJ, USA, 2019; pp. 338–342. [Google Scholar]
- Hjaltason, G.R.; Samet, H. Contractive Embedding Methods for Similarity Searching in Metric Spaces; Technical Report; Computer Science Department, Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland: College Park, MD, USA, 2000. [Google Scholar]
- Bressan, M.; Cesa-Bianchi, N.; Lattanzi, S.; Paudice, A. Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. In Proceedings of the Thirty Fourth Conference on Learning Theory, Boulder, CO, USA, 15–19 August 2021; Volume 134, pp. 775–803. [Google Scholar]
- Shi, M.; Rioul, O.; Solé, P. Designs in Finite Metric Spaces: A Probabilistic Approach. Graphs Comb. 2021, 37, 1653–1667. [Google Scholar] [CrossRef]
- Sosov, E.N. Main metric invariants of finite metric spaces II. Izvestiya Vysshikh Uchebnykh Zavedenii Matematika 2016, 6, 86–90. [Google Scholar] [CrossRef]
- Sági, G.; Al-Sabti, K. Totally Bounded Metric Spaces, Their Model Theoretic Stability and Similarity Detecting Algorithms. IPSI Trans. Internet Res. 2020, 16, 24–30. [Google Scholar]
- Bourgain, J. On lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math. 1985, 52, 46–52. [Google Scholar] [CrossRef]
- Conant, G. Neostability in countable homogeneous metric spaces. Ann. Pure Appl. Logic. 2017, 168, 1442–1471. [Google Scholar] [CrossRef][Green Version]
- Engelking, R. General Topology; Heldermann Verlag: Berlin, Germany, 1989. [Google Scholar]
- Chang, C.C.; Keisler, H.J. Model Theory; North-Holland: Amsterdam, The Netherlands, 1973. [Google Scholar]
- Shelah, S. Classification Theory; North-Holland: Amsterdam, The Netherlands, 1990. [Google Scholar]
- Poizat, B. A Course in Model Theory; Springer: Berlin/Heidelberg, Germany, 2000. [Google Scholar]
- Huber, K.T.; Moulton, V.; Spillner, A. Optimal realizations and the block decomposition of a finite metric space. Discret. Appl. Math. 2021, 302, 103–113. [Google Scholar] [CrossRef]
- Sauer, N. Distance Sets of Urysohn Metric Spaces. Can. J. Math. 2013, 65, 222–240. [Google Scholar] [CrossRef]
- Sági, G.; Gyenis, Z. Upward Morley’s Theorem Downward. Math. Logic. Q. 2013, 59, 303–331. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).