Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Slides:



Advertisements
Similar presentations
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Advertisements

Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Discrete Structures Chapter 5 Relations and Functions Nurul Amelina Nasharuddin Multimedia Department.
Analytical Methods in CS (CIS 505)
Sets. Copyright © Peter Cappello Definition Visualize a dictionary as a directed graph. Nodes represent words If word w is defined in terms of word.
Discrete Mathematics Lecture#11.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
(CSC 102) Lecture 15 Discrete Structures. Previous Lectures Summary  Procedural Versions  Properties of Sets  Empty Set Properties  Difference Properties.
Fall 2015 COMP 2300 Discrete Structures for Computation
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Unit Unit 04 Relations IT DisiciplineITD1111 Discrete Mathematics & Statistics STDTLP1 Unit 4 Relations.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
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.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
Discrete Mathematics Relation.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Mathematics for Business and Economics - I
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Sets Goal: Introduce the basic terminology of set theory.
CSNB143 – Discrete Structure Topic 1 - Set. Topic 1 - Sets Learning Outcomes – Student should be able to identify sets and its important components. –
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
1.1 Functions This section deals with the topic of functions, one of the most important topics in all of mathematics. Let’s discuss the idea of the Cartesian.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
Spring 2016 COMP 2300 Discrete Structures for Computation
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
1 1 Devon M. Simmonds University of North Carolina, Wilmington CSC133 Discrete Mathematical Structures TIME: Tuesday/Thursday 9:30 – 10:45am in Office.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 0 Introduction Some slides are in courtesy of Prof.
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.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Discrete Mathematics Lecture # 17 Function. Relations and Functions  A function F from a set X to a set Y is a relation from X to Y that satisfies the.
Relations and Functions.  Ordered Pair- A pair of coordinates, written in the form (x,y), used to locate any point on a coordinate plane.  Cartesian.
Sets.
Relations on Sets A binary relation is a subset of a Cartesian product of two sets. The notation for a relation R may be written symbolically as follows:
Relations and Functions
Set, Combinatorics, Probability & Number Theory
Discrete Mathematics Lecture#14.
Discrete Structure II: Introduction
Chapter 2.4/2.6 Notes: Multiplying and Dividing Real Numbers
Algebra 1 Section 1.1.
CS2210 Discrete Structures Relations
Copyright © Cengage Learning. All rights reserved.
Relations and their Properties
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
ICOM 5016 – Introduction to Database Systems
Chapter 1: Linear Functions, Equations, and Inequalities
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
ICOM 5016 – Introduction to Database Systems
Presentation transcript:

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 8.1 Relations

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Relation (from Chap 1.3) Let A and B be sets. A relation R from A to B is a subset. Given an ordered pair, x is related to y by R, written if and only if. The set A is called the domain of R and the set B is called its co- domain. Ex. 2

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Less-than Relation for Real Numbers Define a relation L from R to R as follows: For all real numbers x and y, a.Is b.Is c.Is d.Is 3

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Less-than Relation for Real Numbers Define a relation L from R to R as follows: For all real numbers x and y, a.Is No, since 57 > 53. b.Is Yes, since -17 < -14. c.Is No, since 143 = 143. d.Is Yes, since -35 < 1. 4

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Less-than Relation for Real Numbers Define a relation L from R to R as follows: For all real numbers x and y, e.Draw the graph of L as a subset of the Cartesian plane 5

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Less-than Relation for Real Numbers Define a relation L from R to R as follows: For all real numbers x and y, e.Draw the graph of L as a subset of the Cartesian plane A: For each value of x, all the points ( x, y ) with y>x are on the graph. So the graph consists of all the points above the line x = y. 6

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University A Relation on a Power Set Let X ={ a, b, c }. Then, Define a relation S from P(X) to Z as follows: For all sets A and B in P(X) (i.e., for all subsets A and B of X ), a.Is b.Is c.Is d.Is 7

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University A Relation on a Power Set Let X ={ a, b, c }. Then, Define a relation S from P(X) to Z as follows: For all sets A and B in P(X) (i.e., for all subsets A and B of X ), a.Is Yes, both sets have two elements. b.Is Yes, has one element and has zero elements, and c.Is No, { b, c } has two elements and { a, b, c } has three elements and 2 < 3. d.Is Yes, both sets have one element. 8

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University The Inverse of a Relation Let R be a relation from A to B. Define the inverse relation from B to A as follows: The definition can be written operationally as follows: 9

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University The Inverse of a Finite Relation Let A = {2, 3, 4} and B = {2, 6, 8} and let R be the “divides” relation from A to B : For all a.State explicitly which ordered pairs are in and, and draw arrow diagrams for and. b.Describe in words. 10

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University The Inverse of a Finite Relation Let A = {2, 3, 4} and B = {2, 6, 8} and let R be the “divides” relation from A to B : For all a.State explicitly which ordered pairs are in and, and draw arrow diagrams for and

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University The Inverse of a Finite Relation Let A = {2, 3, 4} and B = {2, 6, 8} and let R be the “divides” relation from A to B : For all b.Describe in words. For all, 12

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University The Inverse of an Infinite Relation Define a relation R from R to R as follows: For all Draw the graphs of and in the Cartesian plane. Is a function? 13

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Directed Graph of Relation A relation on a set A is a relation from A to A. Let A = {3, 4, 5, 6, 7, 8} and define a relation R on A as follows: For all 14

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University n -ary Relation A more formal way to refer to the kind of relation defined in Section 1.3 is to call it a binary relation because it is a subset of a Cartesian product of two sets. An n -ary relation to be a subset of a Cartesian product of n sets, where n is any integer grater than or equal to two. 15

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University n -ary Relation A more formal way to refer to the kind of relation defined in Section 1.3 is to call it a binary relation because it is a subset of a Cartesian product of two sets. Roughly, an n -ary relation to be a subset of a Cartesian product of n sets, where n is any integer greater than or equal to two. 16

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University n -ary Relations and Relational Databases Given sets, an n -ary relation R on is a subset of. The special cases of 2-ary, 3-ary, and 4-ary relations are called binary, ternary, and quaternary relations, respectively. Example: Patient Database at a Hospital (Patient_ID, Patient_Name, Admission_Date, Diagnosis) (011985, John Schmidt, , asthema) (574329, Tak Kurosawa, , penumonia) 17