Search results
Results from the WOW.Com Content Network
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet).
A lattice in the sense of a 3-dimensional array of regularly spaced points coinciding with e.g. the atom or molecule positions in a crystal, or more generally, the orbit of a group action under translational symmetry, is a translation of the translation lattice: a coset, which need not contain the origin, and therefore need not be a lattice in ...
Superrigidity provides (for Lie groups and algebraic groups over local fields of higher rank) a strengthening of both local and strong rigidity, dealing with arbitrary homomorphisms from a lattice in an algebraic group G into another algebraic group H. It was proven by Grigori Margulis and is an essential ingredient in the proof of his ...
Modular lattice: a lattice whose elements satisfy the additional modular identity. Distributive lattice: a lattice in which each of meet and join distributes over the other. Distributive lattices are modular, but the converse does not hold. Boolean algebra: a complemented distributive lattice. Either of meet or join can be defined in terms of ...
In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations. A Boolean algebra can be seen as a generalization of a power set algebra or a field of sets, or its elements can be viewed as generalized ...
In mathematics, an algebraic structure or algebraic system [1] consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy.
A partially ordered set that is both a join-semilattice and a meet-semilattice is a lattice. A lattice in which every subset, not just every pair, possesses a meet and a join is a complete lattice. It is also possible to define a partial lattice, in which not all pairs have a meet or join but the operations (when defined) satisfy certain axioms ...
Con(A) is a complete lattice. The compact elements of Con(A) are exactly the finitely generated congruences. Con(A) is an algebraic lattice. Again there is a converse: By a theorem of George Grätzer and E. T. Schmidt, every algebraic lattice is isomorphic to Con(A) for some algebra A.