Abstract :
A sufficient criterion is found for certain permutation groups G to have uncountable strong
cofinality, that is, they cannot be expressed as the union of a countable, ascending chain (Hi)i∈ω
of proper subsets Hi such that HiHi ⊆ Hi+1 and Hi =H
−1
i . This is a strong form of uncountable
cofinality for G, where each Hi is a subgroup of G. This basic tool comes from a recent
paper by Bergman on generating systems of the infinite symmetric groups, which is discussed
in the introduction. The main result is a theorem which can be applied to various classical
groups including the symmetric groups and homeomorphism groups of Cantor’s discontinuum,
the rationals, and the irrationals, respectively. They all have uncountable strong cofinality. Thus
the result also unifies various known results about cofinalities. A notable example is the group
BSym(Q) of all bounded permutations of the rationals Q which has uncountable cofinality but
countable strong cofinality.
