Math 2.0

Order, lattices, ordered algebraic structures Lattices: basic notions Concept

Lattice

Summary

A lattice is a partially ordered set in which every two elements have a join and a meet. These are a least upper bound and a greatest lower bound. Equivalently, it is a set with two binary operations ∨\vee and ∧\wedge that are commutative and associative and satisfy the absorption laws. Lattices occur all over mathematics. Subsets of a set, subgroups of a group, subspaces of a vector space and open sets of a space all form lattices. Special classes such as distributive lattices and Boolean algebras are central in algebra and logic.

Where this leads

32 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Lattice_(order)
About this page