In Search of Melchior's Ordinary Points
Jonathan Lenchner, Rik Sengupta
Abstract
In 1893, James Joseph Sylvester posed the following problem: given n points in the plane, not all collinear, must there be a line determined by two of the points that does not pass through any of the other points? In 1940, Eberhard Melchior studied the equivalent dual problem in the projective plane: given a set of n lines in the (real) projective plane, not all passing through a common point, must there be a point where exactly two of the lines intersect? Such a point of intersection is called an *ordinary point*. Via a clever double-counting argument, Melchior found that in fact there must be at least three such points. Given the many simple "visual" proofs of what is today known as the Sylvester-Gallai Theorem --- the theorem that states there must be at least one ordinary point --- a natural question is whether there is a simple visual proof that recovers all three of Melchior's ordinary points. This paper provides such a proof.
Create a lesson
Related papers
The Spherical Hadwiger Theorem
Suijie Wang, Shengguo Wu
Linear isoperimetric filling inequalities in Hadamard spaces at and above the asymptotic rank
Jonas W. Peteranderl
Isometry invariant valuations on spherical polytopes
Jonas Knoerr
The Kernel Deficit Dominates Twice the Hull Deficit: A Sharp Strengthening of Nakano's Inequality
Dakota Charles Baker
Volume and Projection Inequalities II: Determinants and Lp-Sums
Matthieu Fradelizi, Auttawich Manui, Cheikh Saliou Ndiaye et al.
An Approach to Study the Structural Consistency of Triangle Badness Functions and Distance Metrics
Bowen Liu, Yizhou Wang, Lingqian Meng