Tour:Nonempty finite subsemigroup of group is subgroup

From Groupprops
Revision as of 22:30, 21 March 2008 by Vipul (talk | contribs) (New page: {{quotation|In a finite group, any nonempty subset that is closed under the operation of multiplication is, in fact, a subgroup. This isn't true for infinite groups (think for a moment abo...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In a finite group, any nonempty subset that is closed under the operation of multiplication is, in fact, a subgroup. This isn't true for infinite groups (think for a moment about positive integers inside all integers). See below for the proof and more details.
There is a general condition called the subgroup condition for arbitrary groups, as we'll see in the next article.
Proceed to Guided tour for beginners:Sufficiency of subgroup condition OR return to Guided tour for beginners:Subgroup

Statement

Verbal statement

Any nonempty multiplicatively closed subset (or equivalently, nonempty subsemigroup) of a finite group is a subgroup.

Symbolic statement

Let be a finite group and be a nonempty subset such that . Then, is a subgroup of .

Proof

Finite order of every element

We use finiteness to observe that has finite order, or equivalently, for any that there exists a such that . This can be shown as follows:

For any , the set is a finite set and hence there are positive integers and such that . This gives .

The proof

Since is nonempty, there exists . We now demonstrate the three conditions for to be a subgroup:

  • Binary operation: The product of two elements in is in , by assumption
  • Identity element: There exists and from the previous section we know that there exists such that . Since is closed under multiplication,
  • Inverse element: For any , there exists such that . Hence, . Since is closed under multiplication, and hence .

Related results

External links

Links to related riders

Mathlinks discussion forum page for Subgroup of a finite group