0% found this document useful (0 votes)
179 views13 pages

DM Unit V

Uploaded by

meyepa3209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
179 views13 pages

DM Unit V

Uploaded by

meyepa3209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Unit – V Lattice and Boolean Algebra

The following is the hasse diagram of a partially ordered set. Verify whether it is a
lattice.
d

e
b
c

a
Solution:
d and e are the upper bounds of c and b. As d and e cannot be compared,
therefore the 𝐿𝑈𝐵 𝑐, 𝑏 does not exists. The Hasse diagram is not a lattice.

Give an example of a relation which is symmetric, transitive but not reflexive on


{𝒂, 𝒃, 𝒄}
Solution:
𝑅 = { 𝑎, 𝑎 , 𝑎, 𝑏 , 𝑎, 𝑐 , 𝑏, 𝑎 , 𝑏, 𝑏 , (𝑐, 𝑎)}

Define partially ordered set.


A Set with a partially ordering relation is called a poset or partially ordered set.

Find the Partition of 𝑨 = {𝟎, 𝟏, 𝟐, 𝟑, 𝟒, 𝟓} with minsets generated by 𝑩𝟏 = {𝟎, 𝟐, 𝟒}


and 𝑩𝟐 = {𝟏, 𝟓}.
Solution:
𝐵1 ∩ 𝐵2 = ∅, 𝐵1 ∪ 𝐵2 = 0, 1, 2, 4, 5 ≠ 𝐴 , 𝐵1 ∪ 𝐵2 ′ = 3
𝐵1 ∪ 𝐵2 ∪ 𝐵1 ∩ 𝐵2 ′ = 0, 1, 2, 3, 4, 5 = 𝐴
Partition of 𝐴 = {0, 2, 4}, {1, 5}, {3}

If a poset has a least element, then prove it is unique.


Proof:
Let 𝑳, ≤ be a poset with 𝑎1 , 𝑎2 be two least elements.
If 𝑎1 is the least element, 𝑎1 ≤ 𝑎2
If 𝑎2 is the least element 𝑎2 ≤ 𝑎1
By antisymmetric property 𝑎1 = 𝑎2
So that least element is unique.

If 𝑹 = {(𝟏, 𝟏), (𝟏, 𝟐), (𝟐, 𝟑)} and 𝑺 = {(𝟐, 𝟏), (𝟐, 𝟐), (𝟑, 𝟐)} are the relations on
the set 𝑨 = {𝟏, 𝟐, 𝟑} . Verify whether 𝑹𝒐𝑺 = 𝑺𝒐𝑹 by finding the relation matrices of
𝑹𝒐𝑺 and 𝑺𝒐𝑹.
Solution:

www.tranquileducation.weebly.com 1
1 1 0 0 0 0
𝑀𝑅 = 0 0 1 , 𝑀𝑠 = 1 1 0
0 0 0 0 1 0
1 1 0 0 0 0
𝑀𝑅𝑜𝑆 = 0 1 0 𝑎𝑛𝑑 𝑀𝑆𝑜𝑅 = 1 1 1
0 0 0 0 0 1
𝑀𝑅𝑜𝑆 ≠ 𝑀𝑆𝑜𝑅 𝑅𝑜𝑆 ≠ 𝑆𝑜𝑅

In the following lattice find 𝒃𝟏 ⨁𝒃𝟑 ∗ 𝒃𝟐


1

𝒃e𝟐 𝒃𝟑
𝒃𝟏

0
Solution:
𝑏1 ⨁𝑏3 = 1. Hence 𝑏1 ⨁𝑏3 ∗ 𝑏2 = 1 ∗ 𝑏2 = 𝑏2

If 𝑨𝟐 = 𝟏, 𝟐 , 𝟑 , 𝑨𝟐 = 𝟏 , 𝟐, 𝟑 𝒂𝒏𝒅 𝑨𝟑 = {{𝟏, 𝟐, 𝟑}} then show that


𝑨𝟏 , 𝑨𝟐 𝒂𝒏𝒅 𝑨𝟑 are mutually disjoint.
Solution:
𝐴1 ∩ 𝐴2 = ∅, 𝐴1 ∩ 𝐴3 = ∅, 𝐴2 ∩ 𝐴3 = ∅
Hence 𝐴1 , 𝐴2 𝑎𝑛𝑑 𝐴3 are mutually disjoint.

Let 𝒙 = {𝟏, 𝟐, 𝟑, 𝟒}. If


𝑹 = < 𝑥, 𝑦 > | 𝒙 ∈ 𝑿 ⋀ 𝒚 ∈ 𝑿⋀(𝒙 − 𝒚)𝒊𝒔 𝒂𝒏 𝒏𝒐𝒏𝒛𝒆𝒓𝒐 𝒎𝒖𝒍𝒕𝒊𝒑𝒍𝒆 𝒐𝒇 𝟐
𝑺 = < 𝑥, 𝑦 > | 𝑥 ∈ 𝑿 ⋀ 𝒚 ∈ 𝑿⋀(𝒙 − 𝒚)𝒊𝒔 𝒂𝒏 𝒏𝒐𝒏𝒛𝒆𝒓𝒐 𝒎𝒖𝒍𝒕𝒊𝒑𝒍𝒆 𝒐𝒇 𝟑
Find 𝑹 ∪ 𝑺 𝒂𝒏𝒅 𝑹 ∩ 𝑺.
Solution:
𝑅 = 1, 3 , 3, 1 , 2, 4 , (4, 2) , 𝑆 = 1, 4 , (4, 1)
𝑅 ∪ 𝑆 = 1, 3 , 3, 1 , 2, 4 , 4, 2 , 1, 4 , (4, 1) , 𝑅 ∩ 𝑆 = ∅
𝑅 ∩ 𝑆 = < 𝑥, 𝑦 > | 𝑥 ∈ 𝑋 ⋀ 𝑦 ∈ 𝑋⋀(𝑥 − 𝑦)is an nonzero multiple of 6

