Homomorphism ($f:A\to B$)

A homomorphism is a map between algebraic structures preserving their specified operations. For a single binary operation, this means $f(a\ast b)=f(a)\star f(b)$, where the source and target may use different operation symbols. A group homomorphism preserves the group operation; a ring homomorphism preserves addition and multiplication, with the identity convention specified; a module homomorphism preserves addition and scalar multiplication.

Reduction modulo $5$ is a ring homomorphism $\mathbb{Z}\to \mathbb{Z}/5\mathbb{Z}$: adding or multiplying first and then reducing gives the same residue as reducing first and then operating. For example, $12\cdot 14=168\equiv 3(\mathrm{mod}5)$, while the reduced operands give $2\cdot 4=8\equiv 3(\mathrm{mod}5)$. This lets a complicated integer calculation be projected into simpler finite arithmetic. It also explains why a polynomial equation over the integers imposes necessary modular arithmetic conditions on any integer solution.

A homomorphism can lose information: $0$ and $5$ have the same image under that reduction. An isomorphism loses none of the structure because it has an operation-preserving inverse. Preservation of the operation, rather than preservation of arbitrary labels or sizes, is the essential condition.

A kernel records the information lost by a homomorphism. For a group homomorphism it is the preimage of the identity element, giving the kernel of a group homomorphism; for a ring homomorphism or linear map it is the preimage of zero, giving the kernel of a ring homomorphism or kernel of a linear map. More generally, the relation $a\sim b⟺f(a)=f(b)$ records which inputs the homomorphism identifies. In the group case, its equivalence classes are cosets of the group kernel, as explained by fibres of a group homomorphism are cosets of its kernel.