You are on page 1of 2

Problem

If a and b are nonnegative real numbers such that a + b = 1 , then


a 2b + b 2 a 1 .
Proof. Assume that

0b

1
a 1.
2

Applying Lemma 1 for c = 2b , 0 c 1 , we get


a 2b (1 2b) 2 + 4ab(1 b) 2ab(1 2b) ln a ,

or
a 2b 1 4ab 2 2ab(a b) ln a .

(1)

Similarly, applying Lemma 2 for d = 2a 1 , d 0 , we get


b 2 a 1 4a (1 a ) + 2a (2a 1) ln(2a + b 1) ,

or
b 2 a 4ab 2 + 2ab(a b) ln a .

(2)

1
From (1) and (2), the conclusion follows. Equality holds for a = b = , for a = 0 and
2
b = 1 , and for a = 1 and b = 0 .

Lemma 1. If 0 < a 1 and 0 c 1 , then


a c (1 c) 2 + ac(2 c) ac(1 c) ln a ,

with equality for a = 1 , for c = 0 , and for c = 1 .


Proof. Using the substitution a = e x , x 0 , we need to prove that f ( x) 0 , where
f ( x) = (1 c) 2 e x + c(2 c) + c(1 c) x e (1c ) x ,

with
f ( x) = (1 c)[(1 c)e x + c e (1c ) x ] .

By the weighted AM-GM inequality, it follows that f ( x) 0 . Therefore, f (x) is


increasing, and hence f ( x) f (0) = 0 .
Lemma 2. If 0 b 1 and d 0 , then
b d 1 d 2 + d (1 + d ) ln(b + d ) ,

with equality for d = 0 , and for b = 0 , d = 1 .


Proof. Excepting the equality cases d = 0 and b = 0 , d = 1 , since

1 d + d ln(b + d ) 1 d + d ln d > 0 ,
we can write the desired inequality in the form

ln(1 + d ) + ln[1 d + d ln(b + d )] d ln b .


Using the substitution b = e x d , ln(1 + d ) x ln d , we need to prove that

f ( x) 0 , where
f ( x) = ln(1 + d ) + ln(1 d dx) + dx d ln(1 de x ) .

Since
f ( x) =

d 2 (e x 1 x )
(1 d dx)(1 de x )

0,

f (x) is increasing, and hence


f ( x) f ( ln(1 + d )) = ln[1 d 2 + d (1 + d ) ln(1 + d )] .

To end the proof, we need to show that d 2 + d (1 + d ) ln(1 + d ) 0 ; that is,


(1 + d ) ln(1 + d ) d .
This inequality follows from e x 1 + x for x =

d
.
1+ d

You might also like