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

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
7
down vote

favorite
1












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)










share|cite|improve this question



















  • 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














up vote
7
down vote

favorite
1












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)










share|cite|improve this question



















  • 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












up vote
7
down vote

favorite
1









up vote
7
down vote

favorite
1






1





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)










share|cite|improve this question















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






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








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












  • 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










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.)






share|cite|improve this answer


















  • 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











Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "504"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















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






























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.)






share|cite|improve this answer


















  • 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















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.)






share|cite|improve this answer


















  • 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













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.)






share|cite|improve this answer














You can find Dixon's argument here (Google Books). (J.D..Dixon, Solution to Problem 176, Canadian Mathematical Bulletin 16 (1973), p302.)







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








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













  • 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


















 

draft saved


draft discarded















































 


draft saved


draft discarded














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













































































Popular posts from this blog

Peggy Mitchell

The Forum (Inglewood, California)

Palaiologos