In mathematics, a distributive lattice is a lattice in which the
operations of join and meet distribute over each other. The examples of such structures are collections of sets for which the lattice operations can be given by set union and intersection. DEFINATION
A lattice (L,∨,∧) is distributive if the following additional
identity holds for all x, y, and z in L: x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z). or x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z). EXAMPLES
Any power set lattice is distributive.
Every chain is distributive lattice. Every Boolean algebra is a distributive lattice. Every Heyting algebra is a distributive lattice. Especially this includes all locales and hence all open set lattices of topological spaces. Also note that Heyting algebras can be viewed as Lindenbaum algebras of intuitionistic logic, which makes them a special case of the first example. Every totally ordered set is a distributive lattice with max as join and min as meet. A lattice-ordered vector space is a distributive lattice. Young's lattice given by the inclusion ordering of Young diagrams representing integer partitions is a distributive lattice. NON-DISTRIBUTIVE LATTICES
𝑁5 lattice 𝑀3 lattice
The diamond lattice 𝑀3 is non-distributive:
x ∧ (y ∨ z) = x ∧ 1 = x ≠ 0 = 0 ∨ 0 = (x ∧ y) ∨ (x ∧ z).
The pentagon lattice 𝑁5 is non-distributive:
x ∧ (y ∨ z) = x ∧ 1 = x ≠ z = 0 ∨ z = (x ∧ y) ∨ (x ∧ z). APPLICATION OF LATTICES
One of the most important applications of lattice theory and
also one of the oldest applications of modern algebra is the use of Boolean algebras in modeling and simplifying switching or relay circuits. the algebra of switching circuits is mentioned here not only because of its importance today but also for historical reasons and because of its elegant mathematical formulation. REFERENCES
Introduction to Lattices and order (2nd edition) by B.A
Davey and H.A Priestley https://en.wikipedia.org/wiki/Distributive_lattice#Free_ distributive_lattices.