vault backup: 2025-03-18 16:15:04
This commit is contained in:
parent
1e853b88f7
commit
9322e5e273
1 changed files with 3 additions and 1 deletions
|
@ -49,7 +49,9 @@ We now show that $\to$ is acyclic.
|
||||||
|
|
||||||
3. It cannot have cycles with more than 2 edges:
|
3. It cannot have cycles with more than 2 edges:
|
||||||
- by contradiction, consider a shortest cycle
|
- by contradiction, consider a shortest cycle
|
||||||
- adjacent edges cannot belong to the same order (not both $\to_X$ ), otw. the cycle would be shortable, because of transitivity of the total order!
|
- adjacent edges cannot belong to the same order (e.g. not both $\to_X$), otw. the cycle would be shortable, because of transitivity of the total order!
|
||||||
|
- adjacent edges cannot belong to orders on different objects
|
||||||
|
- this would mean that an operation is involved in both $\to_X$ and $\to_Y$
|
||||||
|
|
||||||
|
|
||||||
> [!PDF|red] class 6, p.6> we would have a cycle of length
|
> [!PDF|red] class 6, p.6> we would have a cycle of length
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue