vault backup: 2026-03-09 17:46:37
This commit is contained in:
@@ -50,12 +50,21 @@ $$
|
||||
"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 "
|
||||
$$
|
||||
### 1. Apply converse to $Q$:
|
||||
$$
|
||||
Q^top = {(2, 2), (3, 3), (1, 2)}
|
||||
$$
|
||||
### 2. Perform Composition:
|
||||
Look at each pair in $R$, check if $Q^top$ has a pair starting with se second element in that pair:
|
||||
|
||||
$$
|
||||
(1, 2) -> (2, 2) => (1, 2) \
|
||||
(3, 3) -> (3, 3) => (3, 3) \
|
||||
(3, 1) -> (1, 2) => (3, 2)
|
||||
$$
|
||||
### 3. Result:
|
||||
$$ Q^top compose R = {(1, 2), (3, 2), (3, 3)} $$
|
||||
|
||||
## Orders
|
||||
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