Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda.

Slides:



Advertisements
Similar presentations
Equivalence Relations
Advertisements

Relations.
Applied Discrete Mathematics Week 11: Graphs
CSE115/ENGR160 Discrete Mathematics 05/03/11 Ming-Hsuan Yang UC Merced 1.
Discrete Mathematics Lecture#11.
Relations Chapter 9.
Chapter 9 1. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing.
Lecture 4.5: POSets and Hasse Diagrams CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Exam 2 Review 8.2, 8.5, 8.6, Thm. 1 for 2 roots, Thm. 2 for 1 root Theorem 1: Let c 1, c 2 be elements of the real numbers. Suppose r 2 -c 1.
Exam 2 Review 7.5, 7.6, |A1  A2  A3| =∑|Ai| - ∑|Ai ∩ Aj| + |A1∩ A2 ∩ A3| |A1  A2  A3  A4| =∑|Ai| - ∑|Ai ∩ Aj| + ∑ |Ai∩ Aj ∩ Ak| - |A1∩
1 Partial Orderings Aaron Bloomfield CS 202 Rosen, section 7.6.
CS Discrete Mathematical Structures Mehdi Ghayoumi MSB rm 132 Ofc hr: Thur, 9:30-11:30a Fall 2002KSU - Discrete Structures1.
Chapter 9. Chapter Summary Relations and Their Properties Representing Relations Equivalence Relations Partial Orderings.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
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.
Lecture 2.2: Set Theory* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations and their Properties
Lecture 4.3: Closures and Equivalence Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
Lecture 6.1: Misc. Topics: Number Theory CS 250, Discrete Structures, Fall 2011 Nitesh Saxena.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Lecture 2.1: Sets and Set Operations CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
1 Partial Orderings Aaron Bloomfield CS 202 Epp, section ???
Lecture 5.4: Paths and Connectivity CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Zeph Grunschlag.
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.
Lecture 4.1: Relations Basics CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Lecture 4.2: Relations Basics CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
Lecture 2.2: Set Theory CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Lecture 4.2: Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
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.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda.
Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.
Lecture 4.1: Relations Basics CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
9/29/2011Lecture Strong Induction1 Lecture 3.2: Strong Induction CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
9/27/2011 Lecture Mathematical Induction1 Lecture 3.1: Mathematical Induction* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from.
Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation is a relation on.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Representing Relations Using Digraphs
Relations and Their Properties
Citra Noviyasari, S.Si, MT
Partial Orders.
CSE15 Discrete Mathematics 05/03/17
Introduction to Relations
Equivalence Relations
Relations Chapter 9.
Dr. Ameria Eldosoky Discrete mathematics
Lecture 4.1: Relations Basics
Aaron Bloomfield CS 202 Epp, section ???
CS 173: Discrete Mathematical Structures
Lecture 4.3: Closures and Equivalence Relations
Lecture 4.1: Relations Basics
CS 250, Discrete Structures, Fall 2014
CS 250, Discrete Structures, Fall 2015
Lecture 4.3: Closures and Equivalence Relations
Lecture 2.1: Sets and Set Operations*
Lecture 4.1: Relations Basics
Lecture 5.3: Graph Isomorphism and Paths
9.5 Equivalence Relations
Relations.
교환 학생 프로그램 내년 1월 중순부터 6월 초 현재 학부 2,3 학년?
Chapter 8 (Part 2): Relations
Presentation transcript:

Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren

Lecture Equivalence Classes and Partially Ordered Sets Course Admin Mid-Term 2 Exam Graded Solution has been posted Any questions, please contact me directly Please pick up, if haven’t done so already HW3 Graded Solution has been posted Please contact the TA for questions Please pick up, if haven’t done so already

Final Exam Thursday, December 8, 10:45am- 1:15pm, lecture room Heads up! Please mark the date/time/place Our last lecture will be on December 6 We plan to do a final exam review then Lecture Equivalence Classes and Partially Ordered Sets

HW4 HW4 to be posted by this weekend Covers the chapter on Relations Will be due in 10 days from the day of posting Lecture Equivalence Classes and Partially Ordered Sets

Outline Equivalence Classes Partially Ordered Sets (POSets) Hasse Diagrams

Lecture Equivalence Classes and Partially Ordered Sets Equivalence Classes Lemma: Let R be an equivalence relation on S. Then 1. If aRb, then [a] R = [b] R 2. If not aRb, then [a] R  [b] R =  Proof: 1. Suppose aRb, and consider x  S. x  [a] R  aRx  xRa  xRb  bRx  x  [b] R Defn of [a] R symmetry transitivity symmetry Defn of [b] R

Lecture Equivalence Classes and Partially Ordered Sets Equivalence Classes Lemma: Let R be an equivalence relation on S. Then 1. If aRb, then [a] R = [b] R 2. If not aRb, then [a] R  [b] R =  Proof: 2. Suppose to the contrary that  x  [a] R  [b] R. x  [a] R x  [b] R  aRx and bRx  aRb, contradicting “not aRb”  aRx and xRb Thus, [a] R and [b] R are either identical or disjoint.

