Equivalence Relations Flashcards
relation
set of ordered pairs
with the following properties :
1. reflexivity
2. symmetry
3. antisymmetry
4. transitivity
equivalence relations
relation R is an equivalence relation on set X if it is reflective, symmetric and transitive ( denoted by ~ (tilde)) = is equivalent to
partial orderings
A relation on X is a partial ordering on X if and only if it is reflective, antisymmetric and transitive ( denoted with ≤ )
y≥x
is the inverse of the relation y≤ x
x<y
x precedes y
y>x
y succeeds x
upper bound
A is said to be bounded above if and only if there exists x ∈ X such that a ≤ x for all a ∈ A
lower bound
A is said to be bounded above if and only if there exists x ∈ X such that a ≥ x for all a ∈ A
supremum
least upper bound
Infinium
highest lower bound
linear orderings
every pair of elements x and y in A is comparable under ≤. A linearly ordered set is also called a chain.