Kvant Math Problem 451
Consider first the simplest nontrivial configuration of points, namely three points not lying on a line.
Verified: no
Verdicts: SKIP + SKIP
Solve time: 7m17s
Source on kvant.digital
Problem
Several points, not all lying on a single line, are marked in the plane, and a number is written next to each of them. It is known that whenever a line passes through two or more marked points, the sum of all the numbers written next to those points is zero. Prove that all the numbers are equal to zero.
F. V. Vainshtein
All-Union Mathematical Olympiad for School Students (XI, 1977, Grade 8)
Exploration
Consider first the simplest nontrivial configuration of points, namely three points not lying on a line. Label them $A$, $B$, and $C$, with numbers $a$, $b$, and $c$ written next to them. Any line through two points imposes the condition that the sum of the numbers on that line is zero. Thus the lines $AB$, $AC$, and $BC$ give the equations $a+b=0$, $a+c=0$, and $b+c=0$. Solving this system yields $a=b=c=0$. This indicates that for any three non-collinear points, the numbers must vanish. Next, examine four points in general position and check whether adding an extra point could admit a nonzero assignment. If one point were nonzero, then every line connecting it to any other point would force that other point to carry the opposite number. Iterating along different lines quickly leads to a contradiction because the sum over three or more collinear points would no longer vanish. The key insight is that the condition on lines imposes linear constraints that are so tightly coupled that no nonzero assignment is consistent with all lines through two or more points.
Problem Understanding
The problem asks to prove that a collection of numbers assigned to planar points must all vanish under a linear condition on collinear subsets. This is a Type B problem because the statement is a pure assertion: "all numbers are zero." The core difficulty is showing that a local condition (sum zero on every line through two or more points) propagates globally to force every number to be zero. The challenge lies in handling configurations with more than three points, ensuring that no subtle arrangement allows nonzero numbers while satisfying all collinear sums.
Proof Architecture
The proof will rely on the following lemmas. Lemma 1: For any three non-collinear points, the numbers next to them are all zero. This follows by writing the sum-zero equations for each pair of points. Lemma 2: If four points are in general position, any assignment satisfying the line-sum condition reduces to the same zero assignment on every triple; this follows by applying Lemma 1 to each triple. Lemma 3: The property extends inductively to any finite number of points not all on a line; adding a point outside the convex hull of existing points produces lines with previously established points, forcing the new number to be zero. The hardest direction is the induction step in Lemma 3, ensuring that adding a new point cannot allow a nonzero number while maintaining the sum-zero condition.
Solution
Label the set of marked points as $P_1, P_2, \dots, P_n$ with corresponding numbers $x_1, x_2, \dots, x_n$. Begin with Lemma 1. Consider three points $P_1$, $P_2$, and $P_3$ that are not collinear, with numbers $x_1$, $x_2$, and $x_3$. The line through $P_1$ and $P_2$ imposes $x_1+x_2=0$. The line through $P_1$ and $P_3$ gives $x_1+x_3=0$, and the line through $P_2$ and $P_3$ gives $x_2+x_3=0$. Solving these three linear equations yields $x_1=x_2=x_3=0$, proving Lemma 1.
For Lemma 2, consider four points $P_1$, $P_2$, $P_3$, $P_4$ in general position. Apply Lemma 1 to the triple $P_1$, $P_2$, $P_3$ to conclude $x_1=x_2=x_3=0$. The line through $P_1$ and $P_4$ imposes $x_1+x_4=0$, and since $x_1=0$, it follows that $x_4=0$. This shows that the four numbers must vanish.
For Lemma 3, assume by induction that for some $k\ge 3$, any $k$ points not all on a line have numbers $x_1,\dots,x_k$ all zero. Consider adding a point $P_{k+1}$ not lying on any line containing all previously marked points. There exists a triple of points $P_i$, $P_j$, $P_{k+1}$ that are not collinear. The lines through pairs among these three points impose sum-zero conditions. By the induction hypothesis, $x_i=x_j=0$, hence the line through $P_i$ and $P_{k+1}$ gives $0+x_{k+1}=0$, so $x_{k+1}=0$. Therefore, the property extends to any finite set of points not all on a line.
Applying this argument repeatedly establishes that all numbers $x_1,\dots,x_n$ must be zero. This completes the proof. ∎
Verification of Key Steps
The crucial steps are the base case with three non-collinear points and the induction step adding a new point. Recomputing the three-point system confirms that the only solution is $0$ for each number. For the induction, consider a specific four-point configuration forming a convex quadrilateral. Assign numbers to three vertices as zero. Connecting the new vertex to any of the three yields lines with sum-zero constraints, which force the new number to vanish. Testing a triangle with a point inside confirms no alternative nonzero assignment can satisfy all pairwise sums.
Alternative Approaches
One alternative approach is to view the numbers as defining a function on the plane such that the sum along any line through marked points vanishes. This leads to a system of linear equations in several variables, where each equation corresponds to a line through at least two points. Linear algebra then guarantees that if the points are not all collinear, the only solution is the zero vector. This method is more abstract but less constructive than the induction on point addition used above. The main approach is preferable because it works elementarily with geometric configurations, requires no matrix theory, and explicitly demonstrates how the condition propagates to each point.