|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| '''Idempotence''' ({{IPAc-en|ˌ|aɪ|d|ɨ|m|ˈ|p|oʊ|t|ən|s}} {{respell|EYE|dəm|POH|təns}}) 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. The concept of idempotence arises in a number of places in [[abstract algebra]] (in particular, in the theory of [[projector (linear algebra)|projector]]s and [[closure operator]]s) and [[functional programming]] (in which it is connected to the property of [[Referential transparency (computer science)|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 ''[[wikt:idem|idem]]'' + ''[[wikt:potence|potence]]'' (same + power).
| | この土地は非常に密接に守られている。しかし蘭シュウは、後でいくつかの知人に語った。私の息子が生まれた。神とそれを考えて、小さな贈り物にの多くを与えた王のすべて。 '<br><br>'贈り物？'秦のSi目は秦ゆうネックを保持している、秦ゆうを自沈サルのように、ライトアップ。秦ゆうぶら下げ体は述べています。 「お父さん、何贈り物？ '<br><br>'あなたは最初にダウンして、私はあなたを与える。'秦ゆうは言った [http://www.lamartcorp.com/modules/mod_menu/rakuten_cl_10.php クリスチャンルブタン 銀座]。<br><br>秦Siは秦ゆう本体から飛び降り、突然、非常に迅速に応答した。アニーリング工程は、その後秦ゆうを見た [http://www.lamartcorp.com/modules/mod_menu/rakuten_cl_6.php クリスチャンルブタン 中古]。すぐに秦ゆうHuixiu [http://www.lamartcorp.com/modules/mod_menu/rakuten_cl_4.php クリスチャンルブタン セール]。私は秦の前で見たが、すぐに多くの奇妙なガジェットがあったと思います。<br>与えるために贈り物を考えて<br>秦。小説楽しい場所のほとんどは [http://www.lamartcorp.com/modules/mod_menu/rakuten_cl_10.php クリスチャンルブタン 店舗]。主にあまりにも貴重ではないし、最大3つのストリームが不分明Lingbaoのみ [http://www.lamartcorp.com/modules/mod_menu/rakuten_cl_11.php クリスチャンルブタン 偽物]。しかし、この記事では、子どもたちがであるためには実際には非常に良いです。<br>ヨーヨーの目は色の驚きでいっぱい丸みを帯びた、鳥と<br>「すごい。 '秦のSiの目が突然広い。<br><br>ごちそうで、非常に活発な。<br><br>秦ゆう江沢民李は「かわいい面と彼の息子を見て |
| | | 相关的主题文章： |
| There are several meanings of idempotence, depending on what the concept is applied to:
| | <ul> |
| | | |
| *A [[unary operation]] (or [[function (mathematics)|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., {{nowrap|''ƒ''(''ƒ''(''x'')) ≡ ''ƒ''(''x'')}}. For example, the [[absolute value]]: {{nowrap|abs(abs(''x'')) ≡ abs(''x'')}}.
| | <li>[http://www.puppystation.com/sports/index.cgi http://www.puppystation.com/sports/index.cgi]</li> |
| *A [[binary operation]] is idempotent if, whenever it is applied to two equal values, it gives that value as the result. For example, the operation giving the [[maximum]] value of two values is idempotent: {{nowrap|max (''x'', ''x'') ≡ ''x''}}.
| | |
| *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 the value as the result. For example, the number 1 is an idempotent of [[multiplication]]: {{nowrap|1 × 1 {{=}} 1}}.
| | <li>[http://www.cdqc888.com/plus/feedback.php?aid=5 http://www.cdqc888.com/plus/feedback.php?aid=5]</li> |
| | | |
| == Definitions ==
| | <li>[http://www.0936so.com/thread-250171-1-1.html http://www.0936so.com/thread-250171-1-1.html]</li> |
| | | |
| ===Unary operation===
| | </ul> |
| A [[unary operation]] <math>f</math>, that is, a map from some set <math>S</math> into itself, is called idempotent if, for all <math>x</math> in <math>S</math>,
| |
| :<math>f\!\left(f\!\left(x\right)\right) = f\!\left(x\right)</math>.
| |
| In particular, the [[identity function]] <math>\text{id}_S</math>, defined by <math>1 = \text{id}_S\left(x\right) = x</math>, is idempotent, as is the [[constant function]] <math>K_c</math>, where <math>c</math> is an element of <math>S</math>, defined by <math>1 = K_c\left(x\right) = c</math>.
| |
| An important class of idempotent functions is given by [[projection (linear algebra)|projection]]s in a [[vector space]]. An example of a projection is the function <math>\pi_{xy}</math> defined by <math>1 = \pi_{xy}\left(x, y, z\right) = \left(x, y, 0\right)</math>, which projects an arbitrary point in 3D space to a point on the <math>xy</math>-[[plane (mathematics)|plane]], where the third coordinate (<math>z</math>) is equal to 0.
| |
| | |
| A unary operation <math>f\colon S \to S</math> is idempotent if it maps each element of <math>S</math> to a [[Fixed point (mathematics)|fixed point]] of <math>f</math>. We can partition a set with <math>n</math> elements into <math>k</math> chosen fixed points and <math>n-k</math> non-fixed points, and then <math>k^{n-k}</math> is the number of different idempotent functions. Hence, taking into account all possible partitions,
| |
| :<math>\sum_{k=0}^n {n \choose k} k^{n-k}</math>
| |
| is the total number of possible idempotent functions on the set. The [[integer sequence]] of the number of idempotent functions as given by the sum above for <math>n = \left\{0, 1, 2, \dots\right\}</math> starts with <math>1, 1, 3, 10, 41, 196, 1057, 6322, 41393, \dots</math>. {{OEIS|A000248}}
| |
| | |
| ===Idempotent elements and binary operations===
| |
| {{main|Idempotent element}}
| |
| Given a [[binary operation]] <math>\bigstar</math> on a set <math>S</math>, an element <math>x</math> is said to be idempotent (with respect to <math>\bigstar</math>) if:
| |
| :<math>x \,\bigstar\, x = x</math>. | |
| In particular an [[identity element]] of <math>\bigstar</math>, if it exists, is idempotent with respect to the operation <math>\bigstar</math>.
| |
| The binary operation itself is called idempotent if every element of <math>S</math> is idempotent. That is, for all <math>x \in S</math> when <math>\in</math> denotes set membership:
| |
| :<math>x \,\bigstar\, x = x</math>.
| |
| For example, the operations of [[union (set theory)|set union]] and [[intersection (set theory)|set intersection]] are both idempotent, as are [[logical conjunction]] and [[logical disjunction]], and, in general, the [[meet (mathematics)|meet]] and [[join (mathematics)|join]] operations of a [[lattice (order)|lattice]].
| |
| | |
| ===Connections===
| |
| | |
| The connections between the three notions are as follows.
| |
| | |
| *The statement that the binary operation ★ on a set ''S'' is idempotent, is equivalent to the statement that every element of ''S'' is idempotent for ★.
| |
| | |
| *The defining property of unary idempotence, {{nowrap|1=''f''(''f''(''x'')) = ''f''(''x'')}} for ''x'' in the domain of ''f'', can equivalently be rewritten as {{nowrap|1=''f'' ∘ ''f'' = ''f''}}, using the binary operation of [[function composition]] denoted by ∘. Thus, the statement that ''f'' is an idempotent unary operation on ''S'' is equivalent to the statement that ''f'' is an idempotent element with respect to the function composition operation ∘ on functions from ''S'' to ''S''.
| |
| | |
| ==Common examples==
| |
| | |
| === Functions ===
| |
| As mentioned above, the identity map and the constant maps are always idempotent maps. The [[absolute value]] function of a [[real number|real]] or [[complex number|complex]] argument, and the [[floor function]] of a real argument are idempotent.
| |
| The function that assigns to every subset <math>U</math> of some [[topological space]] <math>X</math>'' the [[closure (topology)|closure]] of <math>U</math> is idempotent on the [[power set]] <math>\mathcal{P}\left(X\right)</math> of <math>X</math>. It is an example of a [[closure operator]]; all closure operators are idempotent functions.
| |
| The operation of subtracting the average of a list of numbers from every number in the list is idempotent. For example, consider the numbers <math>3, 6, 8, 8, \text{and }10</math>. The average <math>\frac{\sum_1^n x_n}{n} \,\forall x_n</math> is <math>\frac{3 + 6 + 8 + 8 + 10}{5} = \frac{35}{5} = 7</math>. Subtracting 7 from every number in the list yields <math>\left(-4\right), \left(-1\right), 1, 1, 3</math>. The average <math>\frac{\sum_1^n x_n}{n} \,\forall x_n</math> of that list is <math>\frac{\left(-4\right) + \left(-1\right) + 1 + 1 +3}{5} = \frac{0}{5} = 0</math>. Subtracting 0 from every number in that list yields the same list.
| |
| | |
| === Formal languages ===
| |
| The [[Kleene star]] and [[Kleene plus]] operators used to express repetition in [[Formal grammar|formal languages]] are idempotent.
| |
| | |
| === Idempotent ring elements ===
| |
| {{main |Idempotent element}}
| |
| An idempotent element of a [[ring (mathematics)|ring]] is, by definition, an element that is idempotent for the ring's multiplication.<ref>See [[Michiel Hazewinkel|Hazewinkel]] et al. (2004), p. 2.</ref> That is, for an idempotent element <math>a</math>, <math>a^2 = a</math>.
| |
| Idempotent elements of rings yield [[Indecomposable_module|direct decomposition]]s of [[module (algebra)|modules]], and play a role in describing other homological properties of the ring.
| |
| While "idempotent" usually refers to the multiplication operation of a ring, there are rings in which both operations are idempotent: [[Boolean algebra]]s are such an example.
| |
| | |
| === Other examples ===
| |
| In [[Boolean algebra]], both the [[Logical conjunction|logical and]] and the [[Logical disjunction|logical or]] operations are idempotent. This implies that every element of Boolean algebra is idempotent with respect to both of these operations. Specifically, <math>x \wedge x = x</math> and <math>x \vee x = x \forall x</math> where <math>\forall</math> stands for 'for all.'
| |
| In [[linear algebra]], [[projection (linear algebra)|projection]]s are idempotent. In fact, the projections of a vector space are exactly the idempotent elements of the ring of [[linear transformation]]s of the vector space. After fixing a [[basis (linear algebra)|basis]], it can be shown that the matrix of a projection with respect to this basis is an idempotent matrix.
| |
| An [[idempotent semiring]] (also sometimes called a ''dioid'') is a semiring whose ''addition'' (not multiplication) is idempotent. If both operations of the semiring are idempotent, then the semiring is called ''doubly idempotent''.<ref>Gondran & Minoux. ''Graphs, dioids and semirings''. Springer, 2008, p. 34</ref>
| |
| | |
| ==Computer science meaning==
| |
| {{See also|Referential transparency (computer science)|Reentrant (subroutine)|Stable sort}}
| |
| | |
| In [[computer science]], the term '''idempotent''' is used more comprehensively to describe an operation that will produce the same results if executed once or multiple times.<ref name=IBM>{{cite web|last=Rodriguez|first=Alex|title=RESTful Web services: The basics|url=https://www.ibm.com/developerworks/webservices/library/ws-restful/|work=IBM developerWorks|publisher=IBM|accessdate=24 April 2013}}</ref> This may have a different meaning depending on the context in which it is applied. In the case of [[Method (computer science)|method]]s or [[subroutine]] calls with [[Side effect (computer science)|side effects]], for instance, it means that the modified state remains the same after the first call. In [[functional programming]], though, an idempotent function is one that has the property {{nowrap|1=''f''(''f''(''x'')) = ''f''(''x'')}} for any value ''x''.<ref>http://foldoc.org/idempotent</ref>
| |
| | |
| This is a very useful property in many situations, as it means that an operation can be repeated or retried as often as necessary without causing unintended effects. With non-idempotent operations, the algorithm may have to keep track of whether the operation was already performed or not.
| |
| | |
| === Examples ===
| |
| | |
| Looking up some customer's name and address in a [[database]] are typically idempotent (in fact [[wiktionary:nullipotent|''nullipotent'']]), since this will not cause the database to change. Similarly, changing a customer's address is typically idempotent, because the final address will be the same no matter how many times it is submitted. However, placing an order for a car for the customer is typically not idempotent, since running the method/call several times will lead to several orders being placed. Canceling an order is idempotent, because the order remains canceled no matter how many requests are made.
| |
| | |
| A composition of idempotent methods or subroutines, however, is not necessarily idempotent if a later method in the sequence changes a value that an earlier method depends on – idempotence is not closed under composition. For example, suppose the initial value of a variable is 3 and there is a sequence that reads the variable, then changes it to 5, and then reads it again. Each step in the sequence is idempotent: both steps reading the variable have no side effects and changing a variable to 5 will always have the same effect no matter how many times it is executed. Nonetheless, executing the entire sequence once produces the output (3, 5), but executing it a second time produces the output (5, 5), so the sequence is not idempotent.<ref name="httpStd-methods">W3C, [http://www.w3.org/Protocols/rfc2616/rfc2616-sec9.html HyperText Transfer Protocol v. 1.1 Methods]. See also [[Hypertext Transfer Protocol|HyperText Transfer Protocol]].</ref>
| |
| | |
| In the [[Hypertext Transfer Protocol|HyperText Transfer Protocol (HTTP)]], idempotence and [[Hypertext Transfer Protocol#Safe methods|safety]] are the major attributes that separate HTTP verbs. Of the major HTTP verbs, GET, PUT, and DELETE are idempotent (if implemented according to the standard), but POST is not.<ref name="httpStd-methods" /> These verbs represent very abstract operations in computer science: GET retrieves a resource; PUT stores content at a resource; and DELETE eliminates a resource. As in the example above, reading data usually has no side effects, so it is idempotent (in fact nullipotent). Storing a given set of content is usually idempotent, as the final value stored remains the same after each execution. And deleting something is generally idempotent, as the end result is always the absence of the thing deleted.
| |
| | |
| In [[Event Stream Processing]], idempotence refers to the ability of a system to produce the same outcome, even if an event or message is received more than once.
| |
| | |
| In a [[load-store architecture]], instructions that might possibly cause a [[page fault]] are idempotent. So if a page fault occurs, the OS can load the page from disk and then simply re-execute the faulted instruction.
| |
| In a processor where such instructions are not idempotent, dealing with page faults is [[Motorola 68000#Interrupts|much more complex]].
| |
| | |
| ==Applied examples==
| |
| Applied examples that many people could encounter in their day-to-day lives include [[elevator]] call buttons and crosswalk buttons.<ref>http://web.archive.org/web/20110523081716/http://www.nclabor.com/elevator/geartrac.pdf For example, this design specification includes detailed algorithm for when elevator cars will respond to subsequent calls for service</ref> The initial activation of the button moves the system into a requesting state, until the request is satisfied. Subsequent activations of the button between the initial activation and the request being satisfied have no effect. Many people will subsequently activate an idempotent button, even if consciously aware of the rational information that it will have no effect.
| |
| | |
| ==See also==
| |
| *[[Closure operator]]
| |
| *[[Fixed point (mathematics)]]
| |
| *[[Idempotent of a code]]
| |
| *[[Nilpotent]]
| |
| *[[Idempotent matrix]]
| |
| *[[List of matrices]]
| |
| *[[Pure function]]
| |
| *[[Referential transparency (computer science)]]
| |
| *[[Iterated function]]
| |
| *[[Biordered set]]
| |
| *[[Involution (mathematics)]]
| |
| | |
| ==References==
| |
| {{Reflist}}
| |
| | |
| == Further reading ==
| |
| * “[http://foldoc.org/idempotent idempotent]” at [[FOLDOC]]
| |
| *{{citation
| |
| |author=Goodearl, K. R.
| |
| |title=von Neumann regular rings
| |
| |edition=2
| |
| |publisher=Robert E. Krieger Publishing Co. Inc.
| |
| |place=Malabar, FL
| |
| |year=1991
| |
| |pages=xviii+412
| |
| |isbn=0-89464-632-X
| |
| |mr=1150975 (93m:16006)}}
| |
| *{{citation
| |
| |author1=[[Hazewinkel, Michiel]]
| |
| |author2=Gubareni, Nadiya
| |
| |author3=Kirichenko, V. V.
| |
| |title=Algebras, rings and modules. vol. 1
| |
| |series=Mathematics and its Applications
| |
| |volume=575
| |
| |publisher=Kluwer Academic Publishers
| |
| |place=Dordrecht
| |
| |year=2004
| |
| |pages=xii+380
| |
| |isbn=1-4020-2690-0
| |
| |mr=2106764 (2006a:16001)}}
| |
| *{{citation
| |
| |author=Lam, T. Y.
| |
| |title=A first course in noncommutative rings
| |
| |series=Graduate Texts in Mathematics
| |
| |volume=131
| |
| |edition=2
| |
| |publisher=Springer-Verlag
| |
| |place=New York
| |
| |year=2001
| |
| |pages=xx+385
| |
| |isbn=0-387-95183-0
| |
| |mr=1838439 (2002c:16001)}}
| |
| * {{Lang Algebra|edition=3}} p. 443
| |
| * Peirce, Benjamin. [http://www.math.harvard.edu/history/peirce_algebra/index.html ''Linear Associative Algebra''] 1870.
| |
| *{{citation
| |
| |author1=Polcino Milies, César | |
| |author2=Sehgal, Sudarshan K.
| |
| |title=An introduction to group rings
| |
| |series=Algebras and Applications
| |
| |volume=1
| |
| |publisher=Kluwer Academic Publishers
| |
| |place=Dordrecht
| |
| |year=2002
| |
| |pages=xii+371
| |
| |isbn=1-4020-0238-6
| |
| |mr=1896125 (2003b:16026)}}
| |
| | |
| == External links ==
| |
| {{wiktionary}}
| |
| * {{springer|title=Idempotent|id=p/i050080}}
| |
| | |
| {{wikibooks}}
| |
| {{wikiversity | Portal:Computer Science}}
| |
| | |
| [[Category:Abstract algebra]]
| |
| [[Category:Closure operators]]
| |
| [[Category:Mathematical relations]]
| |
| [[Category:Theoretical computer science]]
| |
| [[Category:Binary operations]]
| |