PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Revision difference : idempotency
Version 7 Version 6
If $(S,*)$ is a magma, then an element $x\in S$ is said to be \emph{idempotent} if $x*x=x$. If every element of $S$ is idempotent, then the binary operation $*$ (or the magma itself) is said to be idempotent. For example, the $\land$ and $\lor$ operations in a lattice are idempotent, because $x\land x = x$ and $x\lor x = x$ for all $x$ in the lattice. If $(S,*)$ is a magma, then an element $x\in S$ is said to be \emph{idempotent} if $x*x=x$. If every element of $S$ is idempotent, then the binary operation $*$ (or the magma itself) is said to be idempotent. For example, the $\land$ and $\lor$ operations in a lattice are idempotent, because $x\land x = x$ and $x\lor x = x$ for all $x$ in the lattice.
A function $f\colon D\to D$ is idempotent if $f\circ f=f$. (This is just a special case of the above definition, the magma in question being the monoid of all functions from $D$ to $D$, with the operation of function composition.) A function $f\colon D\to D$ is idempotent if $f\circ f=f$. (This is just a special case of the above, definition, the magma in question being the monoid of all functions from $D$ to $D$, with the operation of function composition.)
In other words, $f$ is idempotent iff repeated application of $f$ has the same effect as a single application: $f(f(x)) = f(x)$ for all $x\in D$. In other words, $f$ is idempotent iff repeated application of $f$ has the same effect as a single application: $f(f(x)) = f(x)$ for all $x\in D$.