Bourbaki

Exercise 20, § 7

Algebra, I, p. 146

Bourbaki marks this one as harder than the rest.

We retain the notations of the preceding exercise. Let H be a subgroup of G. a) Let R_H be the set of S-connected subsets T of G such that hT ∩ T = ∅ if h ∈ H, h ≠ e. Show that R_H is inductive for the relation of inclusion. b) Let Y be a maximal element of R_H. Show that G = ⋃_{h ∈ H} hY, in other words that Y is a system of representatives of the right classes modulo H. (If G′ = ⋃_{h ∈ H} hY is distinct from G, show that there exist x ∈ G′ and y ∈ Y which are S-neighbors, and deduce that Y ∪ {x} belongs to R_H.) c) Let S_H be the set of elements h ∈ H such that Y and hY are neighbors. It is a symmetric subset of H. Show that an element h ∈ H belongs to S_H if and only if h ≠ e and there exist y, y′ in Y, s ∈ S, such that ys = hy′. Show that S_H generates H. (If H′ is the subgroup of H generated by S_H, one will prove that ⋃_{h ∈ H′} hY is an S-connected component of G.) Recover this result by means of exerc. 14 of I, p. 125. d) Let X_H be a subset of S_H such that S_H is the disjoint union of X_H and X_H⁻¹ (one will show that such a subset exists).

EXERCISES

Show that XHX_H is a basic family for HH, and in particular that HH is a free group ("Nielsen-Schreier theorem"). (Apply the criterion of exerc. 18 c) of I, p. 146 to HH, endowed with SHS_H, by observing that two elements h,h′h, h' of HH are SHS_H-neighbors if and only if hYhY and h′Yh'Y are neighboring subsets of GG. Use exerc. 19 d) to prove that SHS_H satisfies condition (ii) of exerc. 18 c).) e) Let d=(G:H)=Card(Y)d = (G : H) = \mathrm{Card}(Y). Suppose that dd is finite. Show that one has:

Card(XH)=Card(X)=Card(G)if Card(X) is infiniteCard(XH)=1+d(Card(X)−1)if Card(X) is finite. \begin{array}{ll} \mathrm{Card}(X_H) = \mathrm{Card}(X) = \mathrm{Card}(G) & \text{if } \mathrm{Card}(X) \text{ is infinite} \\ \mathrm{Card}(X_H) = 1 + d(\mathrm{Card}(X) - 1) & \text{if } \mathrm{Card}(X) \text{ is finite}. \end{array}
(Let TT be a finite nonempty S-connected subset of GG, and let T′T' (resp. T′′T'') be the set of pairs of S-neighboring elements whose first element (resp. both elements) belongs (resp. belong) to TT. We have Card(T′)=2 Card(X)Card(T)\mathrm{Card}(T') = 2\ \mathrm{Card}(X)\mathrm{Card}(T) and one will show, by induction on Card(T)\mathrm{Card}(T), that Card(T′′)=2 Card(T)−2\mathrm{Card}(T'') = 2\ \mathrm{Card}(T) - 2. One will apply the result to T=YT = Y, by observing that SHS_H is equipotent to T′−T′′T' - T''.)

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.