Relations and Functions: What is a Partial Order Relation? (POSET) Part 2

In this video, we define what it means for a relation to be a partial order (POSET). In particular, we define a partial order relation to be one that is reflexive, anti-symmetric, and transitive. We construct a partial ordering by considering a relation and closing it under the three requirements, hence ending with a partial order relation.

[@ymaysernameuay1113]

Best teacher ever

[@ZenathD]

Crystal clear explanation! Thanks man

[@AP-dh9tb]

thank you sir .

[@MrRCS-wq5bt]

Wonderful video!

[@mominanoor3882]

an outstanding explanation ........

[@Papaabe]

Using a graph to find the preimage of the set of a function

[@Papaabe]

Please I need a video on the preimage of a function with solved examples

[@JP-xm3qf]

on min 4:09, for R3, would it still be reflexive even if we take out (8,8)? as it would still be a subset of A, just without all the reflexive pairs.

[@MathsAndStats]

Hi Julio. If you remove any reflexive pair the relation immediately becomes non-reflexive. Reflexive relations need to have all the reflexive pairs. Also, the relation contains ordered pairs of a certain form, the original set A doesn't contain them forms and so the relation would never be a subset. I hope this helps. Kindest regards, Julio. Jonathan.

[@JP-xm3qf]

@@MathsAndStats Thank you very much Prof.!, you explain very good!