Professional Documents
Culture Documents
First
First
Abstract
moduler lettices.
1 Introduction
a lattice in the real coordinate spaceRn isaninf initesetof pointsinthisspacewiththepropertiesthatcoordinatewiseadditiono
a lattice can be described as a free abelian group of dimension nnwhichspansthevectorspaceRn .F oranybasisof Rn , thesu
2 moduler lettices
a modular lattice is a lattice that satisfies the following self-dual condition: Modular law a b implies
a (x b) = (a x) b where x, a, b are arbitrary elements in the lattice, is the partial order, and
and (called join and meet respectively) are the operations of the lattice. This phrasing emphasizes an
interpretation in terms of projection onto the sublattice [a, b].
1
2.2 properties of moduler lettices
1. In every finite modular lattice, the number of join-irreducible elements equals the number of meet-
irreducible elements,More generally, for every k, the number of elements of the lattice that cover exactly
k other elements equals the number that are covered by exactly k other elements.
2.A useful property to show that a lattice is not modularis as follows:
A lattice G is modular if and only if, for any a, b, c G, (c ≤ a) and (a ∧ b = c ∧ b) and (a ∨ b =
c ∨ b) ⇒ (a = c) (c ≤ a) and (a ∧ b = c ∧ b) and (a ∨ b = c ∨ b) ⇒ (a = c).
proof: Let G be modular, and let the premise of the implication hold. Then using absorption and
modular identity:
c = (cb) c = (ab) c = a (bc) = a (ba) = a For the other direction, let the implication of the
theorem hold in G. Let a,b,c be any elements in G, such that c a. Let x = (ab) c, y = a (bc). From
the modular inequality immediately follows that x y. If we show that xb = yb, xb = yb, then using
the assumption x = y must hold. The rest of the proof is routine manipulation with infima, suprema
and inequalities.