Maths Olympiad Prep

Library / /16 of 39

Algebra Difficulty 5.9 AIME, harder Prove it Romania

Let (G,)(G, \cdot) be a group, with the unit element ee, and AA a non-empty subset of GG. We denote AA={xyx,yA}AA = \{xy \mid x, y \in A\}.

a) Show that if GG is finite, then AA=AAA = A if and only if eAe \in A and AA=A|AA| = |A|.

b) Give an example of a group GG and a subset AGA \subseteq G, such that AAAAA \neq A, AA=A|AA| = |A| and AA<GAA < G.

(The notation H<GH < G means that HH is a proper subgroup of the group GG, i.e., a subgroup of GG different from GG itself.)

Solution

a) If AA=AAA = A, then AA=A|AA| = |A|. For any xAx \in A we have xA=A<|xA| = |A| < \infty and xAAA=AxA \subseteq AA = A, so that xA=AxA = A. But then xxAx \in xA, hence e=x1xx1xA=Ae = x^{-1} \cdot x \in x^{-1} \cdot xA = A. Reciprocally, if eAe \in A and AA=A|AA| = |A|, then A=eAAAA = e \cdot A \subseteq AA and since A=AA<|A| = |AA| < \infty, it follows that AA=AAA = A.

b) Let G=U4={1,i,1,i}G = U_4 = \{1, i, -1, -i\} be the group of all 4th roots of unity. Considering A={i,i}A = \{i, -i\}, we have AA={i2,i(i),(i)2}={1,1}=U2<U4AA = \{i^2, i \cdot (-i), (-i)^2\} = \{1, -1\} = U_2 < U_4, AA=2=A|AA| = 2 = |A| and AAAAA \neq A (furthermore, AAA=AA \cap A = \emptyset).

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

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.