zbMATH — the first resource for mathematics

Cantor extension of a half lattice ordered group. (English) Zbl 0938.06014
Half lattice ordered groups have been studied by M. Giraudet and F. Lucas [Fundam. Math. 139, No. 2, 75-89 (1991; Zbl 0766.06014)]. Let \(G\) be a half lattice ordered group; then there are subsets \(G{\uparrow}\) and \(G{\downarrow}\) of \(G\) such that \(G{\uparrow}\cup G{\downarrow}=G\) and \(G{\uparrow}\cap G{\downarrow}=\emptyset \). Moreover, \(G{\uparrow}\) is a lattice ordered group (under the operations induced from \(G\)). The author deals with the case when the group operation in \(G{\uparrow}\) is abelian. The Cantor extension \(G'\) of \(G\) is defined by the requirements that a) \(G'\) is \(o\)-complete; b) \(G\) is an hl-subgroup of \(G'\); c) every element of \(G'\) is an \(o\)-limit in \(G'\) of a fundamental sequence in \(G\). It is proved that the Cantor extension of \(G\) exists and that it is uniquely determined up to isomorphism leaving all the elements of \(G\) fixed.

06F20 Ordered abelian groups, Riesz groups, ordered linear spaces
06F15 Ordered groups
Full Text: EuDML
[1] DASHIELL F.-HAGER A.-HENRIKSEN M.: Order-Cauchy completions ofrings and vector lattices of continuous functions. Canad. J. Math. 32 (1980), 657-685. · Zbl 0462.54009
[2] EVERETT C. J.: Sequence completion of lattice modules. Duke Math. J. 11 (1944), 109-119. · Zbl 0060.06301
[3] FUCHS L.: Partially Ordered Algebraic Systems. Pergamon Press, Oxford-London-NewYork-Paris, 1963. · Zbl 0137.02001
[4] GIRAUDET M.-LUCAS F.: Groupes a moitié ordonnés. Fund. Math. 139 (1991), 75-89. · Zbl 0766.06014
[5] PAPANGELOU F.: Order convergence and topological completion of commutative lattice-groups. Math. Ann. 155 (1964), 81-107. · Zbl 0131.02601
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.