# Roberts's triangle theorem

Roberts's triangle theorem, a result in discrete geometry, states that every arrangement of $n$ lines, with no parallel lines and no crossings of more than two lines, has at least $n-2$ triangular faces. Thus, three lines form a triangle, four lines form at least two triangles, five lines form at least three triangles, etc. It is named after Samuel Roberts, a British mathematician who published it in 1889.

## Statement and example

The theorem states that every simple arrangement of $n$ lines in the Euclidean plane has at least $n-2$ triangular faces. Here, an arrangement is simple when no two of its lines are parallel and no three lines pass through the same point. A face is one of the polygons formed by the arrangement, not crossed by any of its lines. Faces may be bounded or infinite, but only the bounded faces with exactly three sides count as triangles for the purposes of the theorem.
One way to form an arrangement of $n$ lines with exactly $n-2$ triangular faces is to choose the lines to be tangent to a semicircle. For lines arranged in this way, the only triangles are the ones formed by three lines with consecutive points of tangency. The other faces of this arrangement are either bounded quadrilaterals, or unbounded. As the $n$ lines have $n-2$ consecutive triples, they also have $n-2$ triangles.

## Proof

Branko Grünbaum found the proof in Roberts's original paper "unconvincing", and credits the first correct proof of Roberts's theorem to Robert W. Shannon, in 1979. He presents instead the following more elementary argument, first published in Russian by Alexei Belov. It depends implicitly on a weaker version of the same theorem, according to which every simple arrangement of three or more lines has at least one triangular face. This follows easily by induction from the fact that adding a line to an arrangement cannot decrease the number of triangular faces: if the line cuts an existing triangle, one of the resulting two pieces is again a triangle. If it were true more strongly that adding a line always increased the number of triangles, then a similar induction would prove Roberts's theorem, but it is not true. There exist arrangements for which, after adding a line, the number of triangles remains unchanged.
Instead, Belov uses the following argument. If the $n$ given lines are all moved without changing their slopes, their new positions can be described by a system of $n$ real numbers, the offsets of each line from its original position. For each triangular face, there is a linear equation on the offsets of its three lines that, if satisfied, causes the face to retain its original area. If there could be fewer than $n-2$ triangles, then (because there would be more variables than equations constraining them) it would be possible to fix two of the lines in place and find a simultaneous linear motion of all remaining lines, keeping their slopes fixed, that preserves all of the triangle areas. Such a motion must pass through arrangements that are not simple, for instance when one of the moving lines passes over the crossing point of the two fixed lines. At the time when the moving lines first form a non-simple arrangement, three or more lines meet at a point. Just before these lines meet, by the weaker version of the theorem, this subset of lines would have a triangular face. Because this meeting is the first time the arrangement becomes non-simple, it cannot have changed its combinatorial structure from the original arrangement, which must therefore also contain the same triangle. At the time when the lines defining this triangle meet, its area becomes zero, but this contradicts the invariance of the areas of the triangles in the initial arrangement. The contradiction shows the impossibility of the assumption that there are fewer than $n-2$ triangles.

## Related results

Whereas Roberts's theorem concerns the fewest possible triangles made by a given number of lines, the related Kobon triangle problem concerns the largest number possible. The two problems differ already for $n=5$, where Roberts's theorem guarantees that three triangles will exist, but the solution to the Kobon triangle problem has five triangles.
Roberts's theorem can be generalized from simple line arrangements to some non-simple arrangements, to arrangements in the projective plane rather than in the Euclidean plane, and to arrangements of hyperplanes in higher-dimensional spaces. Beyond line arrangements, the same bound as Roberts's theorem holds for arrangements of pseudolines.