Generated by GPT-5-mini| Projective plane | |
|---|---|
![]() Cmglee · CC BY-SA 4.0 · source | |
| Name | Projective plane |
| Field | Mathematics |
| Introduced | Antiquity; formalized 19th century |
| Notable examples | Real projective plane, Fano plane |
Projective plane A projective plane is a fundamental two-dimensional system in mathematics defined by incidence relations among points and lines, characterized by the properties that any two distinct points determine a unique line and any two distinct lines meet at a unique point. It appears across geometry, algebraic geometry, topology, and combinatorics, and connects to structures studied by Euclid, Desargues, Pascal, Pappus of Alexandria, Felix Klein, and Henri Poincaré. Projective planes serve as the setting for results in Galois theory, category theory, Lie groups, Riemann sphere, and complex analysis.
A projective plane is an incidence structure satisfying axioms analogous to those studied by Euclid and formalized in the 19th century by figures such as Jean-Victor Poncelet, Gaspard Monge, Michel Chasles, and Augustin-Louis Cauchy. Standard axioms require: any two distinct points lie on exactly one line; any two distinct lines meet in exactly one point; and there exist four points with no three collinear (a configuration related to Pappus of Alexandria and Desargues). From these axioms follow properties like the existence of duality maps studied by Projective transformation theorists including Felix Klein and Arthur Cayley, the notion of cross-ratio used by Bernhard Riemann and William Rowan Hamilton, and invariants appearing in work of Hermann Schwarz and Élie Cartan. Classical results connect to theorems named after Desargues and Pappus of Alexandria with implications for coordinatization by Galois-related fields.
Concrete models include the real projective plane obtained by identifying antipodal points on the unit sphere (a construction used in topology by Henri Poincaré), the complex projective plane central to Algebraic geometry studied by Alexander Grothendieck and Oscar Zariski, and finite models like the Fano plane which served as an early example in combinatorics and finite geometry explored by Évariste Galois and later by Marshall Hall Jr.. Other constructions come from projectivization of vector spaces over division rings and fields in work of Richard Dedekind and Emmy Noether, from line complexes in the tradition of Plücker, and from synthetic models developed by David Hilbert and George Birkhoff. Constructions via quotients, coverings, and cell decompositions relate to studies by Henri Poincaré, H. S. M. Coxeter, and John Conway.
Algebraic descriptions use homogeneous coordinates over a division ring or field, a framework drawing on Évariste Galois and later formalized in linear algebra by Arthur Cayley and Hermann Grassmann. Over a field K one obtains the projective plane P^2(K) with points as one-dimensional subspaces of K^3 and lines as two-dimensional subspaces; this approach is prominent in the work of David Hilbert, Emmy Noether, and Alexander Grothendieck. Non-Desarguesian planes arise from alternative coordinate systems involving quasifields and nearfields studied by Leonard Dickson and R. H. Bruck; these connect to ring theory developments of Emil Artin and Richard Brauer. Coordinate techniques underpin maps studied by Sophus Lie and Élie Cartan and appear in moduli problems treated by Grothendieck.
Finite projective planes have order n when each line contains n+1 points and there are n^2+n+1 points overall; classical examples include the plane of order q over the finite field GF(q) studied by Évariste Galois and applied in coding theory by researchers linked to Claude Shannon and Richard Hamming. The Fano plane (order 2) is a seminal example influencing work by David Hilbert, H. S. M. Coxeter, and John von Neumann. Existence and nonexistence results led to the Bruck–Ryser–Chowla theorem and problems pursued by Paul Erdős, R. C. Bose, and Ralph Stanton. Finite planes are central in constructions for finite incidence geometries used in design theory, error-correcting codes, and constructions connected to Hadamard matrices investigated by James Sylvester and John Hadamard.
Duality exchanges points and lines, a symmetry articulated in nineteenth-century studies by Jean-Victor Poncelet and exploited by Felix Klein in his Erlangen program; dual statements include Desargues' theorem, Pappus' theorem, and polar relationships central to conic sections studied by Apollonius of Perga and Isaac Newton. Polarities are correlations of order two linked to nondegenerate bilinear and sesquilinear forms over fields and division rings, topics developed by Hermann Weyl, Emil Artin, and Richard Brauer and applied in quadratic form theory studied by Emil Artin and John Milnor. Applications include polarity-induced orthogonality in finite classical groups examined by Élie Cartan and Issai Schur.
Topological projective planes such as the real projective plane RP^2 connect to the work of Henri Poincaré on manifold theory, to results by Lefschetz and Marston Morse on homology and critical points, and to classification results in differential topology pursued by Stephen Smale and John Milnor. Smooth and differentiable projective planes relate to structures in Lie group actions and homogeneous spaces studied by Élie Cartan and Hermann Weyl; the complex projective plane CP^2 is a central example in complex geometry and in the theory of Kähler manifolds investigated by Shing-Tung Yau and Jean-Pierre Serre.
The subject evolved from ancient studies of perspective by Ptolemy and Alhazen through Renaissance work by Leonardo da Vinci and Albrecht Dürer to 19th-century formalization by Jean-Victor Poncelet, Michel Chasles, and Augustin-Louis Cauchy. Twentieth-century advances by David Hilbert, H. S. M. Coxeter, Emmy Noether, and Alexander Grothendieck integrated projective planes into algebraic geometry, combinatorics, and theoretical physics including string theory and twistor theory developed by Roger Penrose. Applications appear in computer vision from David Marr-inspired projects, in error-correcting codes by Richard Hamming and Claude Shannon, and in cryptography and combinatorial designs used by researchers in information theory and coding theory.