Grigorchuk group

In the mathematical area of group theory, the Grigorchuk group or the first Grigorchuk group is a finitely generated group constructed by Rostislav Grigorchuk that provided the first example of a finitely generated group of intermediate (that is, faster than polynomial but slower than exponential) growth. The group was originally constructed by Grigorchuk in a 1980 paper^[1] and he then proved in a 1984 paper^[2] that this group has intermediate growth, thus providing an answer to an important open problem posed by John Milnor in 1968. The Grigorchuk group remains a key object of study in geometric group theory, particularly in the study of the so-called branch groups and automata groups, and it has important connections with the theory of iterated monodromy groups.^[3]

History and generalizations

The growth of a finitely generated group measures the asymptotics, as n → of the size of an n-ball in the Cayley graph of the group (that is, the number of elements of G that can be expressed as words of length at most n in the generating set of G). The study of growth rates of finitely generated groups goes back to 1950s and is motivated in part by the notion of volume entropy (that is, the growth rate of the volume of balls) in the universal covering space of a compact Riemannian manifold in differential geometry. It is obvious that the growth rate of a finitely generated group is at most exponential and it was also understood early on that finitely generated nilpotent groups have polynomial growth. In 1968 John Milnor posed a question^[4] about the existence of a finitely generated group of intermediate growth, that is, faster than any polynomial function and slower than any exponential function. An important result in the subject is Gromov's theorem on groups of polynomial growth, obtained by Gromov in 1981, which shows that a finitely generated group has polynomial growth if and only if this group has a nilpotent subgroup of finite index. Prior to Grigorchuk's work, there were many results establishing growth dichotomy (that is, that the growth is always either polynomial or exponential) for various classes of finitely generated groups, such as linear groups, solvable groups,^[5][6] etc.

Grigorchuk's group G was constructed in a 1980 paper of Rostislav Grigorchuk,^[1] where he proved that this group is infinite, periodic and residually finite. In a subsequent 1984 paper^[2] Grigorchuk proved that this group has intermediate growth (this result was announced by Grigorchuk in 1983).^[7] More precisely, he proved that G has growth b(n) that is faster than but slower than exp(n^s) where . The upper bound was later improved by Laurent Bartholdi^[8] to , with . A lower bound of was proved by Yurii Leonov.^[9]

Grigorchuk's group was also the first example of a group that is amenable but not elementary amenable, thus answering a problem posed by Mahlon Day in 1957.^[10]

Originally, Grigorchuk's group G was constructed as a group of Lebesgue-measure-preserving transformations on the unit interval, but subsequently simpler descriptions of G were found and it is now usually presented as a group of automorphisms of the infinite regular binary rooted tree. The study of Grigorchuk's group informed in large part the development of the theory of branch groups, automata groups and self-similar groups in the 1990s–2000s and Grigorchuk's group remains a central object in this theory. Recently important connections between this theory and complex dynamics, particularly the notion of iterated monodromy groups, have been uncovered in the work of Volodymyr Nekrashevych.^[11] and others.

After Grigorchuk's 1984 paper, there were many subsequent extensions and generalizations,^{[12][13][14][15]} though no improvement on the upper and lower bounds of the growth of the Grigorchuk group; the precise asymptotics of its growth is still unknown. It is conjectured that on the word growth exist, but even this remains a major open problem.

Definition

Although initially the Grigorchuk group was defined as a group of Lebesgue measure-preserving transformations of the unit interval, at present this group is usually given by its realization as a group of automorphisms of the infinite regular binary rooted tree T₂. The tree T₂ is realized as the set Σ^* of all (including the empty string) finite strings in the alphabet Σ = {0,1}. The empty string Ø is the root vertex of T₂ and for a vertex x of T₂ the string x0 is the left child of x and the string x1 is the right child of x in T₂. The group of all automorphisms Aut(T₂) can thus be thought of as the group of all length-preserving permutations σ of Σ^* that also respect the initial segment relation, that is such that whenever a string x is an initial segment of a string y then σ(x) is an initial segment of σ(y).

The Grigorchuk group G is then defined as the subgroup of Aut(T₂) generated by four specific elements a,b,c,d of Aut(T₂), that is G = <a,b,c,d> ≤ Aut(T₂), where the automorphisms a,b,c,d of T₂ are defined recursively as follows:

• a(0x) = 1x, a(1x) = 0x for every x in Σ^*;
• b(0x) = 0a(x), b(1x) = 1c(x) for every x in Σ^*;
• c(0x) = 0a(x), c(1x) = 1d(x) for every x in Σ^*;
• d(0x) = 0x, d(1x) = 1b(x) for every x in Σ^*.

