Relations Between Sets
In mathematics, a relation from a set to a set is a rule that connects members of set with members of set . This pairing can be in any form.
Example:
The "less than" relation between and yields the pairs .
Explanation:
We look for all pairs with and where .
- For -> , , . Pairs: .
- For -> , . Pairs: .
- For -> . Pair: .
The combination of all these pairs is .
Functions as Special Relations
A function (or mapping) from a set to a set , written , is a special relation that satisfies two conditions:
-
Every element must have a pair .
-
Every element has exactly one pair .
This means every member of the domain must be connected, and cannot have more than one connection.
Arrow Diagram Examples
Here are visual examples of relations using arrow diagrams to distinguish between functions and non-functions.
Relations That Are Not Functions
One to Many
Element b has more than one pair (m and n).
Domain Element Without a Pair
Element c does not have a pair in the codomain.
Relations That Are Functions
Exactly One Pair
Each domain element (p, q, r) has exactly one pair.