Complemented Lattices
- From: William Elliot <marsh@xxxxxxxxxxxxxxxxxx>
- Date: 17 Sep 2008 16:00:54 -0400
Let L be a complemented lattice. That is a lattice with
a top or max element 1 and a bottom or min element 0 and
for all x in L, some y in L with
xy = inf x,y = 0, x + y = sup x,y = 1
x and y with that property are call complements.
If L is a distributive lattice, then each element has
exactly one complement. Is the converse correct,
that if L is complemented lattice for which every element
has a unique complement, then L is distributive? How does
one go about proving that?
----
.
- Follow-Ups:
- Re: Complemented Lattices
- From: Zundark
- Re: Complemented Lattices
- Prev by Date: Re: arbitrary factorization as a difference of cubes?
- Next by Date: Re: radical ideal algorithms
- Previous by thread: 2009 World Congress on Computer Science and Information Engineering (CSIE 2009)
- Next by thread: Re: Complemented Lattices
- Index(es):
Relevant Pages
|