Discrete Mathematics

Presented By
Abdulla – Al – Mamun
Lecturer-Mathematics
CUST
 Boolean Algebra
Partially Ordered Set
A relation R on a set S is said to be partially order or partially
ordering if it is reflexive, anti-symmetric and transitive.
A set S together with partially ordering R is called a partially
ordered set. It is denoted by (𝑆, 𝑅).

Lattices
A partially ordered set is said to be lattices if every two elements is
a set have unique least upper bound and unique greatest lower
bound.
 Boolean Algebra
Boolean Lattices
A lattices (𝐴, ≤) is said to be Boolean lattices if it is distribution
and complemented.

Boolean Algebra
Suppose a Boolean lattices (𝐴, ≤) defined an algebraic system
𝐴,∨,∧, ↿ , where ∧,∨, ↿ are meet joint and complementation
operations respectively.
The algebraic system defined by the Boolean lattices is known as
Boolean algebra.
 Boolean Algebra
Boolean Function of degree n
Let, 𝐵 = {0,1} . Then 𝐵𝑛 = { 𝑥1 , 𝑥2 , … … , 𝑥𝑛 : 𝑥𝑖 𝜖𝐵} . Then the
function 𝐵𝑛 to B is called Boolean function of nth degree.

Distributive Lattices
A lattices is said to be distributive lattices if the join operation
distributes over the meet operation and the meet operation
distributes over the join operation, i.e.,
𝑎∨ 𝑏∧𝑐 = 𝑎∨𝑏 ∧ 𝑎∨𝑐
𝑎∧ 𝑏∨𝑐 = 𝑎∧𝑏 ∨ 𝑎∧𝑐
 Boolean Algebra
Cover
Let a and b be two elements in a lattices that ‘a’ is said to be a cover
of ‘b’ if 𝑏 < 𝑎 and there is no element c such that 𝑏 < 𝑐 and 𝑐 < 𝑎.
Atom
Let (𝐴, ≤) be a lattices with universal lower bound is zero or an
element ‘a’ is called atom if its cover zero.
Lemma
Let 𝐴,∨,∧, ↿ be a finite Boolean algebra. Let b be any non-zero
element in A and 𝑎1 , 𝑎2 , … … , 𝑎𝑘 be all atom of A such that, 𝑎𝑖 < 𝑏
then 𝑏 = 𝑎1 ∨ 𝑎2 ∨ 𝑎3 ∨ ⋯ … ∨ 𝑎𝑘 .
 Boolean Algebra
Q-1. Prove that, in a distributive lattice of an element has a
complement thus the complement is unique.
Proof: Suppose that, an element ‘a’ has two complements b and c.
then,
𝑎 ∨ 𝑏 = 1, 𝑎∧𝑏 =0
𝑎 ∨ 𝑐 = 1, 𝑎∧𝑐 =0
Let, 𝑏 = 𝑏 ∧ 1 = 𝑏 ∧ 𝑎 ∨ 𝑐 = 𝑏 ∧ 𝑎 ∨ 𝑏 ∧ 𝑐
= 𝑎∧𝑏 ∨ 𝑏∧𝑐 =0∨ 𝑏∧𝑐 = 𝑎∧𝑐 ∨ 𝑏∧𝑐
= 𝑎∨𝑏 ∧𝑐 =1∧𝑐 =𝑐
Hence the proof.
 Boolean Algebra
Q-2. State and prove the De-Morgan’s law/theorem in Boolean
algebra.
Statement: For any element a and b in Boolean algebra, the De-
Morgan’s theorem state that
𝑎 ∨ 𝑏 = 𝑎ത ∧ 𝑏ത
𝑎 ∧ 𝑏 = 𝑎ത ∨ 𝑏ത
Proof: We have,
𝑎 ∨ 𝑏 ∨ 𝑎ത ∧ 𝑏ത
= 𝑎 ∨ 𝑏 ∨ 𝑎ത ∧ 𝑎 ∨ 𝑏 ∨ 𝑏ത [Distributive law]
= 𝑎 ∨ 𝑎ത ∨ 𝑏 ∧ 𝑎 ∨ 𝑏 ∨ 𝑏ത [Associative law]
 Boolean Algebra
