数竞不等式theuvwmethod紫外法作者mathiasbktejsknudsen.pdfVIP

The uvw method - Tejs 1 BASIC CONCEPTS 1 Basic Concepts The basic concept of the method is this: With an inequality in the numbers a, b, c R, we write everything in terms of 3u = ∈ 2 3 a + b + c, 3v = ab + bc + ca, w = abc. The condition a, b, c 0 is given in many inequalities. ≥ 2 3 2 3 In this case, we see that u, v , w ≥0. But if this is not the case, u, v , w might be negative. 2 2 E.g. a = 1, b = 2, c = 3 we get 3v = 7. So don’t be confused! Sometimes v can be − − − negative! The Idiot-Theorem: u ≥v ≥w, when a, b, c ≥0. P Proof: 9u2 2 2 2 2 1 2 −9v = a + b + c −ab −bc −ca = 2 cyc (a −b) ≥0. And hence u ≥v. √ 2 ab+bc+ca 3 2 2 2 2 From the AM-GM inequality we see that v = 3 ≥ a b c = w , and hence v ≥w, which concludes u v w. ≥ ≥ The idiot-theorem is usually of little use alone, but it is important to know. Sometimes we introduce the ratio t = u2 2 : v . If u 0, v = 0 we def = ∞, and if u 0, v = 0 we def = . If u = v = 0 we set t = 1. When a, b, c 0, we see that −∞ ≥ t 1. And we always see that t 1. ≥