Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Binary Relations and Equivalence Relations, Exercises of Economics

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

2021/2022

Uploaded on 09/12/2022

mancity4ever
mancity4ever ๐Ÿ‡ฌ๐Ÿ‡ง

4.5

(15)

251 documents

1 / 59

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Binary Relations
Part One
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b

Partial preview of the text

Download Binary Relations and Equivalence Relations and more Exercises Economics in PDF only on Docsity!

Binary Relations

Part One

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?

a b

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.

3 = 3 5 < 7 ร˜ โІ โ„•

โ— If R is a binary relation over A and it does not hold for the pair ( a , b ), we write aRฬธb.

4 โ‰  3 4 <โ‰ฎ 3 โ„• โІโ‰ฎ ร˜

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?