10.07.2015 Views

Reverse Triangle Inequalities for Riesz Potentials and Connections ...

Reverse Triangle Inequalities for Riesz Potentials and Connections ...

Reverse Triangle Inequalities for Riesz Potentials and Connections ...

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.

The motivation <strong>for</strong> such inequalities comes from inequalities <strong>for</strong> the norms of productsof polynomials. Let P (z) = ∏ nj=1 (z − a j) be a monic polynomial. Then log |P (z)| =n ∫ ∑log |z − t|dτ(t), where τ = 1 nn j=1 δ a jis the normalized counting measure of the zeros ofP , with δ aj being the unit point mass at a j . Let ||P || E be the uni<strong>for</strong>m (sup) norm on E.Then <strong>for</strong> polynomials P j , j = 1, . . . , m, inequality (2) can be rewritten as∣∣ m∏∣∣∣∣ ∣∣∣∣ ∏ m||P j || E ≤ M nj=1j=1P j∣ ∣∣∣∣∣ ∣∣∣∣E(3)where M = e C <strong>and</strong> n is the degree of ∏ mj=1 P j.Kneser [13] found the first sharp constant M <strong>for</strong> inequality (3). Let E = [−1, 1] <strong>and</strong>consider only two factors so that m = 2. Then (3) holds with the multiplicative constantM = 2 n−1ndeg P∏ 1k=1(1 + cos 2k − 12n π ) 1deg P 2n ∏k=1(1 + cos 2k − 1 ) 12n π n. (4)The Chebyshev polynomial shows that this constant is sharp. A weaker result was previouslygiven by Aumann [2]. Borwein [6] provided an alternative proof <strong>for</strong> this constant (4). Heshowed further that on E = [−1, 1], inequality (3) holds <strong>for</strong> any number of factors m withmultiplicative constantM = 2 n−1n[ n 2∏]k=1(1 + cos 2k − 1 ) 22n π n. (5)Another series of such constants were found <strong>for</strong> E = D, the closed unit disk. Mahler[16], building on a weaker result by Gelfond [11, p. 135], showed that (3) holds <strong>for</strong>M = 2. (6)While the base 2 cannot be decreased, Kroó <strong>and</strong> Pritsker [14] showed that <strong>for</strong> m ≤ n, we canuse M = 2 n−1n . Furthermore, Boyd [8, 7] expressed the multiplicative constant as a functionof the number of factors m, <strong>and</strong> found( ∫m π/m(M = exp log 2 cos t π2) ) .0This constant is asymptotically best possible <strong>for</strong> each fixed m as n → ∞.For general sets E, the constant M E depends on the geometry of the set. Let E be acompact set of positive capacity. Pritsker [18] showed that a sharp multiplicative constantin (3) is given byM E = exp (∫ log d E (z)dµ E (z) ),cap(E)where µ E is the equilibrium measure of E <strong>and</strong> d E is the farthest distance function defined byd E (x) := sup t∈E |x − t|, x ∈ C. Note that this constant generalizes several previous results.2

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

Saved successfully!

Ooh no, something went wrong!