If 𝑹 and 𝑺 are reflexive relations on a set 𝑨, then show that 𝑹 ∪ 𝑺 𝒂𝒏𝒅 𝑹 ∩ 𝑺 are also
reflexive relations on 𝑨.
Solution:
Let 𝑎 ∈ 𝐴. Since 𝑅 𝑎𝑛𝑑 𝑆 are reflexive.
We have 𝑎, 𝑎 ∈ 𝑅 𝑎𝑛𝑑 𝑎, 𝑎 ∈ 𝑆 𝑎, 𝑎 ∈ 𝑅 ∩ 𝑆
Hence 𝑅 ∩ 𝑆 is reflexive.
𝑎, 𝑎 ∈ 𝑅 𝑜𝑟 𝑎, 𝑎 ∈ 𝑆 𝑎, 𝑎 ∈ 𝑅 ∪ 𝑆
Hence 𝑅 ∪ 𝑆 is reflexive.

www.tranquileducation.weebly.com 2
Define Equivalence relation. Give an example
Solution:
A relation 𝑅 in a set 𝐴 is called an equivalence relation if it is reflexive, symmetric and
transitive.
Eg: i) Equality of numbers on a set of real numbers
ii) Relation of lines being parallel on a set of lines in a plane.
Let 𝑿 = 𝟐, 𝟑, 𝟔, 𝟏𝟐, 𝟐𝟒, 𝟑𝟔 and the relation be such that 𝒙 ≤ 𝒚 𝒊𝒇𝒇
𝒙 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝒚. Draw the Hasse Diagram of 𝑿, ≤ .
Solution:
The Hasse diagram is
24 36

12

2 3

Let 𝑨 be a given finite set and 𝑷 𝑨 its power set. Let ⊆ be the inclusion relation on
the elements of 𝑷 𝑨 . Draw Hasse diagram of 𝑷 𝑨 , ≤ for 𝑨 = 𝒂, 𝒃, 𝒄
Solution:
{𝒂, 𝒃, 𝒄}

{𝒂, 𝒃} {𝒂, 𝒄} {𝒃, 𝒄}

{𝒂} {𝒃} {𝒄}

𝟏 𝟏 𝟏
Write the representing each of the relations from 𝟏 𝟎 𝟏
𝟏 𝟏 𝟏
Solution:
Let 𝐴 = 1, 2, 3 and 𝑅 be the relation defined on 𝐴 corresponding to the given
matrix. ∴ 𝑅 = {(1,1), (1,2), (1,3), (2,1), (2,3), (3,1), (3,2), (3,3)}

Which elements of the poset {𝟐, 𝟒, 𝟓, 𝟏𝟎, 𝟏𝟐, 𝟐𝟎, 𝟐𝟓},/ are maximal and which are
minimal?
(or)

www.tranquileducation.weebly.com 3
Give an example for a poset that have more than one maximal element and more than
one minimal element.
Solution:
𝐴 = {2, 4, 5, 10, 12, 20, 25}, / , / 𝑖𝑠 𝑡𝑕𝑒 𝑑𝑖𝑣𝑖𝑠𝑖𝑜𝑛 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛.
The maximal elements are 12, 20, 25 and the minimal elements are 2,5 .

Define Lattice
A Lattice in a partially ordered set 𝑳, ≤ in which every pair of elements 𝑎, 𝑏 ∈ 𝐿 has
the greatest lower bound and a least upper bound.

Let 𝑳, ≤ be a lattice. For any 𝒂, 𝒃, 𝒄 ∈ 𝑳 we have 𝒂 ∗ 𝒂 = 𝒂


Solution:
Since 𝑎 ≤ 𝑎, 𝑎 is a lower bound of {𝑎}. If b is any lower bound of {𝑎}, then we have
𝑏 ≤ 𝑎. Thus we have 𝑎 ≤ 𝑎 or 𝑏 ≤ 𝑎 equivalently, 𝑎 is an lower bound for 𝑎 and any
other lower bound of 𝑎 is smaller than 𝑎. This shows that 𝑎 is the greatest lower
bound of {𝑎}, i.e., 𝐺𝐿𝐵{𝑎, 𝑎} = 𝑎
∴ 𝑎 ∗ 𝑎 = 𝐺𝐿𝐵 𝑎, 𝑎 = 𝑎

Define sublattice
Let 𝐿,∗, ⨁ be a lattice and let 𝑆 ⊆ 𝐿 be a subset of L. Then 𝑆,∗, ⨁ is a sublattice of
𝐿,∗, ⨁ iff S is closed under both operations ∗ and ⨁.

Define Lattice Homomorphism


Let 𝐿,∗, ⨁ and 𝑆, ⋀, ⋁ be two lattices. A mapping 𝑔: 𝐿 → 𝑆 is called a lattice
homomorphism from the lattice 𝐿,∗, ⨁ to 𝑆, ⋀, ⋁ if for any 𝑎, 𝑏 ∈ 𝐿
𝑔(𝑎 ∗ 𝑏) = 𝑔(𝑎) ⋀ 𝑔(𝑏) 𝑎𝑛𝑑 𝑔(𝑎⨁𝑏) = 𝑔(𝑎) ⋁𝑔(𝑏)

