Inequalities

Level FundamentalDifficulty ★★★★★Concept⌖ Open in the map

What is it?

Calculus is mostly the art of bounding: proving that an error is smaller than ε\varepsilon, that a term is negligible, that an algorithm takes at most so many steps. The tools are the triangle inequality, AM–GM, Cauchy–Schwarz and Jensen.

Formulas

a+b2≥ab(a,b≥0)\frac{a + b}{2} \ge \sqrt{ab} \quad (a, b \ge 0)
AM–GM
∣x⋅y∣≤∥x∥ ∥y∥|x \cdot y| \le \norm{x}\,\norm{y}
Cauchy–Schwarz

Where it shows up in computing

  • Algorithm analysis and complexity★★★★★frequentScientific computing and algorithms

    Upper and lower bounds on running time are proved by chains of inequalities.

Where is it used?

Computing topics reachable from here, through the chain of ideas that leads to them:

What depends on it

This page has the essentials. A fuller treatment (intuition, formal definition, worked example) is on the way.

↑ ↓ to navigate · ↵ · Esc