When a rela­tion is defined on a sin­gle set, we can ask use­ful ques­tions about it. Is every ele­ment related to itself? If aa is related to bb, is bb related to aa? If aa is related to bb and bb to cc, is aa related to cc? The answers sort rela­tions into types: reflex­ive, sym­met­ric, tran­si­tive, and the impor­tant com­bi­na­tions called equiv­a­lence rela­tions and par­tial orders. This les­son defines each type and tests real exam­ples.

Through­out, RR is a rela­tion on a non-empty set AA, that is, a rela­tion from AA to AA.

The def­i­n­i­tions

Reflex­ive. RR is reflex­ive if (a,a)∈R(a, a) \in R for every a∈Aa \in A. Every ele­ment is related to itself.

Sym­met­ric. RR is sym­met­ric if (a,b)∈R  ⟹  (b,a)∈R(a, b) \in R \implies (b, a) \in R. Every pair comes with its reverse.

Tran­si­tive. RR is tran­si­tive if (a,b)∈R(a, b) \in R and (b,c)∈R  ⟹  (a,c)∈R(b, c) \in R \implies (a, c) \in R. Two links in a chain imply a direct link.

Equiv­a­lence rela­tion. RR is an equiv­a­lence rela­tion if it is reflex­ive, sym­met­ric and tran­si­tive.

Anti­sym­met­ric. RR is anti­sym­met­ric if (a,b)∈R(a, b) \in R and (b,a)∈R  ⟹  a=b(b, a) \in R \implies a = b. Two dif­fer­ent ele­ments are never related both ways.

Par­tial order. RR is a par­tial order if it is reflex­ive, anti­sym­met­ric and tran­si­tive.

To show that a prop­erty holds, you must check it for every ele­ment or every pair. To show that it fails, one coun­terex­am­ple is enough.

Test­ing finite rela­tions

Exam­ple 1

Let A={2,4,6,8}A = \{2, 4, 6, 8\} and R={(2,4),(4,2),(4,6),(6,4)}R = \{(2, 4), (4, 2), (4, 6), (6, 4)\}. Which prop­er­ties does RR have?

Reflex­ive? 2∈A2 \in A but (2,2)∉R(2, 2) \notin R. So RR is not reflex­ive.

Sym­met­ric? (2,4)∈R(2, 4) \in R and (4,2)∈R(4, 2) \in R; (4,6)∈R(4, 6) \in R and (6,4)∈R(6, 4) \in R. Every pair has its reverse, so RR is sym­met­ric.

Tran­si­tive? (2,4)∈R(2, 4) \in R and (4,2)∈R(4, 2) \in R, but (2,2)∉R(2, 2) \notin R. So RR is not tran­si­tive.

Anti­sym­met­ric? (2,4)∈R(2, 4) \in R and (4,2)∈R(4, 2) \in R, but 2≠42 \neq 4. So RR is not anti­sym­met­ric.

Exam­ple 2

Let A={1,2,3}A = \{1, 2, 3\} and R={(1,1),(1,3),(3,1),(2,2),(2,1),(3,3)}R = \{(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)\}. Is RR reflex­ive, sym­met­ric, tran­si­tive, an equiv­a­lence rela­tion?

Reflex­ive. (1,1)(1, 1), (2,2)(2, 2) and (3,3)(3, 3) are all in RR, so yes.

Sym­met­ric. (2,1)∈R(2, 1) \in R but (1,2)∉R(1, 2) \notin R. So no.

Tran­si­tive. (2,1)∈R(2, 1) \in R and (1,3)∈R(1, 3) \in R, but (2,3)∉R(2, 3) \notin R. So no.

So RR is reflex­ive only, and it is not an equiv­a­lence rela­tion. (Some chains do work, such as (1,1),(1,3)  ⟹  (1,3)(1, 1), (1, 3) \implies (1, 3), but one fail­ing chain is enough.)

Test­ing rela­tions given by a rule

Exam­ple 3

SS is a rela­tion on the set RR of all real num­bers, given by (a,b)∈S  ⟺  ab≥0(a, b) \in S \iff ab \ge 0. Which prop­er­ties does SS have?

Reflex­ive. For every real aa, a⋅a=a2≥0a \cdot a = a^2 \ge 0, so (a,a)∈S(a, a) \in S. Yes.

Sym­met­ric. If ab≥0ab \ge 0 then ba≥0ba \ge 0, since ba=abba = ab. Yes.

