Relations - Exercises.

Slides:



Advertisements
Similar presentations
Representing Relations
Advertisements

Discrete Mathematics 3. MATRICES, RELATIONS, AND FUNCTIONS Lecture 5 Dr.-Ing. Erwin Sitompul
Equivalence Relations
Equivalence Relations
Composition of functions constructing a function from 2 functions (g o f) = g[f(x)] –for all x in domain of f such that f(x) is in domain of g –f is applied.
Relations Relations on a Set. Properties of Relations.
Domain Restriction on Relation domain restriction operator,, restricts a relation to only those members whose domain is in a specified set. domain restriction.
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.
Form a Composite Functions and its Domain
Chapter 3 Relations. Section 3.1 Relations and Digraphs.
Factors, Prime, Composite Greatest Common Factor Simplifying Fractions
Basic Properties of Relations
Discrete Mathematics Lecture # 16 Inverse of Relations.
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.
Congruence of Integers
Discussion #26 Chapter 5, Sections /15 Discussion #26 Binary Relations: Operations & Properties.
Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.
 The factorial function (n!)  Permutations  Combinations.
Inverse Functions MATH Precalculus S. Rook.
Functions MATH Precalculus S. Rook. Overview Section 1.4 in the textbook: – Relations & Functions – Functional notation – Identifying functions.
Lecture 14 Relations CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
MATH 3581 — College Geometry — Spring 2010 — Solutions to Homework Assignment # 3 B E A C F D.
1 Determine if the following are functions no yes.
Digraphs and Relations Warm Up. The Divisibility Relation Let “|” be the binary relation on N×N such that a|b (“a divides b”) iff there is an n ∈ N such.
2.5 Proving Statements and Segments. Properties of Segment Congruence Segment congruence is reflexive, symmetric, and transitive. Reflexive: For any segment.
Discrete Mathematics Relation.
7-6 Function Operations Objective 2.01
MAT 2720 Discrete Mathematics Section 3.1 Functions
Mathematical Preliminaries
Sets and Subsets Set A set is a collection of well-defined objects (elements/members). The elements of the set are said to belong to (or be contained in)
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Factors, Prime, Composite Greatest Common Factor Simplifying Fractions
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 Relations and Their Properties
Mathematics. Session Set, Relation & Function Session - 2.
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), (
Discrete Mathematics 3. MATRICES, RELATIONS, AND FUNCTIONS Lecture 6 Dr.-Ing. Erwin Sitompul
§R1∪R2§R1∪R2 §R 1 ∩R 2 R1-R2R1-R2 2.4 Operations on Relations.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
“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.
The graph is neither Eulerian or Semi – Eulerian as it has 4 ODD vertices.
Jeopardy Factors, Prime, Composite Prime Factorization Greatest Common Factor Simplifying Fractions Least Common Multiple
Agenda Review:  Relation Properties Lecture Content:  Divisor and Prime Number  Binary, Octal, Hexadecimal Review & Exercise.
Objectives Develop and apply the formula for midpoint.
TOPIC 20.2 Composite and Inverse Functions
Relations.
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.
Finding the Inverse of a Function Algebraically
CSE 321 Review Session Dave Bacon.
CSNB 143 Discrete Mathematical Structures
Chapter 3 Relation and Function Homework 4 For each of the following relations on set A = { 1,2,3,4 }, check each of them whether they are reflexive, irreflexive,
Introduction to Functions
Relations and Their Properties
Equivalence Relations
8.1 Relations and Their Properties
Relations.
Introduction to Relations and Functions
Composition OF Functions.
Composition OF Functions.
CSE 321 Discrete Structures
{(1, 1), (2, 4), (3, 9), (4, 16)} one-to-one
Equivalence Relations
Functions-Exercises.
Combinations of Functions
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Objectives The student will be able to:
Agenda Lecture Content: Relations (Relasi)
Ø Let the universe set U={1,2,3,...,10}.
Presentation transcript:

Relations - Exercises

In the exercises below take X = { a, b, c, d } Y = { e, f, g } Z = { h, i } In addition, suppose R  X  Y & R = { (a,e), (a,f), (b,f), (b,g), (c,e) } S  X  Z & S = { (a,h), (b,h), (c,h), (d,h), (d,i) } T  Y  Z & T = { (e,h), (e,I), (g,h) } U  Z  Z & U = { (h, I) } 1. Evaluate a. dom R b. ran R c. dom S d. ran S e. dom T f. ran T g. R~ h. S~ i. T~ j. U~ 2. Evaluate a. R ; T b. T ; R c. S ; T~ d. R ; R~ e. (R ; S) ; T~ f. R ; (S ; T~) 3. Evaluate a. R  S b. S  R

Exercises 4. In a simple banking system you will have a set of pairs AccBalances = { (123,56.78), (145,123.00), … } CurrOver = { (222,200), (234,500) … } SavingAccs { (Bill,123), (Lisa,145), (Harry,156), (Sue,159), (Eve, 154) } S  X  Z & S = { (a,h), (b,h), (c,h), (d,h), (d,i) } T  Y  Z & T = { (e,h), (e,I), (g,h) } a. Write down the type of each of these sets, that is, the sets that each of these are subsets of. b. Would it make any sense to perform the following operations on these sets, or combinations of these sets? Inverse Override Composition c. Evaluate (i) SavingAccs~ (ii) SavingsAccs ; AccBalances

In the exercises below take R = { (0,0), (1,1), (1,2), (2,2), (0,2) } 5. Produce a digraph for each relation. 6. Decide whether each of the relations on { 0, 1, 2 } is reflexive, symmetric, transitive or a combination of these and which are equivalence relations.

Problems Let A = {1,2,3,4,5,6}. Construct the relation R on A for the following cases. a) R = {(j,k) | j divides k} b) R = {(j,k) | j is a multiple of k} c) R = {(j,k) | (j – k)2 Î A} d) R = {(j,k) | j/k is a prime} 2. Let R be the relation from A = {1,2,3,4,5} to B = {1,3,5} which is defined by “ x is less than y.” Write R as a set of ordered pairs. 3. Let R be the relation in the natural numbers N = {1,2,3,…..} defined by “x + 2y =10”, that is ,let R = {(x,y) | x Î N, y Î N, x + 2y = 10}. Find a) the domain and range of R b) R-1

4. Prove R is an equivalence relation 4. Prove R is an equivalence relation. Let N be the set of natural numbers, that is, N = {1,2,3……..}. Define a relation R in N as follows: R = {(x,y)| x,y Î N and x + y is even}.