Intereting Posts

Probability that two sets are disjoint? the same?
Orthonormal vectors in Polar coordinates, show $\hat{e}_R=\frac{(x,y,z)}{r}$
The equation $x^y = y^x$.
The only two rational values for cosine and their connection to the Kummer Rings
How to solve this derivative of f proof?
A topological space which is Frechet but not Strictly-Frechet.
Is there a change of variables formula for a measure theoretic integral that does not use the Lebesgue measure
sum of binomial coefficients involving $n,p,q,r$
Group with order $p^2$ must be abelian . How to prove that?
Torsion in homology groups of a topological space
The magnitude of the difference between the integral and the Riemann sums for continuous functions
HINT for summing digits of a large power
Bounding the product of a quadrilateral's side lengths in terms of the lengths of its diagonals
Categorification of $\pi$?
How often are Galois groups equal to $S_n$?

My aim is to prove that $e^{-x} \geq 1-x$ for any $x \geq 0$. What I found so far is Bernoulli’s inequality, which states that

$$1+x\leq\left(1+\frac{x}{n}\right)^n\xrightarrow [n\to\infty]{} e^x$$

Is there a way to utilize this proven fact in order to prove my problem?

- Why Not Define $0/0$ To Be $0$?
- Using Nakayama's Lemma to prove isomorphism theorem for finitely generated free modules
- The equation $x^3 + y^3 = z^3$ has no integer solutions - A short proof
- Find the Roots of $(x+1)(x+3)(x+5)(x+7) + 15 = 0$
- Hamel Basis in Infinite dimensional Banach Space without Baire Category Theorem
- How do you prove this very different method for evaluating $\sum_{k=1}^nk^p$

- Proof of a theorem of Cauchy's on the convergence of an infinite product
- A limit related to super-root (tetration inverse).
- Converging series in Banach space
- Slowing down divergence 2
- If $X_n \stackrel{d}{\to} X$ and $c_n \to c$, then $c_n \cdot X_n \stackrel{d}{\to} c \cdot X$
- Another point of view that $\mathbb{Z}/m\mathbb{Z} \times\mathbb{Z}/n\mathbb{Z}$ is cyclic.
- Prove or disprove: $\sum a_n$ convergent, where $a_n=2\sqrt{n}-\sqrt{n-1}-\sqrt{n+1}$.
- Finding $\int \frac{dx}{a+b \cos x}$ without Weierstrass substitution.
- Prove that sum is finite
- ${a_n}$ series of Fibonacci numbers. $f(x)=\sum_{0}^{\infty}a_nx^n$, show that in the convergence radius: $f(x)= \frac{1}{1-x-x^2}$

Recall the Mean Value Theorem that says that for a continuous function on $[a,b]$, and a differentiable function on the interval $(a, b)$, there exists a $c \in (a,b)$ such that

$$\frac{f(b)-f(a)}{b-a} = f^{\prime}(c).$$

Consider working on the interval $[0, x].$ Then, in our case,

$$\frac{e^{-x} – 1}{x} = -e^{-c}$$

for some $c \in (0, x)$. It is clear to see that for any $c$ lying in that interval, $-e^{-c} \geq -1.$ Hence,

$$\frac{e^{-x}-1}{x} \geq -1.$$

The result then follows,

$$e^{-x}-1 \geq -x \implies e^{-x} \geq 1 -x$$

for any $x \geq 0.$

Consider the function and its derivatives $$f(x)=e^{-x}-1+x\qquad f'(x)=1-e^{-x}\qquad f”(x)=e^{-x}$$ The first derivative cancels for $x=0$ and $f(0)=0$. The second derivative is always positive; so $x=0$ corresponds to the minimum and f(x) is always greater or equal $0$. So, the relation holds for **any** $x$ (positive or negative; the sign does not matter).

**CLAIM**

Here, I provide a alternative proof of $$e^x \ge x+1$$ for all real $x$.

Let $f(x) = e^x-(1+x)$, then $f^\prime(x) = e^x-1$.

