Finite angular cylinder covers below the half-area bound
Abstract
A regular tetrahedron admits a finite cylinder covering with compact triangular perpendicular bases whose total area is less than half its minimum orthogonal projection area. This disproves the half-area cylinder-covering conjecture. By affine invariance, the same construction gives a counterexample to the directionwise normalized half-bound for every nondegenerate tetrahedron.
Introduction
How small can the total cross-sectional area of a finite cylinder covering of a convex body be? Here a convex body is compact, convex, and has nonempty interior. A cylinder is a set
where is a unit vector and its base is measurable with finite area. All areas and projections are Euclidean. Write
where is orthogonal projection onto the two-dimensional linear subspace and denotes planar Lebesgue measure. The half-area cylinder covering conjecture asks whether every finite covering satisfies
The cylinder question belongs to the line of covering problems that begins with Tarski’s plank problem. A plank is the region between two parallel hyperplanes, and its width is their distance. Bang proved that a finite plank covering of a convex body has total width at least the body’s minimum width [2]; see also [3], Theorem 2.1. Ball proved the directionwise refinement for centrally symmetric bodies: after dividing each plank’s width by the body’s width in the same normal direction, the sum is at least one [1], arXiv v1, Theorem 1. Thus the width cost of a plank cover has both an absolute formulation and a relative formulation adapted to the individual directions.
For cylinders in three dimensions, the two-cylinder cover of a regular tetrahedron shows that replacing widths by base areas cannot preserve the constant one. Its two axes are parallel to opposite edges, and its total base area equals half the tetrahedron’s minimum projection area.
Bezdek [3] and Bezdek and Litvak [5] attribute this example and the resulting half-area question to Bang’s 1951 paper. Their formulations allow measurable bases perpendicular to the axes, as in our definition.
For a finite covering , define the directionwise relative area by
All denominators are positive because has nonempty interior. Bezdek and Litvak proved for every finite covering in three dimensions, and the stronger bound when is an ellipsoid. In their proof, the general case combines the Rogers–Shephard section–projection inequality with a volume comparison. For ellipsoids, they reduce to a ball and use a density whose integral along every interior chord is the same [5]. These arguments leave a gap between the universal one-third lower bound and the proposed one-half threshold.
Bezdek and Khan record the directionwise assertion under the name 1-Codimensional Cylinder Covering Conjecture [4]. It would imply (1.1), since
Verreault’s 2026 survey records the half-area question as unresolved [7]. Our construction starts with the tetrahedral equality example itself and replaces its two axes by finitely many nearby directions. It violates both half-area bounds while retaining compact triangular bases.
We construct a counterexample with compact triangular bases. Set and
Its vertices are and , so it is a regular tetrahedron of edge length 2.
Theorem 1.1. The tetrahedron (1.4) has . For every , it admits a covering by cylinders with compact triangular perpendicular bases such that
The remainder has absolute value at most , and the total base area is strictly less than .
Every covering in the theorem is finite, although its number of cylinders increases as the tilt decreases. Similarities preserve the ratio of base area to minimum projection area, so the construction applies to every regular tetrahedron.
Corollary 1.2. Every nondegenerate tetrahedron admits a finite cylinder covering with compact triangular perpendicular bases for which
Thus the 1-Codimensional Cylinder Covering Conjecture is false.
Proof. For the regular tetrahedron , each denominator is at least , so the sum is at most by Theorem 1.1 with .
The directionwise ratios are invariant under invertible affine maps [5], arXiv v1, Section 3. To see this directly, let be an invertible linear map and set . The linear map
is an isomorphism: implies that is parallel to , hence is parallel to , and therefore . The transformed cylinder has perpendicular base , and . Both areas are multiplied by the same positive factor , so their ratio is unchanged. Translations also preserve it. Every nondegenerate tetrahedron is an affine image of ; the images of its covering retain the same finite count and compact nondegenerate triangular bases.
This affine argument concerns the directionwise ratios. The conclusion of Theorem 1.1, which uses one minimum projection area for all directions, is asserted here for regular tetrahedra.
Idea of the proof. Bang’s equality example covers the parts and by cylinders parallel to the - and -axes, respectively. These axes are parallel to opposite edges of the tetrahedron, and each base is a triangle. We subdivide these triangles into narrow sectors and give each sector its own tilted axis. Tilting reduces the perpendicular area, but it can also open gaps between neighboring sectors and between the two families.
Two choices prevent these gaps. First, the axes adjacent to a shared sector side make the planes containing that side coincide. At a point of the tetrahedron, these planes specify a finite list of -coordinates beginning at and ending at . Hence some adjacent pair brackets , even if the list is not ordered. This selects a sector in the first family; exchanging the roles of and does the same for the second. Second, we increase each sector’s radial extent by a quantity of order . A gap between the families could occur only near . There the radial heights of the two intercepts, measured from their respective tips, have opposite first-order shifts, and , so their sum changes only to second order. The increases can therefore be chosen small enough that their area cost is less than the quadratic gain from tilting.
Section 2 proves the projection minimum and derives the finite construction. Section 3 proves exact coverage: a first-crossing argument chooses angular sectors, and a single radial budget excludes simultaneous failure of their cutoffs. Section 4 computes the perpendicular areas. The angular mesh has size at most , which keeps the total approximation error of order even as the number of cylinders grows.
The same mechanism permits more freedom than the first construction uses. Section 5 gives a common criterion for continuous radial profiles, squared-radius cutoffs and bounded Cartesian apertures, and compares midpoint sampling with endpoint-centred sectors. Its estimates remain uniform as the partition is refined. Section 6 then lets the radial margin tend to zero with the tilt. In the same tetrahedron , its normalized cost is : one family of constructions attains the quadratic coefficient approached as the fixed margin tends to zero. Its cylinders cover for , whereas the explicit area bound guarantees strict saving for . Appendix A gives complementary direct proofs for curved caps, and Appendix B collects the exact counts and formulas under other parameter and scale choices.
Geometry and the finite construction
We first fix the area scale against which the covering will be measured. We then specify every triangle and every axis in the finite covering. The projection calculation is the facet-area-vector form of Cauchy’s projection formula; see [6] for its projection-body formulation. We include the face-by-face proof for this tetrahedron.
Lemma 2.1. For the tetrahedron (1.4), .
Proof. The outward face area vectors (unit normal multiplied by face area) are
Indeed, the supporting planes are and . The displayed outward normals have length , which is the area of each equilateral face of side length 2. For a unit vector , the faces with positive scalar product against project to partition the shadow, apart from the projections of edges and parallel faces, which have area zero. They give the forward endpoints of the chords parallel to . The projected area of a face with area vector is , as follows by projecting its two edge vectors and taking their cross product. The sum of the four area vectors is zero. Thus the shadow area is half the sum of their absolute scalar products with , namely
Put and . Since ,
Here , and account for the three terms separately. Hence , with equality at .
At zero tilt, the part is covered by an -parallel cylinder and the part by a -parallel cylinder. Each perpendicular base is a triangle of area . The lower intercept triangle can be parametrized as
Here is a slope parameter: for it is the second coordinate divided by . We call the intervals of angular sectors. The radial height is the third physical coordinate divided by , rather than Euclidean distance from the tip. The upper intercept triangle is similarly , with and . We now perturb a finite subdivision of these triangles.
Fix a positive tilt parameter , and put
In particular . To make adjacent tilted sectors meet, prescribe the displacement of the boundary with angular parameter by
The endpoint values will keep the outer angular sides in the fixed planes and . For real , the lines with direction through the points , , lie in the plane
Thus neighboring angular sides will lie in the same plane if both axes use the value there. On the interval , solve the two endpoint equations . This gives
and hence the exact matching identities
The choice of parabola also anticipates the radial estimate. At zero tilt, the ray of slope meets the middle section at . The lower intercept height should have first-order shift . This suggests . The endpoint equations make the negative secant slope of , so their limiting relation is . Together with the two endpoint conditions, this gives . The finite identities above, rather than this motivation, will be used in the proof.
We also enlarge each sector slightly beyond its original radial cutoff . Define
The function bounds the quadratic loss in the overlap of the two families; its role is made explicit in the coverage argument below. For later estimates, note that
Our intercept triangles and direction vectors are
Use the cylinders
To express them with perpendicular bases, project each intercept triangle onto the linear plane perpendicular to its direction and normalize that direction. Projection along the axis does not change the cylinder: . Moreover, it is injective on either intercept plane because the corresponding normal component of or is . Thus each actual base is a compact nondegenerate triangle, with finite area.
Figure 1 shows the original covering and the angular matching after the tilt. In a fixed plane , the neighboring sectors start at different translated vertices in coordinates, but their sides at a shared value of lie on the same line. Thus the matching concerns the supporting planes of the sides; the radial extents still have to be checked.

