vault backup: 2026-03-09 17:33:38
This commit is contained in:
@@ -44,6 +44,19 @@ A binary relation is a relation $R$ between _exactly two_ elements $a in R$ and
|
|||||||
|
|
||||||
## Converse Relation
|
## Converse Relation
|
||||||
$C^top$ or $C^(-1)$ is the relation that occurs if the elements of a _binary relation_ are switched.
|
$C^top$ or $C^(-1)$ is the relation that occurs if the elements of a _binary relation_ are switched.
|
||||||
|
|
||||||
|
## Composition of Relations - Example
|
||||||
|
$$
|
||||||
|
"Compute" Q^top compose R "with:"\
|
||||||
|
Q = {(2, 2), (3, 3), (2, 1)} \
|
||||||
|
R = {(1, 2), (3, 3), (3, 1)} \
|
||||||
|
\
|
||||||
|
"1. Apply converse to Q:"\
|
||||||
|
Q^top = {(2, 2), (3, 3), (1, 2)}
|
||||||
|
|
||||||
|
"2. Check "
|
||||||
|
$$
|
||||||
|
|
||||||
## Orders
|
## Orders
|
||||||
An **Order** is a mathematical way to sort, rank or compare elements within a set, where some elements come "before" and "after" others.
|
An **Order** is a mathematical way to sort, rank or compare elements within a set, where some elements come "before" and "after" others.
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user