Maximal vs upper bound in a POSET I am studying the concept of a Partially Ordered Set, abbreviated as POSET and one author says that a

"a maximal element need not be an upper bound."

I tried browsing the net to find an example of the preceding statement, but can't find a lucky one.
Can someone provide me an example of this? Thanks in advance...
 A: Let $X$ be a set of at least two elements. Define a partial order $\prec$ on $X$ by,
$$
a\prec b\Leftrightarrow a=b,\text{ for all }a,b\in X.
$$
Let $A\subseteq X$ be a subset containing at least two elements. Clearly each element of $A$ is a maximal element of,  $A$ but $A$ does not have any upper bound. Hence, a maximal element need not be an upper bound.
A: As a more complete reference on the two terms, see the Wikipedia page on Zorn's Lemma and the links to the two terms from there.
For the specific terms, it helps to consider that maximal element and non-dominated element are used synonymously (the latter is much clearer to me). A maximal element $x$ is one such that there is no $y > x$ (no $y$ that dominates $x$). An upper bound of some set, on the other hand is some $x$ such that $x \ge y$ for all $y$. So, the maximal element need not be related to all elements, but an upper bound does.
In a partial ordering, an upper bound is a maximal element, but the reverse is not necessarily true (and finding a maximal element is often possible when finding an upper bound is not). In a total ordering, the two are equivalent.
Trivial example of the difference: let $\{x, y\}$ be a poset such that $x$ and $y$ are not related. $x$ is a maximal element (it is not the case that $y > x$) but not an upper bound (because we don't have $y \le x$ either).
