Balls in [Wk Do Not Cut All Subsets of k + 2 Points

ADVANCES
IN
MATHEMATICS
31, 306-308
Balls in [WkDo Not
(1979)
Cut All Subsets of k + 2 Points’
R. M. DUDLEY
Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
For any set E cf k + 2 points in iRk, k =
the form B A E where B is a ball.
1,2,...,
not all subsets
of
E are of
Let S be a set and % a classof subsetsof S. For each finite set F C S, let
denote the number of different sets C n F, C E %. For n = 1,2,..., let
dQ(F)
mW(n):= max{d”(F): cardF = n}
where card F is the number of elementsin F. Let
V(g) := inf(n: myp(7z)
< 2n},
= + co if
mW(P(n)
= 2n for all n.
Vapnik and Cervonenkis [4] introduced the above quantities and proved that
mW(n)< n”@) + 1. In [5, p. 2171, they show that tnQ(y) < 3~“~‘/(2(w - l)!),
where z, := I’(%‘), if r > n. Thus either m*(r) = 2’ for all r, or me(r) grows
much more slowly, as a power of Y. This has probabilistic implications
[L 2,3,4, 51.
In W, let B(k) denote the set of all closedballs
B(x, s) := {y: 1x - y 1< s},
x E UP, s > 0, where 1* ] denotesthe usual Euclidean norm. Let =8(K) denote
the set of all closedhalf-spaces
fqx, 4 := {y: (Y, x) 2 4,
UER,YEW.
For any real-valued function g on a set X let
m(g) := {x Ex: g(x) > 0).
1 This research
MCS76-07211.
was
partially
supported
by the
306
OOOl-8708/79/030306-03$05.00/0
Copyright
All rights
Q 1979 by Academic
Press, Inc.
of reproduction
in any form reserved.
National
Science
Foundation
Grant
BALLS
DO
NOT
CUT
ALL
SUBSETS
307
For a set G of functions let
nn(G) := {nn(g): g E G}.
The following is known
THEOREM
A.
([l], [2, Theorem 7.21):
If G is an m-dimensional
vector space of real functions
on a set,
then V(nn(G)) = m + 1.
Taking X = IWkand G asthe spaceof afhne functions, we obtain
THEOREM
B.
V@‘(k))
= k + 2 for all k = 1,2,... .
If G on IWkis the vector space spanned by 1, 1x 12, and the coordinates
x1 ,..., xk, then B(k) Cnn(G), so by Theorem A, V(B(k)) < V(mz(G)) = 1 +
dim(G) = k + 3. Actually, we have
THEOREM
1. V(B(k)) = k + 2 for all k = 1,2,... .
One might askwhether Theorem 1, like Theorem B, is implied by the genera1
Theorem A. Suppose B(k) C nn(G) where G is a vector space of dimension
k+ 1.LetFbeasetofk+2pointsv,,...,v,+,of[Wkwherev,
=O,vathrough
vk+2are linearly independent, and v2 = (vs + a.* + vk+2)/(k + 1). Take a balI
B EB(k) with center v2 and small enough positive radius so that F n B = (v2>.
Take g E G with nn(g) = B. Take j E G with v2# m(j). Then for h = g - I
and Esmallenough,h(v,) > 0 > h(q) f or i # 2. But then F\{v,} = nn(-h) n F.
For any subsetA of F other than thesetwo, A and F\A have disjoint convex hulls,
so they can be separatedby a hyperplane, and A = C n F for someball C of
large enough radius. Thus all subsetsof F are of the form E n F, E Enn(G),
contradicting Theorem A. So Theorem 1 cannot be obtained in this way.
From Theorem B and the nature of half-spacesit follows that rnmck)(k+ 2) Q
2k+a- 2. From Theorem 1 it will follow that rnrr(n(k + 2) < 2”f2 - 1. Note
that both thesebounds are attained, for the setF in the last paragraph.
Proof of Theorem1. Let A C Iwk be any set containing k + 2 points x, ,,..,
xk+a. Let co(B) denote the convex hull of B. By Theorem B, and since disjoint
convex setscan be separatedby a hyperplane, there is someB C A such that
for C := A\B, co(B) n co(C) # 45. Suppose S and T are closed balls with
SIB,SnC=+,T3C,TnB=$.
But then BCS\T and CCT\S are
Q.E.D.
strictly separatedby a hyperplane, a contradiction.
It would be interesting to extend Theorem 1 to suitable Riemann manifolds.
In an infinite-dimensional Hilbert space,for the class99 of balls V(g) = + co.
In fact, there exists a curve C such that for every finite F C C, there is a closed
ball B with B fl C = F [3, Proposition 21.
308
R. M.
DUDLEY
REFERENCES
1. T. M. COVER, Geometrical
and statistical
properties
of systems of linear inequalities
with applications
to pattern
recognition,
IEEE Trans. Electron. Comput.
EC-14 (1965),
326334.
2. R. M. DUDLEY,
Central
limit
theorems
for empirical
measures,
Ann. ProbabiZity
6 (1978), 899-929.
3. F. TOPSBE, R. M. DUDLEY, ANJJ J. HOFFMANN-JBRGENSEN,
Two examples
concerning
uniform
convergence
w.r.t. balls in Banach spaces, in Lecture
Notes in Mathematics
No. 566, pp. 141-146,
Springer-Verlag,
Berlin/New
York,
1976.
4. V. N. VAPNIK
AND A. YA. ~RVONENKIS,
On the uniform
convergence
of relative
frequencies
of events to their probabilities,
Theor. Probability
Appl. 16 (1971), 264-280
(English);
Teor. Ve’erojatnost.
i. Primenen.
16 (1971),
264-279
(Russian).
5. V. N. VAPNIK AND A. YA. CERVONENKIS,
“Theory
of Pattern Recognition”
(in Russian),
Nauka,
Moscow,
1974.