one_sub_exp_neg_ge
theoremverifiedimported Lean
Lower bound on $1 - e^{-\eta}$. For every real number $\eta > 0$, the quantity $1 - e^{-\eta}$ is bounded below by its second-order Taylor expansion at the origin: \[ 1 - e^{-\eta} \;\ge\; \eta - \frac{\eta^{2}}{2}. \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open Real Finset BigOperators in lemma one_sub_exp_neg_ge {η : ℝ} (hη : 0 < η) : 1 - Real.exp (-η) ≥ η - η ^ 2 / 2
- Source
- TCSlib, `one_sub_exp_neg_ge`
- Lean proof
- By Karim Abdel Sadek, Mark Bedaywi, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Karim Abdel Sadek and Mark Bedaywi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.one_sub_exp_neg_ge← one_sub_exp_neg_ge (TCSlib/LearningTheory/Hedge/Basic.lean:356): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- exp_neg_le_quadraticQuadratic upper bound on $e^{-t}$. For every real number $t \ge 0$, the value $e^{-t}$ is at most the second-order Taylor polynomial…
- Used by 1
- hedge_regret_boundRegret bound for the Hedge algorithm. Fix $N \ge 1$ experts and $T$ rounds, and let $\ell$ be a valid loss sequence, so that…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false inopen Real Finset BigOperators in/-- For `η > 0`, `1 - exp(-η) ≥ η - η²/2`: the rearranged form of `exp_neg_le_quadratic`. This is the relaxation of the chord coefficient `1 - e^{-η}` that turns the per-step bound `log_potential_step` into `-η · hedgeLoss + η²/2` in the weak regret bound. -/lemma one_sub_exp_neg_ge {η : ℝ} (hη : 0 < η) : 1 - Real.exp (-η) ≥ η - η ^ 2 / 2 := by -- Rearranged form of the previous quadratic upper bound on `exp (-η)`. have h := exp_neg_le_quadratic hη.le linarith