14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

476 <strong>Geometry</strong> of Numbers<br />

(P + li) ∩ (P + li+1) is a common facet of P + li <strong>and</strong> P + li+1 which contains G as<br />

a face. The sequence of polytopes P +l = P +l1, P +l2,...,P +ln = P + m then<br />

is called an {l, m}-chain. Next, let the small sphere S of dimension d − k − 1 ≥ 2<br />

be chosen as in the proof of (7). Our {l, m}-chain then gives rise to a sequence of<br />

(d − k − 1)-dimensional spherically convex polytopes R1 = (P + l1) ∩ S,...,Rn =<br />

(P + ln) ∩ S on S, called a spherical {l, m}-chain. From the proof of (7), we see<br />

that the spherical polytopes (P + l) ∩ S, l ∈ L(o, G), cover S. By assumption,<br />

int R1 ∩ int Rn = int(P + l) ∩ int(P + m) ∩ S �= ∅.<br />

Choose a point p ∈ int R1 ∩ int Rn such that its antipode in S is not contained<br />

in the spherical hull of any face of any of the spherical polytopes (P + l) ∩ S,<br />

l ∈ L(o, G). Byaloop based at p associated with the spherical {l, m}-chain<br />

R1,...,Rn, we mean a closed spherical polygonal curve C on S starting at p which<br />

can be dissected into the (great circular) arcs C1 ⊆ R1,...,Cn ⊆ Rn such that Ci<br />

<strong>and</strong> Ci+1 meet in Ri ∩Ri+1. Of course, Cn <strong>and</strong> C1 meet at p. The loop C is an interior<br />

loop if each arc Ci is contained in relint(Ri−1 ∩ Ri) ∪ int Ri ∪ relint(Ri ∩ Ri+1).<br />

Denote the length of C by |C|. Letλ denote the infimum of the lengths of the interior<br />

loops based at p associated with all possible spherical {l, m}-chains.<br />

To conclude the induction, we will show that both λ = 0 <strong>and</strong> λ>0 lead to a<br />

contradiction. Clearly, λ = 0 contradicts the definition of loops based at p. It remains<br />

to consider the case λ>0. By (5) <strong>and</strong> the definition of {l, m}-chains, there are only<br />

finitely many {l, m}-chains. A compactness argument then implies that there is a<br />

loop D based at p with |D| = λ <strong>and</strong> associated with the spherical {l, m}-chain<br />

R1 = (P + l1) ∩ S,...,Rm = (P + lm) ∩ S, say. An interior loop based at p<br />

associated with a spherical {l, m}-chain can always be deformed into such a loop of<br />

smaller length. Thus D cannot be an interior loop. By our choice of p, most great<br />

circles on S through p avoid all spherical faces of dimension at most d − k − 3of<br />

all spherical polytopes (P + l) ∩ S, l ∈ L(o, G). (To see this project these spherical<br />

faces from p, respectively, its antipode into the equator of S corresponding to the<br />

north pole p.) Each such great circle is an interior loop based at p of length 2π.<br />

Since an interior loop cannot have minimal length, λ

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!