Tverberg's theorem
Template:Short description Template:Use dmy dates
In discrete geometry, Tverberg's theorem, first stated by Helge Tverberg in 1966,[1] 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.
Script error: No such module "anchor".Topological Tverberg Theorem
An equivalent formulation of Tverberg's theorem is the following:
Let
be positive integers, and let
. If
is any affine function from an
-dimensional simplex
to
, then there are
pairwise-disjoint faces of
whose images under
intersect. That is: there exist faces
of
such that
and
.
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[2]) generalizes this formulation. It allows
to be any continuous function—not necessarily affine. However, it only holds in the case where
is a prime power:
Let
be a positive integer, and
be a power of a prime number. Let
. If
is any continuous function from an
-dimensional simplex
to
, then there are
pairwise-disjoint faces of
whose images under
intersect. That is: there exist faces
of
such that
and
.
Proofs and Refutations
The topological Tverberg theorem was proved for prime by Bárány, Shlosman and Szűcs.[3] Matoušek[4] presents a proof using deleted joins.
The theorem was proved for a prime-power by Özaydin,[5] and later by Volovikov[6] and Sarkaria.[7]
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[8] observed that a synthesis of the work of Özaydin, the "-fold Whitney trick" by Mabillard and Wagner,[9] and the "constraint method" by Blagojević, Ziegler and Frick[10] leads to counterexamples.
See also
References
Further reading
- Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Template:Cite Matousek 2007, Section 4.3, pp. 162-163
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".