Tran­si­tive. Take a=−1a = -1, b=0b = 0, c=2c = 2. Then ab=0≥0ab = 0 \ge 0 and bc=0≥0bc = 0 \ge 0, so (−1,0)∈S(-1, 0) \in S and (0,2)∈S(0, 2) \in S. But ac=−2<0ac = -2 < 0, so (−1,2)∉S(-1, 2) \notin S. Not tran­si­tive.

The num­ber 0 links a neg­a­tive num­ber to a pos­i­tive one, and that breaks the chain.

Exam­ple 4

Let WW be the set of words in an Eng­lish dic­tio­nary, and let R={(x,y):the words x and y have at least one letter in common}R = \{(x, y) : \text{the words } x \text{ and } y \text{ have at least one letter in common}\}. Which prop­er­ties does RR have?

Reflex­ive. Every word shares all its let­ters with itself. Yes.

Sym­met­ric. If xx and yy share a let­ter, then yy and xx share it. Yes.

Tran­si­tive. "cat" and "bat" share the let­ters a and t; "bat" and "bill" share the let­ter b. But "cat" and "bill" have no let­ter in com­mon. Not tran­si­tive.

Exam­ple 5

For real num­bers xx and yy, define xRy  ⟺  x−y+2xRy \iff x - y + \sqrt{2} is an irra­tional num­ber. Which prop­er­ties does RR have?

Reflex­ive. x−x+2=2x - x + \sqrt{2} = \sqrt{2}, which is irra­tional. So (x,x)∈R(x, x) \in R for every xx. Yes.

Sym­met­ric. Take x=2x = \sqrt{2} and y=1y = 1: 2−1+2=22−1\sqrt{2} - 1 + \sqrt{2} = 2\sqrt{2} - 1, which is irra­tional, so (2,1)∈R(\sqrt{2}, 1) \in R. But 1−2+2=11 - \sqrt{2} + \sqrt{2} = 1, which is ratio­nal, so (1,2)∉R(1, \sqrt{2}) \notin R. Not sym­met­ric.

Tran­si­tive. It is tempt­ing to argue that adding two irra­tional num­bers gives an irra­tional num­ber, but that is false: 2\sqrt{2} and −2-\sqrt{2} are irra­tional and their sum is 0. A coun­terex­am­ple: take x=0x = 0, y=22y = 2\sqrt{2}, z=2z = \sqrt{2}.

  • x−y+2=−22+2=−2x - y + \sqrt{2} = -2\sqrt{2} + \sqrt{2} = -\sqrt{2}, irra­tional, so (0,22)∈R(0, 2\sqrt{2}) \in R.
  • y−z+2=22−2+2=22y - z + \sqrt{2} = 2\sqrt{2} - \sqrt{2} + \sqrt{2} = 2\sqrt{2}, irra­tional, so (22,2)∈R(2\sqrt{2}, \sqrt{2}) \in R.
  • x−z+2=−2+2=0x - z + \sqrt{2} = -\sqrt{2} + \sqrt{2} = 0, ratio­nal, so (0,2)∉R(0, \sqrt{2}) \notin R.

So RR is not tran­si­tive. It is reflex­ive, but nei­ther sym­met­ric nor tran­si­tive.

An equiv­a­lence rela­tion

Exam­ple 6

On the set ZZ of inte­gers, define aRb  ⟺  a−baRb \iff a - b is divis­i­ble by 3. Show that RR is an equiv­a­lence rela­tion.

Reflex­ive. a−a=0=3×0a - a = 0 = 3 \times 0, divis­i­ble by 3.

Sym­met­ric. If a−b=3ka - b = 3k, then b−a=3(−k)b - a = 3(-k), also divis­i­ble by 3.

Tran­si­tive. If a−b=3ka - b = 3k and b−c=3mb - c = 3m, then adding, a−c=3(k+m)a - c = 3(k + m), divis­i­ble by 3.

So RR is an equiv­a­lence rela­tion. It sorts the inte­gers into three groups accord­ing to their remain­der on divi­sion by 3: {…,−3,0,3,6,…}\{\ldots, -3, 0, 3, 6, \ldots\}, {…,−2,1,4,7,…}\{\ldots, -2, 1, 4, 7, \ldots\} and {…,−1,2,5,8,…}\{\ldots, -1, 2, 5, 8, \ldots\}. Two inte­gers are related exactly when they are in the same group. Every equiv­a­lence rela­tion splits its set into groups in this way.

