Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2010 / Problems / Day 2, P8

IMC 2010 · Day 2 · P8

very hard

Denote by SnS_n the group of permutations of the sequence (1,2,,n)(1, 2, \dots, n). Suppose that GG is a subgroup of SnS_n, such that for every πG{e}\pi \in G \setminus \{e\} there exists a unique k{1,2,,n}k \in \{1, 2, \dots, n\} for which π(k)=k\pi(k) = k. (Here ee is the unit element in the group SnS_n.) Show that this kk is the same for all πG{e}\pi \in G \setminus \{e\}.

Solution (official)

Let us consider the action of GG on the set X={1,,n}X = \{1, \dots, n\}. Let Gx={gG:g(x)=x}andGx={g(x):gG}G_x = \{ g \in G : g(x) = x \} \quad \text{and} \quad Gx = \{ g(x) : g \in G \} be the stabilizer and the orbit of xXx \in X under this action, respectively. The condition of the problem states that G=xXGx(1)\tag{1} G = \bigcup_{x \in X} G_x and GxGy={e}for all xy.(2)\tag{2} G_x \cap G_y = \{e\} \quad \text{for all } x \ne y. We need to prove that G=GxG = G_x for some xXx \in X.

Let Gx1,,GxkG x_1, \dots, G x_k be the distinct orbits of the action of GG. Then one can write (1) as G=i=1kyGxiGy.(3)\tag{3} G = \bigcup_{i=1}^{k} \bigcup_{y \in G x_i} G_y. It is well known that Gx=GGx.(4)\tag{4} |Gx| = \frac{|G|}{|G_x|}. Also note that if yGxy \in Gx then Gy=GxGy = Gx and thus Gy=Gx|Gy| = |Gx|. Therefore, Gx=GGx=GGy=Gyfor all yGx.(5)\tag{5} |G_x| = \frac{|G|}{|Gx|} = \frac{|G|}{|Gy|} = |G_y| \quad \text{for all } y \in Gx. Combining (3), (2), (4) and (5) we get G1=G{e}=i=1kyGxiGy{e}=i=1kGGxi(Gxi1),|G| - 1 = |G \setminus \{e\}| = \left| \bigcup_{i=1}^{k} \bigcup_{y \in G x_i} G_y \setminus \{e\} \right| = \sum_{i=1}^{k} \frac{|G|}{|G_{x_i}|} (|G_{x_i}| - 1), hence 11G=i=1k(11Gxi).(6)\tag{6} 1 - \frac{1}{|G|} = \sum_{i=1}^{k} \left( 1 - \frac{1}{|G_{x_i}|} \right). If for some i,j{1,,k}i, j \in \{1, \dots, k\} Gxi,Gxj2|G_{x_i}|, |G_{x_j}| \ge 2 then i=1k(11Gxi)(112)+(112)=1>11G\sum_{i=1}^{k} \left( 1 - \frac{1}{|G_{x_i}|} \right) \ge \left( 1 - \frac{1}{2} \right) + \left( 1 - \frac{1}{2} \right) = 1 > 1 - \frac{1}{|G|} which contradicts with (6), thus we can assume that Gx1==Gxk1=1.|G_{x_1}| = \dots = |G_{x_{k-1}}| = 1. Then from (6) we get Gxk=G|G_{x_k}| = |G|, hence Gxk=GG_{x_k} = G.

How the field did

contestants scored
322
average (of 10)
1.20
solved (≥ 80%)
6.8%
near-0 (≤ 10%)
84.8%
discrimination
0.40

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2020 · Day 2 · P7very hardavg 0.8/10 · solved 6% · near-0 91% · disc 0.48
IMC 2024 · Day 1 · P4very hardavg 1.4/10 · solved 12% · near-0 82% · disc 0.52
IMC 2008 · Day 1 · P5killeravg 0.1/10 · solved 1% · near-0 98% · disc 0.22
IMC 2005 · Day 1 · P6killeravg 0.2/10 · solved 0% · near-0 94% · disc 0.26