Fine Art


In geometry, a Sylvester–Gallai configuration consists of a finite subset of the points of a projective space with the property that the line through any two of the points in the subset also passes through at least one other point of the subset.

Instead of defining Sylvester–Gallai configurations as subsets of the points of a projective space, they may be defined as abstract incidence structures of points and lines, satisfying the properties that, for every pair of points, the structure includes exactly one line containing the pair and that every line contains at least three points. In this more general form they are also called Sylvester–Gallai designs. A closely related concept is a Sylvester matroid, a matroid with the same property as a Sylvester–Gallai configuration of having no two-point lines.

Real and complex embeddability

In the Euclidean plane, the real projective plane, higher-dimensional Euclidean spaces or real projective spaces, or spaces with coordinates in an ordered field, the Sylvester–Gallai theorem shows that the only possible Sylvester–Gallai configurations are one-dimensional: they consist of three or more collinear points. Jean-Pierre Serre (1966) was inspired by this fact and by the example of the Hesse configuration to ask whether, in spaces with complex-number coordinates, every Sylvester–Gallai configuration is at most two-dimensional. Erdős (1980) repeated the question. Kelly (1986) answered Serre's question affirmatively; Elkies, Pretorius & Swanepoel (2006) simplified Kelly's proof, and proved analogously that in spaces with quaternion coordinates, all Sylvester–Gallai configurations must lie within a three-dimensional subspace.

Projective configurations

Motzkin (1951) studied the projective configurations that are also Sylvester–Gallai configurations; a projective configuration has the additional requirement that every two points have equal numbers of lines through them and every two lines contain equal numbers of points. The Sylvester–Gallai configurations include, for instance, the affine and projective spaces of any dimension defined over finite fields, and these are all also projective configurations.

Every projective configuration can be given a notation (pa b), where p is the number of points,  the number of lines, a the number of lines per point, and b the number of points per line, satisfying the equation pa = ℓb. Motzkin observed that, for these parameters to define a Sylvester–Gallai design, it is necessary that b > 2, that p <  (for any set of non-collinear points in a projective space determines at least as many lines as points) and that they also obey the additional equation

\( \binom{p}{2}=\binom{b}{2}\ell. \)

For, the left hand side of the equation is the number of pairs of points, and the right hand side is the number of pairs that are covered by lines of the configuration.

Sylvester–Gallai designs that are also projective configurations are the same thing as Steiner systems with parameters ST(2,b,p).

Motzkin listed several examples of small configurations of this type:

  • 7373, the parameters of the Fano plane, the projective plane over a field of two elements.
  • 94123, the parameters of the Hesse configuration. This is the affine plane over a three-element field, and can also be realized with complex-number coordinates, as the set of inflection points of an elliptic curve.
  • 134134, the parameters of the projective plane over a three-element field.
  • 136263, the parameters of the two 13-element Steiner triple systems.
  • 157353, the parameters of a three-dimensional projective space over a two-element field and of 79 other Steiner triple systems
  • 165204, the parameters of the affine plane over a four-element field.
  • 215215, the parameters of the projective plane over a four-element field.
  • 256305, the parameters of the affine plane over a five-element field.

Boros, Füredi & Kelly (1989) and Bokowski & Richter-Gebert (1992) studied alternative geometric representations of Sylvester–Gallai designs, in which the points of the design are represented by skew lines in four-dimensional space and each line of the design is represented by a hyperplane. Both the seven-point and 13-point projective planes have representations of this type.
Other examples

Kelly & Nwankpa (1973) more generally classified all non-collinear Sylvester–Gallai configurations and Sylvester–Gallai designs over at most 14 points. They include a unique design with ten points; in it, some points are contained in three four-point lines while other points belong to three three-point lines and one four-point line. There is also a unique 11-point Sylvester–Gallai design, two different 12-point designs, and four irregular 13-point designs. For 14 points, they found that again there was only one possible Sylvester–Gallai design.

Bokowski, Jürgen; Richter-Gebert, Jürgen (1992), "A new Sylvester-Gallai configuration representing the 13-point projective plane in R4", Journal of Combinatorial Theory, Series B 54 (1): 161–165, doi:10.1016/0095-8956(92)90075-9, MR 1142273.
Boros, Endre; Füredi, Zoltán; Kelly, L. M. (1989), "On representing Sylvester-Gallai designs", Discrete and Computational Geometry 4 (4): 345–348, doi:10.1007/BF02187735, MR 996767.
Elkies, Noam; Pretorius, Lou M.; Swanepoel, Konrad J. (2006), "Sylvester–Gallai theorems for complex numbers and quaternions", Discrete and Computational Geometry 35 (3): 361–373, arXiv:math/0403023, doi:10.1007/s00454-005-1226-7, MR 2202107.
Erdős, P. (1980), "Some combinational problems in geometry", Geometry and differential geometry (Proc. Conf., Univ. Haifa, Haifa, 1979) (PDF), Lecture Notes in Mathematics 792, Berlin: Springer, pp. 46–53, doi:10.1007/BFb0088660, MR 585852.
Kelly, L. M. (1986), "A resolution of the Sylvester–Gallai problem of J. P. Serre", Discrete and Computational Geometry 1 (1): 101–104, doi:10.1007/BF02187687.
Kelly, L. M.; Nwankpa, S. (1973), "Affine embeddings of Sylvester-Gallai designs", Journal of Combinatorial Theory, Series A 14: 422–438, doi:10.1016/0097-3165(73)90014-9, MR 0314656
Motzkin, Th. (1951), "The lines and planes connecting the points of a finite set", Transactions of the American Mathematical Society 70: 451–464, doi:10.1090/S0002-9947-1951-0041447-9, MR 0041447.
Serre, Jean-Pierre (1966), "Advanced Problems: 5350-5359", American Mathematical Monthly 73 (1): 89, doi:10.2307/2313941, JSTOR 2313941 |contribution= ignored (help)

Mathematics Encyclopedia

Retrieved from ""
All text is available under the terms of the GNU Free Documentation License

Home - Hellenica World