9/23 Partial order relations

Partial order relation

Partial ordered sets

A relation $R$ on a set $A$ is called a partial order if $R$ is reflexive, antisymmetric and transitive. The set $A$ together with the partial order $R$ is called a partially ordered set, or simply a poset, and we denote this poset by $(A,R)$.

antisymmetric:
A relation $R$ on a set $A$ is antisytmmetric if whenever $aRb$, then $b℟a$, unless $a=b$

The notation $a\preccurlyeq b$ denotes that $(a,b)\in R$
Note that the symbol $\preccurlyeq$ is used to denote the relation in any poset, not just the lessthan or equals relation.
The notation $a\prec b$ denotes that $a\preccurlyeq b,buta\ne b$

Comparable

The elements $a$ and $b$ of a poset $(A,\preccurlyeq )$ are called comparable if either $a\preccurlyeq borb\preccurlyeq a$.
When $a$ and $b$ are elements of $A$ such that neither $a\preccurlyeq b$ nor $b\preccurlyeq a$, $a$ and $b$ are called incomparable

total order (linearly order)

If $(A,\preccurlyeq )$ is a poset and every elements of $A$ are comparable, $A$ is called a totally ordered or linearly ordered set, and $\preccurlyeq$ is called a total order or linear order.

A totally ordered set is also called a chain.

Hasse Diagram

1. partial order is reflexive , thus we should delete all loop from the digraph
2. Because a partial order is transitive, we do not have to show those edges that must be present because of transitivity.
3. If we assume that all edges are pointed upward, we do not have to show the directions of the edges

Extremal elements of partially ordered sets

maximal & minimal element

Let $(A,\preccurlyeq )$ is a poset. An elements $a\in A$ is called a maximal element of $A$ if there is no elements $c$ in $A$ such that $a\prec c$.
An elements $b\in A$ is called a minimal element of $A$ if there is no elements $c$ in $A$ such that $c\prec b$

A poset can have more than one maximal or minimal element.

greatest element & least element

Let $(A,\preccurlyeq )$ is a poset.
An element $a\in A$ is called a greatest element of $A$ if $x\preccurlyeq a$ for all $x\in A$
An elements $a\in A$ is called a least element of $A$ if $a\preccurlyeq x$ for all $x\in A$

upper bound & lower bound

Let $(A,\preccurlyeq )$ is a poset, and $B\subseteq A$.
An element $a\in A$ is called an upper bound of $B$ if $b\preccurlyeq a$ for all $b\in B$.
An element $a\in A$ is called a lower bound of $B$ if $a\preccurlyeq b$ for all $b\in B$

LUB & GLB

Let $(A,\preccurlyeq )$ be a poset, and $B\subseteq A$.

An element $a\in A$ is called a least upper bound of $B$$(LUB(B))$, if $a$ is an upper bound of $B$ and $a\preccurlyeq a^{\prime }$, whenever $a^{\prime }$ is an upper bound of $B$.
An element $a\in A$ is called a greatest lower bound of $B$ $(GLB(B))$, if a lower bound of $B$ and $a^{\prime }\preccurlyeq a$, whenever $a^{\prime }$ is an lower bound of $B$

---

Function

Definition

Let $A$ and $B$ be nonempty sets.
A relation is an everywhere function from $A$ to $B$, denoted by
$$f:A\to B$$
If for every $a\in A$, there is one and only $b\in B$ so that $(a,b)\in f$, we say that $b=f(a)$

The set $A$ is called the domain of the function $f$.
If $X\subseteq A$, then f ( X ) = { f ( a ) ∣ a ∈ X } f(X)=\{f(a)|a\in X\} f(X)={f(a)∣a∈X} is called the image of $X$, the image of $A$ itself is called the range of $f$, we write $R_f$

If $Y\subseteq B$, then f − 1 ( Y ) = { a ∣ f ( a ) ∈ Y } f^{-1}(Y)=\{a|f(a)\in Y\} f−1(Y)={a∣f(a)∈Y} is called the preimage of $Y$.

A function $f:A\to B$ is called a mapping. If $(a,b)\in f$ so that $b=f(a)$, then we say that the element $a$ is mapped to element $b$.

Everywhere function

1. $Domf=A$
2. if $(a,b)$ and $(a,b^{\prime })\in f$, then $b=b^{\prime }$

in other words
$$DomR=A$$