15h - Discrete Mathematics Orders and Equivalences 15-2...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction Orders and Equivalences Discrete Mathematics Andrei Bulatov Discrete Mathematics – Orders and Equivalences 15-2 Previous Lecture Properties of binary relations Equivalence relations s reflexivity s symmetricity s transitivity s anti-symmetricity Discrete Mathematics – Orders and Equivalences 15-3 Properties of binary relations Reflexivity A binary relation R A × A is said to be reflexive if (a,a) R for all a A. Symmetricity A binary relation R A × A is said to be symmetric if, for any a,b A, if (a,b) R then (b,a) R. Transitivity A binary relation R A × A is said to be transitive if, for any a,b,c A, if (a,b) R and (b,c) R then (a,c) R. Anti-symmetricity A binary relation R A × A is said to be anti-symmetric if, for any a,b A, if (a,b) R and (b,a) R then a =b. Discrete Mathematics – Orders and Equivalences 15-4 Equivalence relations A binary relation R on a set A is said to be an equivalence relations if it is reflexive, symmetric, and transitive. Let R People × People. Pair (a,b) R if and only if a and b are of the same age. Equivalence classes. Take a A. The set C(a) = { b | (a,b) R} is called the equivalence class of a. For example,
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

15h - Discrete Mathematics Orders and Equivalences 15-2...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online