Tverberg's theorem

From Wikipedia, the free encyclopedia
(Redirected from Tverberg partition)
Jump to navigation Jump to search

Template:Short description Template:Use dmy dates

File:Tverberg heptagon.svg
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,[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 d,r and any set of

(d+1)(r1)+1 

points in d-dimensional Euclidean space 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.

Examples

The case d=1 states that any 2r1 points on the real line can be partitioned into r subsets with intersecting convex hulls. Indeed, if the points are x1<x2<...<x2r1, then the partition into Ai={xi,x2ri} 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 this case, for points in general position, 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. 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

d,r

be positive integers, and let

N:=(d+1)(r1)

. If

f

is any affine function from an

N

-dimensional simplex

ΔN

to

d

, then there are

r

pairwise-disjoint faces of

ΔN

whose images under

f

intersect. That is: there exist faces

F1,...,Fr

of

ΔN

such that

i,j[r]:FiFj=

and

f(F1)f(Fr)

.

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 from

ΔN

to

d

. Let

v1,v2,,vN+1

be the vertices of

ΔN

and

x1,x2,,xN+1

be their images under

f

. By the original formulation, the

x1,x2,,xN+1

can be partitioned into

r

disjoint subsets, e.g.

({xi:iAj})j[r]

with overlapping convex hull. Because

f

is affine, the convex hull of

{xi:iAj}

is the image of the face spanned by the vertices

{vi:iAj}

for all

j[r]

. 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[2]) 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:

Let

d

be a positive integer, and

r

be a power of a prime number. Let

N:=(d+1)(r1)

. If

f

is any continuous function from an

N

-dimensional simplex

ΔN

to

d

, then there are

r

pairwise-disjoint faces of

ΔN

whose images under

f

intersect. That is: there exist faces

F1,...,Fr

of

ΔN

such that

i,j[r]:FiFj=

and

f(F1)f(Fr)

.

Proofs and Refutations

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

The theorem was proved for r 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) r. However, in 2015 Frick[8] observed that a synthesis of the work of Özaydin, the "r-fold Whitney trick" by Mabillard and Wagner,[9] and the "constraint method" by Blagojević, Ziegler and Frick[10] leads to counterexamples.

See also

References

Template:Reflist

Further reading

  • Script error: No such module "citation/CS1".
  1. Script error: No such module "citation/CS1".
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "citation/CS1".
  4. Template:Cite Matousek 2007, Section 4.3, pp. 162-163
  5. Script error: No such module "citation/CS1".
  6. Script error: No such module "citation/CS1".
  7. Script error: No such module "citation/CS1".
  8. Script error: No such module "citation/CS1".
  9. Script error: No such module "citation/CS1".
  10. Script error: No such module "citation/CS1".