Unique factorization in partially ordered sets
HTML articles powered by AMS MathViewer
- by Jorge Martinez PDF
- Proc. Amer. Math. Soc. 33 (1972), 213-220 Request permission
Abstract:
Call an ideal of a lattice L regular if it is maximal with respect to not containing some element of L. If the ideal M is maximal without $x \in L$ we say M is a value of x. A special ideal K is a regular ideal which is maximal without some element having only one value (namely K). Our main theorem is that the following three statements are equivalent: (1) The lattice of ideals of the lattice L is completely distributive. (2) Each regular ideal is special. (3) L is distributive, and each element $x \in L$ can be written uniquely as a finite join of pairwise incomparable, finitely join irreducible elements of L. By carefully generalizing our notions to partially ordered sets we get a similar theorem in this context.References
- James C. Abbott, Sets, lattices, and Boolean algebras, Allyn and Bacon, Inc., Boston, Mass., 1969. MR 0242723
- Garrett Birkhoff, Lattice theory, 3rd ed., American Mathematical Society Colloquium Publications, Vol. XXV, American Mathematical Society, Providence, R.I., 1967. MR 0227053
- Garrett Birkhoff and Orrin Frink Jr., Representations of lattices by sets, Trans. Amer. Math. Soc. 64 (1948), 299–316. MR 27263, DOI 10.1090/S0002-9947-1948-0027263-2
- Paul Conrad, The lattice of all convex $l$-subgroups of a lattice-ordered group, Czechoslovak Math. J. 15(90) (1965), 101–123 (English, with Russian summary). MR 173716
- S. Papert, Which distributive lattices are lattices of closed sets?, Proc. Cambridge Philos. Soc. 55 (1959), 172–176. MR 104601
Additional Information
- © Copyright 1972 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 33 (1972), 213-220
- MSC: Primary 06A10
- DOI: https://doi.org/10.1090/S0002-9939-1972-0292723-5
- MathSciNet review: 0292723