



















































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
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
The concept of binary relations and their properties, including reflexivity, symmetry, and transitivity. It also introduces the concept of equivalence relations, which are binary relations that possess all three properties. examples and proofs to illustrate these concepts.
Typology: Exercises
1 / 59
This page cannot be seen from the preview
Don't miss anything!
Outline for Today โ Binary Relations โ Reasoning about connections between objects. โ Equivalence Relations โ Reasoning about clusters. โ A Fundamental Theorem โ How do we know we have the โrightโ defnition for something?
What exactly is a binary relation?
aRb R
Binary Relations โ A binary relation over a set A is a predicate R that can be applied to pairs of elements drawn from A. โ If R is a binary relation over A and it holds for the pair ( a , b ), we write aRb.
โ If R is a binary relation over A and it does not hold for the pair ( a , b ), we write aRฬธb.
Properties of Relations โ Generally speaking, if R is a binary relation over a set A , the order of the operands is signifcant. โ For example, 3 < 5, but 5 <โฎ 3. โ (^) In some relations order is irrelevant; more on that later. โ Relations are always defned relative to some underlying set. โ It's not meaningful to ask whether โบ โ 15, for example, since โ is defned over sets, not arbitrary objects.
Visualizing Relations โ (^) We can visualize a binary relation R over a set A by drawing the elements of A and drawing a line between an element a and an element b if aRb is true. โ (^) Example: the relation a โ b over the set {1, 2, 3, 4} looks like this:
Visualizing Relations โ (^) We can visualize a binary relation R over a set A by drawing the elements of A and drawing a line between an element a and an element b if aRb is true. โ (^) Example: the relation a = b over the set {1, 2, 3, 4} looks like this:
Answer at PollEv.com/cs103 or text CS103 to 22333 once to join, then A , B , C , D , E , or F. Answer at PollEv.com/cs103 or text CS103 to 22333 once to join, then A , B , C , D , E , or F. Below is a picture of a binary relation R over the set {1, 2, โฆ, 8}. Which of the following is a correct defnition of the relation R? A. xRy if x = 3 and y = 5 B. xRy if y = x + 2 C. yRx if y = x + 2 D. R = + E. None of these F. More than one of these Below is a picture of a binary relation R over the set {1, 2, โฆ, 8}. Which of the following is a correct defnition of the relation R? A. xRy if x = 3 and y = 5 B. xRy if y = x + 2 C. yRx if y = x + 2 D. R = + E. None of these F. More than one of these
Capturing Structure
Partitions
Partitions and Clustering โ If you have a set of data, you can often learn something from the data by fnding a โgoodโ partition of that data and inspecting the partitions. โ Usually, the term clustering is used in data analysis rather than partitioning. โ Interested to learn more? Take CS161 or CS246!
What's the connection between partitions and binary relations?