The property of an operation or element such that applying the operation multiple times has the same effect as applying it once. For a binary operation written ·, idempotence means x·x = x for all x (or for a specific element x). For unary operations f, idempotence is f(f(x)) = f(x).

Principle

Repeated application stabilizes after the first application; the operation acts as a projection or absorption on its fixed points, collapsing repeated iterations to a single outcome.

Demonstration

Boolean OR: a ∨ a = a. The max operation on a totally ordered set is idempotent: max(x,x) = x. Projection matrices P with P^2 = P are idempotent linear operators. A closure operator cl satisfies cl(cl(X)) = cl(X).

Misapplication

Assuming ordinary addition or multiplication of numbers is idempotent (1+1 = 1 or 2·2 = 2) is false. Treating an operator as idempotent without checking its behavior (e.g., some averaging operators are not idempotent) produces incorrect simplifications.

Consequence

Idempotence simplifies repeated expressions, characterizes projections, semilattices and closure operators, and often leads to simplification laws (e.g., absorption in lattices) and canonical normal forms.

Reversal

Opposite behaviors include nilpotence (repeated application yields zero) or involution (double application returns original value rather than stabilizing immediately), which have different algebraic consequences.

Boundary

Distinguish between idempotent operations (the whole operation yields idempotence) and idempotent elements (elements x with x·x = x) in a non-idempotent operation. Idempotence may hold only on a subset of elements.

Semantic Tension

Idempotence is sometimes confused with involution (f∘f = identity) or with elements fixed by an operator; idempotence means stability under repetition, not necessarily invertibility or identity behavior.

Synthesis

Idempotent Law captures the idea that an operation, or certain elements under it, are stable under repetition: once applied, further applications do not change the result, yielding projections, semilattice structure, and simplification of iterated expressions.