A par­tial order

Exam­ple 7

Show that "aa divides bb" is a par­tial order on NN.

Reflex­ive. Every aa divides itself.

Anti­sym­met­ric. If aa divides bb and bb divides aa, then a≤ba \le b and b≤ab \le a (for nat­ural num­bers), so a=ba = b.

Tran­si­tive. If b=kab = ka and c=mbc = mb, then c=(mk)ac = (mk)a, so aa divides cc.

It is not sym­met­ric: 2 divides 6 but 6 does not divide 2. The rela­tion ≤\le on RR is another par­tial order.

Prac­tice

  1. Let A={1,2,3}A = \{1, 2, 3\} and R={(1,1),(2,2),(3,3),(1,2),(2,1)}R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}. Show that RR is an equiv­a­lence rela­tion.
  2. Let A={1,2,3}A = \{1, 2, 3\} and R={(1,2),(2,3),(1,3)}R = \{(1, 2), (2, 3), (1, 3)\}. Which of reflex­ive, sym­met­ric, tran­si­tive, anti­sym­met­ric does RR have?
  3. Let A={1,2,3}A = \{1, 2, 3\} and R={(1,1),(2,2),(3,3),(1,2),(2,3)}R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)\}. Which prop­er­ties does RR have?
  4. On the set of lines in a plane, is "is per­pen­dic­u­lar to" reflex­ive, sym­met­ric, tran­si­tive?
  5. On NN, define aRbaRb if a+ba + b is even. Is RR an equiv­a­lence rela­tion?
  6. On RR, is the rela­tion a<ba < b reflex­ive, sym­met­ric, tran­si­tive?
  7. On RR, define aRbaRb if ∣a−b∣≤1|a - b| \le 1. Which prop­er­ties does RR have?
  8. On ZZ, define aRbaRb if a−ba - b is divis­i­ble by 5. Show that RR is an equiv­a­lence rela­tion, and say how many groups it splits ZZ into.
  9. Write the small­est rela­tion on {1,2,3}\{1, 2, 3\} that con­tains (1,2)(1, 2) and is both reflex­ive and sym­met­ric.
  10. Is the void rela­tion on a non-empty set AA reflex­ive? Is the uni­ver­sal rela­tion A×AA \times A an equiv­a­lence rela­tion?

Answers

Show answers
  1. All (a,a)(a, a) are present, so reflex­ive; the only pairs with dif­fer­ent entries are (1,2)(1, 2) and (2,1)(2, 1), so sym­met­ric; every chain, such as (1,2),(2,1)  ⟹  (1,1)(1, 2), (2, 1) \implies (1, 1), gives a pair in RR, so tran­si­tive.
  2. Not reflex­ive (no (1,1)(1, 1)); not sym­met­ric ((1,2)(1, 2) but no (2,1)(2, 1)); tran­si­tive (the only chain is (1,2),(2,3)(1, 2), (2, 3), and (1,3)∈R(1, 3) \in R); anti­sym­met­ric.
  3. Reflex­ive; not sym­met­ric; not tran­si­tive ((1,2),(2,3)(1, 2), (2, 3) but no (1,3)(1, 3)); anti­sym­met­ric.
  4. Not reflex­ive (no line is per­pen­dic­u­lar to itself); sym­met­ric; not tran­si­tive (if l⊥ml \perp m and m⊥nm \perp n, then ll is par­al­lel to nn, not per­pen­dic­u­lar).
  5. Yes: a+aa + a is even; a+b=b+aa + b = b + a; and if a+ba + b and b+cb + c are even, then a+c=(a+b)+(b+c)−2ba + c = (a + b) + (b + c) - 2b is even.
  6. Not reflex­ive, not sym­met­ric, but tran­si­tive.
  7. Reflex­ive and sym­met­ric, but not tran­si­tive: ∣1−2∣≤1|1 - 2| \le 1 and ∣2−3∣≤1|2 - 3| \le 1, but ∣1−3∣=2|1 - 3| = 2.
  8. Same proof as Exam­ple 6 with 5 in place of 3. It splits ZZ into 5 groups, by remain­der 0, 1, 2, 3, 4.
  9. {(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}
  10. No: the void rela­tion con­tains no (a,a)(a, a). Yes: A×AA \times A con­tains every pair, so it is reflex­ive, sym­met­ric and tran­si­tive.