Proving Sylvester's Problem: Melchior's Three Ordinary Lines Proof

Added:

The Hesse Configuration and Field-Dependent Limitations of Sylvester's Theorem

While Melchior's proof elegantly solves Sylvester's problem for the real projective plane using topology and Euler's formula, it highlights a major limitation: the theorem is not universally true across all mathematical fields. In the complex projective plane, the Sylvester-Gallai theorem fails entirely. The premier counterexample is the Hesse configuration, which consists of 9 points and 12 lines where every line contains exactly three points, meaning there are zero ordinary lines. Introducing this counterpoint shows students that Melchior's topological approach relies fundamentally on the ordered nature of real numbers. It demonstrates that incidence geometry theorems are highly sensitive to the underlying coordinate field, preventing Sylvester's result from being a universal law of points and lines.

The statement and formulation of the Sylvester-Gallai Theorem, which asserts that any finite set of non-collinear points in the plane determines at least one line containing exactly two points.
The principle of projective duality, specifically how points and lines are dual to each other and how incidence relations are preserved.
Euler's polyhedral formula (V - E + F = 2) and its application to cell decompositions of the real projective plane.
Basic graph theory concepts, including planar graphs, vertices, edges, faces, and vertex/face degrees.
Leroy Milton Kelly's metric proof of the Sylvester-Gallai theorem, which uses Euclidean distances and projection rather than projective topology.
The De Bruijn–Erdős Theorem, which generalizes the concept to linear spaces, stating that any non-collinear configuration of n points determines at least n lines.
The behavior of Sylvester-type problems in complex projective spaces, including counterexamples like the Hesse configuration.
Advanced topics in topological graph theory and the study of line arrangements, including the enumeration of cells and ordinary points.
106 views1likes7:39@peymanafshani9304Original Release: 2015-01-22

Melchior's 1940 proof of Sylvester's theorem demonstrates that any set of n points in the plane, no three collinear, must contain at least three ordinary lines (lines passing through exactly two points). The proof uses duality to transform the problem into finding ordinary intersections in the dual space, then applies Euler's formula for the projective plane (V - E + R = 1) to show that the number of vertices of degree 4 (ordinary intersections) must be at least 3, thereby proving the existence of at least three ordinary lines.