Bourbaki marks this one as harder than the rest.
(a) Let G be a group operating on two finite sets E1 and E2. If s∈G, let s1 (resp. s2) denote the permutation of E1 (resp. E2) defined by s and E1s (resp. E2s) the set of elements invariant under s1 (resp. s2).
Show the equivalence of the following properties: (i) For all s∈G, Card(E1s)=Card(E2s). (ii) For all s∈G, the orders of the component cycles of s1 (cf. no. 7, Proposition 7) are the same (to within a permutation) as those of s2. (iii) For all s∈G, there exists a bijection fs:E1→E2 such that s2∘fs=fs∘s1.
If these properties hold, the G-sets E1 and E2 are said to be weakly equivalent.
(b) Give an example of two weakly equivalent G-sets which are not isomorphic (take G to be a non-cyclic group of order 4).
(c) Let H1 and H2 be two subgroups of a finite group G. Show the equivalence of the following properties: (1) For every conjugacy class C of G,
Card(C∩H1)=Card(C∩H2). (2) The
G-sets
G/H1 and
G/H2 are weakly equivalent.
(d) Show that, if H1 and H2 satisfy properties (1) and (2) above and H1 is normal in G, then H2=H1.
(e) Let G=A6 and let
H1={e,(1 2)(3 4),(1 3)(2 4),(1 4)(2 3)} H2={e,(1 2)(3 4),(1 2)(5 6),(3 4)(5 6)}. Show that
H1 and
H2 satisfy properties (1) and (2) and that
H1 and
H2 are not conjugate in
A6 (nor in
S6).