Tarski's plank problem

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, Tarski's plank problem is a question about coverings of convex regions in n-dimensional Euclidean space by "planks": regions between two hyperplanes. Tarski asked if the sum of the widths of the planks must be at least the minimum width of the convex region. The question was answered affirmatively by Thøger Bang (1950, 1951).[1]


Given a convex body C in Rn and a hyperplane H, the width of C parallel to H, w(C,H), is the distance between the two supporting hyperplanes of C that are parallel to H. The smallest such distance (i.e. the infimum over all possible hyperplanes) is called the minimal width of C, w(C).

The (closed) set of points P between two distinct, parallel hyperplanes in Rn is called a plank, and the distance between the two hyperplanes is called the width of the plank, w(P). Tarski conjectured that if a convex body C of minimal width w(C) was covered by a collection of planks, then the sum of the widths of those planks must be at least w(C). That is, if P1,…,Pm are planks such that


Bang proved this is indeed the case.


The name of the problem, specifically for the sets of points between parallel hyperplanes, comes from the visualisation of the problem in R2. Here, hyperplanes are just straight lines and so planks become the space between two parallel lines. Thus the planks can be thought of as (infinitely long) planks of wood, and the question becomes how many planks does one need to completely cover a convex tabletop of minimal width w? Bang's theorem shows that, for example, a circular table of diameter d feet can't be covered by fewer than d planks of wood of width one foot each.


  1. ^ King, Jonathan L. (1994). "Three problems in search of a measure". Amer. Math. Monthly. 101: 609–628. doi:10.2307/2974690.