TheoremBase

The identity is the neutral element of the underlying monoid, unique because a binary operation has at most one neutral element; inverses exist because every element of a group is a unit and are unique because a unit of a monoid has only one inverse.

Proof

We begin with (i). Since (G,⋅)(G,\cdot) is a group, it is a monoid (Groups and Abelian Groups (i)), so ⋅\cdot has a neutral element ee, the identity of the monoid (Monoids (i)). If e′e' is also a neutral element of ⋅\cdot, then e′=ee'=e, because ⋅\cdot has at most one neutral element (A Binary Operation Has at Most One Neutral Element (i)). Thus ⋅\cdot has exactly one neutral element, namely the identity ee.

For (ii), let g∈Gg\in G. Every element of a group is a unit of its monoid (Groups and Abelian Groups (i)), so there is h∈Gh\in G with

gh=hg=egh=hg=e

(Units of a Monoid (i)), where ee is the identity just obtained. The elements h∈Gh\in G satisfying these equations are precisely the inverses of the unit gg in the sense of Units of a Monoid (i), and a unit of a monoid has exactly one inverse (Units of a Monoid: Unique Inverses, Products, and the Group of Units (i)). Hence there is exactly one such hh.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…