Dixon's theorem: Difference between revisions

From Groupprops
No edit summary
 
Line 1: Line 1:
==Statement==
==Statement==


Let <math>S_n</math> denote the [[symmetric group on a finite set|symmetric group]] of degree <math>n</math>, and <math>A_n</math> denote the subgroup that is the [[alternating group]]. Pick two elements independently of each other, both uniformly at random, from <math>S_n</math>. Denote by <math>f_1(n)</math> the probability that they generate all of <math>S_n</math>, and by <math>f_2(n)</math> the probability that they generate <nath>A_n</math>.
Let <math>S_n</math> denote the [[symmetric group on a finite set|symmetric group]] of degree <math>n</math>, and <math>A_n</math> denote the subgroup that is the [[alternating group]]. Pick two elements independently of each other, both uniformly at random, from <math>S_n</math>. Denote by <math>f_1(n)</math> the probability that they generate all of <math>S_n</math>, and by <math>f_2(n)</math> the probability that they generate <math>A_n</math>.


Then:
Then:

Latest revision as of 01:03, 9 January 2012

Statement

Let denote the symmetric group of degree , and denote the subgroup that is the alternating group. Pick two elements independently of each other, both uniformly at random, from . Denote by the probability that they generate all of , and by the probability that they generate .

Then:

and:

Thus:

Another way of putting this is as follows:

  • Define by the probability that two permutations generate the whole group conditional to the elements not both being even permutations. Then, clearly . The first part of Dixon's theorem states that .
  • Define by the probability that two permutations generate the whole group conditional to the elements both being even permutations. Then, clearly . The second part of Dixon's theorem states that .

Related facts