Tverberg's theorem

A Tverberg partition of the vertices of a regular heptagon into three subsets with intersecting convex hulls.

In discrete geometry, Tverberg's theorem, first stated by Helge Tverberg in 1966, is the result that sufficiently many points in Euclidean space can be partitioned into subsets with intersecting convex hulls. Specifically, for any positive integers and any set of

points in -dimensional Euclidean space there exists a partition of the given points into subsets whose convex hulls all have a common point; in other words, there exists a point (not necessarily one of the given points) such that 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 was proved earlier by Radon, and it is known as Radon's theorem.

Examples

The case states that any points on the real line can be partitioned into subsets with intersecting convex hulls. Indeed, if the points are , then the partition into for satisfies this condition (and it is unique).

For Tverberg's theorem states that any points in the -dimensional Euclidean space may be partitioned into two subsets with intersecting convex hulls. This is known as Radon's theorem. In this case, for points in general position, the partition is unique.

The case and 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. 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:

They are equivalent because any affine function on a simplex is uniquely determined by the images of its vertices. Formally, let be an affine function from to . Let be the vertices of and be their images under . By the original formulation, the can be partitioned into disjoint subsets, e.g. with overlapping convex hull. Because is affine, the convex hull of is the image of the face spanned by the vertices for all . These faces are pairwise-disjoint, and their images under intersect, as claimed by the reformulation. The topological Tverberg theorem (first hypothesized by Bárány in a 1976 letter to Tverberg) generalizes this formluation. It allows to be any continuous function—not necessarily affine. However, it only holds in the case where is a prime power:

Proofs and Refutations

The topological Tverberg theorem was proved for prime by Bárány, Shlosman and Szűcs. Matoušek presents a proof using deleted joins.

The theorem was proved for a prime-power by Özaydin, and later by Volovikov and Sarkaria.

It was a long-standing open problem, whether the statement of the topological Tverberg theorem also holds for arbitrary (i.e. non-prime-power) . However, in 2015 Frick observed that a synthesis of the work of Özaydin, the "-fold Whitney trick" by Mabillard and Wagner, and the "constraint method" by Blagojević, Ziegler and Frick leads to counterexamples.

See also

References

Further reading

  • Hell, Stephan (2006), Tverberg-type theorems and the Fractional Helly property (Ph.D. thesis), Technische Universität Berlin, doi:10.14279/depositonce-1464
Uses material from the Wikipedia article Tverberg's theorem, released under the CC BY-SA 4.0 license.