# Inverse element

In abstract algebra, the idea of an inverse element generalises concepts of a negation (sign reversal) in relation to addition, and a reciprocal in relation to multiplication. The intuition is of an element that can 'undo' the effect of combination with another given element. While the precise definition of an inverse element varies depending on the algebraic structure involved, these definitions coincide in a group.

The word 'inverse' is derived from Latin: inversus that means 'turned upside down', 'overturned'.

## Formal definitions

### In a unital magma

Let $S$ be a set with a binary operation $*$ (i.e., a magma note that a magma also has closure under the binary operation). If $e$ is an identity element of $(S,*)$ (i.e., S is a unital magma) and $a*b=e$, then $a$ is called a left inverse of $b$ and $b$ is called a right inverse of $a$. If an element $x$ is both a left inverse and a right inverse of $y$, then $x$ is called a two-sided inverse, or simply an inverse, of $y$. An element with a two-sided inverse in $S$ is called invertible in $S$. An element with an inverse element only on one side is left invertible, resp. right invertible. A unital magma in which all elements are invertible is called a loop. A loop whose binary operation satisfies the associative law is a group.

Just like $(S,*)$ can have several left identities or several right identities, it is possible for an element to have several left inverses or several right inverses (but note that their definition above uses a two-sided identity $e$). It can even have several left inverses and several right inverses.

If the operation $*$ is associative then if an element has both a left inverse and a right inverse, they are equal. In other words, in a monoid (an associative unital magma) every element has at most one inverse (as defined in this section). In a monoid, the set of (left and right) invertible elements is a group, called the group of units of $S$, and denoted by $U(S)$ or H1.

A left-invertible element is left-cancellative, and analogously for right and two-sided.

### In a semigroup

The definition in the previous section generalizes the notion of inverse in group relative to the notion of identity. It's also possible, albeit less obvious, to generalize the notion of an inverse by dropping the identity element but keeping associativity, i.e. in a semigroup.

In a semigroup $S$ an element x is called (von Neumann) regular if there exists some element z in S such that xzx = x; z is sometimes called a pseudoinverse. An element y is called (simply) an inverse of x if xyx = x and y = yxy. Every regular element has at least one inverse: if x = xzx then it is easy to verify that y = zxz is an inverse of x as defined in this section. Another easy to prove fact: if y is an inverse of x then e = xy and f = yx are idempotents, that is ee = e and ff = f. Thus, every pair of (mutually) inverse elements gives rise to two idempotents, and ex = xf = x, ye = fy = y, and e acts as a left identity on x, while f acts a right identity, and the left/right roles are reversed for y. This simple observation can be generalized using Green's relations: every idempotent e in an arbitrary semigroup is a left identity for Re and right identity for Le.[1] An intuitive description of this fact is that every pair of mutually inverse elements produces a local left identity, and respectively, a local right identity.

In a monoid, the notion of inverse as defined in the previous section is strictly narrower than the definition given in this section. Only elements in the Green class H1 have an inverse from the unital magma perspective, whereas for any idempotent e, the elements of He have an inverse as defined in this section. Under this more general definition, inverses need not be unique (or exist) in an arbitrary semigroup or monoid. If all elements are regular, then the semigroup (or monoid) is called regular, and every element has at least one inverse. If every element has exactly one inverse as defined in this section, then the semigroup is called an inverse semigroup. Finally, an inverse semigroup with only one idempotent is a group. An inverse semigroup may have an absorbing element 0 because 000 = 0, whereas a group may not.

Outside semigroup theory, a unique inverse as defined in this section is sometimes called a quasi-inverse. This is generally justified because in most applications (e.g. all examples in this article) associativity holds, which makes this notion a generalization of the left/right inverse relative to an identity.

### U-semigroups

A natural generalization of the inverse semigroup is to define an (arbitrary) unary operation ° such that (a°)° = a for all a in S; this endows S with a type ⟨2,1⟩ algebra. A semigroup endowed with such an operation is called a U-semigroup. Although it may seem that a° will be the inverse of a, this is not necessarily the case. In order to obtain interesting notion(s), the unary operation must somehow interact with the semigroup operation. Two classes of U-semigroups have been studied:[2]

• I-semigroups, in which the interaction axiom is aa°a = a
• *-semigroups, in which the interaction axiom is (ab)° = b°a°. Such an operation is called an involution, and typically denoted by a*

