Partial Orderings: Selected Exercises

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

CSE 211- Discrete Structures1 Relations Ch 2 schaums, Ch 7 Rosen.
CSCI 115 Chapter 6 Order Relations and Structures.
Relations Relations on a Set. Properties of Relations.
Equivalence, Order, and Inductive Proof
8.6 Partial Orderings. Definition Partial ordering– a relation R on a set S that is Reflexive, Antisymmetric, and Transitive Examples? R={(a,b)| a is.
Chapter 7 Relations : the second time around
Foundations of Data-Flow Analysis. Basic Questions Under what circumstances is the iterative algorithm used in the data-flow analysis correct? How precise.
Data Flow Analysis Compiler Design Nov. 3, 2005.
1 Relations: The Second Time Around Chapter 7 Equivalence Classes.
Theory and Applications
Equivalence Relations: Selected Exercises
Partial Orderings: Selected Exercises
Section 7.6: Partial Orderings Def: A relation R on a set S is called a partial ordering (or partial order) if it is reflexive, antisymmetric, and transitive.
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Partially Ordered Sets (POSets)
Relations Chapter 9.
Chapter 9 1. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing.
Relations (3) Rosen 6th ed., ch fall.
Sets, POSets, and Lattice © Marcelo d’Amorim 2010.
Chapter 6. Order Relations and Structure
Lecture 4.5: POSets and Hasse Diagrams CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
1 Partial Orderings Aaron Bloomfield CS 202 Rosen, section 7.6.
Copyright © Cengage Learning. All rights reserved.
Discrete Structures – CNS2300
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
2.6 Equivalence Relation §1.Equivalence relation §Definition 2.18: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric,
Chapter 9. Section 9.1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and.
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 8 Relations 歐亞書局.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CS 267: Automated Verification Lecture 3: Fixpoints and Temporal Properties Instructor: Tevfik Bultan.
Relations and their Properties
Sets and Subsets Set A set is a collection of well-defined objects (elements/members). The elements of the set are said to belong to (or be contained in)
Relations & Their Properties: Selected Exercises.
1 Partial Orderings Aaron Bloomfield CS 202 Epp, section ???
Problem Statement How do we represent relationship between two related elements ?
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
1 Section 4.3 Order Relations A binary relation is an partial order if it transitive and antisymmetric. If R is a partial order over the set S, we also.
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
Chap. 7 Relations: The Second Time Around
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Partial Order Relations Lecture 50 Section 10.5 Wed, Apr 20, 2005.
1 Partial Orderings Epp, section Introduction An equivalence relation is a relation that is reflexive, symmetric, and transitive A partial ordering.
Equivalence Relations: Selected Exercises
Chapter 5 Relations and Operations
Chapter 6 Order Relations and Structures
Fixpoints and Reachability
CSE 2813 Discrete Structures
Unit-III Algebraic Structures
Partial Orders.
Partial Orderings CSE 2813 Discrete Structures.
Partial Orders (POSETs)
Introduction to Relations
Relations Binary relations represent relationships between the elements of two sets. A binary relation R from set A to set B is defined by: R  A 
Equivalence Relations
Relations Chapter 9.
Partial Orderings.
Partial Order Relations
Discrete Math & Fixed points
Discrete Math (2) Haiming Chen Associate Professor, PhD
Partial Orders Section 9.6 of Rosen Spring 2018
Sungho Kang Yonsei University
Background material.
Relations.
교환 학생 프로그램 내년 1월 중순부터 6월 초 현재 학부 2,3 학년?
Equivalence Relations: Selected Exercises
Relations: The Second Time Around
Relations & Their Properties: Selected Exercises
Presentation transcript:

Partial Orderings: Selected Exercises

Copyright © Peter Cappello Partial Order Let R be a relation on A. R is a partial order when it is: Reflexive Antisymmetric Transitive. Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 10 a b c d Is this directed graph a partial order? Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 10 Solution a b c d Is this directed graph a partial order? Is it reflexive? Is it antisymmetric? Is it transitive? Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 20 Draw the Hasse diagram for the “≥” relation on { 0, 1, 2, 3, 4, 5 }. Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 20 Solution Draw the Hasse diagram for the “≥” relation on { 0, 1, 2, 3, 4, 5 }. In a Hasse diagram: Direction is implied (up), hence omitted I.e., we use edges instead of arcs. Edges implied by transitivity are omitted 5 1 2 3 4 Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 40 a) Show that there is exactly 1 greatest element of a poset, if such an element exists. Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 40 a) There is exactly 1 greatest element of a poset, if such an element exists. Proof: By contradiction: Assume x & y are distinct greatest elements. x  y (Step a: y is a greatest element) y  x (Step a: x is a greatest element) x = y. (Step b & c & antisymmetry) Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 40 continued b) Show that there is exactly 1 least element, if such an element exists. Proof: Similar to part a) Copyright © Peter Cappello

Copyright © Peter Cappello Let S be a set with n elements. Consider the poset ( P( S ),  ). What does the Hasse diagram look like when: Let |S| = 0 Let |S| = 1 Let |S| = 2 Let |S| = 3 Let |S| = 4 Let |S| = n Copyright © Peter Cappello

Copyright © Peter Cappello |S| = 0; | P( S ) | = 20 Hasse diagram: a 0-cube: Just a single point. Ø Copyright © Peter Cappello

Copyright © Peter Cappello |S| = 1; | P( S ) | = 21 Represent each subset by a 1-bit string: 0 represents the empty set 1 represents the set with 1 element. Hasse diagram: a 1-cube: Just a single edge. 1 Copyright © Peter Cappello

