A value of is a convex lattice subgroup maximal among those omitting . Zorn's lemma supplies a value: the union of a chain of convex lattice subgroups omitting still omits . Such subgroups are prime. Their unique cover is the smallest convex lattice subgroup properly containing them.
Let in a lattice-ordered group. Under the displayed hypothesis, suppose and choose a value of . If , then contradicts its omission. Otherwise extend to a value of . The right-coset test is . If , put . Then , while its inverse positive part is . These parts have meet one, so primeness of forces . If , put and ; the disjoint pair and gives the same contradiction. No normality assumption is used in this separation argument.
If is a value in a lattice-ordered group of , every convex lattice subgroup strictly containing contains . Thus the convex lattice subgroup generated by and is the unique least subgroup properly containing . It is called the cover of . There is no intermediate convex lattice subgroup. A normal-valued lattice-ordered group requires to be a normal subgroup of this cover, not necessarily of the whole group. Values are prime convex lattice subgroups: maximality omitting makes them meet-irreducible in the lattice of convex lattice subgroups, so their ordered right cosets form a chain.
Under the inequality in one-sided bounds for adjoining a positive element, if belongs to the cover of a value in a lattice-ordered group but not to , then . Thus every in the cover is bounded above by both and for suitable nonnegative and integers . The corresponding right and left coset bounds give the displayed cofinality, without first assuming that is normal. Left-coset order is obtained by inversion of right-coset order.

Articles by others on the same topic (0)

There are currently no matching articles.