Mnëv's universality theorem

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 realizations of oriented matroids, up to an equivalence relation known as stable equivalence. It can also be read as the statement that point-hyperplane configurations (and more specifically, the realization spaces of oriented matroids) can behave arbitrarily complicated. It was discovered by Nikolai Mnëv in his 1986 Ph.D. thesis.

Oriented matroids

Main article: Oriented matroid

For the purposes of this article, an oriented matroid of a finite subset $S\subset {\mathbb {R} }^{n}$ is the list of partitions of $S$ induced by hyperplanes in ${\mathbb {R} }^{n}$ (each oriented hyperplane partitions $S$ into the points on the "positive side" of the hyperplane, the points on the "negative side" of the hyperplane, and the points that lie on the hyperplane). In particular, an oriented matroid contains the full information of the incidence relations in $S$, inducing on $S$ a matroid structure.

The realization space of an oriented matroid is the space of all configurations of points $S\subset {\mathbb {R} }^{n}$ inducing the same oriented matroid structure.

Stable equivalence of semialgebraic sets

For the purpose of this article stable equivalence of semialgebraic sets is defined as described below.

Let $U$ and $V$ be semialgebraic sets, obtained as a disjoint union of connected semialgebraic sets

$U=U_{1}\coprod \cdots \coprod U_{k}\,$ and $\,V=V_{1}\coprod \cdots \coprod V_{k}$

We say that $U$ and $V$ are rationally equivalent if there exist homeomorphisms $\phi _{i}:U_{i}\to V_{i}$ defined by rational maps.

Let $U\subset {\mathbb {R} }^{n+d},V\subset {\mathbb {R} }^{n}$ be semialgebraic sets,

$U=U_{1}\coprod \cdots \coprod U_{k}\,$ and $\,V=V_{1}\coprod \cdots \coprod V_{k}$

with $U_{i}$ mapping to $V_{i}$ under the natural projection $\pi$ deleting the last $d$ coordinates. We say that $\pi :U\to V$ is a stable projection if there exist integer polynomial maps $$\varphi _{1},\ldots ,\varphi _{\ell },\psi _{1},\dots ,\psi _{m}:\;{\mathbb {R} }^{n}\to {\mathbb {R} }^{d}$$ such that $$U_{i}=\{(v,v')\in {\mathbb {R} }^{n+d}\mid v\in V_{i}{\text{ and }}\langle \varphi _{a}(v),v'\rangle >0,\langle \psi _{b}(v),v'\rangle =0{\text{ for }}a=1,\dots ,\ell ,b=1,\dots ,m\}.$$ The stable equivalence is an equivalence relation on semialgebraic subsets generated by stable projections and rational equivalence.

Stetement of Mnëv's universality theorem

Let $V$ be a semialgebraic subset in ${\mathbb {R} }^{n}$ defined over integers. Then $V$ is stably equivalent to a realization space of some oriented matroid.

Implications

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.

See also

• Convex Polytopes by Branko Grünbaum, revised edition, a book that includes material on the theorem and its relation to the realizability of polytopes from their combinatorial structures.

Further reading

• Vakil, Ravi (2006), "Murphy's law in algebraic geometry: badly-behaved deformation spaces", Inventiones Mathematicae, 164 (3): 569–590, arXiv:math/0411469, Bibcode:2006InMat.164..569V, doi:10.1007/s00222-005-0481-9, MR 2227692, S2CID 7262537
• Richter-Gebert, Jürgen (1995), "Mnëv's universality theorem revisited", Séminaire Lotharingien de Combinatoire, 34, Article B34h, MR 1399755