Finite group having at least two conjugacy classes of involutions has order less than the cube of the maximum of orders of centralizers of involutions: Difference between revisions

From Groupprops
Line 26: Line 26:
'''Proof''':  
'''Proof''':  


# Let <math>x</math> be an involution of <math>G</math> such that <math>|C_G(x)|</math> has order <math>h</math> and let <math>C = C_G(x)</math>. Note that <math>x</math> exists by the definition of <math>h</math>.
{| class="sortable" border="1"
# Let <math>y</math> be an involution of <math>G</math> that is not conjugate to <math>x</math> and let <math>D = C_g(y)</math>: Note that <math>y</math> exists because of the assumption that there are at least two conjugacy classes of involutions.
! Step no. !! Assertion/construction !! Facts used !! Given data used !! Previous steps used !! Explanation
# Let <math>y = y_1, y_2, \dots, y_t</math> be distinct involutions of <math>D</math>, and define <math>D_i = C_G(y_i)</math>. In particular, <math>D_1 = D</math>.
|-
# <math>t \le |D| \le h</math>: <math>t \le |D|</math> because the <math>y_i</math> are all distinct elements of <math>D</math>. <math>|D| \le h</math> because <math>D</math> is a centralizer of involution and by definition, <math>h</math> is the maximum of the orders of such subgroups.
| 1 || Let <math>x</math> be an involution of <math>G</math> such that <math>|C_G(x)|</math> has order <math>h</math> and let <math>C = C_G(x)</math>. || || definition of <math>h</math> || || Note that <math>x</math> exists by the definition of <math>h</math>.  
# The number of distinct non-identity elements in <math>\bigcup_{i=1}^t D_i</math> is less than <math>h^2</math>: Each <math>D_i</math> has at most <math>h - 1</math> non-identity elements, and there are <math>t</math> of them, with <math>t \le h</math>. So, the total number of elements is less than <math>h^2</math>.
|-
# Suppose <math>x</math> has a total of <math>m</math> conjugates <math>x_1, x_2, \dots, x_m</math>. Then, each <math>x_j</math> is contained in the union <math>\bigcup_{i=1}^t D_i</math>: Any <math>x_j</math> is conjugate to <math>x</math>. Since by assumption <math>x</math> is not conjugate to <math>y</math>, <math>x_j</math> is not conjugate to <math>y</math>. Thus, by fact (1), there exists an involution centralizing both <math>x_j</math> and <math>y</math>. This involution lives in <math>C_G(y)</math> so it is some <math>y_i</math>. Thus, <math>x_j \in C_G(y_i)</math> for some <math>i</math>.
| 2 || Let <math>y</math> be an involution of <math>G</math> that is not conjugate to <math>x</math> and let <math>D = C_g(y)</math> || || <math>G</math> has at least two conjugacy classes of involutions || Step (1) || Given-direct
# <math>m < h^2</math>: This follows from the previous two steps.
|-
# <math>|G| < h^3</math>: First, note that under the [[group acts as automorphisms by conjugation|action of the group on itself by conjugation]], the centralizer of <math>x</math> is its stabilizer, so by fact (3), the coset space of <math>C_G(x)</math> in <math>G</math> is in bijection with the conjugacy class of <math>x</math>. Thus, <math>m = [G:C_G(x)]</math>. By fact (4) (Lagrange's theorem), we get <math>m = |G|/h</math>. Since <math>m < h^2</math> by the previous step, we get <math>|G| < h^3</math>.
| 3 || Let <math>y = y_1, y_2, \dots, y_t</math> be distinct involutions of <math>D</math>, and define <math>D_i = C_G(y_i)</math>. In particular, <math>D_1 = D</math>. || || || Step (2) || <toggledisplay>Note that <math>y</math> centralizes itself, so it is an element of <math>D</math>.</toggledisplay>
|-
| 4 || <math>t \le |D| \le h</math> || || definition of <math>h</math> || Step (1) || <toggledisplay><math>t \le |D|</math> because the <math>y_i</math> are all distinct elements of <math>D</math>. <math>|D| \le h</math> because <math>D</math> is a centralizer of involution and by definition, <math>h</math> is the maximum of the orders of such subgroups.</toggledisplay>
|-
| 5 || The number of distinct non-identity elements in <math>\bigcup_{i=1}^t D_i</math> is less than <math>h^2</math> || || || || <toggledisplay>Each <math>D_i</math> has at most <math>h - 1</math> non-identity elements, and there are <math>t</math> of them, with <math>t \le h</math>. So, the total number of elements is less than <math>h^2</math>.</toggledisplay>
|-
| 6 || Suppose <math>x</math> has a total of <math>m</math> conjugates <math>x_1, x_2, \dots, x_m</math>. Then, each <math>x_j</math> is contained in the union <math>\bigcup_{i=1}^t D_i</math> || Fact (1) || || || <toggledisplay>Any <math>x_j</math> is conjugate to <math>x</math>. Since by assumption <math>x</math> is not conjugate to <math>y</math>, <math>x_j</math> is not conjugate to <math>y</math>. Thus, by fact (1), there exists an involution centralizing both <math>x_j</math> and <math>y</math>. This involution lives in <math>C_G(y)</math> so it is some <math>y_i</math>. Thus, <math>x_j \in C_G(y_i)</math> for some <math>i</math>.</toggledisplay>
|-
| 7 || <math>m < h^2</math> || || || Steps (5), (6) || Step-combination direct.
|-
| 8 || <math>|G| < h^3</math> || Fact (2) || || || By Fact (2), we get <math>m = |G|/h</math>. Since <math>m < h^2</math> by the previous step, we get <math>|G| < h^3</math>.
|}


==References==
==References==

Revision as of 00:08, 13 September 2011

Statement

Suppose G is a finite group such that there are at least two conjugacy classes of involutions (non-identity elements of order two) in G. Then, if h is the maximum of the orders of all subgroups of G that arise as a Centralizer of involution (?), we have:

|G|<h3.

Related facts

Facts used

  1. Involutions are either conjugate or have an involution centralizing both of them
  2. Group acts as automorphisms by conjugation
  3. Fundamental theorem of group actions

Proof

Given: A group G with at least two conjugacy classes of involutions. h is the maximum possible order of a subgroup arising as the centralizer of an involution of G.

To prove: |G|<h3.

Proof:

Step no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 Let x be an involution of G such that |CG(x)| has order h and let C=CG(x). definition of h Note that x exists by the definition of h.
2 Let y be an involution of G that is not conjugate to x and let D=Cg(y) G has at least two conjugacy classes of involutions Step (1) Given-direct
3 Let y=y1,y2,,yt be distinct involutions of D, and define Di=CG(yi). In particular, D1=D. Step (2) [SHOW MORE]
4 t|D|h definition of h Step (1) [SHOW MORE]
5 The number of distinct non-identity elements in i=1tDi is less than h2 [SHOW MORE]
6 Suppose x has a total of m conjugates x1,x2,,xm. Then, each xj is contained in the union i=1tDi Fact (1) [SHOW MORE]
7 m<h2 Steps (5), (6) Step-combination direct.
8 |G|<h3 Fact (2) By Fact (2), we get m=|G|/h. Since m<h2 by the previous step, we get |G|<h3.

References

Textbook references