Growth rate (group theory) explained

In the mathematical subject of geometric group theory, the growth rate of a group with respect to a symmetric generating set describes how fast a group grows. Every element in the group can be written as a product of generators, and the growth rate counts the number of elements that can be written as a product of length n.

Definition

Suppose G is a finitely generated group; and T is a finite symmetric set of generators(symmetric means that if

x\inT

then

x-1\inT

).Any element

x\inG

can be expressed as a word in the T-alphabet

x=a1a2akwhereai\inT.

Consider the subset of all elements of G that can be expressed by such a word of length ≤ n

Bn(G,T)=\{x\inG\midx=a1a2akwhereai\inTandk\len\}.

This set is just the closed ball of radius n in the word metric d on G with respect to the generating set T:

Bn(G,T)=\{x\inG\midd(x,e)\len\}.

More geometrically,

Bn(G,T)

is the set of vertices in the Cayley graph with respect to T that are within distance n of the identity.

Given two nondecreasing positive functions a and b one can say that they are equivalent (

a\simb

) if there is a constant C such that for all positive integers n,

a(n/C)\leqb(n)\leqa(Cn),

for example

pn\simqn

if

p,q>1

.

Then the growth rate of the group G can be defined as the corresponding equivalence class of the function

\#(n)=|Bn(G,T)|,

where

|Bn(G,T)|

denotes the number of elements in the set

Bn(G,T)

. Although the function

\#(n)

depends on the set of generators T its rate of growth does not (see below) and therefore the rate of growth gives an invariant of a group.

The word metric d and therefore sets

Bn(G,T)

depend on the generating set T. However, any two such metrics are bilipschitz equivalent in the following sense: for finite symmetric generating sets E, F, there is a positive constant C such that

{1\overC}dF(x,y)\leqdE(x,y)\leqCdF(x,y).

As an immediate corollary of this inequality we get that the growth rate does not depend on the choice of generating set.

Polynomial and exponential growth

If

\#(n)\leC(nk+1)

for some

C,k<infty

we say that G has a polynomial growth rate.The infimum

k0

of such ks is called the order of polynomial growth.According to Gromov's theorem, a group of polynomial growth is a virtually nilpotent group, i.e. it has a nilpotent subgroup of finite index. In particular, the order of polynomial growth

k0

has to be a natural number and in fact

\#(n)\sim

k0
n
.

If

\#(n)\gean

for some

a>1

we say that G has an exponential growth rate.Every finitely generated G has at most exponential growth, i.e. for some

b>1

we have

\#(n)\lebn

.

If

\#(n)

grows more slowly than any exponential function, G has a subexponential growth rate. Any such group is amenable.

Examples

k>1

has exponential growth rate.

\pi1(M)

has exponential growth rate. John Milnor proved this using the fact that the word metric on

\pi1(M)

is quasi-isometric to the universal cover of M.

\Zd

has a polynomial growth rate of order d.

H3

has a polynomial growth rate of order 4. This fact is a special case of the general theorem of Hyman Bass and Yves Guivarch that is discussed in the article on Gromov's theorem.

See also

References

Further reading