Abstract
A group \(A\) acting faithfully on a set \(X\) is \(2\)distinguishable if there is a \(2\)coloring of \(X\) that is not preserved by any nonidentity element of \(A\), equivalently, if there is a proper subset of \(X\) with trivial setwise stabilizer. The motion of an element \(a \in A\) is the number of points of \(X\) that are moved by \(a\), and the motion of the group \(A\) is the minimal motion of its nonidentity elements. When \(A\) is finite, the Motion Lemma says that if the motion of \(A\) is large enough (specifically at least \(2\log _2 A\)), then the action is \(2\)distinguishable. For many situations where \(X\) has a combinatorial or algebraic structure, the Motion Lemma implies that the action of \(\mathrm{Aut }(X)\) on \(X\) is 2distinguishable in all but finitely many instances. We prove an infinitary version of the Motion Lemma for countably infinite permutation groups, which states that infinite motion is large enough to guarantee \(2\)distinguishability. From this, we deduce a number of results, including the fact that every locally finite, connected graph whose automorphism group is countably infinite is \(2\)distinguishable. One cannot extend the Motion Lemma to uncountable permutation groups, but nonetheless we prove that (under the permutation topology) every closed permutation group with infinite motion has a dense subgroup which is \(2\)distinguishable. We conjecture an extension of the Motion Lemma which we expect holds for a restricted class of uncountable permutation groups, and we conclude with a list of open questions. The consequences of our results are drawn for orbit equivalence of infinite permutation groups.
Introduction
The distinguishing number \(\mathrm{D }(A,X)\) of a group \(A\) acting faithfully on a set \(X\) is the least cardinal number \(d\) such that \(X\) has a labeling with \(d\) labels that is preserved only by the identity of \(A\). Distinguishability was introduced in [2]; subsequently a large number of papers have been written on this subject (see for example [13, 17, 24, 26] and compare [3] for related results). We are mostly interested in cases where \(D(A,X)\le 2\), which means that some proper subset of \(X\) has trivial setwise stabilizer in \(A\) (or, equivalently, that there is a regular orbit in the action of \(A\) on the subsets of \(X\)).
Distinguishability shares much with the notion of orbitequivalence. Two permutation groups \(A, B \le \mathrm{Sym }(X)\) are orbitequivalent if they have the same orbits on the set of finite subsets of \(X\) (see [3] for example); \(A\) and \(B\) are strongly orbitequivalent if they have the same orbits on the entire power set \(2^X\). Note that if \(A\) is \(2\)distinguishable, then it cannot be strongly orbitequivalent to any proper subgroup of \(A\) (see the proof of Corollary 3.9); in this way, a \(2\)distinguishable permutation group is minimal with respect to strong orbitequivalence.
In many contexts, when the underlying set \(X\) is finite, all but finitely many group actions have distinguishing number \(2\). This is true for automorphism groups of finite maps ([25]), for finite vector spaces ([14]), for groups ([7]), for iterated Cartesian products of a graph ([1, 12, 15]), for transitive permutation groups having a base (a set whose pointwise stabilizer is trivial) of bounded size ([4, 7]), and for primitive permutation groups \(G\) of degree \(n \in {\mathbb {N}}\) with the alternating group \(A_n \not \le G\) ([4, 23]).
Underpinning all but the last of these results is the Motion Lemma of Russell and Sundaram ([22]). The motion of a permutation \(a \in A\) (also called its degree) is the number of elements in \(X\) that are not fixed by \(a\), and the motion of \(A\) is the infimum of the motion of its nonidentity elements (often called the minimal degree of \(A\)). The Motion Lemma states that if the motion of \(A\) is large enough relative to the size of \(A\), then \(\mathrm{D }(A,X)=2\).
In this paper, we explore the extent to which infinite motion affects the distinguishing number of infinite permutation groups. Throughout, \(A\) denotes a group of permutations of a countably infinite set \(X\). We prove an infinitary version of the Motion Lemma for countable permutation groups (Lemma 3.3), and use it to extend many of the results in [7]. We also prove that a countably infinite permutation group \(A \le \mathrm{Sym }(X)\) that is closed in the permutation topology (see Sect. 2) has distinguishing number \(2\) whenever all orbits of pointstabilizers are finite (Theorem 3.6). From this, we obtain the surprising result that any connected, locally finite graph whose automorphism group is countably infinite has distinguishing number \(2\) (Corollary 3.8). Theorem 3.6 has an interesting corollary for orbitequivalence: suppose \(A\) is an infinite, subdegreefinite, closed permutation group; if \(A < 2^{\aleph _0}\), then \(A\) is not strongly orbitequivalent to any of its proper subgroups (Corollary 3.9).
Extending the Motion Lemma to uncountable permutation groups fails, as there exist uncountable permutation groups with infinite motion and infinite distinguishing number (see Sect. 4). Instead, we prove a density result, which states that every group \(A \le \mathrm{Sym }(X)\) with infinite motion is the closure (in the permutation topology) of a \(2\)distinguishable group with infinite motion (Theorem 4.4). This complements the recent paper of F. Lehner ([18]), in which it is shown that for a random 2coloring of a locally finite graph \(G\), the stabilizer (in \(\mathrm{Aut }G\)) of the coloring is almost surely nowhere dense in \(\mathrm{Aut }G\). Again our result has a natural consequence for orbitequivalence (Corollary 4.5).
We conjecture that any closed group \(A \le \mathrm{Sym }(X)\) with infinite motion is \(2\)distinguishable whenever all orbits of its pointstabilizers are finite (see The Infinite Motion Conjecture for Permutation Groups in Sect. 4); this is an extension of a conjecture first made in [25]. In the process of trying to prove this conjecture, a number of interesting questions have arisen, which we detail in Sect. 5.
Preliminaries
We write \((A, X)\) to denote a group \(A\) acting on a set \(X\). Since all actions in this paper are faithful, we consider \(A\) to be a subgroup of the symmetric group \(\mathrm{Sym }(X)\). The group \(A\) is subdegreefinite if for all \(x\in X\), all orbits of the pointstabilizer \(A_x\) in its action on \(X\) are finite. Notice that if a graph is connected and locally finite, then its automorphism group must be subdegreefinite. We follow the convention that a set \(X\) is countable if \(X\le \aleph _0\) and say that \(X\) is countably infinite if \(X\) is both countable and infinite.
For a given coloring of \(X\) and a group \(A\le \mathrm{Sym }(X)\), we say that \(a\in A\) preserves the coloring if \(ax\) and \(x\) have the same color for all \(x\in X\). The support of an element \(a\in A\), denoted \(\mathrm{supp }(a)\), is the set \(\{x \in X : ax \not = x\}\); we call \(m(a):=\mathrm{supp }(a)\) the motion of \(a\). The motion of the group \(A\) is \(m(A):=\min \{m(a): a\in A\setminus \{1\}\}\). A group is said to have infinite motion if \(m(A)\) is any infinite cardinal. A base of \((A, X)\) is a subset \(Y\) of \(X\) whose pointwise stabilizer \(A_{(Y)}:= \bigcap \{A_y:y\in Y\}\) is trivial. If \(G\) is a graph, then \(m(G):=m(\mathrm{Aut }(G))\), where \(\mathrm{Aut }(G)\) is acting on the vertex set \(VG\) of \(G\).
The following lemma is a useful tool for analyzing the action of infinite, subdegreefinite permutation groups. Our proof assumes the Axiom of Countable Choice.
Lemma 2.1
Let \(A\le \mathrm{Sym }(X)\), and suppose that \(A\) is subdegreefinite and has an infinite orbit. For any finite subsets \(Y, Z\) of \(X\), there exists an element \(a\in A\) such that \(Y\cap aZ=\emptyset \)
Proof
Suppose \(x \in X\) lies in an infinite orbit of \(A\). Then there exists an infinite sequence \(S=\{a_i \in A : i \in {\mathbb {N}}\} \subseteq A\) such that \(a_i^{1} x = a_j^{1} x\) if and only if \(i = j\). Suppose there exist finite subsets \(Y\) and \(Z\) of \(X\) such that \(Y \cap a_i Z\ne \emptyset \) for infinitely many \(i\in {\mathbb {N}}\). Then there exist \(y \in Y\) and \(z \in Z\) and an infinite subsequence \(\{a_{i_j} : j \in {\mathbb {N}}\} \subseteq S\) such that \(a_{i_j}z = y\). For each \(j\in {\mathbb {N}}\) define \(b_j := a_{i_1}a_{i_j}^{1}\), and notice that \(b_j\) belongs to the stabilizer \(A_y\). However, \(b_j x = b_k x\) if and only if \(j=k\), and so \(A_y\) has an infinite orbit, a contradiction.\(\square \)
Since \(X\) is countably infinite, there is a natural topology on \(\mathrm{Sym }(X)\) called the permutation topology. The family of open sets in this topology is generated by the cosets of pointstabilizers of finite subsets of \(X\). Thus, a sequence of permutations \(\{a_i : i \in {\mathbb {N}}\} \subseteq \mathrm{Sym }(X)\) converges to a permutation \(a \in \mathrm{Sym }(X)\) if and only if for every finite set \(Y\) there exists \(n \in {\mathbb {N}}\) such that for all \(i \ge n\), the permutation \(a^{1} a_i\) fixes \(Y\) pointwise.
Given a subgroup \(A \le \mathrm{Sym }(X)\), it is not hard to imagine how a sequence of permutations \(\{a_i : i \in {\mathbb {N}}\}\) which all lie in \(A\) might converge to some other permutation \(a\); but this limit may not itself lie in \(A\). When studying infinite permutation groups, it is usually necessary to consider separately groups that contain all their limit points and those that do not, as their behavior can be surprisingly different.
A subgroup \(A \le \mathrm{Sym }(X)\) is closed if it is closed in this topology, and for \(B \le A\) the closure of \(B\) in \(A\), denoted \(\mathrm{cl }_A(B)\), consists of those elements \(a\in A\) such that, for any finite subset \(Y\subset X\), there exists some \(b\in B\) such that \(ay=by\) for all \(y\in Y\). It is straightforward to show that \(\mathrm{cl }_A(B)\) is itself a group. Thus, \(B \le \mathrm{cl }_A(B) \le A\). If \(A=\mathrm{Sym }(X)\), we denote the closure of \(B\) simply by \(\mathrm{cl }(B)\). Notice that a group and its closure have the same orbits on the finite subsets of \(X\).
If \(G\) is a graph with countable vertex set \(X\), then it is easily seen that \(\mathrm{Aut }(G)\) is a closed subgroup of \(\mathrm{Sym }(X)\) (see the proof of Corollary 3.7). This is a particular case of the following wellknown result: a permutation group \(A \le \mathrm{Sym }(X)\) is closed if and only if it is the (full) automorphism group of a (finitary) relational structure on \(X\) (see [5, pp. 26–28]). To see why this is true, consider the relational structure \(U\) consisting of the set \(X\) together with some relations: for each \(n \in {\mathbb {N}}\), each orbit of \(A\) on the \(n\)tuples of \(X\) is taken to be an \(n\)ary relation in \(U\). If \(A = \mathrm{Aut }(U)\), then \(A\) is clearly closed. Conversely, if \(A \le \mathrm{Aut }(U)\) is closed and \(\sigma \in \mathrm{Aut }(U)\), then there exists a sequence in \(A\) which converges to \(\sigma \), so \(\sigma \in A\) and hence \(A = \mathrm{Aut }(U)\).
Motion and countable groups
In this section, we consider how motion affects the distinguishability of countable permutation groups.
The distinguishing number of a permutation group \((A, X)\) can be easily influenced by local phenomena. For example, adjoining a copy of \(K_n\) to an \(m\)distinguishable graph \(G\) (where \(n>m+1\)) by identifying a vertex in \(K_n\) with a vertex in \(G\) increases the distinguishing number from \(m\) to at least \(n1\). One consequence of large motion is to suppress such local effects. In [22], Russell and Sundaram exploit this property, giving a probabilistic proof of their influential Motion Lemma for finite group actions. We now present an alternative combinatorial argument.
Lemma 3.1
(Motion Lemma [22]) Given a nontrivial group \(A\) acting faithfully on the finite set \(X\), if \(m(A)\ge 2\log _2A\), then \(\mathrm{D }(A,X)=2\).
Proof
Let \(n=X\) and let \(m=m(A)\). For any nonidentity permutation \(a\in A\), if \(a\) preserves some coloring, then all elements of \(X\) in the same cycle must be assigned the same color. Therefore, the number of 2colorings preserved by \(a\) is \(2^c\), where \(c\) is the number of cycles of \(a\) in \(X\). There are \(nm(a)\) singleton cycles, and \(\mathrm{supp }(a)\) decomposes into at most \(m(a)/2\) other cycles, giving
Thus, the total number of colorings preserved by at least one nonidentity element of \(A\) is at most \((A1)2^{nm/2}\). If \(2^{m/2}>A1\), then the total number of such colorings is less than the total number \(2^n\) of 2colorings. We have shown that if \(2^m\ge A^2\), then \(\mathrm{D }(A,X)=2\).\(\square \)
Since any given 2coloring is likely to be preserved by more than one nonidentity element of \(A\), there is a great deal of overcounting in this proof; it is possible to obtain sharper results when additional conditions are placed on \((A, X)\). However, in many contexts, the above lemma suffices.
Recall that a Frobenius group is a nonregular transitive permutation group in which only the identity fixes two points (and hence every 2subset is a base).
Proposition 3.2
([7]) In each of the following cases, all but finitely many instances of group actions (A,X) have distinguishing number 2.

