WorksMathematics
An exponential improvement for Borsuk's problem
Abstract
We present a method for improving the classical exponential base in the upper bound for Borsuk's partition number. The emphasis is on explaining the method rather than optimizing the bound. The problem is reduced to constructing directions which make an acute angle with every member of a prescribed spherical set. These play the same role as the illuminating directions in Schramm's method. The geometric ingredients are an antipodal pairing, a lift by one coordinate, and reflection in a self-dual cone. This reflection folds Euclidean space into the cone. A translation opposite to the horizontal part of its Gaussian mean makes the required supporting inequalities hold with high probability. The Gaussian Poincaré inequality controls the mean, and the formula for translating a Gaussian density bounds the measure cost of this construction.
The result and the ideas
Let be the least integer such that every bounded set of positive diameter in can be partitioned into at most sets of strictly smaller diameter. Schramm [8] and Bourgain–Lindenstrauss [2] established the classical bound
The purpose of this note is to improve its exponential base with simple constants and a fully explained proof1. For further background on Borsuk’s problem, see Kalai’s 2015 survey [5].
Theorem 1.1. As ,
In particular, for all sufficiently large , whereas .
For a compact nonempty , write
This is the open positive polar: the directions making an acute angle with every member of . Let be probability surface measure on . The estimate behind the theorem is the following stable form.
Proposition 1.2. For every with , there are and such that
Here denotes angular diameter, and the choices are uniform over all compact nonempty .
Why this is relevant to partitions. Fix a small and join two points of a diameter-one set whenever their distance is at least . A direction selects a point if for every neighbour : viewed along , the point lies strictly ahead of all its neighbours. Two neighbours cannot both be selected, because this would require both and . The class selected by therefore has diameter at most . A collection of directions selecting every point gives a covering by such classes, and assigning each point to one class gives the desired partition.
Within a small neighborhood in the set, collect all unit vectors pointing from nearly diametral neighbours towards points of that neighborhood. Their angular diameter is close to , and any direction in their open positive polar selects the whole neighborhood. Proposition 1.2 gives a uniform lower bound for the probability of this event. Only exponentially many neighborhoods are needed; a union bound then requires an additional factor of order in the number of sampled directions.
This is a direct analogue of Schramm’s approach to illuminating bodies of constant width [8]. At a boundary point, the outward unit normals have angular diameter at most , and the negative of a direction in their open positive polar illuminates that point. Schramm used spherical cap-containment and an antipodal pairing argument to estimate the measure of admissible directions. Discretization and random sampling then gave the exponential base , both for illumination and, as a consequence, for Borsuk’s problem.
How the polar estimate improves the exponent. We first prove the polar estimate for the set in Proposition 1.2 under the exact assumption ; the small increase of the diameter is handled in § 6. Central projection (also known as gnomonic projection) writes as
where is a suitable pole and lies in the unit ball of . If a unit vector satisfies , then
This sector supplies the exponential measure factor . The value corresponds to the classical base , so we seek many directions satisfying the stronger inequality with .
An antipodal pairing first reduces the task to the outer shell , losing only a factor two in measure. The lift
makes the shell acute: every pair of lifted vectors has nonnegative scalar product. A self-dual cone containing the lift has a reflection which is even, preserves length, and is nonexpansive, meaning . Evenness and Gaussian Poincaré force to have length at least . The cone also ensures , giving supporting inequalities for every lifted point at once.
We translate opposite to the horizontal part of , by a fraction of that mean. The supporting inequalities and the mean bound then show that the direction of the translated horizontal Gaussian is good for the entire shell with probability tending to one. Returning to ordinary Gaussian measure costs a factor at worst . Together with the sector factor, this gives the reciprocal exponential base . Once the support bound is established, these two factors improve the classical exponent provided that
For and , the reciprocal base is . Its reciprocal is less than the value in Theorem 1.1, hence less than .
Sources of the ideas. The study of small spherical bodies of constant width by Hall, Prymak and Sujsuntinukul [3], including Gaussian methods near the central width , provided a crucial context for this work. The central projection and antipodal pairing follow Schramm’s method [8]. The outer-shell pairing used here is a generalization of that idea. The key geometric fact about self-dual cones comes from Moreau’s decomposition [7]: every vector is the difference of two orthogonal vectors and in the cone , where is the nearest-point projection onto . Replacing their difference by their sum defines the length-preserving folding and ensures . The additional ingredient in the present argument is the radial lift which makes this cone geometry available for the outer shell.
From good directions to smaller-diameter pieces
We first prove Theorem 1.1 from Proposition 1.2. This is Schramm’s discretization and random-direction strategy, expressed directly in terms of partition classes. It uses packing, random sampling, and the observation that two points cannot both lie ahead of each other.
Fix and choose from the proposition. Choose a fixed so small that
After taking a closure and rescaling, it suffices to partition a compact set of diameter one. Take a maximal -separated family and put . These neighborhoods cover . Disjoint balls of radius around their centres lie in a ball of radius , so
For each neighborhood consider all directions from a nearly diametral neighbour towards a point in that neighborhood:
If nonempty, is compact. For and in ,
Thus (3) and Proposition 1.2 give for all sufficiently large .
Choose
independent directions uniformly distributed on . The probability of missing at least one of the polars with is at most . Some choice therefore meets them all.
For a direction define
If , then . If is empty, this inclusion holds for every . Consequently the cover . If had , the definition would give both and , an impossibility. Hence
Assigning each point to the first covering set containing it gives a partition. By (4), . Letting proves the theorem.
Central projection and an outer shell
We now prove Proposition 1.2, starting with the exact diameter assumption , or equivalently for all .
Flattening the spherical set
3.1. Flattening the spherical set. Let be the nearest point of to the origin and set . For any convex combination ,
The nearest-point inequality gives for , so . Central projection onto the tangent hyperplane therefore writes
where is the unit ball in . The spherical diameter bound says that any two points of have scalar product at least . Substituting their representations from (5) therefore gives
For a compact set put ; for the empty set use . Fix throughout
Let and .
Support bounds give a spherical sector
3.2. Support bounds give a spherical sector. We first relate the measure of to that of the positive polar . For every and , the direction belongs to , because
Figure 1 illustrates the projection and this sector. Polar integration gives
Figure 1. A two-dimensional section through and . Central projection follows the ray through to . When , directions with lie in the positive polar. The sector’s limiting boundary ray is orthogonal to .
The ratio is at least . For an elementary verification, bound the denominator by and integrate the numerator only over ; this loses only a polynomial factor and an absolute constant. Thus the remaining task is to find enough support directions with threshold to compensate for their probability cost, as in (2).
Pairing opposite directions
3.3. Pairing opposite directions.
Lemma 3.1. The outer shell controls the whole set up to a factor two:
Proof. We first exclude and a unit vector with
Put and . Decomposing along bounds above by . By (6), , so this upper bound can be squared after adding one. For the next step, apply Cauchy–Schwarz to the two vectors
Their scalar product is , so
Consequently,
The expression on the second line increases with , and . The strict last inequality is exactly
This contradicts (6). Now suppose . A point witnessing must lie inside the shell. The excluded configuration shows that . Thus , and antipodal symmetry proves (9). □
The point of this pairing is that we need not control the inner part of probabilistically. If an inner point “spoils” a direction already good for the shell, the pairing argument shows that the opposite direction is good for all of .
A lift with one formula
Set and lift each to
Geometrically, these points lie on the graph of the paraboloid , restricted to . The last coordinate is its height above the horizontal space . These lifted vectors have positive pairwise scalar products. Indeed, for and in , (6) gives
The right-hand side is concave in each variable separately, so its minimum occurs at a corner. The three distinct corner values are
All are positive: for the middle value, .
The extra coordinate compensates for possible negative products . Its height decreases towards the outside, where (6) already gives better products. This is why a radius-dependent lift is useful.
Reflection and its Gaussian mean
For a closed convex cone let . A cone is acute when and self-dual when .
We use the classical completion result of Barker and Foran [1], which is an easy consequence of Zorn’s lemma.
Lemma 4.1 (Barker–Foran completion). Every closed acute convex cone is contained in a closed self-dual cone in the same Euclidean space.
By (11), the closed convex cone generated by the is acute. Complete it to a self-dual cone . If is empty, is the whole sphere and this and the next section may be skipped.
Let be nearest-point projection onto and put . Moreau’s decomposition reads
For completeness, if , the projection inequality gives and . Writing , the same inequality shows . Thus : the reflection folds the space into the cone. It also follows that
The folding is illustrated in Figure 2.
Figure 2. Moreau’s orthogonal pair , . Replacing their difference by their sum folds into without changing its length. The dashed arc records the equal lengths; the shaded quadrant, in the plane spanned by , , lies in .
Projection also satisfies
Expanding a square gives . For , we have : this folds each coordinate to the positive half-line and preserves length. The general reflection has the same three properties in (12).
Let be a standard Gaussian vector in and . The coordinates of are independent real Gaussians of mean zero and variance one. We use the ordinary Gaussian Poincaré inequality and its even version:
The first inequality is the standard Gaussian Poincaré inequality; see [4]. For the second, apply [6 Lemma 2.3] to : an even function is orthogonal to every linear function under Gaussian measure. Both inequalities extend to Lipschitz functions by smooth approximation, preserving evenness when needed. Each coordinate function is even and -Lipschitz. The second inequality therefore gives . Summing these scalar inequalities yields
Since , we obtain
This is the source of the gain: an even contraction preserving Gaussian length cannot have a small mean.
A translation makes good directions typical
Let be the added coordinate direction and let be orthogonal projection onto . We use the horizontal part and the height of the mean:
The projection keeps the original horizontal coordinates and discards the coordinate added in the lift. Thus is the average horizontal position of the folded Gaussian , while is the absolute value of its average height, on the scale . Now define the shifted horizontal Gaussian and its direction:
The vector is shifted opposite to and rescaled to have typical length of order one. Its direction is the candidate good support direction; almost surely.
The cone projection supplies the auxiliary vector
It is the horizontal part of , shifted by . Since , the candidate splits as
The full vector belongs to , so its scalar product with every lifted point is nonpositive. Thus the second term has an upper support bound supplied by the added coordinate. It remains to control the length of .
Three scalar estimates
Because is even, . Also . Consequently
where (14) was used and
Notice the term linear in in : the geometric improvement starts at first order in the translation, while its measure cost will be quadratic.
The ordinary inequality in (13) and Chebyshev’s inequality now imply, with probability ,
Here are the details needed for uniformity. The functions , , and have Lipschitz constants at most , respectively, so their variances are bounded by . Each differs from its mean by at most with probability . Moreover,
so ; and . These observations prove (17), with errors independent of .
Controlling the whole shell at once
For , put . Since and ,
Combining this with (15), on the single event (17) we obtain, simultaneously for all ,
The last inequality is Cauchy–Schwarz applied to and . This step handles every possible orientation of the mean.
Only a quadratic on remains. It is convex, and its endpoint values are
Therefore the square of the main term in (18) is less than
It follows that with probability . There is no union bound over : the same three scalar estimates control every point of this possibly infinite set.
Paying for the translation
Let and define
We have just proved , and by (14). Write for standard Gaussian measure, whose density is . This density gives the exact change-of-variables identity
Since , Chebyshev gives . Restricting the expectation to the intersection of the two good events yields
The direction of is uniform on , so
This calculation is the whole measure comparison. In probabilistic terms, we first make the desired event typical by shifting a Gaussian, then read its probability under the original Gaussian from the density.
The final bound and stability
Combining (9), (21), and (8) proves the uniform estimate
If is empty, (9) gives , which is stronger than needed. Finally, for , and therefore
Handling a small increase of the diameter
To apply Proposition 1.2 simultaneously to all points in each small neighborhood in § 2, the polar bound must remain valid for angular diameters slightly larger than . The strict gaps in the pairing and lift estimates allow this enlargement. Suppose now , where is sufficiently close to . The same nearest-point argument writes the image under central projection as , with
For its constraint is
On the compact square , the right-hand side converges uniformly to that of (6) solved for . The exclusion in Lemma 3.1 has the fixed gap (10), and the lift inequality (11) has strictly positive corner minima. Both therefore hold for close enough to , with exactly the same . The Gaussian part of the argument is unchanged. Only the sector factor changes, to , so
All errors are uniform. For any , (23) and continuity allow a fixed for which the displayed base is greater than . Taking proves Proposition 1.2.
References
References
- [1]G. P. Barker and J. Foran, Self-dual cones in Euclidean spaces, Linear Algebra Appl. 13 (1976), 147–155. doi:10.1016/0024-3795(76)90053-7.DOI
- [2]J. Bourgain and J. Lindenstrauss, On covering a set in ℝ^N by balls of the same diameter, in Geometric Aspects of Functional Analysis (1989–90), Lecture Notes in Math. 1469, Springer, 1991, pp. 138–144. doi:10.1007/BFb0089220.
- [3]A. Hall, A. Prymak, and C. Sujsuntinukul, Exponential bounds for the spherical Blaschke–Lebesgue problem, 2026. arXiv:2606.30960.arxiv.org/abs/2606.30960
- [4]S. Janson, Gaussian Hilbert Spaces, Cambridge Tracts in Math. 129, Cambridge University Press, 1997.DOI
- [5]G. Kalai, Some old and new problems in combinatorial geometry I: around Borsuk’s problem, in Surveys in Combinatorics 2015, Cambridge University Press, 2015, pp. 147–174. doi:10.1017/CBO9781316106853.005.DOI
- [6]J. Lehec, The symmetric property (τ) for the Gaussian measure, Ann. Fac. Sci. Toulouse Math. (6) 17 (2008), no. 2, 357–370. doi:10.5802/afst.1186.DOI
- [7]J.-J. Moreau, Décomposition orthogonale d’un espace hilbertien selon deux cônes mutuellement polaires, C. R. Acad. Sci. Paris 255 (1962), 238–240.
- [8]O. Schramm, Illuminating sets of constant width, Mathematika 35 (1988), 180–189. doi:10.1112/S0025579300015175.DOI