Cauchy-Schwarz is the habit of bounding sums and products with vector-like structure, especially in quadratic expressions. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
The square of a dot product never exceeds the product of the squared lengths, which bounds sums of products and powers many contest inequalities.
Why It Works
1
For real $t$, the quantity $\sum_i (a_i t - b_i)^2 \ge 0$ because it is a sum of squares.
2
Expand it as a quadratic in $t$: $\left(\sum a_i^2\right)t^2 - 2\left(\sum a_i b_i\right)t + \left(\sum b_i^2\right) \ge 0$ for every $t$.
3
A quadratic $At^2 + Bt + C$ that is nonnegative for all $t$ must have discriminant $B^2 - 4AC \le 0$.
4
So $\left(2\sum a_i b_i\right)^2 - 4\left(\sum a_i^2\right)\left(\sum b_i^2\right) \le 0$, which rearranges to the inequality. Equality holds when the $a_i$ and $b_i$ are proportional.
Worked Examples
Example 1
For positive reals with $a + b + c = 1$, find the minimum of $\dfrac{1}{a} + \dfrac{1}{b} + \dfrac{1}{c}$.
1
Apply Cauchy-Schwarz in Engel form (Titu): $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = \frac{1^2}{a} + \frac{1^2}{b} + \frac{1^2}{c} \ge \frac{(1 + 1 + 1)^2}{a + b + c}$.
2
Substitute $a + b + c = 1$: the bound is $\frac{9}{1} = 9$.
3
Equality holds when $a = b = c = \frac{1}{3}$, where the sum is indeed $3 + 3 + 3 = 9$.
Answer:
Minimum value $9$, at $a = b = c = \tfrac{1}{3}$.
Warm-up
Prove that $(a + b)^2 \le 2(a^2 + b^2)$ for all real $a, b$.
1
Apply Cauchy-Schwarz to the vectors $(1, 1)$ and $(a, b)$: $(1\cdot a + 1\cdot b)^2 \le (1^2 + 1^2)(a^2 + b^2)$.
2
The left side is $(a + b)^2$ and the right side is $2(a^2 + b^2)$.
3
Hence $(a + b)^2 \le 2(a^2 + b^2)$, with equality when $(a, b)$ is proportional to $(1, 1)$, i.e. $a = b$.
Equality needs $(a, b, c) \parallel (1, 2, 2)$; with the constraint that is $a = \tfrac13, b = c = \tfrac23$, where $a + 2b + 2c = \tfrac13 + \tfrac43 + \tfrac43 = 3$.
Answer:
Maximum $3$, at $(a, b, c) = (\tfrac13, \tfrac23, \tfrac23)$.
Olympiad / Challenge
For positive reals with $a + b + c = 1$, prove $\dfrac{a^2}{a + b} + \dfrac{b^2}{b + c} + \dfrac{c^2}{c + a} \ge \dfrac{1}{2}$.
1
Apply Cauchy-Schwarz in Engel (Titu) form $\sum \dfrac{x_i^2}{y_i} \ge \dfrac{(\sum x_i)^2}{\sum y_i}$ with $x_i = a, b, c$ and $y_i = a+b,\ b+c,\ c+a$.
2
This gives $\sum \dfrac{a^2}{a+b} \ge \dfrac{(a + b + c)^2}{(a+b) + (b+c) + (c+a)} = \dfrac{(a + b + c)^2}{2(a + b + c)} = \dfrac{a + b + c}{2}$.
3
Substitute $a + b + c = 1$: the bound is $\dfrac{1}{2}$. Equality in Titu needs $\dfrac{a}{a+b} = \dfrac{b}{b+c} = \dfrac{c}{c+a}$, which holds at $a = b = c = \tfrac13$.
Answer:
$\dfrac{a^2}{a+b} + \dfrac{b^2}{b+c} + \dfrac{c^2}{c+a} \ge \dfrac{1}{2}$, equality iff $a = b = c = \tfrac13$.
Going Deeper
Generalization: Cauchy-Schwarz is the case $p = q = 2$ of Hölder's inequality $\sum a_i b_i \le \left(\sum a_i^p\right)^{1/p}\left(\sum b_i^q\right)^{1/q}$ with $\frac1p + \frac1q = 1$. The Engel/Titu form $\sum \frac{x_i^2}{y_i} \ge \frac{(\sum x_i)^2}{\sum y_i}$ is the everyday workhorse.
Where it appears: AIME max/min of a linear form on a sphere, and a huge fraction of olympiad inequalities — Titu instantly handles sums of squares-over-linears, and the proportionality equality case pinpoints the optimum.
Pitfall: get the equality condition right — it is PROPORTIONALITY $\frac{a_i}{b_i} = \text{const}$, not $a_i = b_i$. And Titu's form requires the denominators $y_i$ to be POSITIVE; applying it with a denominator that can be zero or negative is invalid.
Spot the Signal
Look for problems where the key step is bounding sums and products with vector-like structure, especially in quadratic expressions.
You can describe the hard part as bounding sums and products with vector-like structure, especially in quadratic expressions, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by identify the expression or equation that calls for cauchy-schwarz, then rewrite the givens around it.
Name the relation that makes Cauchy-Schwarz legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Do not use Cauchy-Schwarz just because the surface looks familiar; verify the required condition first.
Applying Cauchy-Schwarz because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
Let cauchy-schwarz reveal the algebraic structure; then compute only what remains.
Try it on:
Practice a contest problem where the key step is bounding sums and products with vector-like structure, especially in quadratic expressions.