13.11.2014 Views

proofs

proofs

proofs

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.

144 A theorem of Pólya on polynomials<br />

Equating the real parts in (4) and (5) we obtain by i 4l+2 = −1, i 4l = 1 and<br />

sin 2 θ = 1 − cos 2 θ<br />

cosnϑ = ∑ ( n<br />

(cosϑ)<br />

4l)<br />

n−4l (1 − cos 2 ϑ) 2l<br />

l≥0<br />

− ∑ l≥0<br />

( ) n<br />

(cos ϑ) n−4l−2 (1 − cos 2 ϑ) 2l+1 .<br />

4l + 2<br />

(6)<br />

P ` n<br />

k≥0 2k´<br />

= 2 n−1 holds for n > 0:<br />

Every subset of {1, 2, . . . , n−1} yields<br />

an even sized subset of {1, 2, . . . , n} if<br />

we add the element n “if needed.”<br />

We conclude that cosnϑ is a polynomial in cosϑ,<br />

cosnϑ = c n (cos ϑ) n + c n−1 (cosϑ) n−1 + . . . + c 0 . (7)<br />

From (6) we obtain for the highest coefficient<br />

c n = ∑ ( n<br />

+<br />

4l)<br />

∑ ( ) n<br />

4l + 2<br />

l≥0 l≥0<br />

= 2 n−1 .<br />

Now we turn our argument around. Assuming by induction that for k < n,<br />

(cosϑ) k can be expressed as a cosine polynomial of order k, we infer from<br />

(7) that (cosϑ) n can be written as a cosine polynomial of order n with<br />

leading coefficient b n = 1<br />

2 n−1 .<br />

Proof of (B). Let h(ϑ) be a cosine polynomial of order n as in (3), and<br />

assume without loss of generality λ n > 0. Now we set m(ϑ) := λ n cosnϑ<br />

and find<br />

m( k n π) = (−1)k λ n for k = 0, 1, . . ., n.<br />

Suppose, for a proof by contradiction, that max |h(ϑ)| < λ n . Then<br />

m( k n π) − h( k n π) = (−1)k λ n − h( k n π)<br />

is positive for even k and negative for odd k in the range 0 ≤ k ≤ n. We<br />

conclude that m(ϑ) − h(ϑ) has at least n roots in the interval [0, π]. But<br />

this cannot be since m(ϑ) − h(ϑ) is a cosine polynomial of order n − 1,<br />

and thus has at most n − 1 roots.<br />

The proof of (B) and thus of Chebyshev’s theorem is complete. □<br />

The reader can now easily complete the analysis, showing that g n (ϑ) :=<br />

1<br />

2<br />

cosnϑ is the only cosine polynomial of order n with leading coefficient<br />

1 that achieves the equality max |g(ϑ)| = 1<br />

2<br />

n−1 . n−1<br />

The polynomials T n (x) = cosnϑ, x = cosϑ, are called the Chebyshev<br />

1<br />

polynomials (of the first kind); thus<br />

2<br />

T n−1 n (x) is the unique monic polynomial<br />

of degree n where equality holds in Chebyshev’s theorem.<br />

References<br />

[1] P. L. CEBYCEV: Œuvres, Vol. I, Acad. Imperiale des Sciences, St. Petersburg<br />

1899, pp. 387-469.<br />

[2] G. PÓLYA: Beitrag zur Verallgemeinerung des Verzerrungssatzes auf mehrfach<br />

zusammenhängenden Gebieten, Sitzungsber. Preuss. Akad. Wiss. Berlin<br />

(1928), 228-232; Collected Papers Vol. I, MIT Press 1974, 347-351.<br />

[3] G. PÓLYA & G. SZEGŐ: Problems and Theorems in Analysis, Vol. II, Springer-<br />

Verlag, Berlin Heidelberg New York 1976; Reprint 1998.

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

Saved successfully!

Ooh no, something went wrong!