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.

6 Mixed Volumes <strong>and</strong> Quermassintegrals 91<br />

The coefficient matrices of these systems of linear equations in a0n,...,adn, n =<br />

1, 2,..., all are equal to a fixed V<strong>and</strong>ermonde matrix <strong>and</strong> thus non-singular. An<br />

application of Cramer’s rule then shows that<br />

Thus<br />

a0n → a0,...,adn → ad, say.<br />

�<br />

a0 + a1λ +···+adλ<br />

qn(λ) →<br />

d<br />

�<br />

for each λ ≥ 0.<br />

q(λ)<br />

Hence q(λ) = a0 + a1λ +···+adλ d for λ ≥ 0, concluding the proof of (4).<br />

We now prove the lemma by induction on m. In the following, all coefficients are<br />

supposed to be symmetric in the indices. For m = 1letpn(λ) = anλ d . Then<br />

an = pn(1) → p(1) = a, say,<br />

by assumption. Thus<br />

pn(λ) = anλ d �<br />

a λd �<br />

→ for each λ ≥ 0<br />

p(λ)<br />

by assumption. Hence p(λ) = aλ d for λ ≥ 0. (The case m = 1 is also a consequence<br />

of Proposition (4).) Suppose now that m > 1 <strong>and</strong> that the lemma holds for<br />

1, 2,...,m − 1. Then<br />

pn(λ1,...,λm) = p0n(λ2,...,λm)+p1n(λ2,...,λm)λ1+···+pdn(λ2,...,λm)λ d 1 ,<br />

where<br />

pin(λ2,...,λm)<br />

is a homogeneous polynomial of degree d − i in the variables λ2,...,λm. Given<br />

λ2,...,λm ≥ 0, we have pn(λ1,λ2,...,λm) → p(λ1,λ2,...,λm) for any λ1 ≥ 0<br />

by assumption. An application of (4) then shows that, for the coefficients pin, i =<br />

0,...,d, (which are homogeneous polynomials in λ2,...,λm of degree d − i),<br />

pin(λ2,...,λm) converges as n →∞for λ2,...,λm ≥ 0 <strong>and</strong> i = 0,...,d.<br />

Denote the limit by qi(λ2,...,λm). The induction hypothesis, applied for i =<br />

0,...,d, shows that<br />

pin(λ2,...,λm) → qi(λ2,...,λm) for λ2,...,λm ≥ 0 <strong>and</strong> i = 0,...,d,<br />

where qi(λ2,...,λm) is the restriction to λ2,...,λm ≥ 0 of a suitable homogeneous<br />

polynomial in λ2,...,λm of degree d − i. Then, clearly,<br />

pn(λ1,...,λd) =<br />

d�<br />

pin(λ2,...,λm)λ i 1 →<br />

i=0<br />

d�<br />

i=0<br />

qi(λ2,...,λm)λ i 1<br />

= q(λ1,...,λm) for λ1 ≥ 0 <strong>and</strong> λ2,...,λm ≥ 0,<br />

say, where q is a homogeneous polynomial of degree d in λ1,...,λm. Comparing<br />

this with (3), we see that p(λ1,...,λm) = q(λ1,...,λm) for λ1,...,λm ≥ 0,<br />

concluding the induction <strong>and</strong> thus the proof of the lemma. ⊓⊔

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

Saved successfully!

Ooh no, something went wrong!