Relations and Their Types: Explained with Examples

A relation from set A to set B is any collection of ordered pairs (a, b) with a from A and b from B — in other words, any subset of A cross B. For example, "is taller than" relates people to people through such pairs.

Relations matter because they are the general idea behind every connection between two collections: friendships, "divides" between numbers, and database links are all relations. Functions, which you meet next, are simply relations with one extra rule.

Key Concepts

• Relation R from A to B: any subset of A cross B; each pair (a, b) in R means "a is related to b".
• Reflexive: every element relates to itself; (a, a) is in R for all a in A.
• Symmetric: whenever (a, b) is in R, (b, a) is in R too; the relation works both ways.
• Transitive: whenever (a, b) and (b, c) are in R, (a, c) is in R as well; the relation chains forward.
• Empty and universal relations: the empty set (no pairs) and the whole of A cross B (all pairs) are both valid relations.

How It Works

1. Write the relation as a set of ordered pairs.
2. Reflexive check: is (a, a) present for every a in A? One missing self-pair fails the test.
3. Symmetric check: for every (a, b) in R, look for (b, a) in R. Self-pairs like (1, 1) need no partner.
4. Transitive check: for every chain (a, b) and (b, c) in R, confirm (a, c) is in R.

Worked Example

On A = {1, 2, 3}, let R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}. Classify R.

1. Reflexive: (1, 1), (2, 2), (3, 3) are all present. Yes.
2. Symmetric: (1, 2) has partner (2, 1) present; (2, 1) has partner (1, 2) present; self-pairs are fine. Yes.
3. Transitive: check chains. (1, 2) and (2, 1) need (1, 1), present. (2, 1) and (1, 2) need (2, 2), present. (1, 2) and (2, 2) need (1, 2), present. All chains close. Yes.
4. So R is reflexive, symmetric and transitive — the combination called an equivalence relation.

Common Misconceptions

• "Symmetric means reflexive." No: {(1, 2), (2, 1)} on {1, 2} is symmetric but not reflexive, since (1, 1) and (2, 2) are missing.
• "Every relation is a function." Relations are the bigger family; a function is a relation with the extra rule that each input gets exactly one output.
• "Transitive means the pairs are in order." Transitivity is about chains closing: from (a, b) and (b, c) you must find (a, c), whatever the numbers look like.

Real-World Applications

• Social networks: "is friends with" is meant to be symmetric; "follows" is typically not.
• Databases: a foreign key column relates rows of one table to rows of another — a relation in the mathematical sense.
• Scheduling: "must happen before" between tasks should be transitive, or the schedule contradicts itself.

A relation is any set of ordered pairs from A cross B, and reflexive, symmetric and transitive describe how nicely it behaves. Test each property directly on the pairs, and classification becomes a calm checklist instead of a guessing game.