Inverse Relations
What You'll Learn
You'll learn how to reverse a relation by swapping its ordered pairs and discover which properties survive—or vanish—under this transformation.
The Core Idea
A relation R from set A to set B is a collection of ordered pairs (a, b). The inverse relation, denoted R⁻¹, is simply the relation you get by swapping every pair: if (a, b) ∈ R, then (b, a) ∈ R⁻¹.
Think of it like reversing arrows on a digraph: every edge from x to y becomes an edge from y back to x.
Formal Definition
If R ⊆ A × B, then:
R⁻¹ = {(b, a) | (a, b) ∈ R}
Notice the domain and codomain swap: if R goes from A to B, then R⁻¹ goes from B to A.
Example
Let A = {1, 2, 3} and B = {x, y}, with R = {(1, x), (2, x), (3, y)}.
Then R⁻¹ = {(x, 1), (x, 2), (y, 3)}.
How Properties Change
Here's where it gets interesting:
- Reflexive: R is reflexive ⇔ R⁻¹ is reflexive (on the same set)
- Symmetric: R is symmetric ⇔ R = R⁻¹ (the relation equals its own inverse!)
- Antisymmetric: If R is antisymmetric, R⁻¹ is also antisymmetric
- Transitive: R is transitive does not guarantee R⁻¹ is transitive
Composition Connection
A useful fact: (R ∘ S)⁻¹ = S⁻¹ ∘ R⁻¹. The inverse of a composition reverses the order, just like inverse functions.
Key Takeaway: The inverse relation R⁻¹ swaps all ordered pairs in R; symmetric properties survive inversion, but others like transitivity may not hold in the inverse.