MTH 355 Lecture Notes - Lecture 24: Modular Arithmetic, Equivalence Class, Disjoint Sets

42 views2 pages

Document Summary

Pa = pb we may assume that pan pp to a. R on a set s is a subset. We showed that this is an equivalence relation. R is an equivalence relation the equivalence class of a is at. { bes lamb } i order doesn"t matter because. U c d2 a b is in the class of a is in the class of. R is an equivalence relation on a set. S then its equivalence classes partitions s . D claim . class . acts ca ] z s every element. Because we assume that it"s an equivalence relation. Ca ] a cb ] # 0 a and. C 2 ] b need not be equal for. Since we know that the relation is symmetric we know that. From are and crab , the transitivity of. Be cai by the definition of equivalence classes. Cat = cb ] refer to subsetsof one another.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions