Difference between revisions of "Idempotence"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
(Created page with "'''Idempotence''' ({{IPAc-en|ˌ|aɪ|d|ɨ|m|ˈ|p|oʊ|t|ən|s}} {{respell|EYE|dəm|POH|təns}}{{fact|date=July 2015}}) is the property of certain operation (mathematics)|opera...")
 
(See also)
Line 19: Line 19:
  
 
* [[Mathematics]]
 
* [[Mathematics]]
* [[computer science]]
+
* [[Computer science]]
  
 
== External links ==  
 
== External links ==  
  
 
* [https://en.wikipedia.org/wiki/Idempotence Idempotence] @ Wikipedia
 
* [https://en.wikipedia.org/wiki/Idempotence Idempotence] @ Wikipedia

Revision as of 04:55, 12 September 2015

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: expand, organize, display math, cross-reference, illustrate.)

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:

  • 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

External links