The Sylvester–Gallai Theorem
Every finite set of points in the Euclidean plane that is not collinear has a line that passes through exactly two of the points. This proof is by Michigan State University mathematician Leroy Milton Kelly. Consider a set S of points that aren’t all collinear, and define a connecting line to be a line that contains at least two of these points. There must be some point P and connecting line ℓ that are closer together than any other point-line pair in the set. Kelly now proves that ℓ contains only two of the points in S. Assume that this...
Summary
Leroy Milton Kelly presents a proof of the Sylvester–Gallai theorem, demonstrating that any non-collinear set of points in a plane contains at least one line that intersects exactly two of those points. This insight delves into the geometric relationships of point sets and could have implications for various mathematical fields.
Comments (28 of ) ⌛