This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2.2 In general, prove that something is an equivalence relation by proving that it is re f exive, symmetric, and transitive. (a) This is an equivalence that effectively splits the integers into odd and even sets. It is re f exive ( x + x is even for any integer x ), symmetric (since x + y = y + x ) and transitive (since you are always adding two odd or even numbers for any satisfactory a , b , and c ). (b) This is not an equivalence. To begin with, it is not re f exive for any integer. (c) This is an equivalence that divides the nonzero rational numbers into positive and negative. It is re f exive since x x > . It is symmetric since x y = y x . It is transitive since any two members of the given class satisfy the relationship. 5...
View
Full
Document
This note was uploaded on 12/27/2011 for the course MAP 2302 taught by Professor Bell,d during the Fall '08 term at UNF.
 Fall '08
 BELL,D

Click to edit the document details