COMS W3203 Lecture 13: Equivalence relation, equilivalence class, partitions
Premium

2 Pages
44 Views
Unlock Document

Department
Computer Science
Course
COMS W3203
Professor
Ansaf Salleb- Aouissi
Semester
Fall

Description
Discrete Math Lecture 13 1024 Example: o on the sets (students classes) o Properties o Reflexive IF ( ) o Irreflexive I o Symmetric IFF o Antisymmetric IFF , = o Transivitive IF,, o Note: not symmetric is different from antisymmetric Diagraphs o o a is reflexive o e,d and d,f and e,f and b,c are symmetric Equivalence relation o Let R be a relation on a set A. We call R an equivalence relation provided it is reexive, symmetric, and transitive. o Example: Consider the relation has same cardinality as dened as: A R B IFF A = B
More Less

Related notes for COMS W3203

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit