UNIT – 5 Bhuvanesh Raam C K
Lattices and Boolean Algebra 311120205017
RELATIONS
• Reflexive:
Let X be a set. R be a relation defined on X. Then R is said to be reflexive if it satisfies xRx ∀ x
∈ X.
• Symmetric & Asymmetric:
A relation R on a set X is said to be symmetric, if the satisfies the condition xRy ⟹ yRx ∀ x, y
∈ X. A relation which is not symmetric is called Asymmetric relation.
• Antisymmetric:
A relation R on a set X is said to be symmetric, if xRy & yRx ⟹ x = y ∀x, y ∈ X.
• Transitive:
A relation R on a set X is said to be transitive, if xRy & yRz ⟹ xRz ∀x, y, z ∈ X.
➢Equivalence Relation
A relation R on a set X is said to be equivalence relation, if R is reflexive, symmetric and
transitive.
➢Partial Ordering or Partial order relation
A relation R on a set X is said to be a partial ordering, if R is reflexive, antisymmetric and
transitive.
➢Partially ordered set or Poset:
A set A together with a partial order relation R is called a partially ordered set or Poset.
POSET WITH BINARY OPERATION
• A set S together with binary operation ≥ is called a Poset if the following condition holds:
a) a ≥ a; a ∈ S
b) a ≥ b & b ≥ a ⟹ a = b
c) a ≥ b & b ≥ c ⟹ a ≥ c.
• Comparable:
Let (S, ≤) be a poset. Let a, b ∈ S. a & b are said to be comparable if either a ≤ b or b ≤ a.
• Linear Ordering: A partial ordering in which any two elements are comparable is called a
linear ordering or a total ordering.
• Totally ordered set or linearly ordered set:
Let (S, ≤) be a poset. If every pair of elements of S are comparable, then S is called a totally
ordered set or linearly ordered set and the relation ≤ is called a total order or
linear order.
Immediate Predecessor:
• Let (P, ≤) be a poset. An element x ∈ P is said to be an immediate predecessor of y ∈ P if x
< y and there is no element z ∈ P between x & y.
• We also y is the immediate successor of x.
Greatest and Least element of a Poset:
• Let (P, ≤) be a poset. If there exists an element y ∈ P such that y ≤ x ∀x ∈ P, then y is called
the least element of P and x is called the greatest element of P relative to ≤.
• If y < x, then y is called the minimal element of P and x is called the maximal element of P
relative to <.
LEAST UPPER BOUND
Upper Bound:
• Let (P, ≤) be a Poset and let A be a non-empty subset of P. Any element u ∈ P is called an
upper bound of A if a ≤ u ∀a ∈ A.
Least Upper Bound (Supremum):
• Let (P, ≤) be a Poset and let A ⊆ P. Any element u ∈ P is called a least upper bound of A if
(i) u is an upper bound for A.
(ii) u ≤ v for all other upper bounds v of A.
GREATEST LOWER BOUND
Lower Bound:
• Let (P, ≤) be a Poset and let A be a non-empty subset of P. Any element l ∈ P is called an
upper bound of A if l ≤ a ∀a ∈ A.
Greatest Lower Bound (Infimum):
• Let (P, ≤) be a Poset and let A ⊆ P. Any element l ∈ P is called a least upper bound of A if
(i) l is an lower bound for A.
(ii) m ≤ l for all other lower bounds m of A.
LATTICES: • A lattice is a poset (L, ≤) in which every pair of elements a, b ∈ L has a greatest
lower bound and a least upper bound.
• The GLB(Greatest lower bound) of a subset having 2 elements (a, b) ⊆ L is denoted by a ∗
b or a ∧ b or a. b.
• The LUB (Least upper bound) of a subset having 2 elements (a, b) ⊆ L is denoted by a⨁b
or a⋁b or a + b.
LATTICE AS AN ALGEBRAIC SYSTEM
A lattice is an algebraic system (L,∗,⊕) with two binary operations ∗, ⨁ on L which satisfies
the following axioms:
1. Commutative Law:
a ∗ b = b ∗ a & a⨁b = b⨁a ∀a, b ∈ L
2. Associative Law:
a ∗ b ∗ c = a ∗ b ∗ c & a⨁(b ⊕ c) = (a ⊕ b)⨁c ∀a, b, c ∈ L
3. Absorption Law:
a ∗ a ⊕ b = a & a⨁ a ∗ b = a ∀a, b ∈ L
Sublattice:
Let (L,∗, ⨁) be a lattice. Let non-empty subset M of L is called a sublattice of L if M is closed
under the same operations ∗ & ⨁ of L. (i.e) a ∗ b ∈ L, a ⨁b ∈ L ∀a, b ∈ M.
Lattice Homomorphism:
Let (L,∗, ⨁) and (M,⋀,⋁) be two lattices. A mapping f: L → M is called a lattice homomorphism
from the lattice (L,∗, ⨁) to (M, ⋀,⋁) if f a ∗ b = f a ⋀f(b) and f a⨁b = f a ∨ f b ∀a, b ∈ L.
Lattice Isomorphism:
Let (L,∗, ⨁) and (M, ⋀, ⋁) be two lattices. A mapping f: L → M is called a lattice isomorphism if f is
one to one and onto.
Isomorphic:
If there exists an isomorphism between two lattices, then the lattices are said to be isomorphic.
SPECIAL TYPES OF LATTICES
1. Complete Lattice:
A lattice (L,∗,⊕) is said to be complete if every non-empty subset has a least upper bound
and a greatest lower bound.
2. Bounded Lattice: A lattice (L,∗,⊕) is said to be bounded if it has a greatest element
(upper bound) 1 and a least element (least element) 0. (i.e) 0 ≤ a ≤ 1 ∀a ∈ L.
3. Complement of an element:
If (L,∗,⊕, 0,1) be a bounded lattice. An element b ∈ L is called a complement of an element
a ∈ L if a ∗ b = 0 & a ⊕ b = 1.
4. Distributive lattice:
A lattice (L,∗,⊕) is said to be distributive lattice, if for any a, b, c ∈ L, then
a ∗ b ⊕ c = (a ∗ b) ⊕ (a ∗ c)
a ⊕ b ∗ c = a ⊕ b ∗ (a ⊕ c)
5. Modular lattice:
A lattice (L,∗,⊕) is said to be modular lattice, if for any a, b, c ∈ L, a ≤ c ⟹ a ⊕ b ∗ c = a ⊕
b ∗ c.
Direct Product:
Let (L,∗, ⨁) and (S, ⋀, ⋁) be two lattices. The algebraic system (L × S, . , +) in which +& . on L
× S are such that for any a, b & c, d ∈ L × S.
a, b . c, d = (a ∗ c, b ∧ d) & a, b + c, d = (a ⊕ c, b ∨ d) is called the direct product of the
lattices (L,∗, ⨁) and (M, ⋀,⋁).
BOOLEAN ALGEBRA
• A lattice which is complemented and distributive is called Boolean algebra.
Definition:
A non-empty set B together with two binary operations +, . (called addition and
multiplication), a unary operation ′ on B (called complementation) and two distinct
elements 0 and 1 is called a Boolean algebra if the following axioms are satisfied for all a, b,
c ∈ B.
i) Commutative Laws: a + b = b + a & a. b = b. a
ii) Associative Laws: a + b + c = a + b + c & a. b. c = a. b . c
iii) Distributive Laws: a + b. c = a + b . a + c & a. b + c = a. b + (a. c)
iv) Identity Laws: a + 0 = a & a. 1 = a
v) Complement Laws: a + a′= 1 & a. a′= 0
SUB-BOOLEAN ALGEBRA
• Let (B, +, . ,′, 0,1) be a Boolean algebra and S be a non-empty subset of B. If S contains the
elements 0 & 1 and is closed under the operations +, . ,′ then (S, +, . ,′, 0,1) is called a Sub-
Boolean Algebra.
