arXiv · math/0403023
Sylvester-Gallai Theorems for Complex Numbers and Quaternions
Abstract
A Sylvester-Gallai (SG) configuration is a finite set S of points such that the line through any two points in S contains a third point of S. According to the Sylvester-Gallai Theorem, an SG configuration in real projective space must be collinear. A problem of Serre (1966) asks whether an SG configuration in a complex projective space must be coplanar. This was proved by Kelly (1986) using a deep inequality of Hirzebruch. We give an elementary proof of this result, and then extend it to show that an SG configuration in projective space over the quaternions must be contained in a three-dimensional flat.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Noam Elkies, Lou M. Pretorius, Konrad J. Swanepoel. 2006-02-15. Sylvester-Gallai Theorems for Complex Numbers and Quaternions. https://doi.org/10.1007/s00454-005-1226-7
Cite the original work for its findings. Save a collection to share your selection of sources.