Difference between revisions of "Operator inverse"
m |
m (proofreading) |
||
| Line 5: | Line 5: | ||
| − | If our operation is not [[commutative]], we can talk separately about ''left inverses'' and ''right inverses''. A left inverse of g would be some h such that <math>G(h, g) = e</math> while a right inverse would be some h such that <math>G(g, h) = e</math>. | + | If our operation is not [[commutative]], we can talk separately about ''left inverses'' and ''right inverses''. A left inverse of g would be some h such that <math>G(h, g) = e</math>, while a right inverse would be some h such that <math>G(g, h) = e</math>. |
Revision as of 12:09, 18 July 2006
Suppose we have a binary operation G on a set S, 
, and suppose this operation has an identity e, so that for every 
we have 
. An inverse to g under this operation is an element 
such that 
.
Thus, informally, operating by g is the "opposite" of operating by g-inverse.
If our operation is not commutative, we can talk separately about left inverses and right inverses. A left inverse of g would be some h such that 
, while a right inverse would be some h such that 
.
Uniqueness (under appropriate conditions)
If the operation G is associative and an element has both a right and left inverse, these two inverses are equal.
Proof
Let g be the element with left inverse h and right inverse h', so 
. Then 
, by the properties of e. But by associativity, 
, so we do indeed have 
.
Corollary
If the operation G is associative, inverses are unique.
