Bourbaki

Exercise 23, § 6

Algebra, I, p. 138

Bourbaki marks this one as harder than the rest.

Let σ\sigma be an automorphism of a group G. a) Now prove the equivalence of the following conditions: (i) σ(x)=x\sigma(x) = x entails x=ex = e. (ii) The mapping x↦x−1σ(x)x \mapsto x^{-1}\sigma(x) is injective. When these conditions are satisfied, one says (by abuse of language) that σ\sigma is without fixed point. b) Suppose G is finite and σ\sigma is without fixed point. The mapping x↦x−1σ(x)x \mapsto x^{-1}\sigma(x) is then bijective. If H is a normal subgroup of G stable by σ\sigma, now prove that the automorphism of G/H defined by σ\sigma is without fixed point. c) The hypotheses being those of b), let pp be a prime number. Now prove that there exists a pp-Sylow subgroup P of G stable by σ\sigma. (If P0P_0 is a pp-Sylow subgroup, there exists y∈Gy \in G such that σ(P0)=yP0y−1\sigma(P_0) = yP_0y^{-1}; write y−1y^{-1} in the form x−1σ(x)x^{-1}\sigma(x) and take P=xP0x−1P = xP_0x^{-1}.) Now prove that such a subgroup is unique, and contains every pp-subgroup of G stable by σ\sigma. d) Suppose in addition that σ\sigma is of order 2. Now prove that σ(g)=g−1\sigma(g) = g^{-1} for all g∈Gg \in G (write gg in the form x−1σ(x)x^{-1}\sigma(x), with x∈Gx \in G). Deduce that G is commutative and of odd order.

Solution

No solution has been written yet.

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