Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-07-06T17:44:35.461Z Has data issue: false hasContentIssue false

Lattice-ordered groups having at most two disjoint elements

Published online by Cambridge University Press:  18 May 2009

P. F. Conrad
Affiliation:
Tulane University of Louisiana, New Orleans, Louisiana, U.S.A.
A. H. Clifford
Affiliation:
Tulane University of Louisiana, New Orleans, Louisiana, U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let L = L( +, v, ^) be a lattice-ordered group, or l-group (Birkhoff [1, p. 214]). Two elements a and b of L will be called disjoint if a > 0, b > 0, and a ^; b = 0. It is easily seen that if L does not contain two disjoint elements, then it is linearly ordered (and, of course, conversely). What can we say about Z-groups containing two but not more than two mutually disjoint elements?

Let Aand B be linearly ordered groups (o-groups), and let AB be the cardinal sum of A and B. That is, AB is the direct sum of A and B, and (a, b) is positive in A + B if and only if a is positive in A and b is positive in B. An l-group L containing AB as a convex normal subgroup (or Z-ideal) is called a lexico-extension of AB if every positive element of L not in AB exceeds every element of AB. It then follows (subsection 2.9 below) that L/(AB) is an o-group. Such an l-group L is easily seen to satisfy the following condition: (D)

There exists a pair of disjoint elements in L, but no triple of pairwise disjoint elements exists in L.

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1960

References

1.Birkhoff, Garrott, Lattice theory, Amer. Math. Soc. Colloquium Publication, Rev. Ed. (1948).Google Scholar
2.Jaffard, Paul, Contribution à l'étude dos groupes ordonnés, J. Math. Pures Appl. (9) 32 (1953), 203280.Google Scholar