Define Modular
A lattice 𝐿,∗, ⨁ is called modular if for all 𝑥, 𝑦, 𝑧 ∈ 𝐿
𝑥 ≤ 𝑧 𝑥 ⨁ (𝑦 ∗ 𝑧) = (𝑥 ⨁ 𝑦) ∗ 𝑧
Define Distributive lattice.
A Lattice 𝐿,∗, ⨁ is called a distributive lattice if for any 𝑎, 𝑏, 𝑐 ∈ 𝐿
𝑎 ∗ (𝑏⨁𝑐) = (𝑎 ∗ 𝑏) ⨁ (𝑎 ∗ 𝑐 )
𝑎⨁(𝑏 ∗ 𝑐) = (𝑎⨁𝑏) ∗ (𝑎⨁𝑐)

Prove that every distributive lattice is modular.


Proof:
Let 𝐿,∗, ⨁ be a distributive lattice.
∀𝑎, 𝑏, 𝑐 ∈ 𝐿 we have , 𝑎⨁ 𝑏 ∗ 𝑐 = 𝑎⨁𝑏 ∗ 𝑎⨁𝑐 … (1)
Thus if 𝑎 ≤ 𝑐 then 𝑎⨁𝑐 = 𝑐 … (2)
from (1) and (2) we get
𝑎⨁(𝑏 ∗ 𝑐) = (𝑎⨁𝑏) ∗ 𝑐
So if 𝑎 ∗ 𝑐,then 𝑎⨁ 𝑏 ∗ 𝑐 = 𝑎⨁𝑏 ∗ 𝑐.
∴ 𝐿 is modular.

www.tranquileducation.weebly.com 4
The lattice with the following Hasse diagram is not distributive and not modular.
1

𝒙𝟐

𝒙𝟏
𝒙𝟑

0
Solution:
In this case, (𝑥1 ⨁𝑥3 ) ∗ 𝑥2 = 1 ∗ 𝑥2 = 𝑥2 … (1)
And (𝑥1 ∗ 𝑥2 ) ⨁(𝑥3 ∗ 𝑥2 ) = 0 ⨁ 𝑥3 = 𝑥3 … (2)
From (1) and (2) we get
𝑥1 ⨁𝑥3 ∗ 𝑥2 ≠ (𝑥1 ∗ 𝑥2 ) ⨁(𝑥3 ∗ 𝑥2 )
Hence the lattice is not distributive.
𝑥3 < 𝑥2 𝑥3 ⨁ 𝑥1 ∗ 𝑥2 = 𝑥3 ⨁ 0 = 𝑥3 … (3)
𝑥3 ⨁𝑥1 ∗ 𝑥2 = 1 ∗ 𝑥2 = 𝑥2 … (4)
From (3) and (4) we get
𝑥3 ⨁ 𝑥1 ∗ 𝑥2 ≠ 𝑥3 ⨁𝑥1 ∗ 𝑥2
Hence the lattice is not modular.
PART-B

In a Lattice, show that 𝒂 = 𝒃 𝒂𝒏𝒅 𝒄 = 𝒅 𝒂∗𝒄= 𝒃∗𝒅


Solution:
For any 𝑎, 𝑏, 𝑐 ∈ 𝐿
If 𝑎 = 𝑏 𝑐 ∗ 𝑎 ≤ 𝑐 ∗ 𝑏
𝑎 ∗ 𝑐 ≤ 𝑏 ∗ 𝑐 … 1 (𝐵𝑦 𝐶𝑜𝑚𝑚𝑢𝑡𝑎𝑡𝑖𝑣𝑒 𝑙𝑎𝑤)
For any 𝑏, 𝑐, 𝑑 ∈ 𝐿
If 𝑐 = 𝑑 𝑏 ∗ 𝑐 ≤ 𝑏 ∗ 𝑑 … (2)
From (1) and (2) we get
𝑎∗𝑐 =𝑏∗𝑑
In a distributive Lattice prove that
𝑎 ∗ 𝑏 = 𝑎 ∗ 𝑐 𝑎𝑛𝑑 𝑎⨁𝑏 = 𝑎 ⨁𝑐 𝑏 = 𝑐.
Solution:
𝑎 ∗ 𝑏 ⨁𝑐 = 𝑎 ∗ 𝑐 ⨁𝑐 = 𝑐 … 1 𝑎 ∗ 𝑏 = 𝑎 ∗ 𝑐 𝑎𝑛𝑑 𝑎𝑏𝑠𝑜𝑟𝑏𝑡𝑖𝑜𝑛 𝑙𝑎𝑤
𝑎 ∗ 𝑏 ⨁𝑐 = 𝑎⨁𝑐 ∗ 𝑏⨁𝑐 𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑙𝑎𝑤
= 𝑎⨁𝑏 ∗ 𝑏⨁𝑐 = 𝑎⨁𝑏 ∗ 𝑐⨁𝑏 𝑎⨁𝑏 = 𝑎 ⨁𝑐 𝑎𝑛𝑑 𝑐𝑜𝑚𝑚𝑢𝑡𝑎𝑡𝑖𝑣𝑒 𝑙𝑎𝑤
= 𝑎 ∗ 𝑐 ⨁𝑏 = 𝑎 ∗ 𝑏 ⨁𝑏 = 𝑏 … (2) 𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑎𝑛𝑑 𝑎𝑏𝑠𝑜𝑟𝑏𝑡𝑖𝑜𝑛 𝑙𝑎𝑤
From (1) and (2) we get,
𝑏=𝑐

