PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
modular lattice (Definition)

A lattice $ L$ is said to be modular if $ x \lor (y \land z) = (x \lor y) \land z$ for all $ x,y,z\in L$ such that $ x \leq z$. In fact it is sufficient to show that $ x \lor (y \land z) \ge (x \lor y) \land z$ for all $ x,y,z\in L$ such that $ x \leq z$, as the reverse inequality holds in all lattices (see modular inequality).

There are a number of other equivalent conditions for a lattice $ L$ to be modular:

  • $ (x\land y)\lor (x\land z)=x\land (y\lor (x\land z))$ for all $ x,y,z\in L$.
  • $ (x\lor y)\land (x\lor z)=x\lor (y\land (x\lor z))$ for all $ x,y,z\in L$.
  • For all $ x,y,z\in L$, if $ x<z$ then either $ x\land y<z\land y$ or $ x\lor y<z\lor y$.

The following are examples of modular lattices.

A finite lattice $ L$ is modular if and only if it is graded and its rank function $ \rho$ satisfies $ \rho(x)+\rho(y)=\rho(x\land y)+\rho(x\lor y)$ for all $ x,y\in L$.



"modular lattice" is owned by yark. [ full author list (2) | owner history (1) ]
(view preamble)

View style:

See Also: modular law, semimodular lattice, nonmodular sublattice, modular inequality

Other names:  Dedekind lattice
Also defines:  modular

Attachments:
normal subgroup lattice is modular (Derivation) by CWoo
nonmodular sublattice (Theorem) by ixionid
modular inequality (Theorem) by ixionid
Log in to rate this entry.
(view current ratings)

Cross-references: rank function, finite, modular law, submodules, group, normal subgroups, equivalent, number, modular inequality, inequality, sufficient, lattice
There are 29 references to this entry.

This is version 14 of modular lattice, born on 2002-02-24, modified 2007-04-20.
Object id is 2598, canonical name is ModularLattice.
Accessed 6460 times total.

Classification:
AMS MSC06C05 (Order, lattices, ordered algebraic structures :: Modular lattices, complemented lattices :: Modular lattices, Desarguesian lattices)

Pending Errata and Addenda
None.
[ View all 5 ]
Discussion
Style: Expand: Order:
forum policy
modular inequality by ixionid on 2007-04-16 10:16:14
Maybe the article should mention that in order to show that a lattice is modular it is really only necessary to show that x<=z implies x∨(y∧z)>=(x∨y)∧z since x<=z implies x∨(y∧z)<=(x∨y)∧z for any lattice.
[ reply | up ]

Interact
post | correct | update request | add derivation | add example | add (any)