- Atlas
- Mathematics
- Convex Geometry
Convex Geometry
Convex geometry is the study of convex sets: sets in which the straight segment joining any two points of the set stays inside it.
9 frameworks, from 1880 to today · Geometry · Mathematics
- Brunn–Minkowski Theory 1880-Present
- Classical Convexity Theory 1890-Present
- Polyhedral combinatorics 1900-Present
- Helly-type Theory 1907-Present
- Convexity in Optimal Transport and Monge–Ampère Theory 1940-Present
- Geometry of Linear Programming 1947-Present
- Asymptotic geometry 1961-Present
- Computational Convex Geometry 1970-Present
- Discrete Convex Analysis 1980-Present
Overview
Convex geometry is the study of convex sets: sets in which the straight segment joining any two points of the set stays inside it123. A disk, a cube, a triangle, and the region above a parabola are convex; a crescent, a star, and a doughnut are not3. The subject asks what follows from this one simple property. It turns out that an enormous amount follows, and that the answers connect to optimization, probability, number theory, physics, and computer science. What is at stake is a kind of rigidity: convexity forbids dents and holes, and that restriction forces quantitative laws relating a body's volume, its surface, its width in different directions, and the number of pieces needed to describe it. The history of convex geometry is the story of discovering those laws, then discovering that they hold far beyond the smooth, familiar shapes where they were first seen.
Ancient roots and the slow start
Convexity was used long before it was named. Archimedes, in the third century BCE, proved that the surface area of a sphere is two-thirds that of the circumscribing cylinder and that a sphere's volume is two-thirds the cylinder's—results that rest on convex reasoning about enclosing and enclosed figures. The method of exhaustion, which approximates a curved region from inside and outside by polygons, is a convexity argument in disguise. Greek geometers also knew that the shortest path between two points is a straight line, the seed of the idea that convex bodies minimize distance.
For nearly two thousand years, though, convexity remained a tool rather than a subject. The decisive shift came in the nineteenth century, when mathematicians began to ask systematic questions about convex sets as objects in their own right.
Support, duality, and the classical theory
The founding move of classical convexity is the supporting hyperplane: a flat plane that touches a convex body along its boundary without cutting into it. In two dimensions this is a supporting line; in three, a supporting plane. The key fact is that every boundary point of a closed convex body has at least one supporting hyperplane through it. This gives a way to describe a convex body from outside, by the family of all half-spaces that contain it.
That description leads to convex duality. A convex body can be encoded by its support function, which records, for each direction, how far the body extends in that direction4. The body is the intersection of the half-spaces cut out by its supporting hyperplanes, so the support function determines the body completely4. Duality turns questions about points inside a body into questions about functions of direction, and vice versa. Hermann Minkowski, in work published around the turn of the twentieth century, made this precise and used it to characterize which functions can be support functions of a convex body.
Minkowski also introduced the operation now called Minkowski addition: given two convex bodies, form the set of all sums of a point from one and a point from the other. Adding a disk to a square rounds its corners; adding a long thin segment stretches it. Minkowski addition is the natural "vector space" structure on convex bodies, and it became the backbone of the field.
The Brunn–Minkowski theory
The central theorem of classical convex geometry is the Brunn–Minkowski inequality5. It says that the volume of the Minkowski sum of two bodies, raised to the power 1/n in n dimensions, is at least the average of the two bodies' volumes raised to that power. In symbols, for bodies K and L in n-dimensional space,
$$\mathrm{vol}(K+L)^{1/n} \ge \mathrm{vol}(K)^{1/n} + \mathrm{vol}(L)^{1/n}.$$
Hermann Brunn proved a version in the 1880s, and Minkowski gave a proof for the general case in the 1890s. The inequality is striking because it is an equality exactly when the two bodies are homothetic—scaled copies of one another—so it measures how far two shapes are from being similar.
From Brunn–Minkowski flows a whole family of results. Slicing a convex body by parallel hyperplanes, the areas of the slices behave in a controlled, concave way (the Brunn–Minkowski theorem for sections). The isoperimetric inequality—among all bodies of a given volume, the ball has the least surface area—is a corollary. So is the fact that among all bodies of given volume, the ball maximizes the mean width. These are the "laws" of convex geometry, and they say that the ball is extremal in many senses at once.
A parallel development concerned mixed volumes: the volume of a Minkowski sum expands as a polynomial in the scaling parameters, and its coefficients are the mixed volumes, which encode how the bodies interact. Minkowski's mixed-volume inequalities and the Alexandrov–Fenchel inequality (proved by Aleksandr Alexandrov and Werner Fenchel in the late 1930s) organize this theory. The Brunn–Minkowski theory, as this whole complex is called, remains the gravitational center of the field.
Polytopes and combinatorial convexity
A polytope is a convex body with finitely many extreme points—a polygon in the plane, a polyhedron in space, and their higher-dimensional analogues. Polytopes are the combinatorial skeleton of convex geometry: every convex body can be approximated by polytopes, and many questions reduce to counting their faces.
Euler's formula for polyhedra, V − $E + F = 2$, relating vertices, edges, and faces, is the oldest result here. Its higher-dimensional generalization, the Euler–Poincaré relation, was established in the nineteenth century. The modern combinatorial theory took off in the twentieth century with the question of which numbers of faces a polytope can have. The Upper Bound Theorem, conjectured in the 1950s and proved by Peter McMullen in 1970, gives the maximum number of faces of each dimension for a polytope with a fixed number of vertices; the extremal examples are the cyclic polytopes. The g-theorem, conjectured by McMullen and proved by Richard Stanley in 1980 using algebraic methods, characterizes exactly which face-number sequences occur. Stanley's proof imported techniques from commutative algebra—the face ring of a polytope—and showed that combinatorial convexity and algebra could feed each other.
A related strand is the study of oriented matroids, abstractions of the combinatorial structure of point configurations, which capture which subsets lie on which sides of which hyperplanes. These grew out of work on arrangements of hyperplanes and on the "allowable sequences" of points moving in the plane, and they let combinatorialists reason about convex position without coordinates.
Helly-type theorems
In 1913, Eduard Helly proved a startling fact: if a finite family of convex sets in n-dimensional space has the property that every n+1 of them share a common point, then all of them share a common point. In the plane, if every three convex sets overlap, all of them do. This is the prototype of a Helly-type theorem, and it is the reason convexity is so useful in feasibility questions: local consistency implies global consistency.
Helly's theorem spawned a family. The Radon theorem (1887) says any n+2 points in n-space can be split into two groups whose convex hulls intersect. Carathéodory's theorem (1907) says any point in the convex hull of a set in n-space lies in the convex hull of at most n+1 of the original points. These three—Helly, Radon, Carathéodory—are the classical pillars of combinatorial convexity, and they are logically intertwined6. Later work extended them to non-convex settings, to families with bounded intersection numbers, and to quantitative versions (how many points must overlap, how large the intersection is), a line of research that remains active.
Linear programming and the geometry of optimization
In the 1940s, George Dantzig developed the simplex method for linear programming: maximizing or minimizing a linear function subject to linear inequalities. Geometrically, the feasible region is a polytope, and the optimum occurs at a vertex. The simplex method walks from vertex to vertex along edges, improving the objective at each step.
This practical success raised a theoretical question: why does the method work, and how fast is it? The geometry of polytopes became central. The duality theorem of linear programming—that the maximum of a linear function over a polytope equals the minimum of a related function over a dual polytope—is a concrete instance of convex duality, and it has an economic reading as a price equilibrium. The study of how many vertices a polytope can have, and how the vertices are connected, became a branch of convex geometry with direct algorithmic consequences. The Hirsch conjecture, posed in 1957, asked whether the graph of a polytope with N facets in dimension d always has diameter at most N − d; it was disproved in 2010 by Francisco Santos, who constructed a counterexample, showing that the combinatorial geometry of polytopes still holds surprises.
Asymptotic geometric analysis
In the second half of the twentieth century, a new perspective emerged: instead of studying one convex body, study the typical behavior of convex bodies in very high dimension. This is asymptotic geometric analysis, sometimes called the local theory of Banach spaces, because a convex body symmetric about the origin defines a norm, and the geometry of that norm is the geometry of a Banach space.
The surprise is that high-dimensional convex bodies behave very differently from low-dimensional intuition. A ball in a thousand dimensions has almost all its volume concentrated in a thin shell near its surface, and a random direction is almost orthogonal to any fixed direction. These concentration phenomena make high-dimensional convexity both strange and tractable. Landmark results include the Dvoretzky theorem (1961), which says that every high-dimensional convex body contains almost-Euclidean sections of dimension growing with the dimension, and the Brunn–Minkowski theory's high-dimensional refinements, such as the Blaschke–Santaló inequality and its stability versions. The field matured through the 1980s and 1990s with contributions from Vitali Milman, Joram Lindenstrauss, and many others, and it remains one of the most active parts of convex geometry.
Convexity in optimal transport and Monge–Ampère theory
A separate tradition connects convexity to partial differential equations. Optimal transport asks how to move one distribution of mass to another at least cost7. In the 1940s, Leonid Kantorovich formulated the problem as a linear program over measures, and the dual problem involves convex functions. When the cost is the squared distance, the optimal map is the gradient of a convex function—a fact that ties transport to the Monge–Ampère equation, a fully nonlinear PDE whose solutions are convex potentials.
This connection, developed through the twentieth century and given a modern geometric form by Robert McCann and others in the 1990s, made convexity a tool in analysis and geometry. The Brunn–Minkowski inequality itself can be proved by transport arguments, and the theory of Ricci curvature lower bounds in metric spaces, developed by Lott, Sturm, and Villani, is built on convexity of entropy along transport paths. Here convexity is not just a property of sets but a structural principle for functions and measures.
Discrete convex analysis
In the 1980s and 1990s, a parallel theory arose for functions on integer lattices. Discrete convex analysis, developed by Kazuo Murota and others, defines notions such as L-convex and M-convex functions—discrete analogues of convex functions—for which greedy algorithms and exchange properties hold. The motivation came from combinatorial optimization: submodular functions, matroids, and valuated matroids have convex-like structure, and discrete convex analysis gives a unified language for them. It is a young branch, still growing, and it shows that the convexity idea can be transplanted from continuous space to discrete settings.
Computational convex geometry
With the rise of computers, convex geometry acquired an algorithmic face. Computational convex geometry studies algorithms for computing convex hulls, for deciding whether a point lies in a convex body, for optimizing linear functions over polytopes, and for approximating convex bodies by simpler ones. The convex hull of a finite point set can be computed in time polynomial in the number of points and the dimension, though the dependence on dimension is severe. Randomized algorithms, such as Seidel's linear-programming algorithm and the ellipsoid method of Khachiyan (1979), which proved that linear programming is solvable in polynomial time, are landmarks. The interplay between convex geometry and algorithms continues: the study of polytope diameters, of the complexity of vertex enumeration, and of convex optimization in high dimension are all active.
The present
Convex geometry today is a federation of approaches. The Brunn–Minkowski theory remains central, with active work on stability versions, on the equality cases of its inequalities, and on extensions to non-convex and discrete settings. Asymptotic geometric analysis continues to probe high-dimensional phenomena, with connections to probability, functional analysis, and machine learning. Combinatorial convexity and polytope theory are driven by questions from optimization and from algebraic combinatorics, and the g-theorem and its generalizations remain a model of cross-fertilization. Optimal transport has become a major bridge between convexity and PDE, and discrete convex analysis is finding applications in economics and combinatorial optimization. Computational convex geometry is increasingly intertwined with convex optimization and with the theory of algorithms.
The open questions are many: the precise structure of high-dimensional convex bodies, the complexity of polytope algorithms, the stability of geometric inequalities, and the extension of convexity to discrete and non-Euclidean settings. What unites them is the original insight—that a single, simple restriction, the absence of dents, generates a rich and rigid mathematical world.
References
- Convex geometry, Wikipedia
- Convex analysis, Wikipedia
- Convex set, Wikipedia
- Support function, Wikipedia
- Brunn–Minkowski theorem, Wikipedia
- Carathéodory's theorem (convex hull), Wikipedia
- Transportation theory (mathematics), Wikipedia
The frameworks of Convex Geometry
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1880-Present
Brunn–Minkowski Theory
How does volume behave under adding convex bodies?
- 1890-Present
Classical Convexity Theory
How can a convex body be described from outside?
- 1900-Present
- 1907-Present
- 1940-Present
Convexity in Optimal Transport and Monge–Ampère Theory
How do mass distributions move most efficiently?
- 1947-Present
Geometry of Linear Programming
Where does a linear objective reach its optimum?
- 1961-Present
- 1970-Present
Computational Convex Geometry
How can convex structures be computed efficiently?
- 1980-Present
Discrete Convex Analysis
What is the discrete analogue of a convex function?
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Geometry of Linear Programming influenced by Classical Convexity Theory
The geometry of linear programming rests directly on classical convex duality: the LP duality theorem is a concrete instance of the support-function duality of convex bodies, and the feasible region is a polytope whose vertices carry the optimum. Dantzig's simplex method walks the vertex graph of that polytope.
Carried by George Dantzig.
Convexity in Optimal Transport and Monge–Ampère Theory influenced by Brunn–Minkowski Theory
Brunn–Minkowski and mixed-volume techniques, especially the Alexandrov–Fenchel inequality and displacement interpolation along Minkowski sums, were taken up in optimal transport and Monge–Ampère theory. The volume-concavity laws of the Brunn–Minkowski complex became the model for transport inequalities.
Helly-type Theory influenced by Classical Convexity Theory
Helly's theorem was proved within the classical theory of convex sets and supporting hyperplanes; the local-to-global intersection principle it established became the prototype for all Helly-type results. Radon's and Carathéodory's theorems likewise belong to this classical combinatorial core.
Carried by Eduard Helly.
Asymptotic geometry grew out of Classical Convexity Theory
Asymptotic geometry grew out of classical convexity by asking how volume, width and support functions behave in high dimension, generalizing the Brunn–Minkowski and isoperimetric laws to asymptotic statements. The support-function and mixed-volume machinery of the classical theory was its starting point.
Geometry of Linear Programming influenced by Polyhedral combinatorics
Polyhedral combinatorics supplied the face and vertex-graph questions that linear programming theory needed, notably the Hirsch conjecture on polytope diameters. The study of how vertices of a polytope are connected became a branch of convex geometry with algorithmic consequences.
Computational Convex Geometry influenced by Polyhedral combinatorics
Computational convex geometry took the face-counting and vertex-graph questions of polyhedral combinatorics and turned them into algorithmic problems, such as computing convex hulls and enumerating faces. The Upper Bound Theorem and cyclic polytopes became benchmarks for hull algorithms.
Computational Convex Geometry influenced by Geometry of Linear Programming
The geometry of linear programming, especially the simplex method's walk along polytope edges, motivated the algorithmic study of convex bodies and polytopes. Computational convex geometry inherited the question of how efficiently the vertex structure of a polytope can be found and traversed.
Discrete Convex Analysis influenced by Polyhedral combinatorics
Discrete convex analysis drew on polyhedral combinatorics for its treatment of integral polytopes, submodularity and the discrete analogues of convex sets. The face structure of polytopes and the combinatorics of convex position supplied the models for discrete convex functions.
Beyond the field
Where Convex Geometry's ideas came from in other fields, and what they led to there: the strongest 12 of 31 links.
Brunn–Minkowski Theory led to Convex geometry in Geometry
Brunn-Minkowski theory, with the Brunn-Minkowski inequality and mixed volumes, is the core from which modern convex geometry developed, and convex geometry is its systematic elaboration.
Carried by Hermann Brunn; Hermann Minkowski.
Polyhedral combinatorics influenced Toric variety in Algebraic Geometry
Polyhedral combinatorics, especially the theory of convex polytopes and their fans, supplied the combinatorial data from which toric varieties are built.
Carried by Tadao Oda.
Computational Convex Geometry grew out of Convex geometry in Geometry
Computational convex geometry is the algorithmic branch of convex geometry: it took the classical theory of convex sets and polytopes and turned it into algorithms, complexity questions and computational methods. The later field is unthinkable without the earlier body of results.
Brunn–Minkowski Theory influenced Convexity and Combinatorial Convexity in Discrete Geometry
The Brunn–Minkowski theory of volumes of convex bodies, developed from the 1880s, supplied the volume and mixed-volume machinery that combinatorial convexity later used. The later work took up these inequalities as tools.
Carried by Hermann Brunn; Hermann Minkowski.
Classical Convexity Theory influenced Convex analysis and lower semicontinuity (Tonelli–Morrey existence theory) in Calculus Of Variations
Classical convexity theory supplied the notions of convex functions and supporting hyperplanes that Tonelli and Morrey used to state lower semicontinuity conditions. Convexity passed into the variational existence theory as its central analytic tool.
Carried by Leonida Tonelli; Charles Morrey.
Polyhedral combinatorics influenced Combinatorial Optimization in Combinatorics
Polyhedral combinatorics gave combinatorial optimization its polyhedral formulation of discrete problems, in which feasible solutions are vertices of a polytope and optimization becomes linear programming over it.
Polyhedral combinatorics influenced Computational geometry in Geometry
Polyhedral combinatorics, through linear programming and the study of polytope complexity, gave computational geometry its early algorithmic problems and complexity questions in the 1970s.
Polyhedral combinatorics led to Discrete geometry in Geometry
Polyhedral combinatorics as pursued in convex geometry, from Euler's polyhedron formula through Steinitz's theorem, is the historical root from which the discrete-geometric study of polytopes grew.
Carried by Leonhard Euler; Ernst Steinitz.
Polyhedral combinatorics influenced Discrete geometry in Combinatorics
Polyhedral combinatorics gave discrete geometry its core questions about face numbers and realizability of polytopes, carried into the discrete setting by work on convex polytopes.
Polyhedral combinatorics influenced Matroid in Combinatorics
Polyhedral combinatorics, through the study of polytopes and their face lattices, supplied the geometric models (matroid polytopes, oriented matroids) that later shaped matroid theory.
Geometry of Linear Programming influenced by Convex geometry in Geometry
The geometry of linear programming rests on classical convex geometry: the simplex method and duality theory use separating hyperplanes, convex polyhedra and extreme points as developed by Minkowski and others.
Carried by George Dantzig.
Geometry of Linear Programming influenced by Polyhedral combinatorics in Discrete Geometry
Polyhedral combinatorics supplied the face-lattice and vertex description of polytopes that the simplex method and LP duality exploit; the geometry of linear programming is the optimization side of that same polytope theory.
Carried by George Dantzig.

Convex Geometry is a planet in Nousfarer
Its city has a tower for each of these 9 frameworks. Land, walk in, and climb one concept at a time.
Land on Convex GeometryRelated fields
Fields its ideas are linked to
- Geometry 9 links
- Computational Geometry 5 links
- Discrete Geometry 5 links
- Combinatorics 5 links
- Algebraic Geometry 2 links
- Applied Mathematics 2 links
- Calculus Of Variations 1 link
- Combinatorial Optimization 1 link
- Geometric Group Theory 1 link
More in Geometry
- Algebraic Geometry
- Classical Geometry
- Complex Geometry
- Differential Geometry
- Discrete Geometry
- Geometric Group Theory
- Geometry
- Riemannian Geometry
- Symplectic Geometry
See where Convex Geometry sits on the Map of Human Knowledge