(i)
\(X\) is a finite group and \(A=\mathrm{Aut }(X)\);

(ii)
\(X\) is a finite vector space and \(A=\mathrm{Aut }(X)\);

(iii)
\(A\) is a finite transitive permutation group having a base of given size;

(iv)
\(X\) is the vertex set of a finite map \(M\) and \(A=\mathrm{Aut }(M)\);

(v)
\(A\) is a finite transitive permutation group with a cyclic pointstabilizer;

(vi)
\(A\) is a finite Frobenius group.
Each proof in [7] is a direct application of the Motion Lemma. However, one must not presume that elementary applications of the Motion Lemma are always sufficiently powerful to determine the distinguishing number of any class of finite groups. For example, it is known that all but finitely many finite primitive permutation groups that are neither symmetric nor alternating have distinguishing number 2 (see [4]). The proof of this result depends upon the Classification of the Finite Simple Groups. We know of no obvious way to utilize motion to obtain a proof that avoids the Classification.
The Motion Lemma tells us that if a group \(A\) acts with sufficiently large motion on a finite set \(X\), then \((A, X)\) must be 2distinguishable. If one now considers the situation in which \(X\) is infinite, one might guess that infinite motion is “sufficiently large” to ensure \(D(A, X) = 2\). For countably infinite groups, this guess is correct (Lemma 3.3), but as will be seen in Sect. 4, this is not true for groups with larger cardinality.
Lemma 3.3
Let \(A\le \mathrm{Sym }(X)\), where both \(A\) and \(X\) are countably infinite. If \(A\) has infinite motion, then \(\mathrm{D }(A,X)=2\).
Proof
Enumerate the set \(X\) as \(\{x_i: i \in {\mathbb {N}}\}\), and the elements of \(A\) as \(\{a_i: i\in {\mathbb {N}}\cup \{0\}\}\), with \(a_0\) being the identity. Let \(m\) be the least natural number such that \(x_m \in \mathrm{supp }(a_1)\), and define \(y_1 := x_m\). Proceeding inductively, suppose we know \(y_1, \ldots , y_n\) for some \(n \in {\mathbb {N}}\), and write \(Z_{n} := \bigcup _{j=0}^{n+1} a_j^{\pm 1} \{y_1, \ldots , y_n\}\). Define \(y_{n+1}:=x_m\) where \(m\) is now the least natural number such that \(x_m \in \mathrm{supp }(a_{n+1}) \setminus Z_n\). Such a natural number \(m\) always exists because \(\mathrm{supp }(a_{n+1})\) is infinite. The sets \(Y:=\{y_n : n \in {\mathbb {N}}\}\) and \(Y':=\{a_n y_n: n \in {\mathbb {N}}\}\) are disjoint subsets of \(X\), and every nonidentity element in \(A\) moves an element in \(Y\) to an element in \(Y'\). Thus, coloring the elements of \(Y\) black and the elements of \(X \setminus Y\) white describes a distinguishing coloring of \((A, X)\).\(\square \)
Using this lemma, we obtain the following infinitary version of Proposition 3.2.
Theorem 3.4
In each of the following cases, the group action \((A,X)\) is \(2\) distinguishable:

