An order on
is a subset
that satisfies the three axioms:
;
; and
.
We recall from [1] the following property of orders.
When is discrete, Theorem 2.1
can be deduced from
the proof of Hahn's Embedding Theorem for
orders (see [13, Theorem 16, p.59]).
The general case treated in Theorem 2.1
accounts for the measure theoretic aspect of orders.
The proof is
based on the study of orders of Hewitt and Koshi [18].
For
with
, let
If is
a subset of a topological space, we will use
and
to denote the closure, respectively, the interior
of
.
(c) Let
be a continuous
homomorphism between two ordered groups. We say that
is order-preserving if
.
Consequently, if
is continuous and order preserving, then
.
For each
, let
denote the
quotient homomorphism
.
Because
is a principal subgroup, we can define an order
on
by setting
. Moreover, the principal convex subgroups
in
are precisely the images by
of the principal convex subgroups of
containing
. (See [1, Section 2].)
We end this section with a useful property of orders.
Proof. If is discrete, there is nothing to prove. If
is not discrete, the subgroup
is open and nonempty. Hence the set
is nonempty, with 0 as a limit
point. Given an open nonempty neighborhood
of 0,
let