Copyright © Peter Cappello |S| = 2; | P( S ) | = 22 Represent each subset by a 2-bit string: b1 b2 Hasse diagram: a 2-cube: Just a square. 11 10 01 00 Copyright © Peter Cappello

Copyright © Peter Cappello |S| = 3; | P( S ) | = 23 Represent each subset by a 3-bit string: b1 b2 b3 Hasse diagram: a 3-cube. 111 011 110 101 100 010 001 000 Copyright © Peter Cappello

Copyright © Peter Cappello |S| = 4; | P( S ) | = 24 Represent each subset by a 4-bit string: b1 b2 b3 b4 Hasse diagram: a 4-cube. Copyright © Peter Cappello

Copyright © Peter Cappello 2011 1111 1101 1011 1110 0111 1010 1010 1001 0110 0101 1100 0011 1000 0100 0010 0001 Copyright © Peter Cappello 2011 0000

Copyright © Peter Cappello 2011 1111 1101 1011 1110 0111 1010 1001 0110 0101 1100 0011 1000 0100 0010 0001 Sub-diagram For elements 1, 2, 3 Copyright © Peter Cappello 2011 0000

Copyright © Peter Cappello 2011 1111 1101 1011 1110 0111 1010 1001 0110 0101 1100 0011 1000 0100 0010 0001 Sub-diagram For elements 2, 3, 4 Copyright © Peter Cappello 2011 0000

Copyright © Peter Cappello 2011 1111 1101 1011 1110 0111 1010 1001 0110 0101 1100 0011 1000 0100 0010 0001 Sub-diagram For elements 1, 2, 4 Copyright © Peter Cappello 2011 0000

Copyright © Peter Cappello In the Connection Machine, 216 processors were connected as a 16-cube. Copyright © Peter Cappello

Copyright © Peter Cappello Topological Sorting Total ordering T is compatible with partial ordering P when a, b ( a ≤P b  a ≤T b ). Element a is minimal when there is no element b with b ≤ a. Copyright © Peter Cappello

Copyright © Peter Cappello Topological Sorting Problem (Topological Sort) Input: A finite partial ordering ( S, ≤ ). Output: A compatible total ordering. Algorithm: While ( S ≠  ) output ( S.removeAMinimalElement() ); What are good data structures for finding a minimal element? Copyright © Peter Cappello

Copyright © Peter Cappello End 8.6 Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 30 Let ( S,  ) be a poset, and let x, y  S. Notation: x < y means x  y and x ≠ y. Definitions: y covers x if x < y and z  S ( x < z < y ). The covering relation of (S,  ) = { ( x, y ) | y covers x }. Show: ( x, y ) is in the covering relation of finite poset ( S,  )  x is lower than y and an edge joins x & y in the Hasse diagram. A poset’s covering relation defines the edge set of its Hasse diagram. Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 30 Solution x is lower than y and an edge joins x & y in the Hasse diagram  (x, y) is in the covering relation of finite poset (S,  ). Proof: Assume x is lower than y and an edge joins x & y in the Hasse diagram. x < y. (Defn. of Hasse diagrams) (An edge joins x to y)  z  S ( x < z < y ). (Defn. of Hasse diagrams) An edge joins x to y. (Step 1) z  S ( x < z < y ). (Step 3 & 4 & modus ponens) Therefore, x is covered by y. (Step 2 & 5, defn. of covers) Copyright © Peter Cappello

Copyright © Peter Cappello Exercise 30 Solution ( x, y ) is in the covering relation of finite poset ( S,  )  x is lower than y and an edge joins x & y in the Hasse diagram. Proof: Assume ( x, y ) is in the covering relation of finite poset ( S,  ). x < y (Defn of y covers x) x is lower than y in diagram. (Step 2 & Defn. of Hasse diagram) z ( x < z < y ). (Defn. of y covers x) An edge joins x to y. (Step 2 & 4 & Defn. of Hasse diagram) Copyright © Peter Cappello

Copyright © Peter Cappello 50 Defn. If (S,  ) is a poset & every 2 elements are comparable, S is totally ordered. Defn. x is the least upper bound of A if x is an upper bound that is less than every other upper bound of A. Defn. x is the greatest lower bound of A if x is a lower bound that is greater than every other lower bound of A. Defn. A poset in which every 2 elements have a least upper bound & a greatest lower bound is a lattice. Show that every totally ordered set is a lattice. Copyright © Peter Cappello

Copyright © Peter Cappello 50 continued Prove S is totally ordered  S is a lattice. Proof Assume S is totally ordered. a, b (a  b  b  a). (Defn. of total order) Select 2 arbitrary elements a, b  S. Assume without loss of generality a  b. a is the greatest lower bound of {a, b}. (Step 3) b is the least upper bound of {a, b}. (Step 3) S is a lattice. (Step 4 & 5, Defn. of lattice) Copyright © Peter Cappello

Copyright © Peter Cappello 60 Defn. a is maximal in poset (S,  ) if b  S ( a < b ). Show: Poset (S,  ) is finite & nonempty  a  S, a is maximal. Proof: Assume poset (S,  ) is finite & nonempty. Let a  S. (Step 1: S  ) for ( max := a; S  ; S := S – {b} ) Let b  S. If max < b, max := b. max is maximal. Step 3 terminates. (S is finite; smaller each iteration) Copyright © Peter Cappello