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.

Slides:



Advertisements
Similar presentations
Representing Relations
Advertisements

Representing Relations Rosen 7.3. Using Matrices For finite sets we can use zero-one matrices. Elements of each set A and B must be listed in some particular.
CSE115/ENGR160 Discrete Mathematics 04/26/12 Ming-Hsuan Yang UC Merced 1.
8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
1 Section 7.3 Representing relations (part 1: matrices)
Which augmented matrix represents the following system of equations?
Discussion #27 Chapter 5, Sections /15 Discussion #27 Closures & Equivalence Relations.
Basic Properties of Relations
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Maths for Computer Graphics
Discrete Structures Chapter 5 Relations Nurul Amelina Nasharuddin Multimedia Department.
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.
Relations binary relations xRy on sets x  X y  Y R  X  Y Example: “less than” relation from A={0,1,2} to B={1,2,3} use traditional notation 0 < 1,
Discussion #26 Chapter 5, Sections /15 Discussion #26 Binary Relations: Operations & Properties.
Equivalence Relations: Selected Exercises
Discrete Mathematics Lecture#11.
Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.
Equivalence Relations MSU CSE 260. Outline Introduction Equivalence Relations –Definition, Examples Equivalence Classes –Definition Equivalence Classes.
Properties of Relations In many applications to computer science and applied mathematics, we deal with relations on a set A rather than relations from.
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.
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.
R. Johnsonbaugh, Discrete Mathematics 5 th edition, 2001 Chapter 2 The Language of Mathematics.
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.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Math Chapter 6 Part II. POWER SETS In mathematics, given a set S, the power set of S, written P(S) or 2 n(S), is the set of all subsets of S. Remember.
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Relations.
Discrete Mathematics Relation.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
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
Equivalence Relations. Partial Ordering Relations 1.
1 Discrete and Combinatorial Mathematics R. P. Grimaldi, 5 th edition, 2004 Chapter 5 Relations and Functions.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Representing Relations Using Matrices A relation between finite sets can be represented using a zero-one matrix Suppose R is a relation from A = {a 1,
Chapter Relations and Their Properties
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Relations Section 9.1, 9.3—9.5 of Rosen Spring 2012
Equivalence Relations
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.
ORDERED SETS. RELATIONS COSC-1321 Discrete Structures 1.
Relations Compare with function – Function: Set of ordered pairs where x’s don’t repeat x’s come from domain; y’s come from co-domain Purpose: to transform.
Chap. 7 Relations: The Second Time Around
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.
Section 9.3. Section Summary Representing Relations using Matrices Representing Relations using Digraphs.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Introduction Types of Matrices Operations
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.
Relations and Their Properties
Introduction to Relations
Relations Chapter 9.
Representing Relations
Introductory Material
Equivalence Relations
Mathematical Background 1
RECORD. RECORD COLLABORATE: Discuss: Is the statement below correct? Try a 2x2 example.
Mathematical Background 1
CSE 321 Discrete Structures
Agenda Lecture Content: Relations (Relasi)
Introductory Material
Ø Let the universe set U={1,2,3,...,10}.
Presentation transcript:

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 row x and column y whenever xRy (if (x, y) is in R) and otherwise has a 0 in row x, column y.

Example X = {1, 2, 3, 4, 5}, R is a binary relation on X defined by xRy if x mod 3 = y mod

Symmetric, Reflexive, Antisymmetric A relation R on X is symmetric if its matrix is symmetric – in other words, if whenever (x,y) is in R, (y,x) is in R. A relation R on X is antisymmetric if whenever (x,y) is in R and x ≠ y, (y,x) is not in R. A relation R on X is reflexive if xRx for all elements x of X.

Examples of Antisymmetric Relations xRy if x < y xRy if x is a subset of y xRy if step x has to happen before step y In the matrix of an antisymmeric relation, if there is a 1 in position i,j then there is a 0 in position j,i

Transitive A relation is transitive if whenever xRy and yRz, it is also true that xRz. Examples: xRy if x=y xRy if x<y xRy if step x must occur before step y

Partial Order A relation that is reflexive, antisymmetric and transitive is a partial order. Examples: xRy if x<y xRy if step x must occur before step y

Matrix of a Partial Order Example – using a camera When the elements of X are put in order, the matrix of a relation that is a partial order looks upper triangular

The matrix of a transitive relation If M is the matrix of a transitive relation, then the matrix MxM has no more zeros than matrix M x =

Equivalence Relation A relation R on X is an equivalence relation if it is symmetric, transitive and reflexive. An equivalence relation groups the elements of X into disjoint subsets S i where xRy if x and y are in the same subset S i. The set of all these subsets is a partition of X.

Matrix of an equivalence relation If the elements of X are ordered correctly, the matrix of an equivalence relation looks like a collection of squares of 1’s