Scribd
Upload
17 views

Partial Order

A partial ordering is a relation on a set that is reflexive, antisymmetric, and transitive, forming a partially ordered set (poset). Elements of a poset can be comparable or incomparable, and a total order is a special case where every pair of elements is comparable. The document also discusses examples of relations and their properties in relation to partial orders.

Uploaded by

janssenmarana18
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
17 views

Partial Order

A partial ordering is a relation on a set that is reflexive, antisymmetric, and transitive, forming a partially ordered set (poset). Elements of a poset can be comparable or incomparable, and a total order is a special case where every pair of elements is comparable. The document also discusses examples of relations and their properties in relation to partial orders.

Uploaded by

janssenmarana18
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/ 11

PARTIAL ORDERING

Definition: A relation R on a set S is called a partial


ordering or partial order if it is reflexive, antisymmetric,
and transitive. A set S together with the partial ordering R is
called a partially ordered set or poset, and is denoted by
(S, R). Members of S are called elements of poset
Example
Show that Relation R = a/b , on ℤ is partial order
+

relation
For a set A = {1,2,3}, check if the following relations
are POSET ?
R1 = {(1,1), (2,2), (3,3)}
R2 = {(1,1), (2,2), (3,3), (1,2), (2,1)}
Definition: The elements a and b of a poset (S,≺)
are called comparable if either a ≺ b or b ≺ a.
When a and b are elements of S such that neither
a ≺ b nor b ≺ a are called incomparable
Definition: If (S,≺) is a poset and every two
elements of S are comparable, S is called total
ordered or linearly ordered set and ≺ is called the
total order or a linear order. A totally ordered set
is called a chain
Definition: (S,≺) is well-ordered set if it is a poset
such that ≺ is a total ordering or every non-empty
subset of S has a least element.
Which of the following relations on set 0, 1, 2, 3 are
partial orderings? Determine the properties of partial
ordering that relations lack.
𝑅1 = 0, 0 , 2, 2 , (3, 3)
𝑅2 = 0, 0 , 1, 1 , 2, 0 , 2, 2 , 2, 3 , (3, 3)
𝑅3 = 0, 0 , 0, 1 , 0, 2 , 1, 0 , 1, 1 , 1, 2 , 2, 0 , 2, 2 , (3, 3)
𝑅4 = 0, 0 , 1, 1 , 1, 2 , 1, 3 , 2, 0 , 2, 2 , 2, 3 , 3, 0 , (3, 3)
S is the set of all people in the world R is the
relation defined on set S such that (𝑎, 𝑏) ∈ 𝑅 ,
where a and b are people, if a is taller than b. Is
(S, ≺) a poset?
Tell whether the relations represented by these
non-zero matrices are partial orders.

1 0 1 1 0 1 0
1 1 0 0 1 1 0
0 0 1 0 0 1 1
1 1 0 1
HASSE DIAGRAM
named after the German
mathematician Helmut Hasse
R = 𝑎, 𝑏 | 𝑎 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑏
S = 1, 2, 4, 6, 8
R = 𝑎, 𝑏 | 𝑎 ≤ 𝑏
S = 1, 2, 3, 4

You might also like