Ordered Groups and Infinite Permutation Groups

Ordered Groups and Infinite Permutation Groups

4.11 - 1251 ratings - Source

The subjects of ordered groups and of infinite permutation groups have long en joyed a symbiotic relationship. Although the two subjects come from very different sources, they have in certain ways come together, and each has derived considerable benefit from the other. My own personal contact with this interaction began in 1961. I had done Ph. D. work on sequence convergence in totally ordered groups under the direction of Paul Conrad. In the process, I had encountered qpseudo-convergentq sequences in an ordered group G, which are like Cauchy sequences, except that the differences be tween terms of large index approach not 0 but a convex subgroup G of G. If G is normal, then such sequences are conveniently described as Cauchy sequences in the quotient ordered group GIG. If G is not normal, of course GIG has no group structure, though it is still a totally ordered set. The best that can be said is that the elements of G permute GIG in an order-preserving fashion. In independent investigations around that time, both P. Conrad and P. Cohn had showed that a group admits a total right ordering if and only if the group is a group of automor phisms of a totally ordered set. (In a right ordered group, the order is required to be preserved by all right translations, unlike a (two-sided) ordered group, where both right and left translations must preserve the order.V Y In the diagram, a, ftalt;f, b refer to maximal chains, and Ki, /r2, TT;I refer to nodes . Note that in the diagram, K\ , rr2, rT3 are comparable nodes under f, , and that n TT, = and rr3 = N {7, So, TTI alt;. TT2 alt;. ir3. But there is no element in G that fixesanbsp;...

Title:Ordered Groups and Infinite Permutation Groups
Author:W.C. Holland
Publisher:Springer Science & Business Media - 1996


You Must CONTINUE and create a free account to access unlimited downloads & streaming