1 Introduction
This work is motivated by problems in both set theory and model theory. With regard to set theory, the central motivation arises from problems involving rigidity of quotient structures. In 1979, Shelah described a forcing extension of the universe where all automorphisms of the Boolean algebra
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
are induced by a bijection
$f_\Phi $
between two cofinite subsets of
${\mathbb N}$
([Reference Shelah64]). Another way to state Shelah’s result is that there is a Boolean algebra endomorphism
$\Phi _*$
of
$\mathcal P({\mathbb N})$
such that the following diagram commutes (vertical arrows correspond to quotient maps).

In other words, in Shelah’s model every automorphismFootnote
1
$\Phi $
of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
can be lifted by an endomorphism
$\Phi _*$
of
$\mathcal P({\mathbb N})$
. Such automorphisms are called trivial. By a 1956 result of W. Rudin, the Continuum Hypothesis implies that there are
$2^{2^{\aleph _0}}$
nontrivial automorphisms of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
. This is an immediate consequence of the fact that
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
is
$\aleph _1$
-saturated, a notion not yet isolated at the time of Rudin’s work.
Shelah’s conclusion held in a very specific forcing extension of the universe (Shelah’s oracle-cc forcing notion was invented for the purpose of finding this extension!), but it was soon proved to follow from forcing axiomsFootnote
2
([Reference Shelah and Steprāns66, Reference Veličković72]). Analogous lifting results from forcing axioms were proven for quotient algebras of the form
$\mathcal P({\mathbb N})/{\mathcal I}$
for numerous Borel ideals
${\mathcal I}$
on
${\mathbb N}$
(
$\mathcal P({\mathbb N})$
is given the Cantor set topology). These early results are summarized in [Reference Farah21, Reference Farah, Ghasemi, Vaccaro and Vignati25].
New impetus to the study of set-theoretic rigidity theory was given by the solution to a prominent 1977 problem in the theory of operator algebras ([Reference Brown, Douglas and Fillmore5]) asking whether the Calkin algebra has outer automorphisms. The Calkin algebra is the quotient of the algebra
$\mathcal B(H)$
of all bounded linear operators on the separable, infinite-dimensional, complex Hilbert space modulo the ideal of compact operators, and it is generally considered to be the noncommutative analogue of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
. The analogues of Rudin’s and Shelah’s results were proved in [Reference Phillips and Weaver60] and [Reference Farah22], respectively, surprisingly showing that the answer to the Brown–Douglas–Fillmore question is independent of ZFC. (The fact that the proof that all automorphisms of the Calkin algebra are inner owes a lot to the ideas presented in [Reference Farah21] may be even more surprising.) A far-reaching generalization of [Reference Farah22] showing rigidity of coronas of other separable
$\mathrm {C}^*$
-algebras was obtained in [Reference Vignati73].
The algebra
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
is isomorphic to the reduced product of two-element Boolean algebras modulo
$ {\mathrm {Fin}}$
, and it was generally believed by the experts that the chances of a sweeping extension of Shelah’s rigidity result to reduced products of other structures were slim. However, in [Reference De Bondt, Farah and Vignati15] it was shown that in categories of linear orders, trees and sufficiently random graphs, forcing axioms imply that isomorphisms between reduced products are, with the appropriate definition, trivial. In [Reference De Bondt, Farah and Vignati14] it was proven that stable (in the model-theoretic sense) reduced products associated with
$ {\mathrm {Fin}}$
are automatically
$2^{\aleph _0}$
-saturated, giving the analogue of Rudin’s result. In the domain of continuous structures, the first results were on rigidity of coronas of
$\mathrm {C}^*$
-algebras ([Reference Farah22], [Reference Ghasemi29], [Reference McKenney and Vignati47], [Reference Vignati73]; see [Reference Farah23, §17] for an overview), and they have recently been extended to symmetric groups with respect to the Hamming metric ([Reference De Bondt and Thom16]). In the context of metric structures, the situation is made more complicated (or rather, more interesting) because all considerations necessarily involve Ulam stability of approximate homomorphisms ([Reference McKenney and Vignati46]; see [Reference Ulam70]). For the state of the art of rigidity of quotient structures, both discrete and metric, see [Reference Farah, Ghasemi, Vaccaro and Vignati25] and in particular §5 for a discussion of the role of Ulam stability.
In the present paper, we continue the investigation of set-theoretic rigidity. Fundamental questions from this perspective include the following:
-
(1) How does the isomorphism type of a reduced product $\prod _{\mathcal I}\mathcal M_{i}$
depend on the indexed family of structures
$(\mathcal M_i)_i$
and the ideal
${\mathcal I}$
? -
(2) Can one isolate the right notion of a trivial isomorphism between reduced products, and prove that forcing axioms imply all isomorphisms are trivial for appropriate classes of reduced products?
Analogous rigidity questions for reduced products of groups were studied in [Reference Kanovei and Reeken37] and [Reference Kanovei and Reeken38]. These results are concerned with rigidity of those isomorphisms between quotients that have Borel-measurable liftings (‘topologically trivial’ in the terminology of [Reference Farah, Ghasemi, Vaccaro and Vignati25]) and are closely connected to the well-studied Ulam stability of approximate homomorphisms (see [Reference Farah, Ghasemi, Vaccaro and Vignati25, §4]). This assumption is not necessary in our context as our results are applicable to arbitrary isomorphisms.
Both of the above questions admit partial, yet substantive answers when considering whether or not our reduced product is composed of structures from a class which recognizes coordinates. The notion of a class of structures of the same language recognizing coordinates (Definition 2.5) was isolated in [Reference De Bondt, Farah and Vignati15]. There, it was proved that if a class
$\mathfrak C$
recognizes coordinates, then forcing axioms imply that isomorphisms between reduced products of structures from
$\mathfrak C$
over the Fréchet ideal
$ {\mathrm {Fin}}$
are ‘trivial’. By trivial, we mean that every such isomorphism between reduced products can be lifted by a bijection
$\pi $
between cofinite sets and bijections
$f_i\colon \mathcal N_i\to \mathcal M_{\pi (i)}$
([Reference De Bondt, Farah and Vignati15, Theorem 7]). If the language is finite, then in addition we may require that each
$f_i$
is an isomorphism. If the language is infinite, this is no longer true (see e.g., [Reference De Bondt, Farah and Vignati15, Example 2.3]). Instead, for every finite fragment of the language all but finitely many of the
$f_i$
are isomorphisms.
The use of additional set-theoretic axioms is necessary because the Continuum Hypothesis implies that reduced products over
$ {\mathrm {Fin}}$
are saturated and so isomorphism between reduced products reduces to elementary equivalence. On the other hand, some classes of structures do not recognize coordinates. In [Reference De Bondt, Farah and Vignati14, Theorem 1] it was proved that if a reduced product of countable structures over
$ {\mathrm {Fin}}$
has a stable theory, then it is saturated provably in ZFC. In particular, such a reduced product has
$2^{2^{\aleph _0}}$
automorphisms and (since there are at most
$2^{\aleph _0}$
trivial automorphisms for any reasonable definition of ‘trivial’) the underlying class of structures cannot recognize coordinates.
Consequently, whether a class of structures recognizes coordinates determines the rigidity behaviour associated with reduced products from that particular class. We continue the study of this property and our results proceed in two directions: general theory and examples with an emphasis on groups. First, we prove that recognizing coordinates is necessarily witnessed by a first-order condition. In the introduction to [Reference De Bondt, Farah and Vignati15, §2.2] it was pointed out that a satisfactory proof that a theory recognizes coordinates would proceed by proving the equivalence of (1) and (2) of Theorem 1 below. The equivalence of recognizing coordinates with (3) provides an even more palpable (and necessary) criterion for recognizing coordinates (all natural classes of structures are full; see Definition 2.4; for the definition and relevance of h-formulas see §2.3).
Theorem 1. For a full class
$\mathfrak C$
of
$\mathcal {L}$
-structures, the following are equivalent.
-
(1) $\mathfrak C$
recognizes coordinates. -
(2) For every index set $\mathbb {I}$
and every ideal
${\mathcal I}$
on
$\mathbb {I}$
, a reduced product
$\mathcal M:=\prod _{\mathcal {I}} \mathcal M_i$
of structures from
$\mathfrak C$
(uniformly) interprets the Boolean algebra
$\mathcal P(\mathbb {I})/{\mathcal I}$
, the system of quotient structures
$\mathcal M\restriction S$
and the quotient maps
$\pi _S$
(parametrized by
$S\in \mathcal P(\mathbb {I})/{\mathcal I}$
). -
(3) The formula $x=x' \rightarrow y=y'$
is equivalent to an h-formula in the common theory of structures from
$\mathfrak C$
, denoted
$ {\mathrm {Th}}(\mathfrak C)$
.
Theorem 1 is part of the more detailed Theorem 3.8. It implies that if a class
$\mathfrak C$
of structures of the same language recognizes coordinates, then so does the class of all models of its theory (Corollary 3.9).
We also remark that recent connections with operator algebras have invigorated the interest in reduced products associated with the Fréchet filter. Such reduced powers are called (asymptotic) sequence algebras and the interplay between them, the original algebra, and its ultrapower, plays a very important role in classification theory (see e.g., [Reference White75, §6]). These connections resulted in new results about such reduced products, such as splitting of the exact sequence
$0\to \prod _{ {\mathrm {Fin}}} A\to \prod _{{\mathcal U}} A \to 0$
and transfer of information between the reduced power and the ultrapower (see the introduction to [Reference Farah24]).
Second, we provide many new classes of structures which recognize (or do not recognize) coordinates. Surprisingly, very little structure suffices for recognizing coordinates. For instance, linear orders and sufficiently random graphs all recognize coordinates by [Reference De Bondt, Farah and Vignati15, Proposition 2.7]. In this paper, we place particular emphasis on groups, as they provide a rich class of structures which witness versatile behaviours with respect to coordinate recognition. Additionally, there is a historical precedent of studying automorphism groups of products of groups. Our research has applications to this line of research (see §8.2 for details).
The following is proved below as Theorem 4.6.
Theorem 2. Each of the following classes of groups recognizes coordinates.
-
(a) The class of all nonabelian simple groups.
-
(b) The class of all $\mathfrak S_n$
, for all
$n\geq 3$
; i.e., the symmetric groups on finite sets of size greater than or equal to 3. -
(c) The class of all dihedral groups $D_{2n+1}$
, for
$n\geq 1$
. -
(d) The class of all groups $ {\mathrm {SL}}(n,F)$
, for all
$n\geq 2$
and every field F with more than four elements. -
(e) $\{G\}$
where G is any nontrivial free product. -
(f) The class of all graph products $\Gamma \mathcal {G}$
, where
$\mathcal {G} = \{G_v\}_{v\in V(\Gamma )}$
is a family of groups indexed by the vertices of
$\Gamma $
, such that the complement graph
$\bar \Gamma $
is connected and
$|G_v|\geq 3$
for at least one vertex v (see §4.5).
Together with the results of [Reference De Bondt, Farah and Vignati15], Theorem 2 gives numerous corollaries; the following is a consequence of Theorem 8.6.
Corollary 3. Forcing axioms imply the following.
-
(1) Every automorphism of $\prod _{n\in \mathbb {N}} \mathfrak S_n/ {\mathrm {Fin}}$
lifts to an automorphism of
$\prod _n \mathfrak S_n$
. -
(2) For every sequence without repetitions of the form $(m_i, F_i)$
, for
$i\in {\mathbb N}$
such that
$m_i\in {\mathbb N}$
and
$F_i$
is a finite field, every automorphism of
$\prod _{ {\mathrm {Fin}}} {\mathrm {SL}}(m_i,F_i)$
lifts to an automorphism of
$\prod _i {\mathrm {SL}}(m_i,F_i)$
.
One can also find an infinite
$X\subseteq {\mathbb N}$
such that for every infinite subset
$Y\subseteq X$
with
$X\setminus Y$
infinite, the assertion
$\prod _{n\in X}\mathfrak S_n / {\mathrm {Fin}} \cong \prod _{n\in Y} \mathfrak S_n/ {\mathrm {Fin}}$
is independent of ZFC (this is a very special case of Corollary 8.7).
In the opposite direction, we also isolate classes of groups which do not recognize coordinates. The following is Theorem 5.3.
Theorem 4. Any class of groups that contains any of the following does not recognize coordinates.
-
(a) Any group that has a nontrivial direct summand.
-
(b) Any group that admits a nontrivial homomorphism into its centre. More generally, if the class contains two groups such that there exists a nontrivial homomorphism from one into the centre of the other, then it does not recognize coordinates. In particular, any class of groups that contains both $\mathfrak S_3$
and
$ {\mathrm {SL}}(2,5)$
does not recognize coordinates. -
(c) The group $ {\mathrm {GL}}(n,F)$
for
$n\geq 2$
and any field F. -
(d) The group $Q_{8} = \langle -1,i,j,k: (-1)^{2} = e, i^{2} = j^{2} = k^{2} =ijk = -1 \rangle $
. -
(e) The dihedral group $D_{2n}$
of the
$2n$
-gon for
$n\geq 1$
. -
(f) Any nilpotent group.
-
(g) Any nontrivial graph product $\Gamma \mathcal G$
such that the complement graph
$\bar \Gamma $
is not connected (see §4.5).
In the initial stages of this work, we had hoped to isolate a clear-cut characterization of classes of groups that recognize coordinates. This revealed itself to be a difficult task, as the union of two classes which recognize coordinates does not necessarily recognize coordinates: often, different groups recognize coordinates for different reasons. For example, while each one of
$\mathfrak S_3$
and
$ {\mathrm {SL}}(2,5)$
recognizes coordinates by itself, no class containing both of these groups recognizes coordinates (this is a consequence of Theorem 4 (b). The following gives an even stronger obstruction to the existence of a clear-cut characterization of classes of groups that recognize coordinates (see Theorem 7.1).
Theorem 5. There is a family
$\mathfrak D$
of groups that does not recognize coordinates, but every finite subset of
$\mathfrak D$
does.
Classical model-theoretic considerations provide another important motivation for this work. Reduced products of
$\mathcal {L}$
-structures are themselves naturally equipped with an
$\mathcal {L}$
-structure, and the celebrated Feferman–Vaught theorem provides a natural expansion
$\mathcal {L}^+$
where these products eliminate quantifiers. It is, however, not clear whether (or when) this expansion
$\mathcal {L}^+$
is a definable expansion of the original language
$\mathcal {L}$
in the reduced product. It is surprising that this natural question has remained unanswered. A key property turns out to be the definability of the support function. To our knowledge, this property was first identified by Medvedev and Van Abel in [Reference Medvedev and Van Abel48], where they prove a general theorem about (non-reduced) products and apply it to products of finite fields. We take the occasion to expand on their work and extend their analysis to arbitrary reduced products. In turn, we prove the following theorem (see Theorem 2.30; since this is a consequence of folklore results, we prove it in the preliminary section).
Theorem 6. Let
$\mathcal {M}:=\prod _{\mathcal {I}} \mathcal {M}_i$
be a reduced product, and assume that
$\mathcal {M}$
interprets the relative support function
$ {\mathrm {supp}}_=$
. Assume there exists a fundamental set
$\Phi $
of h-formulas for the pair
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
and
$\mathcal {I}$
. Then
$\mathcal {M}$
, as an
$\mathcal {L}$
-structure, already interprets all functions of the language
${\mathcal L}^+$
and
$\mathcal {M}$
eliminates quantifiers relative to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in the language
${\mathcal L}_\Phi ^+$
.
The language
${\mathcal L}_\Phi ^+$
is introduced in Corollary 2.27, and is a fragment of the Feferman–Vaught language
$\mathcal {L}^+$
. See Definition 2.6 for h-formulas and Definition 2.25 for a fundamental set of h-formulas. As an application, we give an explicit definable expansion of a reduced power of a finite symmetric group
$\mathfrak S_n$
for
$n\geq 4$
with
$n\neq 6$
which eliminates quantifiers (see Corollary 4.28).
The paper is outlined as follows: In Section 2, we recall some basic preliminaries concerning reduced products. In Section 3.3, we prove that recognizing coordinates is equivalent to interpreting a definable support function. Sections 4 and 5 are focused on classes of groups. In Section 4, we prove that certain classes of groups recognize coordinates while in Section 5 we provide several examples of classes of groups which do not recognize coordinates. Section 6 focuses on showing other families of structures recognize coordinates, including a fan favourite: the non-associative magma colloquially known as rock-paper-scissors. Section 7 focuses on limiting examples or examples which imply that the general theory of recognizing coordinates is quite complicated. The final section contains concluding remarks, open questions and some ties to loose ends.
2 Preliminaries
Our notation regarding first-order logic is standard. This section contains preliminaries concerning reduced products, recognizing coordinates, h-formulas, ultraproducts of reduced products and the Feferman–Vaught theorem. We fix a language
${\mathcal L}$
throughout.
2.1 Reduced products
A class of
$\mathcal {L}$
-structures will often be denoted by
$\mathfrak C$
. We use the symbols
$\mathbb {I}, \mathbb {J}$
to denote index sets and the symbols
$\mathcal {I},\mathcal {J}$
to denote ideals on those index sets. We recall that an ideal
$\mathcal {I}$
on
$\mathbb {I}$
is a non-empty collection of subsets of
$\mathbb {I}$
which is downward closed, closed under finite unions and does not contain
$\mathbb {I}$
. Given an ideal
$\mathcal {I}$
on
$\mathbb {I}$
, one constructs the quotient Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I}$
via the following identification:
If
$\mathbb {I}$
is an index set, then we let
$ {\mathrm {Fin}}(\mathbb {I})$
denote the ideal of all finite subsets of
$\mathbb {I}$
. When there is no possibility of confusion, we simply write
$ {\mathrm {Fin}}$
in place of
$ {\mathrm {Fin}}(\mathbb {I})$
. We begin by recalling the definition of the reduced product.
Definition 2.1 (Reduced product).
Let
$(\mathcal {M}_i)_{i\in \mathbb {I}}$
be a collection of
$\mathcal {L}$
-structures. We let
$\prod _{i \in \mathbb {I}} \mathcal {M}_i/\mathcal {I}$
, or, more frequently,
$\prod _{\mathcal {I}}\mathcal {M}_i$
, denote the quotient of the product
$\prod _{ i \in \mathbb {I}} \mathcal {M}_i$
by the following equivalence relation: if
$(a_i)_i$
and
$(b_i)_i$
are in
$ \prod _{i \in \mathbb {I}}\mathcal {M}_i$
, then
Formally, we let
$[(a_i)]_{\mathcal {I}}$
denote the equivalence class of
$(a_i)_{i}$
. This quotient is naturally equipped with an
$\mathcal {L}$
-structure. For any n-ary relation symbol
$R\in \mathcal {L}$
and
$[(a^{1}_i)]_{\mathcal {I}},\dots ,[(a^{n}_i)]_{\mathcal {I}}$
in
$\prod _{\mathcal {I}}\mathcal {M}_i$
,
and for any n-ary function symbol
$f \in \mathcal {L}$
and
$[(a^{1}_i)]_{\mathcal {I}},\dots ,[(a^{n}_i)]_{\mathcal {I}}$
in
$\prod _{\mathcal {I}}\mathcal {M}_{i}$
,
The structure
$\prod _{\mathcal {I}} \mathcal {M}_i$
is called the reduced product. We often abuse notation and identify elements in
$\prod _{\mathcal {I}} \mathcal {M}_i$
with the elements in
$\prod _{i \in \mathbb {I}} \mathcal {M}_i$
when there is no possibility of confusion or error. If all
$\mathcal M_i$
are isomorphic to a fixed structure
$\mathcal N$
, then the reduced product
$\prod _{\mathcal I} \mathcal M_i$
is called a reduced power of
$\mathcal N$
.
We remark that in the case where
${\mathcal I}=\{\emptyset \}$
, the reduced product reduces (!) to the product.
Definition 2.2. An ideal
$\mathcal {I}$
on an index set
$\mathbb {I}$
is atomless if the quotient Boolean algebra
$\mathcal P(\mathbb {I})/\mathcal {I}$
is atomless. By metonymy, we also call a reduced product
$\prod _{\mathcal {I}}\mathcal {M}_i$
atomless if
$\mathcal {I}$
is atomless.
The following example illustrates a situation that we would like to avoid, where information is lost. Settings like the one below can lead to pathological behaviour and annoying/unrewarding case work.
Example 2.3. Let
$\mathcal {L}:=\{ \leq , R\}$
be a language with two binary relation symbols. Notice that both graphs
$(G,R)$
and linear orders
$(L,\leq ) $
can be viewed as
$\mathcal {L}$
-structures by interpreting the remaining symbol as empty. Fix a nontrivial linear order and a nontrivial graph relation on a set A, denoted by
$\leq ^{A}$
and
$R^{A}$
respectively. Now consider the product
$\mathcal {M}=\prod _{n \in \mathbb {N}} \mathcal {M}_n$
where each
$\mathcal {M}_n$
has universe A and
By the definition of the reduced product (with respect to the ideal
$\{\emptyset\}$
), both relations in the structure
$\mathcal {M}$
are empty, i.e.,
$R^{\mathcal {M}}=\leq ^{\mathcal {M}} =\emptyset $
.
In order to avoid the pathological situation described in Example 2.3, we will consider only classes
$\mathfrak C$
of structures satisfying the following.
Definition 2.4. A class
$\mathfrak C$
of
$\mathcal {L}$
-structures is called full if
-
(1) For every predicate P in $\mathcal {L}$
and all
$\mathcal {M}$
in
$\mathfrak C$
,
$P^{\mathcal {M}} \neq \emptyset $
. -
(2) Every $\mathcal {M}$
in
$\mathfrak C$
has at least three elements.
We remark that there is no issue in assuming that there exists some structure
$\mathcal {M}$
in
$\mathfrak C$
and some n-ary predicate P such that
$P^{\mathcal {M}}$
is
$\mathcal {M}^{n}$
. Notice that if
$\mathcal {L}$
is a functional language, then all classes of
$\mathcal {L}$
-structures automatically satisfy condition
$(1)$
above.
2.2 Recognizing coordinates
Here, we recall the definition of recognizing coordinates. Definition 2.5 below is [Reference De Bondt, Farah and Vignati15, Definition 2.5 and Definition 2.6] (see §8.2 for the variant of this notion for direct products). In order to state the definition, we introduce some notation which will be used throughout the text.
Assume that
$\mathcal {I}$
is an ideal on a set
$\mathbb {I}$
and
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
is an indexed family of
$\mathcal {L}$
-structures. Consider the reduced product
$\mathcal {M} := \prod _{\mathcal {I}} \mathcal {M}_i$
. For
$S\subseteq \mathbb {I}$
, we write
$\mathcal M\restriction S$
for the quotient
$(\prod _{i\in S} \mathcal {M}_i)/(\mathcal {I}\restriction S)$
of
$\mathcal M$
. The quotient map is denoted
$\pi _S$
. If
$S\in \mathcal {P}(\mathbb {I})/\mathcal {I} $
then we write
$\mathcal M\restriction S$
for
$(\prod _{i\in \tilde S} \mathcal {M}_i)/(\mathcal {I}\restriction \tilde S)$
and
$\pi _S$
for
$\pi _{\tilde S}$
, where
$\tilde S\subseteq \mathbb {I}$
is any set that satisfies
$[\tilde S]_{\mathcal {I}}=S$
. Clearly
$\mathcal M\restriction S$
does not depend on the choice of representative
$\tilde S$
for S.
Definition 2.5. An isomorphism
$\Phi $
between reduced products
$\mathcal M:=\prod _{\mathcal {I}} \mathcal M_i$
and
$\mathcal N:=\prod _{\mathcal {J}} \mathcal N_j$
is isomorphically coordinate respecting if there is an isomorphism
$\alpha \colon \mathcal {P}(\mathbb {I})/\mathcal {I} \to \mathcal {P}(\mathbb {J})/\mathcal {J} $
such that for all
$S\in \mathcal {P}(\mathbb {I})/\mathcal {I} $
we have a function
defined by
making the following diagram commute:

