# Talk:Order (group theory)

## Why does a any element of a finite group have a finite order?

Are there any WP articles currently which explain *why* any element of a finite group has finite order? (I don't need it explained to me; I'm just concerned it doesn't seem to be discussed anywhere, and is not immediately obvious to a group theory newcomer.) Dmharvey File:User dmharvey sig.png Talk 5 July 2005 18:14 (UTC)

- Isn't that a finite group is defined as a group whose order is finite? -- Taku 11:00, 5 October 2005 (UTC)

- No, a finite group is one which has a finite number of elements. It follows that every element has finite order, so it may mean the same thing, but it's not, strictly speaking, defined as such. J•A•K 13:19, 9 December 2005 (UTC)

- Erm, the order of a group
*is*the number of elements. Did Taku mean to ask whether a finite group was defined as a group all of whose elements are finite? Shawn M. O'Hare 23:20, 13 January 2006 (UTC)

- Erm, the order of a group

## Moving to finite group?

Am I the only one who feels strange about the fact that many well-known facts about finite groups (like how a group order is divided) are put here instead of finite group? Since when the order is infinite, little can be said so why don't we move the stuff to finite group and redirect this to group (mathematics)? -- Taku 11:19, 5 October 2005 (UTC)

Yes

## Clarification, part 1

This might help clarify:

If a group has finite order, there are a finite number of elements in that group by definition.

For an element a in group G with identity e, consider the set {m is a natural number: a^m = e}. If this set is not empty, then by the Well-Ordering Principle, it has a least member. This least member is defined as the order of a.

## Clarification, part 2

If G is a finite group of order n, and d is a divisor of n, then the number of elements in G of order d is a multiple of φ(d).

That should be:

If G is a finite group of order n, and d is a divisor of n, then the number of elements in G of order d is φ(d).

## A Question

"If every element in G is the same as its inverse (i.e., g = g-1), then ord(g) = 2 and consequently G is abelian since ab = (bb)ab(aa) = b(ba)(ba)a = ba." Well...what about ? --VKokielov 02:21, 8 July 2006 (UTC)

- The quote is true and is abelian, that is, commutative. What is the problem? JRSpriggs 02:54, 8 July 2006 (UTC)

- Ahhhhh. I see. I have forgotten how to distinguish capital and small letters.
- Stupid, stupid, stupid. :) Thank you. --VKokielov 03:28, 8 July 2006 (UTC)

- A "capital letter" is also called an "upper-case letter", and a "small letter" is also called a "lower-case letter". I mention this because I have had college students in my courses, juniors and seniors, even, who did not know this.

- A "capital letter" is also called an "upper-case letter", and a "small letter" is also called a "lower-case letter". I mention this because I have had college students in my courses, juniors and seniors, even, who did not know this.

Also, calling them "little letters" or "small letters", rather then "lower-case letters", has a childish sound to it. I call them "lower-case letters", personally. 98.81.17.64 (talk) 22:07, 4 August 2010 (UTC)

## Order of symmetry group vs. symmetry number

Is the order of the symmetry group *the same* as the symmetry number (symmetry order)? Or order of a symmetry group has a broader meaning than symmetry number? Kazkaskazkasako (talk) 11:39, 2 June 2010 (UTC)