Relations & Their Properties: Selected Exercises.

Slides:



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

PROOF BY CONTRADICTION
To prove by induction that 2 n ≥ n 2 for n ≥ 4, n  N Next (c) Project Maths Development Team 2011.
The Growth of Functions: Selected Exercises
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.
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.
Equivalence Relations: Selected Exercises
Partial Orderings: Selected Exercises
Discrete Mathematics Lecture#11.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
Proof Methods & Strategy
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.
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∩
Copyright © Peter Cappello Mathematical Induction Goals Explain & illustrate construction of proofs of a variety of theorems using mathematical induction.
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
Geometry 6.3 Indirect Proof.
Copyright © Zeph Grunschlag, Relations Zeph Grunschlag.
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
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.
Linear Algebra Chapter 2 Matrices.
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
Aids to Formulating and Answering Key Questions NameWhen to use u Construction Methodproving “there exists” u Choose Method proving “for every” u Math.
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.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Equivalence Relations: Selected Exercises
Discrete Mathematical
Citra Noviyasari, S.Si, MT
The Growth of Functions: Selected Exercises
Partial Orderings: Selected Exercises
Relations.
Relations Chapter 9.
Applied Discrete Mathematics Week 10: Relations
Dr. Ameria Eldosoky Discrete mathematics
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
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
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

Copyright © Peter Cappello2 Exercise 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.

Copyright © Peter Cappello3 Exercise 20 Must an asymmetric relation be antisymmetric? A relation is asymmetric   a  b ( aRb  (b, a)  R ).

Copyright © Peter Cappello4 Exercise 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. & defn of  ) 3.  a  b ( ( aRb  bRa )  a = b ) (implication premise is false.) 4.Therefore, asymmetry implies antisymmetry.

Copyright © Peter Cappello5 Exercise 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.

Copyright © Peter Cappello6 Exercise 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.

Copyright © Peter Cappello7 Exercise 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

Copyright © Peter Cappello8 Exercise 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.

Copyright © Peter Cappello9 Exercise 50 Prove R is antisymmetric  R  R -1  { ( a, a ) | a  A }. 1.Proceeding by contradiction, we assume that: 1.R is antisymmetric:  a  b ( ( aRb  bRa )  a = b ). 2.It is not the case that R  R -1  { ( a, a ) | a  A }. 2.  a  b (a, b)  R  R -1, where a  b. (Step 1.2) 3.Let (a, b)  R  R -1, where a  b. (Step 2) 4.aRb, where a  b. (Step 3) 5.aR -1 b, where a  b. (Step 3) 6.bRa, where a  b. (Step 5 & defn of R -1 ) 7.R is not antisymmetric, contradicting step 1. (Steps 4 & 6) 8.Thus, R is antisymmetric  R  R -1  { ( a, a ) | a  A }.

Copyright © Peter Cappello10 Exercise 50 continued Prove R  R -1  { ( a, a ) | a  A }  R is antisymmetric. 1. Proceeding by contradiction, we assume that: 1.R  R -1  { ( a, a ) | a  A }. 2.R is not antisymmetric: ¬  a  b ( ( aRb  bRa )  a = b ) 2. Assume  a  b ( aRb  bRa  a  b ) (Step 1.2) 3.bR -1 a, where a  b. (Step 2s & defn. of R -1 ) 4.( b, a )  R  R -1 where a  b, contradicting step 1. (Step 2 & 3) 5.Therefore, R is antisymmetric.