Is this a theorem?

Algebra Level 4

If x 1 , x 2 , x 3 , , x n x_1 , x_2 , x_3 , \ldots , x_n are any real number and n is any positiv integer, then

A. n i = 1 n x i 2 < ( i = 1 n x i ) 2 n \displaystyle\sum_{i = 1}^{n} x_i^2 < \left( \displaystyle\sum_{i=1}^n x_i\right)^2
B. i = 1 n x i 2 ( i = 1 n x i ) 2 \displaystyle\sum_{i = 1}^{n} x_i^2 \geq \left( \displaystyle\sum_{i=1}^n x_i\right)^2
C. i = 1 n x i 2 n ( i = 1 n x i ) 2 \displaystyle\sum_{i = 1}^{n} x_i^2 \geq n\left( \displaystyle\sum_{i=1}^n x_i\right)^2
D. i = 1 n x i ( i = 1 n x i ) 2 \displaystyle\sum_{i = 1}^{n} x_i \leq\left( \displaystyle\sum_{i=1}^n x_i\right)^2
E. None of these

B A D C E

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Yugesh Kothari
Nov 3, 2015

The answer follows simply from Cauchy Schwarz Inequality. Take the first series as x(i) and the second as 1(s). You can then easily cross check that none of the options match the condition.

Tom Engelsman
Nov 1, 2015

In each choice I'll focus on just the simple case of n = 2. Of course, induction can be used for n > 2:

CASE (A): 2 * (x1^2 + x2^2) < x1^2 + 2*x1x2 + x2^2;

or x1^2 - 2*x1x2 + x2^2 < 0;

or (x1 - x2)^2 < 0 (contradiction!)

CASE (B): x1^2 + x2^2 >= x1^2 + 2*x1x2 + x2^2;

or 0 >= 2*x1x2, which only holds true when x1 and x2 are neither both positive or both negative, but not for any real x.

CASE (C): x1^2 + x2^2 >= 2 (x1^2 + 2 x1x2 + x2^2);

or 0 >= (x1^2 + 2 x1x2 + x2^2) + 2 x1x2;

or 0 >= (x1 + x2)^2 + 2 x1x2, which only holds true if (-2-sqrt(3)) x2 <= x1 <= (-2+sqrt(3))*x2, but not for any real x1.

CASE (D): Let the Sigma sums be represented as y, which gives:

y <= y^2,

or 0 <= y^2 - y;

or y <= 0 and y >= 1. Otherwise, we get a contradiction when 0 < y < 1.

CONCLUSION: None of these four Cases is valid for any real x

Your argument for case B is flawed since there's no reason why one of x1,x2 can't be negative and the other positive. For instance for n=2, x1=-1 and x2=2 the inequality holds and we get 5>=1. However it is still true that case B does not hold for all x. By C-S inequality there should be an n on the LHS of the inequality. If we choose for instance x1=x2=1/2 and n=2 we get 1/2>=1 which is false. Otherwise nice solution and great work in finding contradictions for all the cases!

Jonathan Hocker - 5 years, 7 months ago

Log in to reply

Thanks, Jonathan. Case (B) was pretty much the only one I struggled with articulating my proof. I did validate it only after trying a few test pairs for x1 and x2.

tom engelsman - 5 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...