Professional Documents
Culture Documents
Lattices
Lattices
Definition: Let A and B be two non-empty sets. Any subset of R of A × B is called a relation for
A to B.
Example: Consider A = {1, 2,3}andB = {a, b, c} Then
R = {(1, a),(2, c),(3, b)}is a relation from A to B,
Binary relation: Let A be any set Then R is a relation from A to A. If R ⊆ A × A , we can say
that R is a binary relation on A.
Example: Consider A = {1, 2,3} Then
R = {(1,1),(2,1),(3,2)} is a binary relation on A because R ⊆ A × A .
Note:i) ( x, y) ∈ R ⇔ xRy (read as x is related to y)
iii) Some standard relations : <, ≤, ≻, ≥, ,”divides”, “ a is a multiple of b”, congruent modulo.
Diagraph of a relation:
i) Draw a small circle for each element of A and label the circles with the corresponding
elements of A. These circles are called vertices.
ii) Draw a directed edge from a vertex a to b if a is related to y i.e.if aRb or ( a, b) ∈ R.
The resulting diagram is called the directed graph or Diagraph of the relation R.
Digraph:
d c
a b
In a digraph
A vertex from which an edge leaves is called the origin or the source for that edge.
A vertex where an edge ends is called the terminus for that edge.
Isolated vertex: A vertex which is neither source nor terminus.
Loop: An edge for which the source and terminus are one and the same vertex.
In degree of a vertex: No. of edges terminating at a vertex.
Out degree of a vertex: No. of edges leaving a vertex.
Problems:
4 3
1 2
iii)
Vertex 1 2 3 4
In-degree 1 2 2 3
Out-degree 4 2 1 1
Partial Orders
(i) R is reflexive
(ii) R is antisymmetric and
(iii) R is transitive on A.
A set A with partial order R defined on it is called a partial ordered set or an ordered set or a
poset and is denoted by (A, R).
Example: Let A={1,2,3,4} and R is a relation on A and is defined by xRy iff x|y.
That is R={(1,1)(1,2),(1,3),(1,4),(2,2),(2,4),(3,3),(4,4)}
We observe that
Hasse Diagram
Problems
12
4 6
2 3
2. Let A={1,2,3,4,6,8,12}. On A define the partial ordering relation R by aRb if and only if
a|b. Draw the Hasse diagram for R.
8 12
4 6
2 3
3. Draw the Hasse diagram for the set of all positive divisors of 36 i.e
D36={1,2,3,4,6,9,12,18,36}
Solution: The set of all positive divisors of 36 is
D36={1,2,3,4,6,9,12,18,36}
The relation of divisibility is a partial order on this set.
We have R = {(a, b) | a divides b}
= {(a, b) | b = ka, k ∈ Z }
= {(1,1), (1, 2), (1,3), (1, 4), (1, 6), (1,9), (1,12), (1,18), (1,36), (2, 2), (2, 4),(2, 6), (2,12), (2,18),
(2, 36), (3,3), (3, 6), (3, 9), (3,12),(3,18), (3,36), (4, 4), (4,8),(4,12), (4,36),(6, 6), (6,12),
(6,18), (6, 36), (9,9), (9,18),(9,36), (12,12), (12,36), (18,18), (18, 36), (36, 26)}
12 18
9
4 6
2 3
1
4. For A = {a, b, c, d , e} , the Hasse diagram for the poset ( A, R) is as shown below.
(a) Determine the relation matrix R (b) Construct the digraph for R .
e
Solution: We have
R = {( a, b )( a, c ), ( a, d ), (a , e), (b, b ), (b, d ), (b, e),
( c, c ), (c , d ), ( c, e),( d , d ), ( d , e), ( e, e)}
a b c d e
d
a 1 1 1 1 1
b 0 1 0 1 1
(a) M ( R) = M R =
c 0 0 1 1 1
b c
d 0 0 0 1 1
e 0 0 0 0 1
(b) The digraph for R is shown below:
a
c d
a b
5. Let A={a, b, c},B=p(A),where p(A) is the power set of A. Let R is a subset of relation on
A. Draw the Hasse diagram of the poset (B,R).
S7 is related to s7 , s8 .
S8 is related to s8 .
S5 S6 S7
S3
S2 S4
S1
4 3
1 2
R = {(1,1), (1, 4), (2, 2), (2, 3), (3,1), (3, 2), (3, 4), (4, 4)}
1 2
By observing the Hasse diagram of R , we find that the vertices that are to be identified as
v1 , v2 , v3 , v4 in the topological sorting process are,
v1 = 4, v2 = 1(or 2), v3 = 2(or 1), v4 = 3 .Thus, the total order T on A that contain R as subset is
32
30
6 10 15
16
8
3 5
2
4
Problems:
1. Find the maximal , minimal, least and greatest elements of the posets.
5
3
5 4
4 7
3 6
2 3 2 8
4
5
6 Fig(ii)
1 Fig(i) 1 2 9
1 Fig(iii)
Solution:
g h
f g
f
d e e
d
a b
a b Fig (ii)
Fig (i)
Lattice:
a) The meet of x and y , denoted by x ∧ y , is the maximum of all lower bounds for x and y
;i.e x ∧ y = max{w ∈ A : w ≤ x, w ≤ y} , the greatest lower bound for x and y .
b) The join of x and y , denoted by x ∨ y , is the minimum of all upper bounds for x and y
;i.e., x ∨ y = min{z ∈ A : x ≤ z, y ≤ z} , the least upper bound for x and y .
Note: Any statement about lattices involving the operations ∧ and ∨ and the relations ≤ and ≥
remains true if ∧ is replaced by ∨ , ∨ is replaced by ∧ , ≤ by ≥ and ≥ by ≤ .
The operations ∧ and ∨ are called duals of each other as are the relations ≤ and ≥ .
Similarly, the lattices L , ≤ and L , ≥ are called dual of each other.
DEFINITION (Lattice): A poset〈 A,≤ 〉is a lattice iff every pair of elements in A have both
a meet and a join.
In other words, A poset 〈A,≤ 〉is lattice, if for all x, y ∈ A , the elements LUB{x, y} and
GLB{x, y} exist in A.
Example1:
Consider a poset 〈N,≤ 〉wher N is the set of natural numbers. Then for any x, y ∈ N , we note
that LUB{x, y} = max{x, y} GLB{x, y} = min{x, y} and both of these belong to N . Therefore , the
poset N , ≤ is a latiice.
Example 3:
Given A={2,3,6,12} and the relation R defined on A by the Hasse diagram as show below find,
lub{2, 3}, glb{2,3},lub{2, 12} and glb{6, 12}. Is (A, R) is a Lattice? If not give reason.
12
2 3
lub{2, 3} = 6
lub{2,12} = 12
glb{6,12} = 6
Since the meet for 2 and 3 does not exist. Therefore (A, R) is not lattice.
Example 4: If the poset is to be lattice, what are the properties it should satisfy? The Hasse
diagram for 2 posets are given below, determine with reasons whether or not they are
lattice.
g f
h
d e
e
b c
b c
a
a
The poset (A, R) associated with Hasse diagram (i) is not a lattice because,
The poset (A, R) associated with Hasse diagram (ii) is not lattice because ,
Example 5:
Show that the following posets are lattices, and interpret their meets and joins:
a) The poset of the divisors of 60, ordered by divisibility.
b) The poset of the subsets of A= {0, 1, 2}, ordered by the subset relation.
Solution: we have,
D60 = {1, 2, 3, 5, 6,10,12,15, 20, 30, 60} and ρ ( A) = {φ ,{0},{1},{2},{1, 2},{0, 2},{1, 2},{0,1, 2}}
a) The poset consisting of all the divisors of 60 is a lattice; every pair of elements has both a
meet and a join.
The meet (greatest lower bound) of two divisors is their greatest common divisor:
for example, 6 ∧ 20 = gcd(6, 20) = 2.
The join (least upper bound) of two divisors is their least common multiple:
for example, 6 ∨ 20 = lcm(6, 20) = 60.
b) The poset consisting of all the subsets of {0, 1, 2} is also a lattice.
The meet (greatest lower bound) of two subsets is the intersection of the two subsets:
for example, {0, 1} ∧ {1, 2} = {0, 1} ∩ {1, 2} = {1}.
The join (least upper bound) is the union of the two subsets:
for example, {0, 1} ∨ {1, 2} = {0, 1} ∪ {1, 2} = {0, 1, 2}.
Both of these examples generalize. Given any positive integer n, the set of all its divisors
forms a lattice in which the meet of two divisors is their greatest common divisor and their
Example 5:
1
Show that the posets represented by the following Hasse diagrams are latice.
4 5
2 3 2 3 4
1 1
Example 6: Determine whether the posets shown in the following Hasse diagrams are lattice or
not.
7
e f
5 6
d 4
2 3
a (a) b (b)
1
Solution: The poset shown in fig.(a) is not lattice since the elements e and f have no upper
bound, hence sup(e,f) does not exist. The poset shown in fig. (b) is a lattice.
Remember:
1. Let ( L, ≤ ) be a lattice. For any a, b, c ∈ L , prove the following properties called isotonicity hold;
a ⊕ (b ∗ c ) ≤ ( a ⊕ b ) ∗ ( a ⊕ c )
From (1) and (2) weget
Similarly the second distributive inequality can be proved by the principal of duality.
SUBLATTICES:
Consider a non-empty subset L1of a Lattice L. Then L1 is called a sublattice L if L1is itself is a
lattice w.r.t the operations of L i.e., if a ∧ b ∈ L1 and a ∨ b ∈ L1 whenever a, b ∈ L1 .
Example:1
Consider the lattice of all +ve integers I+ under the operation of divisibility . The lattice Dnof all
divisors of n>1 is a sub lattice of I+ .
Example2
Let L , ≤ be a lattice in which L = {a1 , a2 ,....a8 } and S1 , S 2 and S3 be the subsets of L given by
S1 = {a1 , a2 , a4 , a6 }, S2 = {a3 , a5 , a7 , a8 }and S3 = {a1 , a2 , a4 , a8 } . The Hasse diagram of L , ≤ is
shown below. a1
We can observe that , S1 , ≤ and S2 , ≤ are sublattices
of L , ≤ , but S3 , ≤ is not a sub lattice, because a2 a3 a4
a2 , a4 ∈ S3 a2 ∧ a4 = a6 ∉ S3
a6
a5 a7
Example 3
a8
Determine all the sublattices of D30 that contain at least four elements ,
D30={1,2,3,5,6,10,15,30}.
Dr. J Santhosh Kumar, REVA University Page 15
Ans: The sublattices of D30 that contain at least four elements are as follows:
Example 3
Consider the Lattice L as shown in Fig. Determine whether or not each of the following is a
sublattice of L.
{1, 2, 3}
{1} { 2} { 3}
Sol: A is not a sublattice since {1, 2} ∧ {2,3} = {2} which does not exist in A.
D is not a sublattice since {1} ∧ {3} = {} which does not exist in D..