Scribd
Upload
76 views2 pages

Mag 2008

The document proposes a mathematical inequality and provides a proof of it. Specifically, it proves that for any set of positive real numbers a1, a2, ..., an, the following inequality holds: a21 a21 a2n−1 a2n a1 + a2 + ··· + an + + ··· + + ≥ . a1 + a2 a1 + a2 an−1 + an an + a1 2 The proof uses properties of sums and squares to show that equality only occurs when all the numbers are equal.

Uploaded by

محمد حسن أبو حذيفة
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views2 pages

Mag 2008

The document proposes a mathematical inequality and provides a proof of it. Specifically, it proves that for any set of positive real numbers a1, a2, ..., an, the following inequality holds: a21 a21 a2n−1 a2n a1 + a2 + ··· + an + + ··· + + ≥ . a1 + a2 a1 + a2 an−1 + an an + a1 2 The proof uses properties of sums and squares to show that equality only occurs when all the numbers are equal.

Uploaded by

محمد حسن أبو حذيفة
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Problem 1802. Proposed by Dorin Marghidanu, Colegiul National A. I. Cuza, Corabia, Romania.

Let
a1 , a2 , . . . , an be positive real numbers. Prove that

a21 a21 a2n1 a2n a1 + a2 + + an


+ + + + .
a1 + a2 a1 + a2 an1 + an an + a1 2

Solution, by Omran Kouba (Higher Institute for Applied Sciences and Technology, Damascus, Syria).

Let an+1 = a1 . Clearly we have,


n (
)2 1
n n n
ak ak + ak+1 a2k
= ak + (ak + ak+1 )
ak + ak+1 2 ak + ak+1 4
k=1 k=1 k=1 k=1
n
a2k 1
n
= ak .
ak + ak+1 2
k=1 k=1

This proves the desired inequality, and shows that equality occures if and only if a1 = a2 = = an .

Omran KOUBA
H.I.A.S.T
P.O.B. 31983
Damascus, Syria.
e-mail : omran [email protected]
or : [email protected]

1
Problem 1803. Proposed by Michael W. Botsko, Saint Vincent College, Latrobe, PA. Let (X, , ) be a
real inner product space, and let
B = {x X : ||x|| 1}

be the unit ball in X, where ||x|| = x, x. Let f : B B be a function satisfying ||f (x) f (y)|| ||x y||
for all x, y B. Prove that the set of xed points of f is convex.

Solution, by Omran Kouba (Higher Institute for Applied Sciences and Technology, Damascus, Syria).

Let F = {x B : f (x) = x} be the set of xed points of f . The set F is closed since f is continuous. So to
2 F for all x, y F .
prove that F is convex, it is enough to show that x+y

x+y
Now, let us consider x and y from F , and let z denote 2 . Clearly,

1
||f (z) x|| = ||f (z) f (x)|| ||z x|| = ||y x||,
2
and
1
||f (z) y|| = ||f (z) f (y)|| ||z y|| = ||y x||.
2
Now, using the parallelogram identity, we have
2
x + y 1 1

4 f (z)
2 2 2 2
+ ||x y|| = 2||f (z) x|| + 2||f (z) y|| ||y x|| + ||y x||
2
2 2 2

2
that is 4||f (z) z|| 0. We conclude that f (z) = z, i.e. z F . This ends the proof.

Remarks.
1. The conclusion holds also in complex inner product spaces with the same proof.
2. The set of xed points of f might be empty. For example, Let X denote the space R[T ] of real polynomials
1
in the unknown T , equipped with the inner product , dend by P, Q = 0 P (t)Q(t)dt, and let f (P ) =
2 (1 + T P (T )). Clearly, if P B then
1

1 1
||f (P )|| (1 + ||T P (T )||) (1 + ||P ||) 1,
2 2
this proves that f denes a function from B to B. On the other hand, if P and Q are two polynomials from
B then
1 1
||f (P ) f (Q)|| = ||T (P (T ) Q(T ))|| ||P Q|| ||P Q||.
2 2
Now, if there exists a xed point R of f , then the substitution T = 2 in the equality R(T ) = 12 + 21 T R(T )
leads to the contradiction 12 = 0.
3. Of course, if X is a Hilbert space then the set of xed points of f is not empty, by the well-known theorem
of Browder.

Omran KOUBA
H.I.A.S.T
P.O.B. 31983
Damascus, Syria.
e-mail : omran [email protected]
or : [email protected]

You might also like