



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The concept of binary relations, reflexive, symmetric, and transitive properties, and introduces equivalence relations as a special type of relation. It provides examples of various relations and demonstrates how to determine if a relation is an equivalence relation.
Typology: Assignments
1 / 6
This page cannot be seen from the preview
Don't miss anything!




Math 3330 Section 1. Relations
A binary relation (also called simply a relation) on a nonempty set A is a
Any mapping on A is an example of a relation. But, a relation DOES NOT HAVE TO BE a mapping.
Example: A={1,3,5,7} and B={2,4,5,6} define R
Properties of Relations Reflexive
Irreflexive
Symmetric
Asymmetric
Anti-symmetric
Transitive
Examples of Relations Consider the set of all human beings. Let x and y be human beings.
Consider the power set P(A) for a nonempty set A, and x and y are elements of P(A).
Special Relations Equivalence Relations (IMPORTANT!) A relation R is called an equivalence relation if R is reflexive, symmetric and transitive.
Examples of equivalence relations The = sign – most important
Consider the set of ordered pairs of integers (a,b) with b nonzero.
Show that R is an equivalence relation.
Equivalence Classes
Let R be an equivalence relation on the nonempty set A. For each define the equivalence class of a to be