Bernoulli's inequality
ProvedFamousTheorems.bernoulli_inequalityBernoulli's inequality. For every real and every natural number ,
The classical statement assumes ; the inequality in fact holds for . It is one of the most basic inequalities in analysis. It gives the divergence of for , elementary bounds on , and many estimates in limits and convergence proofs.
Formalization note. Mathlib's one_add_mul_le_pow, which holds in every linearly ordered ring and is stated here for ℝ. The exponent is a natural number, and (n : ℝ) is its cast.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem bernoulli_inequality {a : ℝ} (H : -2 ≤ a) (n : ℕ) : 1 + (n : ℝ) * a ≤ (1 + a) ^ n := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `one_add_mul_le_pow`. Proof here reduces to that Mathlib result.