Relations & Their Properties: Selected Exercises

Slides:



Advertisements
Similar presentations
PROOF BY CONTRADICTION
Advertisements

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
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.
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.
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.
Proof Methods & Strategy
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
Copyright © Peter Cappello Mathematical Induction Goals Explain & illustrate construction of proofs of a variety of theorems using mathematical induction.
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.
Inclusion-Exclusion Selected Exercises Powerpoint Presentation taken from Peter Cappello’s webpage
9.4 Mathematical Induction
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
P. 270 #47-49.
Relations & Their Properties: Selected Exercises.
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.
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
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
11.7 – Proof by Mathematical Induction
Partial Orderings: Selected Exercises
Relations.
Relations and Their Properties
Lecture # 14 Types of Relations
Dr. Ameria Eldosoky Discrete mathematics
Relations and Their Properties
Applied Discrete Mathematics Week 9: Equivalence Relations
IS 2150 / TEL 2810 Information Security & Privacy
Proof That There Is No Smallest Number
8.5 Equivalence Relations
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.
Xuan Guo Lab 4 Xuan Guo
IS 2150 / TEL 2810 Introduction to Security
The Derivative of an Inverse Function
9.5 Equivalence Relations
Combining relations via relational composition
Basics of Relations.
Equivalence Relations: Selected Exercises
Chapter 5 Parallel Lines and Related Figures
5.1 Indirect Proof Let’s take a Given: Prove: Proof: Either or
IS 2150 / TEL 2810 Introduction to Security
THE WELL ORDERING PROPERTY
IS 2150 / TEL 2810 Information Security & Privacy
Introduction to Proofs
Lecture # 16 Inverse of Relations
4.4 Properties of Relations
Presentation transcript:

Relations & Their Properties: Selected Exercises

Copyright © Peter Cappello 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 is taller than b. a and b were born on the same day. a has the same first name as b. a and b have a common grandparent. Copyright © Peter Cappello

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

Copyright © Peter Cappello 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: Assume R is asymmetric. a  b ( ( a, b )  R  ( b, a )  R ). (step 1. & defn of  ) a  b ( ( aRb  bRa )  a = b ) (implication premise is false.) Therefore, asymmetry implies antisymmetry. Copyright © Peter Cappello

Copyright © Peter Cappello 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 Cappello

Copyright © Peter Cappello 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: Let R = { (a, a) }. R is antisymmetric. R is not asymmetric: aRa  (a, a)  R is false. Antisymmetry thus does not imply asymmetry. Copyright © Peter Cappello

Copyright © Peter Cappello 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? 1 2 3 4 R S S  R Copyright © Peter Cappello

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

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

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