vault backup: 2026-03-09 17:46:37
This commit is contained in:
6
.obsidian/workspace.json
vendored
6
.obsidian/workspace.json
vendored
@@ -27,12 +27,12 @@
|
|||||||
"state": {
|
"state": {
|
||||||
"type": "markdown",
|
"type": "markdown",
|
||||||
"state": {
|
"state": {
|
||||||
"file": "DAS/Relations.md",
|
"file": "DAS/Functions.md",
|
||||||
"mode": "source",
|
"mode": "source",
|
||||||
"source": false
|
"source": false
|
||||||
},
|
},
|
||||||
"icon": "lucide-file",
|
"icon": "lucide-file",
|
||||||
"title": "Relations"
|
"title": "Functions"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
],
|
],
|
||||||
@@ -196,9 +196,9 @@
|
|||||||
},
|
},
|
||||||
"active": "16b88a8bc6c6b6e0",
|
"active": "16b88a8bc6c6b6e0",
|
||||||
"lastOpenFiles": [
|
"lastOpenFiles": [
|
||||||
|
"DAS/Relations.md",
|
||||||
"DAS/Logic.md",
|
"DAS/Logic.md",
|
||||||
"DAS/Set Theory.md",
|
"DAS/Set Theory.md",
|
||||||
"DAS/Relations.md",
|
|
||||||
"DAS/Functions.md",
|
"DAS/Functions.md",
|
||||||
"mathe/notation.md",
|
"mathe/notation.md",
|
||||||
"Studium.md",
|
"Studium.md",
|
||||||
|
|||||||
@@ -18,7 +18,6 @@ For any $x in X$ the output $f(x)$ is an element of $Y$.
|
|||||||
### Injectivity
|
### Injectivity
|
||||||
A function is _injective_ if every element in $y in f(x)$ has _at most_ one matching $x in X$.
|
A function is _injective_ if every element in $y in f(x)$ has _at most_ one matching $x in X$.
|
||||||
- $forall y in Y,exists excl x in X : f(x) = y$
|
- $forall y in Y,exists excl x in X : f(x) = y$
|
||||||
|
|
||||||
### Surjectivity
|
### Surjectivity
|
||||||
A function is _surjective_ if every element $y in Y$ has _at minimum_ one matching $x in X$
|
A function is _surjective_ if every element $y in Y$ has _at minimum_ one matching $x in X$
|
||||||
- $forall y in Y, exists x in X : f(x) = y$
|
- $forall y in Y, exists x in X : f(x) = y$
|
||||||
|
|||||||
@@ -50,12 +50,21 @@ $$
|
|||||||
"Compute" Q^top compose R "with:"\
|
"Compute" Q^top compose R "with:"\
|
||||||
Q = {(2, 2), (3, 3), (2, 1)} \
|
Q = {(2, 2), (3, 3), (2, 1)} \
|
||||||
R = {(1, 2), (3, 3), (3, 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
|
## 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