Gallai Decomposition of Ordered Groups: Subgroups, Quotients, and the $N$-free Case

Abstract

We study Gallai decomposition for groups equipped with two-sided invariant partial orders. The key algebraic step extends to arbitrary binary relations compatible with the group operation: if all left and right translations preserve a binary relation $\rho$, then every least strong module $S_{\rho}(\e,g)$, $g\ne\e$, is a subgroup. For a partial order this subgroup is convex. Thus the robust modules through the identity of an ordered group form a canonical chain of convex subgroups, with each canonical factor $H/H^-$ prime, totally ordered, or equality-ordered. We characterize exactly the subgroups that are modules, show that they form a complete sublattice of the subgroup lattice, establish overlap and inheritance results for arbitrary subgroups, and prove compatibility with quotients by normal strong subgroups. For $N$-free ordered groups the prime factors disappear. Using the robust-module decomposition of cographs, we characterize all two-sided invariant $N$-free partial orders by reduced admissible two-coloured subgroup chains, with totally ordered and equality-ordered canonical factors; the order is determined by the first nontrivial factor of each element. We also determine how the canonical decomposition restricts to arbitrary subgroups, characterize finite width and prove width divisibility for subgroups, and show that every reduced two-coloured chain is realized by an $N$-free ordered abelian group whose canonical factors are isomorphic to $\mathbb Z$.