Clearly a group is both an I-semigroup and a *-semigroup. A class of semigroups important in semigroup theory are completely regular semigroups; these are I-semigroups in which one additionally has aa° = a°a; in other words every element has commuting pseudoinverse a°. There are few concrete examples of such semigroups however; most are completely simple semigroups. In contrast, a subclass of *-semigroups, the *-regular semigroups (in the sense of Drazin), yield one of best known examples of a (unique) pseudoinverse, the Moore–Penrose inverse. In this case however the involution a* is not the pseudoinverse. Rather, the pseudoinverse of x is the unique element y such that xyx = x, yxy = y, (xy)* = xy, (yx)* = yx. Since *-regular semigroups generalize inverse semigroups, the unique element defined this way in a *-regular semigroup is called the generalized inverse or Penrose–Moore inverse.

## Examples

All examples in this section involve associative operators, thus we shall use the terms left/right inverse for the unital magma-based definition, and quasi-inverse for its more general version.

### Real numbers

Every real number $x$ has an additive inverse (i.e. an inverse with respect to addition) given by $-x$. Every nonzero real number $x$ has a multiplicative inverse (i.e. an inverse with respect to multiplication) given by $\frac 1{x}$ (or $x^{-1}$). By contrast, zero has no multiplicative inverse, but it has a unique quasi-inverse, 0 itself.

### Functions and partial functions

A function $g$ is the left (resp. right) inverse of a function $f$ (for function composition), if and only if $g \circ f$ (resp. $f \circ g$) is the identity function on the domain (resp. codomain) of $f$. The inverse of a function $f$ is often written $f^{-1}$, but this notation is sometimes ambiguous. Only bijections have two-sided inverses, but any function has a quasi-inverse, i.e. the full transformation monoid is regular. The monoid of partial functions is also regular, whereas the monoid of injective partial transformations is the prototypical inverse semigroup.

### Galois connections

The lower and upper adjoints in a (monotone) Galois connection, L and G are quasi-inverses of each other, i.e. LGL = L and GLG = G and one uniquely determines the other. They are not left or right inverses of each other however.

### Matrices

A square matrix $M$ with entries in a field $K$ is invertible (in the set of all square matrices of the same size, under matrix multiplication) if and only if its determinant is different from zero. If the determinant of $M$ is zero, it is impossible for it to have a one-sided inverse; therefore a left inverse or right inverse implies the existence of the other one. See invertible matrix for more.

More generally, a square matrix over a commutative ring $R$ is invertible if and only if its determinant is invertible in $R$.

Non-square matrices of full rank have several one-sided inverses:[3]

• For $A:m\times n \mid m>n$ we have a left inverse: $\underbrace{ (A^{T}A)^{-1}A^{T} }_{ A^{-1}_\text{left} } A = I_{n}$
• For $A:m\times n \mid m we have a right inverse: $A \underbrace{ A^{T}(AA^{T})^{-1} }_{ A^{-1}_\text{right} } = I_{m}$

The left inverse can be used to determine the least norm solution of $Ax = b$, which is also the least squares formula for regression and is given by $x=(A^TA)^{-1}A^Tb.$

No rank deficient matrix has any (even one-sided) inverse. However, the Moore–Penrose pseudoinverse exists for all matrices, and coincides with the left or right (or true) inverse when it exists.

As an example of matrix inverses, consider:

$A:2\times 3 = \begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{bmatrix}$

So, as m < n, we have a right inverse, $A^{-1}_\text{right} = A^{T}(AA^{T})^{-1}.$ By components it is computed as

\begin{align} AA^{T} &= \begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{bmatrix}\cdot \begin{bmatrix} 1 & 4\\ 2 & 5\\ 3 & 6 \end{bmatrix} = \begin{bmatrix} 14 & 32\\ 32 & 77 \end{bmatrix} \\ (AA^{T})^{-1} &= \begin{bmatrix} 14 & 32\\ 32 & 77 \end{bmatrix}^{-1} = \frac{1}{54} \begin{bmatrix} 77 & -32\\ -32 & 14 \end{bmatrix} \\ A^{T}(AA^{T})^{-1} &= \frac{1}{54} \begin{bmatrix} 1 & 4\\ 2 & 5\\ 3 & 6 \end{bmatrix}\cdot \begin{bmatrix} 77 & -32\\ -32 & 14 \end{bmatrix} = \frac{1}{18} \begin{bmatrix} -17 & 8\\ -2 & 2\\ 13 & -4 \end{bmatrix} = A^{-1}_\text{right} \end{align}

The left inverse doesn't exist, because

$A^{T}A = \begin{bmatrix} 1 & 4\\ 2 & 5\\ 3 & 6 \end{bmatrix} \cdot \begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{bmatrix} = \begin{bmatrix} 17 & 22 & 27 \\ 22 & 29 & 36\\ 27 & 36 & 45 \end{bmatrix}$

which is a singular matrix, and cannot be inverted.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 48, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}