Skip to main content
OlympiadHQ

Browse · MathNet

Print

Estonian Mathematical Olympiad

Estonia geometry

Problem

On a plane a finite number of points are marked of which no three are collinear. Assume that there exists a non-convex polygon with all of its vertices located at some of those points. Prove that there exists a non-convex quadrilateral such that all its vertices lie at the marked points.

problem


problem


problem
Solution
There has to be a point inside the convex hull of the set of marked points, otherwise any subset of points would form a convex polygon. Let us partition the convex hull into triangles by drawing a necessary amount of diagonals. As no three points are on the same line, the marked point inside the convex hull must be inside one of the triangles. The vertices of that triangle along with the marked point inside the triangle form a non-convex quadrilateral.

We show that it is possible to find 4 points among the vertices of the non-convex -gon such that they form a non-convex quadrilateral. Let , , and be consecutive vertices of the -gon such that the internal angle . Let and be points on the extensions of and over . Then the closed broken line corresponding to the polygon has to go through the interior of . If this area contains a marked point, say , then is non-convex (Fig. 15).

Fig. 15

Alternatively, if there are no vertices of the -gon within the interior of , then it has to be intersected by a side of the polygon, say , where is on the side of point and is on the side of point (Fig. 16). Let us show that then is a non-convex quadrilateral. Indeed, the opposite sides and are non-intersecting as they are located in different regions of the plane bordered by the lines and . The opposite sides and are also non-intersecting as they are sides of the original -gon. In addition, .

Fig. 16

Let us prove by induction on that among the vertices of the -gon it is possible to choose 4 vertices which form a non-convex quadrilateral. Trivially, the base case is true. Assume now that and that the statement is true for all non-convex polygons with less sides. A non-convex polygon has an interior angle greater than and also an interior angle smaller than . Let's verify that it is not possible that every pair of angles one of which is greater than and the other one smaller than are neighbours to each other. Indeed, as each of the vertices has 2 neighbours, there could be at most 2 angles less than and at most 2 angles greater than . But , contradiction. Therefore, it is possible to find three consecutive vertices , , and and a vertex different from the former three, such that internal angle and internal angle .

Fig. 17

If there is a vertex in the interior of triangle , then is non-convex. If there are no vertices in the interior of triangle , then by removing point we get a -gon which still has interior angle . Hence it has 4 vertices forming a non-convex quadrilateral by the induction hypothesis.

Techniques

Convex hullsAngle chasingInduction / smoothing