Lecture 17: Equivalence Relations and Partial Orders

Sick of ads?‚Äč Sign up for MathVids Premium
Taught by ArsDigita
  • Currently 4.0/5 Stars.
5797 views | 2 ratings
Lesson Description:

Learn what an equivalence relation is, what partial orders are, and how they fit into Discrete Math.

More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/

Additional Resources:
Questions answered by this video:
  • What does mod or modulo mean and how does it relate to number theory and discrete math?
  • What does it mean for numbers to be equivalent modulo 3?
  • What does it mean for a set to be a subset of another set?
  • What are some properties of relations?
  • What does it mean for a relation to be symmetric or anti-symmetric?
  • What does it mean for a relation to be reflexive?
  • What does it mean for a relation to be transitive?
  • If a relation is not transitive, how can you make it transitive?
  • What is transitive closure of a relation?
  • What are equivalence relations?
  • How can you prove that something is an equivalence relation?
  • What are partial orders?
  • What are Hasse diagrams?
  • What is total ordering of a set?
  • What is an interval order?
  • How can you determine how many planes are needed to cover a certain number of routes with various intervals using partial ordering?
  • What is an antichain and how can you determine the size of an antichain?
  • What are posets and what do they have to do with scheduling problems?
  • Staff Review

    • Currently 4.0/5 Stars.
    This lesson starts off explaining the reflexive, symmetric, and transitive properties of relations. Then, equivalence relations are explained along with partial orders. Some really important basic ideas of relations are covered in this lecture. Also, an application to plane flights is included at the end of the lecture, which is quite interesting.