Skill stop · How is this move done?

Cauchy and Fractional Inequalities

In the Chinese book: 柯西不等式与分式不等式

Make each numerator a square, then merge once. What you multiply by decides it.

📖 §4.3 of 《平均值不等式与柯西不等式》

Before this stop, visit:Cauchy for Systems and Extrema (Skill)

WorkbenchStart with the first rewrite and drag . Does the bound stay safely to the right of ? Then switch to the other rewrites and compare.

Loading figure…

What this move does

The fraction form of the Cauchy inequality, (), is made for “a row of fractions added together”. When a numerator is not a square, first make it one:

  1. Multiply the top and bottom of each term by a positive expression so that every term has the form . Choose the multiplier so that the merged numerator and denominator are easy to handle (ideally symmetric expressions or known quantities).
  2. Merge once: .
  3. What remains is a polynomial inequality. Check that it holds, and that its equality case agrees with the equality condition of step 2.

Step 1 is the crux. The same fraction can be “squared up” in many ways, and each gives a different lower bound after merging: some stay above the target everywhere, others drop below it.

Predict first

We want to prove (). If we write each term as and merge, does the proof go through?

Choose an answer first; then you can see the result.

Work through one

This is the famous Nesbitt inequality (1903).

Example: a, b, c > 0; prove a/(b+c) + b/(c+a) + c/(a+b) ≥ 3/2

Step 1 / 5
Loading figure…
  1. The laziest rewrite fails

    The numerator is ; merge directly. At the lower bound is about , already below .

When it fails

Break it

Counterexample lab: remove one condition

Conclusion: the merged lower bound is at least for all positive

This route works everywhere: the reading “Lowest bound over all a, b, c” is exactly , reached at .

Loading figure…

Practice

Exercise 1Basic

Positive numbers satisfy . Find the minimum of .

Exercise 2Basic

Positive numbers satisfy . Find the minimum of .

Exercise 3Advanced

Let . Prove that .

Exercise 4Challenge

(IMO 1995) Positive numbers satisfy . Prove that .

Mistake Museum · Exhibits from this stop

Before you leave, look at the traps other people fell into here.See every exhibit in the museum →

Exhibit

The merged lower bound is smaller than the target

The wrong step: To prove : .
What went wrong? Think first, then open

Diagnosis The first step is right, the second is wrong: by Cauchy, , so this lower bound is at most and only reaches it when . The merge threw away too much.

The right step: Use instead. Merging gives , and always holds.

“Before merging, ask whether the step that remains will still be true”