In mathematics, an identity element, or neutral element, of a binary operation operating on a set is an element of the set that leaves unchanged every element of the set when the operation is applied.^{[1]}^{[2]} This concept is used in algebraic structures such as groups and rings. The term identity element is often shortened to identity (as in the case of additive identity and multiplicative identity)^{[3]} when there is no possibility of confusion, but the identity implicitly depends on the binary operation it is associated with.
Let (S, ∗) be a set S equipped with a binary operation ∗. Then an element e of S is called a left identity if e ∗ s = s for all s in S, and a right identity if s ∗ e = s for all s in S.^{[4]} If e is both a left identity and a right identity, then it is called a two-sided identity, or simply an identity.^{[5]}^{[6]}^{[7]}^{[8]}^{[9]}
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).^{[3]} These need not be ordinary addition and multiplication—as the underlying operation could be rather arbitrary. In the case of a group for example, the identity element is sometimes simply denoted by the symbol . The distinction between additive and multiplicative identity is used most often for sets that support both binary operations, such as rings, integral domains, and fields. The multiplicative identity is often called unity in the latter context (a ring with unity).^{[10]}^{[11]}^{[12]} This should not be confused with a unit in ring theory, which is any element having a multiplicative inverse. By its own definition, unity itself is necessarily a unit.^{[13]}^{[14]}
Set | Operation | Identity |
---|---|---|
Real numbers | + (addition) | 0 |
Real numbers | · (multiplication) | 1 |
Complex numbers | + (addition) | 0 |
Complex numbers | · (multiplication) | 1 |
Positive integers | Least common multiple | 1 |
Non-negative integers | Greatest common divisor | 0 (under most definitions of GCD) |
Vectors | Vector addition | Zero vector |
m-by-n matrices | Matrix addition | Zero matrix |
n-by-n square matrices | Matrix multiplication | I_{n} (identity matrix) |
m-by-n matrices | ○ (Hadamard product) | J_{m, n} (matrix of ones) |
All functions from a set, M, to itself | ∘ (function composition) | Identity function |
All distributions on a group, G | ∗ (convolution) | δ (Dirac delta) |
Extended real numbers | Minimum/infimum | +∞ |
Extended real numbers | Maximum/supremum | −∞ |
Subsets of a set M | ∩ (intersection) | M |
Sets | ∪ (union) | ∅ (empty set) |
Strings, lists | Concatenation | Empty string, empty list |
A Boolean algebra | ∧ (logical and) | ⊤ (truth) |
A Boolean algebra | ↔ (logical biconditional) | ⊤ (truth) |
A Boolean algebra | ∨ (logical or) | ⊥ (falsity) |
A Boolean algebra | ⊕ (exclusive or) | ⊥ (falsity) |
Knots | Knot sum | Unknot |
Compact surfaces | # (connected sum) | S^{2} |
Groups | Direct product | Trivial group |
Two elements, {e, f} | ∗ defined by e ∗ e = f ∗ e = e and f ∗ f = e ∗ f = f |
Both e and f are left identities, but there is no right identity and no two-sided identity |
Homogeneous relations on a set X | Relative product | Identity relation |
In the example S = {e,f} with the equalities given, S is a semigroup. It demonstrates the possibility for (S, ∗) to have several left identities. In fact, every element can be a left identity. In a similar manner, there can be several right identities. But if there is both a right identity and a left identity, then they must be equal, resulting in a single two-sided 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 two-sided identity: if there were two, say 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,^{[15]} such as the case of even integers under the multiplication operation.^{[3]} Another common example is the cross product of vectors, where 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. That is, it is not possible to obtain a non-zero vector in the same direction as the original. Yet another example of structure without identity element involves the additive semigroup of positive natural numbers.