TheoremBase

Sketch: uniqueness of inverses by the usual v = v(uw) = (vu)w = w computation, closure of units under products and inverses by direct computation, and the group axioms for the units by restriction.

Proof

Throughout, β‹…\cdot is associative with neutral element ee (Monoids (i), Semigroups (i), Associative and Commutative Binary Operations, and Neutral Elements (i), Associative and Commutative Binary Operations, and Neutral Elements (iii)), so brackets in products are dropped, and units and inverses are as in Units of a Monoid (i).

We begin with (i). Let vv and ww be inverses of a unit uu, so that uv=vu=euv=vu=e and uw=wu=euw=wu=e. Then

v=ve=v(uw)=(vu)w=ew=w,v=ve=v(uw)=(vu)w=ew=w,

so uu has only one inverse.

For (ii), the equation ee=eee=e says that ee is a unit and that ee is an inverse of itself. Since inverses are unique by (i), eβˆ’1=ee^{-1}=e.

For (iii), let uu and vv be units. Then

(uv)(vβˆ’1uβˆ’1)=u(vvβˆ’1)uβˆ’1=ueuβˆ’1=uuβˆ’1=e,(uv)(v^{-1}u^{-1})=u(vv^{-1})u^{-1}=ueu^{-1}=uu^{-1}=e,

and in the same way (vβˆ’1uβˆ’1)(uv)=vβˆ’1(uβˆ’1u)v=vβˆ’1v=e(v^{-1}u^{-1})(uv)=v^{-1}(u^{-1}u)v=v^{-1}v=e. Thus vβˆ’1uβˆ’1v^{-1}u^{-1} is an inverse of uvuv, so uvuv is a unit, and (uv)βˆ’1=vβˆ’1uβˆ’1(uv)^{-1}=v^{-1}u^{-1} by (i).

For (iv), let uu be a unit. The equations uuβˆ’1=uβˆ’1u=euu^{-1}=u^{-1}u=e, read the other way round, say that uu is an inverse of uβˆ’1u^{-1}. Hence uβˆ’1u^{-1} is a unit, and (uβˆ’1)βˆ’1=u(u^{-1})^{-1}=u by (i).

Finally, for (v), let β‹…β€²\cdot' be the restriction of β‹…\cdot to MΓ—Γ—MΓ—M^{\times}\times M^{\times}, where MΓ—M^{\times} is the set of units of MM (Units of a Monoid (ii)); it is a function with domain MΓ—Γ—MΓ—M^{\times}\times M^{\times} and uβ‹…β€²v=uvu\cdot' v=uv for u,v∈MΓ—u,v\in M^{\times} (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ix)). By (iii) a product of two units is a unit, so β‹…β€²\cdot' takes its values in MΓ—M^{\times} and is a binary operation on MΓ—M^{\times} (Binary Operations on a Set (i)). It is associative because β‹…\cdot is, so (MΓ—,β‹…β€²)(M^{\times},\cdot') is a semigroup (Semigroups (i)). By (ii), ee lies in MΓ—M^{\times}, and it is neutral for β‹…β€²\cdot' because it is neutral for β‹…\cdot. Hence (MΓ—,β‹…β€²)(M^{\times},\cdot') is a monoid (Monoids (i)), and its identity is ee, since a binary operation has at most one neutral element (A Binary Operation Has at Most One Neutral Element (i)). Now let u∈MΓ—u\in M^{\times}. By (iv), uβˆ’1u^{-1} lies in MΓ—M^{\times}, and

uβ‹…β€²uβˆ’1=uβˆ’1β‹…β€²u=e,u\cdot' u^{-1}=u^{-1}\cdot' u=e,

so uu is a unit of the monoid (MΓ—,β‹…β€²)(M^{\times},\cdot') (Units of a Monoid (i)). Every element of MΓ—M^{\times} is therefore a unit of (MΓ—,β‹…β€²)(M^{\times},\cdot'), which is thus a group (Groups and Abelian Groups (i)).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…