Kvant Math Problem 1561

Let the convex polygon be $A_1A_2\ldots A_n$, indexed cyclically.

kvantmathematicsolympiad

Verified: no
Verdicts: UNKNOWN + UNKNOWN
Solve time: 9m22s
Source on kvant.digital

Problem

A convex polygon is given, no two of whose sides are parallel. For each of its sides, consider the angle under which that side is seen from the vertex farthest from the line containing the side. Prove that the sum of all such angles is equal to $180^\circ$.

M. V. Smurov

All-Russian Mathematical Olympiad for School Students (1996)

Exploration

Let the convex polygon be $A_1A_2\ldots A_n$, indexed cyclically. For a side $A_iA_{i+1}$, let $L_i$ be its supporting line. Since no two sides are parallel, the directions of the sides are all distinct.

The vertex farthest from $L_i$ must be one of the vertices where the distance function to $L_i$ attains its maximum. In a convex polygon, as one moves along the boundary, the distances to a fixed supporting line first increase and then decrease. Since no side is parallel to $L_i$, the maximum is attained at a unique vertex. Denote it by $B_i$.

The angle mentioned in the problem is $\angle A_iB_iA_{i+1}$.

To understand the geometry, consider the triangle $A_iB_iA_{i+1}$. The side $A_iA_{i+1}$ lies on $L_i$, and $B_i$ is the vertex of the polygon farthest from $L_i$. The lines $B_iA_i$ and $B_iA_{i+1}$ connect $B_i$ to the endpoints of the side. The angle $\angle A_iB_iA_{i+1}$ should be expressible through the directions of the two supporting lines through $B_i$ that separate $B_i$ from $A_i$ and $A_{i+1}$.

A natural idea is to look at the exterior angles of the polygon. Their sum is $360^\circ$. Since the desired sum is $180^\circ$, each angle $\angle A_iB_iA_{i+1}$ might correspond to half of some quantity whose total is $360^\circ$.

Let $B_i=A_k$. Because $A_k$ is the unique farthest vertex from $L_i$, the two neighboring vertices $A_{k-1}$ and $A_{k+1}$ lie on opposite sides of the perpendicular through $A_k$ to $L_i$. Equivalently, the direction of $L_i$ lies strictly between the directions of the two sides through $A_k$. Thus every side direction determines exactly one vertex whose angular sector contains that direction.

The directions of the sides form a cyclic sequence around the circle. At vertex $A_k$, the sector between the directions of the two adjacent sides has measure equal to the exterior angle $\varepsilon_k$. Every side direction belongs to exactly one such sector. Hence the side directions partition the total $360^\circ$ of exterior angle measure.

The crucial point is to identify $\angle A_iB_iA_{i+1}$ with one half of the exterior angle at $B_i$ corresponding to the sector containing the direction of $A_iA_{i+1}$.

Problem Understanding

We are given a convex polygon whose side directions are all distinct. For each side, we choose the vertex of the polygon that is farthest from the line containing that side. From that vertex, the side subtends a certain angle. We must prove that the sum of these angles, taken over all sides, equals $180^\circ$.

This is a Type B problem. We must prove a stated identity.

The core difficulty is to relate the angle under which a side is seen from its farthest vertex to a quantity attached to that vertex alone, and then show that all these quantities add up to $180^\circ$.

Proof Architecture

Lemma 1. For every side $A_iA_{i+1}$, the vertex farthest from its supporting line is unique.

Sketch. Distances from a supporting line along the boundary of a convex polygon increase and then decrease; because no side is parallel to the given side, a flat maximum cannot occur.

Lemma 2. If $B=A_k$ is the farthest vertex from the line containing $A_iA_{i+1}$, then the direction of $A_iA_{i+1}$ lies inside the angular sector bounded by the directions of the two sides meeting at $A_k$.

Sketch. The maximum of the distance function at $A_k$ implies that the projections of the adjacent edges on the normal direction have opposite signs.

Lemma 3. If the direction of a line lies inside the sector at $A_k$, then the angle under which that line segment is seen from $A_k$ equals one half of the exterior angle $\varepsilon_k$ at $A_k$.

Sketch. Express the angle as the difference of the angles made by the two rays from $A_k$ to the endpoints of the segment; these rays are symmetric with respect to the direction of the line.

Lemma 4. Each side direction belongs to exactly one vertex sector, and the total measure of all sectors is $360^\circ$.

Sketch. The sectors are exactly the exterior angles of the convex polygon.

The most delicate point is Lemma 3, where the geometric relation

$$\angle A_iB_iA_{i+1}=\frac{\varepsilon(B_i)}2$$

must be proved rigorously.

Solution

Let the vertices of the convex polygon be $A_1,A_2,\ldots,A_n$ in counterclockwise order. For the side $A_iA_{i+1}$, denote by $L_i$ its supporting line. Let $B_i$ be the vertex farthest from $L_i$, and let

$$\alpha_i=\angle A_iB_iA_{i+1}.$$

We shall prove that

$$\sum_{i=1}^{n}\alpha_i=180^\circ.$$

