On ultrafilter extensions of first-order models and ultrafilter interpretations
Nikolai L. Poliakov, Denis I. Saveliev

TL;DR
This paper develops a unified framework for ultrafilter extensions of first-order models, introduces ultrafilter interpretations, and characterizes when these models correspond to standard models or their extensions.
Contribution
It generalizes the concept of first-order interpretations using ultrafilters and establishes conditions for ultrafilter models to align with canonical extensions and ordinary models.
Findings
Characterization of ultrafilter models as canonical extensions.
Conditions for ultrafilter models to coincide with ordinary models.
Extension theorems for ultrafilter models.
Abstract
There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as its main precursor. By a classical fact of general topology, the space of ultrafilters over a discrete space is its largest compactification; the ultrafilter extensions generalize this fact to discrete spaces endowed with an arbitrary first-order structure. Results of such kind are referred to as extension theorems. We offer a uniform approach to both types of extensions based on the idea to extend the extension procedure itself. Then we propose a generalization of the standard concept of first-order interpretations in which functional and relational symbols are interpreted rather by ultrafilters over sets of functions and relations than by…
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.
On ultrafilter extensions of first-order models
and ultrafilter interpretations
Nikolai L. Poliakov 111National Research University Higher School of Economics, Moscow., Denis I. Saveliev 222Russian Academy of Sciences, Institute for Information Transmission Problems.
Abstract
There exist two known types of ultrafilter extensions of first-order models, both in a certain sense canonical. One of them [16] comes from modal logic and universal algebra, and in fact goes back to [20]. Another one [27, 28] comes from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups [17] as its main precursor. By a classical fact of general topology, the space of ultrafilters over a discrete space is its largest compactification. The main result of [27, 28], which confirms a canonicity of this extension, generalizes this fact to discrete spaces endowed with an arbitrary first-order structure. An analogous result for the former type of ultrafilter extensions was obtained in [31]. Results of such kind are referred to as extension theorems.
After a brief introduction, we offer a uniform approach to both types of extensions based on the idea to extend the extension procedure itself. We propose a generalization of the standard concept of first-order interpretations in which functional and relational symbols are interpreted rather by ultrafilters over sets of functions and relations than by functions and relations themselves, and define ultrafilter models with an appropriate semantics for them. We provide two specific operations which turn ultrafilter models into ordinary models, establish necessary and sufficient conditions under which the latter are the two canonical ultrafilter extensions of some ordinary models, and obtain a topological characterization of ultrafilter models. We generalize a restricted version of the extension theorem to ultrafilter models. To formulate the full version, we propose a wider concept of ultrafilter models with their semantics based on limits of ultrafilters, and show that the former concept can be identified, in a certain way, with a particular case of the latter; moreover, the new concept absorbs the ordinary concept of models. We provide two more specific operations which turn ultrafilter models in the narrow sense into ones in the wide sense, and establish necessary and sufficient conditions under which ultrafilter models in the wide sense are the images of ones in the narrow sense under these operations, and also are two canonical ultrafilter extensions of some ordinary models. Finally, we establish three full versions of the extension theorem for ultrafilter models in the wide sense.
The results of the first three sections of this paper were partially announced in [25].
††footnotetext: Keywords: ultrafilter, ultrafilter quantifier, ultrafilter extension, ultrafilter interpretation, first-order model, ultrafilter model, topological model, largest compactification, right continuous map, right open relation, right closed relation, regular closed set, limit of ultrafilter, restricted pointwise convergence topology, homomorphism, extension theorem. ††footnotetext: Mathematical Subject Classification 2010: Primary 03C55, 54C08, 54C20, 54D35, 54D80; Secondary 03C30, 03C80, 54A20, 54B05, 54B10, 54B20, 54C10, 54C15, 54C20, 54C50, 54F65, 54E05, 54H10.
1 Introduction
In this section, we recall main definitions and facts concerning ultrafilter extensions of arbitrary maps, relations, and first-order models. All results mentioned here are established in various previous papers, so we omit their proofs. The section provides also some (of necessity incomplete) historical information.
Given a set , let be the set of ultrafilters over . As usual, we let by identifying each with the principal ultrafilter given by . Fix a first-order language and consider an arbitrary model of the language:
[TABLE]
with the universe , operations , and relations .
Definition 1.1**.**
An (abstract) ultrafilter extension of is any model in the same language of form
[TABLE]
with the universe and operations and relations on that extend and , respectively.
There are essentially two known ways to extend relations by ultrafilters, and one to extend maps. Particular instances of these extensions were discovered by various authors in different time and different areas, often without a knowledge of parallel studies in adjacent areas. It is convenient to describe these extensions in topological terms.
Recall that carries a natural topology generated by basic open sets
[TABLE]
for all . Easily, the sets are also closed, so the space is zero-dimensional. Moreover, is compact, Hausdorff, extremally disconnected (the closure of any open set is open), and the largest compactification of the discrete space . This means that is dense in and every (trivially continuous) map of into any compact Hausdorff space uniquely extends to a continuous map of into :
[TABLE]
by letting for all ,
[TABLE]
(As usual, is the closure of in , and is the image of under .) The largest compactification of Tychonoff spaces, usually referred to as the Stone–Čech compactification, was discovered independently by Čech [6] and M. Stone [34]; then Wallman [36] did the same for spaces (by using ultrafilters on lattices of closed sets); see [17, 8, 12] for more information.
The ultrafilter extension of a unary relation on a set is exactly the basic (cl)open set , and the ultrafilter extension of a unary map , where is a compact Hausdorff space (for operations on we let as ), is exactly its continuous extension . Thus in the unary case, the procedure gives classical objects known since 1930s. As for maps and relations of greater arities, several instances of their ultrafilter extensions were discovered only in 1960s.
Ultrafilter extensions of maps. Studying ultraproducts, Kochen [22] and Frayne, Morel, and Scott [13] considered a “multiplication” of ultrafilters, which actually is the ultrafilter extension of the -ary operation of taking -tuples. They shown that the successive iteration of ultrapowers by ultrafilters is isomorphic to a single ultrapower by their “product”. This has leaded to the general construction of iterated ultrapowers, invented by Gaifman and elaborated by Kunen, which has become common in model theory and set theory (see [7, 21]).
Ultrafilter extensions of semigroups appeared in 1960s as subspaces of function spaces. To the best of our knowledge, the first explicit construction of the semigroup that is the ultrafilter extension of a group is due to Ellis [11]; he also proved the existence of idempotents in compact Hausdorff semigroups with one-sided continuity [10]. In 1970s Galvin and Glazer applied these facts to give an easy proof of what now known as Hindman’s Finite Sums Theorem; the key idea was to use ultrafilters that are idempotent w.r.t. the extended operation. Then the method was developed by Bergelson, Blass, van Douwen, Hindman, Protasov, Strauss, and many others, and provided numerous Ramsey-theoretic applications in number theory, algebra, topological dynamics, and ergodic theory. The book [17] is a comprehensive treatise of this area, with an historical information. This technique was recently applied for obtaining analogous results for certain non-associative algebras (see [26, 29]).
Ultrafilter extensions of arbitrary -ary maps have been introduced independently in recent works by Goranko [16] and Saveliev [27, 28].
Definition 1.2**.**
For a map , the extended map is defined by letting
[TABLE]
One can simplify this cumbersome notation by introducing ultrafilter quantifiers. For every ultrafilter over a set and formula with parameters valuated over , let
[TABLE]
In fact, such quantifiers are a special kind of second-order quantifiers: is equivalent to , and also (since is ultra) to . Note also that ultrafilter quantifiers are self-dual, i.e. and coincide; they generally do not commute with each other, i.e. and are generally not equivalent; and if is the principal ultrafilter given by then is reduced to .
Now the definition above can be rewritten as follows:
[TABLE]
The map can be also described as the composition of the ultrafilter extension of taking -tuples, which maps into , and the continuous extension of considered as a unary map, which maps into .
Not many properties of original maps are preserved under their ultrafilter extensions. Specific identities preserved under ultrafilter extensions (e.g. associativity is so while commutativity and idempotency are not) are described in [28], Theorem 5.3.
Ultrafilter extensions of relations. One type of ultrafilter extensions of relations goes back to a seminal paper by Jónsson and Tarski [20] where they have been appeared implicitly, in terms of representations of Boolean algebras with operators. For binary relations, their representation theory was rediscovered in modal logic by Lemmon [23] who credited much of this work to Scott (see footnote 6 on p. 204); see also [24]. Goldblatt and Thomason [14] (where Section 2 was entirely due to Goldblatt) used this to characterize modal definability; the term “ultrafilter extension” has been coined probably in the subsequent work by van Benthem [2] (for modal definability see also [3, 35, 5]). Later Goldblatt [15] considered the extension of -ary relations in the context of universal algebra and model theory.
The following definition is equivalent to one appeared in [16] (or [20, 15]):
Definition 1.3**.**
For a relation , the extended relation is defined by letting
[TABLE]
The first-order formulas corresponding to so-called canonical modal formulas (e.g. to all Sahlqvist formulas) are preserved under passing from to , provided is a model of a relational language (see [2, 5]).
Another type of ultrafilter extensions of -ary relations has been recently discovered in [27, 28]:
Definition 1.4**.**
For a relation , the extended relation is defined by letting
[TABLE]
Rewriting this via ultrafilter quantifiers, we get an easier formulation:
[TABLE]
By decoding ultrafilter quantifiers, this also can be rewritten by
[TABLE]
whence it clearly follows that one of the two relations is included into another:
[TABLE]
If is a unary relation, both extensions, and , coincide with the basic open set given by (and with , the closure of in the space ). If a binary relation is functional, then (but not ) coincides with the above-defined extension of considered as a unary map; this does not work for relations of bigger arities. An easy instance of the -extensions, where are linear orders, was studied in [30].
A systematic comparative study of both extensions (for binary ) is undertaken in [31]. In particular, it is shown there that the - and the -extensions have a dual character w.r.t. relation-algebraic operations: the -extension commutes with composition and inversion but not Boolean operations except for union, while the -extension commutes with all Boolean operations but neither composition nor inversion. Also [31] provides topological characterizations of and in terms of appropriate closure operations and in terms of Vietoris-type topologies (regarding as multi-valued maps).
Ultrafilter extensions of models. Ultrafilter extensions of arbitrary first-order models were defined and studied for the first time independently in [16] and in [27] with two distinct versions of extended relations: Goranko considered models with the -extensions of relations and Saveliev with their -extensions. Here we shall consider both types of extensions; for a given model denote them by and , respectively:333 Another notation was used in [16], where was denoted by , and in [27, 28, 32], where was denoted by .
Definition 1.5**.**
For an arbitrary model we let
[TABLE]
Since for any relation we have , the following observation is obvious:
Theorem 1.6**.**
For any model with the universe the identity map on is a homomorphism of onto :
[TABLE]
Therefore, all positive formulas satisfied in are also satisfied in .
It follows from above mentioned facts that ultrafilter extensions are not elementary, except for certain degenerate cases. Even universal formulas are not preserved under these extensions, as seen from the example of a semigroup without idempotents: the semigroup does have an idempotent by Ellis’ theorem. On the other hand, idempotents in is a key tool in obtaining various deep combinatorial results about the extended , most of which have no known alternative (i.e. not using ultrafilter extensions) proofs (see [17]). More generally, some complex (typically, not first-order) assertions about the original model have counterparts about its ultrafilter extension which are easier to formulate and to prove; so, in a sense, the non-elementarity of ultrafilter extensions can be their advantage in studying the extended models.444 Compare this with non-standard extensions, also used to prove assertions about the extended model, which are elementary; it is unclear, however, whether this technique produces as many results with no known alternative proofs as the technique based on ultrafilter extensions does. Interestingly, a recent paper [9] combines both techniques to obtain results in number theory.
The following theorem has been appeared in [27] and called the First Extension Theorem in [28]:
Theorem 1.7**.**
Let and be two models of the same signature. If is a homomorphism between and , then the continuous extension is a homomorphism between and :
[TABLE]
Theorem 1.7 on the -extensions is a precise counterpart of Theorem 1.8 on the -extensions, a principal result of [16]:
Theorem 1.8**.**
Let and be two models of the same signature. If is a homomorphism between and , then the continuous extension is a homomorphism between and :
[TABLE]
Both theorems remain true for isomorphic embeddings and some other model-theoretic interrelations (see [16, 27, 28]). On the other hand, it was shown in [32] that Theorem 1.7 does not hold for elementary embeddings, moreover, the ultrafilter extensions of a model and its elementary submodel do not need to be elementarily equivalent.
Theorem 1.7 is actually a particular case of a much stronger result of [27], called the Second Extension Theorem in [28]. To formulate this, we need the following concepts introduced in [27].
Definition 1.9**.**
Let be topological spaces, and let . An -ary function is right continuous w.r.t. iff for each , , and every and , the unary map
[TABLE]
of into is continuous. An -ary relation is right open (right closed, right clopen, etc.) w.r.t. iff for each , , and every and , the set
[TABLE]
is open (closed, clopen, etc.) in .
Theorem 1.10 ([27, 28]) describes topological properties of the -extensions and serves as a base of Theorem 1.11, the Second Extension Theorem of [28]. (A very particular instance of the latter theorem, in which the models under consideration are semigroups, has been appeared in [4], Theorem 4.5.3.)
Theorem 1.10**.**
Let be a model. In the extension , all operations are right continuous and all relations right clopen w.r.t. the universe of .
Theorem 1.11**.**
Let and be two models of the same signature, a homomorphism of into , and let be endowed with a compact Hausdorff topology in which all operations are right continuous, and all relations are right closed, w.r.t. the image of the universe of under . Then is a homomorphism of into :
[TABLE]
Theorem 1.7 (for homomorphisms) easily follows: take as such a . The main meaning of Theorem 1.11 is that it generalizes the mentioned classical Čech–Stone result to the case when the underlying discrete space carries an arbitrary first-order structure.
A natural question is whether the -extensions are also canonical in a similar sense. The answer is positive; two following theorems are counterparts of Theorems 1.10 and 1.11, respectively (essentially both have been proved in [31]). Recall that a set is regular closed iff it is the closure of an open set.
Theorem 1.12**.**
Let be a model. In the extension , all relations are regular closed, namely, the closures of the relations in (while all operations are right continuous w.r.t. the universe of as before).
Theorem 1.13**.**
Let and be two models of the same signature, a homomorphism of into , and let be endowed with a compact Hausdorff topology in which all operations are right continuous w.r.t. the image of the universe of under , and all relations are closed. Then is a homomorphism of into .
[TABLE]
Similarly, Theorem 1.8 (for homomorphisms) follows from Theorem 1.13. The latter also generalizes the Stone–Čech result for discrete spaces to discrete models but with a narrow class of target models : having relations rather closed than right closed in Theorem 1.11. In the sequel, we shall refer to Theorems 1.7 and 1.8 as the First Extension Theorems, and to stronger Theorems 1.11 and 1.13 as the Second Extension Theorems, for the - and -types of ultrafilter extensions, respectively. Let us point out that in all these extension theorems the converse implication “if is a homomorphism of an ultrafilter extension then is a homomorphism of ” is also true but trivial since is a submodel of . We note also that the Second Extension Theorems are based on an “abstract extension theorem” describing certain conditions on models, their submodels, homomorphisms, and topological properties, under which such a homomorphism lifts from such a submodel to the whole model. The theorem will be used in our paper, too; we shall formulate it later on (Theorem 4.21).
We end this introductory section with topological characterizations of both types of ultrafilter extensions of relations and ultrafilter extensions of maps into discrete spaces and into compact Hausdorff spaces.
Theorem 1.14**.**
Let be discrete spaces, a compact Hausdorff space, and let the sets be endowed with the standard topology on ultrafilters, and with the usual product topology. Then
- (i)
* is for some iff is right clopen w.r.t. ;* 2. (ii)
* is for some iff is regular closed;* 3. (iii)
* is for some iff is right continuous and right open w.r.t. ;* 4. (iv)
* is for some iff is right continuous w.r.t. .*
Moreover, all the four extension operations: , , , , are bijections.
This theorem shows that Theorems 1.10 and 1.12 in fact characterize the - and -extensions via their topological properties (and the same will follow from Theorems 3.22 and 3.23 later).
The subsequent text is organized as follows.
In Section 2, we develop a topological technique that allows us to define an ultrafilter extension of the procedure of ultrafilter extension itself. This is a key tool for our article. Based on it, we provide a uniform approach to both types of ultrafilter extensions of relations (Theorem 2.12), and furthermore, in Section 3, we define an ultrafilter interpretation of first-order syntax, under which functional and relational symbols are interpreted rather by ultrafilters over sets of functions and relations than by their elements. We define ultrafilter models using ultrafilter evaluations of variables and ultrafilter interpretations and an appropriate semantics for them. We provide two specific operations, and , which turn ultrafilter models into ordinary ones, establish necessary and sufficient conditions under which the latter are two canonical ultrafilter extensions of some ordinary models (Theorem 3.22), and give a topological characterization of ultrafilter models (Theorem 3.23). Defining a natural concept of homomorphisms between ultrafilter models, we establish the First Extension Theorem for ultrafilter models (Theorem 3.27) and a stronger variant of it (Theorem 3.28).
In Section 4, we define an even wider concept of ultrafilter models together with their semantics based on limits of ultrafilters, and show that this new concept absorbs the ordinary concept of models with the usual semantics (Theorem 4.4) as well as our previous concept of ultrafilter models with their semantics (Theorem 4.5). We provide two more specific operations, and , which turn ultrafilter models in the narrow sense into ones in the wide sense, show how they relate to the operations and via their limits in appropriate topologies (Theorems 4.9 and 4.18), and establish necessary and sufficient conditions under which ultrafilter models in the wide sense are the images of ones in the narrow sense under and , and also are two canonical ultrafilter extensions of some ordinary models (Theorems 4.11 and 4.19). Finally, we define homomorphisms between ultrafilter models in the wide sense, and establish for them an “abstract extension theorem” (Theorem 4.23) and two Second Extension Theorems (Theorems 4.25 and 4.27). In Section 5, we conclude the article by posing some problems and tasks.
A part of the results mentioned in Sections 1–3 was announced in [25]; here we provide complete proofs of all our results.555In [25], it was erroneously stated that the set of right continuous maps forms a compact Hausdorff space w.r.t. the pointwise convergence topology; actually, the intended topology was a restricted pointwise convergence topology, as explained in details below.
2 Extending the ultrafilter extension
procedure
A purpose of this section is to provide a uniform approach to both types of ultrafilter extensions: the smaller -extensions and the larger -extensions. For this, we shall develop some ideas and machinery which will lead us in the next section to certain structures, called there ultrafilter models, generalizing ultrafilter extensions of each of the two types.
We shall give an alternative description of the -extension of relations in terms of the basic (cl)open sets and the continuous extension of maps. The crucial idea is to consider continuous extension of the procedure of ultrafilter extension itself, i.e. a self-application of the procedure. Let us clarify what is the idea precisely. For simplicity, consider firstly unary maps, for which the ultrafilter extensions are just the continuous extensions. To make the notation easier, let us denote the operation of continuous extension of maps by ; i.e. is another notation for :
[TABLE]
So if we consider (unary) maps of into , then is a map of into , the set of all continuous functions of into . If would be endowed with some compact Hausdorff topology, then we could extend the map to a (unique) continuous map of into :
[TABLE]
We are going to show that such a topology on exists, and in fact, is a weaker version of the pointwise convergence topology (while the standard full version of the topology is not compact, as explained in Remark 2.7). Furthermore, as we shall see, the same approach will work in the case of -ary maps (and relations, which can be reduced to maps).
Restricted pointwise convergence topology. Let and be topological spaces and . Define a topology on the set of all maps of into by letting the family of sets for all and all which are open in , as an open subbase. We shall call it the -pointwise convergence topology. Clearly, if then it is the usual pointwise convergence topology, which, as well-known (see e.g. [12]), coincides with the standard (Tychonoff) product topology.
Definition 2.1**.**
Consider as the set of -ary maps, and choose subsets . The topology with an open subbase consisting of sets
[TABLE]
for all and all which are open in , will be called the -pointwise convergence topology.
Although it is the same that the set of unary maps of into endowed with the -pointwise convergence topology, we shall use this terminology to emphasize when we shall say about -ary maps.
Let . For any , , and , the map
[TABLE]
is defined by letting
[TABLE]
for all . We omit the sub- and superscripts whenever the sequences and respectively are empty.
Let be the currying (or evaluation) map taking any with to the map such that
[TABLE]
(A more precise term would be the right currying but we prefer the shorter one.) Clearly, the map is bijective.
Let for any positive , topological spaces , and sets ,
[TABLE]
denote the set of -ary maps that are right continuous w.r.t. , which we consider with the -pointwise convergence topology.
Lemma 2.2**.**
If then
[TABLE]
Proof.
By definition of currying, maps into . Let us verify that it is continuous. Pick any open set in , and consider the subbasic open set in the space . We have:
[TABLE]
The set is open since the map is continuous. ∎
Lemma 2.3**.**
For any positive , topological spaces , their dense subsets , and Hausdorff space ,
- (i)
if maps coincide on , then they coincide everywhere, 2. (ii)
the space endowed with the -pointwise convergence topology, is Hausdorff.
Proof.
For brevity, let us denote the space by . We argue by induction on . For induction basis, see [12], Theorem 2.1.9. Assume we have already proven the claim for . Let us prove this for .
Let maps coincide on . Then for each the maps and coincide on and are right continuous w.r.t. the . By induction hypothesis, . Hence, the maps coincide on . By Lemma 2.2, the maps are continuous, while by induction hypothesis the space is Hausdorff. Hence, again by [12], Theorem 2.1.9. Therefore, since is bijective.
Furthermore, this shows that the space is Hausdorff. Indeed, let and . Then, by the just proven fact, for some . Since is Hausdorff, pick any disjoint open neighborhoods of and . Then the sets and are disjoint open neighborhoods of and . ∎
Lemma 2.4**.**
Let be discrete spaces and a compact Hausdorff space. The set
[TABLE]
of -ary maps of into which are right continuous w.r.t. , endowed with the -pointwise convergence topology, is homeomorphic to the space endowed with the usual pointwise convergence topology. Therefore, the space is compact Hausdorff; moreover, it is zero-dimensional iff so is .
Proof.
Let us verify that the map , which takes each -ary in to its extension in , is a homeomorphism. The fact that is injective is trivial, and that is surjective follows from Lemma 2.3 (since each is dense in and is Hausdorff): whenever and , then . Finally, the fact that it preserves in both directions open sets belonging to the subbases of the spaces, is immediate by the definition of the -pointwise convergence topology. Therefore, the space is homeomorphic to the usual product space of , hence, by the Tychonoff theorem, is compact Hausdorff, and moreover, the zero-dimensionality iff so is (see e.g. [12]). ∎
Lemma 2.5**.**
Let be discrete spaces, a compact Hausdorff space, and dense in . Then the set \bigl{\{}\widetilde{f}:f\in S^{X_{1}\times\ldots\times X_{n}}\bigr{\}} is dense in the space endowed with the -pointwise convergence topology.
Proof.
Let , pick for all arbitrary and open in , and show that, whenever the basic open set is nonempty, then it contains a point for some . Note that if some of the coincide, say, for all and some , then is nonempty whenever so is . So we can assume w.l.g. that all the are distinct. Then any satisfying for all , is as required. ∎
Question 2.6**.**
Does this remain true, moreover, for the full pointwise convergence topology? The answer is affirmative for unary maps, i.e. the set is dense in . What happens for binary maps? (Problem 5.1.)
Remark 2.7**.**
One may ask whether the usual (unrestricted) pointwise convergence topology on the set is compact, or equivalently, whether the set forms a closed subspace of the compact Hausdorff space with the Tychonoff product topology. If this would be the case, we could use this more common topology for our purpose. Let us show that the answer is in the negative, even for unary maps.
The set endowed with the pointwise convergence topology is not compact.
It suffices to verify that for an arbitrary map there exists an ultrafilter over converging to (to recall related facts the reader can look at the beginning of Section 4). Since can be discontinuous, this will show that is not closed in . Consider the family
[TABLE]
Let us check that is centered. It suffices to show that for any positive , ultrafilters over , and non-empty subsets of , there exists a map satisfying
[TABLE]
To see, pick arbitrary pairwise disjoint sets such that elements , and consider a map such that whenever , , and , where is a fixed element of , otherwise. (Actually, on the set could be defined arbitrarily.) Let , so . For each we have therefore, , and so, Thus the map witnesses that the family is centered.
Now extend to an ultrafilter . It is clear that converges to the map , as required.
Since we know that with the -pointwise convergence topology is compact while with the (full) pointwise convergence topology is not, we may ask what is the map such that the ultrafilter defined above converges to in the weaker (restricted) topology. It is not difficult to show that . Note that with the -pointwise convergence topology is compact (since it is compact even with the stronger pointwise convergence topology). The map of this compact space onto its compact subspace , defined by letting for all
[TABLE]
is a natural retraction. However, with the -pointwise convergence topology is not Hausdorff nor even a -space since, whenever is discontinuous, then the points and are distinct but have the same neighborhoods (it suffices to consider subbasic neighborhoods, and for any and open we have iff ).
These observations hold in a general setting, for -ary maps into any compact Hausdorff space : the full pointwise convergence topology on is not compact, while the -pointwise convergence topology on is compact but not , and the map defined by letting for all
[TABLE]
is a natural retraction of onto .
Self-application of the extension operation. Now we are ready to define the continuous extension of the map in a general form. Let be discrete spaces and a compact Hausdorff space. Recall that for any -ary map of into , is , the extension of to ultrafilters which is right continuous w.r.t. principal ultrafilters:
[TABLE]
By Lemma 2.4, the set endowed with the -pointwise convergence topology is a compact Hausdorff space. Therefore, extends to a unique continuous map on ultrafilters over the set :
[TABLE]
Remark 2.8**.**
Alternatively, we can first define on ultrafilters over the set of unary maps and then extend it to on ultrafilters over the set of -ary maps by induction on by using currying.
For this, we first note that the one-to-one correspondence between the sets and given by induces the one-to-one correspondence between the sets of ultrafilters over them, which takes each ultrafilter to the ultrafilter Or else, can be defined via the continuous extension of currying:
[TABLE]
Since is a bijection, it is easily follows that so is , and for all we have
Now, for , we extend to . And assuming that has been already defined for , we can define by letting
[TABLE]
since has been already defined on and by induction hypothesis.
Question 2.9**.**
One can offer another, alternative way to extend the ultrafilter extension procedure by considering it as the map not into the space of right continuous maps but into set of all maps with the usual product topology. Thus for any discrete and compact Hausdorff , let be a map of the discrete space into endowed with the usual product topology (or equivalently, the usual, unrestricted pointwise convergence topology). As the range is a compact Hausdorff space, the map continuously extends to (in the new sense):
[TABLE]
Unlike the previous construction, now some ultrafilters are mapped into maps that no longer are right continuous w.r.t. principal ultrafilters (as explained in the remarks above). However, these maps are still close to those: any neighborhood of contains some right continuous map; this is because
[TABLE]
Is this version of surjective? This is the case iff the image of is dense in the space; see Question 2.6.
Can this version of lead to some interesting possibilities? (Problem 5.2.)
Lemma 2.10**.**
For any positive , discrete spaces , and compact Hausdorff space , the continuous map
[TABLE]
is surjective and, whenever at least one of the is infinite, non-injective.
Proof.
To simplify the notation, let denote the space endowed with the -pointwise convergence topology. Pick any , let
[TABLE]
and consider the following family of subsets of :
[TABLE]
The family is centered; this can be stated by arguments similar to those in the first remark after Lemma 2.5. We are going to prove the following key property of the family :
[TABLE]
The lemma will be deduced from this property: since the argument works for all , the property shows that is surjective; and that is non-injective will be shown once two distinct such ultrafilters will be constructed.
Let us verify the following equality:
[TABLE]
First note that by Lemma 2.5, for every in we have
[TABLE]
Therefore,
[TABLE]
Next, toward a contradiction, assume that there exists such that and By Lemma 2.3, there exists such that . As is Hausdorff, pick disjoint open neighborhoods and of the points and , respectively. We have:
[TABLE]
(where the last equality holds since the set is the complement in of the subbasic open set ). Therefore,
[TABLE]
a contradiction. Thus we have verified that the equality is true.
Now the required key property of the family , i.e. that we have whenever is clearly follows from this equality. As observed above, this property immediately implies that is surjective; and to show that is also non-injective, it remains to construct two distinct ultrafilters .
Pick a family of subsets of such that and for all . The families
[TABLE]
are both centered (the fact that is centered uses that one of the is infinite). We extend them to two (automatically distinct) ultrafilters and , respectively. By the key property of , we obtain
[TABLE]
thus showing that is not injective. Note also that, since was choosen arbitrary, we have established a bit more: the preimage of each point in under the map consists of more than one point.
The lemma is proved. ∎
Lemma 2.11**.**
Let be discrete spaces, a compact Hausdorff space, , and . Then maps the closure of in the space onto the closure of in the space endowed with the -pointwise convergence topology:
[TABLE]
Proof.
Again, to simplify notation, we temporarily let:
[TABLE]
We consider with the standard topology on the space of ultrafilters, so it actually does not depend on the topology on as a subspace of . The fact that is compact Hausdorff is used only to get the same properties of the topology on , which are essential to extend to .
To prove the inclusion
[TABLE]
recall that by the general definition of continuous extensions of unary maps, for any we have Therefore,
[TABLE]
But for any we have and hence whence it follows
[TABLE]
which gives the required inclusion.
To prove the converse inclusion
[TABLE]
note that since the map is closed as a continuous map of a compact space into a Hausdorff space (see e.g. [12], Corollary 3.1.11), and that since consists of principal ultrafilters over the set (under our customary identification of elements with principal ultrafilters given by them).
The lemma is proved. ∎
Now we are ready to give the promised alternative description of the -extension of relations. For simplicity, we formulate it only for the case when ; nevertheless, this formulation does not lose generality since for given we can take their union as such an .
Theorem 2.12**.**
Let be any -ary relation on a set . Then its extension is (identified with) the image under of the basic set in the space where is considered as a unary relation on :
[TABLE]
Proof.
By Theorem 1.12, . As usual, the product space ( times) is identified with , so up to this identification we can let
[TABLE]
We are going to use Lemma 2.11 by choosing appropriate discrete , a compact Hausdorff , and . Let , let the space be with the discrete topology, so , let the space be with the standard topology on the space of ultrafilters, and let be , so we have:
[TABLE]
(clearly, the -pointwise convergence topology on the latter set is the same that the full pointwise convergence topology). Now Lemma 2.11 gives us
[TABLE]
But where is considered as a unary relation on (recall that if is discrete and , then the basic open set equals the closure ), and furthermore, (since for all as ). Putting all this together, we obtain:
[TABLE]
as required. ∎
Although this description of the ∗-extension of relations is not simpler than one given by Theorem 1.12, it provides some connection of this larger extension with the smaller -extension of relations (by using also continuous extensions of maps). Other interrelations between the - and ∗-extensions of relations are established via Vietoris-type topologies in [31].
3 Ultrafilter interpretations
In this section, we define our main concepts: ultrafilter interpretations (of functional and relational symbols) and ultrafilter models (involving ultrafilter evaluations and ultrafilter interpretations) together with their semantics. Then we provide two specific operations turning ultrafilter models into ordinary ones, establish necessary and sufficient conditions under which the latter are two canonical ultrafilter extensions of some ordinary models, and give a topological characterization of ultrafilter models. Finally, we define homomorphisms of ultrafilter models and prove for them a version of the First Extension Theorem and an its refinement.
Ultrafilter models. Using ultrafilters over maps in our previous considerations leads us to the following concept.
Definition 3.1**.**
Given a signature , we define an ultrafilter interpretation as a map that takes each -ary functional symbol in to an ultrafilter over the set of -ary operations on , and each -ary predicate symbol in to an ultrafilter over the set of -ary relations on ; let also be an ultrafilter valuation of variables, i.e. a valuation which takes each variable to an ultrafilter over a given set :
[TABLE]
We refer to the structure
[TABLE]
as an ultrafilter model of .666 Ultrafilter models were introduced in [25] under the name of generalized models. In Section 4, we shall introduce a wider concept of ultrafilter models (Definition 4.1); the ultrafilter models defined here will be referred to as those “in the narrow sense”.
Now we are going to define an appropriate satisfiability relation between ultrafilter models and first-order formulas, which we shall denote by the symbol .
First, given an interpretation of non-logical symbols, we expand any valuation of variables to the map defined on all terms as follows. Let be the application operation:
[TABLE]
Extend it to the map right continuous w.r.t. the principal ultrafilters, in the usual way:
[TABLE]
Let coincide with on variables, and if has been already defined on terms , we let
[TABLE]
Remark 3.2**.**
We can consider, more generally, for any compact Hausdorff space the extension right continuous w.r.t. the principal ultrafilters:
[TABLE]
though this is redundant for our immediate purposes.
Further, given an ultrafilter model define the satisfiability in as follows. Let be the membership predicate:
[TABLE]
Extend it to the relation right clopen w.r.t. principal ultrafilters.
Definition 3.3**.**
The satisfiability of a formula in is defined by induction on the construction of : If is an identity, we let
[TABLE]
If is an atomic formula in which is not the equality predicate, we let
[TABLE]
(Equivalently, we could define the satisfiability of atomic formulas by identifying predicates with their characteristic functions and using the satisfiability of equalities of the resulting terms.) Finally, if is obtained by negation, conjunction, or quantification from formulas for which has been already defined, we define in the standard way.
When needed, we shall use variants of notation commonly used for ordinary models and satisfiability, for our generalized variants. E.g. for an ultrafilter model with the universe , a formula , and elements of , the notation means that is satisfied in under a valuation taking the variables to the ultrafilters , respectively.
Ultrafilter models actually generalize not all ordinary models but those that are ultrafilter extensions of some models. It is worth also pointing out that whenever an ultrafilter interpretation is principal, i.e. all non-logical symbols are interpreted by principal ultrafilters, we naturally identify it with the obvious ordinary interpretation with the same universe ; however, not every ordinary interpretation with the universe is of this form. Precise relationships between ultrafilter models, ordinary models, and ultrafilter extensions will be described in Theorems 3.22 and 3.23. Let us also note in advance that ultrafilter models in the wide sense, which we shall define in Section 4, will cover (up to some natural identification) not ultrafilter extensions only but all ordinary models.
An ultrafilter valuation is principal iff it takes any variable to a principal ultrafilter.
Lemma 3.4**.**
Let and be two ultrafilter models of the same signature and having the same universe . If for all functional symbols , predicate symbols , variables , and principal valuations ,
[TABLE]
then for all formulas , terms , and valuations ,
[TABLE]
Proof.
By induction on construction of formulas using the right continuity of and the right clopenness of w.r.t. . ∎
Corollary 3.5**.**
Given an ultrafilter model define an ultrafilter model of the same signature as follows: let have the same universe , let coincide with on functional symbols, and for each predicate symbol let be the principal ultrafilter given by the relation
[TABLE]
Then for all valuations , formulas , and terms ,
[TABLE]
Proof.
Lemma 3.4. ∎
Definition 3.6**.**
If are discrete spaces, let us say that an ultrafilter over the set of -ary maps is pseudo-principal iff takes any -tuple consisting of principal ultrafilters together with to a principal ultrafilter:
[TABLE]
Clearly, if the space is finite, then all ultrafilters in are pseudo-principal. (More generally, if we would defined with the range in any compact Hausdorff , as proposed in the remark above, then all ultrafilters in were pseudo-principal.)
Lemma 3.7**.**
Let be discrete spaces. In , every principal ultrafilter is pseudo-principal, and if and at least one of the are infinite, then there exist pseudo-principal ultrafilters that are not principal as well as ultrafilters that are not pseudo-principal.
Proof.
Pick any . Let be the following family of subsets of the space :
[TABLE]
The family is centered (as at least one of the is infinite), so pick any ultrafilter over the set such that . Since is empty, the ultrafilter is non-principal. On the other hand, for every we have:
[TABLE]
(The first equivalence follows from the definition of extensions of maps via ultrafilter quantifiers, the second holds by the definition of , the third since are principal, and the fourth decodes the definition of the quantifier.) Letting , we have thus witnessing that is pseudo-principal.
To construct a non-pseudo-principal ultrafilter, pick any and (as is infinite), and expand the centered family
[TABLE]
to an ultrafilter over . Calculations similar to those in the above give us
[TABLE]
thus witnessing that is not pseudo-principal. ∎
Definition 3.8**.**
An ultrafilter interpretation is pseudo-principal on functional symbols iff is a pseudo-principal ultrafilter for each functional symbol (and then, for each term ).
Corollary 3.9**.**
Given an ultrafilter model with pseudo-principal on functional symbols, define an ultrafilter model of the same signature as follows: let have the same universe , let coincide with on predicate symbols, and for each functional symbol let be the principal ultrafilter given by the operation defined by letting
[TABLE]
Then for all valuations , formulas , and terms ,
[TABLE]
Proof.
Lemma 3.4. ∎
It follows that for every ultrafilter model whose interpretation is pseudo-principal on functional symbols, by replacing its relations as in Corollary 3.5 and its operations as in Corollary 3.9, one obtains an ordinary model with the same universe such that for all formulas and elements of the universe, iff
We do not formulate this fact as a separate theorem since we shall be able to establish stronger facts soon. In Theorem 3.16, we shall establish that for any ultrafilter model , not necessarily with a pseudo-principal interpretation, one can construct a certain ordinary model satisfying the same formulas; and then, in Theorem 3.22, that whenever has a pseudo-principal interpretation, is nothing but the -extension of some model. In fact, in the latter case, coincides with from the previous paragraph.
Operations and . Let us now define two operations, and , which turn ultrafilter models into certain ordinary models that (as we shall see soon) generalize the - and -extensions. Both operations take ultrafilters over -ary maps to -ary maps over ultrafilters, and ultrafilters over -ary relations to -ary relations over ultrafilters. Both operations are surjective and non-injective (Lemma 3.21).
The map on ultrafilters over maps will be the map defined and discussed in Section 2. Now we extend to ultrafilters over relations by identifying -ary relations with their -ary characteristic functions into the discrete space :
[TABLE]
(Recall that by Theorem 1.14(i), a subset of is right clopen w.r.t. iff it is of form for some -ary subset of .) Let the map on ultrafilters over relations also coincide with the map on them. So in result we have:
[TABLE]
We observe that and (or ) are expressed via each other:
Lemma 3.10**.**
Let be discrete spaces. For all and
[TABLE]
In other words,
[TABLE]
Proof.
To simplify the notation, let be the space of -ary maps on into that are right continuous w.r.t. , endowed with the -pointwise convergence topology. By Lemma 2.4, is compact Hausdorff. Recall that for any we have
[TABLE]
and that is the -ary map on into defining by letting for all
Note that both maps and are in (the first follows from the fact that is right continuous w.r.t. , the second holds since is a map into ). Therefore, by Lemma 2.3, in order to show that they coincide, it suffices to verify that they coincide on principal ultrafilters.
For this, pick any and . We have:
[TABLE]
(The first equivalence follows from the definition of extensions of maps via ultrafilter quantifiers, the second holds since are principal, the third by the definition of , and the fourth by the definition of the quantifier.) Therefore,
[TABLE]
As stated in Lemma 2.4, the space is zero-dimensional; in particular, the open set O_{a_{1},\ldots,a_{n},\widetilde{S}}=\bigl{\{}g\in\mathrm{RC}:g(a_{1},\ldots,a_{n})\in\widetilde{S}\,\bigr{\}} is closed (since its complement is open too). It follows that
[TABLE]
Therefore, we obtain
[TABLE]
or, in other words, The latter is clearly equivalent to Thus we get the inclusion But since both and are ultrafilters, the inclusion actually gives the equality
This proves the lemma for ultrafilters over sets of maps. The remaining claim about ultrafilters over sets of relations follows by replacing the relations with their characteristic functions. ∎
Question 3.11**.**
For which compact Hausdorff space , instead of with a discrete , does Lemma 3.10 remain true (providing that is defined as in Remark 3.2)? Does this hold at least for all zero-dimensional, or all extremally disconnected compact Hausdorff ? (Problem 5.3.)
Corollary 3.12**.**
Let be discrete spaces. The set of pseudo-principal ultrafilters is the preimage of the set under the map :
[TABLE]
Recalling that , that on the set (identified with principal ultrafilters) is just , and that we can rewrite the set of pseudo-principal ultrafilters also by
[TABLE]
Proof.
Show first that if is pseudo-principal, then for some . By the definition of (), always is a map belonging to the set Since by Lemma 3.10 we have we see that the map takes principal ultrafilters to principal ultrafilters whenever is pseudo-principal. But then it follows from Lemma 2.3 that coincides with if the map is the restriction of to principal ultrafilters:
[TABLE]
It remains to show the converse implication, i.e. that for every there exists a pseudo-principal ultrafilter with . For this, it clearly suffices to let equal to the principal ultrafilter given by . ∎
Question 3.13**.**
What are topological properties of the set of pseudo-principal ultrafilters in the space ? topological properties of its preimage under , the set , in the space with the -pointwise convergence topology (besides the fact that it is dense there, as stated in Lemma 2.5), or with the (usual) pointwise convergence topology? in the space with the pointwise convergence topology?
Let us point out that objects naturally defined in terms of ultrafilter extensions often have rather hardly definable topological properties, cf. [18, 19]. (Problem 5.4.)
Corollary 3.14**.**
For all ultrafilter models and valuations ,
[TABLE]
Proof.
Lemma 3.10 with . ∎
Definition 3.15**.**
For an ultrafilter model let
[TABLE]
Note that is an ordinary model.
The following theorem is the first of the three main results of this section, it states that in point of view of the satisfaction of formulas, any ultrafilter model is not distinguished from the ordinary model .
Theorem 3.16**.**
If is an ultrafilter model, then for all formulas and elements of the universe of ,
[TABLE]
Proof.
Induction on starting from Corollary 3.14. ∎
Now we define the map , which has the same domain that the map does and also satisfying
[TABLE]
as follows: and coincide on , and whenever then we define
[TABLE]
where is considered as an ultrafilter over unary relations on while is considered as an ultrafilter over unary maps on (and has the corresponding meaning). Let us now explain the construction in details.
First, we consider as the set of unary relations on . Then the map takes any subset of to the clopen subset of . Therefore, the extended map takes any ultrafilter over to some clopen subset of :
[TABLE]
Next, we identify the product with the set of unary maps from the set into satisfying (for all ). Then the map takes any such to the unary continuous map from into satisfying , and we identify the set of such maps backwards with the product . Therefore, the extended map takes any ultrafilter over to some -tuple in :
[TABLE]
(An analogous construction was previously used in Theorem 2.12.) In result, the set is mapped onto the set Since is clopen and the map is closed (as a continuous map between compact Hausdorff spaces), the resulting is a closed subset of the space
Lemma 3.17**.**
Let Then
[TABLE]
for Consequently,
[TABLE]
We can write up this more explicitly:
[TABLE]
Proof.
For , apply Lemma 3.10. For , note that iff . ∎
Definition 3.18**.**
For an ultrafilter model let
[TABLE]
Then , like , is an ordinary model.
The following easy observation is similar to Theorem 1.6, and moreover, it turns out to be that theorem whenever the interpretation of is pseudo-principal on functional symbols, as we shall see after Theorem 3.22.
Theorem 3.19**.**
For any ultrafilter model the identity map on its universe is a homomorphism of onto :
[TABLE]
Therefore, all positive formulas satisfied in are also satisfied in .
Proof.
Immediate from Lemma 3.17 since for all relations . ∎
Now we are going to establish two remaining main results of this section, Theorems 3.22 and 3.23. The first of them characterizes ultrafilter models such that their - and -images are ultraextensions of ordinary models, while the second one characterizes ordinary models that are the - and -images of ultrafilter models. Before this we prove two more auxiliary lemmas, which actually follow from the previously stated facts.
Lemma 3.20**.**
Let be an ultrafilter model with a pseudo-principal interpretation of functional symbols, and the ultrafilter model with a principal interpretation of functional symbols constructed from as in Corollary 3.9. Then .
Proof.
Let and be the interpretations in and , respectively. If is a functional symbol, then the operations and are right continuous w.r.t. principal ultrafilters. Therefore, by Lemma 2.3, in order to show that they coincide, it suffices to verify that they coincide on principal ultrafilters.
If the symbol is -ary, let be any -tuple of principal ultrafilters. We have:
[TABLE]
(the first equality holds by the definition of from Corollary 3.9, the second as is principal, and the third as extends ). By Lemma 3.10,
[TABLE]
(that holds for -tuples of non-principal ultrafilters as well). This completes the proof. ∎
Lemma 3.21**.**
Both operations and are surjective and non-injective. More precisely,
- (i)
* (and ) on \beta\!\!\!\!\beta\bigl{(}Y^{X_{1}\times\ldots\times X_{n}}\bigr{)} is a surjection onto ,* 2. (ii)
* on is a surjection onto \bigl{\{}\widetilde{R}\in\mathcal{P}(\beta\!\!\!\!\beta X_{1}\times\ldots\times\beta\!\!\!\!\beta X_{n}):R\subseteq X_{1}\times\ldots\times X_{n}\bigr{\}} =\bigl{\{}Q\in\mathcal{P}(\beta\!\!\!\!\beta X_{1}\times\ldots\times\beta\!\!\!\!\beta X_{n}):Q is right clopen w.r.t. X_{1},\ldots,X_{n}\bigr{\}},* 3. (iii)
* on is a surjection onto \bigl{\{}R^{*}\in\mathcal{P}(\beta\!\!\!\!\beta X_{1}\times\ldots\times\beta\!\!\!\!\beta X_{n}):R\subseteq X_{1}\times\ldots\times X_{n}\bigr{\}} =\bigl{\{}Q\in\mathcal{P}(\beta\!\!\!\!\beta X_{1}\times\ldots\times\beta\!\!\!\!\beta X_{n}):Q is regular closed \bigr{\}},*
and each of the three maps is not an injection whenever at least one of the is infinite.
Proof.
Item (i) is Lemma 2.10; items (ii) and (iii) are immediate from Lemma 3.17; the non-injectivity is easy from the cardinality argument since both maps and are bijections. (Alternatively, (ii) can be obtained from (i) by replacing relations with their characteristic functions.) The equalities in (ii) and (iii) were stated in Theorem 1.14(i),(ii). ∎
By Lemma 3.17, relations of the model are the -extensions of some relations on , while relations of the model are the -extensions of the same relations. Whether the whole models and are the ultrafilter extensions of some models depends only on the ultrafilter interpretation of functional symbols in :
Theorem 3.22**.**
Let be an ultrafilter model with the universe . The following are equivalent:
- (i)
* for an ordinary model with the universe ,* 2. (ii)
* for an ordinary model with the universe ,* 3. (iii)
the interpretation in is pseudo-principal on functional symbols.
Moreover, the model in (i) and (ii) is the same.
[TABLE]
Proof.
The implications from each of (i) and (ii) to (iii) are obvious: if the interpretation in is not pseudo-principal, then there are a functional symbol and a sequence of principal ultrafilters over such that the operation on takes to a non-principal ultrafilter over . Therefore, is not of form for any operation on . Since is the interpretation of in both models and , it follows that these models are not of form and for any ordinary model .
Let us show now that, conversely, (iii) implies each of (i) and (ii). By Lemma 3.20, it suffices to handle the case when the pseudo-principal interpretation in is principal. So suppose this is the case and define an ordinary interpretation of the same language by letting, for all functional symbols and predicate symbols ,
[TABLE]
We have:
[TABLE]
since is principal and (and ) on principal ultrafilters is , and
[TABLE]
by Lemma 3.17. Thus if is the ordinary model given by , we obtain and , as required. ∎
Finally, we point out that the fact whether an ordinary model with the universe is of form , and whether it is of form , for some ultrafilter model (clearly, with the same universe ) depends only on its topological properties:
Theorem 3.23**.**
Let be an ordinary model with the universe . Then:
- (i)
* for an ultrafilter model iff in all operations are right continuous w.r.t. and all relations are right clopen w.r.t. ,* 2. (ii)
* for an ultrafilter model iff in all operations are right continuous w.r.t. and all relations are regular closed.*
Proof.
Lemma 3.21. ∎
Since by Theorem 3.22, and applied to ultrafilter models with pseudo-principal interpretations give the - and ∗-extensions of ordinary models, Theorem 3.23 can be considered as a generalization of Theorems 1.10 and 1.12.
First Extension Theorems. Here we discuss a possible generalization of the First Extension Theorems (Theorems 1.8 and 1.7) to ultrafilter models. To start, let us restate both them in a single way as follows.
Theorem 3.24**.**
Let and be two (ordinary) models of the same signature, and let be a map between their universes. The following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into ,* 3. (iii)
* is a homomorphism of into :*
[TABLE]
Proof.
This leads to a conclusion for our ultrafilter models:
Lemma 3.25**.**
Let and be two ultrafilter models of the same signature, and let be a map between their universes. The following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into .*
Proof.
If is an ultrafilter over operations, we have by definition of and , hence the claim for homomorphisms w.r.t. operations holds trivially. If is an ultrafilter over relations, we have and by Lemma 3.17, hence the claim for homomorphisms w.r.t. relations holds by Theorem 3.24. ∎
This observation leads to the following definition:
Definition 3.26**.**
If and are two ultrafilter models of the same signature, we say that a map between their universes is a homomorphism (of ultrafilter models) iff it is a homomorphism of into (or a homomorphism of into , which is equivalent by Lemma 3.25).
The concepts of epimorphisms, quotients, isomorphic embeddings, submodels, elementary embeddings, elementary submodels, etc., for ultrafilter models are defined likewise.
The following can be considered as the First Extension Theorem for ultrafilter models:
Theorem 3.27**.**
Let and be two ultrafilter models of the same signature with the universes and , both having pseudo-principal interpretations on functional symbols, let and denote the models such that and , and so and , and let . The following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into ,* 3. (iii)
* is a homomorphism of into ,* 4. (iv)
* is a homomorphism of into :*
[TABLE]
Proof.
The equivalence of items (i) and (ii) follows from Theorem 3.22, Lemma 3.25, and the definition of homomorphisms of ultrafilter models. The equivalence of items (i), (iii), and (iv) repeats Theorem 3.24. ∎
For an ultrafilter model with the universe , the set of principal ultrafilters forms an ultrafilter submodel (and also ordinary submodels of and ) iff the interpretation in is pseudo-principal on functional symbols; this can be added as item (iv) to Theorem 3.22. We shall call the submodel consisting of principal ultrafilters the principal submodel. Thus Theorem 3.27 can be reformulated by replacing “both having pseudo-principal interpretations” with “both having principal submodels”.
In fact, we can omit here the assumption about the pseudo-principality in the ultrafilter model by applying the Second Extension Theorems (Theorems 1.11 and 1.13):
Theorem 3.28**.**
Let and be two ultrafilter models of the same signature with the universes and , let the interpretation of be pseudo-principal on functional symbols with the principal submodel (having the universe ), so and , and let . The following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into ,* 3. (iii)
* is a homomorphism of into ,* 4. (iv)
* is a homomorphism of into ,* 5. (v)
* is a homomorphism of into :*
[TABLE]
Proof.
The equivalence of items (i) and (iii) follows from Theorem 1.11 and Theorem 3.23(i), while the equivalence of items (ii) and (iii) follows from Theorem 1.13 and Theorem 3.23(ii). Finally, (ii) is equivalent to (iv) by Theorem 1.11 and to (v) by Theorem 1.13. ∎
Observe that, by Theorem 3.23, whenever the interpretation of is not pseudo-principal on functional symbols, then the models and are not of form and for any ordinary model ; nevertheless, these models still satisfy the conditions of Theorems 1.11 and 1.13 (playing the role of the model there). Therefore, Theorem 3.28 is indeed more general than Theorem 3.27; it has a character intermediate between the First and the Second Extension Theorems. To have a reasonable generalization of Second Extension Theorems in the full form, we need to have a more general concept of ultrafilter models; this is the subject of the next, last section of our article.
Remark 3.29**.**
Theorems 3.24–3.27 remain true for epimorphisms and isomorphic embeddings, and Theorem 3.28 for epimorphisms. Also they can be stated for so-called homotopies and isotopies; these concepts (generalizing homomorphisms and isomorphisms) for ordinary models, together with both extension theorems, were introduced in [27] (and [28]). For ultrafilter models they can be defined in the same way as this was done for homomorphisms and embeddings. Finally, versions for multi-sorted models (having rather many universes than one universe ) can be also easily stated.
4 Wider ultrafilter interpretations
Here we discuss a possible generalization of the Second Extension Theorems (Theorems 1.11 and 1.13) to ultrafilter models. For this, we should have a wider concept of ultrafilter models which, on the one hand, would replace compact Hausdorff right topological models in these theorems, and on the other hand, would turn into our previous concept of ultrafilter models whenever the universe is of form to include our versions of the First Extension Theorem for ultrafilter models (Theorems 3.27 and 3.28). Also we should have a concept of satisfiability in these models which would turn into the satisfiability in our previous ultrafilter model; recall that the latter can be redefined in terms of the map (Theorem 3.16). Actually, our new concepts of ultrafilter models and satisfiability will be wide enough to cover all ordinary models, not only ultrafilter extensions.
Ultrafilter models in the wide sense. The new definition of ultrafilter models requires only a minor modification of the former one. By an ultrafilter interpretation we still mean a map which takes functional and relational symbols to ultrafilters over operations and relations on a set . But valuations of variables now will be in the set itself, not in .
Definition 4.1**.**
Given a signature , an ultrafilter model of in the wide sense is a structure of the form
[TABLE]
where is the universe of (so individual variables are valuated by elements of ), each -ary functional symbol in is interpreted by some , and each -ary predicate symbol in is interpreted by some .
Ultrafilter models in the sense of Definition 3.1 will be referred to as ultrafilter models in the narrow sense. Henceforth we shall never omit the words “in the narrow sense”.
To revise the concept of satisfiability making it adequate for ultrafilter models in the wide sense, we use the notion of convergence of ultrafilters. Recall that a filter over a topological space converges to a point iff any neighborhood of belongs to . If a filter converges to a unique point then is called the limit of , in which case we shall write . As well-known, any filter over converges to at most one point iff is Hausdorff, and any ultrafilter over converges to at least one point iff is compact (see e.g. [12]; for the concept of -limit with ultrafilters see [17]). Note also that, even if is compact Hausdorff, some filter over that is not an ultrafilter may converge to no single point (consider e.g. any discrete with and the trivial filter consisting of as its single element).
For an ultrafilter model in the wide sense fix some topologies on the sets and for all such that the signature has -ary operations, respectively, relations.
Definition 4.2**.**
The ultrafilter model converges (w.r.t the specified family of topologies) to an ordinary model of the same signature iff the interpretation of each symbol in converges to one in . Moreover, is the limit of iff the interpretation of is the pointwise limit of one of , in which case we write .
Thus whenever the limits of all the ultrafilters exist then the ultrafilter model converges to its limit:
[TABLE]
which is an ordinary model of the same signature.
Definition 4.3**.**
The ultrafilter model (endowed with the specified family of topologies) has a well-defined satisfiability iff there exists the limit of , in which case we define it as the ordinary satisfiability in the limit:
[TABLE]
for all formulas and valuations .
We use the symbol for the renewed concept of satisfiability temporarily; after Theorem 4.5, which states that on ultrafilter models in the narrow sense this concept coincides with the former one, we shall continue to use the former symbol .
Let us firstly show that all ordinary models and the satisfiability in them can be regarded as ultrafilter models in the wide sense and the satisfiability defined via limits.
Theorem 4.4**.**
Any ordinary model with the usual satisfaction relation is (up to a natural identification) an ultrafilter model with the satisfaction relation , so we have
[TABLE]
for all formulas and valuations . Moreover, the same is true for ordinary models endowed with arbitrary topologies.
Proof.
Define as follows: let the universe of coincide with one of , which we denote by , and let the interpretation in be the principal interpretation giving with one in , i.e. if an -ary functional symbol is interpreted in by then it is interpreted in by the principal ultrafilter over given by , and likewise for predicate symbols. We can suppose that all topologies on and are discrete. Since any principal ultrafilter given by a point has the limit , we conclude that in coincides with in . Moreover, the same fact is true for every topologies on and , which proves the last claim of the theorem. ∎
Now we are going to show that the wider concepts of ultrafilter models and the satisfiability in them cover the former, narrow concepts. (Let us also note that the new concept is not exhausted by the two cases of ordinary models and ultrafilter models in the narrow sense.)
Theorem 4.5**.**
Any ultrafilter model in the narrow sense with the satisfaction relation is, up to a natural identification, an ultrafilter model in the wide sense with the satisfaction relation defined via limits in certain appropriate topologies, so we have
[TABLE]
for all formulas and valuations .
Proof.
We start by describing how to represent an ultrafilter model in the narrow sense by a certain ultrafilter model in the wide sense. Let be the universe of , and suppose that the universe of coincides with it. Now we must identify ultrafilters over the sets and with certain ultrafilters over the sets and , respectively. Let us provide a more general procedure, which will be referred to as the identification map and denoted by .
Identification map . For any positive , discrete spaces , compact Hausdorff space , and , we construct the map taking ultrafilters over to ultrafilters over :
[TABLE]
The construction is going in two steps.
First, recall that the map provides a canonical one-to-one correspondence between the set and its image
[TABLE]
This induces the bijection + of onto taking each ultrafilter over to an ultrafilter over by letting
[TABLE]
Second, for any we define the lifting map of into , by letting for all ,
[TABLE]
Define also the projection map of into , by letting for all such ,
[TABLE]
Clearly, the domain of the projection is the range of the lifting, and moreover, and , thus the lifting and the projection maps are two mutually inverse bijections. (Often one identifies these ultrafilters, thus considering as the closed subset of consisting of those ultrafilters over that are concentrated on , see e.g. [17], Section 3.3).
Now we define as the composition of
- and lifting, thus for all we let
[TABLE]
In result, for any ultrafilter over , its image is an ultrafilter over which is concentrated on {\mathop{\mathrm{ext}}\nolimits}\/``\,S^{X_{1}\times\ldots\times X_{n}}=\bigl{\{}\widetilde{f}:f\in S^{X_{1}\times\ldots\times X_{n}}\bigr{\}}.
Let us now expand the domain of the map to ultrafilters over relations. We want to get taking ultrafilters over to ultrafilters over
[TABLE]
For this, we may identify -ary relations with their characteristic functions, i.e. -ary maps into , where is endowed with the discrete topology, and use the definition of for ultrafilters over maps (with ). Equivalently, we might imitate the above construction: for each we might turn it firstly to where , so by Theorem 1.14,
[TABLE]
by letting
[TABLE]
and secondly, by lifting the obtaining ultrafilter to an ultrafilter over , thus letting
[TABLE]
In result, for any ultrafilter over , its image is an ultrafilter over which is concentrated on is right clopen w.r.t. .
Remark 4.6**.**
In fact, the map + is for considered as a bijection between two discrete spaces, and thus a homeomorphism between the spaces of ultrafilters over them.
For maps these discrete spaces are and , so is a homeomorphism between and , and :
[TABLE]
and analogously, for relations the discrete spaces are and , so is a homeomorphism between and , and :
[TABLE]
(cf. Remark 2.8 explaining a similar situation with currying). Nevertheless, we use the symbol + to avoid confusing with for the map into a compact Hausdorff space , which will be also used in our arguments below.
Lemma 4.7**.**
The map is a bijection between:
- (i)
the set of all ultrafilters over and the set of the ultrafilters over that are concentrated on , 2. (ii)
the set of all ultrafilters over and the set of the ultrafilters over that are concentrated on .
Proof.
For brevity, we let:
[TABLE]
As we have already pointed out, the map + is a bijection of onto , and the lifting map is a bijection of onto . Therefore, , as the composition of the two maps, is a bijection of onto , which proves item (i). Item (ii) is either proved similarly or obtained from (i) by replacing relations with their characteristic functions. (We may also note that these maps are homeomorphic embeddings.) ∎
Let us now turn back to Theorem 4.5 and the discussed there situation with ultrafilter models in the former, narrow sense. In this case, all the discrete spaces are equal to , while the compact Hausdorff space is and its subset is or in the cases of operations and relations of the model, respectively. (Recall that we identify elements of with the principal ultrafilters given by them, so any -ary operation on is identified with a map of into .) We expand to ultrafilter models in the narrow sense by defining it pointwise:
Definition 4.8**.**
Given an ultrafilter model in the narrow sense, we let
[TABLE]
Continuing the proof of Theorem 4.5, we define , the ultrafilter model in the wide sense corresponding to , the given ultrafilter model in the narrow sense, by letting
[TABLE]
It remains to verify that the new satisfiability, defined via limits, coincides with the old one. By Theorem 3.16, which states that for all formulas and valuations , we have iff the latter can be redefined via the map . Therefore, it suffices to check that for all formulas and valuations , we have
[TABLE]
But actually, a stronger fact is true:
[TABLE]
thus leading to the following result.
Theorem 4.9**.**
If is an ultrafiler model in the narrow sense, then :
[TABLE]
Proof.
We must verify the equalities and for all and . This will be stated in the next, more general lemma.
Recall once more that the map on ultrafilters over -ary maps is , the continuous extension of the map , where the latter, in turn, takes -ary maps of discrete spaces into a compact Hausdorff space , to their extensions that are right continuous w.r.t. , and that these extensions form a compact Hausdorff space w.r.t. the -pointwise convergence topology:
[TABLE]
The next lemma states that the map is the composition of the identification map and taking the limit.
Lemma 4.10**.**
Let be discrete spaces, a compact Hausdorff space, and let the spaces and is right clopen w.r.t. be endowed with the -pointwise convergence topologies. Then we have
[TABLE]
for every ultrafilters and
Proof.
For brevity, let denote the space . By Lemma 2.4, the space is compact Hausdorff. Hence, , which is an ultrafilter over the set concentrated on its subset and thus can be identified with its projection to , converges to a unique point of , i.e. has a limit in . We need to show that the limit is exactly the map .
Denote by . Then, since and , we get:
[TABLE]
Therefore, for every and any neighborhood of the point in the space, there exists such that ; here we use that the set is dense in by Lemma 2.5.
Let us verify that, moreover, for any neighborhood of the set is in . Assume the converse: there exists a neighborhood of such that the set is not in . Then, as is an ultrafilter, the complement
[TABLE]
is in . However, this contradicts to the above stated fact.
The case of ultrafilters over relations reduces to the case of ultrafilters over maps with . The lemma is proved. ∎
This proves Theorem 4.9. ∎
Now the proof of Theorem 4.5 is complete. ∎
Theorem 4.5 permits us to eliminate our temporary symbol and use the former symbol also to denote the satisfaction in ultrafilter models in the wide sense. Moreover, by Theorem 4.4 we might use the only ordinary symbol to denote the satisfaction in both ordinary and ultrafilter models; we however prefer to retain the symbol for a convenience of reading.
Finally, we refine the first part of Theorem 4.5 (concerning rather models than the satisfaction relation) by characterizing the ultrafilter models in the wide sense that correspond to those in the narrow sense:
Theorem 4.11**.**
Let be an ultrafilter model in the wide sense. Then:
- (i)
* for some ultrafilter model in the narrow sense iff the universe of is for some and the interpretation takes all functional symbols to ultrafilters concentrated on , and all relational symbols to ultrafilters concentrated on is right clopen w.r.t. ;* 2. (ii)
* for some ordinary model iff the universe of is for some and the interpretation takes all functional symbols to ultrafilters in is pseudo-principal , and all relational symbols to ultrafilters concentrated on is right clopen w.r.t. .*
Proof.
Item (i) is immediate from Lemma 4.7; we recall only that the images of ultrafilters over under are exactly ultrafilters over that are concentrated on :
[TABLE]
Item (ii) follows from item (i) and Theorem 3.22. ∎
Map . Here we consider a variant of the map , which we denote by . This map relates to the operation in the same way as the map to the operation does (which explains our choosing of the symbol ).
The map has the same domain and range that the map does:
[TABLE]
and is defined as follows: on ultrafilters over it coincides with , and on ultrafilters over it is defined likewise except for taking × instead of +, where uses rather than , i.e. turning not to but to (recall that, by Theorem 1.14, is a bijection between all subsets of and regular closed subsets of ).
Thus for each we might turn it firstly to where , so by Theorem 1.14,
[TABLE]
by letting
[TABLE]
and secondly, by lifting the obtained ultrafilter to an ultrafilter over , thus letting
[TABLE]
In result, for any ultrafilter over , its image is an ultrafilter over which is concentrated on is regular closed . (To make an analogy between + and × more complete, we can also let that × is defined on ultrafilters over and coincides there with + ; but in fact we do not need this.)
Remark 4.12**.**
Again, the map × is for considered as a bijection between two discrete spaces and , so is a homeomorphism between and , and :
[TABLE]
Nevertheless, we use the symbol × to keep the analogy with + .
Two next lemmas and the subsequent theorem are counterparts of Lemmas 4.7 and 4.10 and Theorem 4.9, respectively.
Lemma 4.13**.**
The map is a bijection between:
- (i)
the set of all ultrafilters over and the set of the ultrafilters over that are concentrated on , 2. (ii)
the set of all ultrafilters over and the set of the ultrafilters over that are concentrated on .
Proof.
Item (i) just repeats Lemma 4.7(i) since coincides with on ultrafilters over maps. For item (ii), let
[TABLE]
(Here the closure refers to the product topology where the spaces are endowed with their standard topologies, and the set in the definition of is considered as a discrete space.) As the map × is a bijection of onto and the lifting map is a bijection of onto , the map , which the composition of the two maps, is a bijection of onto , thus proving (ii). ∎
In what follows we consider the space endowed with the usual product topology of the spaces and the set of regular closed sets in this space endowed with a compact Hausdorff topology. This topology is induced from the compact Hausdorff space , which we identify with the space (where is discrete and the space carries the usual product topology) by the natural bijection taking to .
Recall also that by Lemma 2.4 (and its proof), the -pointwise convergence topology on can be induced from the product topology on by the bijection , which takes each to . In particular, if then on relations (identified with their characteristic functions), which takes each to , induces the above considered compact Hausdorff topology on . Therefore, we have three homeomorphic spaces: the space of subsets of and its images under the homeomorphisms and taking into each others:
[TABLE]
where
[TABLE]
Question 4.14**.**
Redefine the topology on the set as a restricted version of the Vietoris topology (in an analogy with the restricted version of pointwise convergence topology turning out into a compact Hausdorff space homeomorphic to the product space ). Note that we cannot use the usual (unrestricted) Vietoris topology since in it, is not a closed subset of the space is closed. (Problem 5.7.)
Lemma 4.15**.**
Let be the homeomorphism between and taking to . Then we have
[TABLE]
[TABLE]
Proof.
The equality follows from Theorem 3.17 and, in turn, implies the equality . ∎
Lemma 4.16**.**
Let be discrete spaces, a compact Hausdorff space, and let the spaces and is regular closed be endowed with the topology induced from and , respectively. Then we have
[TABLE]
for every ultrafilters and
Proof.
The first equality repeats the first equality in Lemma 4.10 as the topology on induced from coincides with the -pointwise convergence topology by Theorem 2.4.
For the second equality, recall first a general fact: if a map is continuous and is an ultrafilter over , then whenever both limits exist. It easily follows that if is a homeomorphism, then and . In our situation, we have:
[TABLE]
where the first equality holds by this general fact, the second follows from Lemma 4.15, the third holds by Lemma 4.10, and the last again by Lemma 4.15. ∎
Likewise , we expand to ultrafilter models in the narrow sense pointwise:
Definition 4.17**.**
For all ultrafilter models in the narrow sense, let
[TABLE]
Theorem 4.18**.**
If is an ultrafilter model in the narrow sense, then :
[TABLE]
Proof.
Immediate from Lemma 4.16. ∎
We summarize the interplay between ultrafilter models in the narrow sense, their limits, and the operations , , and (where is defined on models of form as expected) in the following diagram:
[TABLE]
Despite the fact that Theorem 4.18 is an -analog of Theorem 4.9 used to get Theorem 4.5, the latter theorem has no such analog. This is due to an asymmetry between the operations and w.r.t. the satisfiability in ultrafilter models in the narrow sense, as it has been defined: there is no -analog of Theorem 3.16, which was also used in proving Theorem 4.5 (cf., however, Problem 5.5). Nonetheless, we are still able to get a counterpart of Theorem 4.11, which does not involve satisfiability:
Theorem 4.19**.**
Let be an ultrafilter model in the wide sense. Then:
- (i)
* for some ultrafilter model in the narrow sense iff the universe of is for some and the interpretation takes all functional symbols to ultrafilters concentrated on , and all relational symbols to ultrafilters concentrated on is regular closed ;* 2. (ii)
* for some ordinary model iff the universe of is for some and the interpretation takes all functional symbols to ultrafilters in is pseudo-principal , and all relational symbols to ultrafilters concentrated on is regular closed .*
Proof.
Item (i) is immediate from Lemma 4.13; recall that the images of ultrafilters over under are exactly ultrafilters over that are concentrated on :
[TABLE]
Item (ii) follows from item (i) and Theorem 3.22. ∎
Second Extension Theorems. Now we define homomorphisms between ultrafilter models in the wide sense as homomorphisms of their limits:
Definition 4.20**.**
Let and be two ultrafilter models in the wide sense, of the same signature, with the universes and , respectively. A map is a homomorphism (of ultrafilter models in the wide sense) iff it is a homomorphism of into .
Theorem 4.5 guaranties that for ultrafilter models in the narrow sense, Definition 4.20 gives the same, up to the identification map , that Definition 3.26. Similar concepts (epimorphisms, quotients, isomorphic embeddings, submodels, elementary embeddings, elementary submodels, etc. of ultrafilter models in the wide sense) are defined likewise and also coincide with the corresponding concepts for ultrafilter models in the narrow sense.
The proofs of the Second Extension Theorems (Theorems 1.11 and 1.13) are based on Theorems 1.10 and 1.12, which describe the topological properties of the - and ∗-extensions, respectively, and a result called the “abstract extension theorem” in [28]. This result is rather about restrictions of continuous maps than about continuous extensions of maps, but it also states that such a map is a homomorphism of the whole models whenever it is a homomorphism of certain submodels in them; we restate it in the next theorem:
Theorem 4.21**.**
Let and be two (ordinary) models of the same signature whose universes and , respectively, both carry topologies, the topology on is Hausdorff, and let be a dense subset of which forms a submodel of . Let, moreover, be a continuous map, and suppose that
- (a)
all operations in are right continuous w.r.t. , and in right continuous w.r.t. , 2. (b)
one of two following items holds:
- ()
all relations in are right open w.r.t. , and in right closed w.r.t. , 2. ()
all relations in are regular closed in the product topology on , in closed in the product topology on (where is the arity of a given relation), and is a closed map.
Then the following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of *
[TABLE]
where denotes the submodel of with the universe .
Proof.
That (ii) implies (i) is trivial since is a submodel of . For the converse implication in the case of (), see [27] or [28], Theorem 4.1. The case of () is obtained from the case of () as follows.
If is an -ary relation on belonging to the model , consider as a unary relation on and note that under (i), the restriction is also a homomorphism between the model and the model , where is the interior of in the product topology on , so the set is an open unary relation on , and is the relation on interpreting the same predicate symbol that doing and also considered as a unary relation on . By () we conclude that is a homomorphism between and . But as in the case of () the map is closed, we have: , thus is a homomorphism between and . Finally, as under (), is regular closed in and is closed in , we have and , thus showing that is a homomorphism between and , and hence, between and where the relations and are considered as -ary. This gives (ii), completing the proof of the theorem. ∎
Remark 4.22**.**
The argument for proving () from () allows to obtain stronger statements. Instead of the assumption of (), it suffices to suppose that the interior of is dense in the closure of , i.e. the closure of is regular closed: This includes the cases of open as well as of regular closed . Also instead of the assumption of (), it suffices to suppose that “has right dense interior w.r.t. ”, i.e. that for each , and every and , the set has the interior dense in the closure of this set. As easy to see, in both cases the same proof works as well.
The same is applied to the following theorem.
The next result is an immediate analog of Theorem 4.21 for ultrafilter models in the wide sense.
Theorem 4.23**.**
Let and be two ultrafilter models in the wide sense, of the same signature, whose universes and , respectively, both carry topologies, the topology on is Hausdorff, and let be a dense subset of which forms an ultrafilter submodel of . Let, moreover, be a continuous map, and suppose that for any ,
- (a)
-ary functional symbols are interpreted: in by ultrafilters having limits in , and in by ultrafilters having limits in , 2. (b)
one of two following items holds:
- ()
-ary predicate symbols are interpreted: in by ultrafilters having limits in is right open w.r.t. , and in by ultrafilters having limits in is right closed w.r.t. , 2. ()
-ary predicate symbols are interpreted: in by ultrafilters having limits in is regular closed , and in by ultrafilters having limits in is closed , in the product topologies on and , respectively, and is a closed map.
Then the following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into :*
[TABLE]
where denotes the ultrafilter submodel of with the universe .
Proof.
By definition, homomorphisms of ultrafilter models , , and are precisely homomorphisms of the ordinary models , , and . Now apply Theorem 4.21 to the latter three models. ∎
Note that Theorem 4.23 includes Theorem 4.21 as a particular case by identifying operations and relations with principal ultrafilters given by them as in Theorem 4.4.
Before formulating an extension theorem for ultrafilter models in the wide sense, let us state one more auxiliary result:
Lemma 4.24**.**
Let and be two ultrafilter models in the wide sense, of the same signature, whose universes and , respectively, both carry topologies where the topology on is standard, let coincide, up to the identification map , with an ultrafilter model in the narrow sense (also having the universe ), and let . Then the following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into .*
If moreover, the interpretation in takes -ary predicate symbols to ultrafilters having limits in is closed where carries the product topology, and the map is closed, then the following item:
- (iii)
* is a homomorphism of into ,*
also is equivalent to each of items (i) and (ii):
[TABLE]
Proof.
Before proving the equivalences, recall that by Theorem 4.4, the ordinary models and are identified with ultrafilter models in the wide sense having the principal interpretations, and the limits of the principal ultrafilters over the sets of operations and relations are the operations and relations that generate them. The formulations of (i) and (ii) imply such an identification.
The equivalence of items (i) and (ii) requires no special assumptions about , , and ; it is immediate from the following: our definition of homomorphisms of ultrafilter models via their limits, the assumption , and the equality stated in Theorem 4.9.
To prove that item (iii) under the additional assumption is also equivalent to (i) and (ii), we repeat the part of the proof of Theorem 4.21 that deduces the case of () from the case of (), taking into account Theorem 3.23 stating that all relations in are regular closed in the product topology on .
The proof is complete. ∎
Now we are ready to formulate a version of the Second Extension Theorem for ultrafilter models in the wide sense.
Theorem 4.25**.**
Let and be two ultrafilter models in the wide sense, of the same signature, let carry its standard topology and a compact Hausdorff topology, let , and suppose that
- (a)
* coincides, up to the identification map , with an ultrafilter model in the narrow sense, and the interpretation in is pseudo-principal on functional symbols with the principal submodel (having the universe ),* 2. (b)
the interpretation in takes all -ary functional symbols to ultrafilters having limits in , and all -ary predicate symbols to ultrafilters having limits in is right closed w.r.t. , for any .
Then the following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into ,* 3. (iii)
* is a homomorphism of into .*
If moreover, the interpretation in takes -ary predicate symbols to ultrafilters having limits in is closed where carries the product topology, then the following item:
- (iv)
* is a homomorphism of into ,*
also is equivalent to each of items (i)–(iii):
[TABLE]
Proof.
The assumptions about , , and of this theorem repeat the assumptions about , , and of Lemma 4.24 with an extra requirement stating that the interpretation in is pseudo-principal on functional symbols. So as the principal submodel of is , we have and by Theorem 3.22. Thus by Lemma 4.24, items (ii) and (iii) are equivalent, and under the additional assumption about , item (iv) is also equivalent to each of them.
Let us now prove that (i) and (ii) are equivalent. It suffices to show that the models and satisfy the conditions of Theorem 4.23(). For , this is true by the assumption of (b). As for , by the assumption of (a) we have with an ultrafilter model in the narrow sense. Furthermore, is an ultrafilter model in the wide sense, and by Lemma 4.7, the interpretation of takes functional symbols to ultrafilters concentrated on , and relational symbols to ultrafilters concentrated on is right clopen w.r.t. . Therefore, the ultrafilters have limits in these sets endowed with the -pointwise convergence topologies as the latter are compact Hausdorff by Lemma 2.4. Thus also satisfies the conditions of Theorem 4.23(), with the principal submodel here as the submodel from that theorem (again by identifying ordinary models with ultrafilter models having the principal interpretations). This shows the equivalence of (i) and (ii), thus completing the proof. ∎
Finally, by changing with , we obtain the counterparts of Lemma 4.24 and Theorem 4.25:
Lemma 4.26**.**
Let and be two ultrafilter models in the wide sense, of the same signature, whose universes and , respectively, both carry topologies where the topology on is standard, let , and suppose that
- (a)
* for some ultrafilter model in the narrow sense (also having the universe ),* 2. (b)
the interpretation in takes all -ary functional symbols to ultrafilters having limits in , and all -ary predicate symbols to ultrafilters having limits in is closed where carries the product topology.
Then the following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into ,* 3. (iii)
* is a homomorphism of into :*
[TABLE]
Proof.
Again, by using Theorem 4.4, we identify the ordinary models and in (ii) and (iii) with the corresponding ultrafilter models in the wide sense having the principal interpretations (and thus having and as their limits). The equivalence of items (i) and (iii) is immediate from the following: our definition of homomorphisms of ultrafilter models via their limits, the assumption , and the equality stated in Theorem 4.18. But then item (ii) is also equivalent to each of items (i) and (iii) since the identity map on is a homomorphism of onto by Theorem 3.19. The proof is complete. ∎
Theorem 4.27**.**
Let and be two ultrafilter models in the wide sense, of the same signature, let carry its standard topology and a compact Hausdorff topology, let , and suppose that
- (a)
* for some ultrafilter model in the narrow sense, and the interpretation in is pseudo-principal on functional symbols with the principal submodel (having the universe ),* 2. (b)
the interpretation in takes all -ary functional symbols to ultrafilters having limits in , and all -ary predicate symbols to ultrafilters having limits in is closed where carries the product topology.
Then the following are equivalent:
- (i)
* is a homomorphism of into ,* 2. (ii)
* is a homomorphism of into ,* 3. (iii)
* is a homomorphism of into ,* 4. (iv)
* is a homomorphism of into :*
[TABLE]
Proof.
The assumptions about , , and of this theorem repeat the assumptions about , , and of Lemma 4.26 with an extra requirement stating that the interpretation in is pseudo-principal on functional symbols. So as the principal submodel of is , we have and by Theorem 3.22. Thus by Lemma 4.26, items (ii), (iii), and (iv) all are equivalent.
Let us now prove that (i) and (ii) are equivalent. It suffices to show that the models and satisfy the conditions of Theorem 4.23(). For , this is true by the assumption of (b). As for , by the assumption of (a) we have with an ultrafilter model in the narrow sense. Furthermore, is an ultrafilter model in the wide sense, and by Lemma 4.13, the interpretation of takes functional symbols to ultrafilters concentrated on , and relational symbols to ultrafilters concentrated on is regular closed . Therefore, the ultrafilters have limits in these sets endowed with the corresponding compact Hausdorff topologies described above. Thus also satisfies the conditions of Theorem 4.23(), with the principal submodel here as the submodel from that theorem (again by identifying ordinary models with ultrafilter models having the principal interpretations). This shows the equivalence of (i) and (ii), thus completing the proof. ∎
Remark 4.28**.**
Theorems 4.21–4.27 admits some variants and generalizations. E.g. they remain true for epimorphisms (since for any compact Hausdorff , if is such that is dense in , then is surjective), as well as for homotopies and isotopies (in sense of [27], [28]), which can be defined for ultrafilter models in the wide sense in the same way as this was done for homomorphisms and embeddings. Also versions for multi-sorted models (having rather many universes than one universe ) can be easily stated.
5 Problems
This section contains a list of questions and tasks, including all ones posed in the text above. Some of them are rather technical (Problems 5.1, 5.3, 5.4, 5.7) while others are more program.
Problem 5.1**.**
Does Lemma 2.5 remain true for the space (or moreover, the space ) endowed with the full pointwise convergence topology? i.e. given discrete spaces , a compact Hausdorff space , and a dense subset of , is the set
[TABLE]
dense in this space? It can be seen that the answer is affirmative for unary maps, i.e. the set is dense in . What happens for binary maps?
Problem 5.2**.**
Given discrete and compact Hausdorff , let be a map of endowed with the discrete topology into endowed with the usual product topology (or equivalently, the usual pointwise convergence topology). As the range is a compact Hausdorff space, the map continuously extends to :
[TABLE]
Can this alternative version of self-applying of the map lead to some interesting possibilities, including variants of the theory of ultrafilter models?
Note that now does not coincide with (unlike our previous situation); however, the latter set is still dense in the former:
[TABLE]
Also, is this version of surjective? This would be the case if the previous question in its stronger form, i.e. for the space , had the affirmative answer.
Problem 5.3**.**
For which compact Hausdorff spaces , instead of with a discrete , does Lemma 3.10 remain true, i.e. for any discrete and the map defined as in the remark in the beginning of Section 3:
[TABLE]
the statements
[TABLE]
hold for all and Does this hold at least for all compact Hausdorff spaces that are zero-dimensional, or extremally disconnected?
Problem 5.4**.**
What are topological properties of the subset of the space consisting of pseudo-principal ultrafilters? Of the preimage of this set under , i.e. the set , in the space with the -pointwise convergence topology (except for the fact that it is dense there, as stated in Lemma 2.5), or with the (usual) pointwise convergence topology? in the space with the pointwise convergence topology?
Often objects naturally defined in terms of ultrafilter extensions have rather hardly definable topological properties, as shown in [18, 19].
In the next two problems, we wonder about variants of the definition of the satisfiability in ultrafilter models in the narrow sense.
Problem 5.5**.**
Define an alternative satisfaction relation by using rather than ; i.e. if is an atomic formula in which is not the equality predicate, let
[TABLE]
Does this give a -counterpart of the semantics of ultrafilter models in the narrow sense? More precisely, is the following -counterpart of Theorem 3.16 true: If is an ultrafilter model in the narrow sense, then for all formulas and elements of the universe of ,
[TABLE]
(where has this new meaning)?
Problem 5.6**.**
Another way to vary the definition is by letting
[TABLE]
This version looks less smooth. Does this, nevertheless, give something interesting?
Problem 5.7**.**
To define the map , we considered the set of regular closed subsets of the space with a topology turning it into a space homeomorphic to the usual product space with the discrete space . Redefine this topology on as a restricted version of Vietoris topology (in an analogy with the restricted version of pointwise convergence topology turning out into a compact Hausdorff space homeomorphic to the product space ). Note that in the usual Vietoris topology, the space is closed is compact Hausdorff but is not a closed subspace of it.
Problem 5.8**.**
Investigate filter extensions of first-order models (as was started in [16, 31]) and the corresponding concepts of filter interpretations and filter models.
Problem 5.9**.**
Isolate and investigate other possible types of ultrafilter extensions (in the sense of Definition 1.1), besides the - and ∗-extensions, establish special features of the two canonical extensions among others (as was proposed at the end of [31]).
Problem 5.10**.**
Investigate ultrafilter extensions of syntax (including those of languages, of valuation and interpretation maps, of the satisfaction relation).
Problem 5.11**.**
Investigate iterations of ultrafilter extensions (taking unions at limit steps).
Problem 5.12**.**
Investigate higher-order and infinitary analogs of ultrafilter extensions and ultrafilter interpretations, more generally, analogs for model-theoretic languages (in the sense of [1]).
Problem 5.13**.**
The ∗-extensions play a special role in modal propositional logic; if is a model of a relational language, all canonical modal formulas are preserved under passing from to , provided both first-order models are considered as Kripke frames (see [2, 5]). What is a (non-classical) propositional logic with a similar property w.r.t. the -extensions? (Perhaps, this connects to Shelah’s theorem on fragments of second-order logic, see [33, 1].)
Problem 5.14**.**
Do the concepts of ultrafilter interpretations and ultrafilter models have any interesting applications? e.g. combinatorial (Ramsey-theoretic) applications in model theory?
Also a list of problems related to ultrafilter extensions can be found in Section 5 of [28].
Acknowledgement. We would like to express our gratitude to Professors Robert I. Goldblatt and Neil Hindman who provided us some useful historical information. We are also indebted to two anonymous referees for some critical remarks and suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Barwise, S. Feferman (eds.). Model-theoretic logics . Perspectives in Mathem. Logic 8, Springer-Verlag, 1985.
- 2[2] J. F. A. K. van Benthem. Canonical modal logics and ultrafilter extensions. J. Symbolic Logic 44:1 (1979), 1–8.
- 3[3] J. F. A. K. van Benthem. Notes on modal definability. Notre Dame J. Formal Logic, 30:1 (1988), 20–35.
- 4[4] J. Berglund, H. Junghenn, P. Milnes. Analysis on semigroups . Wiley, New York, 1989.
- 5[5] P. Blackburn, M. de Rijke, Y. Venema. Modal logic . Cambridge Univ. Press, Cambridge, 2004.
- 6[6] E. Čech. On bicompact spaces. Ann. of Math. 38:2 (1937), 823–844.
- 7[7] C. C. Chang, H. J. Keisler. Model theory. North-Holland, Amsterdam–London–N.Y., 1973.
- 8[8] W. W. Comfort, S. Negrepontis. The theory of ultrafilters. Springer, Berlin, 1974.