(i)
\(X\) is a finitely generated, infinite group and \(A=\mathrm{Aut }(X)\);

(ii)
([6, Theorem 3.1]) \(X\) is a finitedimensional vector space over any infinite field \(\mathfrak {K}\), and \(A=\mathrm{Aut }(X)\) (i.e., the general linear group on \(X\));

(iii)
\(X\) is countable and \(A\) is an infinite, subdegreefinite permutation group having a finite base;

(iv)
\(X\) is the vertex set of a locally finite, connected map \(M\) that contains a vertex with valence at least 3, and \(A=\mathrm{Aut }(M)\) is infinite;

(v)
\(X\) is countable and \(A\) is an infinite, transitive, subdegreefinite permutation group with a cyclic pointstabilizer;

(vi)
\(X\) is countable and \(A\) is an infinite subdegreefinite Frobenius group.
Proof

(i)
Let \(S\) be any finite generating set for \(X\). Then \(X\) is countably infinite because only finitely many words of any given finite length can be formed from \(S\). Since an automorphism of \(X\) is determined by its action on \(S\), the group \(A\) is countable. Each nonidentity element of \(A\) has infinite motion, because the set of elements of \(X\) fixed by any nonidentity automorphism is a proper subgroup of \(X\) and hence has an infinite complement. If \(A\) is finite but nontrivial, then \(D(A, X) = 2\) by Lemma 3.1, while if \(A\) is countably infinite, then \(D(A, X) = 2\) by Lemma 3.3.