= 1 ∨ 𝑏 ∧ 𝑎 ∨ 1 [Complement law]
=1∧1=1
Again, 𝑎 ∨ 𝑏 ∧ 𝑎ത ∧ 𝑏ത
= 𝑎 ∨ 𝑏 ∧ 𝑎ത ∧ 𝑎 ∨ 𝑏 ∧ 𝑏ത [Distributive law]
= 𝑎 ∧ 𝑎ത ∨ 𝑏 ∧ 𝑎ത ∧ 𝑎 ∨ 𝑏ത ∨ 𝑏 ∨ 𝑏ത [Associative law]
= 0 ∨ 𝑏 ∧ 𝑎ത ∧ 𝑎 ∨ 𝑏ത ∨ 0
= 𝑏 ∧ 𝑎ത ∧ 𝑎 ∨ 𝑏ത = 𝑎ത ∧ 𝑎 ∧ 𝑏 ∨ 𝑏ത Now, using the principle
=0∧0=0 of duality we may write
ത 𝑎 ∧ 𝑏 = 𝑎
ത ∨ ത
𝑏
Thus, 𝑎 ∨ 𝑏 = 𝑎ത ∧ 𝑏
Hence the proof.
 Boolean Algebra
Q-3. Prove that, in a distributive lattice if 𝒃 ∧ 𝒄ത = 𝟎 then 𝒃 ≤ 𝒄.

Proof: We have,
𝑏 ∧ 𝑐ҧ = 0
⟹ 𝑏 ∧ 𝑐ҧ ∨ 𝑐 = 0 ∨ 𝑐
⟹ 𝑏 ∨ 𝑐 ∧ (𝑐ҧ ∨ 𝑐) = 0 ∨ 𝑐
⟹ 𝑏∨𝑐 ∧1=𝑐
⟹𝑏∨𝑐 =𝑐
Since c is the least upper bound of b and c.
Thus, 𝑏 ≤ 𝑐. (Proved)
 Boolean Algebra
Q-4. Show that both join and meet Again, by definition,
operation are commutative. 𝑎∧𝑏 = greatest lower
OR bound of a and b.
Prove that 𝒂 ∨ 𝒃 = 𝒃 ∨ 𝒂 and 𝑏∧𝑎 = greatest lower
𝒂 ∧ 𝒃 = 𝒃 ∧ 𝒂. bound of b and a.
Proof: By definition,
𝑎 ∨ 𝑏 = least upper bound of a and b. Since the greatest lower
𝑏 ∨ 𝑎 = least upper bound of b and a. bound of a set is unique,
Since the least upper bound of a set is thus 𝑎 ∧ 𝑏 = 𝑏 ∧ 𝑎.
unique, thus 𝑎 ∨ 𝑏 = 𝑏 ∨ 𝑎
 Boolean Algebra
Q-5. Show that both the joint and meet operation are associative.
OR
𝒂 ∨ 𝒃 ∨ 𝒄 = 𝒂 ∨ (𝒃 ∨ 𝒄)
𝒂 ∧ 𝒃 ∧ 𝒄 = 𝒂 ∧ (𝒃 ∧ 𝒄)
Proof: By definition,
𝑎 ∨ 𝑏 = least upper bound of a and b.
𝑎 ∨ 𝑏 ∨ 𝑐 = least upper bound of a and b, c.
𝑏 ∨ 𝑐 = least upper bound of b and c.
𝑎 ∨ 𝑏 ∨ 𝑐 = least upper bound of a, b and c.
Since the least upper bound of a set is unique,
Thus, 𝑎 ∨ 𝑏 ∨ 𝑐 = 𝑎 ∨ (𝑏 ∨ 𝑐)
 Boolean Algebra
Q-6. State and prove the idempotent property.
Statement: For any 𝑎𝜖𝐴 then 𝑎 ∧ 𝑎 = 𝑎 and 𝑎 ∨ 𝑎 = 𝑎.
Proof: For any 𝑎𝜖𝐴 we get,
𝑎 ≤𝑎∨𝑎 (𝑖)
Since 𝑎 ⊆ 𝑎 then
𝑎∨𝑎 ≤𝑎 (𝑖𝑖)
From (i) and (ii) we get,
𝑎∨𝑎 =𝑎
Now by using principle of duality, 𝑎 ∧ 𝑎 = 𝑎
Hence the proof.
 Boolean Algebra
Logic Gate Example: If A and B are two
A logic gate is an electric circuit which input signals then the output
operates on one or more input signals to signal using truth table as
produce standard output signals. follows:
AND Gate Input Output
An AND gate is the physical realization A B C=A.B
of the logical multiplication (AND) 1 1 1
operation, it is an electronic circuit
1 0 0
which generates an output signal of 1
0 1 0
only if all input signals are 1.
0 0 0
 Boolean Algebra

OR Gate Input Output

An OR gate is the physical relation A B C=A+B
of the logical addition (OR) 1 1 1
operation, it is an electric circuit, 1 0 1
which generates an output signal of 0 1 1
1, if any of input signals is 1. 0 0 0
 Boolean Algebra

NOT Gate Input Output

A NOT gate is the physical A 𝐴ҧ
realization of the complementation 1 0
operation. It is an electric circuit, 0 1
which produce output signal 1 when
input signal is 0 and 0 when 1.