For a fixed side $A_iA_{i+1}$, consider the distance from the vertices of the polygon to $L_i$. Since the polygon is convex, these distances, listed in cyclic order, increase from $0$ to a maximum and then decrease back to $0$. If two consecutive vertices had the same maximal distance, the side joining them would be parallel to $L_i$. The hypothesis excludes parallel sides, hence the maximum is attained at a unique vertex. Thus $B_i$ is well defined.

Let $B_i=A_k$. Let $u$ be a unit normal vector to $L_i$, directed toward the interior of the polygon. The function $X\mapsto u\cdot X$ attains its maximum over the vertices at $A_k$. Hence

$$u\cdot(A_{k-1}-A_k)<0, \qquad u\cdot(A_{k+1}-A_k)<0.$$

Therefore the two edges through $A_k$ lie on opposite sides of the line through $A_k$ parallel to $L_i$. Equivalently, the direction of $L_i$ lies strictly between the directions of the sides $A_{k-1}A_k$ and $A_kA_{k+1}$.

Let $\varepsilon_k$ be the exterior angle of the polygon at $A_k$. The set of directions lying between the directions of $A_{k-1}A_k$ and $A_kA_{k+1}$ forms an angular sector of measure $\varepsilon_k$. We have just shown that the direction of $L_i$ belongs to this sector.

Now fix a vertex $A_k$. Let the directions of the sides $A_{k-1}A_k$ and $A_kA_{k+1}$ bound its exterior-angle sector. Take any line $L$ whose direction lies inside this sector. Let $P,Q$ be two points of $L$ situated on the two rays determined by the sides of the sector. Then the rays $A_kP$ and $A_kQ$ form with the direction of $L$ equal angles of opposite sign. Consequently the angle between $A_kP$ and $A_kQ$ is exactly half the angle between the bounding sides of the sector. Hence

$$\angle PA_kQ=\frac{\varepsilon_k}{2}.$$

Applying this to $L=L_i$, $P=A_i$, $Q=A_{i+1}$, and $A_k=B_i$, we obtain

$$\alpha_i=\frac{\varepsilon(B_i)}2.$$

It remains to count how many times each exterior angle contributes.

The direction of every side determines a unique sector, because the sectors corresponding to the vertices are disjoint and their union is the whole circle of directions. The sector at $A_k$ has measure $\varepsilon_k$, and the sum of all exterior angles of a convex polygon is

$$\sum_{k=1}^{n}\varepsilon_k=360^\circ.$$

Each side direction belongs to exactly one sector, namely the sector corresponding to the unique vertex farthest from the supporting line of that side. Therefore

$$\sum_{i=1}^{n}\alpha_i = \frac12 \sum_{k=1}^{n}\varepsilon_k = \frac12\cdot 360^\circ = 180^\circ.$$

This completes the proof.

∎

Verification of Key Steps

The first delicate step is the uniqueness of the farthest vertex. If two consecutive vertices had equal maximal distance from the line $L_i$, then every point of the side joining them would have the same distance from $L_i$. That side would be parallel to $L_i$, contradicting the assumption that no two sides are parallel. Hence the maximum cannot be attained at more than one vertex.

The second delicate step is the placement of the direction of $L_i$ inside the sector at the farthest vertex $A_k$. The distance to $L_i$ is the linear functional $u\cdot X$. Since $A_k$ is the unique maximizer, moving from $A_k$ along either adjacent edge decreases this functional. Thus both adjacent edge vectors have negative scalar product with $u$. Geometrically, both edges lie in the same open half-plane bounded by the line through $A_k$ parallel to $L_i$. This is exactly the condition that the direction of $L_i$ lies between the directions of those edges.

The third delicate step is the identity

$$\alpha_i=\frac{\varepsilon(B_i)}2.$$

A careless argument might confuse the interior and exterior angles. The sector determined by the adjacent side directions at $B_i$ has measure $\varepsilon(B_i)$, the exterior angle. The rays from $B_i$ to the endpoints of the side lie symmetrically with respect to the direction of that side line, so the angle between them is half the sector measure, not half the interior angle. Using the interior angle would produce

$$\frac{(n-2)180^\circ}{2},$$

which is incorrect already for a triangle.

Alternative Approaches

A dual interpretation uses the circle of directions. Associate to each vertex $A_k$ the arc of directions lying between its two adjacent side directions. The length of this arc is the exterior angle $\varepsilon_k$. The side directions form one point in each such arc. For a side whose direction falls in the arc corresponding to $A_k$, the subtended angle equals half the arc length. Summing over all side directions immediately gives one half of the total circumference of the direction circle, namely $180^\circ$.

Another approach uses support functions. Let $h(\theta)$ be the support function of the polygon. For the side with direction $\theta$, the farthest vertex is the vertex where $h(\theta+\frac{\pi}{2})$ is attained. The normal fan of the polygon partitions the circle into intervals of lengths equal to the exterior angles. The subtended angle associated with a direction inside one interval is half the interval length. Integration over the circle reduces the statement to the fact that the total length of the normal fan is $2\pi$. The geometric proof above is preferable because it avoids support-function machinery and keeps every step elementary.