Difference between revisions of "Idempotence"

Revision as of 10:08, 26 February 2016

Idempotence (Template:IPAc-en Template:RespellTemplate:Fact) is the property of certain operations in mathematics and computer science, that can be applied multiple times without changing the result beyond the initial application.

(TO DO: fix template.)

Description

The concept of idempotence arises in a number of places in abstract algebra (in particular, in the theory of projectors and closure operators) and functional programming (in which it is connected to the property of referential transparency).

The term was introduced by Benjamin Peirce<ref>Polcino & Sehgal (2002), p. 127.</ref> in the context of elements of algebras that remain invariant when raised to a positive integer power, and literally means "(the quality of having) the same power", from idem + potence (same + power).

There are several meanings of idempotence, depending on what the concept is applied to:

• A unary operation (or function) is idempotent if, whenever it is applied twice to any value, it gives the same result as if it were applied once; i.e., Template:Nowrap. For example, the absolute value function, where Template:Nowrap.
• A binary operation is idempotent if, whenever it is applied to two equal values, it gives that value as the result. For example, the function giving the maximum value of two equal values is idempotent: Template:Nowrap.

• Given a binary operation, an idempotent element (or simply an "idempotent") for the operation is a value for which the operation, when given that value for both of its operands, gives that value as the result. For example, the number 1 is an idempotent of multiplication: Template:Nowrap.

See also

• Mathematics
• Computer science
• Identification scheme
• Primary key
• Set (mathematics)
• Unique identifier

External links

• Idempotence @ Wikipedia