Papex

Open problem · Mathematics · since 1914 · Open

Lebesgue’s universal covering problem

What is the smallest-area convex shape that can cover every plane set of diameter one?

Summary

Henri Lebesgue posed the problem in a 1914 letter. The best known covers have been trimmed in small steps over the following century, but the upper and lower bounds on the minimum area still do not meet.

AI-assisted claims

Partial result claimed · 12 Nov 2026

A lower bound of 0.8366 for Lebesgue's universal covering problem

“Adding the regular Reuleaux heptagon and nonagon of width $1$, we improve the lower bound to $\Lambda\ge0.8366$.”

By
Tejasvi Singh Tomar
AI involvement
Text declaration: A mix of human-written and AI-generated. Human-understanding declaration: All parts of this contribution have been checked and understood by a human.
Where
Hexagon
Source last read
13 Nov 2026

Claims as their sources state them. Listing a claim is not a check by Papex; the status stays the source’s.

All AI-assisted claims

Source

Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 08 Oct 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Mathematics