Bourbaki

Exercise 12, § 2

Tag 03XZ, permanent. Cite it as [Bourbaki, Tag 03XZ].

Algebraic Topology, II, p. 223

Soit nn an integer ⩾2\geqslant 2 and let pp be a prime number >n/2> n/2. Let H be a subgroup of Sn\mathfrak{S}_n which acts transitively on 1,...,n{1, . . . , n}, contains a transposition and a cycle of order pp. Let G be a graph such that

– The set of its vertices is S=1,...,nS ={1, . . . , n};

– The set F of its arrows is the set of pairs (i,j)∈S×S(i, j)\in S\times S such that the transposition τi,j\tau_{i,j} belongs to H ;

– We have o((i,j))=i,t((i,j))=jo((i, j)) =i,t((i, j)) =j and (i,j)=(j,i)(i, j) = (j, i) for every (i,j)∈F(i, j)\in F. a) Prove that every connected component of G is a complete graph. b) Prove that if G is connected, then H=SnH =\mathfrak{S}_n.

c) Prove that there exists a group homomorphism of Sn\mathfrak{S}_n into Aut(G) such that, for every σ∈Sn\sigma \in \mathfrak{S}_n, the mapping Som(σ\sigma ) is equal to the permutation σ\sigma. Prove then that Sn\mathfrak{S}_n acts transitively on the set of connected components of G, and that these are pairwise isomorphic.

d) Let σ∈H\sigma \in H be a cycle of order pp. Prove that σ\sigma stabilizes each connected component of G. Conclude that H=SnH =\mathfrak{S}_n.

Solution

No solution has been written yet.

Cited by

Nothing.

Cites

Nothing.

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.