1. Introduction
Let
be an
n-dimensional real Banach space with
origino and
unit ball . For two distinct points
, denote by
the
closed segment connecting
x and
y. For each
, denote by
and
the
convex hull and the
interior of
A, respectively. Let
A be nonempty and bounded; the
diameter of
A is defined by
A compact convex subset of X with interior points is called a convex body. Let be the set of convex bodies in X. For each , set .
In 1933, Borsuk [
1] posed the following problem:
Problem 1. (Borsuk’s Problem). Is it possible to partition every bounded set in the n-dimensional Euclidean space into subsets of smaller diameters?
The answer is positive when
(cf. [
2,
3,
4,
5]). In 1993, J. Kahn and G. Kalai gave counterexamples to Borsuk’s problem in high dimensions (cf. [
6]). In 2003, dimensions with counterexamples were reduced by A. Hinrichs and C. Richter to
(cf. [
7]). In 2014, A. Bondarenko presented a 65-dimensional counterexample (cf. [
8]). In the same year, T. Jenrich and A. E. Brouwer [
9] gave a 64-dimensional one. Up to now, this problem has been open for
. In 2021, C. Zong [
10] proposed a quantitative program to attack it.
B. Grünbaum [
11] extended Borsuk’s problem to Banach spaces. For a bounded set
, let
be the smallest positive integer
m such that
A can be represented as the union of
m sets with smaller diameters. Recently, J. Wang, F. Xue, and C. Zong [
12] proved that
holds for every bounded set
. For more information about Borsuk’s problem, we refer to [
13,
14].
In 2021, Y. Lian and S. Wu [
15] studied Borsuk’s partition problem in finite dimensional Banach spaces by estimating
for
and
, and
where
. They obtained that
,
. Later, L. Zhang, L. Meng, and S. Wu improved this result by showing that
(cf. [
16]). Recently, this result was reduced to
in [
17].
The map
is called the
partitioning functional in
X.
Compared to Borsuk’s problem in Euclidean space, Borsuk’s problem in finite dimensional Banach spaces is more difficult due to the influence of the norm of the space on the partitioning functional of bounded sets. In addition, Chuanming Zong proposed a reformulation for Borsuk’s problem, converting the estimation of Borsuk partition numbers into the estimation of partitioning functionals for bounded sets. Therefore, we study the estimation of partitioning functionals for special convex bodies in finite dimensional Banach spaces.
In the sequel, let A be a convex body in with the origin o in its interior, and u be a point in . Without loss of generality, we assume that .
In
Section 2, we obtain a series of results concerning partitioning functionals of convex cones (the convex hull of the union of
A and
). In
Section 3, we show that
where
C is the sum of
A and
. In
Section 4, we show that
, where
T is the convex hull of
and
.
2. Partitioning Functionals of Convex Cones
For
, and each subset
B of
A, we put
Lemma 1. Let . Then, Proof. For every pair of points
, there exist two numbers
and two points
such that
Assume, without loss of generality, that
. Then,
If , then .
If
, then
Lemma 2. Let . Then, Proof. Since
and
we have
and
. It follows that
□
Remark 1. Lemma 2 provides the diameter of convex cones, which is an indispensable step for estimating partitioning functionals of convex cones.
Put ; then, D is a cone with apex u and base A.
Theorem 1. Let m be a positive integer satisfying , and . Then, Proof. For each
, there exists a collection
of subsets of
A such that
and
Let
. It is not difficult to verify that
. Moreover,
By Lemmas 1 and 2,
and
We consider the following three cases.
Case 1:
. Put
. Then,
, and
It follows that
Case 2:
. In this case, we require further that
. Put
. Then,
and
It follows that
Case 3:
. Put
. Then,
and
It follows that
This completes the proof. □
Remark 2. In Theorem 1, a partition method for convex cones is presented, from which an estimate of the partitioning functional of convex cones is derived. It is evident from Theorem 1 that the value of the partitioning functional of a bounded set in a Banach space is closely related to the properties of the set itself.
Corollary 1. Let m be a positive integer satisfying . Then, Proof. Set
and
Then,
is decreasing on
and
is increasing on
. Hence,
By Theorem 1,
Since
,
. □
Proposition 1. Let , , , and . Then, Proof. It is clear that
. It follows from Proposition 4 in [
15] that
. By Theorem 1,
Suppose the contrary that
. Then, there exist five subsets
,
,
,
, and
of
D such that
and
. Denote by
the set of extreme points of
A. We may assume that
and
,
. The partition is shown in
Figure 1. Since
,
and
, we have
, a contradiction. Therefore,
. □
It follows from Theorem 1 and Proposition 1 that estimations of partitioning functionals of convex cones, which are the best possible for certain pairs of m and D, are obtained.
Furthermore, when
m and
are sufficiently large, by (
1), the above result is not optimal. Proposition 2 will give a better estimation in this situation.
For
, and each subset
B of
A, we put
Proof. For every pair of points
, there exist two numbers
and two points
such that
and
Assume, without loss of generality, that
. Then,
Therefore,
Clearly,
. Since
and
for any two points
,
. Thus,
Since, for arbitrary two points
,
we have
Proposition 2. Let m be a positive integer satisfying , and . Then, Proof. It is clear that
By Lemma 3, for each
,
Then,
Therefore,
□
When is sufficiently small, we have the following result.
Proposition 3. Let m be a positive integer satisfying . If , then Proof. Since
,
. For each
, there exists a collection
of subsets of
D such that
Then,
. Thus,
It follows that
.
For each
, there exists a collection
of subsets of
A such that
Then,
Thus, by Lemma 2,
It follows that
. □