 Identity element

In mathematics, an identity element (or neutral element) is a special type of element of a set with respect to a binary operation on that set. It leaves other elements unchanged when combined with them. This is used for groups and related concepts.
The term identity element is often shortened to identity (as will be done in this article) when there is no possibility of confusion.
Let (S,*) be a set S with a binary operation * on it (known as a magma). Then an element e of S is called a left identity if e * a = a for all a in S, and a right identity if a * e = a for all a in S. If e is both a left identity and a right identity, then it is called a twosided identity, or simply an identity.
An identity with respect to addition is called an additive identity (often denoted as 0) and an identity with respect to multiplication is called a multiplicative identity (often denoted as 1). The distinction is used most often for sets that support both binary operations, such as rings. The multiplicative identity is often called the unit in the latter context, where, unfortunately, a unit is also sometimes used to mean an element with a multiplicative inverse.
Examples
set operation identity real numbers + (addition) 0 real numbers · (multiplication) 1 real numbers a^{b} (exponentiation) 1 (right identity only) positive integers least common multiple 1 nonnegative integers greatest common divisor 0 (under most definitions of GCD) mbyn matrices + (addition) matrix of all zeroes nbyn square matrices · (multiplication) I_{n} (matrix with 1 on diagonal
and 0 elsewhere)all functions from a set M to itself ∘ (function composition) identity function all functions from a set M to itself * (convolution) δ (Dirac delta) character strings, lists concatenation empty string, empty list extended real numbers minimum/infimum +∞ extended real numbers maximum/supremum −∞ subsets of a set M ∩ (intersection) M sets ∪ (union) { } (empty set) boolean logic ∧ (logical and) ⊤ (truth) boolean logic ∨ (logical or) ⊥ (falsity) boolean logic ⊕ (Exclusive or) ⊥ (falsity) compact surfaces # (connected sum) S² only two elements {e, f} * defined by
e * e = f * e = e and
f * f = e * f = fboth e and f are left identities,
but there is no right identity
and no twosided identityProperties
As the last example shows, it is possible for (S, *) to have several left identities. In fact, every element can be a left identity. Similarly, there can be several right identities. But if there is both a right identity and a left identity, then they are equal and there is just a single twosided identity. To see this, note that if l is a left identity and r is a right identity then l = l * r = r. In particular, there can never be more than one twosided identity. If there were two, e and f, then e * f would have to be equal to both e and f.
It is also quite possible for (S, *) to have no identity element. The most common example of this is the cross product of vectors. The absence of an identity element is related to the fact that the direction of any nonzero cross product is always orthogonal to any element multiplied – so that it is not possible to obtain a nonzero vector in the same direction as the original. Another example would be the additive semigroup of positive natural numbers.
See also
 Absorbing element
 Inverse element
 Additive inverse
 Monoid
 Unital
 Quasigroup
 Properties weaker than having an identity
References
 M. Kilp, U. Knauer, A.V. Mikhalev, Monoids, Acts and Categories with Applications to Wreath Products and Graphs, De Gruyter Expositions in Mathematics vol. 29, Walter de Gruyter, 2000, ISBN 3110152487, p. 1415
Categories: Abstract algebra
 Algebra
 Binary operations
 One
Wikimedia Foundation. 2010.