Lecture Equivalence Classes and Partially Ordered Sets Equivalence Classes So S is the union of disjoint equivalence classes of R. A partition of a set S is a (perhaps infinite) collection of sets {A i } with Each A i non-empty Each A i  S For all i, j, A i  A j =  S =  A i Each A i is called a block of the partition.

Lecture Equivalence Classes and Partially Ordered Sets Equivalence Classes Give a partition of the reals into 2 blocks (numbers 0) Give a partition of the integers into 4 blocks numbers modulo 4

Lecture Equivalence Classes and Partially Ordered Sets Equivalence Classes Theorem: if R is a _____ S, then {[a] R : a  S} is a _____ S. A.Partition of, equivalence relation on B.Subset of, equivalence class of C.Relation on, partition of D.Equivalence relation on, partition of E.I have no clue. Theorem: if R is an equivalence relation on S, then {[a] R : a  S} is a partition of S. Proof: we need to show that an equivalence relation R satisfies the definition of a partition. Follows from previous arguments and definition of equivalence classes.

Lecture Equivalence Classes and Partially Ordered Sets Equivalence Classes Theorem: if {Ai} is any partition of S, then there exists an equivalence relation R, whose equivalence classes are exactly the blocks Ai. Proof: If {Ai} partitions S then define relation R on S to be R = {(a,b) :  i, a  A i and b  A i } Next show that R is an equivalence relation. Reflexive and symmetric. Transitive? Suppose aRb and bRc. Then a and b are in A i, and b and c are in A j. But b  A i  A j, so A i = A j. So, a, b, c  A i, thus aRc.

Example: Partition  Equivalence Relation Give an equivalence relation for the partition: {1,2}, {3, 4, 5}, {6} for the set {1,2,3,4,5,6} Lecture Equivalence Classes and Partially Ordered Sets

Partially Ordered Sets (POSets) Let R be a relation then R is a Partially Ordered Set (POSet) if it is Reflexive - aRa,  a Transitive - aRb  bRc  aRc,  a,b,c Antisymmetric - aRb  bRa  a=b,  a,b Ex. (R,  ), the relation “  ” on the real numbers, is a partial order. How do you check? a  a for any real Reflexive? Transitive? Antisymmetric? If a  b, b  c then a  c If a  b, b  a then a = b

Lecture Equivalence Classes and Partially Ordered Sets Partially Ordered Sets (POSets) Let (S, R ) be a PO. If a R b, or b R a, then a and b are comparable. Otherwise, they are incomparable. A total order is a partial order where every pair of elements is comparable. Ex. (R,  ), is a total order, because for every pair (a,b) in RxR, either a  b, or b  a. Ex. (people in a queue, “behind or same place”) is a total order Ex. (employees, “supervisor”) is not a total order

Lecture Equivalence Classes and Partially Ordered Sets Partially Ordered Sets (POSets) Ex. (Z +, | ), the relation “divides” on positive integers. Yes, x|x since x=1x (k=1) Reflexive? Transitive? Antisymmetric? a|b means b=ak, b|c means c=bj. Does c=am for some m? c = bj = akj (m=kj) a|b means b=ak, b|a means a=bj. But b = bjk (subst) only if jk=1. jk=1 means j=k=1, and we have b=a1, or b=a Yes, or No? A total order?

Lecture Equivalence Classes and Partially Ordered Sets Partially Ordered Sets (POSets) Ex. (Z, | ), the relation “divides” on integers. Yes, x|x since x=1x (k=1) Reflexive? Transitive? Antisymmetric? a|b means b=ak, b|c means c=bj. Does c=am for some m? c = bj = akj (m=kj) 3|-3, and -3|3, but 3  -3. Not a poset. Yes, or No? A total order?

Lecture Equivalence Classes and Partially Ordered Sets Partially Ordered Sets (POSets) Ex. (2 S,  ), the relation “subset” on set of all subsets of S. Yes, A  A,  A  2 S Reflexive? Transitive? Antisymmetric? A  B, B  C. Does that mean A  C?A  B means x  A  x  B A  B, B  A  A=B A poset. B  C means x  B  x  C Now take an x, and suppose it’s in A. Must it also be in C? A total order?

Lecture Equivalence Classes and Partially Ordered Sets Partially Ordered Sets (POSets) When we don’t have a special relation definition in mind, we use the symbol “  ” to denote a partial order on a set. When we know we’re talking about a partial order, we’ll write “a  b” instead of “aRb” when discussing members of the relation. We will also write “a < b” if a  b and a  b.

Lecture Equivalence Classes and Partially Ordered Sets Partially Ordered Sets (POSets) Ex. A common partial order on bit strings of length n, {0,1} n, is defined as: a 1 a 2 …a n  b 1 b 2 …b n If and only if a i  b i,  i and 1000 are “incomparable” … We can’t tell which is “bigger.” A.0110  1000 B.0110  0000 C.0110  1110 D.0110  1011 A total order?

Hasse Diagrams Hasse diagrams are a special kind of graphs used to describe posets. Ex. In poset ({1,2,3,4},  ), we can draw the following picture to describe the relation. 1.Draw edge (a,b) if a  b 2.Don’t draw up arrows 3.Don’t draw self loops 4.Don’t draw transitive edges

Lecture Equivalence Classes and Partially Ordered Sets Today’s Reading Rosen 9.5 and 9.6