On ordered left groups
The authors continue the generalization of concepts of semigroup theory replacing equality by a compatible partial order. Here the case of left groups is considered. A partially ordered semigroup \((S,\cdot,\leq)\) is called a left group (quite confusing) if (i) for all \(a,b\in S\) there exists \(x\in S\) such that \(a\leq xb\), and (ii) \(ac\leq bc\) \((a,b,c\in S)\) implies \(a\leq b\). \((S,\cdot,\leq)\) is called a complete left group if it is isomorphic with the direct product of a partially ordered semigroup \(T\) with \(xy= x\) for all \(x,y\in T\) and a partially ordered group \(G\) (with respect to the componentwise partial ordering). It is shown that any complete left group \((S,\cdot,\leq)\) is a left group, but not conversely. Next, if every class of the semilattice congruence \({\mathcal N}\) (defined by equality of filters in \((S,\cdot,\leq)\)) is a left group then for all \(a,b\in S\) there are \(x,y\in S\) such that \(a\leq axa\) and \(ab\leq ya\); again, the converse does not hold in general. By contrast, \((S,\cdot,\leq)\) is a left group if and only if (i) for any \(a\in S\) there exists \(x\in S\) such that \(a\leq axa\), and (ii) \(ac\leq bc\) implies that \(a\leq b\). Finally, if \((S,\cdot,\leq)\) is a left group then there exists \(e\in S\) with \(e\leq e^2\) and for all \(a,b\in S\) there is \(x\in S\) such that \(a\leq xb\); the converse does not hold in general.
scientific article; zbMATH DE number 2227257