CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.

Slides:



Advertisements
Similar presentations
Representing Relations
Advertisements

CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
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. Consider the following relations on A={1,2,3,4} Consider the matrixM R1 = | | | | | | | |
CSE 20 Discrete math Prof. Shachar Lovett
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
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.
Discrete Structures Chapter 5 Relations Nurul Amelina Nasharuddin Multimedia Department.
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.
Discussion #26 Chapter 5, Sections /15 Discussion #26 Binary Relations: Operations & Properties.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Unit Unit 04 Relations IT DisiciplineITD1111 Discrete Mathematics & Statistics STDTLP1 Unit 4 Relations.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
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.
3.1 Symmetry; Graphing Key Equations. Symmetry A graph is said to be symmetric with respect to the x-axis if for every point (x,y) on the graph, the point.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Properties and Mental Computation p. 80. Math talk What are some math properties that we use? Why do you think we have them? Do you ever use them?
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
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
CS 103 Discrete Structures Lecture 19 Relations. Chapter 9.
Discrete Structures – CNS2300
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
MAT 2720 Discrete Mathematics Section 3.3 Relations
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
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Lecture 7: Relations Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE115/ENGR160 Discrete Mathematics 04/28/11
MATH 15A – Discrete Mathematics
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Properties of Functions
Equivalence Relations
CSE 321 Discrete Structures
CSE 321 Discrete Structures
Discrete Math (2) Haiming Chen Associate Professor, PhD
Discrete Math (2) Haiming Chen Associate Professor, PhD
Chapter 8 (Part 2): Relations
Ø Let the universe set U={1,2,3,...,10}.
Presentation transcript:

CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA

Todays topics Relations Section 6.1 in Jenkyns, Stephenson

(Binary) Relations

Relations are graphs Think of relations as directed graphs U=nodes of graphs xRy means “there in an edge x  y” Is A. R ? B. R ? C. Both D. Neither

Relations are graphs What does this relation captures? xRy means A. x>y B. x=y C. x divides y D. x+y E. None/more than one

Three important properties of relations

Symmetric relations

Types of relations

Test your understanding

Let U=“all Boolean formulas on n inputs” xRy = “x and y compute the same Boolean function” Is R symmetric / reflexive / transitive? A. Yes,Yes,Yes B. No,No,No C. Yes,Yes,No D. No,No,Yes E. Other

Next class Equivalence relations Read section 6.2 in Jenkyns, Stephenson