If a 2 + b 2 + c 2 = 1 , find the sum of maximum and minimum values of a b + b c + c a .
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.
@Chew-Seong Cheong Brilliant sir
Consider the symmetric matrix A = ⎝ ⎛ 0 0 . 5 0 . 5 0 . 5 0 0 . 5 0 . 5 0 . 5 0 ⎠ ⎞ . The problem then reduces to finding the maxima and minima of the quadratic form x T A x , where ∣ ∣ x ∣ ∣ 2 = 1 . By the Courant-Fischer Theorem , the maximum and the minimum value of the quadratic under this constraint is given by the maximum and minimum eigenvalue of A respectively. It can be readily computed that λ max = 1 , λ min = − 0 . 5 . Hence the answer is 1 − 0 . 5 = 0 . 5 .
We have a 2 + b 2 + c 2 ≥ a b + b c + c a for all real a , b , c . The equality holds when a = b = c .
For a 2 + b 2 + c 2 = 1 , a b + b c + c a ≤ 1 , the equality holds when a = b = c = ± 3 1
We also have ( a + b + c ) 2 ≥ 0 for all real a , b , c , so that the minimum value of it is zero when a + b + c = 0
So we need to find the values of a , b , c satisfying a + b + c = 0 subject to the constraint a 2 + b 2 + c 2 = 1
The solution is a = 2 − b ± 2 − 3 b 2 , c = − 2 b ± 2 − 3 b 2 , − 3 2 ≤ b ≤ 3 2
So for all values of b within the given interval and the corresponding values of a and c , ( a + b + c ) 2 = 0 , a 2 + b 2 + c 2 = 1 , so that a 2 + b 2 + c 2 = − 2 ( a b + b c + c a )
⟹ a b + b c + c a = − 0 . 5
So the maximum value of a b + b c + c a is 1 when a = b = c = ± 3 1 , and the minimum value is − 0 . 5 when
a = 2 − b ± 2 − 3 b 2 , c = − 2 b ± 2 − 3 b 2 , − 3 2 ≤ b ≤ 3 2
Hence the required sum is 1 − 0 . 5 = 0 . 5
Sir,how we find b?!
a 2 + b 2 + c 2 − a b − b c − c a = 2 1 ( 2 a 2 + 2 b 2 + 2 c 2 − 2 a b − 2 b c − 2 c a ) = 2 1 [ ( a − b ) 2 + ( b − c ) 2 + ( c − a ) 2 ] ≥ 0
a 2 + b 2 + c 2 − a b − b c − a c ≥ 0
1 − a b − b c − a c ≥ 0
⇒ a b + b c + c a ≤ 1
m a x i m u m value of a b + b c + c a = 1
( a + b + c ) 2 ≥ 0
a 2 + b 2 + c 2 + 2 a b + 2 b c + 2 a c ≥ 0
1 + 2 a b + 2 b c + 2 c a ≥ 0
⇒ a b + b c + c a ≥ − 2 1 \
m i n i m u m value of a b + b c + c a = 2 1
So,the sum of m a x i m u m and m i n i m u m value of a b + b c + c a is 2 1
You need to show that the maximum value of 1 can be achieved ( a = b = c = 3 1 ), and that the minimum value of − 2 1 can also be achieved ( a = b = 6 1 , c = − 6 2 ). So far, you have just shown that 1 and − 2 1 are are upper and lower bounds for a b + b c + c a .
The question is demanding for the very thing which I have written.please post your solution.
Log in to reply
You have shown that − 2 1 ≤ a b + b c + c a ≤ 1 , but you have not shown that the values of − 2 1 and 1 are possible. All you need is to add the two cases I have mentioned to complete your proof.
Log in to reply
In first case it is obvious that a=b=c,but in maxima case how you came up with result ??can you explain me??
Log in to reply
@A Former Brilliant Member – The minimum occurs when a + b + c = 0 . Another case would be a = − b = 2 1 and c = 0 .
Put a = 1 , b = 0 , c − 0 ⟹ Min = 0 Why?
We can do even better by putting a = b = 6 1 ) and c = − 6 2 )
Problem Loading...
Note Loading...
Set Loading...
We note that
( a + b + c ) 2 ⟹ a b + b c + c a = a 2 + b 2 + c 2 + 2 ( a b + b c + c a ) = 2 ( a + b + c ) 2 − 1 ≤ 2 ( 1 2 + 1 2 + 1 2 ) ( a 2 + b 2 + c 2 ) − 1 = 2 ( 3 ) ( 1 ) − 1 = 1 By Cauchy-Schwarz inequality
Therefore max ( a b + b c + c a ) = 1 , when a = b = c = 3 1 .
We also note that ( a + b + c ) 2 ≥ 0 , therefore min ( ( a + b + c ) 2 ) = 0 , when ( a , b , c ) = ( ± 6 1 , ± 6 1 , ∓ 6 2 ) . Therefore,
min ( a b + b c + c a ) = 2 min ( ( a + b + c ) 2 ) − 1 = 2 0 − 1 = − 2 1
And max ( a b + b c + c a ) + min ( a b + b c + c a ) = 1 − 2 1 = 2 1 = 0 . 5 .
Reference: Cauchy-Schwarz inequality