Hence $f^\prime(x)=0$ iff $x=0$.

Furthermore, note that $f^{\prime\prime}(x) = e^x>0$.

Thus, $f(0)=0$ must be the global minimum of $f(x)$.

Our inequality is proven.

**HOW TO APPLY**

Let $x=-t$. Then $e^{-t} \ge -t+1=1-t$ for $t$.

In fact, this goes further-it proves that it is true not only for $t \ge 0$, but for any real $t$.

Remember that $e^{-x} = 1-x+\frac{x^2}{2!}-\frac{x^3}{3!}+…$

We can rewrite $1-x = e^{-x}-\frac{x^2}{2!}+\frac{x^3}{3!}-…$

So, the inequality becomes $e^{-x} \geq e^{-x}-\frac{x^2}{2!}+\frac{x^3}{3!}-..$

Which means $0 \geq -\frac{x^2}{2!}+\frac{x^3}{3!}-…$

Which is easy to see is true

EDIT: Provided $x\in[0,1]$. If $x$ is not in this interval the original inequality is trivial to see anyways because the RHS is non-positive and $e^{-x}$ is never non-positive.

Second EDIT: If you wish to use Bernoulli’s inequality, simply replace $+x$ by $-x$ in the original expression. You get $1-x \leq (1-\frac{x}{n})^n \to e^{-x}$ as $n \to \infty$.

It suffices to prove it for $0\leq x<1$ because for $x\geq 1$ we have $e^{-x}>0\geq 1-x. $

We can use $\lim_{n\to \infty}(1+x/n)^n=e^x$ for the case $ 0\leq x<1$: We have $1-x>0$ so $$e^{-x}\geq 1-x\iff e^x\leq (1-x)^{-1}.$$ $$\text {Now }\quad (1+x/n)^n=\sum_{j=0}^n (x/n)^j \binom {n}{j}=\sum_{j=0}^n x^n\cdot n^{-j}\binom {n}{j}$$ $$\text {and }\quad n^{-j}\binom {n}{j}\leq n^{-j}\;\frac {n^j}{j!}=\frac {1}{j!} \leq 1$$ $$\text {so }\quad (1+x/n)^n\leq \sum_{j=0}^nx^j\leq \sum_{j=0}^{\infty}x^j=(1-x)^{-1}.$$ Now let $n\to \infty$ and we have $e^x\leq (1-x)^{-1}.$

Actually, the Bernoulli inequality completely proves the statement $$e^x \geq 1 +x,\ x\in\mathbb R$$

Let me write down the interesting part from the Wiki:

Let $r\geq 0$ be integer. Then $$(1+x)^r \geq 1 + rx$$ for all

$x\geq-1$. Furthermore, if $r$ is even, then the above inequality holds for all real $x$.

Now, we simply conclude that $$(1+\frac x{2n})^{2n} \geq 1 + x$$ for all real $x$, and let $n\to\infty$.

$e^{u} = \sum_{n=0}^{\infty} \frac{u^n}{n!} \geq 1 + u,$ for all $u \in \mathbb{R}.$

Choose $u = -x$ and you have the inequality.

- Convex interior topology
- $A \oplus B = A \oplus C$ imply $B = C$?
- Can $G$ of order $pqr$ be simple if it's generated by elements of orders $p,q$?
- Differentiation with respect to a matrix (residual sum of squares)?
- Product of independent random variables
- Long exact sequence into short exact sequences
- Estimating rate of blow up of an ODE
- A polynomial is zero if it zero on infinite subsets
- Riemann vs. Stieltjes Integral
- Swapping the $i$th largest card between $2$ hands of cards
- Sum numbers game
- Proof that $1/\sqrt{x}$ is itself its sine and cosine transform
- Create a Huge Problem
- How to solve fifth-degree equations by elliptic functions?
- Why is it true that $|AB:A|=|B:A\cap B|$ even if $A$ is not normal in $AB$? (Second Isomorphism Theorem)