Lesson plan

preorder

4≤y//4 is a preorder on the natural numbers. It corresponds to the equivalence relation x E y defined by x//4=y//4. The set of equivalence classes is partially ordered, and thus can be shown as a Hasse diagram (depicted). In mathematics, in particular in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. The name is meant to suggest that preorders are almost partial orders, but not quite, as they are not necessarily antisymmetric. A natural example of a preorder is the divides relation "x divides y" between integers. This relation is reflexive as every integer divides itself. It is also transitive. But it is not antisymmetric, because e.g. 1 divides -1 and -1 divides 1 , but -1 is not equal to 1 . It is to this preorder that "least" refers in the phrase "least common multiple" (in contrast, using the natural order on integers, e.g. 4 and 6 have the common multiples 24 , 12 , 0 , -12 , -24 , ..., but no least one). Preorders are closely related to equivalence relations and (non-strict) partial orders. Both of these are special cases of a preorder: an antisymmetric preorder is a partial order, and a symmetric preorder is an equivalence relation. Moreover, a preorder on a set X can equivalently be defined as an equivalence relation on X , together with a partial order on the set of equivalence class, cf. picture.…

Back to article

Article summary

4≤y//4 is a preorder on the natural numbers. It corresponds to the equivalence relation x E y defined by x//4=y//4. The set of equivalence classes is partially ordered, and thus can be shown as a Hasse diagram (depicted). In mathematics, in particular in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. The name is meant to suggest that preorders are almost partial orders, but not quite, as they are not necessarily antisymmetric. A natural example of a preorder is the divides relation "x divides y" between integers. This relation is reflexive as every integer divides itself. It is also transitive. But it is not antisymmetric, because e.g. 1 divides -1 and -1 divides 1 , but -1 is not equal to 1 . It is to this preorder that "least" refers in the phrase "least common multiple" (in contrast, using the natural order on integers, e.g. 4 and 6 have the common multiples 24 , 12 , 0 , -12 , -24 , ..., but no least one). Preorders are closely related to equivalence relations and (non-strict) partial orders. Both of these are special cases of a preorder: an antisymmetric preorder is a partial order, and a symmetric preorder is an equivalence relation. Moreover, a preorder on a set X can equivalently be defined as an equivalence relation on X , together with a partial order on the set of equivalence class, cf. picture.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.