modular lattice

modular lattice

[‚mäj·ə·lər ′lad·əs]
(mathematics)
A lattice with the property that, if x is equal to or greater than z, then for any element y, the greatest lower bound of x and v equals the least upper bound of w and z, where v is the least upper bound of y and z and w is the greatest lower bound of x and y.
References in periodicals archive ?
5] Every distributive lattice is a modular lattice.
Let L be a modular lattice and D be a generalized f-derivation on L where f : L [right arrow] L is a join-homomorphism.
Full browser ?