Identity element (neutral element)

Definition and basic facts

Given a set S with a binary operation ⋆, an element e in S is a (two-sided) identity if for every x in S, e ⋆ x = x and x ⋆ e = x. In structures where associativity holds (for example, monoids and groups), the identity is unique: no two distinct elements can both satisfy the identity conditions. In non-associative contexts one may distinguish left identities (e ⋆ x = x) from right identities (x ⋆ e = x), and a structure can lack a two-sided identity entirely.

Common examples

• Addition of numbers: 0 is the additive identity because 0 + a = a for every number a.
• Multiplication: 1 is the multiplicative identity since 1 · a = a for all numbers a (in rings and fields this is the multiplicative unit).
• In a group, the identity (often denoted e or 1) must exist and every element has an inverse relative to it; this is one of the defining axioms of a group.

Properties and uses

The identity element acts as a neutral reference and is central to defining inverses, powers, and homomorphisms. Many algebraic proofs begin by inserting or canceling the identity. In computation, identity values serve as initial accumulators (0 for sums, 1 for products). In linear algebra and category theory analogous notions occur as the identity matrix and the identity morphism, which serve as neutral elements for matrix multiplication and composition.

Notes and distinctions

Although identities are unique when they exist in associative systems, some algebraic contexts permit distinct left and right identities or none at all. Recognizing whether a structure has an identity—and whether it is two-sided—helps determine which further constructions (such as inverses or units) are possible and which algebraic tools apply.