1 / 8

Chapter 8 Equivalence Relations

Chapter 8 Equivalence Relations. Let A and B be two sets. A r elation R from A to B is a subset of AXB. That is, R is a set of ordered pairs, where the first coordinate of the pair belongs to A and the second coordinate belongs to B.

gaston
Download Presentation

Chapter 8 Equivalence Relations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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 coordinate of the pair belongs to A and the second coordinate belongs to B. If (a, b)R, then we say that a is related to b by R, and write a R b. If (a, b) R, then a is not related to b by R, and we write a b. Let R be a relation from A to B. The domain of R, denoted by dom R, is the subset of A defined by dom R={a  A: (a, b) R for some b B}; While the range of R, denoted by ran R, is the subset of B defined by ran R={b  B: (a, b) R for some a A};

  2. Relations A relation on a set A is a relation from A to A. That is, a relation on a single set A is a collection of ordered pairs whose first and second coordinates belong to A. Example: Let A={1, 2}. Then AXA={(1, 1), (1, 2), (2, 1), (2, 2)}. Since |AXA|=4, the number of subsets of AXA is 24=16. Consequenctly, there are 16 relations on A.

  3. Properties of Relations A relation R defined on a set A is called reflexive if xRx for every x A. That is, R is reflexive if (x, x) R for every x A. Example. Let S={a, b, c} and determine if the following relations defined on set S are reflexive. R1={(a, b), (b, a), (c, a)} R2={(a, b), (b, b), (b, c), (c, b), (c, c)} R3={(a, a), (a, c), (b, b), (c, a), (c, c)}

  4. Symmetry A relation R defined on a set A is called symmetric if whenever x R y, then y R x for all x, y R. Hence for a relation R on A to be “not symmetric”, there must be some ordered pair (w, z) in R for which (z, w) R. Example. Let S={a, b, c} and determine if the following relations defined on set S are symmetric. R1={(a, b), (b, a), (c, a)} R2={(a, b), (b, b), (b, c), (c, b), (c, c)} R3={(a, a), (a, c), (b, b), (c, a), (c, c)}

  5. Transitivity A relation R defined on a set A is called transitive if whenever x R y and y R z, then x R z for all x, y, z A. Hence for a relation R on A to be “not transitive”, there must exist tow ordered pairs (u, v) and (v, w) in R such that (u, w) R. R1={(a, b), (b, a), (c, a)} R2={(a, b), (b, b), (b, c), (c, b), (c, c)} R3={(a, a), (a, c), (b, b), (c, a), (c, c)}

  6. Equivalence Relations A relation R on a set A is called equivalence relation if R is reflexive, symmetric, and transitive. Example. Let S={a, b, c} and the relation R3={(a, a), (a, c), (b, b), (c, a), (c, c)} defined on the set S. The relation is an equivalence relation.

  7. Example Result: A relation R is defined on Z by x R y if x+3y is even. Then R is an equivalence relation. Proof. First we show that R is reflexive. Let a Z. Then a+3a=2(2a) is even since 2a Z. Therefore a R a and R is reflexive. Next we show that R is symmetric. Assume that a R b. Thus a+3b is even. Hence a+3b=2k for some integer k. So a=2k-3b. Therefore, b+3a=b+3(2k-3b)=2(3k-4b). Since 2k-4b is an integer, b+3a is even. Therefore, b R a and R is symmetric. Finally, we show that R is transitive. Assume that a R b and b R c. Hence a+3b and b+3c are even; so a+3b=2k and b+3c=2l for some integers k and l. Adding these two equations, we have (a+3b)+(b+3c)=2k+2l. So a+3c=2(k+l-2b). Since k+l-2b is an integer, a+3c is even. Hence a R c and so R is transitive. Therefore, R is an equivalence relation. #

  8. Examples Similarly, we can show the following relations are equivalence relations as well. • The relation R defined on Z by x R y if |x|=|y|. • The relation R defined on Z by x R y if |x|=|y|.

More Related