Tverberg's Theorem
   HOME

TheInfoList



OR:

In
discrete geometry Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geom ...
, Tverberg's theorem, first stated by Helge Tverberg in 1966, is the result that sufficiently many points in
Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces ...
can be partitioned into
subset In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they a ...
s with intersecting
convex hull In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, ...
s. Specifically, for any positive integers d, r and any set of :(d + 1)(r - 1) + 1\ points in d-dimensional
Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces ...
there exists a partition of the given points into r subsets whose convex hulls all have a common point; in other words, there exists a point x (not necessarily one of the given points) such that x belongs to the convex hull of all of the subsets. The partition resulting from this theorem is known as a Tverberg partition. The special case r = 2 was proved earlier by Radon, and it is known as
Radon's theorem In geometry, Radon's theorem on convex sets, published by Johann Radon in 1921, states that:Any set of d + 2 points in Rd can be partitioned into two sets whose convex hulls intersect. A point in the intersection of these convex hulls i ...
.


Examples

The case d = 1 states that any 2r - 1 points on the real line can be partitioned into r subsets with intersecting convex hulls. Indeed, if the points are x_1 < x_2 < ... < x_ , then the partition into A_i = \ for i = 1,...,r satisfies this condition (and it is unique). For r = 2 Tverberg's theorem states that any d + 2 points in the d-dimensional Euclidean space may be partitioned into two subsets with intersecting convex hulls. This is known as
Radon's theorem In geometry, Radon's theorem on convex sets, published by Johann Radon in 1921, states that:Any set of d + 2 points in Rd can be partitioned into two sets whose convex hulls intersect. A point in the intersection of these convex hulls i ...
. In this case, for points in
general position In algebraic geometry and computational geometry, general position is a notion of genericity for a set of points, or other geometric objects. It means the ''general case'' situation, as opposed to some more special or coincidental cases that a ...
, the partition is unique. The case r = 3 and d = 2 states that any seven points in the plane may be partitioned into three subsets with intersecting convex hulls. The illustration shows an example in which the seven points are the vertices of a regular
heptagon In geometry, a heptagon or septagon is a seven-sided polygon or 7-gon. The heptagon is sometimes referred to as the septagon, using ''Wikt:septa-, septa-'' (an elision of ''Wikt:septua-, septua-''), a Latin-derived numerical prefix, rather than ...
. As the example shows, there may be many different Tverberg partitions of the same set of points; these seven points may be partitioned in seven different ways that differ by rotations of each other.


Topological Tverberg Theorem

An equivalent formulation of Tverberg's theorem is the following:
Let d,r be positive integers, and let N := (d+1)(r-1). If f is any
affine function In Euclidean geometry, an affine transformation or affinity (from the Latin, ''wikt:affine, affinis'', "connected with") is a geometric transformation that preserves line (geometry), lines and parallel (geometry), parallelism, but not necessarily ...
from an N-dimensional
simplex In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. ...
\Delta^N to \R^d, then there are r pairwise-disjoint faces of \Delta^N whose images under f intersect. That is: there exist faces F_1 ,..., F_r of \Delta^N such that \forall i,j\in F_i\cap F_j = \emptyset and f(F_1)\cap\cdots\cap f(F_r)\neq \emptyset.
They are equivalent because any affine function on a simplex is uniquely determined by the images of its vertices. Formally, let f be an
affine function In Euclidean geometry, an affine transformation or affinity (from the Latin, ''wikt:affine, affinis'', "connected with") is a geometric transformation that preserves line (geometry), lines and parallel (geometry), parallelism, but not necessarily ...
from \Delta^N to \R^d. Let v_1,v_2,\dots,v_ be the vertices of \Delta^N and x_1,x_2,\dots,x_ be their images under f. By the original formulation, the x_1,x_2,\dots,x_ can be partitioned into r disjoint subsets, e.g. (\)_ with overlapping convex hull. Because f is affine, the convex hull of \ is the image of the face spanned by the vertices \ for all j \in /math>. These faces are pairwise-disjoint, and their images under f intersect, as claimed by the reformulation. The topological Tverberg theorem (first hypothesized by Bárány in a 1976 letter to Tverberg) generalizes this formulation. It allows f to be any continuous function—not necessarily affine. However, it only holds in the case where r is a
prime power In mathematics, a prime power is a positive integer which is a positive integer power of a single prime number. For example: , and are prime powers, while , and are not. The sequence of prime powers begins: 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 1 ...
:
Let d be a positive integer, and r be a power of a prime number. Let N := (d+1)(r-1). If f is any
continuous function In mathematics, a continuous function is a function such that a small variation of the argument induces a small variation of the value of the function. This implies there are no abrupt changes in value, known as '' discontinuities''. More preci ...
from an N-dimensional
simplex In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. ...
\Delta^N to \R^d, then there are r pairwise-disjoint faces of \Delta^N whose images under f intersect. That is: there exist faces F_1 ,..., F_r of \Delta^N such that \forall i,j\in F_i\cap F_j = \emptyset and f(F_1)\cap\cdots\cap f(F_r)\neq \emptyset.


Proofs and Refutations

The topological Tverberg theorem was proved for prime r by Bárány, Shlosman and Szűcs. Matoušek, Section 4.3, pp. 162-163 presents a proof using deleted joins. The theorem was proved for r a prime-power by Özaydin, and later by Volovikov and Sarkaria. It was a long-standing
open problem In science and mathematics, an open problem or an open question is a known problem which can be accurately stated, and which is assumed to have an objective and verifiable solution, but which has not yet been solved (i.e., no solution for it is kno ...
, whether the statement of the topological Tverberg theorem also holds for arbitrary (i.e. non-prime-power) r. However, in 2015 Frick observed that a synthesis of the work of Özaydin, the "r-fold
Whitney trick In mathematics, particularly in differential topology, there are two Whitney embedding theorems, named after Hassler Whitney: *The strong Whitney embedding theorem states that any differentiable manifold, smooth real numbers, real -dimension (math ...
" by Mabillard and Wagner, and the "constraint method" by Blagojević, Ziegler and Frick leads to counterexamples.


See also

*
Rota's basis conjecture In linear algebra and matroid, matroid theory, Rota's basis conjecture is an unproven conjecture concerning rearrangements of Basis (linear algebra), bases, named after Gian-Carlo Rota. It states that, if ''X'' is either a vector space of dimension ...


References


Further reading

*{{citation, title=Tverberg-type theorems and the Fractional Helly property, last=Hell, first=Stephan, year=2006, type=Ph.D. thesis, publisher=Technische Universität Berlin, doi=10.14279/depositonce-1464 Theorems in convex geometry Theorems in discrete geometry Geometric transversal theory Convex hulls