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

IMC / 2011 / Problems / Day 2, P10

IMC 2011 · Day 2 · P10

Let F=A0A1AnF = A_0 A_1 \dots A_n be a convex polygon in the plane. Define for all 1kn11 \le k \le n-1 the operation fkf_k which replaces FF with a new polygon fk(F)=A0Ak1AkAk+1An,f_k(F) = A_0 \dots A_{k-1} A_k' A_{k+1} \dots A_n, where AkA_k' is the point symmetric to AkA_k with respect to the perpendicular bisector of Ak1Ak+1A_{k-1} A_{k+1}. Prove that (f1f2fn1)n(F)=F(f_1 \circ f_2 \circ \dots \circ f_{n-1})^n (F) = F. We suppose that all operations are well-defined on the polygons, to which they are applied, i.e. results are convex polygons again. (A0A_0, A1,,AnA_1, \dots, A_n are the vertices of FF in consecutive order.)

(Mikhail Khristoforov, St. Petersburg)

Solution (official)

The operations fif_i are rational maps on the 2(n1)2(n-1)-dimensional phase space of coordinates of the vertices A1,,An1A_1, \dots, A_{n-1}. To show that (f1f2fn1)n(f_1 \circ f_2 \circ \dots \circ f_{n-1})^n is the identity, it is sufficient to verify this on some open set. For example, we can choose a neighborhood of the regular polygon, then all intermediate polygons in the proof will be convex.

Consider the operations fif_i. Notice that (i) fifi=idf_i \circ f_i = id and (ii) fifj=fjfif_i \circ f_j = f_j \circ f_i for ij2|i - j| \ge 2. We also show that (iii) (fifi+1)3=id(f_i \circ f_{i+1})^3 = id for 1in11 \le i \le n-1.

The operations fif_i and fi+1f_{i+1} change the order of side lengths by interchanging two consecutive sides; after performing (fifi+1)3(f_i \circ f_{i+1})^3, the side lengths are in the original order. Moreover, the sums of opposite angles in the convex quadrilateral Ai1AiAi+1Ai+2A_{i-1} A_i A_{i+1} A_{i+2} are preserved in all operations. These quantities uniquely determine the quadrilateral, because with fixed sides, both angles A1A2A3\angle A_1 A_2 A_3 and A1A4A3\angle A_1 A_4 A_3 decrease when A1A3A_1 A_3 increases. Hence, property (iii) is proved.

In the symmetric group SnS_n, the transpositions σi=(i,i+1)\sigma_i = (i, i+1), which from a generator system, satisfy the same properties (i–iii). It is well-known that SnS_n is the maximal group with n1n-1 generators, satisfying (i–iii). In SnS_n we have (σ1σ2σn1)n=(1,2,3,,n)n=id(\sigma_1 \circ \sigma_2 \circ \dots \circ \sigma_{n-1})^n = (1, 2, 3, \dots, n)^n = id, so this implies (f1f2fn1)n=id(f_1 \circ f_2 \circ \dots \circ f_{n-1})^n = id.

Similar problems