(ii)
Since the set of fixed points of any nonidentity element of \(A\) forms a proper subspace of \(X\), we infer that \(m(A)\) is infinite. If \(\mathfrak {K}\) is countably infinite, then so is \(A\), and the result follows by Lemma 3.3. However, we present an argument that holds for a field of arbitrary cardinality. Let \(\{u_1,\ldots , u_n\}\) be an ordered basis for \(X\). There exists an element \(c\in \mathfrak {K}\) whose multiplicative order is strictly greater than \(2n\), because \(\mathfrak {K}\) is infinite while there are only finitely many solutions \(x\) to the equation \(x^m=1\) for \(0\le m\le 2n\). Let \(Y=\{ c^iu_j : 0\le i <j \le n\}\). Since the 1dimensional subspace \(\langle u_j\rangle \) contains exactly \(j\) elements of \(Y\), any linear transformation \(a\) that stabilizes \(Y\) setwise must, for each \(j\), fix \(\langle u_j \rangle \) and permute the vectors in \(\{c^iu_j : 0 \le i < j\}\). Since \(c\) has order strictly greater than \(2n\), the only possibility is that \(a\) fixes each basis element \(u_i\). Hence \(a\) is the identity transformation.

(iii)
Suppose \(Y \subset X\) is a finite base for \(A\); that is, the pointwise stabilizer \(A_{(Y)}\) is trivial. Since \(X\) is countable and \(Y\) is finite, there are countably many images of \(Y\) in the set \(AY=\{aY:a\in A\}\). But \(A = A : A_{(Y)} = AY\), and so \(A\) is countably infinite. Because \(AY\) is infinite and \(Y\) is finite, \(A\) has an infinite orbit \(Ay\) for some \(y\in Y\). Let \(b\) be any nonidentity element of \(A\) and suppose that \(Z=\mathrm{supp }(b)\) is finite. Then by Lemma 2.1, for some \(a\in A\), we have \(aZ\cap Y=\emptyset \). But then \(aba^{1}\) has support disjoint from \(Y,\) and hence fixes \(Y\) pointwise. However, \(aba^{1}\ne 1\), a contradiction since \(Y\) is a base. Hence \(A\) has infinite motion. Since \(A\) is also countably infinite, \(\mathrm{D }(A,X)=2\) by Lemma 3.3.

(iv)
A wellknown property of maps (see [10, Lemma 3.1] or [25, Proposition 2.3], for example) is that if a vertex \(x\) has valence at least 3, then \(x\) has neighbors \(y,z\) such that \(\{x,y,z\}\) has trivial pointwise stabilizer (these three vertices define a “corner” of a face). Thus, \(A\) has a finite base, and so \(\mathrm{D }(A,X)\le 2\) by part (iii) above.

(v)
Clearly, \(A\) is countable. Suppose there exists \(a \in A\) with \(Y:=\mathrm{supp }(a)\) finite. For \(x \not \in Y\), we have \(a \in A_x\). Since A is transitive, it has an infinite orbit, so by Lemma 2.1, there exists \(b\in A\) with \(bY \cap (Y \cup \{x\})= \emptyset \). Then \(\langle a, bab^{1} \rangle \) is a noncyclic subgroup of \(A_x\), a contradiction. We conclude that A has infinite motion and \(\mathrm{D }\)(A,X)=2.

(vi)
By definition, \(A\) is an infinite subdegreefinite permutation group having a base of size \(2\), and so \(\mathrm{D }(A,X)=2\) by part (iii).\(\square \)
Notice that very little about the \(2\)distinguishability of \((A, X)\) can be deduced from only the existence or nonexistence of a finite base for \((A, X)\). There are examples of \(2\)distinguishable groups with no finite base (e.g., \(T\) is an infinite, locally finite, homogeneous tree, and \(X = VT\) with \(A = \mathrm{Aut }(T)\)). There are also examples of infinite groups with a finite base that are not \(2\)distinguishable (e.g., the disjoint union \(G\) of a complete graph \(K_n\) and a double ray has a base of size \(n+3\) and distinguishing number \(n\); if one prefers a connected example, just add an extra vertex adjacent to all vertices of \(G\)).
The following result of Evans ([9]) is traceable independently to Kueker ([16, Theorem 2.1]) and Reyes ([21, Theorem 2.2.2]). It is independent of the Continuum Hypothesis.
Theorem 3.5
([9, Theorem 1.1]) Suppose \(X\) is a countably infinite set. If \(A\) and \(B\) are closed subgroups of \(\mathrm{Sym }(X)\) and \(B \le A\), then either \(A:B = 2^{\aleph _0}\) or \(B\) contains the pointwise stabilizer in \(A\) of some finite subset of \(X\). \(\square \)
Using this theorem, one can often determine the distinguishing number of countably infinite permutation groups without explicitly requiring them to have infinite motion.
Theorem 3.6
Let \(A\) be a closed permutation group on a countably infinite set \(X\) such that \(\aleph _0\le A<2^{\aleph _0}\). Then the following two statements hold and are independent of the Continuum Hypothesis.

(i)
\(A=\aleph _0\) and \(A\) has a finite base and finite distinguishing number.

(ii)
If \(A\) is subdegreefinite, then \((A,X)\) has infinite motion and \(D(A,X)=2\).
Proof

(i)
Let \(B:=\langle 1\rangle \), which is obviously closed in \(A\). Then Theorem 3.5 implies that \(A\) has a finite base \(Y\). Thus, \(D(A,X)\le Y<\aleph _0\) and \(A\) is countable.

