Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-26T07:52:25.524Z Has data issue: false hasContentIssue false

On multilattice groups. II

Published online by Cambridge University Press:  24 October 2008

D. B. Mcalister
Affiliation:
Queen's University, Belfast

Extract

Conrad ((2)), has shown that any lattice group which obeys (C.F.) each strictly positive element exceeds at most a finite number of pairwise orthogonal elements may be constructed, from a family of simply ordered groups, by carrying out, alternately, the operations of forming finite direct sums and lexico extensions, at most a countable number of times. The main result of this paper, Theorem 3.1, gives necessary and sufficient conditions for a multilattice group, which obeys (ℋ*), to be isomorphic to a multilattice group which is constructed from a family of almost ordered groups, by carrying out, alternately, the operations of forming arbitrary direct sums and lexico extensions, any number of times; we call such a group a lexico sum of the almost ordered groups.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1966

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Benado, M.Les ensembles partiellement ordonnées et le théorème de raffinement de Schreier, II. Czechoslovak Math. J. (5) 80 (1955), 308344.CrossRefGoogle Scholar
(2)Conrad, P.Some structure theorems for lattice groups. Trans. Amer. Math. Soc. 99 (1961) 212240.CrossRefGoogle Scholar
(3)Jaffard, P.Contribution à l'étude des groupes ordonnées. J. Math. Pures Appl. 32 (1953), 208280.Google Scholar
(4)Mcalister, D. B.On multilattice groups. Proc. Cambridge Philos. Soc. 61 (1965), 621638.CrossRefGoogle Scholar