Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $(A,\leq)$ be a lattice. Show that $A$ is modular if and only if for all $x,y,z\in A$, $(x\wedge z)\vee (y\wedge z)=[(x\wedge z)\vee y]\wedge z$.

How can I start this problem?

share|improve this question
add comment

1 Answer

I'm using the following definition of modularity of a lattice: For all $x,y,z$, $$x \leq z \;\Rightarrow\; x \vee ( y \wedge z ) = ( x \vee y ) \wedge z.$$

Hint: In one direction note that $x \wedge z \leq z$. In the opposite direction note that $x \leq z$ is equivalent to $x \wedge z = x$

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.