Example 3 Let be an integer greater than 1. There are points on the plane, and no three points are collinear. Among these points, points are colored blue, and the remaining points are colored red. If a line passing through one red point and one blue point satisfies that the number of blue points on each side of the line equals the number of red points on that side, then this line is called a "balanced line". Prove: there are at least two balanced lines.
Problem 869
Official solution
【Analysis】First, prove that each vertex on the convex hull of these points lies on a balance line.
Assume is a vertex on the convex hull of the known points. Without loss of generality, let be a red point. Thus, there exists a line such that all points (excluding ) are on the same side of the line . If the line is rotated clockwise around point , it will pass through all the blue points in a certain order.
Let the blue points that the line passes through in sequence when rotated clockwise around point be . When rotates to point , the number of blue points and red points that has passed through are denoted as and , respectively. Then,
Thus, the sequence starts with non-negative integers and ends with non-positive integers. As increases, does not decrease, and increases by 1, indicating that the difference between consecutive terms in the sequence does not exceed 1.
In fact, for , we have
.
Therefore, there must exist some point such that .
Thus, .
Hence, is a balance line.
Since the convex hull of points has at least three vertices, and each vertex of the convex hull lies on a balance line, there are at least two different balance lines.