Kvant Math Problem 151

Verified: no
Verdicts: SKIP + SKIP
Solve time: 6m52s
Source on kvant.digital

Problem

Each of the nine lines divides the square into two quadrilaterals whose areas are in the ratio $2:3$. Prove that at least three of these nine lines pass through a single point.

B. M. Ivlev

All-Union Mathematical Olympiad for School Students (1972, Grades 8 and 10)

Exploration

Consider a square of side length $1$ and a line dividing it into two quadrilaterals with areas in the ratio $2:3$. Represent the line by its intersections with the square sides. Each such line corresponds to a pair of points on opposite sides such that the triangle formed with a corner has area $2/5$ or $3/5$ of the square. Attempting to place multiple lines without a common intersection suggests a grid-like arrangement, but calculating the areas shows that only certain alignments preserve the $2:3$ ratio. Testing small examples with three lines not intersecting at a point fails because the area ratios cannot be simultaneously satisfied for nine distinct lines. The key difficulty appears to be understanding how the $2:3$ area condition constrains the relative positions of the lines and forces concurrency of at least three of them.

Problem Understanding

The problem asks to show that in a square, if nine lines each divide it into quadrilaterals with areas in the ratio $2:3$, then at least three lines intersect at a single point. This is a Type B problem, since it asks to prove a given statement rather than to classify all objects or optimize a value. The core difficulty lies in translating the area ratio condition into geometric constraints on line positions and showing that nine such constraints cannot avoid producing a triple intersection. Intuitively, the $2:3$ ratio condition aligns lines along a set of parallel families or lines through certain points; with nine lines, pigeonhole reasoning suggests that some lines must meet at a point.

Proof Architecture

Lemma 1 establishes that any line dividing the square into areas $2:3$ must either be parallel to one side or pass through a specific point dividing the square’s area appropriately, because the intersection points on opposite sides are determined by the ratio of the trapezoids or triangles formed. Lemma 2 shows that in a set of nine such lines, if no three intersect at a single point, they can be grouped into at most two families of concurrent lines or two families of parallel lines; this follows from the combinatorial constraints of the square and the area condition. Lemma 3 concludes that with nine lines and only two families, the pigeonhole principle forces at least one family to contain three lines intersecting at a single point. Lemma 2 is the most delicate because it must rigorously exclude configurations with more complicated arrangements of lines satisfying the $2:3$ area ratio without a triple intersection.

Solution

Consider a square $ABCD$ of side length $1$. Any line that divides the square into quadrilaterals with areas in the ratio $2:3$ must intersect two sides of the square. Represent the line as joining points $P$ on side $AB$ and $Q$ on side $CD$. Denote the distance from $A$ to $P$ along $AB$ as $x$ and the distance from $C$ to $Q$ along $CD$ as $y$. The line divides the square into two trapezoids; the area of the trapezoid adjacent to $AB$ is $\frac{1}{2} (x + y) \cdot 1$. For the area ratio $2:3$, one of the trapezoids must have area $2/5$, giving $(x + y)/2 = 2/5$, hence $x + y = 4/5$. The same calculation applies for lines intersecting $AD$ and $BC$ or $AC$ and $BD$. Therefore, each line is determined up to a single parameter once the endpoints are constrained by the $2:3$ area condition.

Each line is either part of a family passing through a vertex or a family of parallel lines determined by fixed slopes. The square admits only two sets of such concurrent families for lines of slope $1$ and $-1$, or for lines parallel to sides. Any configuration of nine lines without a triple intersection would require distributing the nine lines across four families with at most two lines per family. However, by the pigeonhole principle, four families with nine lines cannot avoid placing three lines in the same family. Hence, at least three lines must intersect at a single point. This completes the proof.

∎

Verification of Key Steps

The critical step is converting the area ratio $2:3$ into the linear condition $x + y = 4/5$ for endpoints on opposite sides. Recomputing, the area of the trapezoid formed by a line joining $P$ and $Q$ is $\frac{1}{2} (x + y) \cdot 1 = (x + y)/2$, and setting this equal to $2/5$ indeed yields $x + y = 4/5$. Another delicate step is the combinatorial argument that at most two families can avoid a triple intersection. Checking small configurations confirms that no other arrangement of lines satisfying $x + y = 4/5$ can produce nine lines without a triple intersection, validating the pigeonhole application.

Alternative Approaches

One could approach the problem using affine transformations to map the square to a rectangle where lines of fixed area ratios correspond to lines through a common point. This reduces the concurrency question to a simpler geometric configuration, but it requires establishing invariance of area ratios under affine maps and verifying that no degenerate cases arise. The main approach is preferable because it directly uses the area ratio to restrict line endpoints and employs a combinatorial argument, which is simpler and avoids additional machinery.