If w = W(Xl ,...) x,) is a word in free variables xi ,..., X, of a group, it leads to complicated (quite often combinatorial or unsolvable) problems to ask for those elements g of a given group G which are expressible in the form g = a?1 ,..., gJ for some g, ,..., g, E G. In the case of commutators w = X, 0 x2 = -1 -1 Xl . x2 . xi x2 we know of finite groups G and g E G’ (= commutator subgroup) such that g f w(g, , g2) for all g, , g, E G; cf. Huppert [12, p. 2581. More general results of this type are to be found in Hall’s lecture notes [ll] or for arbitrary words in Griffith [lo], Rhemtulla [ 151, or Wilson [ 181. This was exploited in Gobel [7, 81. Again, for w = xi o x2 it was shown dually that each element is expressible by commutators in the cases of permutation groups S, , A, (n > 5); cf. Ore [14] and Ito [13]. Analogous results arc known for matrix groups; cf. Clowes and Hirsch [6]. Hence every element of S, is a product of four elements g, 08, from two conjugacy classes gfm and gin. The analogy is true for A, ; cf. HsiiCh’eng-hao [5]. This result was generalized and carried over to the countable case SK0 of all permutations on N by Bertram [3] : (*) Let p be any permutation of SsO with infinite support. Then every permutation of SE0 is a product of four permutations, each conjugate to p. This theorem reflects-in a very strong version-the fact that SX, has only “very few” normal subgroups as known since 1933 from Schreier and Ulam [16]. From Baer’s result [I] we know the Jordan-Holder series in the general case S, of all permutations on a set of cardinality K > K, , which is even unique if this series is finite. Therefore a generalization of (*) for K > X, is to be expected, where, of course, the cardinalities associated with permutations are to be taken in account. Surprizingly, the cardinality 1 s 1 of the support of a permutation scS*, will be sufficient; the support of s is the set of those elements of the underlying set which are not fixpoints of s:
Read full abstract