Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given $n$ (pairwise) nonparallel lines in $\mathbb{R}^2 $. $\lbrace L_1,\ldots,L_n\rbrace $. The intersection of any two lines belongs to a third line in our set of lines. I would like to show that $\cap L_i\not = \emptyset.$

My best ideas suppose there is more than one point of intersection and to define a point of intersection of minimal distance (motivated by Kelly's proof of the Sylvester-Gallai Theorem ) from our original point of intersection then use the slopes of the lines to show that there is no such closest minimal intersection point by creating new points of intersection. However, there seems to be way too many cases.

Are there any nicer approaches to this problem? I was told this is an application of Sylvester-Gallai Theorem, but I don't see the connection. Any insight would be humbly appreciated.

share|cite|improve this question
up vote 0 down vote accepted

I think you're on the right track. A possible proof is as follows:

By assumption every point of intersection must have at least three lines going through it. Consider all pairs of points of intersection and lines, and choose the pair such that the perpendicular distance from the point to the line is minimum. Let the point be A and the line closest to it be lclose, and three lines through A be l1,l2,l3 clockwise as shown in the diagram attached.

enter image description here

Now there are two possible cases for the intersection point C of lclose with l2 we consider.

  1. Firstly, if it is anti-clockwise of the perpendicular bisector, then C is closer to l1 than A is to lclose, which is a contradiction. This is the case shown in the diagram.
  2. Otherwise, if it is on the perpendicular or clockwise of the perpendicular bisector, then C is closer to l3 than A is to lclose, which is again a contradiction.

Edit: Note that this proof relies on the fact that the lines are pairwise nonparallel, for otherwise if lclose and l1 were parallel the reasoning in the first case would not hold. As for what people mean by the question being an application of the Sylvester-Gallai Theorem, I think that the question is simply the projective dual of the Sylvester-Gallai Theorem.

share|cite|improve this answer
Is Kelly's proof restricted to the plane? – user62384 Mar 1 '13 at 18:54
@123kid If you're referring to my proof above, the proof should be valid for all spaces where nonparallel lines would intersect at one point and you can define a closest pair of points - not sure exactly what kind of space you're looking at though! – Vincent Tjeng Mar 2 '13 at 2:20

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.