uniolympiads English

IMC 2011, Ημέρα 2, Θέμα 5

Let F=A0A1…AnF = A_0A_1 \dots A_n be a convex polygon in the plane. Define for all 1≤k≤n−11 \le k \le n - 1 the operation fkf_k which replaces FF with a new polygon

fk(F)=A0…Ak−1Ak′Ak+1…An,f_k(F) = A_0 \dots A_{k-1}A'_kA_{k+1} \dots A_n,

where Ak′A'_k is the point symmetric to AkA_k with respect to the perpendicular bisector of Ak−1Ak+1A_{k-1}A_{k+1}. Prove that (f1∘f2∘⋯∘fn−1)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. (A0,A1,…,AnA_0, A_1, \dots, A_n are the vertices of FF in consecutive order.)

Mikhail Khristoforov, St. Petersburg

Πρωτότυπο από το επίσημο PDFLet F = A 0 A 1 . . . A n be a convex polygon in the plane. Define for all 1 ≤ k ≤ n − 1 the operation f k which replaces F with a new polygon f k (F ) = A 0 . . . A k−1 A ′ k A k+1 . . . A n , where A ′ k is the point symmetric to A k with respect to the perpendicular bisector of A k−1 A k+1 . Prove that (f 1 ◦ f 2 ◦ . . . ◦ 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. (A 0 , A 1 , . . . , A n are the vertices of F in consecutive order.) Mikhail Khristoforov, St. Petersburg

Η μεταγραφή συγκρίθηκε σύμβολο προς σύμβολο με το πρωτότυπο, όχι ακόμα από άνθρωπο.

Χρόνος σε αυτό το θέμα 0:00

Δούλεψε τουλάχιστον 45 λεπτά πριν ανοίξεις τη λύση.

Επίσημη λύση

Mikhail Khristoforov, St. Petersburg

Solution. The operations fif_i are rational maps on the 2(n−1)2(n-1)-dimensional phase space of coordinates of the vertices A1,…,An−1A_1,\ldots,A_{n-1}. To show that (f1∘f2∘…∘fn−1)n(f_1\circ f_2\circ\ldots\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) fi∘fi=idf_i\circ f_i=id and (ii) fi∘fj=fj∘fif_i\circ f_j=f_j\circ f_i for ∣i−j∣≥2|i-j|\ge2. We also show that (iii) (fi∘fi+1)3=id(f_i\circ f_{i+1})^3=id for 1≤i≤n−11\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 (fi∘fi+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 Ai−1AiAi+1Ai+2A_{i-1}A_iA_{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_1A_2A_3 and ∠A1A4A3\angle A_1A_4A_3 decrease when A1A3A_1A_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 n−1n-1 generators, satisfying (i–iii). In SnS_n we have (σ1∘σ2∘…∘σn−1)n=(1,2,3,…,n)n=id(\sigma_1\circ\sigma_2\circ\ldots\circ\sigma_{n-1})^n=(1,2,3,\ldots,n)^n=id, so this implies (f1∘f2∘…∘fn−1)n=id(f_1\circ f_2\circ\ldots\circ f_{n-1})^n=id.

Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδα 4. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.

Θέμα αρχείου: η εκφώνηση είναι το επίσημο κείμενο (μεταγραμμένο, με το πρωτότυπο παραπάνω). Η ταξινόμηση ανά αντικείμενο και η δυσκολία εκτιμήθηκαν αυτόματα· υποδείξεις και λύση στα ελληνικά προστίθενται σταδιακά.

Πώς πήγε;