Scribd
Upload
367 views34 pages

Hasse Diagram, Chain and Antichain

The document discusses concepts related to partially ordered sets including maximal and minimal elements, upper and lower bounds, least upper bounds and greatest lower bounds, lattices, chains, antichains, and totally ordered sets. Examples are provided to illustrate these concepts.

Uploaded by

lms vb
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
367 views34 pages

Hasse Diagram, Chain and Antichain

The document discusses concepts related to partially ordered sets including maximal and minimal elements, upper and lower bounds, least upper bounds and greatest lower bounds, lattices, chains, antichains, and totally ordered sets. Examples are provided to illustrate these concepts.

Uploaded by

lms vb
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/ 34

Hasse Diagram, Chain and Antichain

Maximal and Minimal Elements


• Maximal element is an element of a POSET
which is not less than any other element of
the POSET. Or we can say that it is an element
which is not related to any other element. Top
elements of the Hasse Diagram.
Maximal and Minimal Elements
• Minimal element is an element of a POSET
which is not greater than any other element of
the POSET. Or we can say that no other
element is related to this element. Bottom
elements of the Hasse Diagram.
Maximal and Minimal Elements
Upper Bound and Lower Bound
• Upper Bound: Consider B be a subset of a
partially ordered set A. An element x ∈ A is
called an upper bound of B if y ≤ x for every y
∈ B.
• Lower Bound: Consider B be a subset of a
partially ordered set A. An element z ∈ A is
called a lower bound of B if z ≤ x for every x ∈
B.
Example
Example
Example
Example
Least Upper Bound ( LUB, Supreme,
Join)
• Let A be a subset of a partially ordered set S.
An element M in S is called an upper bound of
A if M succeeds every element of A, i.e. if, for
every x in A, we have x <=M.
• Least ( Minimum ) element in Upper Bound.
Greatest Lower Bound ( GLB, Infimum,
Meet)
• An element m in a poset S is called a lower
bound of a subset A of S if m precedes every
element of A, i.e. if, for every y in A, we have
m <=y.
• Greatest ( Maximum) element in lower
bound.
1. B = { a,c,f} Find LUB and GLB.
2. B= { d,c}
1. B = { d, e } Find LUB and GLB.
2. B = { b, c}
Lattice
• A partially ordered set is said to be a lattice if
every two elements in the set have a least
upper bound and a greatest lower bound.
Identify whether below structures are
lattice or not ?
Identify whether below structures are
lattice or not ?
Identify whether below structures are
lattice or not ?
Chain and Antichain
Chain and Antichain
• Let (A, ≤ ) be a partially ordered set. A subset
of A is called a chain if every two elements in
the subset are related.

• Let (A, ≤ ) be a partially ordered set. A subset


of A is called an antichain if no two elements
in the subset are related.
Find Chains and Antichains
Chains :
{a,b,c,e}
{a,b,c}
{a,d,e}
{b,c,e}
{a,b}
{b,c}
{c,e}
{a,d}
{d,e}
Find Chains and Antichains
Antichains :

{b,d}
{c,d}
Example
• P = { 1,2,3,4,5,6,9,12,18} , Let R be relation
such that (a,b) belongs to R iff a divides b. Find
Chains and Antichains.
• Chain :
– {1,a} ( a belongs to p)
– {1,2,6}
– {1,3,6,12}
– {1,3,6,18}
• Antichain
– {3,5}
– {2,3}
– {2,3,5}
– {3,4,5}
– {4,5,6,9}
Totally Ordered Set
• A partially ordered set ( A, ≤ ) is called totally
ordered set if A is a chain.
Theorem related to chain - antichain
• Let ( P, ≤ ) be a partially ordered set. Suppose
the length of the longest chains in P is n, then
the elements in P can be partitioned into n
disjoint antichains.

You might also like