Math 2.0

Order, lattices, ordered algebraic structures Definition

Partial order

Builds on PreorderAntisymmetric relation

Definition

Let AA be a set. A partial order on AA is a preorder ≤\le on AA that is antisymmetric. For all a,b,c∈Aa, b, c \in A:

  1. a≤aa \le a;
  2. a≤ba \le b and b≤ab \le a imply a=ba = b;
  3. a≤ba \le b and b≤cb \le c imply a≤ca \le c.

The pair (A,≤)(A, \le) is a partially ordered set.

Remarks

Examples are ≤\le on ℝ\mathbb{R}, divisibility on ℕ\mathbb{N}, and ⊆\subseteq on the power set of a set. "Partial" means that two elements need not be comparable: neither {1}⊆{2}\{1\} \subseteq \{2\} nor {2}⊆{1}\{2\} \subseteq \{1\}. The strict order a<ba < b means a≤ba \le b and a≠ba \neq b. A finite poset can be drawn as a Hasse diagram.

Reading path

To understand this page from the ground up, read these 15 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Proposition concept
  3. Set definition
  4. Implication definition
  5. Predicate definition
  6. Ordered pair definition
  7. Universal quantifier definition
  8. Cartesian product definition
  9. Subset definition
  10. Binary relation definition
  11. Antisymmetric relation definition
  12. Reflexive relation definition
  13. Transitive relation definition
  14. Preorder definition
  15. Partial order definition

Where this leads

110 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Partially_ordered_set, lead section
About this page