Idempotent element: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (New entry, just a stub) |
imported>Richard Pinch m (typo) |
||
Line 1: | Line 1: | ||
In [[algebra]], an '''idempotent element''' with respect to a [[binary operation]] is an element which is unchanged when combined with itself. | In [[algebra]], an '''idempotent element''' with respect to a [[binary operation]] is an element which is unchanged when combined with itself. | ||
Formally, let <math>\star</math> be a binary operation on a set ''X''. An element ''E'' of ''X'' is an | Formally, let <math>\star</math> be a binary operation on a set ''X''. An element ''E'' of ''X'' is an idempotent for <math>\star</math> if | ||
:<math>E \star E = E . \,</math> | :<math>E \star E = E . \,</math> |
Revision as of 15:47, 12 December 2008
In algebra, an idempotent element with respect to a binary operation is an element which is unchanged when combined with itself.
Formally, let be a binary operation on a set X. An element E of X is an idempotent for if
Examples include an identity element or an absorbing element. An important class of examples is formed by considering operators on a set (functions from a set to itself) under function composition: for example, endomorphisms of a vector space. Here the idempotents are projections, corresponding to direct sum decompositions. For example, the idempotent matrix
is an idempotent for matrix multiplication corresponding to the operation of projection onto the x-axis along the y-axis.