1.2. Types of Relations

A relation 𝑅 on a set 𝐴 is reflexive if for every element 𝑥 ∈ 𝐴, (𝑥,𝑥) is in 𝑅. Example: Let 𝐴 = {1,2,3}. A reflexive relation on 𝐴 is 𝑅 = {(1,1),(2,2),(3,3)}.

A reflexive relation is one where every element in the set relates to itself. For instance, if we have a set A = {1, 2, 3}, the pairs that make it reflexive are (1, 1), (2, 2), and (3, 3). This means that 1 is related to 1, 2 is related to 2, and 3 is related to 3.

Think of reflexive relations like a favorite food: everyone has their favorite food, and that food is the same when they eat it themselves. For example, if pizza is your favorite food, you're certainly going to enjoy your own pizza just like everyone enjoys their favorite.

A relation 𝑅 is symmetric if for every pair (𝑎,𝑏) ∈ 𝑅, the pair (𝑏,𝑎) also belongs to 𝑅. Example: If 𝑅 = {(1,2),(2,1)}, the relation is symmetric.

A symmetric relation means that if one element is related to another, then the second element is also related back to the first. Using the example of R = {(1, 2), (2, 1)}, if 1 is related to 2, then 2 should also be related to 1, making it symmetric.

Imagine friendship: if Alice is friends with Bob, it is generally expected that Bob is friends with Alice too. This mutual relationship is a clear illustration of a symmetric relation.

A relation 𝑅 is transitive if whenever (𝑎,𝑏) ∈ 𝑅 and (𝑏,𝑐) ∈ 𝑅, it follows that (𝑎,𝑐) ∈ 𝑅. Example: If 𝑅 = {(1,2),(2,3),(1,3)}, then it is transitive.

A transitive relation means that if the first element is related to the second, and the second is related to a third, then the first must be related to the third. For example, in R = {(1, 2), (2, 3), (1, 3)}, since 1 is related to 2 and 2 is related to 3, then it is implied that 1 is also related to 3.

Consider a social network: if Sarah is a friend of Tom, and Tom is a friend of John, we often infer that Sarah and John share a connection. This illustrates how connections can extend logically from one person to another, akin to a transitive relation.

A relation 𝑅 is anti-symmetric if for every (𝑎,𝑏) ∈ 𝑅 and (𝑏,𝑎) ∈ 𝑅, it must be the case that 𝑎 = 𝑏. Example: If 𝑅 = {(1,2),(2,1)}, the relation is not anti-symmetric because 1 ≠ 2.

An anti-symmetric relation stipulates that if both (a, b) and (b, a) are in the relation, then a must equal b. In the example R = {(1, 2), (2, 1)}, since 1 is not equal to 2, this relation is not anti-symmetric.

Think of a hierarchy at work: if a manager holds a position over an employee, the reverse cannot apply unless they occupy the same position. It enforces a clear, non-reciprocal order similar to that of an anti-symmetric relation.

A relation is an equivalence relation if it is reflexive, symmetric, and transitive. Example: The relation 𝑅 = {(1,1),(2,2),(1,2),(2,1)} is an equivalence relation.

An equivalence relation combines all three previous properties: reflexivity, symmetry, and transitivity. The example R = {(1, 1), (2, 2), (1, 2), (2, 1)} fulfills all the requirements: each element relates to itself, each pair is mutual, and connections between elements maintain transitivity.

Think of equivalence relations as belonging to the same club: if member A is in the club with member B, then B is also an A’s friend (symmetry), both can connect with themselves (reflexivity), and if A is friends with B, and B is friends with C, then A also relates to C (transitivity).

--