# Partial Order Relation

DEFINITION1: Let $X$ be a set and $R\subset{X\times{X}}$. If the relation $R$ is reflexive, antisymmetric and transitive, then the relation $R$ is called a "partial order relation" and denoted by $R=\le$ in general. If "$\le$" is a partial order relation over a set $X$, then $(X,\le)$ is called "partially ordered set" or shortly "poset".

DEFINITION2: Let $x$ and $y$ are elements of a partially ordered set $X$. If it holds “$x\le{y}\lor{y\le{x}}$”, then $x$ and $y$ are called “comparable”. Otherwise they are called “incomparable”.

DEFINITION3: If $x$ and $y$ are comparable for all $x,y$ in a partially ordered set $(X,\le)$, then the relation $\le$ is called a “total order” and the set $X$ is called a “totally ordered set” or “linearly ordered set”.

DEFINITION4: Let $(X,\le)$ be a partially ordered set and $A\subset{X}$. If $(A,\le)$ is a totally ordered set, then $A$ is called a “chain” in $X$.

DEFINITION5: Let $(X,\le)$ be a partially ordered set and $A\subset{X}$. If there exists an element $a^{*}\in{A}$ satisfying $a\le{a^{*}}$ for all $a\in{A}$, then $a^{*}$ is called the maximum of $A$, and if there exists an element $a_{*}\in{A}$ satisfying $a_{*}\le{a}$ for all $a\in{A}$, then $a_{*}$ is called the minimum of $A$. The minimum and the maximum of $A$ are denoted by $\min{A}$ and $\max{A}$ respectively.
{"found_math": true, "script_math_tex": 40, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 40, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}