A first-order theory T is said to recognize coordinates if every isomorphism between reduced products of models of T is isomorphically coordinate respecting.
More generally, if
$\mathfrak C$
is a class of structures of the same language (not necessarily axiomatizable), then
$\mathfrak C$
is said to recognize coordinates if every isomorphism between arbitrary reduced products of structures from
$\mathfrak C$
(possibly with repeated structures) is isomorphically coordinate respecting.
Moreover, a class
$\mathfrak C$
is said to recognize coordinates in
${\mathbb N}$
Footnote
3
if every isomorphism between arbitrary reduced products of the form
$\prod _{n\in {\mathbb N}} \mathcal M_n/\mathcal {I}$
of structures from
$\mathfrak C$
(again, possibly with repeated structures) is isomorphically coordinate respecting. In Theorem 3.8, we will show in particular that this distinction is superfluous and that a class recognizes coordinates in
${\mathbb N}$
if and only if it recognizes coordinates.
2.3 h-formulas
In this section, we first recall the definition of an h-formula. We then recall some analysis of h-formulas in reduced products by Palmgren and Omarov. Finally, we conclude with some analysis of our own concerning h-formulas and definable support functions. We prove that a full class of structures admits such functions if and only if a certain formula (involving only logical symbols and equality) is equivalent to an h-formula. The following definition is taken from [Reference Palmgren56], [Reference Palyutin57], [Reference Palyutin58] (see [Reference De Bondt, Farah and Vignati14, §2]).
Definition 2.6 (The class of h-formulas).
The class of h-formulas is the smallest class of formulas
$\mathcal C$
containing all atomic formulas and if
$\varphi $
and
$\psi $
belong to
$\mathcal C$
, then so do
It is not difficult to see that the class of formulas that contains all atomic formulas and is closed under the construct
$(\exists x)\varphi \wedge (\forall x)(\varphi \rightarrow \psi )$
coincides with the class of h-formulas. The following fact will be used tacitly and frequently without being explicitly mentioned.
Fact 2.7. If x and
$\bar {y}$
are the variables occurring freely in
$\varphi $
and if theory T implies
$(\forall \bar y) (\exists x)\varphi (x,\bar y)$
then T implies that
$(\forall x)(\varphi \to \psi )$
is equivalent to an h-formula.
In the situation described by the fact above, we will slightly abuse terminology and say that the formula
$(\forall x)(\varphi \to \psi )$
is an h-formula. The following is an analogue of Łoś’s theorem for reduced products (see [Reference Palyutin58] for details).
Theorem 2.8. If
${\mathcal I}$
is an ideal on an index set
$\mathbb {I}$
,
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
is an indexed family of
$\mathcal {L}$
-structures,
$\mathcal {M}=\prod _{\mathcal {I}} \mathcal {M}_i$
,
$\bar {a}$
is an element of
$\mathcal {M}^{|\bar {x}|}$
with representative
$(\bar {a}_i)$
and
$\varphi (\bar x)$
is an h-formula, then
Proposition 2.9 below is a uniform version of [Reference Palmgren56, Lemma 3]. There it was credited to Palyutin. It is a consequence of [Reference Palmgren56, Lemma 2], which implies that every atomless reduced product satisfies the so-called simple cover property, but we sketch a proof for the reader’s convenience. This fact is related to the conclusion of McKinsey’s Lemma, [Reference Hodges33, Lemma 9.1.7].
Proposition 2.9. For every
$\mathcal {L}$
-formula
$\varphi (\bar {x})$
, there is a Boolean combination of h-formulas
$\psi (\bar {x})$
such that
holds in all atomless reduced products.
Proof. In [Reference Palmgren56, Lemma 2], it was proved that every atomless reduced product has the simple cover property, and in [Reference Palmgren56, Lemma 3] it was proved that the simple cover property implies
$\varphi $
is equivalent to a Boolean combination of h-formulas. Although the latter asserts that the theory of the reduced product implies
$\varphi $
is equivalent to a Boolean combination of h-formulas, the proof gives that the simple cover property implies this, and that the Boolean combination depends only on
$\varphi $
.
By definition, a class
$\mathfrak C$
recognizes coordinates if and only if every reduced product of models in
$\mathfrak C$
does so. We will show that there is only one reduced product that matters, and recognizing coordinates with respect to this model implies every other reduced product of structures from
$\mathfrak C$
recognizes coordinates.
Definition 2.10. For a class
$\mathfrak C$
of
${\mathcal L}$
-structures, we define a reduced product
$\mathcal K(\mathfrak C)$
of structures in
$\mathfrak C$
. Let
and for each
$(j,T)\in {\mathbb I}$
, fix
$\mathcal N_{j,T}\in \mathfrak C$
such that
$\mathcal N_{j,T}\models T$
. Let
The following proposition is a direct consequence of [Reference Omarov53, Lemma 4].
Proposition 2.11 (Omarov).
Let
$\mathfrak C$
be a class of
$\mathcal {L}$
-structures and let
$\varphi (\bar {x})$
be a satisfiable
$\mathcal {L}$
-formula with the following property: there is an
$\mathcal {L}$
-formula
$\psi (\bar {x})$
such that for all atomless reduced products
$\mathcal {M}=\prod _{\mathcal {I}}\mathcal {M}_i$
of structures from
$\mathfrak C$
and for all
$\bar {a} \in \prod _{\mathcal {I}}\mathcal {M}_i$
,
-
(1) Then $\varphi (\bar {x})$
is equivalent to an h-formula
$\Phi (\bar {x})$
in the common theory of all atomless reduced products from
$\mathfrak C$
. -
(2) Also, $\Phi (\bar {x})$
and
$\psi (\bar {x})$
are equivalent modulo
$ {\mathrm {Th}}(\mathfrak C)$
.
Moreover, if (2.1) holds for
$\mathcal K(\mathfrak C)$
, then it holds in every reduced product of structures from
$\mathfrak C$
.
We had difficulty recovering the proof directly from the English translation [Reference Omarov53]. We also had difficulty understanding the proof from the original Russian version [Reference Omarov54]. These proofs seem to be substantially different. Thus we take the opportunity to write a proof using the work of Palmgren and Palyutin (Proposition 2.9).
Proof. For simplicity, we denote the ideal
$ {\mathrm {Fin}}({\mathbb I})$
by
$ {\mathrm {Fin}}$
when the index set
${\mathbb I}$
is clear from the context.
We first assume that (2.1) holds for
$\mathcal K(\mathfrak C)$
and prove (1) and (2).
Note that if
$\mathcal K(\mathfrak C)$
satisfies (2.1), then so does
$\mathcal K(\mathfrak C)^m$
(identified with the reduced product
$\prod _{(i,j,T)\in m\times {\mathbb N}\times \mathbb T(\mathfrak C)} \mathcal N_{j,T}/ {\mathrm {Fin}}$
) for every
$m\geq 1$
, because
$\mathcal K(\mathfrak C)\cong \mathcal K(\mathfrak C)^m$
by an isomorphism that lifts to an isomorphism between
$\prod _{\xi \in T({\mathbb I})} N_\xi $
and
$\prod _{\xi \in {\mathbb I}(\mathfrak C)\times m} N_\xi $
. To be precise, this isomorphism corresponds to a bijection
$\alpha \colon T({\mathbb I})\to T({\mathbb I})\times m$
such that
for every
$T\in T(\mathfrak C)$
.
For simplicity of notation, we work with formulas in a single variable. Throughout, we let T be the common theory of all atomless reduced products of structures from
$\mathfrak {C}$
and all implications are modulo this theory. We first prove Statement (1). Proposition 2.9 implies that there are h-formulas
$A_1, \dots , A_n$
such that
$ {\mathrm {Th}}(\mathcal K(\mathfrak C))$
implies that
$\varphi $
is equivalent to a Boolean combination B of
$A_1, \dots , A_n$
. We will show that
$\varphi $
is equivalent to a subconjunction of
$A_1,\dots , A_n$
. Let
$l_1<\dots <l_m \leq n$
be such that
$B \rightarrow A_{l_1} \wedge \cdots \wedge A_{l_m} $
and assume that
$\{l_1,\dots ,l_m\}$
is a maximal collection of indices (under inclusion) with this property, in the sense that for all
$l_{m+1}\leq n$
with
$l_{m+1}\neq l_j$
,
$j\leq m$
,
To simplify notation, by re-indexing we may assume
$l_j=j$
for all
$j\leq m$
. Therefore, for all
$j>m$
, the formula
$B \wedge \neg A_j$
is consistent. We will show that B is equivalent to
$A_1 \wedge \cdots \wedge A_m$
. For each
$m< j\leq n$
, let
$\mathcal K_j$
be an isomorphic copy of
$\mathcal K(\mathfrak C)$
; denote by
${\mathbb I}_j$
its index set, and let
$a_j$
be an element of
$\mathcal K_j$
satisfying
$B \wedge \neg A_j$
. Let
$\mathcal K_{m}$
be another isomorphic copy of
$\mathcal K(\mathfrak C)$
, with index set
${\mathbb I}_m$
, and let a be an element of
$\mathcal K_m$
satisfying
$A_1 \wedge \cdots \wedge A_m$
. As B is consistent, there is an element b in
$\mathcal K_{m}$
satisfying B (and thus it also satisfies
$A_1 \wedge \cdots \wedge A_m$
). The structure
is isomorphic to
$\mathcal K(\mathfrak C)^{n-m+1}$
and (as mentioned at the beginning of this proof) also to
$\mathcal K(\mathfrak C)$
, via an isomorphism that respects the reduced product structure. Specifically, with
${\mathbb J}= (n-m+1)\times {\mathbb N}\times \mathbb T(\mathfrak C) = {\mathbb I}_m \sqcup \cdots \sqcup {\mathbb I}_n $
we have that
$\prod _{(i,j,T)\in {\mathbb I}}\mathcal N_{j,T}/ {\mathrm {Fin}}$
is naturally isomorphic to
$\mathcal K$
. For convenience, we write
${\mathbb I}=(n-m+1)\times {\mathbb N}\times \mathbb T(\mathfrak C)$
and
$\mathcal M_l$
for
$\mathcal N_{(j,T)}$
if
$l=(i,j,T)$
, so that
Since the isomorphism respects the reduced product structure, (2.1) holds for this representation of
$\mathcal K$
.
In
$\mathcal K$
the element
$b^\frown a_{m+1}^\frown \cdots ^\frown a_n$
satisfies B (by condition (2.1)). Moreover, since the
$A_i$
’s are h-formulas, multiple applications of Theorem 2.8 imply that both
$a^\frown a_{m+1}^\frown \cdots ^\frown a_n$
and
$b^\frown a_{m+1}^\frown \cdots ^\frown a_n$
satisfy

Therefore, as B is a Boolean combination of the
$A_i$
’s,
$a^\frown a_{m+1}^\frown \cdots ^\frown a_n$
also satisfies B. By condition (2.1), if we let
$(c_i)_i\in \prod _{i\in {\mathbb I}} \mathcal M_i$
be a representative of
$a^\frown a_{m+1}^\frown \cdots ^\frown a_n$
, then
It follows that
By Condition (2.1) again,
$\mathcal K=\prod _{\mathcal {I}}\mathcal {M}_i $
satisfies
$\varphi (a).$
As the element a was chosen arbitrarily to satisfy
$A_1 \wedge \cdots \wedge A_m$
, this shows that
and thus we conclude that
$\varphi $
is equivalent to an h-formula (namely, the conjunction of the formulas
$A_1,\dots ,A_m$
). We let
$\Phi $
be this h-formula. We now prove Statement (2). By our hypothesis and Theorem 2.8, we have for any
$(a_i)_i$
,
Assume towards a contradiction that there is an
$\mathcal {I}$
-positive set
$J \subseteq \mathbb {I}$
such that, for any
$i\in J$
, we have,
For
$i\in J$
, let
$ a_i$
be an element in
$\mathcal {M}_i$
such that
$\neg (\psi (a_i) \leftrightarrow \Phi (a_i))$
holds. At the cost of restricting to a smaller positive set and swapping the role of
$\psi $
and
$\Phi $
, we may assume that for any
$i\in J$
,
$\neg \psi (a_i) \wedge \Phi (a_i)$
holds in
$\mathcal {M}_i$
. For
$i \in \mathbb {I}\setminus J$
, we choose
$a_i$
in
$\mathcal {M}_i$
such that
$\Phi (a_i)$
holds (if it exists), otherwise take
$a_i$
to be anything. Note that since
$\Phi $
is a satisfiable h-formula, the set of indices in which
$\Phi $
are not satisfiable belongs to
$\mathcal {I}$
. Then we conclude that
and
contradicting
$(*)$
.
This proves that if
$\mathcal K(\mathfrak C)$
satisfies (2.1), then
$\varphi $
and
$\psi $
are equivalent to the same h-formula
$\Phi $
modulo
$T(\mathfrak C)$
. By Palyutin’s theorem (Theorem 2.8), (1) and (2) hold in every reduced product of structures in
$\mathfrak C$
. This concludes the proof.
We will now focus on particular kinds of h-formulas, those only involving logical connectives and equality. As stated in the introduction, it turns out that whether or not a certain class of structures recognizes coordinates is equivalent to whether or not a particular formula is logically equivalent to an h-formula. To be more formal, we must first define a theory relative to an indexed family of structures and a fixed ideal.
Definition 2.12. Let
$\mathbb {I}$
be an index set,
$\mathcal {I}$
an ideal on
$\mathbb {I}$
and
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
an indexed family of
$\mathcal {L}$
-structures. We let
$ {\mathrm {Th}}_{\mathcal {I}}(\mathcal {M}_i, i\in \mathbb {I})$
denote the common theory of
$\mathcal {M}_i$
for all but
$\mathcal {I}$
-many
$i\in \mathbb {I}$
. In other words,
We sometimes write
$ {\mathrm {Th}}_{\mathcal {I}}(\mathcal {M}_i, i \in \mathbb {I})$
as
$ {\mathrm {Th}}_{\mathcal {I}}(\mathcal {M}_i)$
when there is no possibility of confusion.
If
${\mathcal I}$
is a proper ideal (which will always be the case), then
$ {\mathrm {Th}}_{\mathcal I}(M_i)$
is a consistent theory because the conjunction of any finite set of sentences in it is satisfied in all but
${\mathcal I}$
-many
$\mathcal M_i$
. A glance at Definition 2.10 is sufficient to verify the following.
Lemma 2.13. For any class
$\mathfrak C$
, with
${\mathbb I}(\mathfrak C)$
and
$\mathcal N_{j,T}$
for
$(j,T)\in {\mathbb I}(\mathfrak C)$
as in Definition 2.10, we have that
$ {\mathrm {Th}}_{ {\mathrm {Fin}}({\mathbb I}(\mathfrak C))} (\mathcal N_{j,T}:(j,T)\in {\mathbb I}(\mathfrak C))= {\mathrm {Th}}(\mathfrak C)$
.
Two variants of h-formulas are useful for our purposes. These h-formulas should be thought of as comparing elements in the reduced product on coordinates. The next proposition shows that if the relative comparison formula is an h-formula then the comparison formula is an h-formula.
Proposition 2.14. Let
$\mathbb {I}$
be an index set,
$\mathcal {I}$
an ideal on
$\mathbb {I}$
and
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
an indexed family of
$\mathcal {L}$
-structures. Suppose that for all but
$\mathcal {I}$
-many
$i\in \mathbb {I}$
,
$\mathcal {M}_i$
has at least
$3$
elements. Furthermore, suppose the formula
$x=z \rightarrow y=z$
is equivalent to an h-formula modulo
$ {\mathrm {Th}}_{\mathcal {I}}(\mathcal {M}_i, i\in \mathbb {I})$
. Then the formula
$x=z \rightarrow y=w$
is equivalent to an h-formula modulo
$ {\mathrm {Th}}_{\mathcal {I}}(\mathcal {M}_i, i\in \mathbb {I})$
.
Proof. The proposition is an immediate consequence of the following two claims.
Claim 2.15. With respect to the theory of any structure
$\mathcal {M}$
with at least two elements, the formula
$x \neq y$
is equivalent to
and is therefore equivalent to an h-formula.
Proof. By assumption,
$(x=y \rightarrow z=y)$
is equivalent to an h-formula
$\phi (x,y,z)$
. Therefore, by the definition of h-formulas,
$(\forall z) \phi (x,y,z)$
is an h-formula equivalent to
$\psi _{\neq }(x,y)$
. Since
$\mathcal {M}$
has at least two elements, the latter is clearly equivalent to
$x\neq y$
.
Claim 2.16. With respect to the theory of any structure
$\mathcal {M}$
with at least three elements, the formula
$x=z \rightarrow y=w$
is equivalent to the following formula:
Proof. To facilitate the argument, we view the variables
$x,y,z,w,\dots $
as functions from a set A to the structure
$\mathcal {M}$
. The claim then follows if we take A to be a singleton and identify
$\mathcal {M}$
with the set of functions from A to
$\mathcal {M}$
. The first line of (2.2) introduces u, a function nowhere equal to x and y. The second line defines
$x'$
as the function which coincides with x whenever x coincides with z, and coincides with u everywhere else. The third line similarly defines
$y'$
as the function which coincides with y whenever y coincides with w, and coincides with u everywhere else. The fourth line compares where
$x'$
and
$y'$
coincide with u.

To see that (2.2) is equivalent to the original formula, notice that
$x'$
coincides with u more often than
$y'$
does if and only if y coincides with w more often than x coincides with z.
We proceed to prove Proposition 2.14. We may assume that
$\mathcal M_i$
, for
$i\in {\mathbb I}$
, are structures with at least three elements each and that
$x=z\to y=z$
is equivalent to an h-formula modulo
$ {\mathrm {Th}}_{\mathcal I}(\mathcal M_i, i\in {\mathbb I})$
. In order to prove that
$x=z \rightarrow y=w$
is equivalent to an h-formula modulo
$ {\mathrm {Th}}_{\mathcal {I}}(\mathcal {M}_i, i\in \mathbb {I})$
it suffices to prove that each of the conjuncts in the body of the formula (2.2) is equivalent to an h-formula. This is true for the first line by Claim 2.15.
Note that
$x=z \leftrightarrow x'=z$
is an abbreviation for
and is therefore equivalent to an h-formula. This takes care of the second, fourth and sixth conjuncts.
Since the formula
trivially holds for all x and z, we deduce that the remaining two conjuncts in (2.2) are equivalent to h-formulas.
We now connect the syntax of h-formulas with the semantics of reduced products. The comparison formulas from the previous proposition correspond to certain kinds of support functions. The relative support function of
$\prod _{\mathcal {I}}\mathcal {M}_i$
, denoted
$ {\mathrm {supp}}_=$
, is the map which associates to two elements a and b with representations
$(a_i)_i$
and
$(b_i)_i$
, the element of
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
where these two elements coincide:
Intuitively, by the variant of Łoś’s theorem for reduced products, the definability of the relative support function in all reduced products should be an intrinsic property of the class of structures. This is what we show in Lemma 2.17 and Theorem 2.18 below (see Definition 2.12 for
$ {\mathrm {Th}}_{\mathcal I}$
).
Lemma 2.17. Let
$\mathbb {I}$
be an index set,
$\mathcal {I}$
be an ideal on
$\mathbb {I}$
and
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
be an indexed family of
$\mathcal {L}$
-structures. Then the following Condition (1) implies Condition (2).
-
(1) The formula,
$$\begin{align*}x=x' \rightarrow y=y',\end{align*}$$
is equivalent to an h-formula $\Phi (x,x',y,y')$
in
$ {\mathrm {Th}}_{\mathcal {I}}(\mathcal {M}_i, i\in \mathbb {I})$
. -
(2) The Boolean algebra $\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the relative support function, $$\begin{align*}{\mathrm{supp}}_=: \prod_{\mathcal{I}} \mathcal{M}_i \rightarrow \mathcal{P}(\mathbb{I})/\mathcal{I} \text{ via } ((g_i)_i, (g_i')_i) \rightarrow \big[\{ i \in \mathbb{I} \mid g_i = g_i'\}\big]_{\mathcal{I}},\end{align*}$$
are interpretable in $\prod _{\mathcal {I}} \mathcal {M}_i$
.
Proof. Assume Condition (1). Fix
$a,a',b$
and
$b'$
in
$\prod _{\mathcal {I}} \mathcal {M}_i$
with representatives
$(a_i)_{i},(b_i)_{i},(a^{\prime }_i)_{i}$
and
$(b^{\prime }_i)_{i}$
respectively. Then,
It follows that
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
is interpretable in
$\prod _{\mathcal {I}} \mathcal {M}_i$
as a poset. Moreover, all Boolean operations are interpretable in this poset. For example,
$A\cap B$
is the maximal (under
$\leq $
) C such that
$C\leq A$
and
$C\leq B$
, and
$A\setminus B$
is the maximal C such that
$C\leq A$
and
$C\cap B=\emptyset $
. Therefore,
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
is interpretable as a Boolean algebra. The natural projection is the relative support function; therefore Condition (2) holds.
Theorem 2.18. Let
$\mathfrak C$
be a full class of
$\mathcal {L}$
-structures. The following conditions are equivalent:
-
(1) The relative support function $ {\mathrm {supp}}_=$
is interpretable in all reduced products of structures from
$\mathfrak C$
. -
(2) The relative support function $ {\mathrm {supp}}_=$
is interpretable in
$\mathcal K(\mathfrak C)$
(see Definition 2.10). -
(3) The formula $x=x' \rightarrow y=y'$
is equivalent to an h-formula in the common theory
$ {\mathrm {Th}}(\mathfrak C)$
of
$\mathfrak C$
.
Proof. The implication
$(1)\Rightarrow (2)$
is obvious and
$(3)\Rightarrow (1)$
follows from Lemma 2.17. It remains to show that (2) implies (3). Assume that (2) holds and consider
$\mathcal K(\mathfrak C)$
as in Definition 2.10. Let
$\varphi (x,x',y,y')$
be the
$\mathcal {L}$
-formula defining the relation
$ {\mathrm {supp}}_=(a,a') \subseteq {\mathrm {supp}}_=(b,b')$
in
$\prod _{\mathcal {I}} \mathcal {M}_i$
. It follows that for all
$a,a',b,b' \in \prod _{\mathcal {I}} \mathcal {M}_i$
, with respective representatives
$(a_i)_i,(a^{\prime }_i)_i,(b_i)_i,(b^{\prime }_i)_i$
:
By Proposition 2.11 (1), in
$ {\mathrm {Th}}(\mathcal K(\mathfrak C))$
the formula
$\varphi (x,x',y,y')$
is equivalent to an h-formula
$\Phi (x,x',y,y')$
, and by Theorem 2.8 we have
By Proposition 2.11 (2), for all but finitely many
$i\in \mathbb {I}$
we have that
Since
$ {\mathrm {Th}}_{ {\mathrm {Fin}}({\mathbb I}(\mathfrak C))} (\mathcal N_{j,T}:(j,T)\in {\mathbb I}(\mathfrak C))= {\mathrm {Th}}(\mathfrak C)$
(Lemma 2.13), we have the equivalence in
$ {\mathrm {Th}}(\mathfrak C)$
, as required, and this concludes the proof.
2.4 Ultraproducts of reduced products
An ultraproduct is a special kind of reduced product. The purpose of this subsection is to show that the class of (atomless) reduced products constructed from a fixed class of
$\mathcal {L}$
-structures
$\mathfrak C$
is closed under ultraproducts. In the following proposition, it is understood that
${\mathcal I}_j$
is an ideal on an index set
${\mathbb I}_j$
, and similarly for
${\mathcal J}$
on
${\mathbb J}$
.
Proposition 2.19. Given a class
$\mathfrak C$
of
$\mathcal {L}$
-structures (elementary or not), the class of all reduced products of structures in
$\mathfrak C$
is closed under taking ultraproducts. Also, the class of all atomless reduced products of structures from
$\mathfrak C$
is closed under taking ultraproducts.
Proof. Let
${\mathcal U}$
be an ultrafilter on a set
${\mathbb J}$
and let
${\mathcal I}_j$
, for
$j\in {\mathbb J}$
, be a family of ideals. We will produce an ideal
${\mathcal J}$
such that the ultraproduct
$\prod _{\mathcal U} (\prod _{{\mathcal I}_j} \mathcal {M}_{ij})$
is isomorphic to the reduced product
$\prod _{\mathcal J} \mathcal {M}_{ij}$
for every (appropriately indexed) family of structures
$\mathcal {M}_{ij}$
. We will also show that if all
${\mathcal I}_j$
are atomless then so is
${\mathcal J}$
, thus proving both parts of Proposition 2.19.
It will be convenient to assume that all
${\mathcal I}_j$
are ideals on the same index set
${\mathbb I}$
. Towards this, let
${\mathbb I}=\bigsqcup _{j\in {\mathbb J}} {\mathbb I}_j$
(the disjoint union of
${\mathbb I}_j$
) and replace
${\mathcal I}_j$
with the ideal on
${\mathbb I}$
generated by
${\mathcal I}_j$
and the set
$\bigcup _{k\in {\mathbb J}, k\neq j} {\mathbb I}_k$
for every j. Clearly this does not affect
$\prod _{{\mathcal I}_j} \mathcal {M}_{ij}$
(take
$\mathcal {M}_{ij}$
to be arbitrary for
$i\in {\mathbb I}\setminus {\mathbb I}_j$
).
Let
${\mathcal U}_*$
be the ideal on
${\mathbb J}$
dual to
${\mathcal U}$
and note that for any indexed family of
$\mathcal {L}$
-structures
$(A_j)_{j \in \mathbb {J}}$
, the ultraproduct
$\prod _{{\mathcal U}} A_j$
is literally the same as the reduced product
$\prod _{{\mathcal U}_*} A_j$
. For
$X\subseteq {\mathbb J}\times {\mathbb I}$
and
$j\in {\mathbb J}$
, let
$X_j=\{i\mid (j,i)\in X\}$
. On the set
${\mathbb J}\times {\mathbb I}$
define
${\mathcal J}$
to be the set of all
$X\subseteq {\mathbb J}\times {\mathbb I}$
such that,
Claim 2.20. For all structures
$\mathcal {M}_{ij}$
,
$i\in {\mathbb I}$
,
$j\in {\mathbb J}$
of the same language the structures
$\prod _{\mathcal U} (\prod _{{\mathcal I}_j} \mathcal {M}_{ij})$
and
$\prod _{\mathcal J} \mathcal {M}_{ij}$
are isomorphic. Moreover, the identity map on
$\prod _{i\in {\mathbb I}, j\in {\mathbb J}} \mathcal M_{ij}$
is a lifting of an isomorphism.
Proof. Each one of the reduced products in the statement of this claim is a quotient of
$\prod _{i\in {\mathbb I}, j\in {\mathbb J}} \mathcal M_{ij}$
. Let
$(a_{ij})$
and
$(b_{ij})$
be two sequences indexed by
${\mathbb J}\times {\mathbb I}$
. Then the set
$X:=\{(j,i)\mid a_{i,j}\neq b_{i,j}\}$
belongs to
$\mathcal {J}$
if and only if
$({\mathcal U} j) X_j\in {\mathcal I}_j$
(where
$({\mathcal U} j)$
is the quantifier ‘for
${\mathcal U}$
-many
$j\in {\mathbb J}$
’). Therefore
$(a_{ij})$
and
$(b_{ij})$
are equal modulo
${\mathcal J}$
if and only if for
${\mathcal U}$
-many j,
$a_{ij}$
and
$b_{ij}$
are equal modulo
${\mathcal I}_j$
. This implies that the identity map on
$\prod _{i\in {\mathbb I}, j\in {\mathbb J}} \mathcal M_{ij}$
is a lifting of an isomorphism between
$\prod _{\mathcal U} (\prod _{{\mathcal I}_j} \mathcal {M}_{ij}))$
and
$\prod _{\mathcal J} \mathcal {M}_{ij}$
. The same argument shows that this bijection preserves relation symbols, and (since we may interpret functions and constants by relations) is therefore an isomorphism as required.
Claim 2.21. The ideal
${\mathcal J}$
is atomless if and only if
${\mathcal I}_j$
is atomless for
${\mathcal U}$
-many j.
Proof. Assume that
${\mathcal I}_j$
is atomless for
${\mathcal U}$
-many j. Let
$X\subseteq {\mathbb J}\times {\mathbb I}$
be a
${\mathcal J}$
-positive set. Then the set
$Y=\{j\mid X_j\notin \mathcal{I}_j\}$
belongs to
${\mathcal U}$
. Since
${\mathcal I}_j$
is atomless, there is a partition
$X_j=X_j^0\sqcup X_j^1$
into
${\mathcal I}_j$
-positive sets. Then the sets
$X^k=\bigcup \{\{j\}\times X_j^k\mid j\in Y\}$
, for
$k=0,1$
, form a partition of X into
${\mathcal J}$
-positive sets. Since X was arbitrary, the conclusion follows.
For the converse, since
${\mathcal U}$
is an ultrafilter we may assume that
${\mathcal I}_j$
has an atom for
${\mathcal U}$
-many j. The union of these atoms gives an atom in
${\mathcal J}$
.
The conclusion of the first part of Proposition 2.19 follows from the two claims.
Remark 2.22. It is clear that the isomorphism between
$\prod _{\mathcal U} (\prod _{{\mathcal I}_j} \mathcal {M}_{ij})$
and
$\prod _{\mathcal J} \mathcal {M}_{ij}$
as in Claim 2.20 respects the Boolean algebra and
$ {\mathrm {supp}}_=$
, and we therefore have
2.5 A folklore reformulation of Feferman–Vaught
As the title of this subsection suggests, we discuss a folklore variant of the Feferman–Vaught theorem in the context of reduced products. In broad strokes, this theorem explains how to understand the theory of the reduced product by understanding the theory of the indexed models along with the quotient Boolean algebra. As usual, we let
$\mathbb {I}$
be an index set,
$\mathcal {I}$
be an ideal on
$\mathbb {I}$
and
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
be an indexed family of
$\mathcal {L}$
-structures. We denote by
$\mathcal {L}_{\textrm {Bool}}$
the language of Boolean algebra:
Definition 2.23. Let
$\varphi (\bar {x})$
be a formula with free variables
$\bar {x}$
and let
$\bar {a} \in (\prod _{\mathcal {I}} \mathcal {M}_i)^{\vert \bar {x}\vert }$
. The
$\varphi $
-support of
$\bar {a}$
, denoted by
$ {\mathrm {supp}}_{\varphi (\bar {x})}(\bar {a})$
, is the element
We call the function
the
$\varphi $
-support function of
$\prod _{\mathcal {I}} \mathcal {M}_i$
. If
$\theta $
is an
$\mathcal {L}$
-sentence, we denote by
$c_\theta $
the following element of
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
:
The theorem of Feferman–Vaught can be adapted to reduced products (see e.g., [Reference Chang and Keisler9, Theorem 6.3.2]). We give below a folklore reformulation of this theorem in terms of relative quantifier elimination. We refer to [Reference Rideau-Kikuchi63, Appendix A] for definitions of relative quantifier elimination and related concepts.
Proposition 2.24 (Feferman–Vaught for reduced products).
The reduced product
$\mathcal {M}:= \prod _{\mathcal {I}} \mathcal {M}_i$
eliminates quantifiers relative to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in the following two-sorted language
$\mathcal {L}^+$
:
The Feferman–Vaught theorem also asserts that there is an algorithmic procedure for quantifier elimination in this setting. Since we are not concerned with decidability, we will never (ever) mention this algorithm again.
Proof. We first observe that the sort,
is closed in the following sense: in the language, there are neither functions from B to the main sort
$\mathcal {M}$
, nor predicates in
$B^n\times \mathcal {M}^m$
for strictly positive integers
$n,m$
. Any (parameter-free)
$\mathcal {L}^{+}$
-formula is equivalent, in the theory of the reduced product, to a Boolean combination of formulas of the form:
-
• $\psi _B( {\mathrm {supp}}_{\varphi }(\bar {x}))$
-
• $\varphi (\bar {x})$
where
$\varphi $
is an
$\mathcal {L}$
-formula, and
$\psi _B$
is a formula in the language
$\mathcal {L}_{\textrm {Bool}} \cup \{c_\theta :~\theta \text { an }\mathcal {L}\text {-sentence} \}$
. By [Reference Chang and Keisler9, Theorem 6.3.2], a formula of the second kind can be expressed as a formula of the first kind. Therefore, we have eliminated all quantifiers in the main sort
$\prod _{\mathcal {I}} \mathcal {M}_i$
. Since the sort is closed, relative quantifier elimination follows by [Reference Rideau-Kikuchi63, Remark A.8].
This language for quantifier elimination can sometimes be optimized by using the notion of a fundamental set of formulas.
Definition 2.25. We call a set
$\Phi $
of
$\mathcal {L}$
-formulas fundamental for the pair
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
and
$\mathcal {I}$
if every
$\mathcal {L}$
-formula is equivalent, in
$ {\mathrm {Th}}_{{\mathcal I}}(\mathcal {M}_i)$
, to a Boolean combination of formulas in
$\Phi $
.
The following (easy) proposition implies that we may obtain quantifier elimination in a fragment of
$\mathcal {L}^{+}$
which contains the support functions
$ {\mathrm {supp}}_\varphi $
where
$\varphi $
ranges over a fundamental set
$\Phi $
.
Proposition 2.26. Let
$\varphi (\bar {x})$
and
$\psi (\bar {x})$
be two
$\mathcal {L}$
-formulas. Then every
$\bar {a}$
in
$ \left (\prod _{\mathcal {I}}\mathcal {M}_i\right )^{|\bar {x}|}$
satisfies the following:
Corollary 2.27. If
$\Phi $
is a fundamental set of
$\mathcal {L}$
-formulas for the pair
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
and
$\mathcal {I}$
, then the reduced product
$\mathcal {M}:= \prod _{\mathcal {I}} \mathcal {M}_i$
eliminates quantifiers relative to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in the following two-sorted language
$\mathcal {L}^+_\Phi $
:
Proof. It is enough to show that every function of the form
$ {\mathrm {supp}}_{\psi (\bar x)}$
, where
$\psi (\bar x)$
is any
$\mathcal {L}$
-formula, is equivalent to a quantifier-free
$\mathcal {L}^+_\Phi $
-formula. Fix an
$\mathcal {L}$
-formula
$\psi (\bar x)$
. By assumption,
$\psi (\bar x)$
is equivalent to a Boolean combination of formulas from
$\Phi $
, say
$\varphi _1(\bar x),\dots ,\varphi _k(\bar x)$
. By Proposition 2.26,
$ {\mathrm {supp}}_{\psi (\bar x)}$
is the same Boolean combination of
$ {\mathrm {supp}}_{\varphi _i(\bar x)}$
,
$i\leq k$
. Therefore, it is expressed without quantifiers in the language
$\mathcal {L}^+_\Phi $
, as desired.
A priori, the language
$\mathcal {L}^{+}$
in the Feferman–Vaught theorem can be much larger than the language needed for quantifier elimination. However, it can also be already definable in our original language. Thus the following question naturally arises:
Question 2.28. For which indexed families of
$\mathcal {L}$
-structures
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
and ideals
$\mathcal {I}$
on
$\mathbb {I}$
does the reduced product
$\prod _{\mathcal {I}} \mathcal {M}_i$
interpret the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the support functions
$ {\mathrm {supp}}_{\varphi (\bar {x})}$
in the language
$\mathcal {L}$
? In other words, in which reduced products is the language
$\mathcal {L}^+$
a definable expansion of the language
$\mathcal {L}$
?
We provide a positive answer to the question above if our reduced product satisfies two conditions: (1) the relative support function is interpretable and (2) there exists a fundamental set of h-formulas.
First, we need the following lemma:
Lemma 2.29. Fix an index set
$\mathbb {I}$
, an ideal
$\mathcal {I}$
on
$\mathbb {I}$
and a family of
$\mathcal {L}$
-structures
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
. Assume that the reduced product
$\prod _{\mathcal {I}} \mathcal {M}_i$
interprets the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the relative support function:
Then, for every satisfiable h-formula
$\varphi (\bar x)$
, the
$\varphi $
-support function
$ {\mathrm {supp}}_{\varphi (\bar {x})}$
is interpretable in
$\prod _{\mathcal {I}} \mathcal {M}_i$
.
Proof. We may assume that
$\bar x$
is a single variable, as the proof changes only notationally. Fix
$b\in \prod _{\mathcal {I}} \mathcal {M}_i$
satisfying
$\varphi (x)$
. For every element
$a \in \prod _{\mathcal {I}} \mathcal {M}_i$
and
$S\in \mathcal {P}(\mathbb {I})/\mathcal {I} $
, there is a unique element
$a_S$
which coincides with a on S and with b on
$S^\complement $
. Formally,
$a_S$
is the unique element such that:
-
• $ {\mathrm {supp}}_=(a_S,a) \supseteq S$
, -
• $ {\mathrm {supp}}_=(a_S,b) \supseteq S^\complement $
.
Then,
$\varphi (a_S)$
holds if and only if
$\mathcal M_i\models \varphi (a_S(i))$
for all but
${\mathcal I}$
-many i’s, and this is equivalent to
$S\setminus {\mathrm {supp}}_{\varphi (\bar {x})}(\bar {a}) \in {\mathcal I}$
. Therefore
$ {\mathrm {supp}}_{\varphi (\bar {x})}(\bar {a})$
is the largest
$S \in \mathcal {P}(\mathbb {I})/\mathcal {I} $
with respect to inclusion such that
$\varphi (a_S)$
holds. Since S does not depend on the choice of b, we get that the
$\varphi $
-support function
$ {\mathrm {supp}}_{\varphi (x)}$
is interpretable without parameters.
We can now prove Theorem 6.
Theorem 2.30. Assume that a reduced product
$\mathcal {M}:=\prod _{\mathcal {I}} \mathcal {M}_i$
interprets the relative support function
$ {\mathrm {supp}}_=$
. Assume that there exists
$\Phi $
a fundamental set of satisfiable h-formulas for the pair
$(\mathcal {M}_i)_{i \in \mathbb {I}}$
and
$\mathcal {I}$
. Then
$\mathcal {M}$
, as an
$\mathcal {L}$
-structure, already interprets all functions of the language
${\mathcal L}^+$
and
$\mathcal {M}$
eliminates quantifiers relative to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in the language
${\mathcal L}_\Phi ^+$
.
Proof. We fix an interpretation of the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and of the map
$ {\mathrm {supp}}_=$
. By Lemma 2.29, for any h-formula
$\varphi (x)$
the function
$ {\mathrm {supp}}_{\varphi (\bar {x})}$
is definable in the language,
Relative quantifier elimination follows directly from Corollary 2.27.
If
$\mathcal {M}$
is an atomless reduced product, then it automatically admits a fundamental set of h-formulas (i.e., Proposition 2.9).
For non-reduced products
$\prod _{i\in \mathbb {I}} \mathcal M_i$
, the interpretability of
$ {\mathrm {supp}}_{\varphi (\bar x)}$
, for any
$\mathcal {L}$
-formula
$\varphi (x)$
, follows directly from the interpretability of the relative support function, and there is therefore no need for a fundamental set of h-formulas. This was observed by Macintyre and Derakhshan, at least in the case of products of connected rings. See [Reference Derakhshan and Macintyre18, Corollary 7.2].
3 Proof of Theorem 1
As mentioned in the introduction, in [Reference De Bondt, Farah and Vignati15, §2.2] it was pointed out that, from the model-theoretic point of view, a morally satisfactory proof that a theory recognizes coordinates would proceed by exhibiting a copy of
$\mathcal P({\mathbb N})/{\mathcal I}$
as well as the projections
$\pi _S$
, for
$S\in \mathcal {P}(\mathbb {{\mathbb N}})/\mathcal { } {\mathcal I}$
inside every reduced product
$\prod _{ {\mathrm {Fin}}} \mathcal M_n$
of models of T. In this section, we prove that a theory recognizes coordinates if and only if every reduced product interprets both the appropriate Boolean algebra and the appropriate coordinate projections. Moreover, we prove that recognizing coordinates is equivalent to a simple characterization using the relative support function. This section provides much of the substance of the proof of Theorem 1. We gather the results together at the end of the section (see Theorem 3.8).
3.1 Interpreting supports implies recognizing coordinates
We show in this subsection that if all reduced products from a class of structures interpret the relative support function, then said class recognizes coordinates. The proof breaks nicely into two steps: (1) if a reduced product
$\prod _{\mathcal I} \mathcal {M}_i$
interprets the relative support function, then it also (uniformly) interprets the quotient structures
$\prod _{\mathcal I} \mathcal {M}_i\restriction S$
for any
$S \in \mathcal {P}(\mathbb {I})/\mathcal {I} $
and (2) if all reduced products from a class of structures interpret the appropriate Boolean algebra and quotients (coherently), then the class recognizes coordinates. We prove Step (1) and then Step (2).
Consider a reduced product
$\mathcal {M}:=\prod _{\mathcal I} \mathcal {M}_i$
and nonzero
$S \in \mathcal {P}(\mathbb {I})/\mathcal {I} $
, with a representative
$\tilde S\subseteq \mathbb {I}$
. Then
$\mathcal {I}$
induces the ideal
$\mathcal {I}_S:=\{\tilde S \cap J \mid J \in \mathcal {I}\}$
on
$\tilde S$
and
$\mathcal {M} \restriction S$
denotes the reduced product
$\prod _{\mathcal {I}_S} \mathcal {M}_i$
. We let
$a\restriction S$
denote the natural projection of an element a of
$\mathcal {M}$
to
$\mathcal {M} \restriction S$
.
We first show Step (1), i.e., interpreting the relative support function implies that the relevant family of quotients is also interpretable. Before proving the following sequence of lemmas, we recall that the concept of a full class was defined in Definition 2.4.
Lemma 3.1. Let
$\mathfrak C$
be a full class,
$\mathbb {I}$
be an index set,
$\mathcal {I}$
be an ideal on
$\mathbb {I}$
and
$(\mathcal M_i)_{i \in \mathbb {I}}$
be a fixed family of
$\mathcal {L}$
-structures from
$\mathfrak C$
. Let
$\mathcal {M} := \prod _{\mathcal {I}} \mathcal {M}_i$
be the reduced product. Assume that
$\mathcal {M}$
interprets the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the relative support function:
Then both the restriction
$\mathcal {M} \restriction S$
, with its natural
$\mathcal {L}$
-structure, and the natural projection
$\pi _S: \mathcal {M} \rightarrow \mathcal {M} \restriction S$
via
$a\mapsto a\restriction S$
are (uniformly) interpretable with parameter S.
Proof. We first recover the base set of
$\mathcal {M} \restriction S$
as the quotient of
$\mathcal {M}$
by the equivalence relation
$\simeq $
given by: for all
$a,b \in \mathcal {M}$
,
It remains to interpret the
$\mathcal {L}$
-structure of
$\mathcal {M} \restriction S$
. Let R be a predicate in
$\mathcal {L}$
. Since
$\mathfrak C$
is full, R is a satisfiable h-formula. By Lemma 2.29, the support function
$ {\mathrm {supp}}_{R(\bar {x})}$
is interpretable in
$\mathcal {M}$
. Then, for any
$\bar {a}\restriction S$
in
$\left (\mathcal {M}\restriction S\right )^{|\bar {x}|}$
, we have that
$\mathcal {M}\restriction S \models R( \bar {a}\restriction S )$
if and only if
$ {\mathrm {supp}}_{R(\bar {x})} (\bar {a}) \supseteq S$
. The interpretations of function symbols f from
$\mathcal {L}$
in
$\mathcal {M}\restriction S$
are also straightforward: for any
$\bar {a}\restriction {S}\in \left (\mathcal {M}\restriction S\right )^{|\bar {x}|}$
, set
Lemma 3.2. Let
$\mathfrak C$
be a full class,
$\mathbb {I}$
be an index set,
$\mathcal {I}$
be an ideal on
$\mathbb {I}$
and
$(\mathcal M_i)_{i \in \mathbb {I}}$
be a fixed family of
$\mathcal {L}$
-structures from
$\mathfrak C$
. Let
$\mathcal {M} := \prod _{\mathcal {I}} \mathcal {M}_i$
be the reduced product. Then the following are equivalent:
-
(1) The formula $\varphi (x,x',y,y') := {\mathrm {supp}}_{=}(x,x') \subseteq {\mathrm {supp}}_{=}(y,y')$
is an
$\emptyset $
-definable subset of
$\mathcal {M}^{4}$
. -
(2) The Boolean algebra $(\mathcal {P}(\mathbb {I})/\mathcal {I},\subseteq )$
and the relative support function
$ {\mathrm {supp}}_{=}: \mathcal {M}^{2} \to \mathcal {P}(\mathbb {I})/\mathcal {I}$
are interpretable in
$\mathcal {M}$
.
Proof.
$(1) \to (2)$
. Suppose that
$\varphi (x,x',y,y')$
is a definable set. Consider the equivalence relation given by
$E := \varphi (x,x',y,y') \cap \varphi (y,y',x,x')$
. Then
$\mathcal {M}^{2}/E$
is naturally isomorphic to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
. Let
$\pi _{E}:\mathcal {M}^{2} \to \mathcal {M}^{2}/E$
be the quotient map. Notice that if
$S, T \in \mathcal {P}(\mathbb {I})/\mathcal {I} $
, then
$S \subseteq T$
if and only if
$\exists a,b,c,d$
in
$\mathcal {M}$
such that
$\pi _{E}(a,b) = S$
,
$\pi _{E}(c,d) = T$
and
$\varphi (a,b,c,d)$
. Hence the relation
$\subseteq $
is interpretable. Notice that
$\pi _{E} = {\mathrm {supp}}_{=}$
which concludes this direction.
$(2) \to (1)$
. By construction, the set
$\varphi (x,x',y,y')$
is a definable subset of
$\mathcal {M}^{4}$
in
$\mathcal {M}^{ {\mathrm {eq}}}$
. Since there are no new definable subsets of
$\mathcal {M}^{n}$
in
$\mathcal {M}^{ {\mathrm {eq}}}$
, we see that
$\varphi (x,x',y,y')$
is already definable in M.
Lemma 3.3. Let
$\mathfrak C$
be a full class. Suppose that there exists an
$\mathcal {L}$
-formula
$\varphi (x,x',y,y')$
such that for any index set
$\mathbb {I}$
, ideal
$\mathcal {I}$
on
$\mathbb {I}$
and family
$(\mathcal M_i)_{i \in \mathbb {I}}$
of
$\mathcal {L}$
-structures from
$\mathfrak C$
, the reduced product
$\mathcal {M} := \prod _{\mathcal {I}} \mathcal {M}_i$
satisfies
Then the class
$\mathfrak C$
recognizes coordinates.
Proof. Assume that
$\mathcal {M}= \prod _{\mathcal {I}}\mathcal {M}_i$
and
$\mathcal {N}=\prod _{\mathcal {J}}\mathcal {N}_j$
are reduced products of structures from
$\mathfrak C$
and let
$\Phi \colon \mathcal {M}\to \mathcal {N}$
be an isomorphism. Then
$\Phi $
extends to an isomorphism
$\mathcal {M}^{ {\mathrm {eq}}}\rightarrow \mathcal {N}^{ {\mathrm {eq}}}$
and by Lemma 3.2, it induces an isomorphism
$\alpha : \mathcal {P}(\mathbb {I})/\mathcal {I} \rightarrow \mathcal {P}(\mathbb {J})/\mathcal {J} $
. Then, we can name the parameter S, and
$\Phi $
gives rise to an isomorphism between
$\mathcal M\restriction S$
and
$\mathcal N \restriction {\alpha (S)}$
by Lemma 3.1. Hence the following diagram commutes:

This shows that
$\mathfrak C$
recognizes coordinates.
Remark 3.4. Uniformity comes for free: assume otherwise, that for all formulas
$\varphi (x, x', y, y')$
, there is a reduced product
$\prod _{\mathcal {I}_\varphi } \mathcal {M}_i$
where
$ {\mathrm {supp}}_=(x, x') \subseteq {\mathrm {supp}}_=(y, y')$
is not equivalent to
$\varphi (x, x', y, y')$
. Then
$ {\mathrm {supp}}_=(x, x') \subseteq {\mathrm {supp}}_=(y, y')$
is not
$\emptyset $
-definable in the reduced product
$\prod _{\mathcal {I}} \mathcal {M}_i$
, where
$\mathcal {I} := \bigoplus _\varphi \mathcal {I}_\varphi $
.
3.2 Recognizing coordinates implies interpretability of the support
In this section, we prove the main implication (1
$\Rightarrow $
2) of Theorem 1. We show that if a class of structures recognizes coordinates, then all reduced products from said class interpret the relative support function. In fact, we show that recognizing coordinates in
$\mathbb {N}$
is enough. This is at the cost of some additional work and requires a forcing argument. For full classes of structures see Definition 2.4.
Proposition 3.5. Let
${\mathcal L}$
be a countable language and let
$\mathfrak C$
be a full class of
$\mathcal {L}$
-structures. If
$\mathfrak C$
recognizes coordinates in
${\mathbb N}$
, then any reduced product of structures from
$\mathfrak C$
defines the relative support function.
The proof of this proposition requires two lemmas. In one of the lemmas, we use a Keisler–Shelah-style argument to compare isomorphic ultrapowers. Since there is a forcing extension in which two elementarily equivalent countable structures have no isomorphic ultrapower associated with an ultrafilter on
${\mathbb N}$
([Reference Shelah, Judah, Just and Woodin65]), our proof involves set theory. More precisely, we need a slight modification of a standard theorem, first proven in [Reference Platek61], asserting that if
$\varphi $
is a projective statement provable in ZFC+CH, then
$\varphi $
is provable in ZFC.
For a reduced product
$\mathcal M:=\prod _{\mathcal I} \mathcal M_i $
, consider the structure
in the language of
$\mathcal M$
expanded by a sort for
$\mathcal P({\mathbb N})/{\mathcal I}$
equipped with its natural Boolean algebra structure.
Lemma 3.6. Let
${\mathcal L}$
be a countable language and let
$\mathfrak C$
be a full class of
$\mathcal {L}$
-structures that is closed under elementary equivalence. For a formula
$\psi (\bar x)$
of the expanded language (possibly with parameters from
$\mathcal M$
), consider the statement,
-
θψ: For every reduced product $\mathcal M$
of structures in
$\mathfrak C$
associated with an ideal
${\mathcal I}$
on
${\mathbb N}$
, the set definable by
$\psi $
in
$\mathcal M^+$
is first-order definable in
$\mathcal M$
(with the same parameters).
Then ZFC+CH implies
$\theta _{\psi }$
if and only if ZFC implies
$\theta _{\psi }$
.
Proof. Only the direct implication requires a proof. Suppose that ZFC and CH together imply
$\theta _{\psi }$
. Fix
$\mathcal M_n$
, for
$n\in {\mathbb N}$
, in
$\mathfrak C$
and an ideal
${\mathcal I}$
on
${\mathbb N}$
. Let
$\kappa :=\max (\sup _{n\in {\mathbb N}} |\mathcal M_n|, 2^{\aleph _0})$
, and let
$\mathbb P$
be the forcing notion whose conditions are functions
$p\colon \gamma _p\to \kappa $
, where
$\gamma _p$
is a countable ordinal, ordered by the reverse extension (hence
$p\leq q$
, i.e., p is a stronger condition than q, if
$\gamma _p\geq \gamma _q$
and
$p\restriction \gamma _q=q$
).
This forcing notion is the Lévy collapse of
$\kappa $
to
$\aleph _1$
. We need two standard facts about forcing with
$\mathbb P$
. First, in the generic extension there is a surjection from
$\aleph _1$
to
$\kappa $
[Reference Jech35, Lemma 15.21]. Second,
$\mathbb P$
is
$<\aleph _1$
-closed (see the last two lines of the proof of [Reference Jech35, Lemma 15.21]). Therefore
$\mathbb P$
does not add any bounded subsets of
$\kappa $
[Reference Jech35, Lemma 15.8] and in particular it does not add any new subsets of
$\mathcal P({\mathbb N})$
, or any new elements of
$\prod _n \mathcal M_n$
.
These two facts imply that CH holds in the forcing extension and that each one of the structures
$\prod _{n} \mathcal M_n$
,
$\mathcal M$
and
$\mathcal M^+$
is unchanged. Moreover, since
$\mathfrak C$
is assumed to be closed under elementary equivalence, each
$\mathcal M_n$
still belongs to
$\mathfrak C$
in the forcing extension. Since ZFC+CH implies
$\theta _{\psi }$
, in the forcing extension there exists a formula
$\varphi $
such that for all
$\bar a$
in
$\mathcal M$
we have that
$\mathcal M^+\models \psi (\bar a)$
if and only if
$\mathcal M\models \varphi (\bar a)$
. Note that
$\varphi $
belongs to the ground model, as it is a finite sequence of symbols in
${\mathcal L}$
.
Since
$\prod _n \mathcal M_n$
is unchanged by forcing, and since
${\mathcal I}$
is the same (since
$\mathcal P({\mathbb N})$
is unchanged by forcing,
${\mathcal I}$
remains an ideal on
${\mathbb N}$
in the forcing extension),
$\mathcal M$
is unchanged by forcing. Therefore
$\varphi $
and
$\psi $
define the same set in the ground model, as required.
Lemma 3.6 will be applied in situations when
$\psi $
is the formula
Lemma 3.7. Let
${\mathcal L}$
be a countable language and let
$\mathfrak C$
be a class of
$\mathcal {L}$
-structures. If every atomless reduced product
$\prod _{i\in {\mathbb N}}\mathcal M_i/\mathcal {I}$
of structures from
$\mathfrak C$
defines
$ {\mathrm {supp}}_=$
, then every atomless reduced product
$\prod _{i\in \mathbb {I}}\mathcal M_i /\mathcal {I}$
of structures from
$\mathfrak C$
defines
$ {\mathrm {supp}}_=$
.
Proof. Assume the contrary, that there are an atomless ideal
${\mathcal I}$
on some index set
$\mathbb {I}$
and reduced product
$\mathcal M:=\prod _{i\in \mathbb {I}} \mathcal M_i/\mathcal {I}$
of structures from
$\mathfrak C$
such that no formula
$\varphi $
defines
$ {\mathrm {supp}}_=$
in
$\mathcal M$
. Let
$\mathcal F_4$
be the set of all
${\mathcal L}$
-formulas with at most four free variables.
For every formula
$\varphi \in \mathcal F_4$
fix
$a^\varphi _1,a^\varphi _2,b^\varphi _1,b^\varphi _2$
in
$\mathcal M$
such that
Consider the Boolean subalgebra
${\mathcal A}$
of
$\mathcal P(\mathbb {I})$
generated by the sets
and the sets
where
$\varphi $
and
$\psi $
range over
$\mathcal F_4$
.
Let
$\theta $
be a regular cardinal sufficiently large to have all of the objects mentioned so far –
${\mathcal L}$
,
${\mathbb I}$
,
${\mathcal I}$
,
$\langle \mathcal M_i: i\in {\mathbb I}\rangle $
,
$\mathcal F_4$
, the assignment
$\varphi \mapsto (a^\varphi _1,a^\varphi _2,b^\varphi _1,b^\varphi _2)$
– belong to the set
$H_\theta $
of all sets whose hereditary closure has cardinality less than
$\theta $
(see e.g., [Reference Kunen41, Definition I.13.27]).
Let
$N\preceq H_\theta $
be a countable elementary submodel that contains all of the objects listed above . Since the Boolean algebra
${\mathcal A}$
is countable, it is included in N. Define
By elementarity,
${\mathcal I}_0$
is a proper atomless ideal on
$\mathbb {I}_0$
. Let
$\mathcal M_0:=\prod _{i\in \mathbb {I}_0} \mathcal M_i/{\mathcal I}_0$
. Since
$\mathbb {I}_0$
is countable, our assumption implies that there is a formula
$\varphi $
such that
for all
$a_1,a_2,b_1,b_2$
in
$\mathcal M$
. In particular, this holds for
$a_1=a_1^\varphi \restriction \mathbb {I}_0$
(i.e.,
$a_1=\pi _{\mathbb {I}_0}(a_1^\varphi )$
), and analogously defined
$a_2,b_1$
and
$b_2$
.
By our choice of
$\mathbb {I}_0$
and
${\mathcal I}_0$
, we have that
By the Feferman–Vaught theorem as stated in [Reference Chang and Keisler9, Theorem 6.3.2], there are a finite list
$\psi _j$
, for
$1\leq j\leq k$
, of
${\mathcal L}$
-formulas and a formula
$\Theta (z_1,\dots , z_k)$
in the language of Boolean algebras such that
and also
Both
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and
$\mathcal {P}(\mathbb {I}_0)/\mathcal {I}_0$
are atomless Boolean algebras and we may therefore assume
$\Theta $
is quantifier-freeFootnote
4
. Thus the truth of
$\Theta (z_1,\dots , z_k)$
depends only on knowing which of the intersections
$\bigcap _{j=1}^k z_j^{\xi (j)}$
are trivial, where
, with
. The choice of
$N\preceq H_\theta $
, the set
$\mathbb {I}_0$
and the ideal
${\mathcal I}_0$
assures that for all such
$\xi $
we have
$\bigcap _{j=1}^k (\zeta ^\varphi _{\psi _k})^{\xi (j)}\in {\mathcal I}$
if and only if
$\bigcap _{j=1}^k (\zeta ^\varphi _{\psi _k}\cap \mathbb {I}_0)^{\xi (j)}\in {\mathcal I}_0$
(where the complement is evaluated with respect to
$\mathbb {I}_0$
).
Therefore
$ \mathcal M\models \varphi (a^\varphi _1,a^\varphi _2,b^\varphi _1,b^\varphi _2)$
if and only if
$\mathcal M_0\models \varphi (a_1,a_2,b_1,b_2)$
. Together with (3.2), this implies the negation of (3.1); contradiction.
Proof of Proposition 3.5.
Suppose that
${\mathcal L}$
is a countable language and
$\mathfrak C$
is a full class of
$\mathcal {L}$
-structures which recognizes coordinates in
${\mathbb N}$
, and fix a reduced product
$\mathcal {M}:= \prod _{i\in \mathbb {I}}\mathcal M_i/\mathcal {I}$
of structures from
$\mathfrak C$
. We need to prove that
$\mathcal M$
defines the relative support function
$ {\mathrm {supp}}_=$
, quotients
$\mathcal M_{S}$
and quotient maps
$\pi _S\colon \mathcal M\to \mathcal M\restriction S$
, for all
$S\in \mathcal {P}(\mathbb {I})/\mathcal {I} $
. By Theorem 2.18 we may assume that the ideal
${\mathcal I}$
is atomless. By Lemma 3.7 it suffices to prove this in the case when
$\mathcal M=\prod _{i\in {\mathbb N}}\mathcal M_i/\mathcal {I}$
is a reduced product associated with an atomless ideal
$\mathcal {I}$
on
${\mathbb N}$
.
We use Beth’s definability theorem. For
$ {\mathrm {supp}}_=$
, it suffices to prove that for every reduced product
$\mathcal M$
of structures from
$\mathfrak C$
, the support function on
$\mathcal M$
is implicitly interpretable. This means that for every elementary extension
$\mathcal {N}$
of
$\mathcal {M}$
and any two ‘support’ functions
$s_1$
and
$s_2$
on
$\mathcal N$
such that,
we have that for all
$a,a',b,b' \in \mathcal {N}$
, we have
$s_1(a,a')\subseteq s_1(b,b') $
if and only if
$s_2(a,a')\subseteq s_2(b,b')$
.
Fix
$\mathcal M$
,
$\mathcal N$
,
$s_1$
and
$s_2$
and let
${\mathcal U}$
be a nonprincipal ultrafilter on
${\mathbb N}$
. If the Continuum Hypothesis (CH) holds and all
$\mathcal M_i$
as well as
$\mathcal N$
have cardinality no greater than
$2^{\aleph _0}$
, then the ultrapowers
$\prod _{\mathcal {U}}(\mathcal {N},s_1)$
,
$\prod _{\mathcal {U}}(\mathcal {M}, {\mathrm {supp}}_=)$
and
$\prod _{\mathcal {U}}(\mathcal {N},s_2)$
have cardinality
$2^{\aleph _0}$
and are
$\aleph _1$
-saturated. Since they are also elementarily equivalent, we have two isomorphisms
$\sigma : \prod _{\mathcal {U}}\mathcal {M} \rightarrow \prod _{\mathcal {U}}\mathcal {N} $
and
$\tau : \prod _{\mathcal {U}}\mathcal {M} \rightarrow \prod _{\mathcal {U}}\mathcal {N}$
that moreover respect
$ {\mathrm {supp}}_=$
,
$s_1$
and
$s_2$
so that the following holds:
We will complete the proof under this assumption and then show how it can be removed.
By Proposition 2.19, there is an ideal
$\mathcal {J}$
on the index set
$\mathbb {J}={\mathbb N}\times {\mathbb N}$
and an enumeration
$\mathcal {M}_{ij}$
, for
$(i,j)\in {\mathbb N}\times \mathbb {{\mathbb N}}$
(with many repetitions), such that
$\prod _{\mathcal {U}}(\mathcal {M}, {\mathrm {supp}}_=) = (\prod _{\mathcal {J}}\mathcal {M}_{ij}, {\mathrm {supp}}_=)$
.
Let
$\rho = \tau ^{-1}\circ \sigma $
. This map is an automorphism of
$\prod _{\mathcal {J}}\mathcal M_{ij}$
. We need to show that this is an automorphism of
$(\prod _{\mathcal {J}}\mathcal M_{ij}, {\mathrm {supp}}_=)$
.
Since
$\mathfrak C$
recognizes coordinates, there is an automorphism
$\alpha : \mathcal {P}(\mathbb {J})/\mathcal {J} \rightarrow \mathcal {P}(\mathbb {J})/\mathcal {J} $
such that for all
$S\in \mathcal {P}(\mathbb {J})/\mathcal {J} $
the following diagram commutes (see Definition 2.5):