(ii)
Suppose that \(A\) is subdegreefinite. By part (i), \(A\) is countable and has a finite base, and so we may apply Theorem 3.4 (iii) to deduce that \(D(A,X)=2\). That \(A\) has infinite motion follows from the proof of Theorem 3.4 (iii).\(\square \)
This theorem yields two corollaries describing the distinguishing number of graphs with countable automorphism group.
Corollary 3.7
Suppose \(G\) is a graph whose vertex set is countably infinite. If \(\aleph _0 \le \mathrm{Aut }(G) < 2^{\aleph _0}\), then \(\mathrm{Aut }(G)\) is closed and has a finite base, \(\mathrm{Aut }(G) = \aleph _0\) holds, and \(\mathrm{D }(G)\) is finite. This statement is independent of the Continuum Hypothesis.
Proof
As remarked previously, \(\mathrm{Aut }(G)\) is a closed permutation group. To see this, suppose that \(\{ a_i : i \in {\mathbb {N}}\} \subseteq \mathrm{Aut }(G)\) is a sequence that converges to some \(a \in \mathrm{Sym }(VG)\). Given any adjacent vertices \(x,y\in VG\), for all sufficiently large \(i\), the image of \(\{x,y\}\) under both \(a\) and \(a_i\) is the same; in particular, the image of the edge \(xy\) under \(a\) is an edge in \(G\). A similar argument shows that the image of any nonedge (under \(a\)) is a nonedge in \(G\). Hence \(a \in \mathrm{Aut }(G)\). The corollary follows immediately from Theorem 3.6.\(\square \)
Corollary 3.8
Let \(G\) be a locally finite, connected graph such that \(\aleph _0 \le \mathrm{Aut }(G) < 2^{\aleph _0}\). Then \(\mathrm{Aut }(G)\) has a finite base, \(\mathrm{Aut }(G) = \aleph _0\), \(m(G) = \aleph _0\), and \(\mathrm{D }(G)=2\). This holds independently of the Continuum Hypothesis.
Proof
Suppose \(G\) is a connected, locally finite graph and \(x \in VG\). Each sphere of radius \(n \in {\mathbb {N}}\) centered at \(x\) is finite and every vertex lies in one of these \(n\)spheres. Each orbit of the stabilizer \(\mathrm{Aut }(G)_x\) is a subset of some \(n\)sphere centered at \(x\), and is therefore finite. Thus, \(\mathrm{Aut }(G)\) is subdegreefinite and closed, and the corollary follows from Theorem 3.6.\(\square \)
Corollary 3.8 also follows from the elegant result of R. Halin ([11, Theorem 6]) that the automorphism group of a locally finite connected graph is uncountable if and only if it has no finite base.
For orbitequivalence, Theorem 3.6 implies the following.
Corollary 3.9
Suppose that \(A\) is an infinite subdegreefinite, closed permutation group. If \(A\) is strongly orbitequivalent to some proper subgroup, then \(A = 2^{\aleph _0}\).
Proof
Suppose that \(\aleph _0\le A<2^{\aleph _0}\) and that \(B < A\) with \(A\) and \(B\) strongly orbitequivalent. Because \(A\) is \(2\)distinguishable (by Theorem 3.6), there exists a set \(Y \subseteq X\) whose setwise stabilizer \(A_{\{Y\}}\) is trivial. If \(a \in A\), then there exists \(b \in B\) such that \(aY = bY\), because \(A\) and \(B\) are strongly orbitequivalent. Hence \(a^{1}b \in A_{\{Y\}}\) and so \(a = b\). Thus, \(A\subseteq B\), a contradiction.\(\square \)
Notice that subdegreefinite permutation groups are locally compact subgroups of \(\mathrm{Sym }(X)\). The authors of [20] conjectured that if \(X\) is countably infinite and \(A, B \le \mathrm{Sym }(X)\) are strongly orbitequivalent and closed, then \(A = B\). They comment that even knowing whether this is true for locally compact groups would be interesting. The above corollary establishes this conjecture for subdegreefinite countable groups when \(B\) is a subgroup of \(A\).
Corollary 3.10
Let \(A\) be an infinite, closed, subdegreefinite permutation group on a countably infinite set \(X\). If all pointstabilizers in \(A\) are countable, then they are all finite and \(D(A, X) = 2\).
Proof
Since \(A\) is infinite and closed, \(X\) is countably infinite, and all pointstabilizers in \(A\) are countable, it follows that \(A\) is countably infinite, in which case Theorem 3.6 (i) applies. That is, \(A\) has a finite base \(Y\). If additionally \(A\) is subdegreefinite, then \(D(A,X)=2\) by Theorem 3.6 (ii). Finally, \(A_x\) is finite for all \(x\in X\), since orbits of elements of \(Y\) under any pointstabilizer \(A_x\) are finite.\(\square \)
Motion and uncountable groups
Lemma 3.3 and its consequences are extensions to countable groups of Russell and Sundaram’s Motion Lemma. One might be tempted to try to extend this lemma to groups of still higher cardinality: If \(A\) is a group of permutations having infinite motion on a countably infinite set \(X\), then \(D(A, X) = 2\). However, without further conditions, this statement is false: the group \(\mathrm{Aut }({\mathbb {Q}}, <)\) consisting of all permutations that preserve the usual ordering \(<\) has infinite motion on \({\mathbb {Q}}\) and is known to have distinguishing number \(\aleph _0\) ([17]). Note that \(\mathrm{Aut }({\mathbb {Q}}, <)\) is the automorphism group of the directed graph on \({\mathbb {Q}}\) wherein an edge is directed from \(x\) to \(y\) if and only if \(x<y\); it is therefore easily seen to be closed and not subdegreefinite. The only examples we have that show that Lemma 3.3 cannot be extended to groups of higher cardinality are not subdegreefinite. For this reason, we propose the following conjecture.
The Infinite Motion Conjecture for Permutation Groups. If \(A\) is a closed, subdegreefinite permutation group with infinite motion on a countably infinite set \(X\), then \(\mathrm{D }(A,X)=2\).
Since automorphism groups of connected, locally finite graphs are closed and subdegreefinite, the above conjecture implies the following conjecture, originally posed in [25].
The Infinite Motion Conjecture for Graphs. If \(G\) is an infinite, locally finite, connected graph and if \(\mathrm{Aut }(G)\) has infinite motion, then \(\mathrm{D }(G)=2\).
The local finiteness of a graph \(G\) implies the subdegreefiniteness of \(\mathrm{Aut }(G)\), but the converse obviously does not hold. Hence the question arises whether local finiteness is needed in the above conjecture. After all, the examples of the homogeneous infinite tree of countable valence and the Rado graph, both of which are connected, nonlocally finite, 2distinguishable infinite graphs with infinite motion (see [13, 26] and [13], respectively), support the impression that this condition is superfluous. Nonetheless, local finiteness is needed: F. Lehner and R. G. Möller^{Footnote 1} have given examples of connected, countable, nonlocally finite graphs \(G\), some of them vertextransitive, with infinite motion and infinite distinguishing number.
The Infinite Motion Conjecture for Graphs has been studied in the context of growth. For example, a graph with linear growth and infinite motion is \(2\)distinguishable. In fact, the Infinite Motion Conjecture is known to hold for locally finite graphs with superlinear but subquadratic growth [8]. Further refinements of these methods show that the conjecture holds for locally finite graphs with superpolynomial but subexponential growth [19].
The Infinite Motion Conjecture for Graphs may fail for graphs of larger cardinality. For example, consider the star \(S_{{\varvec{\mathfrak {n}}}}\) which, for some cardinal number \({\varvec{\mathfrak {n}}}>2^{\aleph _0}\), consists of \({\varvec{\mathfrak {n}}}\) rays emanating from a single common vertex. Then \(\mathrm{Aut }(S_{{\varvec{\mathfrak {n}}}})\) has infinite motion, but \(\mathrm{D }(S_{{\varvec{\mathfrak {n}}}})> 2\), because for any 2coloring of \(S_{{\varvec{\mathfrak {n}}}}\) there exist some two rays with the same 2coloring. But then the automorphism that interchanges them and fixes all other vertices is nontrivial but preserves the coloring.
When applied to graphs, the Motion Lemma (Lemma 3.1) asserts that a finite graph \(G\) with automorphism group \(A\) is 2distinguishable if \(m(A)\ge 2\log _2A\). When \(m(G)\) is infinite, this is equivalent to saying that \(2^{m(G)} \ge \mathrm{Aut }(G)\) implies \(2\)distinguishability, and leads to the Motion Conjecture for Graphs. The conjecture was first formulated in [8] for infinite graphs of any cardinality. However, in light of the examples of Lehner and Möller, it is restricted here to uncountable graphs.
The Motion Conjecture for Graphs. Let \(G\) be an uncountable graph. Then \(2^{m(G)} \ge \mathrm{Aut }(G)\) implies \(\mathrm{D }(G) = 2\).
We now turn to proving that every closed group of permutations having infinite motion on a countably infinite set has a dense subgroup which is \(2\)distinguishable. We begin by proving for completeness two wellknown facts relating the properties of having a finite base, being subdegreefinite, and closure.
Proposition 4.1
If \(A \le \mathrm{Sym }(X)\) has a finite base, then \(A\) is closed.
Proof
If \(Y\) is a finite base for \(A\) and \(a \in \mathrm{cl }(A)\), then there exists \(b \in A\) such that \(a\) and \(b\) agree on \(Y\). Since \(ab^{1} \in \mathrm{cl }(A)\) and \(Y\) are finite, for each \(x \in X\) there exists \(c \in A\) such that \(c\) and \(ab^{1}\) agree on \(Y \cup \{x\}\). But any such permutation \(c\) must fix the base \(Y\) pointwise and is therefore the identity. Thus, \(ab^{1}\) must fix every element of \(X\); that is, \(a=b \in A\).\(\square \)
Proposition 4.2
If \(B \le A\le \mathrm{Sym }(X)\) and \(B\) is subdegreefinite, then \(\mathrm{cl }_A(B)\) is also subdegreefinite.
Proof
If \(x,y,z\in X\) and if \(a\in \mathrm{cl }_A(B)\) satisfies \(ax=x\) and \(ay=z\), then there exists some element \(b\in B\) that also satisfies \(bx=x\) and \(by=z\); hence the stabilizers \(B_x\) and \([\mathrm{cl }_A(B)]_x\) have exactly the same orbits.\(\square \)
On the other hand, as shown by the following example, neither of the two properties of 2distinguishability nor having infinite motion is preserved under closure.
Example 4.3
Let \(G\) be the graph whose vertex set \(VG\) is the disjoint union \(\{x_i : i\in {\mathbb {Z}}\} \cup \{y_i : i\in {\mathbb {Z}}\}\), where two distinct vertices in \(VG\) are adjacent in \(G\) if and only if their indices differ by at most \(1\). (So \(G\) is isomorphic to the strong product \(P\boxtimes K_2\), where \(P\) is the double ray.) Let \(A=\mathrm{Aut }(G)\). Let \(b\) be the translation that adds \(1\) to all subscripts, and let \(c\) be the involution that transposes \(x_i\) and \(y_i\) if \(i\) is a square and fixes them otherwise. Let \(B=\langle b,c \rangle \). We list some properties of \(A\) and \(B\).