www.tranquileducation.weebly.com 5
Establish De Morgan’s laws in a Boolean algebra
Solution: Let 𝑎, 𝑏 ∈ (𝐵,∗,⊕,′ , 0,1)
To prove 𝑎 ⊕ 𝑏 ′ = 𝑎′ ∗ 𝑏′
𝑎 ⊕ 𝑏 ∗ 𝑎′ ∗ 𝑏′ = 𝑎 ∗ 𝑎′ ∗ 𝑏′ ⊕ 𝑏 ∗ 𝑎′ ∗ 𝑏′
= 𝑎 ∗ 𝑎′ ∗ 𝑏′ ⊕ 𝑎′ ∗ 𝑏′ ∗ 𝑏
= 𝑎 ∗ 𝑎′ ∗ 𝑏′ ⊕ 𝑎′ ∗ 𝑏′ ∗ 𝑏
= 0 ∗ 𝑏′ ⊕ 𝑎′ ∗ 0 = 0 ⊕ 0
𝑎 ⊕ 𝑏 ∗ 𝑎′ ∗ 𝑏′ = 0 … (1)
𝑎 ⊕ 𝑏 ⊕ 𝑎′ ∗ 𝑏′ = 𝑎 ⊕ 𝑏 ⊕ 𝑎′ ∗ 𝑎 ⊕ 𝑏 ⊕ 𝑏′
= 𝑏 ⊕ 𝑎 ⊕ 𝑎′ ∗ 𝑎 ⊕ 𝑏 ⊕ 𝑏′
= 𝑏 ⊕ 𝑎 ⊕ 𝑎′ ∗ 𝑎 ⊕ 𝑏 ⊕ 𝑏′
= 𝑏⊕1 ∗ 𝑎⊕1 =1∗1
𝑎 ⊕ 𝑏 ⊕ 𝑎′ ∗ 𝑏′ = 1 … (2)
𝐹𝑟𝑜𝑚 1 𝑎𝑛𝑑 2 𝑤𝑒 𝑔𝑒𝑡,
∴ 𝑎 ⊕ 𝑏 ′ = 𝑎′ ∗ 𝑏′
To prove 𝑎 ∗ 𝑏 ′ = 𝑎′ ⊕ 𝑏′
𝑎 ∗ 𝑏 ⊕ 𝑎′ ⊕ 𝑏′ = 𝑎 ⊕ 𝑎′ ⊕ 𝑏′ ∗ 𝑏 ⊕ 𝑎′ ⊕ 𝑏′
= 𝑎 ⊕ 𝑎′ ⊕ 𝑏′ ∗ 𝑎′ ⊕ 𝑏′ ⊕ 𝑏
= 𝑎 ⊕ 𝑎′ ⊕ 𝑏′ ∗ 𝑎′ ⊕ 𝑏′ ⊕ 𝑏
= 1 ⊕ 𝑏′ ∗ 𝑎′ ⊕ 1 = 1 ∗ 1
𝑎 ∗ 𝑏 ⊕ 𝑎′ ⊕ 𝑏′ = 1 … (3)
𝑎 ∗ 𝑏 ∗ 𝑎′ ⊕ 𝑏′ = 𝑎 ∗ 𝑏 ∗ 𝑎′ ⊕ 𝑎 ∗ 𝑏 ∗ 𝑏′
= 𝑏 ∗ 𝑎 ∗ 𝑎′ ⊕ 𝑎 ∗ 𝑏 ∗ 𝑏′
= 𝑏 ∗ 𝑎 ∗ 𝑎′ ⊕ 𝑎 ∗ 𝑏 ∗ 𝑏′
= 𝑏∗0 ⊕ 𝑎∗0 = 0⊕0
𝑎 ∗ 𝑏 ∗ 𝑎′ ⊕ 𝑏′ = 0 … (4)
𝐹𝑟𝑜𝑚 3 𝑎𝑛𝑑 4 𝑤𝑒 𝑔𝑒𝑡,
𝑎 ∗ 𝑏 ′ = 𝑎′ ⊕ 𝑏′

In a Boolean algebra 𝑳, Prove that (𝒂 ∧ 𝒃) ′ = 𝒂′ ∨ 𝒃′, ∀ 𝒂, 𝒃 ∈ 𝑳


Solution:
𝑎 ∧ 𝑏 ∨ 𝑎′ ∨ 𝑏′ = 𝑎 ∨ 𝑎′ ∨ 𝑏′ ∧ 𝑏 ∨ 𝑎′ ∨ 𝑏′
= 𝑎 ∨ 𝑎′ ∨ 𝑏′ ∧ 𝑎′ ∨ 𝑏′ ∨ 𝑏
= 𝑎 ∨ 𝑎′ ∨ 𝑏′ ∧ 𝑎′ ∨ 𝑏′ ∨ 𝑏
= 1 ∨ 𝑏′ ∧ 𝑎′ ∨ 1 = 1 ∧ 1
𝑎 ∧ 𝑏 ∨ 𝑎′ ∨ 𝑏′ = 1 … (1)
𝑎 ∧ 𝑏 ∧ 𝑎′ ∨ 𝑏′ = 𝑎 ∧ 𝑏 ∧ 𝑎′ ∨ 𝑎 ∧ 𝑏 ∧ 𝑏′
= 𝑏 ∧ 𝑎 ∧ 𝑎′ ∨ 𝑎 ∧ 𝑏 ∧ 𝑏′
= 𝑏 ∧ 𝑎 ∧ 𝑎′ ∨ 𝑎 ∧ 𝑏 ∧ 𝑏′
= 𝑏∧0 ∨ 𝑎∧0 = 0∨0
𝑎 ∧ 𝑏 ∧ 𝑎′ ∨ 𝑏′ = 0 … (2)
𝐹𝑟𝑜𝑚 1 𝑎𝑛𝑑 2 𝑤𝑒 𝑔𝑒𝑡,

www.tranquileducation.weebly.com 6
(𝑎 ∧ 𝑏) ′ = 𝑎′ ∨ 𝑏′

