|
|
|
|
complete lattice
|
(Definition)
|
|
|
A complete lattice is a poset $P$ such that every subset of $P$ has both a supremum and an infimum in $P$
For a complete lattice $L$ the supremum of $L$ is denoted by $1$ and the infimum of $L$ is denoted by $0$ Thus $L$ is a bounded lattice, with $1$ as its greatest element and $0$ as its least element. Moreover, $1$ is the infimum of the empty set, and $0$ is the supremum of the empty set.
A countably complete lattice is a poset $P$ such that every countable subset of $P$ has both a supremum and an infimum in $P$
Let $\kappa$ be an infinite cardinal. A $\kappa$ complete lattice is a lattice $L$ such that for every subset $A\subseteq L$ with $|A|\le \kappa$ both $\bigvee A$ and $\bigwedge A$ exist. (Note that an $\aleph_0$ complete lattice is the same as a countably complete lattice.)
Every complete lattice is a $\kappa$ complete lattice for every infinite cardinal $\kappa$ and in particular is a countably complete lattice. Every countably complete lattice is a bounded lattice.
|
"complete lattice" is owned by yark. [ full author list (2) | owner history (1) ]
|
|
(view preamble | get metadata)
Cross-references: lattice, cardinal, infinite, countable, empty set, least element, greatest element, bounded lattice, infimum, supremum, subset, poset
There are 40 references to this entry.
This is version 7 of complete lattice, born on 2002-08-17, modified 2008-02-20.
Object id is 3304, canonical name is CompleteLattice.
Accessed 7633 times total.
Classification:
| AMS MSC: | 06B23 (Order, lattices, ordered algebraic structures :: Lattices :: Complete lattices, completions) | | | 03G10 (Mathematical logic and foundations :: Algebraic logic :: Lattices and related structures) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|