## You are here

HomeSylvester's theorem

## Primary tabs

# Sylvester’s theorem

For every finite collection of non-collinear points in Euclidean space, there is a line that passes through exactly two of them.

###### Proof.

Consider all lines passing through two or more points in the collection. Since not all points lie on the same line, among pairs of points and lines that are non-incident we can find a point $A$ and a line $l$ such that the distance $d(A,l)$ between them is minimal. Suppose the line $l$ contained more than two points. Then at least two of them, say $B$ and $C$, would lie on the same side of the perpendicular from $p$ to $l$. But then either $d(AB,C)$ or $d(AC,B)$ would be smaller than the distance $d(A,l)$ which contradicts the minimality of $d(A,l)$. ∎

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

52C35*no label found*51M04

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections