Thank you. You are literally the only person who can explain this in simple English it seems. My professor seems to get joy from talking in the most confusing, and ambiguous terms possible
It's not always their fault, usually they have limited time and try to provide you with the most accurate statements possible. Though I agree, it's much easier to graps a broader concept after learning the intuition and basic intetion of it on simple examples, i wouldn't be here otherwise :P
@@foxxul My teacher only posts links to TH-cam videos...and not Trev or Patrick... I may as well have the lady that designs suits from the Incredibles explaining relations backwards in Dutch while gargling peanut butter. Thank goodness for Google.
@@ald3nte The problem begins where the college teachers go after completing the syllabus instead of actually teaching. The bigger the difference between the score of best performing student and the worst performing student, the worse the teacher is at his/her job
x-y != 0 This situation is not transitive. xRy and yRz imply xRz. Consider the case 3R4, 4R3, therefore 3R3. We know 3R3 is 0, so the relationship isn't transitive!
But if we consider the case of 3R4, 4R5, they both imply != 0, therefore 3-5 != 0 which is correct. Why is it not transitive if I can make it work with this example?
well if you're given those specific values and are asked if their relationship is transitive you could say yes, but when given only x and y, their relationship must be transitive for ALL values of the given domain, or else its NOT transitive, even if 99.9% of the possible cases are.
i just started computer science at uni this year and i got recommended your amazing videos! They are so helpful, even if my main language isnt english i still managed to understand you easily and mathematics have their own universel language which helps even more. Thank you again
I have just started my 4 year computer science course at university, and discrete math is a module. I look forward to learning more about discrete math with your videos :D Keep up the good work
A correction: every function may also be represented as a relation (i.e., as a subset of a Cartesian product), but not every relation is a function. Just think of a simple relation like a total order on a set and you will see that a given argument in a relation may be related to many other arguments and does not have to be related to an exclusive output as a function does.
+Astra Adams Students who want to play with themselves are encouraged to sit in the back of the room with other students that want to play with themselves, that way they can play with each other instead ;)
Hey, I just wanna let you know that this video helped me so damn much. Thank you very much, you have no idea how good it felt when I finally had that eureka moment after many weeks having no idea what my professor was talking about. Keep doing what you're doing bro.
hello identity relation is what he explained in the place of reflexive! reflexive relation's are those in which elements are related to themselves, also they can be related to any other element! peace out.
god my college discrete math course was so bad that straight up skipping the lecture and only studying the slides and videos like you got me better grades
Oskar Midbøe A relation R on a set X is antisymmetric if and only if x R y and y R x implies x = y. A relation is irreflexive if and only if every point x is not related to itself. An example of this is inequality since it’s illogical for an element say x to be not equal itself.
When determining reflexivity, symmetry, and transitivity at 11:31. Could we analyze x - y != 0 as x != y instead? Just seems like it may be a simpler approach. Do you see anything wrong w/ that approach? I noticed you actually worked out x != y at the end of the video. My question is: is there anything wrong with manipulating the variables around the operator? I'm assuming this should not change reflexivity, transitivity or symmetry. (i.e. x - y + z = 0 is the same as figuring out the relations of x = y - z, etc.)
There's nothing wrong with that. In fact, it's easier to understand x != y rather than x-y != 0 for this kind of question, so the fact that you were able to change that and work with it better is a good thing.
At 15:05 for proofing it is not transitive you took x and z same. don't you think it's wrong to take same value ? All x,y,z must be of different values? If you still says we can take same values for x and z then in that case, for symmetric property we also can take x and y same and which will say (let) 2=2 and hence it do not hold symmetric property as well. Appreciate you response on my query. Thanks. You are doing awesome job :)
I'm kinda struggling with this question I have... It's about Hash functions... SHA64 to be specific... It goes like this: We have a set of S which is a random long String combination (Cardinality is infinity therefore) and another set of Hex64, which consists of the Hexadecimals {0,1, 2...., 9, A, B, C, D, E, F) and this function takes any String input and generates a 64 digit long hexadecimal number from that string... However, because there are infinite input possibilities, however limited output possibilities (16^64 to be specific) there are bound to be "collisions" and that is when you enter 2 different strings but get the same output... and now my question is this... The following relationship is defined so: s1 and s2 are elements of S and are related as such: s1~s2 : Hex64(s1) Hex64(s2) So it's basically saying that 2 different strings are related, when they cause a collision and it's saying that this is an equivalence relation, and I have to show: a) How this is reflexive b) how this is symmetric c) how this is transitive Now I understand it in principle, but I'm not sure how to do it mathematically....
In the example x-y=!0, I assume you don't include negative numbers? Because then the relation would not be symmetric right?for example pick x to be -y?
I just have a question about the less than or equal to operator. Instead of taking the constants 3 and 4 while evaluating the symmetry, what if you were to take two of the same constants, say 4(like you did for the second relation)? The statement would be: =(4 is less than or equal to 4) implies (4 is less than or equal to 4) which is: =(true) implies (true) therefore the overall statement is: =true So my question is why is the operator, less than or equal to, not symmetric? Amazing work btw! Your videos are clear and coherent, keep up the good work!
When we pick 4 and 4, we are evaluating one scenario. For a relation to be symmetric it had to be synmetric for all choices of x and y. So yes, (4,4) works, but because we can find a situation where the relation isn't symmetric, we cannot claim that the whole relation is symmetric.
for the use of 4 and 4, i thing is not good since 4 is a common viriable so it should be use to check reflexivity not symmetric only......yRx for which mean different
Let A = {1, 2, 3}. For each of the below relations, indicate which of the 4 properties it satisfies: reflexive, symmetric, antisymmetric, transitive. (i) {(1, 1),(1, 2),(2, 3)} (ii) {(1, 1),(1, 2),(2, 1),(2, 2),(3, 3)} (iii) {(1, 1),(2, 2),(3, 3),(2, 3)} Could you help me understand what relations I am working with above? I understand the first one is
Im not really understanding 11:08 you said 4-4!=0 is true because it being false makes it true. Can you clarify this for me some more? Does that only happen in a transitive case and is it like a rule that has to be memorized?
en.wikipedia.org/wiki/Material_conditional#Truth_table Suppose I say: "If I go to the store, I will get eggs." The only time that statement is definitely not true, is when I go to the store and I DON'T get eggs, T -> F. If I don't go to the store, I can't lie.
This is vacuous truth. Implication is false only when the premise holds and the conclusion does not. If the premise is false, the implication is true no matter how absurd the conclusion is!!
How do you identify the relation R? Our prof said the condition or formula is x+y divided by 2 and the answer must be an integer. But I am just quite confused bc he gave us a problem to answer but the domain(x) is a vowel and the range(y) is a number. But the formula said that the answer must be an integer to say that xRy. But the set contains vowel and a number, for example (a,2). So my question is can (a,2) be aR2? Hope you can answer my question even after 5 years. Thanks in advance😊
Thank you. You are literally the only person who can explain this in simple English it seems. My professor seems to get joy from talking in the most confusing, and ambiguous terms possible
It's not always their fault, usually they have limited time and try to provide you with the most accurate statements possible. Though I agree, it's much easier to graps a broader concept after learning the intuition and basic intetion of it on simple examples, i wouldn't be here otherwise :P
Try having a teacher who not only does that, but also has a thick Chinese accent.
@@foxxul My teacher only posts links to TH-cam videos...and not Trev or Patrick... I may as well have the lady that designs suits from the Incredibles explaining relations backwards in Dutch while gargling peanut butter. Thank goodness for Google.
@@ald3nte The problem begins where the college teachers go after completing the syllabus instead of actually teaching. The bigger the difference between the score of best performing student and the worst performing student, the worse the teacher is at his/her job
Me 2 lol
x-y != 0
This situation is not transitive. xRy and yRz imply xRz. Consider the case 3R4, 4R3, therefore 3R3. We know 3R3 is 0, so the relationship isn't transitive!
But if we consider the case of 3R4, 4R5, they both imply != 0, therefore 3-5 != 0 which is correct. Why is it not transitive if I can make it work with this example?
well if you're given those specific values and are asked if their relationship is transitive you could say yes, but when given only x and y, their relationship must be transitive for ALL values of the given domain, or else its NOT transitive, even if 99.9% of the possible cases are.
+go duke Thanks for the clarification :)
thanks dude...
but if we say this relation for DISTINCT x, y and z, then it is transitive right?
i just started computer science at uni this year and i got recommended your amazing videos! They are so helpful, even if my main language isnt english i still managed to understand you easily and mathematics have their own universel language which helps even more. Thank you again
I'm in Com Sci too!
@@561Aloha same
@@561Aloha same
I got an A+ on my test.. you're awesome...keep it up 💪👍
Sana all
@@preciouslauranoriega4831 ito hinahanap ko eh HAHAHAHAHAHA
@@nichol071 HAHHAHAHAHA FILIPINNOOOOOOOO
@@nichol071 HAHAHA troo
@@preciouslauranoriega4831 pede paturo?? Naguguluhan paren po tlga ako..
I have just started my 4 year computer science course at university, and discrete math is a module. I look forward to learning more about discrete math with your videos :D
Keep up the good work
i wish more teachers were like you. You make stuff way more intuitive and easy to understand.
A correction: every function may also be represented as a relation (i.e., as a subset of a Cartesian product), but not every relation is a function. Just think of a simple relation like a total order on a set and you will see that a given argument in a relation may be related to many other arguments and does not have to be related to an exclusive output as a function does.
This is such a better explanation than my professor. Everyone in class struggled with the homework on this topic. This helped a bit
0:53 smoothest "L" I've ever seen
your handwriting is so satisfying >.>
true
I was so stuck on transitive and your less than sign example just exploded a eureka, thanks a million.
"and if you don't get confused... I really hope you don't" haha thank you
he explained really well 😏
I'm from Indonesia, and I appreciate this one... Love your explanation
Aku telat nih 😁
11:42 "they want you to play with yourself" oh math, when did you become so enticing?
it is criminal that a 15 min yt video explains this shit way better than 2 hours of lectures at a uni im paying to go to
u save me while I'm studying last minute for my midterm tmr 🤦🏻♀️ thank you so much
This is a very good explanation for basic introduction, for one that doesn't learn them at othe sources.
play with your self......:) more teachers should be like this
+Astra Adams Students who want to play with themselves are encouraged to sit in the back of the room with other students that want to play with themselves, that way they can play with each other instead ;)
I thought I was the only one that caught that xD
TheTrevTutor Dawg wtf I was tryna understand discrete math but here you are making sex jokes. Smh math nerds wildin' these days
TheTrevTutor omfg lol
The diagrams for reflexive symmetric and transitive help SO much.
you and people like organic chem tutor are god sends
So clear thank you. I don't know why my professor is turned on by using such big words. Your explanation was clear and easy to understand.
i like that you use different collor for each section. it makes things much easier to swallow
Thank you for the awesome explanatory videos! I have been preparing for my final exams by watching your videos. I hope I will pass the lesson.
Thanks for the video! Better than my university prof.
hi dear.
9 years and it's still very comprehensive
Hey, I just wanna let you know that this video helped me so damn much. Thank you very much, you have no idea how good it felt when I finally had that eureka moment after many weeks having no idea what my professor was talking about. Keep doing what you're doing bro.
Your explanation is so easy to understand. Hope our Professors could teach as good as you.
This guy is a fu*king genius. He explained everything so simply.
Glad I found your channel before finals! Wish I found it in August, will recommend! Great stuff, thank you!
How's your exams go?
Oh wow! You are a star, keep doing this.
You are an excelent Prof., thank you very much, it was very clever to introduce the logic tables on the symmetric relationship.
Great work! Cheers from Spain and Perú
hello
identity relation is what he explained in the place of reflexive!
reflexive relation's are those in which elements are related to themselves, also they can be related to any other element!
peace out.
Thank you for putting these tutorials together for all of us that struggle with Math. Very appreciated
11:44 Play with myself? Set Theory doesn't get me quite that excited...
Great videos tho man. Thanks.
god my college discrete math course was so bad that straight up skipping the lecture and only studying the slides and videos like you got me better grades
What about Anti- Symmetric and irreflexive relationships?
That's nice, You are helping me so much right now.
About to take a discrete structures test, wish me luck!
What about Irreflexive and antisymetric?
Oskar Midbøe A relation R on a set X is antisymmetric if and only if x R y and y R x implies x = y.
A relation is irreflexive if and only if every point x is not related to itself. An example of this is inequality since it’s illogical for an element say x to be not equal itself.
@@XXgamemaster
i appreciate that replay, thank you
wow , I spend so many hours understanding this but you are awesome !!!
the first video that is very good on this topic 👍
Great video! Helped me cram for my final
not all relations are functions as implicitly stated in your video. Apart from that great video, thanks.
When determining reflexivity, symmetry, and transitivity at 11:31. Could we analyze x - y != 0 as x != y instead? Just seems like it may be a simpler approach. Do you see anything wrong w/ that approach?
I noticed you actually worked out x != y at the end of the video. My question is: is there anything wrong with manipulating the variables around the operator? I'm assuming this should not change reflexivity, transitivity or symmetry. (i.e. x - y + z = 0 is the same as figuring out the relations of x = y - z, etc.)
There's nothing wrong with that. In fact, it's easier to understand x != y rather than x-y != 0 for this kind of question, so the fact that you were able to change that and work with it better is a good thing.
The last example doesn't work when (xRy, yRz -> xRz) and x=z. For instance, 1-2 doesn't equal 0, 2-1 doesn't equal 0, but 1-1 equals zero.
was struggling so harddd thankk youuuuuuu
What? This guy is a mind reader and a math god ?!?!?!
you made a comment on symmetry: "if the first part is false, then the whole thing is true". Does this logic also apply to the antisymmetric property?
At 15:05 for proofing it is not transitive you took x and z same. don't you think it's wrong to take same value ? All x,y,z must be of different values? If you still says we can take same values for x and z then in that case, for symmetric property we also can take x and y same and which will say (let) 2=2 and hence it do not hold symmetric property as well.
Appreciate you response on my query. Thanks. You are doing awesome job :)
I love your course, the explanation is powerful..
"Cool it with the anti-symmetric remarks!"
amazing now i finally understand thanks!!!
You my man, are fantastic, please never stop haha
Thank you for the Video
11:53
4 - 3 ≠ 0, True
3 - 4 ≠ 0, True
4 - 4 ≠ 0 False
True implies False is False so it's not transitive... I think
Yes it's not transitive
sufficient explanation
Thanks 👍,I really understood the relations concept
you r super hero ,, u saved me thanks
Also add anti symm relation ...... its aRb and bRa then a=b
Am really grateful 🙏 your explanation was superb , it really helped me , thanks sooo much , looking forward to more of your videos 😊
at 12:25 for the trans part, if x=1, y=0, z=1, then x-z is actually = 0
At 0:05, the sheet shows: "If a,b elt of R, we write xRy" You probably meant If x,y elt of R, we write xRy
I'm kinda struggling with this question I have... It's about Hash functions... SHA64 to be specific...
It goes like this:
We have a set of S which is a random long String combination (Cardinality is infinity therefore) and another set of Hex64, which consists of the Hexadecimals {0,1, 2...., 9, A, B, C, D, E, F) and this function takes any String input and generates a 64 digit long hexadecimal number from that string... However, because there are infinite input possibilities, however limited output possibilities (16^64 to be specific) there are bound to be "collisions" and that is when you enter 2 different strings but get the same output... and now my question is this... The following relationship is defined so:
s1 and s2 are elements of S and are related as such:
s1~s2 : Hex64(s1) Hex64(s2)
So it's basically saying that 2 different strings are related, when they cause a collision and it's saying that this is an equivalence relation, and I have to show:
a) How this is reflexive
b) how this is symmetric
c) how this is transitive
Now I understand it in principle, but I'm not sure how to do it mathematically....
Thank you, Very usefull
FYI: X*X is the cartesian product of set X
Your channel helps me a lot thank you very much 😍😊
0:40 Not all relations are functions....
Yea! All functions are relations, but not all relations are functions. How could he say this? OMEGALUL
Yes
In which video can I learn more about equivalence class and relations?
Sir this helped a lot thanks a lot❤️
Extremely helpful. Thank you.
In the example x-y=!0, I assume you don't include negative numbers? Because then the relation would not be symmetric right?for example pick x to be -y?
Excellent video! Thank you!
A question:
Let A = Z the set of integers and let R be define by R b if and only if . is R an equivalence relation?
given fantastic proof
So symmetry is like a conditional truth-value, in that if the antecedent is false, then the compound proposition is automatically true.
I would like to know what app are you using for writing things Trev!
hi i love your videos and requesting if you can make a video on relational
closures
the inflection in your voice at 13:20 so excited about math lol.
Wouldn't it be a type error rather than a syntax error? If function expects input int int and receives float int?
10:39 ............4-4=0 is the example of anti symm
I just have a question about the less than or equal to operator. Instead of taking the constants 3 and 4 while evaluating the symmetry, what if you were to take two of the same constants, say 4(like you did for the second relation)?
The statement would be:
=(4 is less than or equal to 4) implies (4 is less than or equal to 4)
which is:
=(true) implies (true)
therefore the overall statement is:
=true
So my question is why is the operator, less than or equal to, not symmetric?
Amazing work btw! Your videos are clear and coherent, keep up the good work!
When we pick 4 and 4, we are evaluating one scenario. For a relation to be symmetric it had to be synmetric for all choices of x and y.
So yes, (4,4) works, but because we can find a situation where the relation isn't symmetric, we cannot claim that the whole relation is symmetric.
DDRFaQ Ohhh didn't realise it had to be for all choices for x and y. Thank you for clearing it up!
Can u pls tell the software u used here. I found it great
Awesome vid as usual. Thank you for all your help.
relation properties - we observe them.
Thank you for the tutorial...seems like you are the only one who can help me understand what my lec teaches me☺☺
Let D be th divided relation on Z define for all m, n belong to z, mDn = Sm/n define reflexive , symmtric or transitive
That was brilliant! Thank you so much!
So for a set like this {5,10,15,20 ......}, could you say that it follows a relexive relation? Because each element is related to itself?
is there a relation that is reflexive and symmetric but not transitive
We also have something called antisymmetric is it supposed to not be symmetric?
thank you so much really help alot
If P={2,3,4},Q={4,6} and for elements of P and Q a relation y=2x exists, then what will be the relations?
nice vid man, thank you : )
for the use of 4 and 4, i thing is not good since 4 is a common viriable so it should be use to check reflexivity not symmetric only......yRx for which mean different
Thank you
Cool video...can i get a website for learning discrete math
identity relation is both symmetric and antisymmetric?;
can u give more examples for antisymmetric relations?
Let A = {1, 2, 3}. For each of the below relations, indicate which of the 4 properties it
satisfies: reflexive, symmetric, antisymmetric, transitive.
(i) {(1, 1),(1, 2),(2, 3)}
(ii) {(1, 1),(1, 2),(2, 1),(2, 2),(3, 3)}
(iii) {(1, 1),(2, 2),(3, 3),(2, 3)}
Could you help me understand what relations I am working with above? I understand the first one is
+Anon Ymous The first one is not
Wow thank you. So for (i), if it were reflexive would it have to have (1,1)(2,2)(3,3) right?
Also I think this would be a good topic do videos on. As I couldnt find any resources explaining how to do this.
+Anon Ymous Yes, you would need to have (1,1), (2,2) and (3,3).
Im not really understanding 11:08 you said 4-4!=0 is true because it being false makes it true. Can you clarify this for me some more? Does that only happen in a transitive case and is it like a rule that has to be memorized?
en.wikipedia.org/wiki/Material_conditional#Truth_table
Suppose I say: "If I go to the store, I will get eggs."
The only time that statement is definitely not true, is when I go to the store and I DON'T get eggs, T -> F. If I don't go to the store, I can't lie.
This is vacuous truth. Implication is false only when the premise holds and the conclusion does not. If the premise is false, the implication is true no matter how absurd the conclusion is!!
How do you identify the relation R? Our prof said the condition or formula is x+y divided by 2 and the answer must be an integer. But I am just quite confused bc he gave us a problem to answer but the domain(x) is a vowel and the range(y) is a number.
But the formula said that the answer must be an integer to say that xRy. But the set contains vowel and a number, for example (a,2). So my question is can (a,2) be aR2? Hope you can answer my question even after 5 years. Thanks in advance😊