Endomorphism (${\mathrm{End}}_{\mathcal{C}}(X)$)

An endomorphism is a morphism $f:X\to X$: its source and target are the same object, with the same specified structure. For a group it is an operation-preserving group homomorphism back into that group; for a vector space it is a linear endomorphism; for a ring it is a ring endomorphism. A self-map must satisfy the chosen compatibility conditions to qualify. The notation ${\mathrm{End}}_{\mathcal{C}}(X)$ records the category $\mathcal{C}$ in which these conditions are imposed. See Riehl, Category Theory in Context, Definition 1.1.10 and the following paragraph.

An endomorphism can lose information or miss part of its target. On the additive integers, $d(k)=2k$ preserves addition and is injective, but is not surjective: no integer maps to $1$. On the vector space ${\mathbb{R}}^2$ over the real numbers, the linear endomorphism $P(x,y)=(x,0)$ loses the second coordinate, so it is neither injective nor surjective. Neither is an automorphism. The same doubling rule becomes a group isomorphism when its target is the additive even integers, as explained under isomorphism.

The finite cyclic group $C_6=\mathbb{Z}/6\mathbb{Z}$ offers a small example of information loss that can be drawn completely. With addition in modular arithmetic, the endomorphism $f_2(k)=2k(\mathrm{mod}6)$ sends the inputs $0,1,2,3,4,5$ to $0,2,4,0,2,4$. Its image of a group homomorphism is $\{0,2,4\}$ and its kernel of a group homomorphism is $\{0,3\}$. Each reached output has two inputs; the other three outputs are missed.

For an endomorphism of a group or ring with a finite underlying set, injectivity is equivalent to surjectivity by counting; either condition makes it an automorphism. The additive integers example shows why the finiteness assumption matters. A linear endomorphism of a finite-dimensional vector space also has equivalent injectivity and surjectivity, this time by the rank-nullity theorem even when its underlying set is infinite.

Self-maps can be iterated without changing the object: $f^2=f\circ f$, $f^3=f\circ f\circ f$, and so on. Composition in a category and the identity morphism make the endomorphisms of a fixed object in a locally small category into a monoid. This packages repeated compatible operations, including irreversible ones, into a single structure.

The general language has a documented historical milestone in the 1945 paper of Samuel Eilenberg and Saunders Mac Lane. They defined categories of objects and compatible maps, and distinguished maps admitting inverses within that category. Their examples included groups, vector spaces, and topological spaces. This gave a common framework for compatible self-maps and their invertible cases. See Eilenberg and Mac Lane, General Theory of Natural Equivalences, pp. 234 and 237–239.

Every endomorphism of the additive finite cyclic group $C_n=\mathbb{Z}/n\mathbb{Z}$, for a positive integer $n$, has the form $f_a(k)=ak(\mathrm{mod}n)$, determined by $a=f_a(1)$. This is the self-map case of homomorphism from a finite cyclic group: repeated addition forces the value at every element. Conversely, each choice of $a$ respects addition and gives a well-defined map on congruence classes.

Let $d=\gcd (n,a)$, the greatest common divisor. The image of a group homomorphism is the cyclic subgroup generated by $a$, with size $n/d$ by order of an element of a finite cyclic group. The kernel of a group homomorphism isIndeed, $ak=0(\mathrm{mod}n)$ is equivalent to $n/d$ dividing $k$, after cancelling $d$ and using coprimality. Consequently $f_a$ is a group automorphism exactly when $a$ and $n$ are coprime. In that case a modular inverse $b$ of $a$ gives $f_a^{-1}=f_b$. This connects reversible self-maps directly to the generators of a finite cyclic group.^[ref]

A linear endomorphism is a linear map from a vector space to itself. In a finite-dimensional basis it is represented by a square matrix. It need not be invertible; an invertible linear endomorphism is an automorphism of the vector space.

For a linear endomorphism $h$ of an $n$-dimensional vector space, the images of a linear map formed by its powers decrease and stabilize by exponent $n$. Indeed, $h^{m+k}v=h^m(h^{k}v)$ proves inclusion. If equality occurs at one step, applying $h$ to both sides proves equality at the next step, and induction gives equality forever after. Before stabilization, every inclusion is strict and lowers dimension by at least one. Starting at dimension $n$ allows at most $n$ such decreases.

By the rank-nullity theorem, the increasing null spaces of the same powers stabilize at the same time. This gives a short proof of the finite-dimensional Fitting decomposition.

Let $T$ be a singular endomorphism of a finite-dimensional vector space. Choose $0\ne u\in \ker T$ and a nonzero linear functional $\lambda$ vanishing on $\mathrm{im}T$, possible because that image of a linear map is proper. Then $S(x)=\lambda (x)u$ is a nonzero rank-one endomorphism with $TS=ST=0$.