Draw the Hasse diagram of the lattice L of all subsets of 𝒂, 𝒃, 𝒄 under intersection and
union.
Solution:
{a, b, c}

{a, b} {b, c}
{a, c}

{a} {b} {c}


Define the relation 𝑷 on {𝟏, 𝟐, 𝟑, 𝟒} by 𝑷 = {(𝒂, 𝒃)/ |𝒂 − 𝒃| = 𝟏}.
Determine the adjacency matrix of P2
Solution:
𝑃 = { 1,2 , 2,1 , 2,3 , 3,2 , 3,4 , (4,3)}.
0 1 0 0
𝑀𝑃 = 1 0 1 0
0 1 0 1
0 0 1 0

1 0 1 0
𝑀𝑃 2 = 𝑀𝑃𝑜𝑃 = 0 1 0 1
1 0 1 0
0 1 0 1

Let 𝑳, ≤ be a lattice. For any 𝒂, 𝒃, 𝒄 ∈ 𝑳 𝒊𝒇 𝒃 ≤ 𝒄 𝒂∗𝒃≤ 𝒂∗𝒄


𝒂𝒏𝒅 𝒂⨁𝒃 ≤ 𝒂⨁𝒄
Solution:
𝑎∗𝑏 ∗ 𝑎∗𝑐 = 𝑎∗ 𝑏∗𝑎 ∗𝑐 =𝑎∗ 𝑎∗𝑏 ∗𝑐
= 𝑎∗𝑎 ∗ 𝑏∗𝑐 =𝑎∗𝑏
∴ 𝑎∗𝑏 ∗ 𝑎∗𝑐 = 𝑎∗𝑏
𝑎∗𝑏 ≤ 𝑎∗𝑐
𝑎⊕𝑏 ∗ 𝑎⊕𝑐 =𝑎⊕ 𝑏∗𝑐 =𝑎⊕𝑐
∴ 𝑎⨁𝑏 ≤ 𝑎⨁𝑐
In a distributice lattice, show that
(𝒂 ∗ 𝒃) ⨁(𝒃 ∗ 𝒄) ⨁(𝒄 ∗ 𝒂) = (𝒂⨁𝒃) ∗ (𝒃⨁𝒄) ∗ (𝒄⨁𝒂)
Solution:
𝑎∗𝑏 ⨁ 𝑏∗𝑐 ⨁ 𝑐∗𝑎 = 𝑎∗𝑏 ⨁ 𝑐∗𝑏 ⨁ 𝑐∗𝑎
= 𝑎⨁𝑐 ∗ 𝑏 ⨁ 𝑐 ∗ 𝑎

www.tranquileducation.weebly.com 7
= 𝑎⨁𝑐 ∗ 𝑏 ⨁𝑐 ∗ 𝑎⨁𝑐 ∗ 𝑏 ⨁𝑎
= 𝑎⨁𝑐 ⨁𝑐 ∗ 𝑏⨁𝑐 ∗ 𝑎⨁𝑐 ⨁𝑎 ∗ 𝑏⨁𝑎
= 𝑎⨁𝑐 ⨁𝑐 ∗ 𝑏⨁𝑐 ∗ 𝑎⨁ 𝑎⨁𝑐 ∗ 𝑏⨁𝑎
= 𝑎⨁ 𝑐⨁𝑐 ∗ 𝑏⨁𝑐 ∗ 𝑎⨁𝑎 ⨁𝑐 ∗ 𝑏⨁𝑎
= 𝑎⨁𝑐 ∗ 𝑏⨁𝑐 ∗ 𝑎⨁𝑐 ∗ 𝑏⨁𝑎
= 𝑐⨁𝑎 ∗ 𝑏⨁𝑐 ∗ 𝑐⨁𝑎 ∗ 𝑎⨁𝑏
= 𝑏⨁𝑐 ∗ 𝑐⨁𝑎 ∗ 𝑐⨁𝑎 ∗ 𝑎⨁𝑏
= 𝑏⨁𝑐 ∗ 𝑐⨁𝑎 ∗ 𝑎⨁𝑏
= 𝑏⨁𝑐 ∗ 𝑎⨁𝑏 ∗ 𝑐⨁𝑎
= (𝑎⨁𝑏) ∗ (𝑏⨁𝑐) ∗ (𝑐⨁𝑎)

Simplify the Boolean expression ((𝒙𝟏 + 𝒙𝟐 ) + (𝒙𝟏 + 𝒙𝟑 )) . 𝒙𝟏 . 𝒙𝟐


Solution:
𝑥1 + 𝑥2 + 𝑥1 + 𝑥3 . 𝑥1 . 𝑥2 = 𝑥1 + 𝑥2 . 𝑥1 . 𝑥2 + 𝑥1 + 𝑥3 . 𝑥1 . 𝑥2
= 𝑥1 . 𝑥1 . 𝑥2 + 𝑥2 . 𝑥1 . 𝑥2 + 𝑥1 . 𝑥1 . 𝑥2 + 𝑥3 . 𝑥1 . 𝑥2
= 𝑥1 . 𝑥1 . 𝑥2 + 𝑥1 . 𝑥2 . 𝑥2 + 𝑥3 . 𝑥1 . 𝑥2
= 𝑥1 . 𝑥2 + 𝑥1 . 0 + 𝑥3 . 𝑥1 . 𝑥2
= 𝑥1 . 𝑥2 + 𝑥3 . 𝑥1 . 𝑥2
= 𝑥1 . 𝑥2

State and prove the distributive inequalities of a lattice.


