Idempotence: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (new entry, just a stub) |
(No difference)
|
Revision as of 16:57, 12 December 2008
In mathematics idempotence is the property of an operation that repeated application has no effect.
A binary operation is idempotent if
- for all x:
equivalently, every element is an idempotent element for .
Examples of idempotent binary operations include join and meet in a lattice.
A unary operation (function from a set to itself) π is idempotent if it is an idempotent element for function composition, π2 = π.