Wreath products of ordered permutation groups (Q2542755): Difference between revisions

Hahn's well-known theorem on the structure of abelian totally ordered groups states that every such group can be embedded in a lexicographically ordered direct sum of copies of the ordered group of real numbers. The authors generalize this to nonabelian ordered permutation groups as follows: They introduce the concept of the ordered wreath product \({}^*\prod_{\gamma\in\Gamma}(G_\gamma,S_\gamma)\) of a family \((G_\gamma,S_\gamma)\) of transitive ordered permutation groups, indexed by the elements \(\gamma\) of a chain \(\Gamma\) (each \(G\) is a group of o-permutations of the corresponding chain \(S_\gamm)a\). Given now a transitive ordered permutation group \((G,S)\) they extract the chain of its o-primitive components \((G_\gamma,S_\gamma)\), \(\gamma\in\Gamma\), and then show how \((G,S)\) can be embedded in \({}^*\prod_{\gamma\in\Gamma}(G_\gamma,S_\gamma)\). If \((G,S)\) is lattice-ordered, then so are the components as well as their wreath product and the embedding is a lattice-isomorphism. A consequence is that every totally ordered group can be o-embedded in a (lattice-ordered) wreath product of subgroups of the real numbers. However, this latter wreath product is not itself totally ordered.