To show that
$(\rho ,\alpha )$
is an automorphism of
$(\prod _{\mathcal {J}} \mathcal M_{ij}, {\mathrm {supp}}_=)$
, we only need to show that it respects the support function. Take a pair
$(g,g')$
of elements of
$\prod _{\mathcal {J}} \mathcal M_{ij}$
and set
$S= {\mathrm {supp}}_=(g,g')$
. Then
$\pi _S(g)=\pi _S(g')$
and since the diagram commutes, we have
It follows that
$ \alpha ( {\mathrm {supp}}_=(g,g')) \subseteq {\mathrm {supp}}_=(\rho (g),\rho (g'))$
. By considering the isomorphisms
$\rho ^{-1}$
and
$\alpha ^{-1}$
instead of
$\rho $
and
$\alpha $
, by the analogous argument we have that
which gives the other inclusion:
Therefore, for all
$g,g'$
, we have
$\alpha ( {\mathrm {supp}}_=(g,g')) = {\mathrm {supp}}_=(\rho (g),\rho (g'))$
and
$(\rho ,\alpha )$
is an automorphism of
$(\prod _{\mathcal {J}}\mathcal M_{ij}, {\mathrm {supp}}_=)$
.
The rest of the proof is straightforward: let
$a,a',b,b' \in \mathcal {N}$
such that
$s_1(a,a') \subseteq s_1(b,b')$
. Then in the ultraproduct, we have
where
$ {\mathrm {diag}}$
is the canonical embedding of
$\mathcal {N}$
in the ultrapower. Since
$ {\mathrm {Id}} =\sigma ^{-1}\circ \rho \circ \tau $
is a composition of isomorphisms preserving the support, we also have
and therefore,
By the Beth definability theorem, this proves that the relation
$ {\mathrm {supp}}_=(x,x')\subseteq {\mathrm {supp}}_=(y,y')$
is first-order definable in
$\mathcal M$
if CH holds and all
$\mathcal M_n$
and
$\mathcal N_n$
have cardinality not greater than the continuum.
The Feferman–Vaught theorem implies that if
$\mathcal M_i\equiv \mathcal N_i$
for all i and
$ {\mathrm {supp}}_=$
is first-order definable in
$\prod _{\mathcal I}\mathcal M_i$
, then
$ {\mathrm {supp}}_=$
is first-order definable in
$\prod _{\mathcal I} \mathcal N_i$
, by the same definition.Footnote
5
Therefore we may apply Lemma 3.6 to the closure of
$\mathfrak C$
(under elementary equivalence). By applying it to
$\psi $
chosen to be
$ {\mathrm {supp}}_=(x_1,x_2)\subseteq {\mathrm {supp}}_=(y_1,y_2)$
, this conclusion follows already in ZFC. Therefore
$ {\mathrm {supp}}_=$
is definable in reduced products of structures in
$\mathfrak C$
associated with ideals on
${\mathbb N}$
. As pointed out at the beginning of the proof, this implies the general case.
3.3 Proof of the main result
If
$\mathfrak C$
is a class of
$\mathcal {L}$
-structures, we let
$ {\mathrm {Th}}(\mathfrak C)$
denote the common theory of the structures in
$\mathfrak C$
, that is, the set of all
${\mathcal L}$
-sentences that are true in all structures in
$\mathfrak C$
. The following theorem implies Theorem 1.
Theorem 3.8. For a countable language
${\mathcal L}$
and a full class
$\mathfrak C$
of
$\mathcal {L}$
-structures, the following are equivalent:
-
(1) $\mathfrak C$
recognizes coordinates. -
(2) $\mathfrak C$
recognizes coordinates in
${\mathbb N}$
. -
(3) For every ideal $\mathcal {I}$
on an index set
$\mathbb {I}$
, a reduced product
$\mathcal M:=\prod _{\mathcal {I}} \mathcal M_i$
of structures from
$\mathfrak C$
interprets both the Boolean algebra
$\mathcal P(\mathbb {I})/{\mathcal I}$
and the system of quotient structures
$\mathcal M\restriction S$
and quotient maps
$\pi _S$
(parametrized by
$S\in \mathcal P(\mathbb {I})/{\mathcal I}$
). -
(4) For every ideal $\mathcal {I}$
on an index set
$\mathbb {I}$
, a reduced product
$\mathcal M:=\prod _{\mathcal {I}} \mathcal M_i$
of structures from
$\mathfrak C$
interprets the Boolean algebra
$(\mathcal {P}(\mathbb {I})/\mathcal {I} , \subseteq )$
and the relative support function $$\begin{align*}{\mathrm{supp}}_=: \mathcal{M}^2\rightarrow \mathcal{P}(\mathbb{I})/\mathcal{I}, \ ((a_i)_i,(a_i')_i) \mapsto \big[\{i \mid a_i = a_i'\}\big]_{\mathcal{I}}. \end{align*}$$
-
(5) The formula $x=x' \rightarrow y=y'$
is equivalent to an h-formula in the common theory
$ {\mathrm {Th}}(\mathfrak C)$
of
$\mathfrak C$
.
-
(6) The formula $x=z \rightarrow y=z$
is equivalent to an h-formula in the common theory
$ {\mathrm {Th}}(\mathfrak C)$
of
$\mathfrak C$
.
In the case when
${\mathcal L}$
is not necessarily countable, assertions (1) and (3)–(5) are equivalent.
Proof. The implication (1)
$\Rightarrow $
(2) is trivial. (2)
$\Rightarrow $
(4) is the main implication (see Proposition 3.5); it is also the only implication that uses the assumption that
${\mathcal L}$
is countable. The equivalence between (4) and (5) is Theorem 2.18. As all structures in a full class
$\mathfrak C$
have at least three elements, the equivalence of (5) and (6) is Proposition 2.14. The implication (4)
$\Rightarrow $
(3) follows from Lemma 3.1. Finally, (3)
$\Rightarrow $
(1) is Lemma 3.2 and Lemma 3.3.

In the case when
${\mathcal L}$
is not necessarily countable, it suffices to prove that (1) implies (4). The proof follows the proof of Proposition 3.5 closely. The only difference is that instead of
$\aleph _1$
-saturated ultrapowers
$\prod _{\mathcal {U}}(\mathcal {N},s_1)$
,
$\prod _{\mathcal {U}}(\mathcal {M}, {\mathrm {supp}}_=)$
and
$\prod _{\mathcal {U}}(\mathcal {N},s_2)$
one needs to choose saturated elementary extensions of
$(\mathcal N,s_1)$
,
$(\mathcal M, {\mathrm {supp}}_=)$
and
$(\mathcal N,s_2)$
Footnote
6
of the same cardinality; the remaining part of the proof is identical.
It is not enough to just interpret the quotient Boolean algebra. As a limiting example, we consider the group of 8 elements corresponding to the basis of the Hamiltonians, commonly referred to as
$Q_8$
. We show that the reduced product
$\prod _{ {\mathrm {Fin}}} Q_8$
interprets the quotient
$\mathcal {P}(\mathbb {{\mathbb N}})/\mathcal { {\mathrm {Fin}}} $
, but the relative support function
$ {\mathrm {supp}}_=$
is not interpretable. Consequently, we prove that
$Q_8$
does not recognize coordinates (see Example 7.8).
By the Keisler–Shelah theorem, the class of all models of
$ {\mathrm {Th}}(\mathfrak C)$
is the class of all elementary submodels of ultraproducts of models in
$\mathfrak C$
.
Corollary 3.9. A full class
$\mathfrak C$
of
$\mathcal {L}$
-structures recognizes coordinates if and only if
$ {\mathrm {Th}}(\mathfrak C)$
recognizes coordinates.
Proof. This is immediate, as by Theorem 3.8 (5), recognizing coordinates is a property of
$ {\mathrm {Th}}(\mathfrak C)$
.
Another amusing consequence of Theorem 3.8 is the following. Suppose that a class
$\mathfrak C$
recognizes coordinates and
$\mathcal M$
is an (atomless) reduced product of structures in
$\mathfrak C$
. Then every model
$\mathcal N$
of
$ {\mathrm {Th}}(\mathcal M)$
interprets an (atomless) Boolean algebra and a system of quotients
$\pi _S\colon \mathcal N\to \mathcal N_S$
for S ranging over this Boolean algebra that behave as the maps in the diagram in Definition 2.5. In other words, every model of
$ {\mathrm {Th}}(\mathcal M)$
‘thinks’ that it is an (atomless) reduced product.
4 Groups recognizing coordinates
In this section, we shift our attention to classes of groups. We first prove some basic preparatory results to work in this setting. We then show that a large variety of familiar classes of groups recognize coordinates. In later sections, we will consider classes of groups which do not recognize coordinates.
4.1 General criteria for recognizing coordinates
We begin by fixing some notation for this section. Suppose that G is a group and a is an element of G. We will always use the symbol
$\cdot $
for group multiplication and the symbol e for the identity element of G. We let
$a^{G}$
denote the conjugacy class of a inside the group G. We remark that if z is a variable, then
$x \in z^{G}$
is shorthand for
$\exists y (yzy^{-1} = x)$
. If
$S \subseteq G$
, we let
$C_{G}(S)$
denote the centralizer of S, i.e.,
If S is a definable subset of G, then so is
$C_{G}(S)$
. We let
$Z(G)$
denote the centre of G. If n is a natural number, then
$a^{n}$
denotes the element a to the n-th power, while if
$g \in G$
, then
$a^{g}$
denotes the conjugate of a by g, i.e.,
$a^{g} := gag^{-1}$
.
It will be convenient to use the set relation
$\subseteq $
when referring to elements of
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
. If
$\prod _{\mathcal {I}} G_i$
is a reduced product of groups, and a is an element of
$\prod _{\mathcal {I}} G_i$
with representative
$(a_i)_i$
, we define the support of a as
In this context, Theorem 3.8 can be rewritten as follows:
Theorem 4.1 (Groups recognizing coordinates).
Let
$\mathfrak C$
be a full class of groups in a language
$\{\cdot , {}^{-1}, e, \dots \}$
with potentially additional structure. The following are equivalent:
-
• $\mathfrak C$
recognizes coordinates. -
• The relation $ {\mathrm {supp}}(y) \subseteq {\mathrm {supp}}(x)$
is definable in all reduced products of structures from
$\mathfrak C$
.Footnote
7
-
• The formula $x=e \rightarrow y=e$
is equivalent to an h-formula in the common theory
$ {\mathrm {Th}}(\mathfrak C)$
of
$\mathfrak C$
.
We first note that the formula
$x=z \rightarrow y=z$
is equivalent to an h-formula if and only if
$xz^{-1}=e \rightarrow yz^{-1}=e$
is equivalent to an h-formula. The theorem above follows from Theorem 3.8 and the following lemma:
Lemma 4.2. Let
$\mathfrak C$
be a class of groups. Fix a reduced product
$G=\prod _{\mathcal {I}} G_i$
of groups from
$\mathfrak C$
. The following are equivalent:
-
(1) The relation,
$$\begin{align*}{\mathrm{supp}}(a)\subseteq {\mathrm{supp}}(b), \end{align*}$$
is first-order definable in G.
-
(2) The support function,
$$\begin{align*}{\mathrm{supp}}: (a_i)_i \mapsto \big[\{ i \mid a_i \neq e\}\big]_{\mathcal{I}},\end{align*}$$
is first-order interpretable in G.
-
(3) The relative support function,
$$\begin{align*}{\mathrm{supp}}_= \colon (a_i)_i,(b_i)_i \mapsto \big[\{ i \mid a_i=b_i\}\big]_{\mathcal{I}},\end{align*}$$
is first-order interpretable in G.
Proof.
$(1 \rightarrow 2)$
Assume the relation
$a \sqsubseteq b$
defined by
$ {\mathrm {supp}}(a)\subseteq {\mathrm {supp}}(b)$
for
$a,b\in G $
is definable. This relation is a pre-order, and we denote by
$\sim $
the associated equivalence relation: for
$a,b\in G$
,
$a\sim b$
holds if and only if a and b have the same support. The ordered quotient
$(G/\sim , \sqsubseteq )$
is therefore isomorphic to
$(\mathcal {P}(\mathbb {I})/\mathcal {I} ,\subseteq )$
and the natural projection is, after identification, equal to the support function
$ {\mathrm {supp}}$
.
$(2 \rightarrow 3)$
This implication is immediate: for all
$a,b\in G$
, we have
$(3 \rightarrow 1)$
This is immediate, since for all
$a,b\in G$
,
$ {\mathrm {supp}}(a)\subseteq {\mathrm {supp}}(b)$
holds if and only if
$ {\mathrm {supp}}_=(b,e) \subseteq {\mathrm {supp}}_=(a,e)$
.
Now that we have finished the preliminaries of this section, we are able to give our first classes of groups which recognize coordinates (very exciting). We will use these first examples to show that more familiar classes of groups recognize coordinates.
Theorem 4.3.
-
(1) Let $\mathcal {G}$
be the class of all groups G such that for every
$a \in G\backslash \{e\}$
,
$C_G(a^G)=\{e\}$
. Then
$\mathcal {G}$
recognizes coordinates. -
(2) For a prime p, let $\mathcal {G}_{p}$
be the class of all groups G which have elements of order p and for every
$a\in G$
of order p,
$C_G(a^G)=\{e\}$
. Then
$\mathcal {G}_{p}$
recognizes coordinates.
Proof. (1) We show that
$x=e \rightarrow y=e$
is equivalent to the h-formula:
-
(*) $(\forall z) ~ \left (y\in C(z^G)\rightarrow x\in C(z^G)\right )$
.
To see this, let
$\varphi (x,z)$
be the formula
$(\forall t)(xtzt^{-1}=tzt^{-1}x)$
, or equivalently,
$x\in C_G(z^G)$
. This is an h-formula and, since
$\varphi (x,e)$
is true in every group,
$(\forall z)(\varphi (y,z)\rightarrow \varphi (x,z))$
is also an h-formula. This formula is clearly equivalent to (*). The assumption that
$C_G(a^G)=\{e\}$
for every
$G\in \mathcal G$
and every
$a\neq e$
in G implies that (*) is equivalent to
$x=e\to y=e$
.
The conclusion follows by Theorem 4.1.
(2) Fix a prime p. For a group in
$\mathcal {G}_p$
, we have that
$x=e \rightarrow y=e$
is equivalent to
Indeed, notice that for all z of order p or
$1$
, if
$x= e$
, then
$x\in C(z^G)$
. If
$x\neq e$
, then
$x\in C(z^G)$
only if
$z=e$
. Therefore,
$x = e \to y = e$
holds if and only if
and the equivalence with (**) is clear. We observe that (**) is an h-formula as
is always satisfied. The statement holds by Theorem 4.1.
A group G satisfies (1) of Theorem 4.3 if and only if for any nontrivial normal subgroup H of G,
$C_G(H)=\{e\}$
. This is equivalent to being a domain in the sense of [Reference Baumslag, Myasnikov and Remeslennikov2, Definition 1].
In [Reference Kvaschuk, Myasnikov and Remeslennikov43, Theorem A] it was proved that the first-order theory of a finite product of domains
$\prod _{i<n} G_i$
‘determines n’ and interprets the theories of all
$G_i$
, for
$i<n$
. Together with an easy argument using the Keisler–Shelah theorem, this is equivalent to the assertion that domains recognize coordinates in finite products. Our methods give the following far-reaching generalization of that result (we will not need to use the definition of an acylindrically hyperbolic group; it suffices to say that this class is extensive and well-studied; see [Reference Osin55]).
Corollary 4.4. The class of all domains recognizes coordinates. In particular, the class of all acylindrically hyperbolic groups without a nontrivial finite normal subgroup recognizes coordinates.
Proof. By Theorem 4.3 (1), the class of all domains recognizes coordinates. By [Reference Cassella, Paolini and Paolini8, Theorem 1.3], every acylindrically hyperbolic group without a nontrivial finite normal subgroup is a domain.
Proposition 4.5. Suppose that T is a theory of (nontrivial) groups and that for some
$m\geq 1$
and
$n\geq 1$
, T includes an axiom asserting the following:
-
(1) For all $a,b$
in
$G\setminus \{e\}$
of order dividing m there is some c in
$a^G$
such that
$bc\neq cb$
. -
(2) Every c in G is the product of at most n elements, each one of which has order dividing m.
Then T recognizes coordinates.
Proof. We proceed as in the proof of Theorem 4.3. We will show that, modulo the theory T, the formula
$ x=e \rightarrow y=e $
is equivalent to the following (let
$G_{[m]}$
denote the set of elements of G whose order divides m).
Assume that (*) holds, witnessed by
$y =a_1 \cdot \dots \cdot a_n$
with
$a_i\in G_{[m]}$
,
$i\leq n$
. Moreover, assume
$x=e$
. Then for every
$a\in G_{[m]} \setminus \{e\}$
we have
$x\in C(a^G)\cap G_{[m]}$
. By (*), we have for
$i\leq n$
that
$a_i\in C(a^G)\cap G_{[m]}$
. Since (1) implies that this set is equal to
$\{e\}$
, it follows that
$a_i=e$
for all i and therefore
$y=a_1\cdot \dots \cdot a_n=e$
.
Conversely, assume that
$x=e \rightarrow y=e $
holds. If
$x=y=e$
, then (*) trivially holds, witnessed by
$a_1= \dots = a_n=e$
. Assume
$x\neq e$
. By (2) there are
$a_1,\dots , a_n\in G_{[m]}$
such that
$y=a_1\cdot {}\cdots {} \cdot a_n$
. We check that the consequent of (*) holds for every
$a\in G_{[m]}$
. First, (1) implies that
$x\notin C(a^G)\cap G_{[m]}$
for every
$a\neq e$
. If
$a=e$
, then
$a_i\in C(a^G)$
for all
$i\leq n$
, and therefore, (*) also holds.
4.2 Classes of groups that recognize coordinates
The following theorem gathers classes of groups which we know recognize coordinates. For the definition of perfect groups and quasisimple groups, see §4.3. For an integer
$n\geq 2$
, we let
$\mathfrak S_n$
denote the symmetric group on n elements.
Theorem 4.6. Each of the following classes of groups recognizes coordinates.
-
(a) The class of all nonabelian simple groups.
-
(b) The class of all $\mathfrak S_n$
,
$n\geq 3$
. -
(c) The class of all dihedral groups $D_{2n+1}$
, for
$n\geq 1$
. -
(d) The class of all quasisimple groups of commutator width $\leq n$
, for any fixed n. -
(e) The class of all finite quasisimple groups.
-
(f) The class of groups of the form $ {\mathrm {SL}}(n,F)$
, for
$2\leq n$
and
$|F|\geq 4$
. -
(g) The class of groups which are free products of two nontrivial groups at least one of which has cardinality at least 3.
-
(h) $\{G\}$
where G is any nontrivial free product. -
(i) The class of all graph products $\Gamma \mathcal G$
such that the complement graph
$\bar \Gamma $
is connected and
$|G_v|\geq 3$
for at least one
$v\in V(\Gamma )$
(see §4.5). -
(j) The class of all domains (in the sense of [Reference Baumslag, Myasnikov and Remeslennikov2]) and in particular the class of all acylindrically hyperbolic groups [Reference Osin55] without a nontrivial finite normal subgroup.
Proof. j is Corollary 4.4, included in the present list for completeness.
We will use Theorem 4.3.
(a) It suffices to prove that every nonabelian simple group satisfies (1) of Theorem 4.3. Suppose G is a nonabelian simple group and
$a\in G\setminus \{e\}$
. Since the subgroup generated by
$a^G$
is obviously normal, it is equal to G and in particular
$C_G(a^G)=\{e\}$
.
(b) This is Corollary 4.23. We can remark here that the class
$\{\mathfrak S_n\mid n\geq 4\}$
recognizes coordinates by (1) of Theorem 4.3 since, if
$n\geq 4$
, every nontrivial
$a\in \mathfrak S_n$
has the property that the centralizer of
$a^{\mathfrak S_n}$
is trivial. We also note that the group
$\mathfrak S_3$
satisfies (2) of Theorem 4.3 with
$p=2$
and therefore recognizes coordinates. This is because every element of
$\mathfrak S_3$
of order
$2$
is a transposition, the transpositions generate
$\mathfrak S_n$
and they are pairwise conjugate.Footnote
8
(c) We verify that (2) of Theorem 4.3 holds for
$D:=D_{2n+1}$
with
$p=2$
. We identify D with the group of symmetries of a regular
$2n+1$
-gon. Every element of order
$2$
is a reflection and, since all reflections are conjugate, we verify easily that
$C_{D}(r^{D})=\{e \}$
for every nontrivial reflection r. Since every rotation is a composition of two reflections, the conclusion follows.
(d) This is Corollary 4.10 below.
(e) By [Reference Liebeck, O’Brien, Shalev and Tiep44, Corollary 2], in every finite quasisimple group the commutator width is at most 2 and the result follows from Corollary 4.10 below.
(f) is Corollary 4.11 (a special case of Proposition 4.7).
(g) This is Proposition 4.14 below.
(h) The only nontrivial free product not covered by g is
$({\mathbb Z}/2{\mathbb Z})*({\mathbb Z}/2{\mathbb Z})$
. It recognizes coordinates by Proposition 4.15.
(i) This is Theorem 4.17.
4.3 Perfect groups
We remark that up to this point in the paper, it is not immediately obvious whether there exist groups with nontrivial centres which recognize coordinates. We will see in a later section that if a group admits a nontrivial homomorphism to its centre, then it cannot recognize coordinates. Yet, not every group with a nontrivial centre admits a nontrivial homomorphism into its centre. An example is provided by the so-called perfect groups. These are the groups G with commutator subgroup
$G' = [G,G]$
equal to G itself. A homomorphism from G into some group has an abelian range if and only if its kernel includes the commutator subgroup. In particular, since for
$H\triangleleft G$
we have that
$G/H$
is abelian if and only if
$H\supseteq G'$
, a group is perfect if and only if it has no nontrivial abelian quotients. Hence a perfect group G with nontrivial centre does not admit any nontrivial homomorphism into its centre.
The commutator width of a perfect group is the minimal n such that every element of G is the product of n commutators. There are perfect groups with arbitrarily large commutator width; see [Reference Nikolov52, §2]. In an early draft of this paper, we asked whether there is a perfect, indecomposable group G with infinite commutator width and nontrivial centre, and whether such G can be chosen so that a group elementarily equivalent to G admits a nontrivial homomorphism into its centre. Answering part of this question, Forte Shinko proved that
$C_{\textrm {Homeo}^+(\mathbb R)}({\mathbb Z})$
, the centralizer of the natural copy of
${\mathbb Z}$
inside the group of orientation-preserving homeomorphisms of
$\mathbb R$
, is a perfect indecomposable group with infinite commutator width and nontrivial centre [Reference Shinko67]. A positive answer to the other portion of this question would give a perfect, indecomposable group that does not recognize coordinates.
Note that ‘G is a perfect group of commutator width
$\leq n$
’ is axiomatizable, but ‘G is a perfect group’ is not. Indeed, if
$(G_n)_n$
is a sequence of perfect groups with arbitrarily large commutator width, then any nonprincipal ultraproduct
$\prod _{\mathcal U} G_n$
is imperfect.
Proposition 4.7. For
$m\geq 2$
let
$\mathfrak C_m$
be the class of all perfect groups G of commutator width
$\leq m$
that satisfy the following condition.
-
(†) If $H\trianglelefteq G$
is nonabelian, then
$C_G(H)=Z(G)$
.
Then
$\mathfrak C_m$
recognizes coordinates.
In Theorem 7.1 we will prove that the class of all perfect groups does not recognize coordinates.
Proof. By Theorem 4.1, it suffices to show that
$x=e\rightarrow y=e$
is equivalent to an h-formula in the common theory
$ {\mathrm {Th}}(\mathfrak C_m)$
of
$\mathfrak C_m$
.
Claim 4.8. Suppose that G is in
$\mathfrak {C}_{m}$
. Then for all a and b in G the following condition holds if and only if
$a= e \rightarrow b=e$
holds.
-
(*) For all $z_i, t_i$
,
$i\leq m$
, such that
$a=\prod _{i\leq m} [z_i,t_i]$
there are
$x_i,y_i$
,
$i\leq m$
such that
$b=\prod _{i \leq m} [x_i,y_i]$
, and such that we have $$\begin{align*}C_G(z_i^G,t_i^G:i\leq m) \subseteq C_G(x_i^G,y_i^G:i\leq m). \end{align*}$$
Proof. By (
$\dagger $
), for every
$c\in G\setminus \{e\}$
, if
$c=\prod _i [x_i,y_i]$
then
$C_G(\langle x_i^G, y_i^G: i \leq m\rangle )=Z(G)$
. On the other hand, if
$c=e$
, then we can choose
$x_i=y_i=e$
for all i and therefore
$C_G(\langle x_i^G, y_i^G: i \leq m\rangle )=G$
. Therefore if
$a\neq e$
or
$b= e$
then (*) holds. Conversely, assume
$a= e$
and that (*) holds. Write
$b=\prod _i [x_i,y_i]$
. Then
$C_G(\langle x_i^G, y_i^G: i \leq m \rangle ) \supseteq G$
and b must be equal to e. This concludes the proof.
Claim 4.3 implies that the relation
$ {\mathrm {supp}}(a)\subseteq {\mathrm {supp}}(b)$
is definable in reduced products of groups in
$\mathfrak C_m$
, and the conclusion follows by Theorem 4.1.
Since the class of perfect groups is closed under direct products, some perfect groups are not indecomposable and therefore do not recognize coordinates. Thus the following question remains open.
Question 4.9. Does the class of perfect indecomposable groups recognize coordinates?
A group G is called quasisimple if it is perfect and
$G/Z(G)$
is simple. This includes, for example, all groups of the form
$ {\mathrm {SL}}(n,F)$
for
$n\geq 2$
and F a field with
$|F|\geq 4$
.
Corollary 4.10. If for some n,
$\mathfrak C$
is the class of all quasisimple groups G of commutator width
$\leq n$
then
$\mathfrak C$
recognizes coordinates.
Proof. By the Jordan–Hölder theorem (see e.g., [Reference Judson36, Theorem 13.6]), if G is in
$\mathfrak C$
then
$Z(G)$
is the only nontrivial normal subgroup of G and in particular G has no proper nonabelian normal subgroup. Therefore the conclusion follows by Proposition 4.7.
Corollary 4.11. The class of groups of the form
$ {\mathrm {SL}}(n,F)$
, for
$2\leq n$
and
$|F|\geq 4$
, recognizes coordinates. Following a common convention, we write
$ {\mathrm {SL}}(n,q)$
for
$ {\mathrm {SL}}(n,F_q)$
, q a prime power.
Since the centre of
$ {\mathrm {SL}}(2,5)$
is
${\mathbb Z}/2{\mathbb Z}$
, this gives an example of a group with nontrivial centre that recognizes coordinates.
Proof. The commutator width of each of these groups is at most 2 by [Reference Thompson69]; hence they are all perfect with uniformly bounded commutator width.
If
$G= {\mathrm {SL}}(n,F)$
then
$G/Z(G)$
is
$ {\mathrm {PSL}}(n,F)$
, which is (assuming
$n\geq 2$
and
$|F|\geq 4$
) well-known to be a simple group (see e.g., [Reference Conrad11]). Hence this class of groups is a subclass of all quasisimple groups with commutator width bounded by
$2$
, and Corollary 4.10 applies.
4.4 Free products of groups
In this subsection, we prove (g) and (h) of Theorem 4.3.
Definition 4.12. Suppose that
$G=H_0*H_1$
and both
$H_0$
and
$H_1$
are nontrivial groups. Then every element of
$G\setminus \{e\}$
has the form
$x_1 x_2 \dots x_{n}$
for some
$n\geq 1$
where
$x_i\in (H_0\setminus \{e\})\cup (H_1\setminus \{e\})$
for all
$i\leq n$
and
$x_i \in H_0$
if and only if
$x_{i+1}\in H_1$
for all
$i\leq n-1$
. With these conventions we define the following (
$\lambda $
stands for ‘length’ while ‘L’ and ‘R’ are for ‘left’ and ‘right’)
The following lemma is well-known (e.g., [Reference Magnus, Karrass and Solitar45]), but we include a proof for the reader’s convenience.
Lemma 4.13. Suppose that
$G=H_0*H_1$
is a free product of nontrivial groups and
$a,b$
are in
$G\setminus \{e\}$
. Then we have the following.
-
(1) $\lambda (a)=\lambda (a^{-1})$
. -
(2) $|\lambda (a)-\lambda (b)|\leq \lambda (ab)\leq \lambda (a)+\lambda (b)$
. -
(3) $\lambda (a)>\lambda (b)$
implies
$L(ab)=L(a)$
and
$R(ba)=R(a)$
. -
(4) If $R(a)\neq L(b)$
then
$L(ab)=L(a)$
and
$R(ab)=R(b)$
. -
(5) If $|H_0|\geq 3$
then for every
$a\in G\setminus \{e\}$
there are b and c in
$a^G$
such that
$L(b)=R(b)=0$
and
$L(c)=R(c)=1$
.
Proof. The first four items are immediate consequences of the definition of the free product. To prove the fifth, fix a in
$G\setminus \{e\}$
. We will first find
$b\in a^G$
such that
$L(b)=R(b)=0$
. If
$L(a)=R(a)=0$
then let
$b=a$
, and if
$L(a)=R(a)=1$
then let
$b=xax^{-1}$
for some
$x\in H_0\setminus \{e\}$
. We may therefore assume
$a=yd$
or
$a=dy$
for some
$y\in H_0\setminus \{e\}$
and d such that
$L(d)=R(d)=1$
or
$d=e$
. Since
$|H_0|\geq 3$
, we can choose
$z \in H_0 \backslash \{e,y^{-1}\}$
. Then if
$a = yd$
, let
$b=zy dz^{-1}$
and if
$a = dy$
, let
$b=z^{-1} d y z$
. Then b is as required. We can now set
$c= xbx^{-1}$
for any
$x\in H_1\setminus \{e\}$
.
Proposition 4.14. The class of all groups that are free products of two nontrivial groups at least one of which has cardinality at least 3 recognizes coordinates.
Proof. By Theorem 4.3 (1) it suffices to prove that for every
$a\neq e$
,
$C_G(a^G)=\{e\}$
. This is equivalent to asserting that for all a and b in
$G\setminus \{e\}$
there are
$a'\in a^G$
and
$b'\in b^G$
such that
$a'b'\neq b'a'$
. Fix a and b in
$G\setminus \{e\}$
. By Lemma 4.13 (5) there are
$a'\in a^G$
with
$L(a')=R(a')=0$
and
$b'\in b^G$
with
$L(b')=R(b')=1$
. Then
$L(a'b')=L(a')=0$
and
$L(b'a')=L(b')=1$
; therefore
$a'b'\neq b'a'$
, as required.
Proposition 4.15. The group
$({\mathbb Z}/2{\mathbb Z})*({\mathbb Z}/2{\mathbb Z})$
recognizes coordinates.
Proof. By Proposition 4.5, with
$m=n=2$
, it suffices to prove that (i) for any two elements a and b of order 2 there is
$a'\in a^G$
such that
$a'b\neq ba'$
and (ii) every element of
$G\setminus \{e\}$
is a product of at most two elements of order 2.
Let
$G=({\mathbb Z}/2{\mathbb Z})*({\mathbb Z}/2{\mathbb Z})$
and let x and y denote the generators of the two copies of
${\mathbb Z}/2{\mathbb Z}$
. Then every nontrivial word in G is an alternating sequence of x’s and y’s. We need two straightforward properties of such words w. First, the inverse of w is obtained by taking w in the reverse order. Second, the first and the last symbols of w are equal (in the terminology of Lemma 4.13,
$L(w)=R(w)$
) if and only if its length is odd. These facts together imply that
$w^2=e$
if and only if its length is odd. Assume a and b are of odd length. If
$L(a)\neq R(b)$
then since
$R(a)=L(a)$
and
$R(b)=L(b)$
, we have
$ab\neq ba$
. Otherwise, we can take
$a'=xax $
or
$a'=yay$
to obtain
$a'\in a^G$
that does not commute with b.
Finally, every nontrivial word of even length is clearly a product of two nontrivial words, each one of which has odd length, and Proposition 4.5, with
$m=n=2$
, applies to show that G recognizes coordinates.
4.5 Graph products of groups
Assume
$\Gamma =(V(\Gamma ),E(\Gamma ))$
is a graph (we will write
$(V,E)$
when
$\Gamma $
is clear from the context) and
$\mathcal G=\{G_v\vert v\in V\}$
is a family of groups indexed by its vertices. Then the graph product [Reference Green31] is the group
$\Gamma \mathcal G$
defined as the quotient of the free product
$\ast _{v\in V} G_v$
modulo the normal subgroup generated by the commutators
Thus in the case when
$\Gamma $
is a complete graph,
$\Gamma \mathcal G$
is the direct product
$\prod _{v\in V} G_v$
while in the case when
$\Gamma $
is the null graph,
$\Gamma \mathcal G$
is the free product
$\ast _{v\in V} G_v$
. Two prominent cases of this construction are the right-angled Coxeter groups (when
$G_v\cong {\mathbb Z}/2{\mathbb Z}$
for all v) and the right-angled Artin groups (when
$G_v\cong {\mathbb Z}$
for all v). Although in some of the literature the graph
$\Gamma $
is required to be finite, we do not impose any restriction on the cardinality of
$\Gamma $
or groups
$G_v$
. We say that a graph product
$\Gamma \mathcal G$
is nontrivial if
$|V|\geq 2$
and
$|G_v|\geq 2$
for all
$v\in V$
. This is not a loss of generality since
$\Gamma \mathcal G$
is isomorphic to
$\Gamma '\mathcal G'$
where
$\Gamma '$
is the induced subgraph on
$V'=\{v\in V\mid |G_v|\geq 2\}$
and
$\mathcal G'=\{G_v\vert v\in V'\}$
.
A remarkable converse to the Feferman–Vaught theorem for graph products was proved in [Reference Casals-Ruiz, Kazachkov and de la Nuez7].
Theorems 4.16 and 4.17 below are stated more naturally in terms of the complement of
$\Gamma $
, denoted
$\bar \Gamma $
(to be specific, if
$\Gamma =(V,E)$
then
$\bar \Gamma =(V,\bar E)$
where
$\bar E$
is the complement of E). Since free products are a special case of graph products associated with the null graph, the following is a generalization of Proposition 4.14. Following [Reference Minasyan and Osin49], we say that a graph
$\Gamma $
is irreducible if its complement graph
$\bar \Gamma $
is connected.
We learned that Theorem 4.16 below follows easily from our results (taken together with some standard facts) from Montserrat Casals–Ruiz. This theorem confirms a conjecture stated in the original version of this paper, where a slightly weaker result, included below as Theorem 4.17 together with a self-contained proof, was proved.
Theorem 4.16. A nontrivial graph product
$\Gamma \mathcal G$
associated with a finite graph
$\Gamma $
with at least two vertices recognizes coordinates if and only if the complement
$\bar \Gamma $
of
$\Gamma $
is connected.
Proof. Suppose that
$G=\Gamma \mathcal G$
is a graph product of nontrivial groups with respect to some finite graph
$\Gamma $
with at least two vertices whose complement is connected. By [Reference Minasyan and Osin49, Corollary 2.13], G is either virtually cyclic or acylindrically hyperbolic (a group is virtually cyclic if it has a cyclic subgroup of finite index). We claim that the infinite dihedral group
$({\mathbb Z}/2{\mathbb Z})*({\mathbb Z}/2{\mathbb Z})$
is the only virtually cyclic graph product G such that
$\Gamma $
has at least two vertices and
$\bar \Gamma $
is connected. This is well-known to the experts, but as non-experts we feel compelled to sketch a proof. Assume that G is virtually cyclic. By [19, Theorem 12], G is virtually cyclic if and only if it has exactly two ends (the latter notion will be blackboxed in this proof, but the definition can be found in [19, p. 115]). Since every subgroup of a virtually cyclic group is virtually cyclic, we may assume that all
$G_v$
are finitely generated by replacing every
$G_v$
which is not finitely generated with a nontrivial finitely generated subgroup. Graph products of finitely generated groups with exactly two ends are classified in [Reference Varghese71, Proposition B]. By our assumption that
$\bar \Gamma $
is connected, (i) of this proposition does not apply. Also, the set of all vertices v that are adjacent to all
$w\neq v$
is empty; therefore (ii) of this proposition reduces to
$G\cong ({\mathbb Z}/2{\mathbb Z})*({\mathbb Z}/2{\mathbb Z})$
, as required. This group recognizes coordinates by Proposition 4.15.
We may therefore assume that G is acylindrically hyperbolic, and by Corollary 4.4 it remains to prove that it has no nontrivial finite normal subgroups. Assume otherwise and let F be a finite normal subgroup of G. Then F is conjugate to a subgroup of some vertex group
$G_v$
, because the normal form of elements of G implies that every element of finite order is conjugate to an element of some
$G_v$
. We may assume F is a subgroup of
$G_v$
. Let w be any vertex of
$\Gamma $
not adjacent to v. Then the group
$G_v*G_w$
is a homomorphic image of G, and F is a normal subgroup of it. Since
$G_w$
is nontrivial, this is absurd, and the proof is complete.
The first part of Theorem 4.17 below is a slight weakening of Theorem 4.16 that was present in the original version of our paper. Although it takes up this entire subsection, our original, self-contained proof of this theorem is included because we believe it is of independent interest, and also because it applies to infinite graphs. We conjecture that the conclusion of Theorem 4.16 also holds without the restriction that the graph
$\Gamma $
be finite.
Theorem 4.17. A nontrivial graph product
$\Gamma \mathcal G$
such that
$|G_{\tilde v}|\geq 3$
for some
$\tilde v\in V$
recognizes coordinates if and only if the complement
$\bar \Gamma $
of
$\Gamma $
is connected. Moreover, the class
$\mathcal C$
of all nontrivial graph products
$\Gamma \mathcal G$
such that
$\bar {\Gamma }$
is connected and
$|G_v|\geq 3$
for some
$v\in V(\Gamma )$
recognizes coordinates.
The easy direction of this theorem is Lemma 4.18.
The assertion that
$|G_v|\geq 3$
for some v is equivalent to the assertion that
$\Gamma \mathcal G$
is not a right-angled Coxeter group.
Lemma 4.18. If
$\bar \Gamma $
is not connected then
$\Gamma \mathcal G$
is decomposable.
Proof. Let
$V(\Gamma )=X\sqcup Y$
be a partition into nonempty sets such that no vertex in X is
$\bar \Gamma $
-adjacent to a vertex in Y. In other words, the complete bipartite graph with bipartition
$X,Y$
is a subgraph of
$\Gamma $
. Let
$\Gamma _X$
and
$\Gamma _Y$
be the induced subgraphs of
$\Gamma $
on X and Y. Then, with
$\mathcal G_X=\{G_v\vert v\in X\}$
and
$\mathcal G_Y=\{G_v\vert v\in Y\}$
the definition of
$\Gamma \mathcal G$
implies that
$\Gamma \mathcal G\cong \Gamma _X \mathcal G_X\times \Gamma _Y\mathcal G_Y$
. Since each
$G_v$
is nontrivial,
$\Gamma \mathcal G$
is decomposable as a product of nontrivial groups.
Our positive result will require considerably more work and references to the literature. The normal form for words in graph products appears in [Reference Green31, Theorem 3.9, also see Definition 3.5] and [Reference Hsu and Wise34, §4] for a shorter proof. It asserts that for every
$g\in \Gamma \mathcal G\setminus \{e\}$
there are
$n\geq 1$
,
$v(i)\in V$
,
$g(i)\in G_{v(i)}\setminus \{e\}$
, for
$1\leq i\leq n$
such that
$g=g_1\cdot \ldots \cdot g_n$
, and for all
$1\leq i\leq k<j\leq n$
such that
$[g_i,g_l]=e=[g_m,g_j]$
for all
$i+1\leq l \leq k$
and all
$k+1\leq m \leq j$
, we have
$v(i)\neq v(j)$
. A moment taken to parse the latter condition on commutators reveals that it implies
$g=g_1\cdot \cdots \cdot g_{i-1} g_{i+1}\cdot \cdots \cdot g_k g_i g_j g_{k+1}\cdot \cdots \cdot g_{j-1} g_{j+1}\cdot \cdots \cdot g_n$
, in which case
$v(i)=v(j)$
would imply that
$g_i g_j\in G_{v(i)}$
and that g could be presented as a word of length
$n-1$
. The elements
$g_i$
in a normal form of g are called syllables of g. Note that the normal form of g is not unique, since if
$\{v(i),v(i+1)\}\in E$
then
$g_i$
and
$g_{i+1}$
can be swapped without changing the value of g. However, the set of syllables of g is uniquely determined.
Following [Reference Genevois and Martin28], for
$g\in \Gamma \mathcal G$
, the head of g, denoted
$ {\mathrm {head}}(g)$
, is the set of all first syllables appearing in the reduced words representing g. The tail of g, denoted
$ {\mathrm {tail}}(g)$
, is the set of all last syllables appearing in the reduced words representing g. Clearly these sets depend on g and not on the normal form used to represent it. For
$g\in \Gamma \mathcal G$
with the normal form
$g=g_1\cdot \ldots \cdot g_n$
we write
(A reasonable notation for
$V(g)$
would be
$ {\mathrm {supp}}(g)$
, but in other sections of the present paper
$ {\mathrm {supp}}$
has a different meaning.)
Lemma 4.19 below collects straightforward facts that will be used in the proofs of lemmas leading towards the nontrivial part of Theorem 4.17.
Lemma 4.19. Suppose that
$\Gamma \mathcal G$
is a nontrivial graph product and let
$g=g_1\cdot \cdots \cdot g_m$
and
$h=h_1\cdot \cdots \cdot h_n$
be elements of
$\Gamma \mathcal G\setminus \{e\}$
in normal form.
-
(1) If $g_i\in G_{v(i)}\setminus \{e\}$
for
$1\leq i\leq n$
, then
$v\in L(g)$
if and only if there is i such that
$v=v(i)$
and all
$1\leq j<i$
satisfy
$\{v(j),v(i)\}\in E$
. -
(2) If $V(g)\cap V(h)=\emptyset $
then
$ {\mathrm {head}}(g)\subseteq {\mathrm {head}}(gh)\subseteq {\mathrm {head}}(g)\cup {\mathrm {head}}(h)$
. -
(3) If $V(g)\cap V(h)=\emptyset $
and for every
$v\in L(h)$
there is
$w\in V(g)$
such that
$\{v,w\}\notin E$
then
$L(g)=L(gh)$
.
Since
$ {\mathrm {tail}}(g)= {\mathrm {head}}(g^{-1})$
, assertions analogous to the above hold for
$ {\mathrm {tail}}(g)$
and
$ {\mathrm {tail}}(h)$
.
Lemma 4.20. In a nontrivial graph product
$\Gamma \mathcal G$
such that
$\bar \Gamma $
is connected and
$|G_{\tilde v}|\geq 3$
for some
$\tilde v\in V$
, the following holds. For every
$v\in V$
, every
$g\in \Gamma \mathcal G\setminus \{e\}$
is conjugate to some
$\tilde g$
such that
$L(\tilde g)=R(\tilde g)=\{v\}$
.
Proof. Fix
$g\in \Gamma \mathcal G\setminus \{e\}$
and let
$L(g)=\{v(1), \dots , v(m)\}$
. Since the syllables in
$ {\mathrm {head}}(g)$
commute,
$\{v(i),v(j)\}$
is not an edge of
$\bar \Gamma $
for all
$i,j\leq m$
. Since
$\bar \Gamma $
is connected, there is
$v(*)\in V\setminus L(g)$
. Choose a spanning tree T for
$\bar \Gamma $
. (That is, T is an acyclic connected subgraph of
$\bar \Gamma $
with the same vertex set.) By connectivity of the complement, for every
$i\leq~m$
there is a unique path
$P(i)$
in T connecting
$v(*)$
and
$v(i)$
. Consider
$T(0)=\bigcup _{i\leq m} P(i)$
as a subgraph of T and let d denote the graph distance on
$T(0)$
. Let
$\sqsubseteq $
be a linear ordering of the vertices of
$T(0)$
such that
$x\sqsubseteq y$
implies
$d(v(*),x)\leq d(v(*),y)$
, and let
$x(1), \dots , x(k)$
be the
$\sqsubseteq $
-increasing list of all vertices of
$T(0)$
. Then
$x(1)=v(*)$
. For each
$1\leq j\leq k$
pick
$h_j\in G_{x(j)}\setminus \{e\}$
.
Let
$a=h_1 h_2\dots h_k$
. If
$v(*)=\tilde v$
let
$g'=a g a^{-1}$
. If
$v(*)\neq \tilde v$
, then let
$x(1),\dots , x(p)$
be a
$\bar {\Gamma }$
-path from
$\tilde v$
to
$v(*)$
. Choose
$h^{\prime }_i\in G_{x(i)}$
for
$1\leq i< p$
and let
$b=h^{\prime }_1 h^{\prime }_2\cdot \ldots \cdot h^{\prime }_{p-1} $
. Then Lemma 4.19 (1) implies
$L(ba)=\{\tilde v\}$
. With
$g'=b a g a^{-1} b^{-1}$
, Lemma 4.19 (3) implies
$L(g')=\{\tilde v\}$
.
At this point in the construction, we do not know what the relation of
$\tilde v$
to the vertices in
$R(g')$
is, but we would like to be able to assume that
$\tilde v\in R(g')$
. Assume this is not the case. Since
$\tilde v\in L(g')$
and
$|G_{\tilde v}|\geq 3$
, if
$a\in {\mathrm {head}}(g')\cap G_{\tilde v}$
then we can choose
$c\in G_{\tilde v}\setminus \{e,a^{-1}\}$
. In this case, we have
$L(cg')=L(g')$
and
$g"=cg'c^{-1}$
satisfies
$L(g")=\{\tilde v\}$
and
$\tilde v\in R(g")$
.
Let
$R(g')=\{w(1),\dots , w(n)\}$
(with
$w(1)=\tilde v$
). In the next portion of the proof, we look for a conjugate
$\tilde {g}$
of
$g'$
such that
$R(\tilde {g})=L(\tilde {g})=\{\tilde v\} $
. This is analogous to the previous part of the proof, where we obtained
$g'$
. Since
$\{w(i),w(j)\}$
is not an edge of
$\bar \Gamma $
for all
$i,j\leq n$
and
$\bar \Gamma $
is connected, there is
$w(*)\in V\setminus R(g')$
. Find a tree
$U(0)$
with root
$w(*)$
and leaves
$\{w(1),\dots , w(n)\}$
, let
$d(\cdot ,\cdot )$
denote the graph distance in
$U(0)$
, fix a linear ordering of its vertices such that
$x\sqsubseteq ' y$
implies
$d(w(*),x)\leq d(w(*),y)$
, and let
$y(1), \dots , y(k')$
be the
$\sqsubseteq '$
-increasing list of all vertices of
$U(0)$
. For each
$1\leq j<k'$
pick
$h^{\prime }_j\in G_{y(j)}\setminus \{e\}$
. Let
$a'=h_{k'-1}\cdot \ldots \cdot h^{\prime }_1$
. Then, using Lemma 4.19 as before,
$g"'=(a')^{-1} g" a'$
satisfies
$R(g"')=L(g"')=\{w(*)\}$
.
It remains to show that we can assure that
$w(*)$
is equal to the distinguished vertex v fixed in the statement of this lemma. If
$w(*)\neq v$
, choose a path in
$\bar \Gamma $
from
$w(*)$
to v,
$w(*)=x(0),x(1), \dots , x(m)=v$
, fix
$f_i\in G_{x(i)}\setminus \{e\}$
, let
$d= f_m \cdot f_{m-1}\cdot \ldots \cdot f_1$
and let
$\tilde g=d g"' d^{-1}$
. Once again, Lemma 4.19 implies that
$L(\tilde g)=R(\tilde g)=\{v\}$
.
The reader may be under the impression that the fact that every
$g\in \Gamma \mathcal G$
is conjugate to a word
$g'$
such that
$L(g')\cap R(g')=\emptyset $
(this is [Reference Green31, Lemma 3.16], where such words
$g'$
are called cyclically reduced) may be used to remove the assumption that
$|G_{\tilde v}|\geq 3$
in Lemma 4.20 and Theorem 4.17. The proof that
$({\mathbb Z}/2{\mathbb Z})*({\mathbb Z}/2{\mathbb Z})$
recognizes coordinates (Proposition 4.15) is very different from the above proof, suggesting that a common generalization requires additional nontrivial ideas. In particular, using the notation from Proposition 4.15, one should note that the element
$ab$
of
$({\mathbb Z}/2{\mathbb Z})*({\mathbb Z}/2{\mathbb Z})$
(and any other reduced word of even length in this group) does not satisfy the conclusion of Lemma 4.20.
Lemma 4.21. If
$\mathcal C$
is the class of all nontrivial graph products
$\Gamma \mathcal G$
such that
$\bar \Gamma $
is connected and
$|G_{\tilde v}|\geq 3$
for some
$\tilde v\in V$
, then
$\mathcal C$
recognizes coordinates.
Proof. By Theorem 4.3 (1), it suffices to show that for every
$\Gamma \mathcal G\in \mathcal C$
, for all a and b in
$\Gamma \mathcal G\setminus \{e\}$
, some
$\tilde a$
conjugate to a does not commute with some
$\tilde b$
conjugate to b. Since
$\bar \Gamma $
is connected and it has at least two vertices, we can fix vertices v and w adjacent in
$\bar \Gamma $
. By Lemma 4.20, there are
$\tilde a$
and
$\tilde b$
conjugate to a and b, respectively, such that
$L(\tilde a)=R(\tilde a)=\{v\}$
and
$L(\tilde b)=R(\tilde b)=\{w\}$
. Since
$\{v,w\}$
is not an edge in
$\Gamma $
,
$L(ab)=L(a)\neq L(b)=L(ba)$
, hence
$ab\neq ba$
.
4.6 Symmetric groups
For an integer
$n\geq 2$
, by
$\mathfrak S_n$
we denote the symmetric group on n elements. By
$\mathfrak S$
, we denote an arbitrary finite symmetric group. As mentioned in the proof of Theorem 4.6 (b), the class of finite symmetric groups containing four or more elements recognizes coordinates. In this section, we slightly modify this argument to be able to include the symmetric group on
$3$
elements. Then, we pursue the model-theoretic motivation described in the introduction and prove a quantifier elimination result. Here, we will, however, have to exclude
$\mathfrak S_6$
, because of the existence of a nontrivial outer automorphism.
Lemma 4.22.
-
(1) There is an h-formula $\psi (x)$
which uniformly defines the set
$C_2\cup \{e\}$
, where
$C_2$
is the set of transpositions, in all symmetric groups of the form
$\mathfrak S_n$
for
$n \neq 2$
and
$n \neq 6$
. -
(2) For every $k\geq 3$
, there is a formula
$\varphi _k(x)$
which uniformly defines the set
$C_k$
of k-cycles in all symmetric groups
$\mathfrak S_n$
with
$n \neq 6$
.
Proof. (1) We claim that the following h-formula defines, uniformly in
$\mathfrak S_{n}$
for all
$n>2$
and
$n\neq 6$
, the set
$C_2 \cup \{e\}$
:
We remark that the last conjunct is required only in
$\mathfrak S_4$
.
Since the conjugate of a 2-cycle is a 2-cycle and the product of two distinct 2-cycles is either a 3-cycle or a 2-2-cycle, every 2-cycle satisfies each of the above conjuncts.
We now prove the converse. Every element of order 2 is a product of transpositions with disjoint supports (for convenience we will call such permutations
$2$
-
$2\text{-}\cdots$
-
$2$
-cycles).
The case of
$n = 3$
is trivial. Suppose that
$\sigma $
is an element of order 2 in
$\mathfrak S_n$
for
$n\geq 4$
and
$n\neq 6$
that is not in
$C_2$
.
If
$n=4$
then
$\sigma $
is a
$2$
-
$2$
-cycle. Any two
$2$
-
$2$
-cycles are conjugate, and, in
$\mathfrak S_4$
, the product of two distinct
$2$
-
$2$
-cycles is a
$2$
-
$2$
-cycle (e.g.,
$(12)(34) \circ (14)(23)=(13)(24)$
). Thus in this case
$\sigma $
does not satisfy the last conjunct of the formula.
Now consider the case when
$\sigma $
has a fixed point. Let
$\sigma $
be the product of
$k\geq 2$
disjoint transpositions,
$\sigma =\prod _{j=1}^k (m_{2j-1},m_{2j})$
and let
$m_{2k+1}$
be a fixed point of
$\sigma $
. Then
$\sigma ':=\prod _{j=1}^k (m_{2j},m_{2j+1})$
is conjugate to
$\sigma $
, and
$\sigma '\circ \sigma $
is the
$2k+1$
-cycle is the
$2k+1$
cycle
$(m_1 m_3\dots m_{2k+1} m_{2k} m_{2k-2}\dots m_2)$
. Since
$2k+1\geq 5$
, we have that
$\sigma $
does not satisfy the middle conjunct of the formula.
This proves the claim in the case when n is odd, and when
$k \leq 3$
, and
$n \geq 8$
. We may therefore assume
$k\geq 4$
; let us assume
$k=4$
and
$n=8$
for a moment. In the following special case, we obtain a conjugate
$\sigma '$
of
$\sigma $
such that
$\sigma \circ \sigma '$
has order 4 and therefore fails the middle conjunct of the formula:
In general, if
$k\geq 4$
, then by restricting
$\sigma $
to an 8-element
$\sigma $
-invariant subset of its support we can find
$\sigma '$
such that
$\sigma \circ \sigma '$
has order 4. This concludes the proof of (1). Prior to embarking on the proof of (2), we note that in
$\mathfrak S_n$
for all
$n\geq 3$
,
$n\neq 6$
, the set of transpositions
$C_2$
is given by the formula
This is, however, not an h-formula.
(2) We need a formula that defines
$C_2$
in
$\mathfrak S_n$
for all
$n\neq 6$
. To include the case
$n= 2$
, we can consider the formula:
The set
$C_k$
of k-cycles can now be defined as the set of products of
$(k-1)$
pairwise distinct
$2$
-cycles
$c_1,\dots , c_{k-1}$
such that
$c_ic_j \neq c_jc_i$
if and only if
$\vert i-j\vert =1$
for
$i,j<k$
.
Since there is an automorphism of
$\mathfrak S_6$
sending
$2$
-cycles to
$2$
-
$2$
-
$2$
-cycles, there is no parameter-free definition of the set of
$2$
-cycles in
$\mathfrak S_6$
, and Lemma 4.22 cannot be improved by including
$\mathfrak S_6$
in the set of groups to which it applies.
Even though we cannot separate
$2$
-cycles from
$2$
-
$2$
-
$2$
-cycles in
$\mathfrak S_{6}$
, we can still prove the following:
Corollary 4.23. The class of symmetric groups
$\mathfrak S_n$
,
$n\geq 3$
, recognizes coordinates.
Proof. Let
$\mathfrak S$
denote an arbitrary
$\mathfrak S_n$
for
$n\geq 3$
and
$n\neq 6$
. Let
$\psi (x)$
be the h-formula defining
$\mathcal {C}_2\cup \{e\}$
as in the proof of Lemma 4.22(1). For
$x,y\in \mathfrak S$
, let
$xRy$
denote the relation ‘x commutes with all conjugates of y’ used in the proof of Theorem 4.3 (1). Then
$xRy$
is an h-formula and for all
$x,x' \in \mathfrak S$
, we have
The right-hand side formula is an h-formula, as it is equivalent to
Notice furthermore that the same equivalence holds in
$\mathfrak S_6$
. Indeed, the formula
$\psi (y)$
defines there the set containing
$C_2\cup \{e\}$
and the
$2$
-
$2$
-
$2$
-cycles, and the centralizer of the conjugacy class of a
$2$
-
$2$
-
$2$
-cycle is also
$\{e\}$
.
The conclusion follows by Theorem 4.1.
Since
$\mathfrak S_2$
is abelian, any class containing it cannot recognize coordinates by Theorem 4(b); this was originally observed in [Reference Farah, Ghasemi, Vaccaro and Vignati25, Example 2.6].
Lemma 4.24. In the common theory of
$\mathfrak S_n$
, for all
$n\geq 3$
, the formula
$x\neq e$
is equivalent to an h-formula.
Proof. Since both the formulas
$\psi (\tau )$
(asserting that
$\tau \in C_2\cup \{e\}$
if
$n\neq 6$
) and
$xRy$
used in the proof of Corollary 4.23 are equivalent to h-formulas and since
$eRx$
holds for all x, the right-hand side of
is an explicit h-formula. We remark that this lemma also follows from Proposition 2.11.
4.7 Quantifier elimination in products of a symmetric group
We proceed as discussed in Section 2.5 to define a language interpretable in
$\mathcal {L}_{\textrm {groups}}$
in which reduced products of
$\mathfrak S_n$
for a fixed
$n \geq 4, n\neq 6$
eliminate quantifiers. The following definition and fact are heavily inspired by a post on Math Stack Exchange [Reference Kruckman40], from which we borrow the terminology and some of the proofs, which are included for the reader’s convenience.
Definition 4.25. A pair of distinct transpositions in some symmetric group which have at least one common element k is said to identify k, or to be identifying. The set of all identifying pairs is denoted by P. On P consider the equivalence relation E given by
Let
$\mathcal {L}_X$
denote the group language expanded by a sort for the base set
$\{1,\dots , n\}$
and the natural projection
$\pi _X: P \rightarrow X$
.
Clearly, E is an equivalence relation on the set P and every
$\mathfrak S_n$
has a natural expansion to an
${\mathcal L}_X$
-structure. Also, in
$\mathfrak S_n$
the quotient
$X:=P/E$
is naturally identified with the base set
$\{1,\dots ,n\}$
. It will be convenient to write
$\mathfrak S_X$
for the symmetric group on the base set X.
Fact 4.26. The following facts hold (uniformly) in the theory of all
$\mathfrak S_n$
, for
$n\geq 4$
and
$n\neq 6$
.
-
(1) The set P of identifying pairs is (uniformly) h-definable; namely, there exists an h-formula defining P in all $\mathfrak S_n$
, for
$n \geq 4$
and
$n \neq 6$
. -
(2) The relation E on P is (uniformly) h-definable.
-
(3) For k and h in the base set X and $\nu \in \mathfrak S_X$
, the relation $$\begin{align*}\nu=\begin{cases} \!\!(kh) & { if }~k\neq h\\ e & { otherwise} \end{cases}\end{align*}$$
is defined by an h-formula $\psi (\nu ,k,h)$
in the language
$\mathcal {L}_X$
. -
(4) For $s\geq 2$
and distinct
$k_1, \dots , k_s$
in X and
$x\in \mathfrak S_X$
, the relation: $$\begin{align*}x= \begin{pmatrix} 1 & \dots & s \\ k_1 & \dots & k_s \end{pmatrix}, \end{align*}$$
is defined by an h-formula in the language $\mathcal {L}_X$
. -
(5) For every $n\geq 4$
,
$n\neq 6$
,
$k\geq 1$
and a k-tuple
$(\sigma _1,\dots ,\sigma _k)$
of elements of
$\mathfrak S_n$
, the type
$p= {\mathrm {tp}}(\sigma _1,\dots ,\sigma _k/\emptyset )$
is isolated by an h-formula
$\varphi _p(x_1,\dots ,x_k)$
.
We briefly justify these facts:
Proof. (1) As two distinct transpositions move a common element if and only if their product has order
$3$
, we may use the following formula:
This is equivalent to an h-formula by Lemma 4.24.
(2) We will prove that the relation E is defined by the following formula:
Indeed, if both
$(\sigma ,\tau )$
and
$(\sigma ',\tau ')$
identify an element k, then any transposition
$\nu $
disjoint from
$\sigma $
or
$\tau $
does not move k. Then, as
$\tau '$
and
$\sigma '$
move k, so do
$\nu \tau '\nu $
and
$\nu \sigma '\nu $
. Therefore each one of
$\tau \nu \tau '\nu ,\tau \nu \sigma '\nu ,\sigma \nu \tau '\nu $
and
$\sigma \nu \sigma '\nu $
has order
$1$
or
$3$
, and formula (4.1) holds.
Conversely, assume that
$(\sigma ,\tau )$
identifies k and
$(\sigma ',\tau ')$
identifies some
$k'\neq k$
. We prove that (4.1) does not hold by considering cases.
-
• If at least one of the pairs of transpositions among $(\sigma ,\sigma '),(\sigma ,\tau '),(\tau ,\sigma ')$
and
$(\tau ,\tau ')$
is disjoint, then the formula (4.1) above fails by taking
$\nu =e$
. -
• Now assume that none of these pairs are disjoint. Since $k\neq k'$
, there is
$k"$
such that
$\tau ,\sigma ,\tau '$
and
$\sigma '$
are transpositions of
$k,k'$
and
$k"$
. By swapping
$\sigma $
with
$\tau $
and
$\sigma '$
with
$\tau '$
if needed, we may assume that
$\sigma =(kk'),\tau =(kk"),\sigma '=(k'k)$
and
$\tau '=(k'k")$
. As the base set has at least four elements, we may take
$l\notin \{k,k',k"\}$
and let
$\nu :=(lk")$
. Then
$\tau \nu \tau ' \nu =(kk")(k'l)$
has order
$2$
and (4.1) fails.
As
$\sigma \neq \nu $
is equivalent to an h-formula by Lemma 4.24, one sees that (4.1) is also equivalent to an h-formula.
(3) Let
$\psi (\nu ,k,h)$
be the following formula (using the h-formulas for P and E provided above):
In words, if
$\psi (\nu ,k,h)$
holds, then for all
$\sigma ,\tau \in C_2$
, if
$(\sigma ,\tau )$
identifies k, then
$(\nu \sigma \nu ,\nu \tau \nu )$
identifies h. Clearly, if
$k,h$
are distinct elements of X, then
$\nu =(kh)$
, and if
$k=h$
, then
$\nu =e$
as required.
(4) The permutation
$\rho :=\begin {pmatrix} 1 & \cdots & s \\ k_1 & \cdots & k_s \end {pmatrix}$
can be written as a product of transpositions. Therefore, this relation is expressible as a conjunction of h-formulas of the form
$\psi (\nu ,k,h)$
as in (3).
(5) For
$i\leq k$
, consider the following permutation
Then, the type p is isolated by the following
$\mathcal {L}_X$
-formula:
We claim that the formula above is equivalent to an h-formula in the language of groups. We use the following facts:
-
• Every existential quantifier over X can be replaced by an existential quantifier over the group:
$$\begin{align*}(\exists k\in X) ~ \varphi(X) \Leftrightarrow \exists \sigma_k,\tau_k ~ (\sigma_k,\tau_k)\in P \wedge \varphi(\pi_X(\sigma_k,\tau_k))\end{align*}$$
-
• We have the equivalence
$$\begin{align*}\psi( \nu , \pi_X((\sigma_k,\tau_k)), \pi_X((\sigma_h,\tau_h)) ) \Leftrightarrow \nu \in C_2\cup\{e\} \wedge (\nu\sigma_k\nu,\nu\sigma_h\nu)E(\sigma_h,\tau_h). \end{align*}$$
-
• For pairs $(\sigma _h,\tau _h)$
and
$(\sigma _k,\tau _k)$
in P, the relation
$\pi _X((\sigma _k,\tau _k)) \neq \pi _X((\sigma _h,\tau _h)) $
can be expressed in the language of groups as follows: $$\begin{align*}(\forall \nu)~ [(\nu\sigma_k\nu,\nu\sigma_h\nu)E(\sigma_h,\tau_h)\rightarrow \nu\neq e]. \end{align*}$$
Using these facts, as well as the facts that the set P and the relations E and
$x\neq e$
are h-definable, we can deduce that (Ip
) can be expressed by an h-formula
$\varphi _p$
in the language of groups.
With
$\varphi _p$
as provided by Fact 4.26 (5), we obtain the following amusing corollary which is certainly folklore but we could not find it in the literature.
Corollary 4.27. Let
$n> 6$
. The parameter-free type of a permutation
$a\in \mathfrak S_n$
is uniformly isolated by the h-formula
$\varphi _p$
in the theory of all
$\mathfrak S_N$
for
$N\geq n$
.
We may finally give, for all
$n\geq 4$
and
$n\neq 6$
, an interpretable language where a reduced power of the symmetric group
$\mathfrak S_n$
eliminates quantifiers. We denote by
$\mathcal {L}_{n}^+$
the
$2$
-sorted language consisting of the following:
-
• The language of groups, $(G, \cdot )$
. -
• The language of Boolean algebras $(\mathcal {P}(\mathbb {I})/\mathcal {I} , \subseteq )$
. -
• $\{ {\mathrm {supp}}_{\varphi _{p}}: G^{\vert k \vert } \rightarrow \mathcal {P}(\mathbb {I})/\mathcal {I} : p(x_1,\dots ,x_k)$
is an
$\mathfrak S_{n}$
-type
$\}$
, where
$\varphi _{p}(x_1,\dots , x_k)$
is as in Fact 4.26 (5).
Corollary 4.28. Fix an
$n\geq 4$
,
$n \neq 6$
, an index set
$\mathbb {I}$
and an ideal
$\mathcal {I}$
on
$\mathbb {I}$
. Let
$G:=\prod _{\mathcal {I}}G_i$
with
$G_i= \mathfrak S_n$
for every
$i\in \mathbb {I}$
. Then
$(G,\mathcal {L}_{n}^+)$
is an interpretable expansion of the group
$(G,\cdot )$
, which eliminates quantifiers relative to
$(\mathcal {P}(\mathbb {I})/\mathcal {I} , \subseteq )$
.
Proof. In
$\mathfrak S_n$
, every formula
$\varphi (\bar {x})$
is equivalent to a Boolean combination of h-formulas of the form
$\varphi _{p}(\bar {x})$
for some types p, i.e.,
$\{\varphi _{p}(\bar {x}) \ : \ p\in \mathcal {S}(\mathfrak S_{n})\}$
is a fundamental set of satisfiable h-formulas in
$\mathfrak S_n$
. Since G recognizes coordinates, it interprets the support function by Theorem 4.1. It follows from Theorem 6 that the language
$\mathcal {L}_{n}^+$
is interpretable in the language of groups and that G eliminates quantifiers relative to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in this language.
-
• One could slightly improve the above corollary and, for a fixed N, eliminate quantifiers in a reduced product $G := \prod _{\mathcal {I}} G_i$
, where
$G_i \in \{\mathfrak S_4,\mathfrak S_5,\mathfrak S_7,\mathfrak S_8,\dots , \mathfrak S_N\}$
. -
• We do not know a language where arbitrary reduced products of symmetric groups among $\mathfrak S_n$
, for
$n\geq 4$
,
$n\neq 6$
, eliminate quantifiers relative to the corresponding Boolean algebra. This would require a uniform description of definable sets in all symmetric groups, which our analysis does not provide. For example, we do not know whether the formula
$x^2=e$
can be described uniformly as a Boolean combination of
$\varphi _p$
.
We proceed to analyse quantifier elimination in reduced powers of
$\mathfrak S_3$
. For
$p\in \{2,3\}$
, let
$ {\mathrm {supp}}_p$
denote the function
$ {\mathrm {supp}}_{x^p=e}: \mathcal {G}\rightarrow \mathcal {P}(\mathbb {I})/\mathcal {I} $
. Consider the language
$\mathcal {L}^{\star } := \{\cdot , (\mathcal {P}(\mathbb {I})/\mathcal {I} ,\subseteq ), {\mathrm {supp}}_{2}, {\mathrm {supp}}_{3} \}$
.
Proposition 4.30. We use a back-and-forth argument with patching. Let
$\mathbb {I}$
be an index set and
$\mathcal {I}$
an ideal on
$\mathbb {I}$
. Let
$G:=\prod _{\mathcal {I}}\mathfrak S_3$
. Then
$(G,\mathcal {L}^{\star })$
is an interpretable expansion of the group
$(G,\cdot )$
, which eliminates quantifiers relative to
$(\mathcal {P}(\mathbb {I})/\mathcal {I} , \subseteq )$
.
The proof will be given below. Observe that, since every nontrivial element of
$\mathfrak S_3$
is either a
$2$
- or a
$3$
-cycle, we have
$ {\mathrm {supp}}(x)= {\mathrm {supp}}_2(x)\sqcup {\mathrm {supp}}_3(x)$
.
Lemma 4.31 (Patching).
The following can be expressed by a first-order sentence in the
$\mathcal {L}^{\star }$
-theory of
$\mathcal {G}$
: for all
$A,B \in \mathcal {P}(\mathbb {I})/\mathcal {I} $
such that
$A\cap B = \emptyset $
and
$a,b \in G$
, there exists c such that
$c\restriction {A}=a\restriction {A}$
and
$c\restriction {B}=b\restriction {B}$
.
Proof. This condition can be written as follows:
Proof of Proposition 4.30.
We prove the statement via the standard semantic quantifier elimination argument (see, e.g., [Reference Chatzidakis10, Paragraph 2.27]). For convenience, we denote by
$\mathcal {P}$
the sort
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
. To prove quantifier elimination relative to
$\mathcal {P}$
, consider:
-
• $\mathcal {M}=(\mathcal {G}_{\mathcal {M}},\mathcal {P}_{\mathcal {M}})$
and
$\mathcal {N}=(\mathcal {G}_{\mathcal {N}},\mathcal {P}_{\mathcal {N}})$
, two models of
$ {\mathrm {Th}}(\mathcal {G})$
, such that
$\mathcal {N}$
is
$\aleph _0$
-saturated, -
• two finitely generated (and therefore finite) substructures $\mathcal {A}=(\mathcal {G}_A,\mathcal {P}_A) \subseteq \mathcal {M}$
and
$\mathcal {B}=(\mathcal {G}_B,\mathcal {P}_B) \subseteq \mathcal {N}$
, -
• a partial isomorphism
$$\begin{align*}f=(f_{\mathcal{G}},f_{\mathcal{P}}):\mathcal{A}\rightarrow \mathcal{B}, \end{align*}$$
such that $f_{\mathcal {P}}$
is elementary.
We need to show that, for all
$a\in \mathcal {M}$
, we can extend f to a partial isomorphism
$\tilde {f}=(\tilde {f}_{\mathcal {G}},\tilde {f}_{\mathcal {P}})$
with
$\tilde {f}_{\mathcal {P}}$
elementary, and with domain containing a.
We can extend
$f_{\mathcal {P}}$
to a full embedding
$g: \mathcal {P}_{\mathcal {M}} \rightarrow \mathcal {P}_{\mathcal {N}}$
. Notice that the sort
$\mathcal {P}$
is closed: there are no function symbols in the language from
$\mathcal {P}$
to
$\mathcal {M}$
. It follows therefore automatically that
$f \cup g: (\mathcal {G}_A,\mathcal {P}_{\mathcal {M}}) \rightarrow (\mathcal {G}_B,\mathcal {P}_{\mathcal {N}})$
is a partial isomorphism.
Consider
$a\in \mathcal {G}_{\mathcal {M}} \setminus \mathcal {G}_A$
. We will give a concrete partition
$I_1\sqcup \cdots \sqcup I_7$
of the top element of
$\mathcal {P}_{\mathcal {M}}$
,
$I_i\in \mathcal {P}_{\mathcal {M}}$
. For
$i\leq 7$
, we will denote by
$a_i$
the element of
$\mathcal {G}_{\mathcal {M}}$
such that:
-
• $ {\mathrm {supp}}(a_i) \subseteq I_i$
, -
• $ {\mathrm {supp}}(a^{-1}\cdot a_i) \subseteq I_i^\complement $
.
(We can identify
$a_i$
with
$a\restriction I_i$
.) Then, for each
$i\leq 7$
, we will find a correct answer
${b}_i$
for
$a_i$
: for all formulas
$\varphi (x,a',I) \in {\mathrm {qftp}}(a_i/\mathcal {A})$
, we have
$\mathcal {N}\models \varphi ({b}_i,f(a'),g(I)) $
. Then we can conclude by patching that there is a good answer b for a, i.e., such that
$f( {\mathrm {qftp}}(a/\mathcal {A})) = {\mathrm {qftp}}(b/\mathcal {B})$
.
Case 1: Consider
$I_1= {\mathrm {supp}}(\mathcal {G}_A)^\complement \cap {\mathrm {supp}}_2(a)$
where
$ {\mathrm {supp}}(\mathcal {G}_A) = \bigcup _{a'\in \mathcal {G}_A} {\mathrm {supp}}(a')$
. Set
$f({a}_1)$
to be any
$2$
-torsion element
$b_1$
of
$\mathcal {N}$
such that
$ {\mathrm {supp}}(b) = g(I_1)$
.
Case 2: Consider
$I_2= {\mathrm {supp}}(\mathcal {G}_A)^\complement \cap {\mathrm {supp}}_3(a)$
. Set
$f({a}_2)$
to be any
$3$
-torsion element
$b_2$
of
$\mathcal {N}$
such that
$ {\mathrm {supp}}(b_2)=g(I_2)$
.
Case 3: For
$a'\in \mathcal {G}_A$
,
$I_{3,a'}= {\mathrm {supp}}(a'a^{-1})^c$
. This is the part of
$\mathcal {P}_{\mathcal {M}}$
where
$a'$
and a coincide. Set
${b}_{3,a'}$
of support
$g(I_{3,a'})$
such that
$ {\mathrm {supp}}(f(a')^{-1}\cdot {b}_{3,a'}) \subseteq g(I_{3,a'})^\complement $
( i.e.,
${b}_{3,a'}$
can be identified with
${f(a')}\restriction {g(I_{3,a'})}$
). Set
$I_3= \bigcup _{a'\in \mathcal {G}_A} I_{3,a'}$
. By saturation, compactness and the patching property, we find
${b}_3$
in
$\mathcal {N}$
such that for all
$a'\in \mathcal {G}_A$
,
${b}_3\restriction g(I_{3,a'})={a'}\restriction {g(I_{3,a'})}$
.
Case 4: Let
$a' \in \mathcal {G}_A$
. Set
$I_{4,a'}= {\mathrm {supp}}_3(a) \cap I_3^\complement \cap {\mathrm {supp}}_3(a')$
. This is a part of
$\mathcal {P}$
where
$a'$
and a are both
$3$
-cycles but do not coincide. In particular, we have
${a}\restriction {I_{4,a'}}= ({a'}\restriction {I_{4,a'}})^2$
and we need to have
${b}\restriction {g(I_{4,a'})}= {f(a')^2}\restriction {g(I_{4,a'})}$
for all such
$a'$
. Set
$I_4= \bigcup _{a'\in \mathcal {G}_A} I_{4,a'}$
. By saturation, compactness and the patching property, we find
${b}_4$
in
$\mathcal {N}$
such that for all
$a'\in \mathcal {G}_A$
,
${b}_4\restriction {g(I_{4,a'})}={f(a')^2}\restriction {g(I_{4,a'})}$
.
Case 5: Let
$a',a" \in \mathcal {G}_A$
. Set
$I_{5,a',a"}= {\mathrm {supp}}_2{a} \cap I_3^\complement \cap {\mathrm {supp}}_2(a') \cap {\mathrm {supp}}_3(a") \cap ( {\mathrm {supp}}({a"}a'a))^\complement $
. This is the part of
$\mathcal {P}$
where a is a
$2$
-cycle,
$a'$
is another
$2$
-cycle,
$a"$
is a
$3$
-cycle and a is equal to
$a"a'$
. We need that
${b}\restriction {g(I_{5,a',a"})}= {f(a")}\restriction {g(I_{5,a',a"})}\cdot {f(a')}\restriction {g(I_{5,a',a"})}.$
Set
$I_5= \bigcup _{a',a"\in \mathcal {G}_A} I_{5,a',a"}$
. By saturation, compactness and patching, we find
${b}_5$
in
$\mathcal {N}$
with support included in
$g(I_5)$
such that for all
$a',a"\in \mathcal {G}_A$
,
Case 6: Let
$a',a" \in \mathcal {G}_A$
. Set
$I_{6,a',a"}= {\mathrm {supp}}_2(a) \cap I_3^\complement \cap {\mathrm {supp}}_2(a') \cap {\mathrm {supp}}_2(a") \cap {\mathrm {supp}}(aa'a"a')^\complement $
. This is the part of
$\mathcal {P}$
where a is a
$2$
-cycle and
$a',a"\in \mathcal {G}_A$
are the other two
$2$
-cycles and a coincides with
$a'a"a^{\prime -1}=a'a"a'$
. We need to have:
for all such
$a',a"$
. Set
$I_6= \bigcup _{a',a"\in \mathcal {G}_A} I_{6,a',a"}$
. By saturation, compactness and the patching property, we find
${b}_6$
in
$\mathcal {N}$
with support included in
$g(I_6)$
such that for all
$a',a"\in \mathcal {G}_A$
,
Case 7: Let
$a' \in \mathcal {G}_A$
. Set
$I_{7,a'}= {\mathrm {supp}}_2{a} \cap I_3^\complement \cap {\mathrm {supp}}_2(a') \cap (I_6)^\complement $
. This is the part of the support where a is a
$2$
-cycle,
$a'\in \mathcal {G}_A$
is another
$2$
-cycle, but
$a'aa'$
is not in
$\mathcal {G}_A$
. Then
${b}\restriction {g(I_{7,a'})}$
needs (and only needs) to be a
$2$
-torsion element
$\alpha _{a'}$
with support
$g(I_{7,a'})$
, which is nowhere equal to
$f(a')$
on
$g(I_{7,a'})$
. Set
$I_7= \bigcup _{a'\in \mathcal {G}_A} I_{7,a'}$
. By saturation, compactness and patching, we find
${b}_7$
in
$\mathcal {N}$
such that for all
$a'\in \mathcal {G}_A$
,
${b}_7 \restriction {g(I_{7,a'})}=\alpha _{a'} \restriction {g(I_{7,a'})}$
.
Set b to be the unique element such that
$b\restriction {g(I_i)}=b_i\restriction {g(I_i)}$
for
$i\leq 7$
. One can observe easily that
$\bigcup I_i$
is a partition of
$\mathcal {P}_{\mathcal {M}}$
definable over a and
$\mathcal {G}_{A}$
. Since we have for all
$i\leq 7$
,
$f( {\mathrm {qftp}}(a_i/\mathcal {A})) = {\mathrm {qftp}}(b_i/\mathcal {B})$
, we also have
$f( {\mathrm {qftp}}(a/\mathcal {A})) = {\mathrm {qftp}}(b/\mathcal {B})$
. Therefore
$f\cup \{(a,b)\}$
extends the partial isomorphism and this concludes the proof.
5 Groups not recognizing coordinates
5.1 General criteria for not recognizing coordinates
Theorem 5.1. Suppose that
$\mathfrak C$
is a class of groups that satisfies one of the following two conditions.
-
(1) It contains groups G and H and a nontrivial homomorphism $f\colon G\to Z(H)$
. -
(2) It contains a group that is decomposable as a direct product of nontrivial groups.
Then
$\mathfrak C$
does not recognize coordinates.
The converse of this theorem does not hold. Namely, there is a family
$\mathfrak D$
of groups that fails both (1) and (2) of Theorem 5.1 but does not recognize coordinates (see Theorem 7.1). The sufficiency of the second condition is obvious, and the proof of the sufficiency of the first uses the following obvious lemma.
Lemma 5.2. Suppose that T recognizes coordinates. Let
$(\mathcal {M}_i)_{i \in I}$
and
$(\mathcal {N}_j)_{j \in J}$
be indexed families of models of T. Consider
$\theta : \prod \mathcal {M}_i \to \prod \mathcal {N}_j$
an isomorphism between (non-reduced) products. If
$\vert {\mathrm {supp}}(a) \vert $
is finite, then
$| {\mathrm {supp}}(\theta (a))| = | {\mathrm {supp}}(a)|$
.
Proof. By Theorem 2.18, the support map is interpretable. In particular, the set
$\{a \mid | {\mathrm {supp}}(a)| =n\}$
is definable and thus preserved by isomorphisms.
Proof of Theorem 5.1
For
$(1)$
, consider the map
$\tau _{f}: G \times H \to G \times H$
defined via
$\tau _{f}((a,b)) = (a,f(a)b)$
. Then
$\tau _{f}$
is an automorphism of
$G \times H$
.
-
(1) Homomorphism: notice that
$$ \begin{align*} \tau_{f}((a,b)(c,d)) &= \tau_{f}((ac,bd)) = (ac,f(ac)bd)\\ &= (ac,f(a)bf(c)d) = (a,f(a)b)(c,f(c)d) \\ &= \tau_{f}((a,b)) \tau_{f}((c,d)). \end{align*} $$
-
(2) Injective: Suppose that $\tau _{f}((a,b)) = \bar {e}$
. Then
$(a,af(b)) = (e,e)$
. Hence
$a = e$
and so
$e = f(a)b = f(e)b = b$
. It follows that
$\tau _{f}$
is injective. -
(3) Surjective: Fix $(a,b) \in G \times G$
. Then $$ \begin{align*} \tau_{f}(a,f(a)^{-1}b) = (a,b). \end{align*} $$
In particular, this allows us to build an automorphism
$\Sigma _{f}: \prod _{i\in {\mathbb N}} (G\times H)$
via
$\Sigma _{f}((a_i,b_i)_{i \in \mathbb {N}}) = (a_i,f(a_i)b_i)_{i\in {\mathbb N}}$
. Since f is nontrivial, we can find some
$a_* \in G$
such that
$f(a_*) \neq e$
. Then with
$a_i=a_*$
for all i and arbitrary
$b\in G$
we have
Moreover,
$\Sigma _f$
is an automorphism of
$\prod _{i\in {\mathbb N}} (G\times H)$
and its restriction to
$\bigoplus _{i\in {\mathbb N}} (G\times H)$
is an automorphism of
$\bigoplus _{i\in {\mathbb N}} (G\times H)$
. It therefore lifts an automorphism of the quotient
$\prod _{ {\mathrm {Fin}}} (G\times H)$
.
For
$(2)$
, the argument is similar to
$(1)$
. Notice that if G is a decomposable group, then
$G \cong H_1 \times H_2$
for nontrivial groups
$H_1$
and
$H_2$
. Consider the map
$\rho : G \times G \to G \times G$
defined via
$\rho ((h_1,h_2),(h_3,h_4)) = ((h_1, h_4), (h_3,h_2))$
where
$(h_1,h_2), (h_3,h_4) \in H_1 \times H_2$
. Then,
As a consequence of Lemma 5.2,
$\mathfrak {C}$
cannot recognize coordinates.
5.2 Classes of groups that do not recognize coordinates
Theorem 5.3. Any class of groups that contains some of the following does not recognize coordinates.
-
(a) Any product of nontrivial groups.
-
(b) Groups G and H such that G admits a nontrivial homomorphism into the centre of H.
-
(c) The group $ {\mathrm {GL}}(n,F)$
for
$n\geq 2$
and any field F. -
(d) The group $Q_{8} = \langle -1,i,j,k: (-1)^{2} = e, i^{2} = j^{2} = k^{2} =ijk = -1 \rangle $
. -
(e) The dihedral group $D_{2n}$
of the
$2n$
-gon for
$n\geq 1$
. -
(f) Any nilpotent group.
-
(g) Any nontrivial graph product $\Gamma \mathcal G$
such that the complement graph
$\bar \Gamma $
is not connected (see §4.5). -
(h) Any class of groups that contains $\mathfrak S_3$
and
$ {\mathrm {SL}}(2,5)$
.
Proof. (a) follows by Theorem 5.1.
(b) This is Theorem 5.1 (2).
(c) Compose the determinant map with the map that sends scalars to scalar matrices.
(d) Recall that
$Z(Q_{8}) = \{\pm 1\} \cong \mathbb {Z}/2\mathbb {Z}$
. For any
$l\in \{i,j,k\}$
, we have a homomorphism
$\alpha _{l}: Q_{8} \to Z(Q_8) $
via
Note that
$Q_{8}$
cannot be written as a nontrivial semidirect product.
(e) We have
$D_{2n} = \langle r,s : r^{2n} = s^{2} = e, srs = r^{-1} \rangle $
. Then, if n is even, the centre is
$\{e, r^{n/2}\}$
. Each element can be written as
$s^{\epsilon }r^{k}$
where
$\epsilon \in \{0,1\}$
and
$k \in \{0,\dots ,n-1\}$
. Then the map
$f:D_{n} \to \mathbb {Z}/2\mathbb {Z}$
via
$f(s^{\epsilon }r^{k}) = \epsilon + k \mod 2$
is a homomorphism from
$D_{n}$
into its centre.
We remark that
$D_{n}$
can be written as a semidirect product:
$D_{n} \cong Z_n \rtimes Z_{2}$
.
(f) If G is nilpotent, then Lemma 5.5 below implies that there is a nontrivial homomorphism from G into its centre.
(g) This is the easier half of Theorem 4.17.
(b) The group
$\mathfrak S_3$
has
${\mathbb Z}/2{\mathbb Z}$
as a quotient, and
${\mathbb Z}/2{\mathbb Z}$
is the centre of
$ {\mathrm {SL}}(2,5)$
. Therefore Theorem 5.1 implies that the class
$\{\mathfrak S_3, {\mathrm {SL}}(2,5)\}$
does not recognize coordinates.
Regarding (C) in Theorem 4, the following may be worth pointing out (e.g., see [76]).
Lemma 5.4. If F is a field in which every element has a unique n-th root, then
$ {\mathrm {GL}}(n,F)$
is decomposable. In particular,
$ {\mathrm {GL}}(3,\mathbb {R})$
is decomposable and also
$ {\mathrm {GL}}(p,\mathbb {F}^{ {\mathrm {alg}}}_p)$
where
$\mathbb {F}^{ {\mathrm {alg}}}_p$
is an algebraically closed field of characteristic p.
Proof. An isomorphism
$ {\mathrm {GL}}(n,F)\cong {\mathrm {SL}}(n,F)\times F^\times $
is given by the map
$a\mapsto (\det (a)^{-1/n} a, \det (a))$
.
The following is well-known but maybe not the easiest to find. We include a proof for the reader’s convenience.
Lemma 5.5. If G is nilpotent, then there is a non-identity homomorphism from G into its centre.
Proof. Let
$n+1$
be the nilpotency class of G. Thus we have
$G_0=G$
,
$G_{k+1}=[G_k,G]$
for
$k\leq n$
, so that
$G_n$
is nontrivial and abelian, including in the centre, and
$G_{n+1}=\{e\}$
. If G is abelian then the assertion is trivial, hence we may assume
$n\geq 1$
. We will prove that for every
$c\in G_{n-1}$
the mapping
$x\mapsto [x,c]$
from G into G is a homomorphism. Let
$c\in G_{n-1}$
. Then for every
$x\in G$
the commutator
$[x,c]$
belongs to the centre. Fix
$c,x$
and y in G. Then, repeatedly using the fact that all commutators of the form
$[z,c]$
commute, we have the following (extra brackets inserted for readability)
Since G is nonabelian, we can choose a non-central c. By the above,
$x\mapsto [x,c]$
is a group homomorphism from G into
$Z(G)$
. Since
$G_n$
is nontrivial and it is generated by commutators
$[x,c]$
for
$x\in G$
and
$c\in G_{n-1}$
, we can choose
$c\in G_{n-1}$
so that the range of the homomorphism
$x\mapsto [x,c]$
is nontrivial.
Finally, we treat the reader to a surprise example.
Example 5.6. For any
$n \geq 2$
, neither the Artin braid group on n strands (denoted
$B_n$
) nor the pure braid group on n strands (denoted
$P_n$
) recognizes coordinates. For
$n \geq 2$
, both
$B_n$
and
$P_n$
are indecomposable (i.e., see [Reference Paris59, Proposition 4.2]), yet they both admit nontrivial maps to their respective centres. We refer the reader to [Reference Kassel and Turaev39] as a basic reference. For
$n \geq 2$
, the group
$B_n$
is defined as follows:
The half-twist
$\Delta $
in
$B_{n}$
is defined as
and the centre of
$B_{n}$
is precisely
$\langle \Delta ^{2} \rangle \cong \mathbb {Z}$
. On the other hand,
$B_{n}/[B_n,B_n] \cong \mathbb {Z}$
. Hence
$B_{n}$
admits a nontrivial homomorphism to its centre and so it does not recognize coordinates.
Additionally, the pure braid group on n strands is the kernel of the surjective homomorphism from
$B_{n}$
onto
$\mathfrak S_{n}$
generated via
$\sigma _i \to (i,i+1)$
. For
$n \geq 2$
, the group
$P_{n}$
has nontrivial centre, again
$Z(P_n) = \langle \Delta ^{2} \rangle \cong \mathbb {Z}$
. By [Reference Kassel and Turaev39, Corollary 1.20],
Hence
$P_{n}$
also admits a nontrivial homomorphism to its centre and thus does not recognize coordinates.
6 Other structures
As mentioned in the introduction, in [Reference De Bondt, Farah and Vignati15, §2.2] it was pointed out that from the model-theoretic point of view, a morally satisfactory proof that a theory recognizes coordinates would proceed by exhibiting a copy of
$\mathcal P({\mathbb N})/{\mathcal I}$
as well as the projections
$\pi _S$
, for
$S\in \mathcal {P}(\mathbb {{\mathbb N}})/\mathcal { } {\mathcal I}$
inside every reduced product
$\prod _{ {\mathrm {Fin}}} \mathcal M_n$
of models of T. In this sense the proofs that linear orders and sufficiently random graphs recognize coordinates ([Reference De Bondt, Farah and Vignati15, Proposition 2.7]) are unsatisfactory. We therefore give below new proofs, using Theorem 1 (3) and explicit h-formulas, that sufficiently random graphs and linear orders recognize coordinates. We will restrict to linear orders with no maximal element for simplicity. First, we study coordinate recognition in a particular commutative magma.
6.1 Rock paper scissors
Let
$\mathfrak {M}= (\{R,P,S\},\cdot )$
be the commutative magma on the three-element set
$\{R,P,S\}$
with the following operation table:
Proposition 6.1. Let
$I\!I\!I = \prod _{\mathcal {I}} \mathfrak {M}$
be a reduced product of the magma
$\mathfrak {M}$
. Then
$I\!I\!I $
interprets parameter-freely the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the relative support function
It is relatively easy to define various copies of the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
. With a small trick, we can interpret the support function.
Proof. To show that
$I\!I\!I $
interprets the support function
$ {\mathrm {supp}}_=$
, it is enough to show by Theorem 3.8 that the formula
$x=t \rightarrow y=t$
is equivalent to an h-formula in
$\mathfrak {M}$
. Fix
$t\in \mathfrak {M}$
. We denote by
$L(t)$
the element s losing against t, i.e., such that
$s\neq t$
and
$s\cdot t = t$
. The following shows that
$t\mapsto L(t)$
is defined by the h-formula:
We see that
$x=t \rightarrow y=t$
is equivalent to
Indeed, if (*) holds and
$x=t$
, then we have
Then, since
$y\cdot L(t)$
is either t or
$L(t)$
, we have:
Conversely, assume
$x=t \rightarrow y=t$
, and we need to show that (*) holds. If
$y=t$
, then
$(y\cdot L(t))=t$
, and since
$(x\cdot L(t))$
is either t or
$L(t)$
, we have
and (*) holds. If
$x\neq t$
, then
$(x\cdot L(t))=L(t)$
and (*) also clearly holds.
In the end, we get that the formula
$x=t \rightarrow y=t$
is equivalent to the formula:
This is clearly (equivalent to) an h-formula since
$(\exists s') ~s'\cdot t = t $
always holds.
By Theorem 1, we have:
Corollary 6.2. The magma
$\mathfrak {M}$
recognizes coordinates.
Finally, we notice that all (parameter-free) formulas in
$\mathfrak {M}$
are equivalent to a Boolean combination of (quantifier-free) atomic formulas in the language
$(\mathfrak {M},\cdot ,L)$
. It follows that, for any reduced power
$I\!I\!I $
of
$\mathfrak {M}$
,
$\{(I\!I\!I ,\cdot ),(\mathcal {P}(\mathbb {I})/\mathcal {I} ,\subseteq ), {\mathrm {supp}}_= \}$
is a definable expansion of the magma
$ (I\!I\!I ,\cdot )$
and by Theorem 6:
Corollary 6.3. Any reduced power
$I\!I\!I = \prod _{\mathcal {I}} \mathfrak {M}$
of the magma
$\mathfrak {M}$
eliminates quantifiers relative to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in the following interpretable language:
6.2 Linear orders
In this paragraph,
$\mathcal {L}$
denotes the language
$\mathcal {L}=\{<\}$
of orders. Consider
$\mathfrak C$
the class of linear orders with no larger element, and
$\mathcal {N} := \prod _{\mathcal {I}} \mathcal {M}$
a reduced product. The relation
can be expressed with an h-formula, namely:
It is an h-formula because for all
$x,y$
, there is always w such that
$(w\leq x \wedge w\leq y)$
. Clearly,
$\min (x,y)\geq z$
is equivalent to the h-formula
$z\leq x \wedge z\leq y$
.
Proposition 6.4. In all structures in
$\mathfrak C$
, the formula
$f=k \rightarrow g=k$
is equivalent to the following h-formula:
Proof. This is an h-formula as for all
$g,k$
,
always holds (we may take
$g'=\min (g,k)$
). We see
$f,g,k,u$
as functions from a nonempty set A to a total order B with no top element. Assume that f coincides more often with k than g coincides with k. An element
$g'$
satisfying
$\min (g',k)=\min (g,g')=\min (g,k)$
must be equal to the minimum of g and k, except where g and k coincide. Since f and k coincide more often than g and k, for all such
$g'$
we may find an
$f'$
such that
$\min (f',k)=\min (f,f')=\min (f,k)$
, and which is larger than
$g'$
on the part where f and k coincide. To express the latter, we use an element
$u> f,g,k$
and compare
$\max (g',u)$
and
$\max (f',u)$
. Conversely, if g and k coincide where f and k do not, then some
$g'$
not smaller than u, we see that one cannot find such a
$f'$
.

Assume now that
$\vert A\vert =1$
and identify B with functions from A to B. The facts above give the equivalence between
$f=k \rightarrow g=k$
and (*).
By Theorem 3.8 and Theorem 1, it follows in particular:
Corollary 6.5. Reduced products
$\mathcal {M} := \prod _{\mathcal {I}}\mathcal M_i$
of total orders with no top element interpret (uniformly) the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the relative support function
$ {\mathrm {supp}}_=: \mathcal M^2 \rightarrow \mathcal {P}(\mathbb {I})/\mathcal {I} $
, and the class of such orders recognizes coordinates.
We can deduce from the Feferman–Vaught theorem a language where a reduced product of dense linear orders (without endpoints) eliminates quantifiers.
Corollary 6.6. Reduced products
$\mathcal {M}:=\prod _{\mathcal {I}} \mathcal {M}_i$
of models of DLO eliminate quantifiers relative to the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in the interpretable language
where for all
$a,b\in \mathcal {N}$
:
and
Proof. We have quantifier elimination in DLO (the theory of dense linear orderings without endpoints) in the language of pure orders, therefore all formulas are equivalent to a Boolean combination of formulas of the form
$x\geq y$
and
$x=y$
, which are satisfiable h-formulas. We can conclude by Theorem 6.
6.3 Sufficiently random graphs
In this paragraph,
$\mathcal {L}$
denotes the language
$\mathcal {L}=\{R\}$
of (undirected and simple) graphs. We recall first the definition of sufficiently random graphs:
Definition 6.7 [Reference De Bondt, Farah and Vignati15, Definition 2.20].
A graph G is sufficiently random if it has at least three vertices and if for all pairwise distinct vertices u,
$v_1,v_2$
, there is a vertex w distinct from u such that
$\neg uRw \wedge v_1Rw \wedge v_2Rw$
holds. The theory of sufficiently random graphs will be denoted
$T_{\textrm {SRG}}$
.
Notice that the class
$\mathfrak C$
of models of
$T_{\textrm {SRG}}$
is full in the sense of Definition 2.4.
We claim that the formula
$x=z \vee y=z$
is equivalent to
Indeed, the direct implication is obvious. To prove the converse, assume that
$z\notin \{x,y\}$
holds. Then, by sufficient randomness, there is a vertex d which is connected to x and y and not to z. This contradicts the formula
$\varphi (x,y,z)$
above.
The formula
$\varphi (x,y,z)$
is clearly equivalent to an h-formula modulo
$T_{\textrm {SRG}}$
, as
$(\exists d) ~ dRx \wedge dRy$
holds in every sufficiently random graph.
We can now use the following fairly general lemma.
Lemma 6.8. Assume that
$x=z \vee y=z$
is equivalent to an h-formula
$\varphi (x,y,z)$
modulo some theory T. Then
$(\forall v) ~ \varphi (x,v,z) \rightarrow \varphi (y,v,z)$
is an h-formula equivalent modulo T to
$x=z \rightarrow y=z$
.
Proof. The fact that
$\forall v ~ \varphi (x,v,z) \rightarrow \varphi (y,v,z)$
is (equivalent to) an h-formula is clear, as for all x and z, the sentence
$(\exists v) ~\varphi (x,v,z)$
holds in every sufficiently random graph. To prove the converse implication, assume that
$x=z \rightarrow y=z$
holds. If
$x\neq z$
, then for every vertex v,
$\varphi (x,v,z)$
implies
$z=v$
and therefore it implies
$\varphi (y,v,z)$
. We may therefore assume
$x=z$
, which implies
$x=y=z$
. In this case, both
$\varphi (x,v,z) $
and
$\varphi (y,v,z) $
hold for all v, proving the converse implication. It remains to prove that
$(\forall v) ~ \varphi (x,v,z) \rightarrow \varphi (y,v,z)$
implies
$x=z \rightarrow y=z$
. Assuming in addition
$x=z$
, it suffices to show that
$y=z$
. Towards this, fix any
$v\neq z$
. Then both
$\varphi (x,v,z)$
and
$\varphi (y,v,z)$
hold, and the latter implies
$y=z$
.
By Theorem 3.8 and Theorem 1, we have the following corollary:
Corollary 6.9. Reduced products
$\mathcal M := \prod _{\mathcal {I}}\mathcal M_i$
of sufficiently random graphs interpret (uniformly) the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the support function
$ {\mathrm {supp}}_=: \mathcal M \rightarrow \mathcal {P}(\mathbb {I})/\mathcal {I} $
, and the class of such graphs recognizes coordinates.
Now, let us consider
$T_{RG}$
, the theory of random graphs. It is of course a completion of
$T_{\textrm {SRG}}$
and it eliminates quantifiers in the language
$\mathcal {L}=\{R\}$
. By Theorem 6, we have:
Corollary 6.10. Reduced products
$\mathcal {G}=\prod _{\mathcal {I}}\mathcal {G}_i$
of random graphs eliminate quantifiers relative to
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
in the interpretable language
where
and
6.4 Connected rings
In this paragraph, we highlight some connections between coordinate recognition and the work of D’Aquino and Macintyre in [Reference D’Aquino and Macintyre13], and of Derakhshan and Macintyre (see, e.g., [Reference Derakhshan and Macintyre18]). Recall that a ring R is connected if
$0$
and
$1$
are the only idempotent elements in R and
$0 \neq 1$
. In this paragraph, we denote by
$\mathfrak C$
the class of connected rings.
Lemma 6.11. Modulo the theory of connected rings, the formula
is equivalent to the h-formula
We leave the proof to the reader. By Theorem 4.1, we have:
Corollary 6.12. Reduced products
$\prod _{\mathcal {I}} R_i$
of connected rings interpret (uniformly) the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
and the support map
and the class of connected rings recognizes coordinates.
This corollary, at least in its version for products
$R := \prod _{\mathbb {I}} R_i$
, is explicit in [Reference D’Aquino and Macintyre13] and [Reference Derakhshan and Macintyre18], once the Boolean algebra
$\mathcal P(\mathbb {I})$
is identified as the set of idempotents of R. This plays an important role, for example, in [Reference Derakhshan and Macintyre18, Corollary 7.2] – which states a quantifier elimination result for the rings of adeles – and in [Reference D’Aquino and Macintyre13, Theorem 2.10] – which gives a list of five axioms for the class of products of connected rings. Connected rings were discussed in [Reference De Bondt, Farah and Vignati15, §4.1] where they were called rings with no nontrivial idempotents, and the result relevant for recognizing coordinates was attributed to S. Burris [Reference Burris and Werner6]. The authors of [Reference De Bondt, Farah and Vignati15] were not aware of [Reference D’Aquino and Macintyre13] and [Reference Derakhshan and Macintyre18]. Axiomatization of classes of (reduced) products will not be investigated in this paper.
7 Limiting examples
In this section, we collect results that together suggest that the problem of characterizing classes of groups that recognize coordinates is nontrivial.
7.1 The failure of compactness
We have already seen that each one of
$\mathfrak S_3$
and
$ {\mathrm {SL}}(2,5)$
recognizes coordinates but
$\{\mathfrak S_3, {\mathrm {SL}}(2,5)\}$
does not (Theorem 4). In this section, we prove the following.
Theorem 7.1. There is a family
$\mathfrak D$
of perfect groups that does not recognize coordinates, but every finite subset of
$\mathfrak D$
does. All groups in
$\mathfrak D$
are indecomposable and perfect. In particular, there is no nontrivial homomorphism from a group in
$\mathfrak D$
into the centre of a group in
$\mathfrak D$
.
Once proved, this will show that the converse of Theorem 5.1 is false and dampen any hope that there is a simple characterization of when a class of groups recognizes coordinates. It also shows that the class of all perfect groups does not recognize coordinates (cf. Proposition 4.7). The proof of this theorem is given at the end of this section, as a consequence of Proposition 7.2 below and [Reference Muranov51, Theorem 4].
Let
$ {\mathrm {cw}}(H)$
denote the commutator width of a group H (see §4.3). In [Reference Nikolov52, Theorem 1.1], Nikolov constructed a sequence of finite perfect groups
$H_n$
such that
$\lim _{n\to \infty } {\mathrm {cw}}(H_n)=\infty $
. We do not know whether Nikolov’s groups satisfy the condition (
$\dagger $
) of Proposition 4.7. If infinitely many of them do, then this (together with Proposition 7.2) would imply a failure of compactness for the notion of recognizing coordinates and a failure of the converse to Theorem 5.1.
Proposition 7.2. There is a family
$\mathfrak C=\{G_n\mid n\in {\mathbb N}\}$
of quasisimple groups of commutator width 1 such that every abelian group admits a nontrivial homomorphism into the centre of
$\prod _{ {\mathrm {Fin}}} G_n$
.
Proof. For any
$n\geq 2$
, there are, by Dirichlet’s theorem, infinitely many primes in the arithmetic sequence
$(k\cdot n!+1)_{k\geq 1}$
. We can therefore choose an increasing sequence of primes
$(p_n)_{n\geq 2}$
such that
$n!$
divides
$p_n-1$
for all n. In particular,
$m!$
divides
$p_n-1$
for all
$n>m$
. Let
$G_n:= {\mathrm {SL}}(p_n-1,p_n)$
. By Corollary 4.11, the class
$\mathfrak C=\{G_n\mid n\in {\mathbb N}\}$
recognizes coordinates. Also, since quasisimple groups satisfy (
$\dagger $
) of Proposition 4.7, this proposition implies that every finite subfamily of
$\mathfrak D$
recognizes coordinates.
We will now prove that
$\mathbb Q/{\mathbb Z}$
embeds into
$\prod _{ {\mathrm {Fin}}} G_n$
. Since the multiplicative group of
$F_{p^n}$
is the cyclic group
${\mathbb Z}/(p_n-1){\mathbb Z}$
, every scalar matrix in
$ {\mathrm {GL}}(p_n-1,p_n)$
has determinant equal to
$1$
, and therefore the centre of
$ {\mathrm {SL}}(p_n-1,p_n)$
is isomorphic to
${\mathbb Z}/(p_n-1){\mathbb Z}$
. Therefore, for every fixed
$m\geq 2$
and all but finitely many n we have that
$Z(G_n)$
includes an isomorphic copy of
${\mathbb Z}/m!{\mathbb Z}$
.
Let (
$o(a)$
denote the order of the element a)
Since for every m and all but finitely many n,
$Z(G_n)$
is a finite cyclic group whose order is a multiple of
$m!$
, Q is a nontrivial (even uncountable) group. The image of Q under the quotient map
$\prod _n G_n\to \prod _{ {\mathrm {Fin}}} G_n$
is divisible and we can recursively choose an isomorphic copy of
$\mathbb Q/{\mathbb Z}$
inside it. This copy is clearly included in the centre of
$\prod _{ {\mathrm {Fin}}} G_n$
.
It remains to note that every nontrivial abelian group admits a nontrivial homomorphism into
$\mathbb Q/{\mathbb Z}$
and every singly generated abelian group has a nontrivial homomorphism into
$\mathbb Q/{\mathbb Z}$
. The second part is trivial, and the first part is an immediate consequence of Baer’s theorem that divisible groups are injective in the category of abelian groups (e.g., [Reference Fuchs27, Theorem 21.1]). This completes the proof.
Proof of Theorem 7.1
We first need to construct a family
$\mathfrak D$
of perfect groups that does not recognize coordinates, but every finite subset of
$\mathfrak D$
does.
By [Reference Muranov51, Theorem 4] for every n there is a perfect, simple group
$K_n$
such that
$n+1\leq {\mathrm {cw}}(K_n)\leq 2n+2$
. All of these groups satisfy condition (
$\dagger $
) of Proposition 4.7. Using groups
$G_n= {\mathrm {SL}}(p_n-1,p_n)$
constructed in Proposition 7.2, let
All groups in
$\mathfrak D$
are perfect and of finite commutator width, hence every finite subset of
$\mathfrak D$
recognizes coordinates by Proposition 4.7. (We also know that
$\{K_n\mid n\in {\mathbb N}\}$
recognizes coordinates by Theorem 2 (a), but this result does not apply to the non-simple groups
$G_n$
. Thus each one of
$\{G_n\mid n\in {\mathbb N}\}$
and
$\{K_n\mid n\in {\mathbb N}\}$
recognizes coordinates, but their union does not.)
It remains to verify that
$\mathfrak D$
does not recognize coordinates. Since
$ {\mathrm {cw}}(K_n)\to \infty $
as
$n\to \infty $
, neither of the groups
$\prod _n K_n$
and
$\tilde K:=\prod _{ {\mathrm {Fin}}} K_n$
is perfect. Therefore the latter group has a nontrivial abelian quotient,
$A:=\tilde K/[\tilde K,\tilde K]$
.
Proposition 7.2 implies that there is a nontrivial homomorphism from A into
$Z(\prod _{ {\mathrm {Fin}}} G_n)$
. The argument from the proof of the first part of Theorem 5.1 gives an automorphism of
$\prod _{ {\mathrm {Fin}}} (G_n\times K_n)$
that does not respect coordinates.
Finally, all groups in
$\mathfrak D$
are perfect, hence none of them has an abelian quotient and in particular does not admit a nontrivial homomorphism into the centre of any other group.
7.2 The failure of a weak converse to Theorem 5.1
Theorem 7.1 implies that the converse to Theorem 5.1 is false. In the original draft of this paper, we asked whether a weak converse to Theorem 5.1, asserting that every indecomposable group G that does not admit a nontrivial homomorphism into its centre recognizes coordinates, holds. This was quickly answered in the negative by Forte Shinko ([Reference Shinko67]) who proved that the unrestricted wreath product
$ {\mathbb Z}\wr \mathbb Q$
(i.e., the semidirect product of
${\mathbb Z}^{\mathbb Q}$
and
$\mathbb Q$
) admits no nontrivial homomorphism into its centre, but its ultrapower does. This group is clearly infinite, and we do not know whether every finite indecomposable group that does not admit a nontrivial homomorphism into its centre recognizes coordinates and even whether the class of all finite groups with this property recognizes coordinates. A potential angle of attack to resolve the former question may be via Sylow’s theorems. The reason why the proof that
$\mathfrak S_3$
recognizes coordinates (and Proposition 4.5) requires an additional effort is that it has a unique (hence normal) 3-Sylow subgroup. A finite indecomposable group necessarily has a non-unique p-Sylow subgroup for some p, and a generalization of Proposition 4.5 (taking
$Z(G)=\{e\}$
into account) may show that such G recognizes coordinates.
Shinko’s proof shows that the property ‘G does not admit a nontrivial homomorphism into
$Z(G)$
’ is not first-order. We remark that the other property figuring in the statement of Theorem 5.1, of being indecomposable, is not first-order either.
Example 7.3. There is an indecomposable group G whose ultrapower
$G^{\mathcal U}$
is decomposable. In particular, neither the class of decomposable groups nor the class of indecomposable groups is axiomatizable.
Take
$G={\mathbb Z}$
and
$H={\mathbb Z}^{{\mathcal U}}$
, an ultrapower of
${\mathbb Z}$
associated with a nonprincipal ultrafilter
${\mathcal U}$
on
${\mathbb N}$
. Then H has a nontrivial maximal divisible subgroup. Let
Then the image of K under the quotient map from
${\mathbb Z}^{\mathbb N}$
onto
${\mathbb Z}^{\mathcal U}$
is clearly a nontrivial divisible subgroup. By [Reference Fuchs27, Section 4, Theorem 2.5] every abelian group has a maximal (under inclusion) divisible subgroup and this subgroup is a direct summand. Since the elements of the diagonal copy of
${\mathbb Z}$
in
${\mathbb Z}^{\mathcal U}$
are not divisible, this gives a decomposition of
${\mathbb Z}^{\mathcal U}$
into two nontrivial direct summands.
7.3
$|\mathcal {L}|$
-compactness
In Theorem 7.1 we have seen that compactness fails for the notion of recognizing coordinates. The following gives some compactness-like result (as is common, the cardinality
$|{\mathcal L}|$
of a language
${\mathcal L}$
is the cardinality of the set of its sentences).
Proposition 7.4. Suppose that
$\mathfrak C$
is a class of structures of the same language
${\mathcal L}$
. Then
$\mathfrak C$
recognizes coordinates if and only if every subset of
$\mathfrak C$
of cardinality
$|{\mathcal L}|$
recognizes coordinates.
Proof. To prove the nontrivial direction, suppose that every subset
$\mathfrak D$
of
$\mathfrak C$
of cardinality
$\lambda $
recognizes coordinates. By Theorem 1, the formula
$x =x'\to y= y'$
is equivalent to an h-formula in
$ {\mathrm {Th}}(\mathfrak D)$
. We claim that there is an h-formula
$\varphi $
such that for every
$\mathfrak D\subseteq \mathfrak C$
of cardinality
$\lambda $
,
$\varphi $
defines the support in reduced products. Assume otherwise, and for every h-formula
$\varphi $
fix
$\mathfrak D_\varphi \subseteq \mathfrak C$
of cardinality
$\lambda $
such that
$x=x'\to y=y'$
is not equivalent to
$\varphi $
in
$ {\mathrm {Th}}(\mathfrak D_\varphi )$
. Then
$\mathfrak D=\bigcup _\varphi \mathfrak D_\varphi $
has cardinality
$\lambda $
, hence by the assumption some h-formula
$\psi $
is equivalent to
$x=x'\to y=y'$
in
$ {\mathrm {Th}}(\mathfrak D)$
. However,
$ {\mathrm {Th}}(\mathfrak D)\subseteq {\mathrm {Th}}(\mathfrak D_\psi )$
, contradiction.
Example 7.5. For every regular cardinal
$\lambda $
there are a language
${\mathcal L}$
of cardinality
$\lambda $
and a class
$\mathfrak C$
of
${\mathcal L}$
-structures that does not recognize coordinates, but every
$\mathfrak D\subseteq \mathfrak C$
of smaller cardinality recognizes coordinates. In particular, if
$\lambda $
is uncountable then every reduced product
$\prod _{i\in {\mathbb N}} \mathcal M_i/{\mathcal I}$
of structures in
$\mathfrak C$
recognizes coordinates but some reduced product of structures in
$\mathfrak C$
does not recognize coordinates.
Let
$\lambda $
be a cardinal and consider the
$\mathcal {L}$
-language
$\{P_\beta : \beta < \lambda \}$
, consisting of
$\lambda $
many ternary predicates. For
$\alpha < \lambda $
, denote by
$\mathcal {M}_\alpha $
an infinite structure such that for every
$\beta <\lambda $
we have
It will suffice to prove that the following holds.
-
(a) The class $\mathfrak C := \{M_\alpha \}_{\alpha < \lambda }$
does not recognize coordinates. -
(b) Every subclass of cardinality $< \mathrm {cf}(\lambda )$
recognizes coordinates.
To prove (a), consider the product
$M := \prod _{\alpha < \lambda } M_\alpha / \mathcal {I}$
where
$\mathcal {I}$
is the ideal of subsets of size
$< \lambda $
. All ternary predicates
$P_\beta (x, y, z)$
define on M the equality
$x = y = z$
; thus, the structure is just an infinite set and does not recognize coordinates.
To prove (b), consider
$\mathfrak D\subseteq \mathfrak C$
of size
$\mu < \mathrm {cf}(\lambda )$
. Then, for some
$\beta < \lambda $
, the class is included in
$\{M_\alpha \}_{\alpha < \beta }$
, and it suffices to show that this latter class recognizes coordinates. This follows from Theorem 1, as
$P_\beta (x, y, z)$
is an h-formula defining the support function in any reduced product. The second part of (b) follows immediately.
Then (b) implies that the class
$\{M_\alpha \}_{\alpha < \mu }$
recognizes coordinates in
$\mu $
for every
$\mu < \mathrm {cf}(\lambda )$
and concludes the proof.
7.4 Interpreting
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
is not enough
In Theorem 4.1, we saw that a group recognizes coordinates if and only if all reduced products
$\prod _{\mathcal {I}} G$
interpret the support function for every ideal
$\mathcal {I}$
. It is, however, not sufficient that all reduced products
$\prod _{\mathcal {I}} G$
interpret the Boolean algebra
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
. In this paragraph, we use a little variation of Theorem 4.3 to show that reduced products of the group of quaternion
$Q_8$
interpret the Boolean algebra; however,
$Q_8$
does not recognize coordinates by Theorem 4.
Proposition 7.6. Let G be a nonabelian group with centre
$\mathcal {Z}$
such that for all
$a\in G\setminus \mathcal {Z}$
,
$C(a^G)=\mathcal {Z}$
. Then for every ideal
$\mathcal {I}$
on an index set
$\mathbb {I}$
, the reduced product
$\mathcal {M}=\prod _{\mathcal {I}} G$
interprets the support modulo
$\mathcal {Z}(\mathcal {M})$
, that is, the function
Proof. On
$\mathcal {M}$
, consider the binary relation
$\trianglelefteq $
:
The relation
$x \trianglelefteq y$
says that any element that does not commute with x has a conjugate which does not commute with y. This is clearly a preorder: for all
$x,y,z \in \mathcal {M}\ x \trianglelefteq y\trianglelefteq z$
. Consider the associated equivalence relation
$x\sim y$
and the quotient
$B:=\mathcal {M}/\sim $
. We need to prove the following:
Claim 7.7. For all
$x,y\in \mathcal {M}$
,
$x\sim y$
if and only if x and y have the same support modulo
$\mathcal {Z}(\mathcal {M})$
. In particular,
$(B,\trianglelefteq )$
can be identified with
$(\mathcal {P}(\mathbb {I})/\mathcal {I} ,\subseteq )$
.
Consider two elements
$x=(x_i)_i$
and
$y=(y_i)_i$
that do not have the same support modulo
$\mathcal {Z}(G)$
. We may assume:
For all
$i\in J$
, let
$a_i$
be an element in
$G\setminus \mathcal {Z}$
which does not commute with
$y_i$
. We set
$w=(w_i)$
with
Then
$w\in \mathcal {M}$
and clearly w does not commute with y but all conjugates of w commute with x, and therefore
$y \not \trianglelefteq x $
. Conversely, assume that x and y have the same support modulo
$\mathcal {Z}(\mathcal {M})$
and let
$z=(z_i)_i\in \mathcal {M}$
which does not commute with x. Then,
In particular, for
$i\in J$
,
$z_i$
and
$y_i$
are not in
$\mathcal {Z}$
. Then by assumption, for all
$i\in J$
, there is
$h_i$
such that
$z_i^{h_i}$
does not commute with
$x_i$
for
$i\in J$
. If
$i\notin J$
, set
$h_i=e$
and let
$h=(h_i)\in \mathcal {M}$
. It follows that
$z^h$
does not commute with x in
$\mathcal {M}$
. Therefore
$x \trianglelefteq y$
and by symmetry,
$x \sim y$
. This concludes the proof.
Corollary 7.8. The quaternions
$Q_8:=\left \langle a,b \, \middle | \, a^4=e, b^2=a^2, ba=a^{-1}b\right \rangle $
have the property that
$\mathcal {P}(\mathbb {I})/\mathcal {I} $
is definable in the reduced product
$\prod _{\mathcal {I}} Q_8$
but do not recognize coordinates.
Proof. The quaternions satisfy the assumptions of Proposition 7.6 but they do not recognize coordinates by Theorem 4 (d).
Thus [Reference De Bondt, Farah and Vignati15, Theorem 7] does not apply to prove that forcing axioms imply all automorphisms of
$\prod _{ {\mathrm {Fin}}} Q_8$
are trivial, and on the other hand results of [Reference De Bondt, Farah and Vignati14] cannot be used to prove that
$\prod _{ {\mathrm {Fin}}}Q_8$
is fully saturated by Proposition 8.8 below. This appears to leave the possibility that forcing axioms imply all automorphisms of
$\prod _{ {\mathrm {Fin}}} Q_8$
are trivial. We show that this is not the case.
Corollary 7.9. The reduced power of
$Q_8$
associated with
$ {\mathrm {Fin}}$
has
$2^{2^{\aleph _0}}$
automorphisms, regardless of whether CH holds or not.
Proof. By the proof of Theorem 4 (d),
$Q_8$
admits a homomorphism onto its (nontrivial) centre. Therefore the conclusion follows by Lemma 7.10 below.
Lemma 7.10. If G and H are groups such that
$Z(H)$
is nontrivial and G admits a homomorphism f onto
$Z(H)$
, then the reduced power of
$G\times H$
associated with
$ {\mathrm {Fin}}$
has
$2^{2^{\aleph _0}}$
automorphisms, provably in ZFC.
Proof. By [Reference De Bondt, Farah and Vignati14, Theorem 1],
$\prod _{ {\mathrm {Fin}}} Z(H)$
is, being stable, saturated. It therefore has
$2^{2^{\aleph _0}}$
automorphisms. Also,
defines a surjective homomorphism from
$\prod _{ {\mathrm {Fin}}} G$
onto
$\prod _{ {\mathrm {Fin}}}Z(H)=Z(\prod _{ {\mathrm {Fin}}}H)$
. Since
$\prod _{ {\mathrm {Fin}}} (G\times H)\cong \prod _{ {\mathrm {Fin}}} G\times \prod _{ {\mathrm {Fin}}} H$
, and
$\Psi $
defines an endomorphism
$\tilde \Phi $
of this group whose range is
$Z(\prod _{ {\mathrm {Fin}}} H)$
. For every automorphism
$\Phi $
of
$\prod _{ {\mathrm {Fin}}} Z(H)$
we then have a unique automorphism of
$\prod _{ {\mathrm {Fin}}}(G\times H)$
defined by
$a\mapsto a\tilde \Phi (a)$
.
8 Concluding remarks
8.1 An abstract criterion for recognizing coordinates
We give an abstraction (and a generalization) of Theorem 4.3 (1). The proof is analogous (the relation
$R(x,y)$
corresponds to ‘x and y are in the same conjugacy class’ and
$S(x,y)$
to
$xy=yx$
). This also gives a template for abstracting other results from §4.1.
In the following, h-definable is short for ‘definable by an h-formula’, and by ‘uniformly’ we mean that the same formula works in all models of T.
Proposition 8.1. Suppose that T is a theory such that all models M of T satisfy the following.
-
(1) There is a uniformly h-definable element e.
-
(2) There are uniformly h-definable binary relations R and S with the following properties for all $x,y$
in M.-
(a) $R(e,x)\ \Leftrightarrow \ R(x,e)\ \Leftrightarrow \ x=e$
. -
(b) $S(e,x)$
and
$S(x,e)$
. -
(c) If $x\neq e$
and
$y\neq e$
, then there is z such that
$R(x,z)\land \lnot S(z,y)$
.
-
Then T recognizes coordinates.
Proof. Let
$\varphi (x,z)$
be the formula
$(\forall t)(R(z,t)\to S(t,x))$
. Since
$R(z,e)$
holds in all models of T, this is equivalent to an h-formula. Moreover, since
$\varphi (x,e)$
is true in every model of T,
is equivalent to an h-formula. By the assumption that
$x\neq e$
implies there is z such that
$\lnot S(x,z)$
,
$\varphi (x,z)$
is equivalent to stating that
$x=e$
or
$z=e$
. Therefore the displayed formula is equivalent to
$x=e\to y=e$
. Hence the relative support function
$ {\mathrm {supp}}_=$
is interpretable by an h-formula, and Lemma 3.3 implies the desired conclusion.
8.2 Isomorphisms between (non-reduced) products
Here, we make some connections between recognizing coordinates and recognizing coordinates in products and direct sums. The following is the analogue of Definition 2.5 in the context of products.
Definition 8.2. An isomorphism
$\Phi $
between products
$\mathcal M=\prod _i \mathcal M_i$
and
$\mathcal N=\prod _i \mathcal N_j $
is isomorphically coordinate respecting if there is a bijection
$\pi \colon \mathbb {J}\to \mathbb {I}$
such that for all
$j\in \mathbb {J}$
there is an isomorphism
$\varphi _j\colon \mathcal M_{\pi (j)} \to \mathcal N_{j}$
such that
for all
$(a_i)_{i\in \mathbb {I}}$
in
$\mathcal M$
.
A first-order theory T is said to recognize coordinates in products if every isomorphism between products of models of T is isomorphically coordinate respecting.
More generally, if
$\mathfrak C$
is a class of structures of the same language (not necessarily axiomatizable), then
$\mathfrak C$
is said to recognize coordinates if every isomorphism between products of structures from
$\mathfrak C$
is isomorphically coordinate respecting.
We remark that because products are a kind of reduced product, the following theorem holds trivially.
Theorem 8.3. Every class of structures that recognizes coordinates, in particular every class of groups listed in Theorem 2, recognizes coordinates in products.
Recognizing coordinates in products is closely related to the classical Renek–Krull–Schmidt–Azumaya theorem that we now discuss, following [Reference Kurosh42]. In the original context of groups (or groups with operators – that is, groups with additional operations) this theorem asserts that if G is a group which has a (finite) principal series of normal subgroups, then any two decompositions of G into direct products of indecomposable factors are centrally isomorphic ([Reference Kurosh42, p. 120]; see also its strengthening ‘The Fundamental Theorem’ [Reference Kurosh42, p. 114]).Footnote
9
In other words, if
$G=\prod _{i<m} G_i$
has a principal series and
$\Phi \colon \prod _{i<m} G_i\to \prod _{j<n} H_j$
is an isomorphism where all
$G_i$
and all
$H_j$
are indecomposable, then
$m=n$
, there is a bijection
$\pi \colon n\to m$
, and there are isomorphisms
$f_j\colon H_j\to G_{f(j)}$
such that
$\Psi ((a_i)_{i<m}):=(f_j(a_{\pi (j)})_{j<n})) $
defines an isomorphism which satisfies that
$\Phi (a)\Psi (a)^{-1}$
is in
$ Z(G)$
for all
$a\in G$
.
Our requirements on the factor groups are more stringent, since our assumptions on classes of groups in Theorem 2 imply that no nontrivial homomorphism from G into its centre exists. On the other hand, to the best of our knowledge, our result is the first extension of the Renek–Krull–Schmidt–Azumaya theorem to arbitrary infinite products. Along these lines, Azumaya’s theorem (see e.g., [Reference Facchini and Hazewinkel20]) and the results of [Reference Crawley and Jónsson12] are about infinite direct sums of modules and arbitrary algebraic structures, respectively.
It is curious that admitting nontrivial homomorphisms into the centre gives a limiting example in this type of theorem. In [Reference Kurosh42, p. 81] Kurosh gives an example of indecomposable groups A, B, C and D such that
$A\times B\cong C\times D$
but neither A nor B is isomorphic to C or to D. Each one of these groups has the centre isomorphic to
${\mathbb Z}$
(actually, D is isomorphic to
${\mathbb Z}$
) and admits a homomorphism onto
${\mathbb Z}$
. An even more interesting class of examples, showing that even the number of indecomposable factors is not an isomorphism invariant, is given in [Reference Baumslag1].
Remark 8.4. The main theorem of [Reference Bidwell3] records a version of recognizing coordinates with respect to finite products of finite groups. More explicitly, if
$\mathfrak C = \{G_1,\dots ,G_n\}$
is such that
-
(1) For $i \leq n$
, each
$G_i$
is a finite group. -
(2) For $i \leq n$
, each
$G_i$
is indecomposable. -
(3) For $i, j \leq n$
, there does not exist a nontrivial homomorphism from
$G_i$
into the centre of
$G_j$
.
Then the class
$\mathfrak C$
recognizes coordinates with respect to finite products. We remark that if
$\mathfrak C$
is a finite class of finite groups with the properties above, then the proof from [Reference Bidwell3] can be extended to show that any automorphism between direct sums of groups from
$\mathfrak C$
is isomorphically coordinate respecting. A priori, the assumption of finiteness of the groups cannot be removed. At a critical juncture in the proof, one needs to use that any injective homomorphism between groups in
$\mathfrak C$
is surjective.
Finally, we provide an example which demonstrates how the collection of automorphisms in the context of direct sums can appear wildly different from the collection of automorphisms in the context of reduced products.
Example 8.5. Let
$p(n)$
, for
$n\in {\mathbb N}$
, be distinct primes and let
$G_n={\mathbb Z}/p(n){\mathbb Z}$
. Then every automorphism of
$\bigoplus _n G_n$
is trivial, but
$\prod _{ {\mathrm {Fin}}} G_n$
has nontrivial automorphisms (in ZFC).
For the former, note that in
$\bigoplus _n G_n$
an element g has order
$p(j)$
if and only if
$ {\mathrm {supp}}(g)=\{j\}$
. Therefore every automorphism of
$\bigoplus _n G_n$
sends
$G_n$
to itself.
For the latter, since all
$G_n$
are abelian, the structure
$\prod _{ {\mathrm {Fin}}} G_n$
is an abelian group. Its theory is therefore stable and it is saturated by [Reference De Bondt, Farah and Vignati14]. It therefore has
$2^{2^{\aleph _0}}$
automorphisms, while clearly there are only
$2^{\aleph _0}$
trivial automorphisms.
8.3 Rigidity corollaries
As pointed out in the introduction, part of the motivation for this paper comes from the study of rigidity of quotient structures (see [Reference Farah, Ghasemi, Vaccaro and Vignati25] for the current state of the art). We fix a language
${\mathcal L}$
throughout. If
$\mathcal M_i$
, for
$i\in {\mathbb N}$
, is a sequence of
${\mathcal L}$
-structures, then an isomorphism between
$\mathcal M:=\prod _{ {\mathrm {Fin}}} \mathcal M_i$
and
$\mathcal N:=\prod _{ {\mathrm {Fin}}} \mathcal N_i$
is trivial if there are a bijection
$\pi $
between cofinite subsets of
${\mathbb N}$
and isomorphismsFootnote
10
$f_i\colon \mathcal M_{\pi (i)}\to \mathcal N_i$
such that the map from
$\prod _i \mathcal M_i$
to
$\prod _i \mathcal N_i$
defined by
lifts it.
A moment of reflection reveals that every map that has a lifting of this sort is an isomorphism. A bit more work is required to figure out whether every isomorphism has such a lifting. This is reasonably well understood in the case of reduced products of countable (possibly finite) structures over
$ {\mathrm {Fin}}$
, and we concentrate on this case. The Continuum Hypothesis (CH) implies that reduced products of this sort are saturated and are therefore isomorphic if and only if they are elementarily equivalent. In this case, there are
$2^{2^{\aleph _0}}$
isomorphisms. Since there are only
$2^{\aleph _0}$
trivial isomorphisms, CH implies the existence of nontrivial isomorphisms. See [Reference Farah, Ghasemi, Vaccaro and Vignati25, §6] for more on nontrivial isomorphisms. Also note that even the number of automorphisms of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
can be strictly between
$2^{\aleph _0}$
and
$2^{2^{\aleph _0}}$
[Reference Steprāns68].
An automorphism
$\Phi $
of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
is trivial if there is a bijection
$\pi $
of cofinite subsets of
${\mathbb N}$
(such
$\pi $
is called an almost permutation) such that
$X\mapsto \pi [X]$
lifts
$\Phi $
. (If one identifies
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
with the reduced power of the two-element Boolean algebra, then this is a special case of the general definition of a trivial isomorphism.) Thus the group of trivial automorphisms of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
is the quotient of the semigroup of all almost permutations by its subsemigroup of eventually equal almost permutations. By a seminal result of Shelah [Reference Shelah64, §V], it is relatively consistent with ZFC that all automorphisms of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
are trivial.
Theorem 8.6 below uses
$ {\mathrm {MA}}$
and
$ {\mathrm {OCA}}_{\mathrm {T}}$
, consequences of the Proper Forcing Axiom commonly used in proofs of rigidity of quotient structures since the seminal paper [Reference Veličković72]; see [Reference Farah, Ghasemi, Vaccaro and Vignati25, §7.3] for additional background. These axioms are independent of ZFC. Part (1) of the following implies Corollary 3 by Theorem 2.
Theorem 8.6. Assume
$ {\mathrm {OCA}}_{\mathrm {T}}$
and
$ {\mathrm {MA}}$
. Suppose that
$\mathfrak C$
is a class of groups that recognizes coordinates and that
$\mathcal G:=\prod _{ {\mathrm {Fin}}}\mathcal G_i$
and
${\mathcal H}:=\prod _{ {\mathrm {Fin}}}{\mathcal H}_i$
are reduced products of countable or finite structures in
$\mathfrak C$
.
-
(1) Then every isomorphism between $\mathcal G$
and
${\mathcal H}$
is trivial. -
(2) The automorphism group of $\mathcal G$
is the semidirect product of
$\prod _{ {\mathrm {Fin}}} {\mathrm {Aut}}(\mathcal G_i)$
and the group of trivial automorphisms of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
associated with almost permutations
$\pi $
such that
$\mathcal G_i\cong \mathcal G_{\pi (i)}$
for all i.
In particular, if G is any group that recognizes coordinates, then the automorphism group of
$\prod _{ {\mathrm {Fin}}} G$
is isomorphic to the semidirect product of
$\prod _{ {\mathrm {Fin}}} {\mathrm {Aut}}(\mathcal G_i)$
and the group of trivial automorphisms of
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
.
Proof. (1) is an immediate consequence of [Reference De Bondt, Farah and Vignati15, Theorem 7]. The remaining two claims follow.
The following diagonalization argument combined with the Feferman–Vaught theorem and saturation to produce reduced products that are nontrivially isomorphic (and typically, by rigidity results, nonisomorphic if forcing axioms are assumed) is an application of Ghasemi’s trick ([Reference Brian and Farah4, Lemma 4.5], also [Reference Ghasemi30, Lemma 5.2]).
Corollary 8.7. Suppose that
$\mathfrak C$
is an infinite class of groups that recognizes coordinates. Then there are groups
$G_i$
, for
$i\in {\mathbb N}$
, in
$\mathfrak C$
such that for all infinite X and Y in
$\mathcal P({\mathbb N})$
for which
$X\Delta Y$
is infinite, the assertion
$\prod _{ {\mathrm {Fin}}} G_i\restriction X\cong \prod _{ {\mathrm {Fin}}} G_i\restriction Y$
is independent of ZFC.
Proof. Since
$\mathfrak C$
is infinite, we can choose
$G_i$
so that the theories of
$G_i$
converge, in the sense that every sentence
$\varphi $
of the language of the theory of groups either holds in all but finitely many
$G_i$
or holds in only finitely many of the
$G_i$
. Then the Feferman–Vaught theorem implies
$\prod _{ {\mathrm {Fin}}} G_i\restriction X\equiv \prod _{ {\mathrm {Fin}}}G_i$
for all infinite
$X\subseteq {\mathbb N}$
. Thus CH implies that
$\prod _{ {\mathrm {Fin}}}G_i\cong \prod _{ {\mathrm {Fin}}}G_i\restriction X$
, as these are elementarily equivalent saturated models.
On the other hand, since
$\mathfrak C$
recognizes coordinates, by Theorem 8.6,
$ {\mathrm {OCA}}_{\mathrm {T}}$
and
$ {\mathrm {MA}}$
imply that every isomorphism between
$\prod _{ {\mathrm {Fin}}}\mathcal G_i\restriction X$
and
$\prod _{ {\mathrm {Fin}}} \mathcal G_i\restriction Y$
is associated with an almost bijection
$\pi \colon X\to Y$
such that
$\mathcal G_i\cong \mathcal G_{\pi (i)}$
for all
$i\in {\mathrm {dom}}(\pi )$
. Since
$\mathcal G_i\not \cong \mathcal G_j$
for all
$i\neq j$
, such
$\pi $
exists if and only if
$X\Delta Y$
is finite.
There is no known ‘dividing line’ for theories that recognize coordinates, and our results from §7.1 suggest that the line, even if it exists, is rather rugged. By [Reference De Bondt, Farah and Vignati14, Theorem 1], if the theory of a reduced product
$\mathcal M$
over
$ {\mathrm {Fin}}$
is stable and all
$\mathcal M_i$
have cardinality not greater than
$2^{\aleph _0}$
, then
$\mathcal M$
is fully saturated and therefore has
$2^{2^{\aleph _0}}$
automorphisms. The class of stable groups that are reduced products is not very interesting – all such groups are abelian.
Proposition 8.8. Suppose that
$\mathcal P({\mathbb N})/{\mathcal I}$
is an atomless Boolean algebra and
$\prod _{\mathcal I} G_n$
is stable, or even NIP. Then the set
$\{n\mid G_n$
is not abelian
$\}$
belongs to
${\mathcal I}$
.
Proof. Assume otherwise and consider the formula
$\varphi (x,y)$
, ‘
$xy=yx$
’. In each
$G_n$
there are
$a_n$
and
$b_n$
such that
$\varphi (G_n,a_n)$
and
$\varphi (G_n,b_n)$
are distinct and have nonempty intersection (it contains
$e_n$
). By [Reference De Bondt, Farah and Vignati14, Theorem 2.10 (3)], the theory of G is not stable.
It is not difficult to see that stability is not a necessary condition for the existence of
$2^{2^{\aleph _0}}$
nontrivial automorphisms of a reduced product over
$ {\mathrm {Fin}}$
. We even have a natural example. By Corollary 7.8 and Corollary 7.9, the reduced power of the quaternion group
$Q_8$
has
$2^{2^{\aleph _0}}$
automorphisms in ZFC although
$\mathcal P({\mathbb N})/ {\mathrm {Fin}}$
is interpretable in it (and in particular its theory is unstable). As the referee pointed out, an even more natural example can be obtained as follows. If G is a group that recognizes coordinates (e.g., any nonabelian simple group) and H is a nontrivial abelian group, then the reduced product of
$G\oplus H$
is isomorphic to the direct sum of reduced products of G and of H, and it has
$2^{\aleph _0}$
automorphisms because the second component does. On the other hand, the theory of the first component is not stable.
8.4 Continuous logic
This paper is concerned with recognizing coordinates in classical, discrete logic. We conclude with a few words on the study of recognizing coordinates in the setting of continuous logic. A metric analogue of [Reference De Bondt, Farah and Vignati15, Theorem 7] was proved in [Reference De Bondt and Vignati17]. It asserts that the usual forcing axioms imply that coordinate-respecting functions between reduced products of separable metric structures are trivial. This result, together with the usual forcing axioms, was applied in [Reference De Bondt and Thom16] and in [Reference Vignati74] to prove rigidity results analogous to those of §8.3 for universal sofic groups and Higson coronas, respectively.
Problem 8.9. State and prove the analogue of Theorem 1 for continuous logic.
Solving this problem would require the analogue of Palyutin’s theory of h-formulas in continuous logic, developed in [Reference Fronteau26].
8.5 Questions
We conclude this paper with a few open problems. The first batch is concerned with possible weak converses to Theorem 5.1 (see also §7.2 for related limiting examples).
Question 8.10. Does the class of all indecomposable groups with trivial centre recognize coordinates?
Question 8.11. Suppose that G is a group with any of the following properties. Can one conclude that it recognizes coordinates?
-
(1) G is indecomposable with trivial centre.
-
(2) G is indecomposable and finite, with trivial centre.
-
(3) G is indecomposable and finite and it does not admit a nontrivial homomorphism into its centre.
As pointed out earlier, Forte Shinko proved that the unrestricted wreath product
$ {\mathbb Z}\wr \mathbb Q$
(i.e., the semidirect product of
${\mathbb Z}^{\mathbb Q}$
and
$\mathbb Q$
) is an indecomposable group that admits no nontrivial homomorphism into its centre, but its ultrapower does.
There are two different sources of coordinate recognition in groups, one given by the two parts of Theorem 4.3 and the other given by Proposition 4.5. Each one of these sources comes in infinitely many varieties, the first indexed by prime numbers and 0 (the latter case corresponding to the domains, as in Corollary 4.4) and the other indexed by a ‘length’ (typically a commutator length, but see also the proof of Proposition 4.15).
Question 8.12. Is there a class of groups that recognizes coordinates for a reason not covered by the results described in the previous paragraph?
Theorem 1 implies that if the answer to Question 8.12 is positive, then the reason for coordinate recognition has to be coded by an h-formula.
Acknowledgements
We are grateful to Patrick Lutz for pointing out the relevance of
$ {\mathrm {SL}}(2,5)$
(see §4.3) and to Forte Shinko for his useful comment on the case
$n=6$
of Theorem 4.6(b), and for answering some questions in a preliminary draft of our paper. We thank the anonymous referee for making numerous suggestions that helped improve the paper. We also thank Marcus Greferath for finding and correcting several errors in an earlier version of this article. We are grateful to Montserrat Casals-Ruiz for pointing out to us the relevance of domains (in the sense of [Reference Baumslag, Myasnikov and Remeslennikov2]) to our results. This remark substantially increased the class of known groups that recognize coordinates (see Corollary 4.4 and Theorem 4.16). We are also indebted to the organizers of the 2026 Beijing Model Theory conference for providing a pleasant and stimulating environment in which this interaction took place. In the proof of Theorem 7.1, Grok by xAI was used to verify the well-known fact that for every abelian group G there is a nontrivial homomorphism from G into
$\mathbb Q/{\mathbb Z}$
.
Competing interests
The authors declare that they have no competing interests.
Data availability statement
Data sharing is not applicable to this article, as no datasets were generated or analysed during the current study.
Funding statement
IF was partially supported by NSERC. KG was supported by the Fundamental Research Funds for the Central Universities, Peking University, grant no. 7100604835 and by the National Natural Science Fund of China, grant no. 12501001.