Projective Geometry
Projective Geometry
Add "points at infinity" to make every pair of lines meet — invariants under projection (perspective)
Projective geometry extends Euclidean geometry by adding points at infinity (one for each direction in the plane), so that every pair of lines — including parallel lines — meets at exactly one point. The projective plane ℝℙ² is the set of lines through the origin in ℝ³, parameterized by homogeneous coordinates [X : Y : Z] modulo scalar multiplication. Roots in Renaissance perspective drawing (Brunelleschi 1413, Alberti 1435); modern formulation by Desargues (1639), Poncelet (1822), and Möbius (1827). Key invariants under projective transformations are incidence (point on line) and cross-ratio of four collinear points. Duality between points and lines: every theorem has a dual obtained by swapping. Foundational in computer vision (camera projection matrices), CAD, algebraic geometry (varieties live naturally in ℙⁿ).
- Definitionℝℙ² = lines through origin in ℝ³
- CoordinatesHomogeneous [X : Y : Z]
- No parallelsEvery two lines meet
- OriginsRenaissance, Desargues 1639, Poncelet 1822
- InvariantsIncidence, cross-ratio
- DualityPoints ↔ lines
Watch the 60-second explainer
A condensed visual walkthrough — narrated, captioned, under a minute.
Why projective geometry matters
Renaissance painters formalized projective geometry centuries before mathematicians did, working out vanishing points and horizon lines as practical tools for realistic perspective. The 19th-century revival under Poncelet and Möbius turned that craft into a rigorous theory, and the 20th-century rediscovery in computer vision and computer graphics made it a working language of every modern imaging system.
- Computer vision. The pinhole camera model is a projection ℝℙ³ → ℝℙ². Calibration, triangulation, fundamental and essential matrix estimation, homography from one image to another, and structure-from-motion all live in projective space and become linear after homogenization.
- Computer-aided design and graphics. Affine + perspective transforms compose as a single 4×4 matrix on homogeneous 4-vectors. Every modern GPU pipeline uses projective coordinates to compose modeling, viewing, and projection transforms before the final perspective divide by w.
- Algebraic geometry. Curves and surfaces in projective space are compact, intersect with predictable multiplicity (Bézout's theorem says two plane curves of degrees d and e meet in de points), and host the cohomology theories that drive modern algebraic geometry.
- Perspective drawing. Vanishing points are exactly the images of points at infinity, and the painter's "horizon line" is the image of the line at infinity. Brunelleschi, Alberti, and Dürer worked out projective constructions centuries before the formalism existed.
- Conic sections. All non-degenerate conics — ellipse, parabola, hyperbola — are projectively equivalent to a single conic in ℝℙ². The differences arise only when we ask how the curve meets the line at infinity (parabola is tangent; hyperbola crosses transversely; ellipse misses).
- Coding theory and finite geometry. Finite projective planes PG(2, q) over the field 𝔽_q have q² + q + 1 points and the same number of lines, with elegant axioms that produce error-correcting codes and combinatorial designs.
- Reciprocity and duality. The principle that every theorem has a dual halves the labor of geometry — proving Pascal's theorem about hexagons inscribed in a conic immediately gives Brianchon's theorem about hexagons circumscribed about one.
- Robotics and manipulator kinematics. Plücker line coordinates (homogeneous coordinates of lines in ℝℙ³) describe robot joints and screws cleanly, and projective duality between line and screw axes underlies the algebra of forward/inverse kinematics for serial manipulators.
- Game development. Vanishing-point grids, fake reflections, and shadow projection algorithms use 4×4 homogeneous matrices to handle projective transforms uniformly with the rest of the rendering pipeline.
Common misconceptions
- "Infinity is one point." In two dimensions, the points at infinity form an entire line (the line at infinity), with one point per direction. In three dimensions they form a whole projective plane.
- "ℝℙ² is just ℝ² with a few extra points." Globally it is a different topological space — non-orientable, with fundamental group ℤ/2ℤ, and not embeddable in ℝ³ as a smooth surface (the Boy surface and Roman surface are immersions with self-intersection).
- "Distance and angle still make sense." Projective transformations distort both. Only incidence relations and the cross-ratio are preserved. Reintroducing a notion of distance requires a metric structure (an "absolute conic" or extra data) on top of projective geometry.
- "Projective space is a vector space." ℝℙⁿ is a quotient of ℝⁿ⁺¹ \ {0} by scaling — not a vector space. You cannot meaningfully add two projective points; the operation that survives is "project a line through them."
- "Every projective plane is coordinatizable." Non-Desarguesian projective planes exist as combinatorial structures (Hall planes, Hughes plane, Moufang planes) that satisfy the incidence axioms but cannot be coordinatized over a field. Desargues' theorem is the synthetic indicator that an abstract projective plane comes from a vector space.
- "It's a 19th-century curiosity." Modern algebraic geometry, computer vision, robotics, and computer graphics all run on projective coordinates. The formalism is not optional in any of these fields.
Frequently asked questions
What does "point at infinity" mean concretely?
A point at infinity in ℝℙ² is the equivalence class of all parallel Euclidean lines having a common direction — it is where they "meet." In homogeneous coordinates [X : Y : Z], finite affine points have Z ≠ 0 and live at (X/Z, Y/Z); points at infinity have Z = 0 and are parametrized by [X : Y : 0] up to scaling, giving one extra point per direction. The collection of all such points forms a single line (the line at infinity) in ℝℙ².
What are homogeneous coordinates?
Homogeneous coordinates write a point in ℝℙⁿ as a tuple [X₀ : X₁ : … : Xₙ] of (n + 1) real numbers, not all zero, with the convention that any nonzero scalar multiple represents the same point: [λX₀ : … : λXₙ] = [X₀ : … : Xₙ]. They linearize projective transformations as ordinary matrix multiplication, eliminate special cases at infinity, and let computer-graphics pipelines compose translation, rotation, perspective, and projection as a single 4×4 matrix on 4-vectors.
How does duality work between points and lines?
In ℝℙ², points and lines are both parametrized by triples [a : b : c] modulo scaling — a point [X : Y : Z] is incident with a line aX + bY + cZ = 0 iff aX + bY + cZ = 0, an equation symmetric in the two roles. Swapping every "point" with "line" and "lies on" with "passes through" converts any true theorem into another true theorem: Pappus, Desargues, and Pascal each have dual statements about lines that are themselves classical projective theorems.
What is Desargues' theorem?
Two triangles ABC and A'B'C' in the projective plane are "in perspective from a point" if AA', BB', CC' are concurrent, and "in perspective from a line" if the three intersections AB ∩ A'B', BC ∩ B'C', CA ∩ C'A' are collinear. Desargues' theorem (1639) says these two notions are equivalent. It is the synthetic axiom that distinguishes coordinatizable projective planes from exotic non-Desarguesian planes that exist as combinatorial structures but cannot arise from a vector space.
Why do computer vision cameras use projective coordinates?
A pinhole camera maps a 3D world point to its image by the projection (X, Y, Z) → (X/Z, Y/Z), which is exactly the affine chart on ℝℙ³ → ℝℙ². Writing world points as [X : Y : Z : W] and image points as [u : v : w], the entire imaging process becomes a single 3×4 camera matrix multiplication. This linearizes calibration, triangulation, and homography estimation — without homogeneous coordinates, dividing by Z reintroduces nonlinear edge cases at every step.
How is projective geometry foundational for algebraic geometry?
Polynomial equations in projective space have cleaner intersection theory than in affine space. Bézout's theorem says two projective plane curves of degrees d and e meet in exactly de points, counted with multiplicity, including points at infinity — an identity that fails in affine space, where parallel lines have zero intersections. Smooth projective varieties are also compact, satisfy Poincaré duality, and host most of modern algebraic geometry's machinery (sheaves, cohomology, Hodge theory).