 Complemented lattice

In the mathematical discipline of order theory, a complemented lattice is a bounded lattice in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0. A relatively complemented lattice is a lattice such that every interval [c, d] is complemented. Complements need not be unique.
An orthocomplementation on a complemented lattice is an involution which is orderreversing and maps each element to a complement. An orthocomplemented lattice satisfying a weak form of the modular law is called an orthomodular lattice.
In distributive lattices, complements are unique. Every complemented distributive lattice has a unique orthocomplementation and is in fact a Boolean algebra.
Contents
Definition and basic properties
A complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b such that

 a ∨ b = 1 and a ∧ b = 0.
In general an element may have more than one complement. However, in a bounded distributive lattice every element will have at most one complement.^{[1]} A lattice in which every element has exactly one complement is called a uniquely complemented lattice.
A lattice with the property that every interval is complemented is called a relatively complemented lattice. In other words, a relatively complemented lattice is characterized by the property that for every element a in an interval [c, d] there is an element b such that

 a ∨ b = d and a ∧ b = c.
Such an element b is called a complement of a relative to the interval. A distributive lattice is complemented if and only if it is bounded and relatively complemented.^{[2]}^{[3]}
Orthocomplementation
An orthocomplementation on a bounded lattice is a function that maps each element a to an "orthocomplement" a^{⊥} in such a way that the following axioms are satisfied:
 Complement law
 a^{⊥} ∨ a = 1 and a^{⊥} ∧ a = 0.
 Involution law
 a^{⊥⊥} = a.
 Orderreversing
 if a ≤ b then b^{⊥} ≤ a^{⊥}.
An orthocomplemented lattice or ortholattice is a bounded lattice which is equipped with an orthocomplementation. The lattices of subspaces of inner product spaces, and the orthogonal complement operation in these lattices, provide examples of orthocomplemented lattices that are not, in general, distributive.^{[4]}
Boolean algebras are a special case of orthocomplemented lattices, which in turn are a special case of complemented lattices (with extra structure). These structures are most often used in quantum logic, where the closed subspaces of a separable Hilbert space represent quantum propositions and behave as an orthocomplemented lattice.
Orthocomplemented lattices, like Boolean algebras, satisfy de Morgan's laws:
 (a ∨ b)^{⊥} = a^{⊥} ∧ b^{⊥}
 (a ∧ b)^{⊥} = a^{⊥} ∨ b^{⊥}.
Orthomodular lattices
A lattice is called modular if for all elements a, b and c the implication

 if a ≤ c, then a ∨ (b ∧ c) = (a ∨ b) ∧ c
holds. This is weaker than distributivity. A natural further weakening of this condition for orthocomplemented lattices, necessary for applications in quantum logic, is to require it only in the special case b = a^{⊥}. An orthomodular lattice is therefore defined as an orthocomplemented lattice such that for any two elements the implication

 if a ≤ c, then a ∨ (a^{⊥} ∧ c) = c
holds.
Lattices of this form are of crucial importance for the study of quantum logic, since they are part of the axiomisation of the Hilbert space formulation of quantum mechanics. Garrett Birkhoff and John von Neumann observed that the propositional calculus in quantum logic is "formally indistinguishable from the calculus of linear subspaces [of a Hilbert space] with respect to set products, linear sums and orthogonal complements" corresponding to the roles of and, or and not in Boolean lattices. This remark has spurred interest in the closed subspaces of a Hilbert space, which form an orthomodular lattice.^{[5]}
External links
 Complemented lattice on PlanetMath
 Relative complement on PlanetMath
 Uniquely complemented lattice on PlanetMath
 Orthocomplemented lattice on PlanetMath
Notes
 ^ Grätzer (1971), Lemma I.6.1, p. 47. Rutherford (1965), Theorem 9.3 p. 25.
 ^ Grätzer (1971), Lemma I.6.2, p. 48. This result holds more generally for modular lattices, see Exercise 4, p. 50.
 ^ Birkhoff (1961), Corollary IX.1, p. 134
 ^ The Unapologetic Mathematician: Orthogonal Complements and the Lattice of Subspaces.
 ^ Ranganathan Padmanabhan; Sergiu Rudeanu (2008). Axioms for lattices and boolean algebras. World Scientific. p. 128. ISBN 9789812834546. http://books.google.com/books?id=JlXSlpmlSv4C&pg=PA128.
References
 Birkhoff, Garrett (1961). Lattice Theory. American Mathematical Society.
 Grätzer, George (1971). Lattice Theory: First Concepts and Distributive Lattices. W. H. Freeman and Company. ISBN 9780716704423.
 Grätzer, George (1978). General Lattice Theory. Basel, Switzerland: Birkhäuser. ISBN 9780122957505
 Rutherford, Daniel Edwin (1965). Introduction to Lattice Theory. Oliver and Boyd.
Categories: Lattice theory

Wikimedia Foundation. 2010.
Look at other dictionaries:
Relatively complemented lattice — In mathematics, a relatively complemented lattice is a lattice L in which for all a , b , c in L with a le; b le; c there is some x in L such that x or; b = c and x and; b = a . An element x with this property is a complement of b relative to the … Wikipedia
Complemented group — In mathematics, in the realm of group theory, the term complemented group is used in two distinct, but similar ways. In (Hall 1937), a complemented group is one in which every subgroup has a group theoretic complement. Such groups are called… … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Lattice of subgroups — In mathematics, the lattice of subgroups of a group G is the lattice whose elements are the subgroups of G, with the partial order relation being set inclusion.In this lattice, the join of two subgroups is the subgroup generated by their union,… … Wikipedia
complemented — /kom pleuh men tid/, adj. 1. having a complement or complements. 2. Math. (of a lattice containing a smallest element and a greatest element) having the property that corresponding to each element of the lattice is a second element such that the… … Universalium
complemented — past of complement * * * /kom pleuh men tid/, adj. 1. having a complement or complements. 2. Math. (of a lattice containing a smallest element and a greatest element) having the property that corresponding to each element of the lattice is a… … Useful english dictionary
Orthocomplemented lattice — In lattice theory, a branch of the mathematical discipline called order theory, an orthocomplemented lattice (or just ortholattice) is an algebraic structure consisting of a bounded lattice equipped with an orthocomplementation, i.e. an order… … Wikipedia
Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most … Wikipedia
Map of lattices — The concept of a lattice arises in order theory, a branch of mathematics. The Hasse diagram below depicts the inclusion relationships among some important subclasses of lattices. Proofs of the relationships in the map 1. A boolean algebra is a… … Wikipedia
Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia