Math 2.0

Group theory and generalizations Definition

Growth rate of a group

Builds on Finitely generated groupSubgroup generated by a subsetFree group

Definition

Let GG be a finitely generated group and let SS be a finite generating set of GG. The word length ∣g∣S\abs{g}_S of g∈Gg \in G is the least nn such that g=s1⋯sng = s_1 \cdots s_n with each si∈S∪S−1s_i \in S \cup S^{-1}. The growth function of GG with respect to SS is γS(n)=∣{g∈G:∣g∣S≤n}∣,n∈ℕ.\gamma_S(n) = \abs{\set{g \in G : \abs{g}_S \le n}}, \quad n \in \N. For functions f,h ⁣:ℕ→ℕf, h \colon \N \to \N, write f⪯hf \preceq h if there is a constant C≥1C \ge 1 with f(n)≤h(Cn)f(n) \le h(Cn) for all nn, and f∼hf \sim h if f⪯hf \preceq h and h⪯fh \preceq f. The growth rate of GG is the ∼\sim-class of γS\gamma_S.

  1. GG has polynomial growth if γS(n)≤Cnd\gamma_S(n) \le C n^d for some constants C,d>0C, d > 0 and all n≥1n \ge 1.
  2. GG has exponential growth if γS(n)≥an\gamma_S(n) \ge a^n for some a>1a > 1 and all nn.
  3. GG has intermediate growth if it has neither polynomial nor exponential growth.

Remarks

The class of γS\gamma_S does not depend on SS. If S′S' is another finite generating set, each element of S′S' is a word of length at most some CC in SS, so γS′(n)≤γS(Cn)\gamma_{S'}(n) \le \gamma_S(Cn). Hence the three types above do not depend on SS.

Example: G=ℤ2G = \Z^2 with S={(1,0),(0,1)}S = \set{(1, 0), (0, 1)}. The elements of length at most nn are the (a,b)(a, b) with ∣a∣+∣b∣≤n\abs{a} + \abs{b} \le n, so γS(n)=2n2+2n+1\gamma_S(n) = 2n^2 + 2n + 1, and ℤ2\Z^2 has polynomial growth.

Example: the free group on {a,b}\set{a, b}. There are 4⋅3k−14 \cdot 3^{k-1} reduced words of length k≥1k \ge 1, so γS(n)=2⋅3n−1\gamma_S(n) = 2 \cdot 3^n - 1, and the growth is exponential.

Non-example: the additive group ℚ\Q is not finitely generated, so the definition does not apply; with an infinite generating set the balls may be infinite.

Since γS(m+n)≤γS(m)γS(n)\gamma_S(m + n) \le \gamma_S(m) \gamma_S(n), the limit lim⁡n→∞γS(n)1/n\lim_{n \to \infty} \gamma_S(n)^{1/n} exists, and GG has exponential growth exactly when this limit is greater than 11.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Finitely generated group concept
  2. Free group concept
  3. Subgroup generated by a subset concept
  4. Growth rate of a group definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Growth_rate_(group_theory)
About this page
TagJT4F3SKPCP
URIm2://JT4F3SKPCP
Kinddefinition
WritingW0 stub
MSC20F69, 20F65
DefinesGrowth rate of a group
UsesFinitely generated group, Subgroup generated by a subset, Free group
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.