ArticleslgStudy

mathematics

Lebesgue's universal covering problem

Lebesgue's universal covering 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 Lebesgue's universal covering problem rather than just read about it. In short: Lebesgue's universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set of diameter one. The diameter of a set by definition is the least upper bound of the distances between all pairs of points in the set.

Lebesgue's universal covering problem — main illustration
Lebesgue's universal covering problem — illustration

Key takeaways

  • Lebesgue's universal covering 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 Lebesgue's universal covering problem to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Lebesgue's universal covering problem from memory before moving on to harder problems.

Reference excerpt

Lebesgue's universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set of diameter one. The diameter of a set by definition is the least upper bound of the distances between all pairs of points in the set. A shape covers a set if it contains a congruent subset. In other words the set may be rotated, translated or reflected to fit inside the shape.

Formulation and early research The problem was posed by Henri Lebesgue in a letter to Gyula Pál in 1914. It was published in a paper by Pál in 1920 along with Pál's analysis. He showed that a cover for all curves of constant width one is also a cover for all sets of diameter one and that a cover can be constructed by taking a regular hexagon with an inscribed circle of diameter one and removing two corners from the hexagon to give a cover of area 2 − 2 3 ≈ 0.84529946. {\displaystyle 2-{\frac {2}{\sqrt {3}}}\approx 0.84529946.}

In 1936, Roland Sprague showed that a part of Pál's cover could be removed near one of the other corners while still retaining its property as a cover. This reduced the upper bound on the area to a ≤ 0.844137708436 {\displaystyle a\leq 0.844137708436} .

Current bounds After a sequence of improvements to Sprague's solution, each removing small corners from the solution, a 2018 preprint of Philip Gibbs claimed the best upper bound known, a further reduction to area 0.8440935944. The best known lower bound for the area was provided by Peter Brass and Mehrbod Sharifi using a combination of three shapes in optimal alignment, proving that the area of an optimal cover is at least 0.832.

See also Moser's worm problem, what is the minimum area of a shape that can cover every unit-length curve? Moving sofa problem, the problem of finding a maximum-area shape that can be rotated and translated through an L-shaped corridor Kakeya set, a set of minimal area that can accommodate every unit-length line segment (with translations allowed, but not rotations) Blaschke selection theorem, which can be used to prove that Lebesgue's universal covering problem has a solution.

References

Illustrations

Lebesgue's universal covering problem: An equilateral triangle of diameter 1 doesn’t fit inside a circle of diameter 1
An equilateral triangle of diameter 1 doesn’t fit inside a circle of diameter 1
Lebesgue's universal covering problem: The shape outlined in black is Pál's solution to Lebesgue's universal covering problem. Within it, planar shapes with diameter one have been included: a circle (in blue), a Reuleaux triangle (in red) and a square (in green).
The shape outlined in black is Pál's solution to Lebesgue's universal covering problem. Within it, planar shapes with diameter one have been included: a circle (in blue), a Reuleaux triangle (in red) and a square (in green).

Worked examples

Example 1 — a first encounter with Lebesgue's universal covering problem

Start with the simplest possible case. Write down what Lebesgue's universal covering 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 Lebesgue's universal covering 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 Lebesgue's universal covering 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 Lebesgue's universal covering problem

In research
Lebesgue's universal covering 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 Lebesgue's universal covering 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
Lebesgue's universal covering problem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Discrete geometry, Unsolved problems in geometry, so understanding it makes those chapters shorter.
In everyday life
Look for Lebesgue's universal covering 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 “Lebesgue's universal covering problem” →

Affiliate

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

How to study Lebesgue's universal covering problem in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Lebesgue's universal covering 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 Lebesgue's universal covering problem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Lebesgue's universal covering problem in simple terms?

Lebesgue's universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set of diameter one. The diameter of a set by definition is the least upper bound of the distances between all pairs of points in the set.

Why does Lebesgue's universal covering 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 Lebesgue's universal covering 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 Lebesgue's universal covering problem.

Tags

  • Discrete geometry
  • Unsolved problems in geometry

Keep exploring