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

IMC / 2020 / Problems / Day 2, P7

IMC 2020 · Day 2 · P7

very hard

Let GG be a group and n2n \ge 2 be an integer. Let H1H_1 and H2H_2 be two subgroups of GG that satisfy [G:H1]=[G:H2]=nand[G:(H1H2)]=n(n1).[G : H_1] = [G : H_2] = n \quad \text{and} \quad [G : (H_1 \cap H_2)] = n (n - 1). Prove that H1H_1 and H2H_2 are conjugate in GG.

(Here [G:H][G : H] denotes the index of the subgroup HH, i.e. the number of distinct left cosets xHxH of HH in GG. The subgroups H1H_1 and H2H_2 are conjugate if there exists an element gGg \in G such that g1H1g=H2g^{-1} H_1 g = H_2.)

Ilya Bogdanov and Alexander Matushkin, Moscow Institute of Physics and Technology

Solution 1 of 2 (official)

Denote K=H1H2K = H_1 \cap H_2. Since n(n1)=[G:K]=[G:H1][H1:K]=n[H1:K],n (n - 1) = [G : K] = [G : H_1][H_1 : K] = n [H_1 : K], we obtain that [H1:K]=n1[H_1 : K] = n - 1. Thus, the subgroup H1H_1 is partitioned into n1n - 1 left cosets of KK, say H1=i=1n1hiKH_1 = \bigsqcup_{i=1}^{n-1} h_i K. Therefore, the set H1H2={ab:aH1,bH2}H_1 H_2 = \{ ab : a \in H_1, b \in H_2 \} is partitioned as H1H2=(i=1n1hiK)H2=i=1n1hiKH2=i=1n1hiH2.H_1 H_2 = \left( \bigsqcup_{i=1}^{n-1} h_i K \right) H_2 = \bigsqcup_{i=1}^{n-1} h_i K H_2 = \bigsqcup_{i=1}^{n-1} h_i H_2. The last equality holds because KH2K \subseteq H_2, so KH2=H2K H_2 = H_2. The last expression is a disjoint union since hiH2hjH2    hi1hjH2    hi1hjK    hi=hj.h_i H_2 \cap h_j H_2 \ne \emptyset \iff h_i^{-1} h_j \in H_2 \iff h_i^{-1} h_j \in K \iff h_i = h_j. Thus, H1H2H_1 H_2 is a disjoint union of n1n - 1 left cosets with respect to H2H_2; hence L=G(H1H2)L = G \setminus (H_1 H_2) is the remaining such left coset. Similarly, LL is a right coset with respect to H1H_1. Therefore, for each gLg \in L we have L=gH2=H1gL = g H_2 = H_1 g, which yields H2=g1H1gH_2 = g^{-1} H_1 g.

Solution 2 of 2 (official)

Put G/H1=XG / H_1 = X and G/H2=YG / H_2 = Y, those are nn-element sets acted on by GG from the left. Let GG act on X×YX \times Y from the left coordinate-wise, consider this product as a table, with rows being copies of XX and columns being copies of YY.

The stabilizer of a point (x,y)(x, y) in X×YX \times Y is H1H2H_1 \cap H_2. By the orbit-stabilizer theorem, we obtain that the orbit ZZ of (x,y)(x, y) has size [G:H1H2]=n(n1)[G : H_1 \cap H_2] = n (n - 1).

If ZZ contains a whole column then there is a subgroup G1G_1 of GG that stabilizes xx and acts transitively on YY. If we conjugate G1G_1 to a group G1G'_1, then its action remains transitive on YY, so by conjugation we obtain columns of the table. Since GG acts transitively on XX, we cover all the columns. It follows that Z=X×YZ = X \times Y, so n(n1)=Z=X×Y=n2,n (n - 1) = |Z| = |X \times Y| = n^2, which is a contradiction.

Hence every column of X×YX \times Y has an element not from ZZ. The same holds for the rows of X×YX \times Y. There are nn elements not from ZZ in total and they induce a bijection between XX and YY which allows us to identify X=YX = Y.

After this identification, every element (x,x)(x, x) from the diagonal of X×XX \times X (i.e. from (X×X)Z(X \times X) \setminus Z) is moved to a diagonal element by any gGg \in G, because gx=gxg x = g x. In this formula the action of gg in the left hand side and the action of gg in the right hand side are the actions of gg on XX and YY respectively.

Therefore our bijection between XX and YY is an isomorphism of sets with a left action of GG. Since H1H_1 and H2H_2 are stabilizers of the points in the same transitive action of GG, we conclude that they are conjugate.

Remark. The situation in the problem is possible for every n2n \ge 2: let G=SnG = S_n and let H1H_1 an H2H_2 be the stabilizer subgroups of two elements.

How the field did

contestants scored
453
average (of 10)
0.84
solved (≥ 80%)
6.4%
near-0 (≤ 10%)
90.7%
discrimination
0.48

Score distribution (field cohort)

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

Similar problems

IMC 2010 · Day 2 · P8very hardavg 1.2/10 · solved 7% · near-0 85% · disc 0.40
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