Prove that for an arbitrary pair of vectors f and g in the space the inequality
af2+bfg+cg2≥0 holds if and only if the following conditions are fulfilled:
a≥0,c≥0,4ac≥b2.
Solution
1. Reformulation of the Problem: Let a,b,c be three real numbers. Prove that: - (a) If a≥0, c≥0, and 4ac≥b2, then for any pair of vectors f and g, we have a⋅f2+b⋅f⋅g+c⋅g2≥0. - (b) If for every pair of vectors f and g, we have a⋅f2+b⋅f⋅g+c⋅g2≥0, then a≥0, c≥0, and 4ac≥b2.
2. Proof of (a): - Given a≥0 and c≥0, their square roots a and c are real numbers. - Since 4ac≥b2, we have 4ac≥b2, which implies 2ac≥∣b∣. - This yields 2ac≥b and 2ac≥−b, or equivalently, 2ac−b≥0 and 2ac+b≥0.
3. **Case 1: f⋅g≥0:** a⋅f2+b⋅f⋅g+c⋅g2=(a⋅f2−2ac⋅f⋅g+c⋅g2)+(2ac+b)⋅f⋅g =(a⋅f−c⋅g)2+(2ac+b)⋅f⋅g≥0 Since (a⋅f−c⋅g)2≥0 and (2ac+b)⋅f⋅g≥0.
4. **Case 2: f⋅g≤0:** a⋅f2+b⋅f⋅g+c⋅g2=(a⋅f2+2ac⋅f⋅g+c⋅g2)−(2ac−b)⋅f⋅g =(a⋅f+c⋅g)2−(2ac−b)⋅f⋅g≥0 Since (a⋅f+c⋅g)2≥0 and −(2ac−b)⋅f⋅g≥0.
5. Proof of (b): - Let f=0 and g be a vector of length 1. Then: a⋅02+b⋅0⋅g+c⋅g2=c⋅12=c≥0 Similarly, by choosing g=0 and f of length 1, we get a≥0.
6. **Case when a=0:** - The inequality becomes b⋅f⋅g+c⋅g2≥0. - If b=0, for fixed g and varying f, the term b⋅f⋅g can be negative, contradicting the inequality. Hence, b=0 and 4ac≥b2 trivially holds.
7. **Case when c=0:** - Similar argument as above shows b=0 and 4ac≥b2 trivially holds.
8. **Case when a>0 and c>0:** - Let f be a vector of length 1 and g=ca⋅f. Then: a⋅f2+b⋅f⋅g+c⋅g2=(a⋅f−c⋅g)2+(2ac+b)⋅f⋅g =(2ac+b)⋅ca≥0 This implies 2ac+b≥0. Similarly, using g=−ca⋅f, we get 2ac≥b.
9. Conclusion: - Combining 2ac≥b and 2ac≥−b, we get 2ac≥∣b∣, which implies 4ac≥b2.
■
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.