For the concepts in algebra, see Idempotent (ring theory) and Idempotent matrix.
On/Off buttons of a train's destination sign control panel. Pressing the On button (green) is an idempotent operation, since it has the same effect whether done once or multiple times. Likewise, pressing Off is idempotent.
Idempotence (UK: /ˌɪdɛmˈpoʊtəns/,[1]US: /ˈaɪdəm-/)[2] is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. 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 American mathematician Benjamin Peirce in 1870[3][4] 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).
^"idempotence". Oxford English Dictionary (3rd ed.). Oxford University Press. 2010.
^"idempotent". Merriam-Webster. Archived from the original on 2016-10-19.
^Original manuscript of 1870 lecture before National Academy of Sciences (Washington, DC, USA): Peirce, Benjamin (1870) "Linear associative algebra" From pages 16-17: "When an expression which is raised to the square or any higher power vanishes, it may be called nilpotent; but when raised to a square or higher power it gives itself as the result, it may be called idempotent.
The defining equation of nilpotent and idempotent expressions are respectively An = 0 and An = A; but with reference to idempotent expressions, it will always be assumed that they are of the form An = A unless it be otherwise distinctly stated."
Printed: Peirce, Benjamin (1881). "Linear associative algebra". American Journal of Mathematics. 4 (1): 97–229. See p. 104.
Reprinted: Peirce, Benjamin (1882). Linear Associative Algebra(PDF). New York, New York, USA: D. Van Nostrand. p. 8.
Idempotence (UK: /ˌɪdɛmˈpoʊtəns/, US: /ˈaɪdəm-/) is the property of certain operations in mathematics and computer science whereby they can be applied...
Idempotency of entailment is a property of logical systems that states that one may derive the same consequences from many instances of a hypothesis as...
associativity: yes distributivity: with various operations, especially with or idempotency: yes monotonicity: yes truth-preserving: yes When all inputs are true...
co-idempotence. An interpretation of idempotence is that: 'Idempotence means that there is no “noise” left in the smoothed data and co-idempotence means...
x_{2},\ldots x_{n})} Idempotence ∀ x , M ( x , x , … x ) = x {\displaystyle \forall x,\;M(x,x,\ldots x)=x} Monotonicity and idempotence together imply that...
failure of commutativity would then appear as a failure of symmetry. Idempotence of ∧ and ∨ can be visualized by sliding the two circles together and...
respectively. These two definitions of fractional-part function also provide idempotence. The fractional part defined via difference from ⌊ ⌋ is usually denoted...
test. Any similar matrices of an idempotent matrix are also idempotent. Idempotency is conserved under a change of basis. This can be shown through multiplication...
that, given a particular input, will always produce the same output Idempotence – Property of operations whereby they can be applied multiple times without...
and Tierney showed that the conditions it needs to satisfy are just idempotence and the preservation of finite intersections. These "topologies" are...
| a | | = | a | {\displaystyle {\bigl |}\left|a\right|{\bigr |}=|a|} Idempotence (the absolute value of the absolute value is the absolute value) | −...
t-norm (that is, minimum). It has the axioms of BL plus an axiom of idempotence of conjunction, and its models are called G-algebras. Product fuzzy logic...
a field GF(2), and as in any field they obey the distributive law.) Idempotency: no Monotonicity: no Truth-preserving: no When all inputs are true, the...
Michael; Schlund, Maxmilian (2011), An extension of Parikh's theorem beyond idempotence, arXiv:1112.2864, Bibcode:2011arXiv1112.2864L Strahler, A. N. (1952)...
^{5}\right)\psi ={\begin{pmatrix}0&0\\0&I_{2}\end{pmatrix}}\psi ~.} The idempotence of the chiral projections is manifest. By slightly abusing the notation...
framework. It provides a runtime with built-in reliable message delivery and idempotency. Holger Mueller of Constellation Research wondered how well DBOS the...
Global Information