Hostname: page-component-7b7567c8c-2rsb6 Total loading time: 0 Render date: 2026-11-13T03:51:40.045Z Has data issue: false hasContentIssue false

On Lattice Complements

Published online by Cambridge University Press:  18 May 2009

Robert Bumcrot
Affiliation:
Ohio State University Columbus, Ohio
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, ≦) be a distributive lattice with first element 0 and last element 1. If a, b in L have complements, then these must be unique, and the De Morgan laws provide complements for a ∧ b and a ∨ b. We show that the converse statement holds under weaker conditions.

Theorem 1. If(L, ≦) is a modular lattice with 0 and 1 and if a, b in L are such that a ≦b and a ≨ b have (not necessarily unique) complements, then a andb have complements.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1965