The probability that two elements of a finite nonabelian simple group commute

Clash Royale CLAN TAG#URR8PPP
up vote
7
down vote
favorite
It is mentioned in here (last paragraph of the first page) that Dixon proved the following result: the probability that two elements of a finite nonabelian simple group commute is at most $frac112$. I cannot seem to find this proof anywhere online. Do you know a proof of this fact? Or do you have a reference for it? (I am actually more interested in the original proof)
reference-request gr.group-theory pr.probability finite-groups
add a comment |Â
up vote
7
down vote
favorite
It is mentioned in here (last paragraph of the first page) that Dixon proved the following result: the probability that two elements of a finite nonabelian simple group commute is at most $frac112$. I cannot seem to find this proof anywhere online. Do you know a proof of this fact? Or do you have a reference for it? (I am actually more interested in the original proof)
reference-request gr.group-theory pr.probability finite-groups
2
In fact, for any $epsilon$, there will be at most finitely many simple groups $G$ with $cp(G) geq epsilon$. This follows from Dixon's argument (linked below) and the fact that for any $n$ there are at most finitely many finite simple groups with an irreducible representation of dimension $n$. See e.g. mathoverflow.net/a/27365/1345
â Ian Agol
Sep 19 at 4:07
add a comment |Â
up vote
7
down vote
favorite
up vote
7
down vote
favorite
It is mentioned in here (last paragraph of the first page) that Dixon proved the following result: the probability that two elements of a finite nonabelian simple group commute is at most $frac112$. I cannot seem to find this proof anywhere online. Do you know a proof of this fact? Or do you have a reference for it? (I am actually more interested in the original proof)
reference-request gr.group-theory pr.probability finite-groups
It is mentioned in here (last paragraph of the first page) that Dixon proved the following result: the probability that two elements of a finite nonabelian simple group commute is at most $frac112$. I cannot seem to find this proof anywhere online. Do you know a proof of this fact? Or do you have a reference for it? (I am actually more interested in the original proof)
reference-request gr.group-theory pr.probability finite-groups
reference-request gr.group-theory pr.probability finite-groups
edited Sep 19 at 5:20
Yemon Choi
16.2k54699
16.2k54699
asked Sep 19 at 3:21
user129021
361
361
2
In fact, for any $epsilon$, there will be at most finitely many simple groups $G$ with $cp(G) geq epsilon$. This follows from Dixon's argument (linked below) and the fact that for any $n$ there are at most finitely many finite simple groups with an irreducible representation of dimension $n$. See e.g. mathoverflow.net/a/27365/1345
â Ian Agol
Sep 19 at 4:07
add a comment |Â
2
In fact, for any $epsilon$, there will be at most finitely many simple groups $G$ with $cp(G) geq epsilon$. This follows from Dixon's argument (linked below) and the fact that for any $n$ there are at most finitely many finite simple groups with an irreducible representation of dimension $n$. See e.g. mathoverflow.net/a/27365/1345
â Ian Agol
Sep 19 at 4:07
2
2
In fact, for any $epsilon$, there will be at most finitely many simple groups $G$ with $cp(G) geq epsilon$. This follows from Dixon's argument (linked below) and the fact that for any $n$ there are at most finitely many finite simple groups with an irreducible representation of dimension $n$. See e.g. mathoverflow.net/a/27365/1345
â Ian Agol
Sep 19 at 4:07
In fact, for any $epsilon$, there will be at most finitely many simple groups $G$ with $cp(G) geq epsilon$. This follows from Dixon's argument (linked below) and the fact that for any $n$ there are at most finitely many finite simple groups with an irreducible representation of dimension $n$. See e.g. mathoverflow.net/a/27365/1345
â Ian Agol
Sep 19 at 4:07
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
7
down vote
You can find Dixon's argument here (Google Books). (J.D..Dixon, Solution to Problem 176, Canadian Mathematical Bulletin 16 (1973), p302.)
3
Note that Dixon's argument can be simplified a little. No finite simple group can have an irreducible complex character of degree $2$. If $G$ were a simple group with such a representation, then $|G|$ would be even (since irreducible character degrees divide the group order). Then $G$ would contain an involution $t$ by Cauchy's theorem, and $t$ would be in $Z(G)$ since $t$ would be represented by $-I$ (on consideration of determinant), contrary to simplicity.
â Geoff Robinson
Sep 19 at 10:48
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
7
down vote
You can find Dixon's argument here (Google Books). (J.D..Dixon, Solution to Problem 176, Canadian Mathematical Bulletin 16 (1973), p302.)
3
Note that Dixon's argument can be simplified a little. No finite simple group can have an irreducible complex character of degree $2$. If $G$ were a simple group with such a representation, then $|G|$ would be even (since irreducible character degrees divide the group order). Then $G$ would contain an involution $t$ by Cauchy's theorem, and $t$ would be in $Z(G)$ since $t$ would be represented by $-I$ (on consideration of determinant), contrary to simplicity.
â Geoff Robinson
Sep 19 at 10:48
add a comment |Â
up vote
7
down vote
You can find Dixon's argument here (Google Books). (J.D..Dixon, Solution to Problem 176, Canadian Mathematical Bulletin 16 (1973), p302.)
3
Note that Dixon's argument can be simplified a little. No finite simple group can have an irreducible complex character of degree $2$. If $G$ were a simple group with such a representation, then $|G|$ would be even (since irreducible character degrees divide the group order). Then $G$ would contain an involution $t$ by Cauchy's theorem, and $t$ would be in $Z(G)$ since $t$ would be represented by $-I$ (on consideration of determinant), contrary to simplicity.
â Geoff Robinson
Sep 19 at 10:48
add a comment |Â
up vote
7
down vote
up vote
7
down vote
You can find Dixon's argument here (Google Books). (J.D..Dixon, Solution to Problem 176, Canadian Mathematical Bulletin 16 (1973), p302.)
You can find Dixon's argument here (Google Books). (J.D..Dixon, Solution to Problem 176, Canadian Mathematical Bulletin 16 (1973), p302.)
edited Sep 19 at 6:58
YCor
25.4k277120
25.4k277120
answered Sep 19 at 3:45
Keith Kearnes
5,25912438
5,25912438
3
Note that Dixon's argument can be simplified a little. No finite simple group can have an irreducible complex character of degree $2$. If $G$ were a simple group with such a representation, then $|G|$ would be even (since irreducible character degrees divide the group order). Then $G$ would contain an involution $t$ by Cauchy's theorem, and $t$ would be in $Z(G)$ since $t$ would be represented by $-I$ (on consideration of determinant), contrary to simplicity.
â Geoff Robinson
Sep 19 at 10:48
add a comment |Â
3
Note that Dixon's argument can be simplified a little. No finite simple group can have an irreducible complex character of degree $2$. If $G$ were a simple group with such a representation, then $|G|$ would be even (since irreducible character degrees divide the group order). Then $G$ would contain an involution $t$ by Cauchy's theorem, and $t$ would be in $Z(G)$ since $t$ would be represented by $-I$ (on consideration of determinant), contrary to simplicity.
â Geoff Robinson
Sep 19 at 10:48
3
3
Note that Dixon's argument can be simplified a little. No finite simple group can have an irreducible complex character of degree $2$. If $G$ were a simple group with such a representation, then $|G|$ would be even (since irreducible character degrees divide the group order). Then $G$ would contain an involution $t$ by Cauchy's theorem, and $t$ would be in $Z(G)$ since $t$ would be represented by $-I$ (on consideration of determinant), contrary to simplicity.
â Geoff Robinson
Sep 19 at 10:48
Note that Dixon's argument can be simplified a little. No finite simple group can have an irreducible complex character of degree $2$. If $G$ were a simple group with such a representation, then $|G|$ would be even (since irreducible character degrees divide the group order). Then $G$ would contain an involution $t$ by Cauchy's theorem, and $t$ would be in $Z(G)$ since $t$ would be represented by $-I$ (on consideration of determinant), contrary to simplicity.
â Geoff Robinson
Sep 19 at 10:48
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f310902%2fthe-probability-that-two-elements-of-a-finite-nonabelian-simple-group-commute%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
2
In fact, for any $epsilon$, there will be at most finitely many simple groups $G$ with $cp(G) geq epsilon$. This follows from Dixon's argument (linked below) and the fact that for any $n$ there are at most finitely many finite simple groups with an irreducible representation of dimension $n$. See e.g. mathoverflow.net/a/27365/1345
â Ian Agol
Sep 19 at 4:07