Tverberg's theorem

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 , then the partition into A_i = \{x_i, x_{2r-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 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. == 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 from an N-dimensional simplex \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[r]: 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 from \Delta^N to \R^d. Let v_1,v_2,\dots,v_{N+1} be the vertices of \Delta^N and x_1,x_2,\dots,x_{N+1} be their images under f. By the original formulation, the x_1,x_2,\dots,x_{N+1} can be partitioned into r disjoint subsets, e.g. (\{x_i : i \in A_j\})_{j \in [r]} with overlapping convex hull. Because f is affine, the convex hull of \{x_i : i \in A_j\} is the image of the face spanned by the vertices \{v_i : i \in A_j\} for all j \in [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) 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)(r-1). If f is any continuous function from an N-dimensional simplex \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[r]: 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 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, 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" by Mabillard and Wagner, and the "constraint method" by Blagojević, Ziegler and Frick leads to counterexamples. ==See also==