Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T01:20:23.957Z Has data issue: false hasContentIssue false

Chains in generalized Boolean lattices

Published online by Cambridge University Press:  09 April 2009

Richard D. Byrd
Affiliation:
Department of MathematicsUniversity of Houston, Texas 77004, U.S.A.
Roberto A. Mena
Affiliation:
Department of MathematicsUniversity of Houston, Texas 77004, 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.

A chain C in a distributive lattice L is called strongly maximal in L if and only if for any homomorphism φ of L onto a distributive lattice K, the chain (Cφ)0 is maximal in K, where (Cφ)0 = Cφ if 0 ∉ K, and (Cφ)0 = Cφ ∪ {0}, otherwise. Gratzer (1971, Theorem 28) states that if B is a generalized Boolean lattice R-generated by L and C is a chain in L, then C R-generates B if and only if C is strongly maximal in L. In this note (Theorem 4.6), we prove the following assertion, which is not far removed from Gratzer's statement: let B be a generalized Boolean lattice R-generated by L and C be a chain in L. If 0 ∈ L, then C generates B if and only if C is strongly maximal in L. If 0 ∉ L, then C generates B if and only if C is strongly maximal in L and [C)L = L. In Section 5 (Example 5.1) a counterexample to Gratzer's statement is provided.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1976