Relations & Their Properties: Selected Exercises.

Slides:



Advertisements
Similar presentations
Chapter 2 Revision of Mathematical Notations and Techniques
Advertisements

PROOF BY CONTRADICTION
Equivalence Relations
The Engineering Design of Systems: Models and Methods
Relations - review A binary relation on A is a subset of A×A (set of ordered pairs of elements from A) Example: A = {a,b,c,d,e} R = { (a,a),(a,b),(b,b),(b,c),
Basic Properties of Relations
Relations.
Discrete Mathematics Lecture # 16 Inverse of Relations.
Ch. 8: Relations 8.1 Relations and their Properties.
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.
CSE115/ENGR160 Discrete Mathematics 04/24/12 Ming-Hsuan Yang UC Merced 1.
Find all subgroups of the Klein 4- Group. How many are there?
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
Partial Orderings: Selected Exercises
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.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Relations Chapter 9.
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.
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∩
1 Relations and Their Properties Epp, section ??? CS 202 Aaron Bloomfield.
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.
Chapter 4 Relations and Digraphs
1 Relations and Their Properties Rosen, section 7.1 CS/APMA 202 Aaron Bloomfield.
Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
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
CS 103 Discrete Structures Lecture 19 Relations. Chapter 9.
Discrete Mathematics Lecture # 15 Types of Relations (contd.)
Snick  snack Supplement: Worked Set Proofs Based on work by Meghan Allen.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
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.
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
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
Partial Orderings: Selected Exercises
Relations.
Partial Orders.
Relations Chapter 9.
Applied Discrete Mathematics Week 10: Relations
Dr. Ameria Eldosoky Discrete mathematics
Relations: Operations & Properties
Lecture 4.3: Closures and Equivalence Relations
Applied Discrete Mathematics Week 9: Equivalence Relations
CMSC Discrete Structures
IS 2150 / TEL 2810 Information Security & Privacy
Relations and Their Properties
8.1 Relations and Their Properties
PROOF BY CONTRADICTION
Applied Discrete Mathematics Week 5: Boolean Algebra
8.5 Equivalence Relations and 8.6 Partial Ordering
Introduction to Sets.
IS 2150 / TEL 2810 Introduction to Security
Lecture 4.3: Closures and Equivalence Relations
Properties of Relations
9.5 Equivalence Relations
Basics of Relations.
Equivalence Relations: Selected Exercises
IS 2150 / TEL 2810 Introduction to Security
IS 2150 / TEL 2810 Information Security & Privacy
Relations & Their Properties: Selected Exercises
Lecture # 16 Inverse of Relations
4.4 Properties of Relations
Presentation transcript:

Relations & Their Properties: Selected Exercises

2 10 Which relations in Exercise 4 are irreflexive? A relation is irreflexive   a  A (a, a)  R. Ex. 4 relations on the set of all people: a)a is taller than b. b)a and b were born on the same day. c)a has the same first name as b. d)a and b have a common grandparent.

3 20 Must an asymmetric relation be antisymmetric? A relation is asymmetric   a  b ( aRb  (b, a)  R ).

4 20 Must an asymmetric relation be antisymmetric? A relation is asymmetric   a  b ( aRb  (b, a)  R ). To Prove: (  a  b ( aRb  (b, a)  R ) )  (  a  b ( (aRb  bRa )  a = b ) ) Proof: 1.Assume R is asymmetric. 2.  a  b ( ( a, b )  R  ( b, a )  R ). (step 1. and defn of  ) 3.  a  b ( ( aRb  bRa )  a = b ) (Implication’s premise is false.) 4.Therefore, asymmetry implies antisymmetry.

5 20 continued Must an antisymmetric relation be asymmetric? (  a  b ( (aRb  bRa )  a = b ) )   a  b ( aRb  (b, a)  R ) ? Work on this question in pairs.

6 20 continued Must an antisymmetric relation be asymmetric ? (  a  b ( (aRb  bRa )  a = b ) )   a  b ( aRb  (b, a)  R ) ? Proof that the implication is false: 1.Let R = { (a, a) }. 2.R is antisymmetric. 3.R is not asymmetric: aRa  (a, a)  R is false. Antisymmetry thus does not imply asymmetry.

7 30 Let R = { (1, 2), (1, 3), (2, 3), (2, 4), (3, 1) }. Let S = { (2, 1), (3, 1), (3, 2), (4, 2) }. What is S  R? RS S  R

8 40 List the 16 different relations on { 0, 1 }.

9 40 List the 16 different relations on { 0, 1 }. –A relation on {0, 1} is a subset of {0,1} x {0,1}. –{0,1} x {0,1} = { (0,0), (0,1), (1,0), (1,1) }. –There are 2 |{0,1} x {0,1}| = 2 |{0,1}||{0,1}| = 2 2x2 = 2 4 = 16 such subsets. –They are:

10 1.  2.{ (0,0) } 3.{ (0,1) } 4.{ (1,0) } 5.{ (1,1) } 6.{ (0,0), (0,1) } 7.{ (0,0), (1,0) } 8.{ (0,0), (1,1) } 9.{ (0,1), (1,0) } 10.{ (0,1), (1,1) } 11.{ (1,0), (1,1) } 12.{ (0,0), (0,1), (1,0) } 13.{ (0,0), (0,1), (1,1) } 14.{ (0,0), (1,1), (1,0) } 15.{ (1,1), (0,1), (1,0) } 16.{ (0,0), (0,1), (1,0), (1,1) }

11 50 Let R be a relation on set A. Show: R is antisymmetric  R  R -1  { ( a, a ) | a  A }. To prove: 1.R is antisymmetric  R  R -1  { ( a, a ) | a  A } We prove this by contradiction. 2.R  R -1  { ( a, a ) | a  A }  R is antisymmetric. We prove this by contradiction.

12 50 Prove R is antisymmetric  R  R -1  { ( a, a ) | a  A }. We prove this implication by contradiction: 1.Assume R is antisymmetric:  a  b ( ( aRb  bRa )  a = b ). 2.Assume it is not the case that R  R -1  { ( a, a ) | a  A }. 3.  a  b (a, b)  R  R -1, where a  b. (Step 2) 4.Let (a, b)  R  R -1, where a  b. (Step 3) 5.aRb, where a  b. (Step 4) 6.aR -1 b, where a  b. (Step 4) 7.bRa, where a  b. (Step 6 & defn of R -1 ) 8.R is not antisymmetric, contradicting step 1. (Steps 5 & 7) 9.Thus, R is antisymmetric  R  R -1  { ( a, a ) | a  A }.

13 50 continued Prove R  R -1  { ( a, a ) | a  A }  R is antisymmetric. 1.Assume R  R -1  { ( a, a ) | a  A }. 2.Assume R is not antisymmetric: ¬  a  b ( ( aRb  bRa )  a = b ) 3.  a  b ( aRb  bRa  a  b ) (Step 2) 4.bR -1 a, where a  b. (Step 3 & defn. of R -1 ) 5.( b, a )  R  R -1 where a  b, contradicting step 1. (Step 3 & 4) 6.Therefore, R is antisymmetric.