PARTIAL ORDERS - DISCRETE MATHEMATICS
HTML-код
- Опубликовано: 15 сен 2024
- In this video we discuss partial orders and Hasse Diagrams.
Support me on Patreon: bit.ly/2EUdAl3
Visit our website: bit.ly/1zBPlvm
Subscribe on RUclips: bit.ly/1vWiRxW
-Playlists-
Discrete Mathematics 1: • Discrete Math (Sets, L...
Discrete Mathematics 2: • Discrete Math (Countin...
-Recommended Textbooks-
Discrete and Combinatorial Mathematics (Grimaldi): amzn.to/2T0iC53
Discrete Mathematics (Johnsonbaugh): amzn.to/2Hh7H41
Discrete Mathematics and Its Applications (Rosen): amzn.to/3lUgrMI
Book of Proof (Hammack): amzn.to/35eEbVg
Like us on Facebook: on. 1vWwDRc
We introduce the concept of asymmetry and partial orders.
Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.
It's 4 am rn, and I have an exam at 10, wish me luck
How did it go?
Khaled B first of all, that type of sleeping pattern is damaging to you in the long run please fix this. Second of all, how did you do in the exam?
@@navjotsingh2251
He's dead
Hope your exams went ok
F
Have my discrete math exam tomorrow morning. Just wanted to say thanks for the videos, they've been great!!
Have mine this afternoon, this just saved my ass for antisymmetric relations
@@atidyshirt have mine this friday
@@bestyoueverhad.2408 gl
Have mine tomorrow ahaha
so howd u guys do?
You have such a great channel man! I'm studying computer Science and our math prof. does nothing except read out definitions and write them on the board all lecture long... You're really helping me understand what we're actually learning! Cheers man!
I like how you mentioned that Hasse Diagrams are used to make relation diagrams clearer, this video has cleared some of my doubts about PO, thank you so much!
I've found this video after I had some struggle with understanding "How to prove it" book, which opened a world of beautifull set theory for me.
Thank you for those.
You're a better teacher than my lecturer.
This is one topic I think I never really figured out from my CS classes. Thank you for the clear and concise explanation!
it's easier if you explain transitive inequalities this way
2
Thanks for this. Definitely will start binging on these lectures from now on! I love that you explain what each concept means as you introduce them. My professor just mentions them and sort of expects us to know what it means. If it wasn't for this video, I wouldn't have known to have NOT thought of antisymmetry as "not symmetric". No wonder I was confused the entire lecture. Granted, I could have asked out loud, but our class is very quiet. It seems this course is particularly a very intimidating one.
12:46 Trevor you said "We know in a partial order, everything is going to be symmetric", but I think you meant antisymmetric? Correct me if I'm wrong, wanna make sure I'm understanding this correctly.
same
He probably actually meant reflexive, because the next step was removing the reflexive arrows.
sir, if u give more video with example of how to find maximal and minimal number n also for greatest nd least elements ,it will b helpful
thax for giving this video
yes please.. great video
my dawg Trev killin it on the teaching game, thx bruh
Thanks Trevor. This is helpful for my Advanced Graph Theory class. We are talking about Comparability Graphs as well as partial order and transitive orientation.
Clean, perfect explantation. You helped a lot! Thanks!
hey @TheTrevTutor , you are a god send for your discrete math lessons! you are really doing a good thing here, really helpful for students with crappy lecturers
3:31: the equivalence class of a is {a,b} by reflexivity.
At 12:48 you mentioned that, "we know that in a partial order, everything is going to be symmetric..." I am quite sure you meant to say, everything is going to be reflexive.
ya i thought a partial order was if R is reflexive, antisymmetric and transitive.
staff.scem.uws.edu.au/cgi-bin/cgiwrap/zhuhan/dmath/dm_readall.cgi?page=20
you're right, he made a lot of mistakes in this video.
I was confused at this part, thx
THe only good discrete math teacher for the whole of the planet
Thanks for explaining why the diagram looks the way it does
Amazing video. Thank you so much. I will pass my exam because of you.
Hi @TheTrevTutor, thank you for this one. It makes more sense to answer my modules. And also, do you have something that discuss Operations on Relations? Like Complement of a relations, inverse of a relation, composite product, R restricted to X and Image of x under R.
dude you are the best I have seen so far keep up the good work..
Thank you for your videos! it makes everything look simple :)
+Marielle Huot Glad I can help :)
2:15, that looks absolutely beautiful!
my prof has a link to your channel posted on the online website lol. Your channel is definitely more helpful than his lectures...so thank you :)
Online Uni is a scam. Im paying 9k this year and all i get is mumbling and a squeaky chair in the recorded lectures. You my man have saved me from failing the maths module in my computer science course.
Love the videos, thanks for doing them! Minor correction: Hasse diagram's are named after Helmut Hasse with Hasse pronounced as hAss-uh
This video was exceptionally difficult to follow... Several places it's difficult to see how you're thinking. For example, from 10:40, it's not clear how you are checking for reflexivity. You are merely pointing out the pairs, and not making it clear how that is a check for reflexivity. Anyways, been watching your videos from scratch, and they are lifesavers! :)
Was the conclusion from 11:10 that the set is antisymmetric or not? Not sure what to make of "Yeah, we're looking good here."
0:31 For symmetry, if A has a *particular* relation to B, then we expect B to have *that same* relation to A. If A is related to B then B is *always* related to A in *some* way. If A is the father of B, a very non-symmetric relation, then B is the son of A.
+TheTrevTutor So is the "=" relation,an antisymmetric relation,because a=b and b = a implies that a = b.
best tutorial about hasse diagrams, thanks !
I couldn't find Partial Orders in the Book of Proof. Does anyone know if it is actually covered in the book?
Thank u Sir. Ur video is helpful. Pls make me understand the difference between equivalence class and equivalence relation and also proofs
You keep saying "we know partial orders are symmetric" but before that you said they are antisymmetric ..... soo which is it?
Partial orders are antisymmetric (example: if a
He meant to say reflexive, as he is talking about removing the reflexive edges in the transfer from a graph representation to a Hasse diagram
Very clearly explained! Thanks a lot.
thanks for the video man, really appreciate it!
12:41 Hasse Diagram, you said it is Symmetric, please explain how. Thanks
I want to know that we delete reflexcivity and transitivity in hasse diagram to make it more clear can i say that 3R1 and 1R2 -->3R2 from hasse diagram since we remove transitivity so i have that doubt plz clear it as soon as possible
your lecture are really nice it helped me alot in learning dicrete mathematics thanks for helping us.
regards
satyam singh
IIT BHUBANESWAR
INDIA
you're confusing equivalence class and equivalence relation
I was following up quite well until reached around 11:09 where you explained antisymmetry so vaguely in comparison with the previously explained Reflective and Transitive conditions, from my point of view, I would have liked a better elaboration there, to be honest, 😂 was trying to figure out what was all this about but anyway... before that, I may say it had been a great video.
thumbs up. Clear and concise.
thank you Sir, as Vajazle had said, they had been great
thank you soo much, all the best for future videos!!!
Thanks. I find 2:45 onwards confusing. Which is set Y?
Lucid explanation. Thanks!
Great vid! Just wondering here if you have two partial orders on a set A, will their union be also a partial order on set A?
You have a video on extremal elements in a poset?? This video was good!
Thank you so much these wonderful videos!
I'm having a trouble with reading mathematics notations related to set theory. How can I improve my awareness of reading these notations? I have a course in college that deals with theories of sets and graphs, and I can't understand all the notations especially when it comes to functions and relations that are a bit complex. What do you recommend?
Thank you for the informative video. Any prospects for making a video on equivlance classes and partitions?
Thank you! This was very helpful.
Perfecto... And thanks for book suggestion.
Thank you so much, it really did help.
thank you this really helped me
Thanks for the video
perfect explanation
Thank you for this lessons!
perfect explanations, thanks
Great vid my guy
ossum video, now i am cleared with poset but still i confused in symmetric and antisymetric relation both look same :(
Very helpful, thanks
Thank u so much , really very helpful !
Omg so helpful!
Thanks mate, you've helped alot :)
I have 2 questions. time line 8:29
1. if 2=2 is reflexive, then why x
Hopefully I can help. x
Thanks alot! I think I got it.
Amazing work!!!
Note: symmetry does not mean aRb implies bRa, but rather aRb iff bRa
aRb -> bRa comes out to be that aRb iff bRa. Since 3R2 implies that 2R3 is in the set. But 2R3 in the set implies 3R2 in the set.
The simple definition of symmetry is for all a,b, aRb -> bRa.
Useful topics....
A = {1, 2} and B = {a, b, c}. Is (a, a) an element of A x B?
I owe you my life.
its very helpful ! thanks sir
Hi need some help here, 'cuz im really confused about the antisymmetric property, why is that the relation "greater than" considered as antisymmetric and for this T = {(a,c),(b,d),(d,c)} in relation to X ={a,b,c,d} is considered also antisymmetric . :( please i'm so confused
i think it would be like what I see from the book is: [x] ^ [y] != {} cz their are reflexive elements in those set. isn't it, if I am not wrong sir?
I'm a bit confused because my professor introduces antisymmetry as aRb bRa when a does not equal b. So i dont quite u derstand why you say aRb bRa when a=b when that is the definition of symmetry
+Deanna Camacho What we're saying is that if aRb and bRa, then a=b. The definition of symmetry states that if aRb then bRa, so we don't always have that a=b.
I have a question, should we not write "x divides y" as y/x ?
Thanks
Thanks, sir.
How many partial order relations are possible on set of n elements?
Thank you so much, man.
Thank You so much!
Thank u 🙏
thanks guys.
Thank you
sir explain with more clarity..u are also confused while checking transitivity and some other parts
How about correcting your mistake? A partial order is antisymmetric, not symmetric.
Great Vid! Cheers!
Life saver💯
can we draw the hasse diagram horizontally?
Great Vid
thank you so much .grt work
you have saved my exam! TT
When we draw hoss diagram we have to Remove a reflexive sign?
Please where can I find the 3rd part of relations, I really need it
is there any video for closure of relations ?
Hey man i have a question. If partial order and total order both are asymmetric, reflexive and transitive then what is the difference between them?
A binary relation is a partial order if it is reflexive, antisymmetric and transitive. But inside partial relations, there are other two types of relations: total order and well-order. What I am saying is that every total ordered set is partially ordered too.
The conditions for a partial ordered set to be a totally ordered is that every pair is comparable (xRy is always true)
I have a question: Why this set if reflexive, by definiton A relation in which all the elements follow the property A→A.
All the elements are related to themselves is known as reflexive relation. So if there are ordered couples, which are not reflexive as in the example (1,1) (1,2) (1,3)... then it shouldnt be reflexive?
+Kalo953 A relation is reflexive, not ordered pairs. If all the pairs of (x,x) are in the relation, then the relation is reflexive. If there are additional pairs, it doesn't change anything.
okay, i understand now, also can i ask why the ordered pairs in the hasse diagram seem to be incomplete. R subset of AxA => AxA = {(1,1),(1,2),(1,3),(1,4)(2,1),(2,2),(2,3),(2,4),(3,1),(3,2),(3,3),(3,4),(4,1)(4,2),(4,3),(4,4)} ?
+Kalo953 I don't understand what you mean by "incomplete".
ahh I think i understand it now. You only write the pairs that are related. I thought at first that you write the result of the cartesian product of A^2.
the number of mistakes/misspeaks in this video is quite high. be careful people.
For a given poset can we have more than one Hasse diagram?
trev wheres the video that explains upper/lower bounds?
its an irony that youtubers does way better job than mos prof n ta n la that we pay for