Discrete & Computational Geometry

, Volume 35, Issue 3, pp 361–373

Sylvester–Gallai Theorems for Complex Numbers and Quaternions


DOI: 10.1007/s00454-005-1226-7

Cite this article as:
Elkies, N., Pretorius, L. & Swanepoel, K. Discrete Comput Geom (2006) 35: 361. doi:10.1007/s00454-005-1226-7


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.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Department of Mathematics, Harvard University, Cambridge, MA 02138USA
  2. 2.Department of Mathematics and Applied Mathematics, University of Pretoria, Pretoria 0002South Africa
  3. 3.Department of Mathematical Sciences, University of South Africa, PO Box 392, Pretoria 0003South Africa

Personalised recommendations