Mathematics. Session Set, Relation & Function Session - 2.

Slides:



Advertisements
Similar presentations
Equivalence Relations
Advertisements

Mathematics.
Chap6 Relations Def 1: Let A and B be sets. A binary relation from A
Discrete Mathematics Lecture # 16 Inverse of Relations.
Mathematics. Matrices and Determinants-1 Session.
Discrete Structures Chapter 5 Relations Nurul Amelina Nasharuddin Multimedia Department.
CSE115/ENGR160 Discrete Mathematics 04/24/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 05/03/11 Ming-Hsuan Yang UC Merced 1.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
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.
Mathematics.
Linear Functions.
Mathematics.
Pre-Assessment Identify the property of equality that justifies the missing steps in solving the equation below.   Equation Steps 23 = 2x – 9 Original.
Algebra I & Concepts Ch. 1 Notes.
Mathematics. Session Vectors -1 Session Objectives  Scalar or Dot Product  Geometrical Interpretation: Projection of a Vector  Properties of Scalar.
Mathematics. Session Functions, Limits and Continuity-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.
Mathematics. Session Set, Relation & Function Session - 3.
Mathematics. Session Three Dimensional Geometry–1(Straight Line)
Sets --- A set is a collection of objects. Sets are denoted by A, B, C, … --- The objects in the set are called the elements of the set. The elements are.
Entry Task ? LT: I can solve equations and problems by writing equations.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Mathematics.
Reflexivity, Symmetry, and Transitivity Lecture 44 Section 10.2 Thu, Apr 7, 2005.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Discrete Mathematics Lecture # 15 Types of Relations (contd.)
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.
Section 1.4 Solving Equations. The Language of algebra provides a way to translate word expressions into mathematical equations 1)Write each equation.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Equivalence Relations
EXAMPLE 2 Plot points in a coordinate plane
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
1 You Never Escape Your… Relations EQUIVALENCE RELATION Presented by K.Senguttuvan, PGT Kendriya Vidyalaya, Gachibowli, Hyderabad. 2.
Copyright © Cengage Learning. All rights reserved. Line and Angle Relationships 1 1 Chapter.
“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.
Yashavantrao Chavan Institute of Science Satara. Rayat Shikshan Sanstha’s Rayat Gurukul CET Project Std : XII Sub : -Mathematics.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
The Relation Induced by a Partition
Citra Noviyasari, S.Si, MT
Chapter 5 Relations and Operations
2.2 Graphs of Equations.
Lecture # 14 Types of Relations
Relations and Digraphs
Dr. Ameria Eldosoky Discrete mathematics
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.
Reflexivity, Symmetry, and Transitivity
Advanced Algorithms Analysis and Design
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 9 Relations Slides are adopted from.
Chapter 2 Sets Homework 3 Given U = { 1, 2, 3, 4, 5, 6, 7, 8, 9 } as a set universe and the sets : A = { 1, 2, 3, 4, 5 }, B = { 4, 5, 6, 7 }, C = { 5,
Mathematics.
8.5 Equivalence Relations
Session – 2 SETS & Operations of SETS
Relations and Their Properties
8.1 Relations and Their Properties
Equivalence Relations
Relations and their Properties
CSE322 Regular Expressions and their Identities
Properties of Equality
9.5 Equivalence Relations
Lesson 1.4 Page 25 Ordered Pairs and Relations.
Advanced Analysis of Algorithms
Straight Lines and Linear Functions
Clements MAΘ October 30th, 2014
Copyright © Cengage Learning. All rights reserved.
Lecture # 16 Inverse of Relations
Presentation transcript:

Mathematics

Session Set, Relation & Function Session - 2

Session Objectives

Class Test

Class Exercise - 1 If A = {1, 2, 3} and B = {3, 8}, then is (a){(3, 1), (3, 2), (3, 3), (3, 8)} (b){(1, 3), (2, 3), (3, 3), (8, 3)} (c){(1, 2), (2, 2), (3, 3), (8, 8)} (d){(8, 3), (8, 2), (8, 1), (8, 8)}

Solution Hence, answer is (b).

Class Exercise - 2 Let A and B be two non-empty sets such that. Then prove that A × B and B × A have n 2 elements in common.

Solution have n 2 elements is common.

Class Exercise - 3 R be a relation on set of natural numbers N defined as. Find the following. (i) R, R –1 as sets of ordered pairs (ii) Domain of R and R –1 (iii) Range of R and R –1 (iv) R –1 oR (v) R –1 in set-builder form

Solution (i) = {(1, 9), (2, 6), (3, 3)} R –1 = {(9, 1), (6, 2), (3, 3)} (ii) Domain (R) = {1, 2, 3} Domain (R –1 ) = {9, 6, 3} (iii)Range (R) = {9, 6, 3} Domain (R –1 ) = {1, 2, 3} (iv){(9, 1), (6, 2), (3, 3)} o {(1, 9), (2, 6), (3, 3)} = {(1, 1), (2, 2), (3, 3)} (v) R –1 = {(a, b) | a + 3b = 12, a, }

Class Exercise - 4 Let R be a relation from A = {2, 3, 4, 5, 6} to B = {3, 6, 8, 9, 12} defined as Express R as set of ordered pairs, find the domain and the range of R, and also find R –1 in set-builder form (where x | y means x divides y).

Solution = {(2, 6), (2, 8), (2, 12), (3, 3), (3, 6), (3, 9), (3, 12), (4, 8), (4, 12), (6, 6), (6, 12)} Domain (R) = {2, 3, 4, 6} Range (R) = {6, 8, 12, 3, 9} R –1 = {(6, 2), (8, 2), (12, 2), (3, 3), (6, 3), (9, 3), (12, 3), (8, 4), (12, 4), (6, 6), (12, 6)} and R –1 x is divisible by y}

