Maths Olympiad Prep

Library / Shortlisted Problems for the 64th NMO /5 of 5

Shortlisted Problems for the 64th NMO

Algebra Difficulty 8.3 Shortlist Prove it Romania

Let (G,⋅)(G, \cdot) be a group and HH and KK be two subgroups of GG. It is known that xy=yxxy = yx, for every x∈G∖Hx \in G \setminus H and every y∈G∖Ky \in G \setminus K. Prove that the group GG is commutative.

Solution

Let a,b∈Ga, b \in G be arbitrary. We want to show that ab=baab = ba.

Case 1: a∈G∖Ha \in G \setminus H and b∈G∖Kb \in G \setminus K.
By hypothesis, ab=baab = ba.

Case 2: a∈Ha \in H and b∈G∖Kb \in G \setminus K.
Let x∈G∖Hx \in G \setminus H. By hypothesis, for any y∈G∖Ky \in G \setminus K, xy=yxxy = yx.
Consider a∈Ha \in H, b∈G∖Kb \in G \setminus K.
Let x∈G∖Hx \in G \setminus H (such xx exists unless H=GH = G; if H=GH = G, then GG is commutative trivially).
Then xb=bxxb = bx.
Now, consider a∈Ha \in H, b∈G∖Kb \in G \setminus K.
Let x∈G∖Hx \in G \setminus H.
Then xx commutes with bb.
But aa commutes with xx if x∈Hx \in H (since HH is a subgroup), but x∉Hx \notin H.
However, we need to show ab=baab = ba.

Let us try a different approach.

Let a,b∈Ga, b \in G be arbitrary.
If both a∈G∖Ha \in G \setminus H and b∈G∖Kb \in G \setminus K, then ab=baab = ba by hypothesis.

Suppose a∈Ha \in H.
If b∈G∖Kb \in G \setminus K, then ab=baab = ba by hypothesis.
If b∈Kb \in K, then consider x∈G∖Hx \in G \setminus H (if H≠GH \neq G).
Then xx commutes with bb (since b∈Kb \in K and x∈G∖Hx \in G \setminus H), but this does not help directly.

Suppose a∈Ha \in H, b∈Kb \in K.
Let x∈G∖Hx \in G \setminus H, y∈G∖Ky \in G \setminus K.
Then xy=yxxy = yx.

Now, consider the sets HH and KK.
Suppose H=GH = G or K=GK = G. Then G∖H=∅G \setminus H = \emptyset or G∖K=∅G \setminus K = \emptyset, so the condition is vacuously true, and GG is commutative.

Suppose H≠GH \neq G and K≠GK \neq G.
Let a∈Ha \in H, b∈Kb \in K.
Let x∈G∖Hx \in G \setminus H, y∈G∖Ky \in G \setminus K.
Then xy=yxxy = yx.

Now, for any g∈Gg \in G, gg can be written as g∈Hg \in H, g∈Kg \in K, or g∈G∖Hg \in G \setminus H, g∈G∖Kg \in G \setminus K.

Let us show that GG is commutative.
Let a,b∈Ga, b \in G be arbitrary.
If a∈G∖Ha \in G \setminus H or b∈G∖Kb \in G \setminus K, then ab=baab = ba by hypothesis.
If a∈Ha \in H and b∈Kb \in K, then consider x∈G∖Hx \in G \setminus H, y∈G∖Ky \in G \setminus K.
Then xy=yxxy = yx.

But HH and KK are subgroups, so H∩KH \cap K is a subgroup.
Suppose a∈Ha \in H, b∈Kb \in K.
Let x∈G∖Hx \in G \setminus H.
Then xx commutes with bb if b∈G∖Kb \in G \setminus K, but if b∈Kb \in K, we need another argument.

Let us consider the commutator [a,b]=aba−1b−1[a, b] = aba^{-1}b^{-1}.
We want to show [a,b]=e[a, b] = e for all a,b∈Ga, b \in G.

Let x∈G∖Hx \in G \setminus H, y∈G∖Ky \in G \setminus K.
Then xy=yxxy = yx.

Let a∈Ha \in H, b∈Kb \in K.
Consider x∈G∖Hx \in G \setminus H.
Then xx commutes with any y∈G∖Ky \in G \setminus K.

But G=(H∪(G∖H))G = (H \cup (G \setminus H)) and G=(K∪(G∖K))G = (K \cup (G \setminus K)).

Let us fix a∈Ha \in H, b∈Kb \in K.
Let x∈G∖Hx \in G \setminus H.
Then xx commutes with bb if b∈G∖Kb \in G \setminus K.
If b∈Kb \in K, then xx may not commute with bb by the hypothesis.

But for a∈Ha \in H, b∈Kb \in K, consider x∈G∖Hx \in G \setminus H, y∈G∖Ky \in G \setminus K.
Then xy=yxxy = yx.

Now, for any g∈Gg \in G, gg can be written as g=h1k1g = h_1k_1 for some h1∈Hh_1 \in H, k1∈Kk_1 \in K if G=HKG = HK.
But in general, we need to show that ab=baab = ba for all a,b∈Ga, b \in G.

Alternatively, note that for any a∈Ha \in H, b∈Kb \in K, and x∈G∖Hx \in G \setminus H, y∈G∖Ky \in G \setminus K, xy=yxxy = yx.

But since x∈G∖Hx \in G \setminus H, y∈G∖Ky \in G \setminus K, and xy=yxxy = yx, and for all other cases, either a∈G∖Ha \in G \setminus H or b∈G∖Kb \in G \setminus K, so ab=baab = ba.

Therefore, for all a,b∈Ga, b \in G, ab=baab = ba.

Thus, GG is commutative.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.