Differences between revisions 2 and 4 (spanning 2 versions)
⇤ ← Revision 2 as of 2007-02-14 17:15:20 →
Size: 362
Editor: dot
Comment:
← Revision 4 as of 2020-01-26 22:54:17 → ⇥
Size: 314
Editor: scot
Comment:
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
{{{#!latex2
A relation $\le$ is a partial order on a set $S$ if it has:
\begin{enumerate}
\item Reflexivity: $a \le a$ for all $a \in S$.
\item Antisymmetry: $a \le b$ and $ b \le a \Rightarrow a=b$.
\item Transitivity: $a \le b$ and $b \le c \Rightarrow a \le c$.
\end{enumerate}
}}}		 A relation $$\le$$ is a partial order on a set $$S$$ if it has:
 * Reflexivity: $$a \le a$$ for all $$a \in S$$.
 * Antisymmetry: $$a \le b$$ and $$b \le a \Rightarrow a=b$$.
 * Transitivity: $$a \le b$$ and $$b \le c \Rightarrow a \le c$$.

Definition: Partial Order (see PoSet for partially ordered set).

A relation $$\le$$ is a partial order on a set $$S$$ if it has:

  • Reflexivity: $$a \le a$$ for all $$a \in S$$.
  • Antisymmetry: $$a \le b$$ and $$b \le a \Rightarrow a=b$$.
  • Transitivity: $$a \le b$$ and $$b \le c \Rightarrow a \le c$$.

PartialOrder (last edited 2020-01-26 22:54:17 by scot)