114 CHAPTER 4. LINEAR SPACES

If B1,B2 ∈ G then B1∩B2 = /0, (4.24)

G is maximal with respect to 4.23 and 4.24. (4.25)

By this is meant that if H is a collection of balls satisfying 4.23 and 4.24, then H cannotproperly contain G .

Proof: Let S denote a subset of F such that 4.23 and 4.24 are satisfied. Since k < M,4.23 is satisfied for some ball of S. Thus S ̸= /0. Partially order S with respect to setinclusion. Thus A ≺B for A ,B in S means that A ⊆B. By the Hausdorff maximaltheorem, there is a maximal chain in S denoted by C . Then let G be ∪C . If B1,B2 are inC , then since C is a chain, both B1,B2 are in some element of C and so B1∩B2 = /0. Themaximality of C is violated if there is any other element of S which properly contains G .■

Proposition 4.5.3 Let F be a collection of balls, and let

A≡ ∪{B : B ∈F} .

Suppose∞ > M ≡ sup{r : B(p,r) ∈F}> 0.

Then there exists G ⊆F such that G consists of balls whose closures are disjoint and

A⊆ ∪{B̂ : B ∈ G }

where for B = B(x,r) a ball, B̂ denotes the open ball B(x,5r).

Proof: Let G1 satisfy 4.23 - 4.25 for k = 2M3 .

Suppose G1, · · · ,Gm−1 have been chosen for m ≥ 2. Let Gi denote the collection ofclosures of the balls of Gi. Then let Fm be those balls of F , such that if B is one of theseballs, B has empty intersection with every closed ball of Gi for each i≤ m−1. Then usingLemma 4.5.2, let Gm be a maximal collection of balls from Fm with the property that eachball has radius larger than

( 23

)mM and their closures are disjoint. Let G ≡ ∪∞

k=1Gk. Thusthe closures of balls in G are disjoint. Let x ∈ B(p,r) ∈F \G . Choose m such that(

23

)m

M < r ≤(

23

)m−1

M

Then B(p,r) must have nonempty intersection with the closure of some ball from G1 ∪·· ·∪Gm because if it didn’t, then Gm would fail to be maximal. Denote by B(p0,r0) a ballin G1∪·· ·∪Gm whose closure has nonempty intersection with B(p,r). Thus both

r0,r >(

23

)m

M, so r ≤(

23

)m−1

M <32

r0

Consider the picture, in which w ∈ B(p0,r0)∩B(p,r).

wr0

p0 rpx

114 CHAPTER 4. LINEAR SPACESIf By,By € GY then Bi Bz = 9, (4.24)G is maximal with respect to 4.23 and 4.24. (4.25)By this is meant that if F is a collection of balls satisfying 4.23 and 4.24, then H cannotproperly contain Y.Proof: Let G denote a subset of Y such that 4.23 and 4.24 are satisfied. Since k < M,4.23 is satisfied for some ball of G. Thus G #9. Partially order G with respect to setinclusion. Thus < < & for &,# in G means that < C Z. By the Hausdorff maximaltheorem, there is a maximal chain in G denoted by @. Then let Y be U@. If B), Bz are in@, then since @ is a chain, both B;,B2 are in some element of @ and so B} N Bz = 0. Themaximality of @ is violated if there is any other element of G which properly contains ¥.|Proposition 4.5.3 Let ¥ be a collection of balls, and letA=U{B: Be F}.Supposecoo > M=sup{r: B(p,r) € F}>0.Then there exists C F such that Y consists of balls whose closures are disjoint andACU{B: BEG}where for B = B(x,r) a ball, B denotes the open ball B(«,5r).Proof: Let Y satisfy 4.23 - 4.25 fork = 2MSuppose Y,--- ,Yn—1 have been chosen for m > 2. Let @, denote the collection ofclosures of the balls of Y. Then let ¥,, be those balls of .Y, such that if B is one of theseballs, B has empty intersection with every closed ball of Y for each i < m—1. Then usingLemma 4.5.2, let G,, be a maximal collection of balls from .F,,, with the property that eachball has radius larger than (3)"M and their closures are disjoint. Let Y = UP_,%. Thusthe closures of balls in Y are disjoint. Let a € B(p,r) € F \Y. Choose m such that2 m 2 m—-1=) M<r<[- MThen B(p,r) must have nonempty intersection with the closure of some ball from 4 U--- UG» because if it didn’t, then Y,, would fail to be maximal. Denote by B (po, 70) a ballin Y U---UG, whose closure has nonempty intersection with B (p,r). Thus both2\" 2\"1 3ro,r > (5) M,sor< (5) M< 3/0Consider the picture, in which w € B(pg,ro) OB (p,r).y