Scribd
Upload
12 views14 pages

LectureNote MA221 07aug

Uploaded by

rishiraj170609
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
12 views14 pages

LectureNote MA221 07aug

Uploaded by

rishiraj170609
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/ 14

Discrete Mathematics

Lecture 6: Sets, Relations and Functions


Partha Sarathi Mandal
IIT Guwahati
Compatible Orderings
• Let (S, ) be a poset. A total ordering (S, <) is compatible with (S, ), if
for any items x and y,
x  y implies x < y
• Equivalently,  is a subset of <.

• Every finite poset has at least one compatible total ordering;


Constructing one such ordering is called the topological sorting
problem
Compatible Orderings

• Find compatible total ordering of this graph (?)


• underwear < clothes < pants < trousers < socks < tie < shoes < jacket < watch
Compatible Orderings
• Given a finite poset (S, ) , the following shows how to obtain a
compatible total ordering :
1. Get a minimal item x
2. Denote x as the smallest item
3. Remove the minimal item x from S, and recursively find the compatible
total ordering
4. Place the remaining items, from small to large as defined in 3, after the
item x
Example
Let A be a given finite set and 2A its power set of A. Draw Hasse diagram of
the poset, (2A, ), where (a) A= {a}, (b) A= {a,b}, (c) A= {a,b,c},(d) A= {a,b,c,d}.

A={a,b,c}
a

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


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

(a) (b) (c) (d) ??


Upper and Lower Bounds
• We define the following terms : j k
• Let (S, ) be a poset. For items x and y, if
there is an item z such that x  z and y  z,
h i
then z is called an upper bound of x and y.
• h is an upper bound of f and g; so are i, j, and k.
• Similarly, for items x and y, if there is an item f g
w such that w  x and w  y, then w is called
a lower bound of x and y.
b c d e
• a, b, c, d, e, f and g are all lower bound of i

a
Upper and Lower Bounds
• We define the following terms : a
A={a,b,c}
• Let (S, ) be a poset. And a set A  S. Any
element x S is an upper bound for A if for {a,c} {b,c}
all a  A, a  x. {a,b} a

• Similarly, any element x S is an lower


bound for A if for all a  A, x  a. {a} {b} {c}

• Example: Let B = {{b}, {c}, {b,c}}



• Then {b,c} and A are upper bounds for B, while
∅ is its lower bound.
• C = {{c}, {a,c}} the upper bounds are {a,c} and A, (c)
while lower bounds are {c}, ∅.
Example
Let X = {2,3,6,12,24,36}. Then Draw the Hasse
diagram of the poset (X,|).
24 36

if A = {2,3,6} then upper bounds are 6, 12, 24, 36


12
for A, whereas there is no lower bound for A.

2 3
Upper and Lower Bounds
• Consider the poset as shown on the right
• Which items are :
1. Upper bounds of 2 and 3 ?
2. Lower bounds of 2 and 3 ?
3. Upper bounds of 6 and 8 ?
4. Lower bounds of 6 and 8 ?
LUB and GLB
• We further define the following terms :
j k
• An item z is a least upper bound (LUB) or
supremum (or sup) for items x and y, if z is an
upper bound of x and y, and no other upper
bound d of x and y exists with d  z -- (i) h i
• The lub of f and g does not exist. Here h and i are
upper bounds – violating (i) (neither h  i nor i  h).
• Similarly, an item w is called a greatest lower f g
bound (GLB) or infimum (or inf) of x and y, if w
is a lower bound of x and y, and no other lower
bound c of x and y exists with w  c – (ii)
• The glb of h and i does not exist. Here f and g are b c d e
lower bounds – violating (ii) (neither f  g nor g  f).

a
LUB and GLB
• Let (S, ) be a poset and set A  S. An element x S is
lub for A if x is an upper bound for A and x  y, where y
is any upper bound for A. Similarly for glb. 24 36
• For a simply ordered set or a chain, every subset has a
sup and an inf.
12
• A lub, if it exits, is unique, and the same is true for the
glb.
• For A = {2,3,6}, the upper bounds are 6,12, 24, 36, 6
whereas there is no lower bound for A.
• For A has the lub = 6 while the glb of A does not exist. 2 3
LUB and GLB
• B = {2,3} LUB is 6, but there is no GLB.
• C= {12,6}, LUB is 12 and GLB is 6
24 36
• The poset which are such that every subset has a lub
and glb form an important subclass of poset termed as
12
Lattice.

2 3
Well-ordered
• Definition: A poset is called well-ordered if every nonempty subset of
it has a least member (minimum).
• As a consequence of this definition, it follows that every well-ordered
set is totally ordered, because for any subset, say {x,y}, we must have
either x or y as its least member.
• Of course every totally ordered set need not be well-ordered.
• A finite totally ordered set is also well-ordered.
LUB and GLB
• Consider the poset as shown on the right
• Which items are :
1. LUB of 2 and 3 ?
2. GLB of 2 and 3 ?
3. LUB of 6 and 8 ?
4. GLB of 6 and 8 ?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy