Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-26T17:25:07.841Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Structure of Finitely Presented Lattices

Published online by Cambridge University Press:  20 November 2018

G. Gratzer ,
A. P. Huhn  and
H. Lakser
G. Gratzer
Affiliation:
University of Manitoba, Winnipeg, Manitoba
A. P. Huhn
Affiliation:
University of Manitoba, Winnipeg, Manitoba
H. Lakser
Affiliation:
University of Manitoba, Winnipeg, Manitoba
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.

A lattice L is finitely presented (or presentable) if and only if it can be described with finitely many generators and finitely many relations. Equivalently, L is the lattice freely generated by a finite partial lattice A, in notation, L = F(A). (For more detail, see Section 1.5 of [6].)

It is an old “conjecture” of lattice theory that in a finitely presented (or presentable) lattice the elements behave “freely” once we get far enough from the generators.

In this paper we prove a structure theorem that could be said to verify this conjecture.

THEOREM 1. Let L be a finitely presentable lattice. Then there exists a congruence relation θ such that L/θ is finite and each congruence class is embeddable in a free lattice.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 33 , Issue 2 , 01 April 1981 , pp. 404 - 411
Copyright
Copyright © Canadian Mathematical Society 1981

References

1. Adams, M. E. and Kelly, D., Chain conditions in free products of lattices, Algebra Universalis 7 (1977), 235–243.Google Scholar
2. Dean, R. A., Completely free lattices generated by partially ordered sets, Trans. Amer. Math. Soc. 83 (1956), 238–249.Google Scholar
3. Dean, R. A., Free lattices generated by partially ordered sets and preserving bounds, Can. J. Math. 16 (1964), 136–148.Google Scholar
4. Evans, T. and Hong, D. X., The free modular lattice on four generators is not finitely presentable, Algebra Universalis 2 (1972), 284–285.Google Scholar
5. Galvin, F. and Jônsson, B., Distributive sublattices of a free lattice, Can. J. Math. 13 (1961), 265–272.Google Scholar
6. Grâtzer, G., General lattice theory (Pure and Applied Mathematics Series, Academic Press, New York, 1978).Google Scholar
7. Grâtzer, G., Lakser, H. and Piatt, C. R., Free products of lattices, Fund. Math. 69 (1970), 233–240.Google Scholar
8. Grâtzer, G. and Huhn, A. P., Common refinements of amalgamated free products of lattices, Abstract. Notices Amer. Math. Soc.Google Scholar
9. Lakser, H., Free lattices generated by partially ordered sets, Ph.D. Thesis, University of Manitoba (1968).Google Scholar
10. Wille, R., Jeder endlich erzeugte, modulare Verband endlicher Weite ist endlich, Mat. Casopis Sloven. Akad. Vied. 25 (1974), 77–80.Google Scholar