Solution:
Let 𝐿, ≤ be a lattice. For any 𝑎, 𝑏, 𝑐 ∈ 𝐿
I) 𝑎 ∗ 𝑏⨁𝑐 ≥ 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐
II) 𝑎⨁ 𝑏 ∗ 𝑐 ≤ 𝑎⨁𝑏 ∗ 𝑎⨁𝑐
To prove 𝑎 ∗ 𝑏⨁𝑐 ≥ 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐
From 𝑎 ≥ 𝑎 ∗ 𝑏 𝑎𝑛𝑑 𝑎 ≥ 𝑎 ∗ 𝑐 𝑎 ≥ 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐 … (1)
𝑏⨁𝑐 ≥ 𝑏 ≥ 𝑎 ∗ 𝑏 … (2)
𝑏⨁𝑐 ≥ 𝑐 ≥ 𝑎 ∗ 𝑐 … (3)
From (2) and (3) we get,
𝑏⨁𝑐 ≥ 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐 … 4
From (1) and (4) we get,
𝑎 ∗ 𝑏⨁𝑐 ≥ 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐
To prove 𝑎⨁ 𝑏 ∗ 𝑐 ≤ 𝑎⨁𝑏 ∗ 𝑎⨁𝑐
From 𝑎⨁𝑏 ≥ 𝑎 𝑎𝑛𝑑 𝑎⨁𝑐 ≥ 𝑎 𝑎⨁𝑏 ∗ 𝑎⨁𝑐 ≥ 𝑎 … (5)
𝑏 ∗ 𝑐 ≤ 𝑏 ≤ 𝑎⨁𝑏 … (6)
𝑏 ∗ 𝑐 ≤ 𝑐 ≤ 𝑎⨁𝑐 … (7)
From (6) and (7) we get,
𝑏 ∗ 𝑐 ≤ 𝑎⨁𝑏 ∗ 𝑎⨁𝑐 … 8
From (5) and (8) we get,
𝑎 ∗ 𝑏⨁𝑐 ≥ 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐
𝑎⨁ 𝑏 ∗ 𝑐 ≤ 𝑎⨁𝑏 ∗ 𝑎⨁𝑐

www.tranquileducation.weebly.com 8
In a lattice show that 𝒂 ≤ 𝒃 𝒂∗𝒃= 𝒂 𝒂⨁𝒃 = 𝒃
Solution:
To prove 𝑎 ≤ 𝑏 𝑎∗𝑏= 𝑎
Let us assume that 𝑎 ≤ 𝑏, we know that 𝑎 ≤ 𝑎. ∴ 𝑎 ≤ 𝑎 ∗ 𝑏 … (1)
From the definition we know that 𝑎 ∗ 𝑏 ≤ 𝑎 … (2)
From (1) and (2) we get 𝑎 ∗ 𝑏 = 𝑎
∴𝑎≤ 𝑏 𝑎 ∗ 𝑏 = 𝑎 … (𝐼)
Now assume that 𝑎 ∗ 𝑏 = 𝑎 but it is possible iff 𝑎 ≤ 𝑏
∴ 𝑎 ∗ 𝑏 = 𝑎 𝑎 ≤ 𝑏 … (𝐼𝐼)
From (I) and (II) we get
𝑎≤ 𝑏 𝑎∗𝑏 = 𝑎
To prove 𝑎 ∗ 𝑏 = 𝑎 𝑎⨁𝑏 = 𝑏
Let us assume that 𝑎 ∗ 𝑏 = 𝑎
𝑏⨁ 𝑎 ∗ 𝑏 = 𝑏⨁𝑎 = 𝑎⨁𝑏 … (3)
𝑏⨁ 𝑎 ∗ 𝑏 = 𝑏 … (4)
From (3) and (4) we get 𝑎⨁𝑏 = 𝑏
∴ 𝑎∗𝑏 = 𝑎 𝑎⨁𝑏 = 𝑏 … (𝐼𝐼𝐼)
Let us assume that 𝑎⨁𝑏 = 𝑏
𝑎 ∗ 𝑎⨁𝑏 = 𝑎 ∗ 𝑏 … (5)
𝑎 ∗ 𝑎⨁𝑏 = 𝑎 … (6)
From (5) and (6) we get 𝑎 ∗ 𝑏 = 𝑎
∴ 𝑎⨁𝑏 = 𝑏 𝑎 ∗ 𝑏 = 𝑎 … (𝐼𝑉)
From (III) and (IV) we get 𝑎 ∗ 𝑏 = 𝑎 𝑎⨁𝑏 = 𝑏

Prove that every chain is a distributive lattice.


Solution:
Let (𝐿, ≤) be a chain and 𝑎, 𝑏, 𝑐 ∈ 𝐿. Consider the following cases:
(I) 𝑎 ≤ 𝑏 𝑎𝑛𝑑 𝑎 ≤ 𝑐, and (II) 𝑎 ≥ 𝑏 𝑎𝑛𝑑 𝑎 ≥ 𝑐
For (I)
𝑎 ∗ 𝑏⨁𝑐 = 𝑎 … (1)
𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐 = 𝑎⨁𝑎 = 𝑎 … (2)
For (II)
𝑎 ∗ 𝑏⨁𝑐 = 𝑏⨁𝑐 … (3)
𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐 = 𝑏⨁𝑐 … (4)
∴From (1),(2) and (3),(4)
𝑎 ∗ 𝑏⨁𝑐 = 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐
∴Every chain is a distributive lattice

Show that every distributive lattice is a modular. Whether the converse is true? Justify
your answer
Solution:

www.tranquileducation.weebly.com 9
Let 𝑎, 𝑏, 𝑐 ∈ 𝐿 and assume that 𝑎 ≤ 𝑐, 𝑡𝑕𝑒𝑛
𝑎⨁ 𝑏 ∗ 𝑐 = 𝑎⨁𝑏 ∗ (𝑎⨁𝑐)
= 𝑎⨁𝑏 ∗ 𝑐
∴Every distributive lattice is modular.
For example let us consider the following lattice

