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.

13 pages, 3 figures

Cited by in corpus (10)

• Quaternions in mathematical physics (1): Alphabetical bibliography
• The Sylvester-Gallai Theorem, colourings and algebra
• Elementary incidence theorems for complex numbers and quaternions
• Topological representation of matroids from diagrams of spaces
• Sylvester-Gallai for Arrangements of Subspaces
• From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits
• On the number of ordinary lines determined by sets in complex space
• Embedding a Latin square with transversal into a projective space
• On a Conjecture of Kelly on $(1,3)$-representation of Sylvester Gallai Designs
• On some points-and-lines problems and configurations