Bourbaki

Exercise 39, § 7

Algebra, I, p. 151

\* Let G be a finitely generated group, and let F\mathscr{F} be the set of finite symmetric subsets of G, containing e, which generate G. (a) If X∈FX \in \mathscr{F} and n∈Nn \in \mathbf{N}, denote by dn(X)d_n(X) the number of elements of G of the form x1…xnx_1 \ldots x_n, with xi∈Xx_i \in X. If X∈FX \in \mathscr{F}, Y∈FY \in \mathscr{F}, now prove that there exists an integer a⩾1a \geqslant 1 such that

dn(X)⩽dan(Y)for all n∈N. d_n(X) \leqslant d_{an}(Y) \quad \text{for all } n \in \mathbf{N}.
Deduce that lim sup⁡n→∞log⁡(dn(X))log⁡(n)\limsup_{n \to \infty} \frac{\log(d_n(X))}{\log(n)} does not depend on the choice of X in F\mathscr{F}; this limit (finite or infinite) is denoted by e(G)e(G). (b) If X∈FX \in \mathscr{F} and if G is infinite, now prove that dn(X)<dn+1(X)d_n(X) < d_{n+1}(X) for all n. Deduce that e(G)e(G) is ⩾1\geqslant 1. (c) Let H be a finitely generated group. Now prove that e(H)⩽e(G)e(H) \leqslant e(G) if H is isomorphic to a subgroup (resp. to a quotient group) of G. If E is an extension of G by H, now prove that e(E)⩾e(H)+e(G)e(E) \geqslant e(H) + e(G), with equality when E=G×HE = G \times H. (d) Now prove that e(Zn)=ne(\mathbf{Z}^n) = n. (e) Let X∈FX \in \mathscr{F}. Consider the following property: (i) There exists a real number a>1a > 1 such that dn(X)⩾and_n(X) \geqslant a^n for all sufficiently large n. Now prove that, if property (i) is verified by an element of F\mathscr{F}, it is by every element of F\mathscr{F}. G is then said to be of exponential type; this entails e(G)=+∞e(G) = +\infty. (f) Let G1G_1 and G2G_2 be two groups, containing the same subgroup A, and let H=G1∗AG2H = G_1 *_A G_2 be the corresponding amalgamated sum. Suppose that G1G_1 and G2G_2 are finitely generated (and hence H also), and that Gi≠AG_i \neq A for i=1,2i = 1, 2. Now prove that H is of exponential type if at least one of the indices (G1:A)(G_1 : A), (G2:A)(G_2 : A) is ⩾3\geqslant 3. (g) Now prove that a free group of rank ⩾2\geqslant 2 is of exponential type.*

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-6-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.