Relations & Their Properties. Copyright © Peter Cappello2 Introduction Let A & B be sets. A binary relation from A to B is a subset of A x B. Let R be.

Slides:

Advertisements

Similar presentations

Representing Relations

Advertisements

Equivalence Relations

CSE115/ENGR160 Discrete Mathematics 04/26/12 Ming-Hsuan Yang UC Merced 1.

Representing Relations Using Matrices

Applied Discrete Mathematics Week 11: Graphs

Ch. 8: Relations 8.1 Relations and their Properties.

November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #27-1 Chapter 27: Lattices Overview Definitions Lattices Examples.

CSE115/ENGR160 Discrete Mathematics 05/03/11 Ming-Hsuan Yang UC Merced 1.

Sets, Relation and Functions A set is a collection of objects (elements) or a container of objects. Defining sets –Empty set (Ø): no elements –Universal.

Discrete Mathematics Lecture#11.

1 Section 7.1 Relations and their properties. 2 Binary relation A binary relation is a set of ordered pairs that expresses a relationship between elements.

Relations Chapter 9.

Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.

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.

Relation. Relations Recall the definition of the Cartesian (Cross) Product: The Cartesian Product of sets A and B, A x B, is the set A x B = { : x  A.

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∩

Relations (1) Rosen 6 th ed., ch. 8. Binary Relations Let A, B be any two sets. A binary relation R from A to B, written (with signature) R:A↔B, is a.

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 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.

Unit Unit 04 Relations IT DisiciplineITD1111 Discrete Mathematics & Statistics STDTLP1 Unit 4 Relations.

CHAPTER (6) RELATIONS. RELATIONS : - Let A and B be sets. A binary relation from A to B is subset of A* B …

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.

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

Lecture 4.3: Closures and Equivalence Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.

Relations & Their Properties: Selected Exercises.

Relations & Their Properties: Selected Exercises.

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 ???

Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.

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. L222 Agenda –Relations 7.3 Representing Relations As subsets of Cartesian products Column/line diagrams Boolean matrix Digraph Operations on.

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.

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.

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

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), (

1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.

Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.

Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.

Discrete Mathematical

Relations and Their Properties

Citra Noviyasari, S.Si, MT

Formal Language & Automata Theory

CSE15 Discrete Mathematics 05/03/17

Lecture 4.3: Closures and Equivalence Relations

Applied Discrete Mathematics Week 9: Equivalence Relations

8.5 Equivalence Relations

Relations and Their Properties

8.1 Relations and Their Properties

8.1 Relations and Their Properties

Applied Discrete Mathematics Week 5: Boolean Algebra

8.5 Equivalence Relations and 8.6 Partial Ordering

IS 2150 / TEL 2810 Introduction to Security

Lecture 4.3: Closures and Equivalence Relations

Relations and their Properties

MCS680: Foundations Of Computer Science

Discrete Math (2) Haiming Chen Associate Professor, PhD

9.5 Equivalence Relations

Equivalence relations

Basics of Relations.

Equivalence Relations: Selected Exercises

IS 2150 / TEL 2810 Introduction to Security

Relations & Their Properties: Selected Exercises

Presentation transcript:

Relations & Their Properties

Copyright © Peter Cappello2 Introduction Let A & B be sets. A binary relation from A to B is a subset of A x B. Let R be a relation. If ( a, b )  R, we write a R b. Example: –Let S be a set of students. –Let C be a set of courses. –Let R = { (s, c) | student s is taking course c}. Many students may take the same course. A single student may take many courses.

Copyright © Peter Cappello3 Functions as Relations Functions are a kind of relation. –Let function f : A  B. –If f( a ) = b, we could write ( a, b )  f  A x B. –P( A x B ) = the set of all relations from A to B. –Let F = the set of all functions from A to B. –F is a proper subset of P( A x B ). F P( A x B )

Copyright © Peter Cappello4 Relations on a Set A relation on a set A is a relation from A to A. Examples of relations on R: –R 1 = { (a, b) | a  b }. –R 2 = { (a, b) | b = +sqrt( a ) }. –Are R 1 & R 2 functions?

Copyright © Peter Cappello5 Properties of Relations A relation R on A is: Reflexive:  a ( aRa ). Are either R 1 or R 2 reflexive? Symmetric:  a  b ( aRb  bRa ). –Let S be a set of people. –Let R & T be relations on S, R = { (a, b) | a is a sibling of b }. T = { (a, b) | a is a brother of b }. Is R symmetric? Is T symmetric?

Copyright © Peter Cappello6 Antisymmetric: 1.  a  b ( ( aRb  bRa )  ( a = b ) ). 2.  a  b ( ( a  b )  ( ( a, b )  R  ( b, a )  R ) ). Example: L = { ( a, b ) | a  b }. Can a relation be symmetric & antisymmetric? Transitive:  a  b  c ( ( aRb  bRc )  aRc ). Are any of the previous examples transitive?

Copyright © Peter Cappello7 Composition Let R be a relation from A to B. Let S be a relation from B to C. The composition is S  R = { ( a, c ) |  b ( aRb  bSc ) }. Let R be a relation on A. R 1 = R R n = R n-1  R. Let R = { (1, 1), (2, 1), (3, 2), (4, 3) }. What is R 2, R 3 ?

Copyright © Peter Cappello8 End 8.1

Copyright © Peter Cappello Graph a Relation from A to B The word graph above is used as a verb. Let A = { 1, 2, 3 } and B = { 2, 3, 4 }. Let R be a relation from A to B where { (a, b) | a divides b }. 123 A B