-Morphisms
Last updated
Last updated
e.g.,
homomorphism: \begin{align*} f(m + n) &= (m + n) \mod 4\\ &=(m \mod 4) + (n \mod 4) \\ &= f(m) + f(n) \end{align*}
e.g.,
homomorphism: \begin{align*} f(m + n) &= 2(m + n) \\ &= 2m + 2n \\ &= f(m) + f(n) \end{align*}
e.g.,
homomorphism: \begin{align*} f(m + n) &= 3(m + n) \mod 4 \\ &= (3m + 3n) \mod 4 \\ &= (3m \mod 4) + (3n \mod 4) \\ &= f(m) + f(n) \end{align*}
bijection: Since , multiplication by is invertible. Its inverse is multiplication by itself, because .
e.g., the example above is also an example of automorphism. TODO: Find a better example.
Written by from