Equivalence Relations. Partial Ordering Relations 1.

Slides:



Advertisements
Similar presentations
Equivalence Relations
Advertisements

Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.
Chapter 3 Relations. Section 3.1 Relations and Digraphs.
Relations - review A binary relation on A is a subset of A×A (set of ordered pairs of elements from A) Example: A = {a,b,c,d,e} R = { (a,a),(a,b),(b,b),(b,c),
Basic Properties of Relations
Chapter 7 Relations : the second time around
Chapter 3 Review MATH130 Heidi Burgiel. Relation A relation R from X to Y is any subset of X x Y The matrix of a Relation R is a matrix that has a 1 in.
Relations. Binary Relations a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). Note the di ff erence between.
1 Relations: The Second Time Around Chapter 7 Equivalence Classes.
Theory and Applications
Discrete Mathematics Lecture#11.
Partially Ordered Sets Basic Concepts
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Partially Ordered Sets (POSets)
Relations Chapter 9.
Chapter 6. Order Relations and Structure
Week 8 - Wednesday.  What did we talk about last time?  Cardinality  Countability  Relations.
1 Partial Orderings Aaron Bloomfield CS 202 Rosen, section 7.6.
Ordered Sets. Relations. Equivalence Relations 1.
Chapter 9. Chapter Summary Relations and Their Properties Representing Relations Equivalence Relations Partial Orderings.
Discrete Structures – CNS2300
Chapter 2 Mathematical Preliminaries. Sets and Relations  A set is a collection of distinguishable members or elements  The members are usually drawn.
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,
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
Relations, Functions, and Countability
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
CHAPTER 3 FUZZY RELATION and COMPOSITION. 3.1 Crisp relation Product set Definition (Product set) Let A and B be two non-empty sets, the product.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Section 4.4 Properties of Relations. Order Relations Draw an arrow diagram for the relation R defined on the set {1,2,3,4} such that
Discrete Mathematics Lecture # 15 Types of Relations (contd.)
1 Partial Orderings Aaron Bloomfield CS 202 Epp, section ???
Problem Statement How do we represent relationship between two related elements ?
Chapter 8 Equivalence Relations Let A and B be two sets. A relation R from A to B is a subset of AXB. That is, R is a set of ordered pairs, where the first.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
Chapter Relations and Their Properties
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.
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
1 Equivalence relations Binary relations: –Let S1 and S2 be two sets, and R be a (binary relation) from S1 to S2 –Not every x in S1 and y in S2 have such.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
ORDERED SETS. RELATIONS COSC-1321 Discrete Structures 1.
Chap. 7 Relations: The Second Time Around
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
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 B = {a,b} {( 0, a), (
Advanced Digital Designs Jung H. Kim. Chapter 1. Sets, Relations, and Lattices.
Week 8 - Monday.  What did we talk about last time?  Properties of functions  One-to-one  Onto  Inverses  Cardinality.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
“It is impossible to define every concept.” For example a “set” can not be defined. But Here are a list of things we shall simply assume about sets. A.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
Lecture 7: Relations Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
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.
Citra Noviyasari, S.Si, MT
Introduction to Relations
Equivalence Relations
Relations Chapter 9.
Cartesian product Given two sets A, B we define their Cartesian product is the set of all the pairs whose first element is in A and second in B. Note that.
CS201: Data Structures and Discrete Mathematics I
Chapter 2 Sets and Functions.
Equivalence Relations
Relations and their Properties
Formal Definition and Examples
9.5 Equivalence Relations
Equivalence relations
교환 학생 프로그램 내년 1월 중순부터 6월 초 현재 학부 2,3 학년?
Ø Let the universe set U={1,2,3,...,10}.
Presentation transcript:

Equivalence Relations. Partial Ordering Relations 1

Equivalence Relation and Partition Every equivalence relation on S gives rise to a partition of S by taking the family of subsets in the partition to be the equivalence classes of the equivalence relation. If P is a partition of S, we can define a relation R on S by letting x R y mean that x and y lie in the same member of P. 2

Equivalence Relation and Partition Let S={1,2,3,4,5,6}. Let A={1,3,4}, B={2,6}, and C={5}. Let some equivalence relation is defined on these sets. Evidently, Then P= {A, B, C} is a partition of S={1,2,3,4,5,6}. Then we can establish a relation “x R y means that x and y lie in the same member of P”: R={(1,1),(1,3),(1,4),(3,1),(3,3),(3,4),(4,1),(4,3), (4,4), (2,2), (2,6), (6,2), (6,6), (5,5)} 3

Equivalence Relation and Partition Theorem.  An equivalence relation R on S gives rise to a partition P of S, in which the members of P are the equivalence classes of R.  A partition P of S induces an equivalence relation R in which any two elements x and y are related by R whenever they lie in the same member of P. Moreover, the equivalence classes of this relation are members of P. 4

Antisymmetric Relation A relation R on a set S is called antisymmetric if, whenever x R y and y R x are both true, then x=y. Examples. Relations “≤” and “≥” on the set Z of integer numbers. If x ≤ y and y ≤ x then always x=y. If x ≥ y and y ≥ x then always x=y. 5

Partial Ordering Relations A relation R on a set S is called a partial ordering relation, or simply a partial order, if the following 3 properties hold for this relation: 1) R is reflexive, that is, x R x is true. 2) R is antisymmetric, that is. 3) R is transitive, that is. 6

Partial Ordering Relations. Examples Relations “≤” and “≥” are partial orders on sets Z of integer numbers and R of real numbers. Let S={A,B,C,…} be a set whose elements are other sets. For define A R B if. R is reflexive ( ), antisymmetric and transitive. Thus R is a partial order. 7

Partial Ordering Relations. Examples Let us consider a set of n-dimensional binary vectors E 2 n ={(0,…,0), (0,…,01),…,(1,…,1)}. We say that vector x precedes to vector y if for all n components of these two vectors the following property holds. For example, if n=3:, but. The relation is a partial order on the set of n-dimensional binary vectors. 8

Partial Ordering Relations. Examples Let S={A, B, C, D, E, F, G} be a set of classes from some program curriculum. Let us define relation as follows: x is related to y if class x is an immediate prerequisite for class y. This relation is a partial order. 9

Lexicographic Order If R 1 is a partial order on set S 1 and R 2 is a partial order on set S 2 then we can define the following relation R on the Cartesian product S 1 xS 2. Let. Then if and only if one of the following is true: R is called the lexicographic order on S 1 xS 2 10

Lexicographic Order The lexicographic order is also referred to as a “dictionary order”, because it corresponds to the sequence in which words are listed in a dictionary. Theorem. If R 1 is a partial order on set S 1 and R 2 is a partial order on set S 2 then the lexicographic order is a partial order on the Cartesian product S 1 xS 2. 11

Lexicographic Order If then is a set of n- dimensional binary vectors. The relation establishes a lexicographic order on E 2 n 12

Total (Linear) Order A partial order R on set S is called a total order (or a linear order) on S if every pair of elements in S can be compared, that is Relations “≤” and “≥” are total orders on sets Z of integer numbers and R of real numbers. Relation is not a total order. 13

Minimal and Maximal Elements Let R be a partial order on set S. is called a minimal element of S with respect to R if the only element satisfying y R x is x itself: is called a maximal element of S with respect to R if the only element satisfying x R y is x itself: 14

Minimal and Maximal Elements In the set E 2 n of n-dimensional binary vectors (0,…,0) is a minimal element and (1,…,1) is a maximal element. For n=3: (0,0,0), (0,0,1), (0,1,0), (0,1,1), (1,0,0), (1,0,1), (1,1,0), (1,1,1) 15

Tolerance Relation A relation R on a set S is called a tolerance relation, or simply a tolerance, if the following 2 properties hold for this relation: 1) R is reflexive, that is, x R x is true 2) R is symmetric, that is Thus, a tolerance is not transitive. Example. Let S be the set of all students in some university. Let x R y means that x takes the same class as y. R is a tolerance: it is reflexive, symmetric, but not transitive. 16