𝒂 𝒃 𝒄

0
Here in this lattice
∀𝑎, 𝑏, 𝑐 ∈ 𝐿, 𝑎 ≤ 𝑏 𝑎⨁ 𝑏 ∗ 𝑐 = 𝑎⨁𝑏 ∗ 𝑐
∴The above lattice is modular.
𝑎 ∗ 𝑏⨁𝑐 = 𝑎 ∗ 1 = 𝑎 … (1)
𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐 = 0⨁0 = 0 … (2)
From (1) and (2) we get 𝑎 ∗ 𝑏⨁𝑐 ≠ 𝑎 ∗ 𝑏 ⨁ 𝑎 ∗ 𝑐
∴The above lattice is not distributive.
∴ Every distributive lattice is a modular but its converse is not true.

Find the sub lattices of (𝑫𝟒𝟓 ,/ ). Find its complement element.


Solution:
𝐷45 = 1, 3, 5, 9, 15,45 𝑢𝑛𝑑𝑒𝑟 𝑑𝑖𝑣𝑖𝑠𝑖𝑜𝑛 𝑟𝑢𝑙𝑒
1⨁45 = 45 𝑎𝑛𝑑 1 ∗ 45 = 1
∴ 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 1 𝑖𝑠 45
5⨁9 = 45 𝑎𝑛𝑑 5 ∗ 9 = 1
∴ 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 5 𝑖𝑠 9
3⨁15 = 15 𝑎𝑛𝑑 3 ∗ 15 = 3
∴ 3 𝑎𝑛𝑑 15 𝑕𝑎𝑠 𝑛𝑜 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡
∴ (𝐷45 ,/ ) is not a complement lattice

www.tranquileducation.weebly.com 10
45

9 15

3 5

The sub lattices of (𝐷45 ,/ ) are given below


𝑆1 = 1, 3, 5, 9, 15,45 , 𝑆2 = 1, 3, 9, 45 , 𝑆3 = 1, 5, 15,45 ,
𝑆4 = 1, 3, 5, 15 , 𝑆5 = 3, 9, 15,45 , 𝑆6 = 1, 3, 9, 15,45 ,
𝑆7 = 1, 3, 5, 15,45 , 𝑆8 = 1, 3 , 𝑆9 = 1, 5 , 𝑆10 = 1, 3, 9 , 𝑆11 = 1, 5, 15
𝑆12 = 3, 9,45 , 𝑆13 = 5, 15,45 , 𝑆14 = 3, 9 , 𝑆15 = 5, 15 , 𝑆16 = 15,45
𝑆17 = 9, 45 , 𝑆18 = 3, 15 , 𝑆19 = 3,5,9,15,45

In any Boolean algebra, show that 𝒂 = 𝒃 𝒂𝒃′ + 𝒂′𝒃 = 𝟎


Proof:
Case i) To prove 𝑎 = 𝑏 𝑎𝑏′ + 𝑎′𝑏 = 0
′ ′
𝑎𝑏 = 𝑏𝑏 = 0 … 1 [𝑎 = 𝑏 𝑎𝑛𝑑 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑙𝑎𝑤]
𝑎′ 𝑏 = 𝑎′ 𝑎 = 0 … (2)[𝑎 = 𝑏 𝑎𝑛𝑑 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑙𝑎𝑤]
𝑎𝑏′ + 𝑎′ 𝑏 = 0 + 0 = 0 [𝑓𝑟𝑜𝑚 1 𝑎𝑛𝑑 2 ]
Case ii) To prove 𝑎𝑏′ + 𝑎′ 𝑏 = 0 𝑎 = 𝑏 … (3)
𝑎𝑏′ + 𝑎′ 𝑏 = 0
𝑎 + 𝑎𝑏′ + 𝑎′ 𝑏 = 𝑎 + 0 [𝑏 = 𝑐 𝑎 + 𝑏 = 𝑎 + 𝑐]
𝑎 + 𝑎′ 𝑏 = 𝑎 [𝐴𝑏𝑠𝑜𝑟𝑏𝑡𝑖𝑜𝑛 𝑙𝑎𝑤 𝑎𝑛𝑑 𝑎 + 0 = 𝑎]
𝑎 + 𝑎′ (𝑎 + 𝑏) = 𝑎[𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑙𝑎𝑤]
1 𝑎 + 𝑏 = 𝑎 𝑎 + 𝑏 = 𝑎 … (4)[𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑙𝑎𝑤]
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑓𝑟𝑜𝑚 3 , 𝑤𝑒 𝑔𝑒𝑡 𝑎𝑏′ + 𝑎′ 𝑏 + 𝑏 = 0 + 𝑏
[𝑏 = 𝑐 𝑏 + 𝑎 = 𝑐 + 𝑎]

𝑎𝑏 + 𝑏 = 𝑏 [𝐴𝑏𝑠𝑜𝑟𝑏𝑡𝑖𝑜𝑛 𝑙𝑎𝑤 𝑎𝑛𝑑 0 + 𝑏 = 𝑏]
𝑎 + 𝑏 (𝑏′ + 𝑏) = 𝑏[𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑙𝑎𝑤]
𝑎 + 𝑏 1 = 𝑏 𝑎 + 𝑏 = 𝑏 … (5)[𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑙𝑎𝑤]
From (4) and (5) we get
𝑎=𝑏

Let (𝑳, ≤ ) be a lattice. For any 𝒂, 𝒃, 𝒄 ∈ 𝑳 the following holds,


