A GENERALIZATION OF THE INEQUALITY OF HLDER

Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA E-mail: smarand@unm.edu

One generalizes the inequality of Hdler thanks to a reasoning by recurrence. As particular cases, one obtains a generalization of the inequality of Cauchy-BuniakovskiScwartz, and some interesting applications. Theorem: If ai( k ) R + and pk ]1, +[ , i {1, 2,..., n} , k {1, 2,..., m} , such 1 1 1 that:, + + ... + = 1 , then: p1 p2 pm

a
i =1 k =1

(k ) i

k =1

n (k ) a i =1 i

( )

pk

pk with m 2 .

Proof: For m = 2 one obtains exactly the inequality of Hdler, which is true. One supposes that the inequality is true for the values which are strictly smaller than a certain m . Then:, 1 1 p m2 n pk p m m2 n n n k p (k ) ( m 1) ( m) (k ) ( m 1) (m) k ai ai ai ai ai ai ai = i =1 k =1 i =1 k =1 k =1 i =1 i =1

( )

where but

1 1 1 1 + + ... + + = 1 and ph > 1 , 1 h m 2 , p > 1 ; pm 2 p p1 p2

(a
n i =1

( m 1) i

) (a )
p (m) i

n ai( m 1) i =1

((

p t1

n (m) ai i =1

1 t 1

((

p t2

where

1 1 + = 1 and t1 > 1 , t 2 > 2 . t1 t 2 It results from it:

(a
n i =1

( m 1) i

) (a )
p (m) i

n ai( m 1) i =1

pt1

1 pt 1

n ai( m ) i =1

pt2

1 pt 2

with

1 1 1 + = . pt1 pt 2 p

1 1 1 + + ... + = 1 is true and one p1 p2 pm has p j > 1 for 1 j m and it results the inequality from the theorem. Let us note pt1 = pm 1 and pt 2 = pm . Then
Note: If one poses p j = m for 1 j m and if one raises to the power m this

inequality, one obtains a generalization of the inequality of Cauchy-BuniakovskiScwartz:

n m n m (k ) ai ai( k ) i =1 k =1 k =1 i =1 m

( ).
m

Application: Let a1 , a2 , b1 , b2 , c1 , c2 be positive real numbers. Show that: 6 6 6 (a1b1c1 + a2 b2 c2 )6 8(a16 + a2 )(b16 + b2 )(c16 + c2 ) Solution: We will use the previous theorem. Let us choose p1 = 2 , p2 = 3 , p3 = 6 ; we will obtain the following:
2 2 3 3 6 6 a1b1c1 + a2b2 c2 (a12 + a2 ) (b13 + b2 ) (c16 + c2 ) , or more: 2 3 3 2 6 (a1b1c1 + a2 b2 c2 )6 (a12 + a2 ) (b13 + b2 ) (c16 + c2 ), and knowing that 3 2 6 (b13 + b2 ) 2(b16 + b2 ) and that 2 3 6 2 4 6 (a12 + a2 ) = a16 + a2 + 3(a14 a2 + a12 a2 ) 4(a16 + a2 ) since 2 4 6 2 a14 a2 + a12 a2 a16 + a2 (because: a2 a12 1 1 1

) (a
2

2 1

2 + a2 0)

it results the exercise which was proposed.