Partial Orders
Given a partial order
on a set
:
An element
is maximal if
An element
is minimal if
An element
is a greatest element if
An element
is a least element if
Let
.
An element
is a lower bound of
if
An element
is a greatest lower bound (glb) of
if
is a
lower bound of
, and for every lower bound
of
,
.
Let
.
An element
is a upper bound of
if
An element
is a least upper bound (lub) of
if
is an
upper bound of
, and for every upper bound
of
,
.
Example: project planning.
| Code | Activity | Depends on: |
| A | Rent concert hall | B |
| B | Get sponsors | - |
| C | Print programs | D,A,J |
| D | Get program ads | E |
| E | Plan advertising | B |
| F | Print tickets | G |
| G | Set ticket prices | B |
| H | Advertise | E |
| I | Sell tickets | F |
| J | Get program material | - |
| K | Hold concert | G,C,I |
A partition of a set
is a collection of
sets
(
) so that:
, and
Each subset
is called a block of the partition.
An equivalence relation
on a set
partitions the set into
equivalence classes.
An equivalence class is a subset of
so that every pair of elements
from the class is in the relation, while any pair of an element in the
class and an element outside the class is not in the relation.
Every element in
is in exactly one of the equivalence classes.
Notation:
denotes the equivalence class of which
is a
member. Note that
if and only if
.
Example:
Let
be the relation on the set
where
if
and
, divided by 5, have the same remainder.
Equivalence classes:
,
,
,
,
.