Class Exercise - 5 Let R be a relation on Z defined as Express R and R –1 as set of ordered pairs. Hence, find the domain of R and R –1.

Solution R = {(0, 5), (0, –5), (3, 4), (3, –4), (4, 3), (4, –3), (5, 0), (–3, 4), (–3, –4), (–4, 3), (–4, –3), (–5, 0)} R –1 = {(5, 0), (–5, 0), (4, 3), (–4, 3), (3, 4), (–3, 4), (0, 5), (4, –3), (–4, –3), (3, –4), (–3, –4), (0, –5)} = R Domain (R) = Domain (R –1 ) = {0, 3, 4, 5, –3, –4, –5}

Class Exercise - 6 Let S be the set of all the straight lines on a plane, R be a relation on S defined as. Then check R for reflexivity, symmetry and transitivity.

Solution Reflexive: as a line cannot be perpendicular to itself. Symmetric: Let R is symmetric Transitive: Let, i.e.

Class Exercise - 7 Let f = ‘n/m’ means that n is factor of m or n divides m, where. Then the relation ‘f’ is (a) reflexive and symmetric (b) transitive and symmetric (c) reflexive, transitive and symmetric (d) reflexive, transitive and not symmetric

Solution Reflexive: a/a As a is factor of a Reflexive Symmetric: Let i.e. a/b or a is a factor of b

Solution contd.. Transitive: Let, i.e. a is factor of c Hence, answer is (d).

Class Exercise - 8 Let where R is set of reals defined as Check S for reflexive, symmetric and transitive.

Solution Reflexive: Let, i.e. Hence, only for two values of R not Not reflexive Symmetric: If, i.e. a 2 + b 2 = 1

Solution contd.. Transitive: If i.e. a 2 + b 2 = 1 and b 2 + c 2 = 1 may not be 1 Not transitive

Class Exercise - 9 Let A be a set of all the points in space. Let R be a relation on A such that a 1 Ra 2 if distance between the points a 1 and a 2 is less than one unit. Then which of the following is false? (a) R is reflexive (b) R is symmetric (c) R is transitive (d) R is not an equivalence relation

Solution Reflexive: Distance between a 1 and a 1 is 0 less than one unit. Hence, Symmetric: If Distance between is less than 1 unit. Distance between a 2 and a 1 is less than 1 unit. a 2 Ra 1 Symmetric Transitive: If

Solution contd.. Distance between a 1 and a 2 is less than 1 unit and distance between a 2 and a 3 is less than 1 unit Distance between a 1 and a 3 is less than 1 unit. For example, Distance between a 1 and a 3 = 1.8 > 1 Not transitive Hence, R is not an equivalence relation. Hence, answer is (c).

Class Exercise - 10 Let N denote the set of all natural numbers and R be the relation on N × N defined by Show that R is an equivalence relation.

Solution Reflexive: (a, b) R (a, b) As ab(b + a) = ba(a + b) Symmetric: If (a, b) R (c, d)

Solution contd.. Transitive: If (a, b) R (c, d) and (c, d) R (e, f) af(b + e) = be(a + f) (a, b) R (e, f) Hence, R is an equivalence relation.

Thank you