(i)
For each \(i\), \(A\) contains the transposition \(s_i\) whose support is \(\{x_i,y_i\}\), and so \(m(A)=2\). Moreover, \(A\) is uncountable since it contains all finite and all infinite products of the transpositions \(s_i\).

(ii)
\(\mathrm{D }(A,X)>2\). Given any 2coloring of \(VG\), if some \(x_i\) and \(y_i\) have the same color, then \(s_i\) preserves the coloring. Otherwise, for some product \(t\) of some of the \(s_i\), all the images of the \(x_i\) have one color and all the images of the \(y_i\) have the other color. In this case, \(tbt\) preserves the given coloring.

(iii)
\(A\) is subdegreefinite, because \(G\) is locally finite.

(iv)
\(B\) has infinite motion. For \(n \in {\mathbb {Z}}\), write \(c_n:= b^{n}cb^n\). An easy induction argument shows that any element \(g \in B\) may be written \(g = b^{n_0} c_{n_1} ,\ldots , c_{n_{\ell }}\) for some finite set of integers \(\{n_0, \ldots , n_{\ell }\}\). Now suppose \(g\) has finite motion. Clearly \(n_0 = 0\), and so \(g = c_{n_1} ,\ldots , c_{n_{\ell }}\). Each permutation \(c_{i}\) fixes every set \(\{x_j,y_j\}\) setwise, and so by considering the action of \(c_n c_m c_n c_m\) on each pair \(\{x_i, y_i\}\), one easily checks that \(c_n c_m c_n c_m\) fixes every vertex in \(G\), and therefore \(c_n c_m = c_m^{1} c_n^{1} = c_m c_n\). Because each \(c_{n_i}\) has order \(2\), we may without loss of generality assume that all terms \(c_{n_1}, \ldots , c_{n_\ell }\) in \(g\) are pairwise distinct. Now \(c_i\) acts nontrivially on \(\{x_j,y_j\}\) if and only if \(j = k^2  i\) for some \(k \in {\mathbb {Z}}\). Hence \(\{x_j,y_j\} \subseteq \mathrm{supp }(c_{i}) \cap \mathrm{supp }(c_{i'})\) if and only if there exist \(k, m \in {\mathbb {Z}}\) satisfying \(k^2  i = j = m^2  i'\). However, for \(i \not = i'\), the equation \(k^2  m^2 = i  i'\) has only finitely many pairs \((k, m)\) of integer solutions (since \(k+m\) and \(km\) must be integer factors of \(ii'\)), so \(\mathrm{supp }(c_{i}) \cap \mathrm{supp }(c_{i'})\) is finite when \(c_i \not = c_{i'}\). Therefore, \(\mathrm{supp }(c_{n_1}) \setminus \bigcup _{i = 2}^{\ell } \left( \mathrm{supp }(c_{n_1}) \cap \mathrm{supp }(c_{n_i}) \right) \) is infinite, and so \(\mathrm{supp }(g)\) is infinite: a contradiction.

(v)
\(\mathrm{D }(B,X)=2\) by Lemma 3.3, since \(B\) is countably infinite with infinite motion.

(vi)
\(s_0 \in \mathrm{cl }_A(B)\). Let \(Y\) be any finite subset of \(VG\). For some \(n>0\), we have \(x_i, y_i \not \in Y\) whenever \(i\ge n\). Then \(b^{n^2}cb^{n^2}\in B\) agrees with \(s_0\) on \(Y\), since \(c\) interchanges \(x_i\) with \(y_i\) for \(i=n^2\) and fixes \(x_j\) and \(y_j\) for \((n1)^2<j<(n+1)^2, j\ne n^2\).

(vii)
\(\mathrm{cl }_A(B)=A\), since \(s_i=b^{i}s_0b^{i}\in \mathrm{cl }_A(B)\) for all \(i\).
Although \(2\)distinguishability and infinite motion are not preserved under closure, permutation groups with distinguishing number 2 are, in a certain sense, dense in the class of permutation groups with infinite motion. Our proof assumes the Axiom of Choice.
Theorem 4.4
Let \(A\) be a group of permutations having infinite motion on the countably infinite set \(X\). Then \(A=\mathrm{cl }_A(B)\) for some subgroup \(B\) satisfying \(\mathrm{D }(B,X)=2\) and \(B \le \aleph _0\).
Proof
This theorem follows from the fact that, when \(X\) is countably infinite, there is a countable subgroup \(B\) of \(A\) such that \(\mathrm{cl }_A(B)=A\); since \(A\) has infinite motion, so does \(B\), and therefore \(\mathrm{D }(B,X)=2\) by Lemma 3.3.
The existence of such a group \(B\) is well known, but we describe its construction here for completeness. Since \(X\) is countably infinite, the set \(\bigcup _{n \in {\mathbb {N}}} X^n\) consisting of all finite tuples whose entries lie in \(X\), is countable, and we may enumerate its elements as \(\{Y_i : i \in {\mathbb {Z}}\}\). The set \(\{(Y_i, aY_i) : a \in A, i \in {\mathbb {Z}}\}\) is also countably infinite, and so (assuming the Axiom of Choice) we may choose a countably infinite set of elements \(\{a_{i j} : i, j \in {\mathbb {Z}}\} \subseteq A\) such that \(\{(Y_i, a_{i j} Y_i) : i, j \in {\mathbb {Z}}\} = \{(Y_i, aY_i) : a \in A, i \in {\mathbb {Z}}\}\). Let \(B\) denote the group generated by the set \(\{a_{i j} : i, j \in {\mathbb {Z}}\}\). Then \(B\) and \(A\) have the same action on the finite tuples of \(X\) and therefore \(\mathrm{cl }_A(B) = A\). Since \(B\) is countably generated, \(B \le \aleph _0\).\(\square \)
Theorem 4.4 suggests that it might be possible to obtain a proof of the Infinite Motion Conjecture for Permutation Groups by “bootstrapping” from a countably infinite subgroup of an arbitrary group \(A\) of which \(A\) is the closure. Unfortunately, Example 4.3 shows that \(2\)distinguishability need not be preserved under closure, even under the strong assumption of subdegreefiniteness. On the other hand, in Example 4.3, the larger group \(A\) has finite motion. Thus, a possibility remains that a bootstrapping argument may be effective.
The following corollary of Theorem 4.4 shows that every group with infinite motion contains as a dense subgroup a group which is minimal with respect to strong orbitequivalence.
Corollary 4.5
Let \(A\) be a group of permutations having infinite motion on the countably infinite set \(X\). Then there exists a subgroup \(B \le A\) satisfying

(i)
\(A = \mathrm{cl }_A(B)\) and

(ii)
\(B\) is not strongly orbitequivalent to any of its proper subgroups.
Proof
Since \(A\) has infinite motion, by Theorem 4.4 there exists a subgroup \(B \le A\) such that \(B \le \aleph _0\) and \(A = \mathrm{cl }_A(B)\) and \(D(B, X) = 2\). Hence, there is a set \(Y \subseteq X\) for which the setwise stabilizer \(B_{\{Y\}}\) is trivial. If \(C \le B\) is strongly orbitequivalent, then for all \(b \in B\), there exists \(c \in C\) such that \(bY = cY\), which implies that \(c^{1}b \in B_{\{Y\}}\). Hence \(B = C\).\(\square \)
Questions
We list three of the various questions that have arisen in the course of preparing this article.
As remarked just after Proposition 3.2, the only known proof (cf. [4]) that there are only finitely many nonalternating, nonsymmetric finite primitive permutation groups that are not \(2\)distinguishable relies on the Classification of the Finite Simple Groups, and the link between primitivity and \(2\)distinguishability (and thus orbitequivalence) is not fully understood. Such a connection has also been observed in infinite groups ([24, Corollary 2]) and is the subject of two interesting conjectures ([17, Section 6] and [20, Conjecture 1.2]). Thus, the answer to the following question is of considerable interest.
Question 1
Is there an elementary proof, perhaps based on motion, that there are only finitely many finite primitive permutation groups, other than \(A_n\) and \(S_n\), satisfying \(\mathrm{D }(A,X)>2\)?
We do not know whether the condition of being closed is necessary in the Infinite Motion Conjecture for Permutation Groups. We thus expect an affirmative answer to the following question.
Question 2
Does there exist a subdegreefinite, nonclosed permutation group \(A\) on a countably infinite set \(X\) such that \(A\) has infinite motion and \(\mathrm{D }(A,X)>2\)?
Question 3
Does there exist a transitive permutation group \(A\) on a countably infinite set \(X\) all of whose pointstabilizers are finitely generated and \(\mathrm{D }(A,X)>2\)?
Notes
 1.
Their examples were inspired by the rational tournament on \({\mathbb {Q}}\) and are not yet published.
References
 1.
Albertson, M.O.: Distinguishing Cartesian powers of graphs. Electron. J. Comb. 12, N17 (2005)
 2.
Albertson, M.O., Collins, K.L.: Symmetry breaking in graphs. Electron. J. Comb. 3, R18 (1996)
 3.
Bailey, R.F., Cameron, P.J.: Base size, metric dimension and other invariants of groups and graphs. Bull. Lond. Math. Soc. 43, 209–242 (2011)
 4.
Cameron, P.J., Neumann, P.M., Saxl, J.: On groups with no regular orbits on the set of subsets. Arch. Math. (Basel) 43, 295–296 (1984)
 5.
Cameron, P.J.: Aspects of infinite permutation groups. In: Campbell, C.M. et al. (eds.) Groups St Andrews 2005, vol. 1, London Math. Soc. Lecture Note Ser. 399, pp. 1–35. CUP, Cambridge (2007)
 6.
Chan, M.: The maximum distinguishing number of a group. Electron. J. Comb. 13, R70 (2006)
 7.
Conder, M., Tucker, T.: Motion and distinguishing number two. Ars Math. Contemp. 4, 63–72 (2011)
 8.
Cuno, J., Imrich, W., Lehner, F.: Distinguishing graphs with infinite motion and nonlinear growth. Ars Math. Contemp. 7, 201–213 (2014)
 9.
Evans, D.M.: A note on automorphism groups of countably infinite structures. Arch. Math. 49, 479–483 (1987)
 10.
Graver, J.E., Watkins, M.E.: Locally Finite, Planar, EdgeTransitive Graphs. Memoirs of the Am. Math. Soc. 126 (1997)
 11.
Halin, R.: Automorphisms and endomorphisms of infinite locally finite graphs. Abh. Math. Sem. Univ. Hamburg 39, 251–283 (1973)
 12.
Imrich, W., Jerebic, J., Klavžar, S.: The distinguishing number of Cartesian products of complete graphs. Eur. J. Comb. 29, 922–929 (2008)
 13.
Imrich, W., Klavžar, S., Trofimov, V.: Distinguishing infinite graphs. Electron. J. Comb. 14, R36 (2007)
 14.
Klavžar, S., Wong, T.L., Zhu, X.: Distinguishing labelings of group action on vector spaces and graphs. J. Algebra 303, 626–641 (2006)
 15.
Klavžar, S., Zhu, X.: Cartesian powers of graphs can be distinguished by two labels. Eur. J. Comb. 28, 303–310 (2007)
 16.
Kueker, D.W.: Definability, automorphisms, and infinitary languages, In: Barwise, J. (Ed.) The Syntax and Semantics of Infinitary Languages. LNM 72, BerlinHeidelbergNew York (1968)
 17.
LaFlamme, C., Nguyen Van Thé, L., Sauer, N.: Distinguishing number of countable homogeneous relational structures. Electron. J. Comb. 17, R20 (2010)
 18.
Lehner, F.: Random colourings and automorphism breaking in locally finite graphs. Comb. Probab. Comput. 22, 885–909 (2013)
 19.
Lehner, F.: Distinguishing graphs with intermediate growth. Combinatorica (to appear)
 20.
Lockett, D.C., Macpherson, H.D.: Orbitequivalent infinite permutation groups. J. Algebraic Comb. 38, 973–988 (2013)
 21.
Reyes, G.E.: Local definability theory. Ann. Math. Logic 1, 95–138 (1970)
 22.
Russell, A., Sundaram, R.: A note on the asymptotics and computational complexity of graph distinguishability. Electron. J. Comb. 5, R23 (1998)
 23.
Seress, Á.: Primitive groups with no regular orbits on the set of subsets. Bull. Lond. Math. Soc. 29, 697–704 (1997)
 24.
Smith, S.M., Tucker, T.W., Watkins, M.E.: Distinguishability of infinite groups and graphs. Electron. J. Comb. 19, P27 (2012)
 25.
Tucker, T.: Distinguishing maps. Electron. J. Comb. 18, R50 (2011)
 26.
Watkins, M.E., Zhou, X.: Distinguishability of locally finite trees. Electron. J. Comb. 14, R29 (2007)
Acknowledgments
Wilfried Imrich was partially supported by the Austrian Science Fund (FWF), project W1230 and ARRS Slovenia within the EUROCORES Programme EUROGIGA/GReGAS of the European Science Foundation. Mark Watkins was partially supported by a grant from the Simons Foundation (#209803 to Mark E. Watkins). We thank both of the anonymous referees for their reports, one of which was particularly both thorough and helpful.
Author information
Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Imrich, W., Smith, S.M., Tucker, T.W. et al. Infinite motion and 2distinguishability of graphs and groups. J Algebr Comb 41, 109–122 (2015). https://doi.org/10.1007/s1080101405292
Received:
Accepted:
Published:
Issue Date:
Keywords
 Distinguishing number
 Distinguishability
 Automorphism
 Infinite graph
 Infinite permutation group
 Motion
 Orbitequivalence