Equivalence Relations ¡ Definition: a Relation on a Set Is Called an Equivalence Relation If It Is Reflexive, Symmetric, and Transitive
Equivalence Relations ¡ Definition: A relation on a set is called an equivalence relation if it is reflexive, symmetric, and transitive. Recall the definitions: ¢ ¡ ¤ ¤ ¨ ¦ reflexive: £¥¤ §©¨ for all . ¢ ¡ ¤ ¤ ¨ ¨ ¦ ¦ ¦ £ § symmetric: £¥¤ §©¨ when , for . ¢ ¤ ¤ ¨ ¨ ¦ ¦ ¦ £ § transitive: £ §©¨ and £ § implies , ¡ ¤ ¨ for ¦ ¦ . If two elements are related by an equivalence relation, they are said to be equivalent. 1 Examples 1. Let be the relation on the set of English words such that if and only if starts with the same letter as . Then is an equivalence relation. 2. Let be the relation on the set of all human beings such that if and only if was born in the same country as . Then is an equivalence relation. 3. Let be the relation on the set of all human beings such that if and only if owns the same color car as . Then is an not equivalence relation. 2 ¤ Pr is Let ¢ ¢ an oof: is If Since Thus, equi ¤ symmetric. is By refle v ¤ alence definition, be , Congruence for xi ¤ a ¤ v positi e. some relation. £ , ¤ v then e inte £ ¤ § inte ¦ ¤ ger , § , and ger we ¤ 3 . we ha Then Modulo Using v e ha if that v the and , e this,we for ¤ relation only some ¤ ¤ proceed: if inte ger , , so and . Therefore, ¢ ¤ and If ¤ ¤ we congruence ha v e £ ¤ ¤ and , and §"! modulo £ 4 , § and , for is an inte ! is equi , then gers transiti v alence we and v £ ha e. ! v relation e . Thus, § ¦ ¡ Definition: Let be an equivalence relation on a set . The equivalence class of¤ is ¤ ¤ ¨ % ¦ £ § # $ '& ¤ % In words, # $ is the set of all elements that are related to the ¡ ¤ element ¨ .
[Show full text]