orthocomplemented lattice (original) (raw)

Formally, let L be a complemented lattice and denote M the set of complements of elements of L. M is clearly a subposet of L, with ≤ inherited from L. For each a∈L, let Ma⊆M be the set of complements of a. L is said to be orthocomplemented if there is a function :⟂L→M, called an orthocomplementation, whose image is written a⟂ for any a∈L, such that

1. 1. a⟂∈Ma,
2. 1. (a⟂)⟂=a, and
3. 1. ⟂ is order-reversing; that is, for any a,b∈L, a≤b impliesb⟂≤a⟂.

The element a⟂ is called an orthocomplement of a (via ⟂).

Examples. In addition to the example of the lattice of vector subspaces of a vector space cited above, let’s look at the Hasse diagrams of the two finite complemented lattices below,

the one on the right is orthocomplemented, while the one on the left is not. From this one deduces that orthcomplementation is not unique, and that the cardinality of any finite orthocomplemented lattice is even.

Remarks.

• •
  From the first condition above, we see that an orthocomplementation ⟂ is a bijection. It is one-to-one: if a⟂=b⟂, thena=(a⟂)⟂=(b⟂)⟂=b. And it is onto: if we pick a∈M⊆L, then (a⟂)⟂=a. As a result, M=L, every element of L is an orthocomplement. Furthermore, we have 0⟂=1 and 1⟂=0.
• •
  Let L′ be the dual lattice of L (a lattice having the same underlying set, but with meet and join operations switched). Then any orthocomplementation ⟂ can be viewed as a lattice isomorphism between L and L′.
• •
  From the above conditions, it follows that elements of L satisfy the de Morgan’s laws: for a,b∈L, we have

  a⟂∧b⟂=(a∨b)⟂,	(1)
  a⟂∨b⟂=(a∧b)⟂.	(2)
  To derive the first equation, first note a≤a∨b. Then (a∨b)⟂≤a⟂. Similarly, (a∨b)⟂≤b⟂. So (a∨b)⟂≤a⟂∧b⟂. For the other inequality, we start witha⟂∧b⟂≤a⟂. Then a≤(a⟂∧b⟂)⟂. Similarly, b≤(a⟂∧b⟂)⟂. Therefore, a∨b≤(a⟂∧b⟂)⟂, which implies thata⟂∧b⟂≤(a∨b)⟂.

• •
  Conversely, any of two equations in the previous remark can replace the third condition in the definition above. For example, suppose we have the second equation a⟂∨b⟂=(a∧b)⟂. If a≤b, then a=a∧b, so a⟂=(a∧b)⟂=a⟂∨b⟂, which shows that b⟂≤a⟂.
• •
  From the example above, one sees that orthocomplementation need not be unique. An orthocomplemented lattice with a unique orthocomplementation is said to be uniquely orthocomplemented. A uniquely complemented lattice that is also orthocomplemented is uniquely orthocomplemented.
• •
  Orthocomplementation can be more generally defined over a bounded poset P by requiring the orthocomplentation operator ⟂ to satisfy conditions 2 and 3 above, and a weaker version of condition 1: a∧a⟂ exists and =0. Since ⟂ is an order reversing bijection on P, 0⟂=1 and 1⟂=0. From this, one deduces that a∧a⟂=0 iff a∨a⟂=1. A bounded poset in which an orthocomplementation is defined is called an orthocomplemented poset.
• •

References

• 1 G. Birkhoff, Lattice Theory, AMS Colloquium Publications, Vol. XXV, 3rd Ed. (1967).