ArticleslgStudy

mathematics

Tarski's plank problem

Tarski's plank problem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Tarski's plank problem rather than just read about it. In short: 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. Alfred Tarski asked if the sum of the widths of the planks must be at least the minimum width of the convex region.

Tarski's plank problem — main illustration
Tarski's plank problem — illustration

Key takeaways

  • Tarski's plank problem belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Tarski's plank problem to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Tarski's plank problem from memory before moving on to harder problems.

Reference excerpt

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. Alfred 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).

Statement

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

C ⊆ P 1 ∪ … ∪ P m ⊂ R n , {\displaystyle C\subseteq P_{1}\cup \ldots \cup P_{m}\subset \mathbb {R} ^{n},}

then

∑ i = 1 m w ( P i ) ≥ w ( C ) . {\displaystyle \sum _{i=1}^{m}w(P_{i})\geq w(C).}

Bang proved this is indeed the case.

Nomenclature 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.

See also Affine plank problem, on covering a constant body by planks of small total relative width Pyjama problem, on covering the entire plane by periodically spaced planks

References

Bang, Thøger (1950), "On covering by parallel-strips.", Mat. Tidsskr. B.: 49–53, MR 0038085 Bang, Thøger (1951), "A solution of the "plank problem"", Proc. Amer. Math. Soc., 2 (6): 990–993, doi:10.2307/2031721, JSTOR 2031721, MR 0046672

Worked examples

Example 1 — a first encounter with Tarski's plank problem

Start with the simplest possible case. Write down what Tarski's plank problem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Tarski's plank problem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Tarski's plank problem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Tarski's plank problem

In research
Tarski's plank problem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Tarski's plank problem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Tarski's plank problem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Geometry, so understanding it makes those chapters shorter.
In everyday life
Look for Tarski's plank problem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Tarski's plank problem” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Tarski's plank problem in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Tarski's plank problem means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Tarski's plank problem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Tarski's plank problem in simple terms?

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. Alfred Tarski asked if the sum of the widths of the planks must be at least the minimum width of the convex region.

Why does Tarski's plank problem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Tarski's plank problem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Tarski's plank problem.

Tags

  • Geometry

Keep exploring