Figure 1. (a) At zero tilt, cylinders parallel to the two opposite edges cover the lower and upper halves of . (b) In the plane , neighboring angular sectors have distinct translated vertices and , but their sides at lie on the same line . The dashed line is , its zero-tilt position. Tilt and sector widths are exaggerated. Radial cutoffs are omitted; the colored regions end at the boundary of the displayed window.
Coverage of the entire tetrahedron
The shared-boundary identity gives an angular sector in each family for every point of . The remaining task is to prove that at least one of the two selected triangles has sufficient radial extent.
Proposition 3.1. For every , the cylinders (2.6)–(2.7), with parameters (2.1)–(2.4), cover the closed tetrahedron .
Proof. Choosing angular sectors. Fix and write . The intercept along is , where
Consider the finite sequence
Its endpoints are . Choose the first index for which , and set . Such an index exists because . If , then ; if , minimality gives . Thus , including when equals an extreme endpoint. Using (2.3), these inequalities are exactly
Subtracting their outer terms gives . Since , they force . Hence the selected first-family cylinder covers the point unless . This argument does not assume that the sequence is monotone.
For the second family, use the sequence
The same first-crossing choice gives an index for which
This cylinder covers unless .
Comparing the radial cutoffs. It remains to show that the two selected radial cutoffs cannot both fail. Suppose both selected cylinders miss the point. Then , and we can set
Since , (2.5) gives
Thus each of lies between and . Using and , we obtain
Since and , (3.4) gives . Thus the intercept heights and have opposite first-order changes and . This cancellation is the reason for choosing close to .
To control the remaining terms exactly, write and . The two radial excesses satisfy
For completeness, , while the intercept equations give and . Substitute these three identities into the left side of (3.5); the two mixed terms cancel.
For , both factors multiplying and are at least . Since , and , dividing (3.5) by yields
We bound the last term without losing uniformity at the boundary. From (3.4) and , ,
For a point inside its interval,
Consequently
The second inequality explains our choice of radial enlargement:
The cutoff definitions give
Using , the right side of (16) is therefore at least
For this is at least , a contradiction. All sector and cutoff inequalities are non-strict membership conditions. The argument applies to every point of the closed tetrahedron, including its faces, edges and vertices.
We retain the numerical estimate with a variable margin for the later construction in Section 6.
Corollary 3.2 (Quantitative coverage criterion). Let and . Choose an integer with , put , and define by eq:2.2. Use the triangles and directions eq:2.6–eq:2.7, with replaced by and with cutoffs
These cylinders cover whenever
Proof. The angular first-crossing argument is unchanged. If both selected caps failed, their intercept heights would exceed and have sum at most . Thus the rough-angle estimates and the radial budget remain valid with the same constants, independently of . The only later use of the margin is through . Consequently the same calculation as (16)–(17) gives , contradicting (3.8).
For the fixed parameters of the main construction, the coverage threshold will also guarantee strict area saving. We now bound the area remainder explicitly, so no further choice of a smaller tilt is needed.
The strict area decrease
Coverage is now established. We compare the perpendicular areas of the tilted triangles with the two-triangle cost . All error estimates below are uniform over the intervals of the partition.
Let denote the sum of the areas of all perpendicular bases. Each intercept triangle in eq:2.6 and eq:2.7 has physical area . Orthogonal projection between planes multiplies area by the absolute inner product of their unit normals. For either family, the factor is
We therefore have the exact finite formula
Proposition 4.1. For the construction (2.1)–(2.7) and ,
Proof. Put and
The bounds (2.5) imply and . For , direct differentiation gives
so
Taylor’s theorem at , followed by (4.1) and , now gives
In particular, the growing number of sectors causes no loss in the error bound: each remainder is weighted by its interval length.
It remains to replace this finite sum by a polynomial integral. For , set
Since on ,
Also and . The quantities in each of these differences have absolute value at most , so . Therefore
Integrating over all intervals shows that replacing the sum in (4.2) by costs at most . Finally,
so this integral equals . The combined error is at most , as claimed.
Proof of Theorem 1.1. The projection minimum is Lemma 2.1. The construction in Section 2 has exactly compact triangular perpendicular bases, and Proposition 3.1 proves that its cylinders cover for . Since , Proposition 4.1 gives
where the strict inequality follows from . The same proposition gives the expansion and its stated remainder.
The same computation also controls a margin chosen separately for each tilt. This will let us make the margin vanish without hiding its area cost.
Corollary 4.2 (Area estimate with a variable margin). Let and . Choose an integer with , put , and use the secant coefficients (2.2) and cutoffs
For the two families (2.6)–(2.7), with replaced by , their total perpendicular base area satisfies
The estimate is uniform over all these choices; it does not assume that the cylinders cover $K.
Proof. Here and , so the preceding second-derivative bound applies unchanged. It gives the Taylor error . In the comparison with , the constant cancels, leaving an error at most at each angular point. Integration therefore costs at most . Neither bound requires to be fixed as varies.
Other caps and angular partitions
The triangular construction leaves two choices available: how to end a sector radially, and where to sample its direction. The same balance between radial enlargement and perpendicular projection permits curved caps, smaller fixed margins, and sectors centred at the sampling nodes. We continue to use
Thus . All the cylinders below are specified by an intercept set and a nonzero direction; their bases are the perpendicular projections of the intercept sets.
A fixed positive margin
The following criterion isolates what the angular construction uses. Continuity of the displaced boundaries chooses a sector, and a positive quadratic margin ensures that the two chosen radial caps cannot both fail. The partition may be nonuniform, and its number of intervals need not satisfy an upper bound.
Theorem 5.1 (Compatible boundaries and radial caps). Let tend to zero through any set accumulating at zero. For each , choose a finite partition , constants , and positive continuous functions on . Suppose that is continuous on and . Suppose also, uniformly for every and , that
Here is fixed, and all error constants and their common range of validity are independent of . Define
For every sufficiently small admissible , the cylinders and cover the closed tetrahedron . Their bases are compact, and their total area satisfies
If each is constant, every base is a triangle. The threshold and error constant may depend on and the uniform constants in the hypotheses, but not on .
Proof. Fix . The continuous piecewise affine function has outer values , which bracket . Choose the first partition node after whose value is at least . Its preceding value is at most , by the initial endpoint inequality or by minimality. On the selected interval , put
The crossing inequalities say , so . If , then and the selected cylinder already covers the point. Otherwise for some . Applying the same argument to gives an interval and
Again already gives coverage. It remains to exclude and simultaneously. Assume these failures. For sufficiently small , the fixed positive margin and the uniform cap error imply . Since , each equals . The intercept equations then give and . Write and . The same complementary radial balance as in the triangular construction now has explicit sampling errors:
These identities follow by substituting and . Their left sides sum to one, and both factors multiplying the radial excesses are positive for small . Substitute the strict cap failures, divide by , and use to obtain
The error is uniform. This is impossible for sufficiently small , proving coverage, including the boundary.
The parametrizations of and have area Jacobians and , respectively, and are one-to-one off their tips. Projection multiplies area in either intercept plane by . Consequently
Uniform expansion of the integrand gives
The total angular length is two, so integration preserves the uniform fourth-order remainder regardless of the number of intervals. Finally
which proves (23). Each parameter domain is compact; its continuous image and perpendicular projection are compact as well. Projection is invertible between the intercept plane and the base plane, so a constant cap gives a nondegenerate triangle.
Triangular and curved apertures
For an ordinary interval , use
The identity at both endpoints matches adjacent boundaries exactly. If the maximum interval length is at most , for fixed , then (5.1) holds uniformly. With , each of the following choices satisfies (5.2):
midpoint triangles,
maximum triangles,
continuous radial caps,
squared-radius caps.
Indeed, has bounded derivative on , so replacing by its midpoint value or its cell maximum costs inside the parentheses. For (5.8), Taylor expansion at gives the required fourth-order error. Thus all four choices have the area formula (23). The first two give triangles; the last two give compact radial sectors.
Another choice specifies the radial enlargement through the transverse intercept. Put . For or , retain the bounded aperture
For small , this is exactly , where is continuous and satisfies (22). To verify this, consider on . Uniformly in ,
For small , is strictly increasing, is negative at , and is positive at . Its unique zero lies between these values and depends continuously on . Its defining equation first gives , and then
which proves the cap expansion. The outer bound in (29) is part of the definition: without it, the quartic inequality can admit a second, unbounded component.
The common conclusion is easiest to compare in the fixed tetrahedron : for each fixed , every cap above has normalized total area (23). Its threshold is uniform over partitions whose maximum interval length is at most , for a fixed . For example, an equal partition with any integer gives exactly cylinders, with the same threshold and error constant as the mesh is refined. Each cover is finite; no further limit in the number of cylinders is needed after choosing the tilt and mesh.
The squared-radius and Cartesian formulas also explain the geometry in two different ways. Appendix A.1 compares the two radial squares, while Appendix A.2 uses a discriminant to estimate the intercept height without locating the perturbed interface. These are alternative proofs of cases already covered by Theorem 5.1. Exact counts and costs for several rescaled parameter choices are collected in Appendix B.
Sampling at the endpoints
The compatibility condition also permits directions sampled at nodes rather than along secants of each sector. Let be an integer, , , and for . Put , , and for . Use the sectors and parameters
At an interior boundary, ; at the exterior boundaries . Thus the piecewise affine boundary function is continuous and vanishes at both ends. Every angular point of the th sector is within of , so all the hypotheses of Theorem 5.1 hold. There are sectors, with widths at the two ends and in the interior. Consequently, for all sufficiently large , this construction covers with exactly triangular bases and normalized total area
The half-width end sectors preserve the exact exterior boundaries. Appendix A.3 gives a complementary radial identity that verifies their coverage directly, and Appendix B.2 records the corresponding absolute area at edge length .
A vanishing radial margin
For a fixed positive margin, the normalized area coefficient is . We now let the margin tend to zero with the tilt and obtain the coefficient in a single family of finite triangular covers. The extra radial enlargement is cubic in the tilt. Its positive cubic area term explains why coverage persists on a much wider interval than the interval on which we prove a saving.
The fixed-margin theorem, Theorem 5.1, cannot be applied uniformly when tends to zero. Instead we use the explicit coverage budget in Corollary 3.2 and the uniform area estimate in Corollary 4.2. We keep the edge-two tetrahedron and the same slope coordinates.
Proposition 6.1. For every , the tetrahedron admits a cover by cylinders with compact, nondegenerate triangular perpendicular bases. Their total base area satisfies
In particular, for , and
Proof. Put
Use the secant coefficients (2.2), and set
The intercept triangles and directions are (2.6)--(2.7), with replaced by and these cutoffs. They give exactly cylinders. Their intercept triangles have positive area, and the normal component of each axis is one, so their perpendicular bases are compact nondegenerate triangles as before.
Coverage. For , take in Corollary 3.2. Its sufficient budget is
Thus the cylinders cover throughout this range.
For , the enlarged triangles are already large enough for the first family alone. Indeed, for the first-crossing argument selects a first-family sector with intercept height
Its cutoff obeys . The selected cylinder therefore contains the point. Both arguments use non-strict angular membership conditions, so they cover the closed body, including its boundary.
Area. For , the margin lies in . Corollary 4.2 consequently gives
which is (6.1). This application is uniform although the margin varies with the tilt. If , then
The negative quadratic term therefore exceeds both the positive cubic term and the error, giving . ∎
The equivalent edge-four construction, with its full coverage interval, exact cylinder count and scaled area estimates, is recorded in Remark B.1 of Appendix B.
Alternative coverage and area calculations
The fixed-margin criterion already proves coverage for the cap choices in Section 5. The following direct calculations explain three particular features: why squared-radius caps suit a comparison of radial squares, how a Cartesian discriminant avoids locating the perturbed interface, and how node-centred sectors retain the complementary radial cancellation. They are independent explanations of those cases, rather than inputs to the main construction or the vanishing-margin argument.
Squared radii
Let be a positive integer, put , use equal intervals, and write their width as . Put
The squared-radius cap (5.8), with and , is . The elementary secant identity is exact:
For the two angularly selected intercepts, write
The crossing argument supplies . If both radial caps fail, then and . Since and , substitution in
and use of (A.1) give the uniform expansions
For example , and the second identity uses . Since , the failures first give . The first strict lower bound on then gives , and the second gives , for a uniform constant . Thus . Adding (33) now yields
On the other hand and , so
The failed caps require the previous quotient to exceed , a contradiction for small .
Let denote the sum of the perpendicular base areas of all cylinders. The two families have equal total area, and the square in the cap makes the radial integration exact before the projection factor is expanded:
The squared cap therefore supplies both the coverage comparison and the exact radial part of the area integral.
A Cartesian discriminant
For an equal sector of width , the coefficients (24) satisfy
Suppose the angular crossing for one family has given
Here in the first family and in the second. Because is the sector midpoint, . Consequently
In particular . Take the Cartesian cap (29) with , fixed , and . Since , and , we have . For , this gives . Hence the polynomial upper bound is less than one whenever . Failure of the selected cylinder therefore implies even if the outer bound failed. Since and , (A.3) gives
for sufficiently small , uniformly in both families. If both failed, squaring these positive lower bounds and discarding their nonnegative fourth-order terms would give
The right sides are positive for small . Expanding their square roots with shows that their sum is
contradicting .
For either outer bound , the Cartesian aperture admits a direct area calculation without changing to angular variables at the boundary. In the intercept coordinates , put
For the added vertical length is exactly for small . Each remaining side region has both width and height , because there. Thus
Expanding the projection factor over , and using in its quadratic coefficient, gives the one-family cost
Here the cost is divided by in the edge-two normalization. The replacement of by changes the quadratic coefficient by , and the coefficient sampling error is also ; both contribute only to the area. Thus the normalized two-family cost is , as in (5.3). The Cartesian entries in Appendix B follow by substitution; the edge-one discriminant and aperture are translated there as well.
A direct check for node-centred sectors
Use the node-centred sectors of Section 5.3, and write their tilt as . The radial cutoff at a sample node is , and each angular point of its sector lies within of . If the two selected sample nodes are , write
where , , and . Direct substitution gives
If both radial caps failed along a sequence , then and , so . Passing to a subsequence with , gives , , while . Adding the identities and dividing by would therefore imply
This complementary identity gives a second explanation for why the half-width endpoint sectors still cover the boundary.
Counts and formulas under changes of scale
The constructions in the main text use the edge-two tetrahedron . A similarity of ratio produces a regular tetrahedron of edge length : it multiplies every base area and the minimum projection area by , while preserving the number of cylinders and the normalized cost. This appendix records several parameter choices and their coordinate dictionaries.
Secant sectors
In the following table, every row uses an equal partition with intervals and hence exactly cylinders. The body has edge length and is obtained from by a similarity of ratio ; accordingly the area is reported as . Each statement holds for all sufficiently large indicated integers or all sufficiently small indicated positive real parameters. Every displayed remainder is fourth order in the displayed tilt parameter, uniformly over the permitted finer meshes.
| Cap | ||||
| Midpoint | ||||
| Midpoint | ||||
| Midpoint | ||||
| Continuous | any | |||
| Squared radius | ||||
| Maximum | ||||
| Cartesian, | ||||
| Cartesian, |
Table 1.
The table follows by substitution in (5.3); in each row the mesh is bounded by a fixed multiple of . For the continuous cap, gives the ceiling count, whereas permits every integer , with the same threshold and error constant. The real-parameter midpoint row includes the reciprocal-integer construction after dilation by two. For the squared-radius row, the two families have equal area and each costs . For the first Cartesian row, either family costs with . These are genuine finite covers: the positive margin is fixed first, then a sufficiently small tilt and the specified finite mesh are chosen. No further limit in the number of cylinders is needed.
Node-centred sectors at edge length
For the endpoint construction of Section 5.3, write . Its cylinders retain that exact count under scaling. At edge length , the similarity ratio is and the minimum projection area is . Multiplying (5.10) by this area gives total base area
The Cartesian discriminant at edge length one
The following dictionary translates the Cartesian argument of Appendix A.2. In its edge-two coordinates, is the point of , is the transverse intercept, is its radial height, and is or in the respective family. The discriminant is (A.3). At edge-one scale, writing the point as and putting , the substitutions , , give the equivalent obstruction . In these coordinates the point is with or in the two families. The transverse intercept is . For , write . The edge-one slope coordinate is , whose sector has width . The same discriminant is , and its bound is .
Writing , the corresponding bounded aperture is
The outer bound remains part of the definition after scaling.
The cubic buffer at edge length four
Remark B.1 (The edge-four normalization). The similarity
sends onto the regular edge-four tetrahedron
It multiplies every area by four and leaves the cylinder count unchanged. Writing , the same cover has sectors in each family. On a sector , write for its cutoff in (6.2), and put
The two axes are and . Their radial intercept coordinates are and , with common cutoff
Thus these triangular cylinders cover for every . Since , their total area satisfies
and is strictly below for . More precisely,
The full coverage interval and the smaller sufficient saving interval remain distinct under this similarity.
References
- [1]Keith Ball. The plank problem for symmetric bodies. Inventiones Mathematicae, 104:535–543, 1991. Author manuscript: arXiv:math/9201218v1.DOI
- [2]Thøger Bang. A solution of the “plank problem”. Proceedings of the American Mathematical Society, 2(6):990–993, 1951.
- [3]Károly Bezdek. Tarski’s plank problem revisited. arXiv:0903.4637v1, 2009. Problem 3.1. Published in Bolyai Society Mathematical Studies 24 (2013), 45–64.arxiv.org/abs/0903.4637
- [4]Károly Bezdek and Muhammad A. Khan. The geometry of homothetic covering and illumination. arXiv:1602.06040v2, 2016. Version 2, 18 July 2016. Published in Discrete geometry and symmetry, Springer Proceedings in Mathematics & Statistics 234 (2018), 1–30.arxiv.org/abs/1602.06040
- [5]Károly Bezdek and Alexander E. Litvak. Covering convex bodies by cylinders and lattice points by flats. Journal of Geometric Analysis, 19(2):233–243, 2009. Author manuscript: arXiv:0903.4842v1.DOI
- [6]Horst Martini. Convex polytopes whose projection bodies and difference sets are polars. Discrete & Computational Geometry, 6:83–91, 1991.DOI
- [7]William Verreault. Plank theorems and their applications: A survey. Bulletin of the London Mathematical Society, 58(1):e70230, 2026. First published online 9 November 2025.arxiv.org/abs/2203.05540