Book of Proof - Amazon S3
Book of Proof - Amazon S3
Book of Proof - Amazon S3
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Properties <strong>of</strong> Relations 181<br />
4. Let A = { a, b, c, d } . Suppose R is the relation<br />
R = { (a, a),(b, b),(c, c),(d, d),(a, b),(b, a),(a, c),(c, a),<br />
(a, d),(d, a),(b, c),(c, b),(b, d),(d, b),(c, d),(d, c) } .<br />
Is R reflexive? Symmetric? Transitive? If a property does not hold, say why.<br />
5. Consider the relation R = { (0,0),( 2,0),(0, 2),( 2, 2) } on R. Is R reflexive?<br />
Symmetric? Transitive? If a property does not hold, say why.<br />
6. Consider the relation R = { (x, x) : x ∈ Z } on Z. Is R reflexive? Symmetric?<br />
Transitive? If a property does not hold, say why. What familiar relation is<br />
this?<br />
7. There are 16 possible different relations R on the set A = { a, b } . Describe all <strong>of</strong><br />
them. (A picture for each one will suffice, but don’t forget to label the nodes.)<br />
Which ones are reflexive? Symmetric? Transitive?<br />
8. Define a relation on Z as xR y if |x−y| < 1. Is R reflexive? Symmetric? Transitive?<br />
If a property does not hold, say why. What familiar relation is this?<br />
9. Define a relation on Z by declaring xR y if and only if x and y have the same<br />
parity. Is R reflexive? Symmetric? Transitive? If a property does not hold, say<br />
why. What familiar relation is this?<br />
10. Suppose A ≠ . Since ⊆ A × A, the set R = is a relation on A. Is R reflexive?<br />
Symmetric? Transitive? If a property does not hold, say why.<br />
11. Suppose A = { a, b, c, d } and R = { (a, a),(b, b),(c, c),(d, d) } . Is R reflexive? Symmetric?<br />
Transitive? If a property does not hold, say why.<br />
12. Prove that the relation | (divides) on the set Z is reflexive and transitive. (Use<br />
Example 11.8 as a guide if you are unsure <strong>of</strong> how to proceed.)<br />
13. Consider the relation R = { (x, y) ∈ R × R : x − y ∈ Z } on R. Prove that this relation<br />
is reflexive, symmetric and transitive.<br />
14. Suppose R is a symmetric and transitive relation on a set A, and there is an<br />
element a ∈ A for which aRx for every x ∈ A. Prove that R is reflexive.<br />
15. Prove or disprove: If a relation is symmetric and transitive, then it is also<br />
reflexive.<br />
16. Define a relation R on Z by declaring that xR y if and only if x 2 ≡ y 2 (mod 4).<br />
Prove that R is reflexive, symmetric and transitive.<br />
17. Modifying the above Exercise 8 (above) slightly, define a relation ∼ on Z as x ∼ y<br />
if and only if |x− y| ≤ 1. Say whether ∼ is reflexive. Is it symmetric? Transitive?<br />
18. The table on page 177 shows that relations on Z may obey various combinations<br />
<strong>of</strong> the reflexive, symmetric and transitive properties. In all, there are 2 3 =<br />
8 possible combinations, and the table shows 5 <strong>of</strong> them. (There is some<br />
redundancy, as ≤ and | have the same type.) Complete the table by finding<br />
examples <strong>of</strong> relations on Z for the three missing combinations.