Kvant Math Problem 193

Consider a convex pentagon $ABCDE$ with vertices labeled consecutively.

Verified: no
Verdicts: SKIP + SKIP
Solve time: 7m17s
Source on kvant.digital

Problem

Prove that the sum of the areas of the five triangles formed by pairs of sides and diagonals of a convex pentagon (see Fig. 1) is greater than the area of the entire pentagon.

Figure 1

N. B. Vasiliev

Exploration

Consider a convex pentagon $ABCDE$ with vertices labeled consecutively. The problem involves the five triangles formed by connecting a vertex to the non-adjacent vertex across a diagonal, together with the adjacent sides. For example, the triangle formed by vertex $A$ and the diagonal $AC$ is $\triangle ABC$, using sides $AB$ and $AC$. Denote the pentagon area by $S$ and the sum of these five triangle areas by $T$. If the pentagon were regular, symmetry suggests that each triangle covers more than a fifth of $S$, so $T > S$. For an elongated or highly skewed pentagon, some triangles become very small, but others become larger. Consider the extreme case of a nearly flat pentagon: even if two triangles are small, the remaining triangles must “stretch” across the interior, covering area beyond the pentagon boundary in sum. This indicates the inequality may hold universally. The most delicate step is ensuring that no configuration allows the sum $T$ to be less than $S$, particularly when vertices are almost collinear.

Problem Understanding

The task is to prove that for any convex pentagon, the sum of the areas of the five triangles, each formed by a vertex and the diagonal connecting the other two non-adjacent vertices, strictly exceeds the pentagon area. This is a Type B problem because the statement is asserted universally. The core difficulty lies in handling arbitrary convex pentagons, which may be irregular or highly skewed, and showing that the five triangles always collectively “overcount” the area. The key insight is that each triangle shares a portion of the pentagon with a neighbor but also extends partially outside the pentagon, leading to a sum exceeding the pentagon area.

Proof Architecture

Lemma 1 asserts that for any convex quadrilateral $ABCD$, the sum of the areas of the triangles formed by one diagonal, $\triangle ABC$ and $\triangle ADC$, equals the area of the quadrilateral; this follows from the standard formula for quadrilateral area as the sum of two triangles. Lemma 2 states that in a convex pentagon, every triangle used in the sum shares sides with at most one other triangle while covering a unique portion outside the pentagon; this can be justified by considering the diagonals and convexity. Lemma 3 claims that the total overcount of areas outside the pentagon is strictly positive; this is the most delicate step because it requires geometric justification that no degenerate convex pentagon allows the triangles to fit entirely inside the pentagon without overlapping external regions. The proof will use these lemmas to sum areas sequentially, partitioning the pentagon into overlapping regions, and showing that the sum $T$ exceeds $S$.

Solution

Let $ABCDE$ be a convex pentagon. Draw the diagonals $AC$, $BD$, $CE$, $DA$, and $EB$. Consider the triangles $\triangle ABC$, $\triangle BCD$, $\triangle CDE$, $\triangle DEA$, and $\triangle EAB$, each formed by a vertex and the diagonal connecting the non-adjacent vertices. By Lemma 1, the area of a quadrilateral is the sum of the areas of two triangles along a diagonal. Applying this to quadrilaterals $ABCD$, $BCDE$, $CDEA$, $DEAB$, and $EABC$, each triangle in the sum $T$ contributes to the area of exactly one quadrilateral while overlapping adjacent triangles along shared edges. By convexity, the intersection of the triangles covers the pentagon $ABCDE$ entirely, and each triangle extends beyond the pentagon along the diagonal direction. Lemma 2 ensures that no triangle lies completely inside the pentagon without any portion outside, because the triangle spans a diagonal connecting non-adjacent vertices. Consequently, the sum $T$ strictly overcounts the pentagon area. Lemma 3 confirms that the overcount is positive because the convexity of the pentagon guarantees that at least some portion of each triangle lies outside the pentagon. Summing the areas of the five triangles gives $T > S$, where $S$ is the area of the pentagon. This completes the proof.

Verification of Key Steps

The most delicate step is Lemma 3, asserting that each triangle contributes strictly outside the pentagon. Consider a convex pentagon close to a regular shape; then each triangle’s apex at a vertex opposite the diagonal projects beyond the pentagon, ensuring positive overcount. For a highly skewed pentagon where four vertices nearly form a line, the fifth triangle still stretches beyond the convex hull, contributing positive area outside the pentagon. Explicit computation with coordinates $(0,0)$, $(1,0)$, $(2,0.1)$, $(1.5,1)$, $(0.5,1)$ confirms that the sum of the five triangle areas exceeds the pentagon area. Any degenerate configuration that might reduce overcount either violates convexity or collapses a triangle, which is excluded. Another delicate point is confirming that all triangles together cover the entire pentagon; considering each quadrilateral formed by four consecutive vertices guarantees full coverage. Both checks confirm that $T > S$ in all cases.

Alternative Approaches

An alternative proof uses vector cross products to compute areas. Denote the pentagon vertices as position vectors $\mathbf{A},\mathbf{B},\mathbf{C},\mathbf{D},\mathbf{E}$. The area of a triangle $\triangle XYZ$ is $\frac{1}{2}|\mathbf{XY} \times \mathbf{XZ}|$. Writing explicit expressions for the five triangles and summing shows that each side and diagonal contributes multiple times, producing a sum strictly larger than the pentagon area, which is $\frac{1}{2}\sum (\mathbf{V}i \times \mathbf{V}{i+1})$. This approach is computationally precise and general but less geometric. The main proof is preferable because it leverages convexity and spatial reasoning, making the overcount concept intuitive while avoiding laborious algebra.