mathematics

Sylvester–Gallai configuration

Sylvester–Gallai configuration is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Sylvester–Gallai configuration rather than just read about it. In short: 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…

Key takeaways

Sylvester–Gallai configuration belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Sylvester–Gallai configuration to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Sylvester–Gallai configuration from memory before moving on to harder problems.

Reference excerpt

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

( p 2 ) = ( b 2 ) ℓ . {\displaystyle {\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.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Sylvester–Gallai configuration

Start with the simplest possible case. Write down what Sylvester–Gallai configuration claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Sylvester–Gallai configuration before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Sylvester–Gallai configuration ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Sylvester–Gallai configuration

In research: Sylvester–Gallai configuration appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Sylvester–Gallai configuration in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Sylvester–Gallai configuration is common in secondary-school and first-year university syllabi. It links to neighbouring topics Configurations (geometry), so understanding it makes those chapters shorter.
In everyday life: Look for Sylvester–Gallai configuration outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Sylvester–Gallai configuration” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Sylvester–Gallai configuration in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Sylvester–Gallai configuration means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Sylvester–Gallai configuration out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Sylvester–Gallai configuration in simple terms?

Why does Sylvester–Gallai configuration matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Sylvester–Gallai configuration?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Sylvester–Gallai configuration.