Thus a swaps the right and left branch trees T_L = 0Σ^* and T_R = 1Σ^* below the root vertex Ø and the elements b,c,d can be represented as:

• b = (a,c),
• c = (a,d),
• d = (1,b).

Here b = (a,c) means that b fixes the first level of T₂ (that is, it fixes the strings 0 and 1) and that b acts on T_L exactly as the automorphism a does on T₂ and that b acts on T_R exactly as the automorphism c does on T₂. The notation c = (a,d) and d = (1,b) is interpreted similarly, where 1 in d = (1,b) means that d acts on T_L as the identity map does on T₂.

Of the four elements a, b, c, d of Aut(T₂) only the element a is defined explicitly and the elements b, c, d are defined inductively (by induction on the length |x| of a string x in Σ^* ), that is, level by level.

Basic features of the Grigorchuk group

The following are basic algebraic properties of the Grigorchuk group (see^[16] for proofs):

• The group G is residually finite. Indeed, for every positive integer n let T[n] be the finite subtree of T₂ which is the union of the first n levels of and let ρ_n:G→Aut(T[n]) be the restriction homomorphism that sends every element of G to its restriction to the finite tree T[n]. The groups Aut(T[n]) are finite and for every nontrivial g in G there exists n such that ρ_n(g) 1.
• Each of the elements a,b,c,d has order 2 in G, that is, a² = b² = c² = d² = 1. Thus a = a⁻¹, b = b⁻¹, c = c⁻¹ and d = d⁻¹, so that every element of G can be written as a positive word in a,b,c,d, without using inverses.
• The elements b,c,d pairwise commute and bc = cb = d, bd = db = c, dc = dc = b, so that <b,c,d>≤G is an abelian group of order 4 isomorphic to the direct product of two cyclic groups of order 2.
• The group G is generated by a and any two of the three elements b,c,d (e.g. G = <a, b, c>).
• Using the above recursive notation, in G we have aba = (c,a), aca = (d,a), ada = (b,1).
• The stabilizer St_G[1] in G of the 1st level of T₂ is the subgroup generated by b, c, d, aba, aca, ada. The subgroup St_G[1] is a normal subgroup of index 2 in G and

G = St_G[1]  a St_G[1].

• Every element of G can be written as a (positive) word in a,b,c,d such that this word does not contain any subwords of the form aa, bb, cc, dd, cd, dc, bc, cb, bd, db. Such words are called reduced.
• A reduced word represents an element of St_G[1] if and only if this word involves an even number of occurrences of a.
• If w is a reduced word of even length involving a positive even number of occurrences of a then there are some words u,v in a,b,c,d (not necessarily reduced) such that in G we have w = (u,v) and such that |u| ≤ |w|/2, |v| ≤ |w|/2. A similar statement holds if w is a reduced word of odd length involving a positive even number of occurrences of a where in the conclusion we have |u| ≤ (|w| + 1)/2, |v| ≤ (|w| + 1)/2.

The last property of G is sometimes called the contraction property. This property plays a key role in many proofs regarding G since it allows to use inductive arguments on the length of a word.

Properties and facts regarding the Grigorchuk group^[16]

• The group G is infinite.^[2]
• The group G is residually finite.^[2]
• The group G is a 2-group, that is, every element in G has finite order that is a power of 2.^[1]
• The group G has intermediate growth.^[2]
• The group G is amenable but not elementary amenable.^[2]
• The group G is just infinite, that is G is infinite but every proper quotient group of G is finite.
• The group G has the congruence subgroup property: if H ≤ G then H has finite index in G if and only if there is a positive integer n such that the kernel Kern(ρ_n) of ρ_n is contained in H, that is Kern(ρ_n) ≤ H.
• The group G has solvable word problem and solvable conjugacy problem (following from the contraction property mentioned in the previous section).
• The group G has solvable subgroup membership problem, that is, there is an algorithm that, given arbitrary words w, u₁,..., u_n in a, b, c, d, decides whether or not w represents an element of the subgroup generated by u₁,..., u_n in G.^[17]
• The group G is subgroup separable, that is, every finitely generated subgroup is closed in the pro-finite topology on G.^[17]
• Every maximal subgroup of G has finite index in G.^[18]
• The group G is finitely generated but not finitely presentable.^[2][19]

See also

• Geometric group theory
• Growth of finitely generated groups
• Amenable groups
• Iterated monodromy group
• Non-commutative cryptography

References

External links

• Rostislav Grigorchuk and Igor Pak, Groups of Intermediate Growth: an Introduction for Beginners, preprint, 2006, arXiv