|
|
|
|
geometric lattice
|
(Definition)
|
|
|
A lattice is said to be geometric if it is
- algebraic,
- semimodular, and
- each compact element is a join of atoms.
By the definition of compactness, the last condition is equivalent to “each compact element is a finite join of atoms”.
Three examples that come to mind are
From the last two examples, one sees how the name “geometric” lattice is derived.
To generate geometric lattices from existing ones, one has the following
Proof. Let  be a geometric lattice and ![$ I=[x,y]$ $ I=[x,y]$](http://images.planetmath.org:8080/cache/objects/7972/l2h/img3.png) a lattice interval of  . We first prove that  is algebraic, that is,  is both complete and that every element is a join of compact elements. Since  is complete, both  and
 exist in  for any subset
 . Since
 for each  ,  and
 are in fact in  . So  is a complete lattice.
Now, suppose that . Since is algebraic, is a join of compact elements in :
, where each is compact in . Since , the elements
are in for each . So
. We want to show that each is compact in . Since is compact in ,
, where are atoms in . Then
. Let be a subset of such that
. Since
and is an atom in and hence compact, there is a finite subset
such that
. Because
,
, and so
, meaning that
is compact in . This shows that , as a finite join of compact elements in , is compact in as well. In turn, this shows that is a join of compact elements in .
Since is both complete and each of its elements is a join of compact elements, is algebraic.
Next, we show that is semimodular. If with
( is covered by ). Since is semimodular,
. As is the least upper bound of
,
, and thus
. So is semimodular.
Finally, we show that every compact element of is a finite join of atoms in . Suppose is compact. Then certainly
. Consequently,
for some finite subset of . But since is atomistic, each element in is a join of atoms in . Take the join of each of the atoms with , we get either
or an atom in . Thus, each element in is a join of atoms in and hence is a join of atoms in . 
Note that in the above proof, is in fact a finite join of atoms in , for if
, then
. Otherwise,
covers (since is semimodular), which means that
is an atom in .
Remark. In matroid theory, where geometric lattices play an important role, lattices considered are generally assumed to be finite. Therefore, any lattice in this context is automatically complete and every element is compact. As a result, any finite lattice is geometric if it is semimodular and atomistic.
|
"geometric lattice" is owned by CWoo. [ full author list (2) ]
|
|
(view preamble)
Cross-references: theory, matroid, covers, atomistic, least upper bound, finite, compact, complete lattice, subset, complete, algebraic, lattice interval, generate, vector space, subspaces, projective geometry, bottom, empty set, incidence geometry, power set, equivalent, atoms, join, compact element, lattice
There are 3 references to this entry.
This is version 8 of geometric lattice, born on 2006-06-08, modified 2007-06-22.
Object id is 7972, canonical name is GeometricLattice.
Accessed 1780 times total.
Classification:
| AMS MSC: | 06C10 (Order, lattices, ordered algebraic structures :: Modular lattices, complemented lattices :: Semimodular lattices, geometric lattices) | | | 05B35 (Combinatorics :: Designs and configurations :: Matroids, geometric lattices) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|