𝒂 ≤ 𝒄 𝒂 ⨁ (𝒃 ∗ 𝒄) ≤ (𝒂 ⨁ 𝒃) ∗ 𝒄
Solution: To prove 𝑎 ≤ 𝑐 𝑎 ⨁ (𝑏 ∗ 𝑐) ≤ (𝑎 ⨁ 𝑏) ∗ 𝑐
Let us assume that 𝑎 ≤ 𝑐,
𝑎 ⨁ 𝑏 ∗ 𝑐 ≤ 𝑎⨁𝑏 ∗ 𝑎⨁𝑐 𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑖𝑛𝑒𝑞𝑢𝑎𝑙𝑖𝑡𝑦

www.tranquileducation.weebly.com 11
≤ 𝑎⨁𝑏 ∗ 𝑐 𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑖𝑛𝑒𝑞𝑢𝑎𝑙𝑖𝑡𝑦
To prove 𝑎 ⨁ (𝑏 ∗ 𝑐) ≤ (𝑎 ⨁ 𝑏) ∗ 𝑐 𝑎 ≤ 𝑐
Let us assume that 𝑎 ⨁ (𝑏 ∗ 𝑐) ≤ (𝑎 ⨁ 𝑏) ∗ 𝑐
𝑎 ⨁𝑏 ∗ 𝑎⨁𝑐 ≤ (𝑎 ⨁ 𝑏) ∗ 𝑐 𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑙𝑎𝑤
𝑎⨁𝑐 ≤ 𝑐 … (1) 𝑎 ∗ 𝑏 ≤ 𝑎 ∗ 𝑐 𝑏 ≤ 𝑐
𝑎 ⨁ (𝑏 ∗ 𝑐) ≤ (𝑎 ⨁ 𝑏) ∗ 𝑐
𝑎 ⨁ 𝑏 ∗ 𝑐 ≤ 𝑎 ∗ 𝑐 ⨁ 𝑏 ∗ 𝑐 𝐷𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑙𝑎𝑤
𝑎 ≤ 𝑎 ∗ 𝑐 ≤ 𝑎⨁𝑐 ≤ 𝑐 𝐷𝑒𝑓𝑖𝑛𝑖𝑡𝑖𝑜𝑛 𝑜𝑓 ∗ 𝑎𝑛𝑑 ⨁ 𝑎𝑛𝑑(1)
𝑎 ≤ 𝑐

Prove that the direct product of any two distributive lattices is a distributive lattice.
Solution:
Let 𝐿,∗, ⨁ 𝑎𝑛𝑑 𝑆,∧,∨ 𝑏𝑒 𝑡𝑤𝑜 𝑑𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑣𝑒 𝑙𝑎𝑡𝑡𝑖𝑐𝑒𝑠 𝑎𝑛𝑑 𝑙𝑒𝑡 𝐿 × 𝑆, . , +
𝑏𝑒 𝑡𝑕𝑒 𝑑𝑖𝑟𝑒𝑐𝑡 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝑜𝑓 𝑡𝑤𝑜 𝑙𝑎𝑡𝑡𝑖𝑐𝑒𝑠.
For any 𝑎1 , 𝑏1 , 𝑎2 , 𝑏2 𝑎𝑛𝑑 𝑎3 , 𝑏3 ∈ 𝐿 × 𝑆
𝑎1 , 𝑏1 . 𝑎2 , 𝑏2 + 𝑎3 , 𝑏3 = 𝑎1 , 𝑏1 . 𝑎2 ⨁𝑎3 , 𝑏2 ∨ 𝑏3
= 𝑎1 ∗ 𝑎2 ⨁𝑎3 , 𝑏1 ∧ 𝑏2 ∨ 𝑏3
= 𝑎1 ∗ 𝑎2 ⨁ 𝑎1 ∗ 𝑎3 , 𝑏1 ∧ 𝑏2 ∨ 𝑏1 ∧ 𝑏3
= 𝑎1 , 𝑏1 . 𝑎2 , 𝑏2 + 𝑎1 , 𝑏1 . 𝑎3 , 𝑏3
∴The direct product of any two distributive lattices is a distributive lattice.

Find the complement of every element of the lattice < 𝑺𝒏 , 𝑫 > for 𝒏 = 𝟕𝟓.
Solution:
𝑆45 = 1, 3, 5, 15, 25, 75 𝑢𝑛𝑑𝑒𝑟 𝑑𝑖𝑣𝑖𝑠𝑖𝑜𝑛 𝑟𝑢𝑙𝑒
1⨁75 = 75 𝑎𝑛𝑑 1 ∗ 75 = 1
∴ 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 1 𝑖𝑠 75
3⨁25 = 75 𝑎𝑛𝑑 3 ∗ 25 = 1
∴ 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 3 𝑖𝑠 25
5⨁15 = 15 𝑎𝑛𝑑 5 ∗ 15 = 5
∴ 5 𝑎𝑛𝑑 15 𝑕𝑎𝑠 𝑛𝑜 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡
∴ It is not a complement lattice

www.tranquileducation.weebly.com 12
75

25 15

5 3

Write the Lattices of (𝑫𝟑𝟓 ,/ ) . Find its complements


Solution:
𝐷35 = 1, 5, 7, 35 𝑢𝑛𝑑𝑒𝑟 𝑑𝑖𝑣𝑖𝑠𝑖𝑜𝑛 𝑟𝑢𝑙𝑒
1⨁35 = 35 𝑎𝑛𝑑 1 ∗ 35 = 1
∴ 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 1 𝑖𝑠 35
5⨁7 = 35 𝑎𝑛𝑑 5 ∗ 7 = 1
∴ 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 5 𝑖𝑠 7

35

5 7

www.tranquileducation.weebly.com 13

You might also like