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: 68
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:
Unknown environment 'enumerate'
}}}		 A relation ≤ is a partial order on a set S if it has:
 * Reflexivity: a≤a for all a∈S.
 * Antisymmetry: a≤b and b≤a⇒a=b.
 * Transitivity: a≤b and b≤c⇒a≤c.

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

A relation ≤ is a partial order on a set S if it has:

  • Reflexivity: a≤a for all a∈S.
  • Antisymmetry: a≤b and b≤a⇒a=b.
  • Transitivity: a≤b and b≤c⇒a≤c.

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