Bourbaki

Exercise 9, § 6

Algebra, I, p. 136

Bourbaki marks this one as harder than the rest.

Let F→E→GF \to E \to G be an extension of finite groups. Assume that no prime number divides both the order of FF and the order of GG. (a) Assume FF is solvable. Show that there exists a section s:G→Es : G \to E and that any two such sections are conjugate by an element of FF. (One shall reason by induction on the solvability class of FF; when FF is commutative, one shall use the preceding exercise.) (b) Show the existence of a section1s:G→E^1 s : G \to E without assuming FF is solvable. (Reason by induction on the order of GG. If pp divides the order of FF, choose a pp-Sylow subgroup PP of FF and consider its normalizer NN in EE. The image of NN in GG is equal to GG, cf. I, p. 139, exerc. 25. If N≠EN \neq E, conclude by means of the induction hypothesis; if N=EN = E, use (a) as well as the induction hypothesis applied to F/P→E/P→G.F/P \to E/P \to G.)

1 Here again, one can prove that any two such sections are conjugate, cf. Feit-Thompson, Proc. Nat. Acad. Sci. U.S.A., XLVIII, 1962, p. 968–970.

EXERCISES

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.