Intro to Relations | Discrete Math

preview_player
Показать описание
What are relations? We'll be defining mathematical relations with examples - using set theory - in todays lesson!

We can define relations using sets, and set-builder notation is especially handy! A relation R on a set A is simply a subset of the Cartesian product AxA. Each ordered pair in the relation is thus of the form (x, y) where x and y are in A. The inclusion of (x, y) in R means that x relates to y under the relation R. For example, (2, 3) is in the less than relation on the integers because 2 is less than 3.

We also discuss reflexive, symmetric, and transitive properties of relations - as well as equivalence relations! We also briefly mention how functions are just special types of relations.

SOLUTION TO PRACTICE PROBLEM:

We let A = {0} and R = { (0,0) }. The relation R is in fact an equivalence relation. It is reflexive because every element of A relates to itself. It is symmetric because anytime x relates to y, we also have y relates to x. It is vacuously transitive, because it does not contradict the transitive property. In order to NOT be transitive, a relation must have ordered pairs (x, y) and (y, z) but not (x, z).

I hope you find this video helpful, and be sure to ask any questions down in the comments!

+WRATH OF MATH+


Follow Wrath of Math on...

Рекомендации по теме
Комментарии
Автор

my best math teacher ever, i watch every videos and i understand them all. Deadass there should be more recognition for him.

skywalkerluke
Автор

We let A = {0} and R = { (0, 0) }. The relation R is an equivalence relation because:
R is reflexive: for a ϵ A, (a, a) ϵ R,
R is symmetric: for a, b ϵ A, if (a, b) ϵ R then (b, a) ϵ R, and
R is transitive: for a, b, c ϵ A, if (a, b), (b, c) ϵ R then (a, c) ϵ R.

azizhani
Автор

"Let's say Alice is a weirdo and spends time shaking her own hand" 😂 Brilliant!

GarethThompson-prvn
Автор

How did you say cream shaft with a straight face bahahah 🙌

MathCuriousity
Автор

THIS WAS SO EASILY EXPLAINED! THANK YOU!

TusharDeb
Автор

Thanks Sean!

btw I think there is a equivalence relation because it satisfies all three properties.
for all x in A (x, x) is in the relation,
Since we only have one element in the set, which is just a pair of zero's then we will have symmetry since both the first and last entry of the pair are the same,
We fufill the transitive property automatically since there is only one element in the relation.

Victual
Автор

maybe you could talk about partial order and total order sets ? It's in the same theme ( and to be honest, I didn't fully understand it and you're the best maths teacher on the net, so... pls ? :) )

charlesmaurice
Автор

Thank you so much for this detailed explanation! This is a lot better than what my professor explains in class. Thanks!

jingyiwang
Автор

This is an equivalence relation.for intuition imagine two ellipses(which you will see in every explanation of relation as a mapping pictorial representation) each containing 0 as a member.Since the relation is defined "in" the set {0} which means that the relation is made between the members of same set, the two sets whose members which we are going to relate are equivalent.But for convinience lets name the 1st ellipse as X and the second ellipse as Y with a known factX =Y={0}.Now, in this case 0 in X is related to 0 in Y (so all members of setA is related to itself), so it is reflexive. Since 0 in X is related to 0 in Y implies 0 in X is related to 0 in Y, it is symmetric.Since 0 in X is related to 0 in Y and 0 in X is related to 0 in Y implies 0 in X is related to 0 in Y, it is transitive.Therefore it is an equivalence relation🎉

Suraj-xzgi
Автор

Mr. Shawn, please make a video on how to calculate all possible relations of a given non-empty set; additionally, how to calculate all possible, minimum and maximum reflexive, symmetric, transitive, identity relations.

andrewjustin
Автор

I think the relation on the set A ={0} does satisfy the equivalence class because if you take the (<+=) operator it should satisfy reflexivity, transitivity and symmetry all together.

AnoyingGamersNL
Автор

Thx for this helpful video. I have a test on this today and I was baffled trying to read the book.😁

Gernexty
Автор

This is explained well. It is an important topic which leads to deeper mathematics topics.

TranquilSeaOfMath
Автор

Absolute stunner of a video 🙏🏻 so for this new question I have on this new video (I also asked two on the equivalence relations video), what do you mean by vacuously true transitively? What would be a reflexive that’s vacuously true or a symmetric that’s vacumously true? Thanks kind god!

MathCuriousity
Автор

This definition of relation is often given, but has drawbacks. Consider the pair-set R={(a, a)}. We can work out if it's transitive, symmetric, or irreflexive just by looking at it, so those are genuine properties of a relation defined that way. But we cannot know if it's reflexive or surjective without specifying a context, because {(a, a)} is a subset of infinitely many Cartesian products. So reflexivity and surjectivity are not properties of R. For example, R is reflexive wrt {a}, but not wrt {a, b}.

A better definition of relation is as a triple (X, Y, P), where the pair-set P is a subset of XxY. Then reflexivity and surjectivity can be specified as properties of the relation, since the "context" Cartesian product is part of the object used to represent the relation.

christaylor
Автор

Hey lovely video and a second question: if we let A = {} do we then say that bill set is an equivalence relation because all three properties are vacuously true? Or is it a non starter since we can’t create an actual relation so no relation exists ? Or can the null set be a subset of null set X null set? Cuz then we can say R = {} also! Right?

MathCuriousity
Автор

I understood everything up until the transitive part in (0, 0). I do not know where this comment section keeps getting the non-existent extra (0, 0) from

labiribiri