Difference between revisions of "Equivalence relation"
ComplexZeta (talk | contribs) m |
|||
Line 1: | Line 1: | ||
− | Let <math>S</math> be a set. A relation <math>\sim</math> on <math>S</math> is said to be an ''equivalence relation'' if <math>\sim</math> satisfies the following three properties: | + | Let <math>S</math> be a set. A relation <math>\sim</math> on <math>S</math> is said to be an '''equivalence relation''' if <math>\sim</math> satisfies the following three properties: |
1. For every element <math>x \in S</math>, <math>x \sim x</math>. (Reflexive property) | 1. For every element <math>x \in S</math>, <math>x \sim x</math>. (Reflexive property) |
Revision as of 00:44, 24 June 2006
Let be a set. A relation on is said to be an equivalence relation if satisfies the following three properties:
1. For every element , . (Reflexive property)
2. If such that , then we also have . (Symmetric property)
3. If such that and , then we also have . (Transitive property)
Some common examples of equivalence relations:
- The relation (equality), on the set of real numbers.
- The relation (congruence), on the set of geometric figures in the plane.
- The relation (similarity), on the set of geometric figures in the plane.
- For a given positive integer , the relation (mod ), on the set of integers. (Congruence mod n)