Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose i have a complete lattice (meet and join exist for any two subsets of the lattice) and for every element of the lattice, there is a unique element that is its complement (hence a Boolean negation). If such a lattice is also modular, then it is Boolean. Negation is a strong requirement.. If i don't know it is modular, then what kind of lattice is this? What if the lattice is also atomic?

share|cite|improve this question
up vote 2 down vote accepted

There are lattices with unique complements that are not Boolean: In his article "Lattices with unique complements", R.P. Dilworth proves that every lattice can be embedded into a lattice with unique complements. So take any non-modular lattice (e.g. $N_5$). This may be embdedded into a lattice $L$ with unique complements. Then $L$ cannot be modular since it contains a non-modular sublattice.

In this book review of "Lattices with Unique Complements" by V. N. Salii the author mentions at the end that the question whether there exist complete non-distributive lattices with unique complements is still unsolved (by 1990).

However it is true that every atomic complete lattice with unique complements is Boolean (and isomorphic to the power set lattice of its atoms). For a proof, see Theorem 18 in §6 of G. Birkhoff's book "Lattice theory".

share|cite|improve this answer
Thank you very much for your informative reply. That i could not find anything about it, had to mean it was either a silly or a very difficult question. ( Now i know!) I downloaded your references and will look at them . Thanks once more! – Joseph Aug 24 '12 at 12:44

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.