Relations
Definition (Relation)
Let and be sets, and let be their Cartesian product. A (binary) relation from to is a subset of . When , we speak of a relation on (or over or in) .
If is a relation from to , we write to indicate that , and we say that “ is -related to ”.
Example Trivially, and are relations from to .
Example The set of all pairs , where , is the relation of equality between elements of .
Example The subset of consisting of all pairs such that is the relation of belonging between elements of and subsets of .
Example A function is a special type of relation.
Definition (Domain and Range of a Relation)
Let and be sets, and let be a relation from to . The domain of is the set of all elments of with the property that there exists an element of such that is -related to . The range of is the set of all elments of with the property that there exists an element of such that is -related to . Formally,
Example Let be the relation of belonging between elements of a set and subsets of (see above). Then has domain and range .
Definition (Inverse Relation)
TODO
Definition (Composition of Relations)
TODO
Proposition (Associativity of Composition)
The composition of relations is associative. Explicitly, if , , , are sets, and is a relation from to , is a relation from to , is a relation from to , then
Definition (Properties of Relations)
A relation on a set is said to be
- reflexive if for all .
- irreflexive if there is no such that .
- symmetric if implies for all .
- antisymmetric if and imply for all .
- transitive if and imply for all .
Definition (More Properties of Relations)
A relation from a set to a set is called
- left-total if for all there exists a such that .
- right-total if for all there exists a such that .
- left-unique if and implies for all and all .
- right-unique if and implies for all and all .
Equivalence Relations
Definition (Equivalence Relation)
A reflexive, symmetric and transitive relation is called equivalence relation.
on a nonempty set?
Example For any set , the relation of equality and the relation are equivalence relations on .
Definition (Equivalence Class)
Let be an equivalence relation on a set . We define the equivalence class of an element to be the set . We write for the set of all equivalence classes.
The expression is pronounced “ modulo ”.
Two equivalence classes are either disjoint or equal.
Example If is the relation of equality on , then is the set of all singletons with . For the relation on , we have .
Definition (Relation Induced by a Partition)
Let be a partition of a set . By the relation induced by we mean the relation on consisting of all pairs such that for some .
Let be a set.
- If is a relation on , then the set of equivalence classes is a partition of .
- If is a partition of , then the induced relation is an equivalence relation on .
- These constructions are mutually inverse.