Reflexive Relations
What You'll Learn
You'll learn what it means for a relation to be reflexive and how to verify whether every element in a set relates to itself.
The Core Idea
A reflexive relation is a relation on a set where every element is related to itself. Think of it like a "self-awareness" property: for a relation R on set A to be reflexive, every element a in A must satisfy (a, a) ∈ R.
Imagine a relation "is as tall as" among people. This relation is reflexive because everyone is exactly as tall as themselves. In contrast, "is taller than" is not reflexive—you can't be taller than yourself!
Formal Definition
A relation R on a set A is reflexive if and only if:
For all a ∈ A, (a, a) ∈ R
In predicate logic: ∀a ∈ A: (a, a) ∈ R
Checking Reflexivity
To verify a relation is reflexive:
- Identify the set A the relation is defined on
- List all elements of A
- Check that each element pairs with itself in R
Example 1
Let A = {1, 2, 3} and R = {(1,1), (2,2), (3,3), (1,2)}.
- Does 1 relate to itself? ✓ (1,1) ∈ R
- Does 2 relate to itself? ✓ (2,2) ∈ R
- Does 3 relate to itself? ✓ (3,3) ∈ R
R is reflexive.
Example 2
Let A = {1, 2, 3} and R = {(1,1), (2,2), (1,3)}.
- (3,3) is missing!
R is NOT reflexive because 3 doesn't relate to itself.
In Matrix/Digraph Representation
In a relation matrix, reflexivity means the main diagonal is all 1's. In a digraph, every vertex must have a self-loop.
Key Takeaway: A relation is reflexive if every element in the domain relates to itself—check that all pairs (a, a) are present.