• Foundation
  • About 14 min
  • 5 practice questions

Showing a relation: arrow diagrams, tables and the inverse relation

Write a relation from a rule as a set of pairs, show it with an arrow diagram or a table, and form the inverse relation by reversing every pair.

If something looks wrong, please tell us.

A relation is just a set of ordered pairs, but a list of pairs is not always the easiest way to see what is going on. Mathematicians show relations in several ways: as a list, as an arrow diagram, or as a table. This lesson shows how to move between them and introduces the inverse of a relation, which simply reads every pair backwards.

Three ways to show the same relation

Let A = {1, 2, 3} and B = {2, 4, 6, 8}, and let R be the relation 'b is twice a'. As a list of pairs, R = {(1, 2), (2, 4), (3, 6)}. In an arrow diagram we draw the two sets as two ovals and an arrow from each a to each b related to it: 1 → 2, 2 → 4, 3 → 6. The element 8 in B receives no arrow. In a table with the elements of A as rows and the elements of B as columns, we mark a tick where the pair is in R.

a \ b2468
1✓
2✓
3✓

Each way gives the same information. The list is shortest, the arrow diagram shows at once which elements have no arrow, and the table is best for checking properties of a relation on a single set.

The inverse relation

If R is a relation from A to B, its inverse R⁻¹ is the relation from B to A found by reversing each pair: R⁻¹ = {(b, a) : (a, b) ∈ R}. For the relation above, R⁻¹ = {(2, 1), (4, 2), (6, 3)}. Three facts follow at once. R⁻¹ has as many pairs as R. The domain of R⁻¹ is the range of R, and the range of R⁻¹ is the domain of R. And the inverse of the inverse is R itself.

R⁻¹ = {(b, a) : (a, b) ∈ R}. Domain of R⁻¹ = range of R; range of R⁻¹ = domain of R; n(R⁻¹) = n(R). A relation R on one set is symmetric exactly when R⁻¹ = R.

Worked example 1: the inverse and its domain

For R = {(1, 2), (2, 4), (3, 6)} the range is {2, 4, 6}. So the domain of R⁻¹ is {2, 4, 6}, and its range is the domain of R, namely {1, 2, 3}. The element 8 of B is in the codomain of R but not in the range, so it does not appear in R⁻¹ at all.

Worked example 2: 'divides' on a small set

Let A = {1, 2, 3, 4} and let R be 'a divides b', for pairs (a, b) with both in A. Go through each a. For a = 1: b can be 1, 2, 3, 4, which gives 4 pairs. For a = 2: b = 2, 4, which gives 2 pairs. For a = 3: b = 3, so 1 pair. For a = 4: b = 4, so 1 pair. Therefore R = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 4), (3, 3), (4, 4)} and n(R) = 4 + 2 + 1 + 1 = 8. R is reflexive, but not symmetric: (1, 2) ∈ R and (2, 1) ∉ R.

Worked example 3: 'less than'

On A = {1, 2, 3, 4} let R be 'a < b'. For a = 1 there are 3 choices of b (2, 3, 4), for a = 2 there are 2, for a = 3 there is 1, and for a = 4 there are none. So n(R) = 3 + 2 + 1 + 0 = 6. The inverse R⁻¹ is the relation 'a > b'. Check by reversing: (1, 2) becomes (2, 1), meaning 2 > 1, which is true.

Worked example 4: a symmetric relation

On {1, 2, 3} let R = {(1, 2), (2, 1), (3, 3)}. Reversing every pair gives {(2, 1), (1, 2), (3, 3)}, the same set. So R⁻¹ = R. This is the same as saying that R is symmetric: whenever (a, b) is in R, so is (b, a). In contrast, for R = {(1, 3), (2, 5)} the inverse is {(3, 1), (5, 2)}, which is a different set, so that R is not symmetric.

Common mistakes

  • Reversing only some of the pairs when forming the inverse.
  • Including elements of the codomain that have no arrow in the range or in the inverse.
  • Counting pair (a, a) for 'a divides b' twice or forgetting it: a divides itself.

Key takeaways: a relation can be shown as a list, an arrow diagram or a table. To count the pairs of a rule, go through each first element in turn. The inverse reverses every pair and swaps domain and range.

Check your understanding

  1. 1. For R = {(1, 2), (2, 4), (3, 6)}, what is the domain of R⁻¹?

    1. {1, 2, 3}
    2. {2, 4, 6, 8}
    3. {1, 2, 4, 6}
    4. {2, 4, 6}
    Show answer

    Answer: D. The domain of R⁻¹ is the range of R. The second entries of R are 2, 4 and 6.

  2. 2. How many ordered pairs are in the relation 'a divides b' on {1, 2, 3, 4}?

    1. 6
    2. 8
    3. 7
    4. 10
    Show answer

    Answer: B. The pairs are (1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4): that is 4 + 2 + 1 + 1 = 8.

  3. 3. How many ordered pairs are in the relation 'a < b' on {1, 2, 3, 4}?

    1. 4
    2. 10
    3. 6
    4. 12
    Show answer

    Answer: C. For a = 1, 2, 3, 4 there are 3, 2, 1, 0 choices of b respectively. The total is 3 + 2 + 1 + 0 = 6.

  4. 4. If R = {(1, 3), (2, 5)}, what is R⁻¹?

    1. {(3, 1), (5, 2)}
    2. {(1, 3), (5, 2)}
    3. {(3, 1), (2, 5)}
    4. {(3, 2), (5, 1)}
    Show answer

    Answer: A. The inverse reverses every pair: (1, 3) becomes (3, 1) and (2, 5) becomes (5, 2).

  5. 5. A relation R on a set satisfies R⁻¹ = R. Then R is

    1. reflexive
    2. transitive
    3. symmetric
    4. empty
    Show answer

    Answer: C. R⁻¹ = R means that whenever (a, b) is in R, the reversed pair (b, a) is also in R. That is the definition of a symmetric relation.

Privacy · Terms · Refunds · Delivery