This page will include all handouts, selected homework problem solutions, and possibly some notes. Links are to files in pdf format.
Proof. Define a relation x S y if and only if one of the three conditions (i), (ii), or (iii) holds. We show below that S is an equivalence relation. Note that every equivalence relation that contains R must contain S, because the equivalence relation is reflexive; contains R and is symmetric; and is transitive. Then S contains R (by (ii)) and must be contained in every equivalence relation that contains R, so by definition S is equal to ~, as desired.
Now we confirm that x S y is an equivalence relation. It is reflexive by (i). It is symmetric because both (ii) and (iii) are defined using R', which is symmetric by definition. It is transitive by (iii), because two such finite chains can be concatenated to make a new, longer but finite, chain. Thus S is an equivalence relation, completing the proof.
Return to the Math 544 Homepage.