In this paper, we consider the group Aut of order-automorphisms of the rational numbers, proving a result analogous to a theorem of Galvin’s for the symmetric group. In an announcement, Kh'elif states that every countable subset of Aut is contained in an -generated subgroup of Aut for some fixed . We show that the least such is . Moreover, for every countable subset of Aut, we show that every element can be given as a prescribed product of two generators without using their inverses. More precisely, suppose that and freely generate the free semigroup consisting of the non-empty words over and . Then we show that there exists a sequence of words over such that for every sequence Aut there is a homomorphism Aut where for every . As a corollary to the main theorem in this paper, we obtain a result of Droste and Holland showing that the strong cofinality of Aut$(, \leq)(, \leq)$ has uncountable cofinality and Bergman’s property.

生成讲解博客的中文版本

生成AI智能校验的中文版本