Pointwise periodic self-map (source code)

= Pointwise periodic self-map
{title2=$\forall x\ \exists n_x\geq1:\ f^{n_x}(x)=x$}

A <pointwise periodic self-map> is a <self-map> $f:X\to X$ for which every $x\in X$ satisfies $f^{n_x}(x)=x$ for some <positive integer> $n_x$ depending on $x$. Powers denote repeated <function composition>.

Such a <self-map> is a <bijection>. For <surjectivity>, $f^{n_x-1}(x)$ is a preimage of $x$. For <injectivity>, suppose $f(x)=f(y)$ and choose a common multiple $N$ of periods of $x$ and $y$; applying $f^{N-1}$ gives $x=y$. Thus $X$ decomposes into disjoint finite <permutation cycles>.

There need not be one positive $N$ with $f^N=\operatorname{id}$ on an <infinite set>. Take the disjoint <union> of one cycle of every positive length: any such $N$ would have to be divisible by every <positive integer>. On a <finite set>, in contrast, the <least common multiple> of the finitely many cycle lengths is a common period.