Skip to content
All apps

Cylinders below the half-area bound (3D)

About this app

How little cross-section do cylinders need to cover a tetrahedron? Bang's two cylinders (1951) hit exactly half the smallest shadow area. Fanned out and slightly tilted, with matching side planes and a small margin, 2·⌈2/ε²⌉ cylinders get strictly below it. Choose tilt and sector count, see the exact cost, gap test with 120,000 points, coarse fanning tears. The gain is tiny but real. openai/math family 100 (formalised in Lean). Exhibit-ready.

What it is about

A convex body is to be covered by finitely many infinitely long cylinders. How small can the sum of their perpendicular cross-sections be? In 1951 Bang showed for planar strips that the sum of the widths is at least the smallest width. For cylinders in space the question was whether at least half the smallest shadow area is needed; the tetrahedron covered by two cylinders hits exactly ½ and was seen as the borderline case. An AI-generated preprint in github.com/openai/math (family 100) claims a covering by 2·⌈2/ε²⌉ tilted cylinders that stays strictly below. The catalogue lists the main theorem as formalised in Lean; the preprint is not peer-reviewed.

What the app shows

A regular tetrahedron is covered by two cylinders that need exactly half the smallest shadow area. Switch to the fanned construction and you see many slightly tilted cylinders with triangular cross-sections, matching side planes and a small margin. You choose the tilt and the number of sectors; the app computes the exact cost and runs a sample gap test with 120,000 points to check coverage. With coarse fanning, gaps open up. The app can run as an exhibit.

How small the gain is

In the range covered by the proof, ε ≤ 1/2000, the construction saves only about 5·10⁻¹⁰ of the area. So that the tilt is visible at all, the app shows larger values of ε between 0.04 and 0.16. Up to about ε = 0.1 the covering stays just below ½ with no gaps; beyond that it costs more than ½ or shows the odd gap, and the theorem covers neither case. Watch the difference from ½ in the cost panel: the gain is tiny, but real.

Frequently asked questions

What is Bang’s plank problem?
Bang’s plank problem asks whether covering a convex body with planar strips (planks) requires the sum of the strip widths to be at least the body’s smallest width. Thøger Bang proved this in 1951. It is a classic of convex geometry with many variants, for example for cylinders in space.
What is the half-area bound for cylinder coverings?
For coverings of a convex body in space by cylinders, the question was whether the sum of the perpendicular cross-sections must be at least half the body’s smallest shadow area. The regular tetrahedron can be covered by two cylinders that meet this bound exactly. It was therefore considered a possible extreme case.
Can a tetrahedron be covered with less than half its shadow area?
An AI-generated preprint in the catalogue github.com/openai/math (family 100) claims a covering of the regular tetrahedron by tilted cylinders whose cross-sections together lie strictly below half the smallest shadow area. The gain is very small. The catalogue lists the main theorem as formalised in Lean; the preprint has not yet been peer-reviewed.
What can I try out in this app?
You compare the two-cylinder covering with the fanned construction and set the tilt and number of sectors. The app shows the exact cost and checks for gaps using 120,000 points. This shows at what level of fanning the covering breaks.

Subject: Open problems, solved by AI

More from Open problems, solved by AI

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps