| Two general facts: First, the structure map of an initial algebra on Set is always a bijection. |
|
| After having recalled the basic definitions, we present two algorithms, reciprocical to each other, that give the wanted bijection. |
|
| In fact, it is easy to see that this bijection provides a conjugacy. |
|
| Rabh's proof defines a bijection between a disk and a triangle. |
|
| There is a bijection between every pair of equivalence classes: the inverse of a representative of the first equivalence class, composed with a representative of the second. |
|
| Note in particular that a function is a bijection if and only if it's both an injection and a surjection. |
|
| Removal of all references to partial bijection. |
|
| Moreover, we deal with finite structures only, hence f is surjective too, and consequently it is a bijection. |
|
| Purpose of this generator is to offer a bijection between model and code. |
|
