• Foundation
  • About 18 min
  • 5 practice questions

Types of relations: empty, universal, reflexive, symmetric, transitive

Recall what a relation in a set is, recognise empty and universal relations, and test any relation for the reflexive, symmetric and transitive properties with a proof or a counterexample.

If something looks wrong, please tell us.

By the end of this lesson you can

  • Describe a relation in a set A as a subset of A × A and use the notation a R b.
  • Recognise the empty relation and the universal relation.
  • Prove that a relation is reflexive, symmetric or transitive, or disprove it with one counterexample.

In Class 11 you met relations as a way of pairing elements of two sets. Class 12 asks a sharper question: what kind of relation is it? The answer decides whether the relation can sort a set into neat groups, which is the idea behind equivalence relations in the next lesson, and it is a favourite area for short proofs in board papers.

Relation in a set

A relation R from a set A to a set B is any subset of the Cartesian product A × B. When B = A, we call R a relation in A (or on A); it is then a subset of A × A. If the ordered pair (a, b) belongs to R, we say a is related to b and write a R b. Mathematically, membership of the pair is all that matters; there need not be any everyday meaning behind it.

The two extreme (trivial) relations

Every relation in A sits between two extremes. The empty relation is R = φ: no element is related to any element. The universal relation is R = A × A: every element is related to every element, including itself. Together these are called trivial relations.

Worked example 1. Let A = {2, 4, 6, 8}. Take R₁ = {(a, b) : a + b is odd} and R₂ = {(a, b) : a + b is even}. Working: every element of A is even, and the sum of two even numbers is always even. So no pair satisfies the condition for R₁, giving R₁ = φ (empty relation). Every pair satisfies the condition for R₂, giving R₂ = A × A (universal relation).

Reflexive, symmetric and transitive

Let R be a relation in a set A. Then R is:

  • reflexive if (a, a) ∈ R for every a ∈ A;
  • symmetric if (a, b) ∈ R implies (b, a) ∈ R, for all a, b ∈ A;
  • transitive if (a, b) ∈ R and (b, c) ∈ R together imply (a, c) ∈ R, for all a, b, c ∈ A.

Reflexive: every a R a. Symmetric: a R b ⇒ b R a. Transitive: a R b and b R c ⇒ a R c. To prove a property you need a general argument; to disprove it, one counterexample is enough.

— Definitions
Proof versus counterexample
PropertyTo prove itTo disprove it
ReflexiveShow (a, a) ∈ R for an arbitrary a ∈ AFind one a with (a, a) ∉ R
SymmetricAssume (a, b) ∈ R, deduce (b, a) ∈ RFind one (a, b) ∈ R with (b, a) ∉ R
TransitiveAssume (a, b), (b, c) ∈ R, deduce (a, c) ∈ RFind (a, b), (b, c) ∈ R with (a, c) ∉ R

Testing a relation given as a list of pairs

  1. Reflexive check Is every (a, a) present for each a in the set? One missing pair is enough to say no.
  2. Symmetric check For each listed (a, b) with a ≠ b, is (b, a) also listed?
  3. Transitive check For every chain (a, b), (b, c) in the list, is (a, c) listed too? Include chains that use pairs like (a, a).
  4. Conclude Equivalence relation only if all three answers are yes.

Worked example 2 (a finite relation). In A = {1, 2, 3}, let R = {(1, 1), (2, 2), (3, 3), (2, 3)}. Working: all three pairs (1, 1), (2, 2), (3, 3) are present, so R is reflexive. (2, 3) ∈ R but (3, 2) ∉ R, so R is not symmetric. For transitivity list every chain: (2, 2) and (2, 3) give (2, 3) ∈ R; (2, 3) and (3, 3) give (2, 3) ∈ R; the chains through (1, 1), (2, 2), (3, 3) alone return the same pair. No chain fails, so R is transitive.

Worked example 3 (divisibility). In the set N of natural numbers, let R = {(a, b) : a divides b}. Working: a divides a for every a, so R is reflexive. 2 divides 6 but 6 does not divide 2, so R is not symmetric. If a divides b and b divides c, write b = ma and c = nb for natural numbers m, n; then c = (mn)a, so a divides c and R is transitive.

Worked example 4 (closeness). In the set R of real numbers, let S = {(a, b) : |a − b| ≤ 1}. Working: |a − a| = 0 ≤ 1, so S is reflexive. |b − a| = |a − b|, so S is symmetric. But (0, 1) ∈ S and (1, 2) ∈ S while |0 − 2| = 2 > 1, so (0, 2) ∉ S and S is not transitive. Being 'close to' is not passed along a chain.

A common trap

Students sometimes argue that symmetric and transitive together force reflexive: 'a R b gives b R a, and then transitivity gives a R a'. The flaw is that this only works for an element a that is related to something. In A = {1, 2}, the relation R = {(1, 1)} is symmetric and transitive, but not reflexive, because 2 is related to nothing, so (2, 2) ∉ R.

Key takeaways: a relation in A is a subset of A × A. The empty and universal relations are the two extremes. Reflexive needs every (a, a); symmetric needs every pair reversed; transitive needs every chain completed. Prove with a general argument, disprove with one counterexample, and remember that the three properties are independent of one another.

Check your understanding

  1. 1. In A = {1, 2, 3}, which relation is reflexive?

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

    Answer: B. Reflexive needs all of (1, 1), (2, 2) and (3, 3). Only {(1, 1), (2, 2), (3, 3), (3, 1)} contains all three. The first misses (3, 3), the third has none of them and the last misses (1, 1).

  2. 2. Let R = {(a, b) : a < b} in the set of real numbers. Which statement is correct?

    1. R is reflexive and transitive
    2. R is symmetric only
    3. R is transitive but neither reflexive nor symmetric
    4. R is an equivalence relation
    Show answer

    Answer: C. a < a is false, so R is not reflexive. 1 < 2 but 2 < 1 is false, so R is not symmetric. If a < b and b < c then a < c, so R is transitive.

  3. 3. In A = {1, 2, 3}, R = {(1, 2), (2, 1), (1, 1)}. Which property fails?

    1. Transitivity only
    2. Symmetry only
    3. Reflexivity only
    4. Both reflexivity and transitivity
    Show answer

    Answer: D. (3, 3) and (2, 2) are missing, so R is not reflexive. R is symmetric because (1, 2) and (2, 1) are both present. For transitivity, (2, 1) and (1, 2) give the chain 2 → 1 → 2, which needs (2, 2); it is missing, so R is not transitive either.

  4. 4. Assertion (A): The relation R = {(a, b) : |a − b| ≤ 1} in the set of real numbers is not transitive.
    Reason (R): (0, 1) ∈ R and (1, 2) ∈ R, but (0, 2) ∉ R.

    1. Both A and R are true, and R is the correct explanation of A
    2. Both A and R are true, but R is not the correct explanation of A
    3. A is true but R is false
    4. A is false but R is true
    Show answer

    Answer: A. |0 − 1| = 1 ≤ 1 and |1 − 2| = 1 ≤ 1, but |0 − 2| = 2 > 1. So the reason is a true counterexample, and one counterexample is exactly what shows a relation is not transitive. Both are true and R explains A.

  5. 5. In the set A = {1, 2, 3}, which relation is empty?

    1. {(a, b) : a + b > 6}
    2. {(a, b) : a = b}
    3. {(a, b) : a + b ≥ 2}
    4. {(a, b) : a − b is even}
    Show answer

    Answer: A. The largest possible sum is 3 + 3 = 6, which is not greater than 6, so no pair satisfies a + b > 6 and the relation is φ. a = b gives three pairs, a + b ≥ 2 holds for all nine pairs (universal), and a − b even holds for pairs such as (1, 1) and (1, 3).

Privacy · Terms · Refunds · Delivery