MathGloss

A partially ordered set is a set XX together with a homogeneous relation \leq such that for all x,y,zXx,y,z\in X,

  1. \leq is reflexive, i.e. xxx\leq x;
  2. \leq is antisymmetric, i.e. if xyx\leq y and yxy\leq x then x=yx=y;
  3. \leq is transitive, i.e. if xyx\leq y and yzy\leq z then xzx\leq z.