In mathematics, Mnëv's universality theorem is a result in the intersection of combinatorics and algebraic geometry used to represent algebraic (or semialgebraic) varieties as realization spaces of oriented matroids.Informally it can also be understood as the statement that point configurations of a fixed combinatorics can show arbitrarily complicated behavior.The precise statement is as follows:
Let
V
{R}n
V
The theorem was discovered by Nikolai Mnëv in his 1986 Ph.D. thesis.
See main article: Oriented matroid.
For the purposes of this article, an oriented matroid of a finite subset
S\subset{R}n
S
{R}n
S
S
S
The realization space of an oriented matroid is the space of all configurations of points
S\subset{R}n
For the purpose of this article stable equivalence of semialgebraic sets is defined as described below.
Let
U
V
U=U1\coprod … \coprodUk
V=V1\coprod … \coprodVk
We say that
U
V
\phii:Ui\toVi
Let
U\subset{R}n+d,V\subset{R}n
U=U1\coprod … \coprodUk
V=V1\coprod … \coprodVk
Ui
Vi
\pi
d
\pi:U\toV
Mnëv's universality theorem has numerous applications in algebraic geometry, due to Laurent Lafforgue, Ravi Vakil and others, allowing one to construct moduli spaces with arbitrarily bad behaviour. This theorem together with Kempe's universality theorem has been used also by Kapovich and Millson in the study of the moduli spaces of linkages and arrangements.
Mnëv's universality theorem also gives rise to the universality theorem for convex polytopes. In this form it states that every semialgebraic set is stably equivalent to the realization space of some convex polytope. Jürgen Richter-Gebert showed that universality already applies to polytopes of dimension four.