Intereting Posts

Infinite Series $\sum\limits_{n=1}^\infty\frac{H_{2n+1}}{n^2}$
Help With Plugging in Values Distance Point to Ellipse
Why does the infinite prisoners and hats puzzle require the axiom of choice?
Why are nonsquare matrices not invertible?
formal proof from calulus
Property of abelian group
Best known upper and lower bounds for $\omega_1$
Sum of reciprocals of squares of the form $3n+1$?
A triangle-free, 6-chromatic graph with 44 vertices
Two definitions of locally compact space
Prove that every bounded sequence in $\Bbb{R}$ has a convergent subsequence
A Trigonometric Sum Related to Gauss Sums
Prove that $ \lim_{n \to \infty}\frac{n}{\sqrt n!}=e$?
Limit. $\lim_{x \to \infty}{\sin{\sqrt{x+1}}-\sin{\sqrt{x}}}.$
Distribution of sum of iid cos random variables

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?

- The limit of $f(x,y)= \dfrac {x^2 y}{x^2 + y^2}$ as $ (x,y) \to (0,0)$
- Proving $\int_{0}^{\pi/2}x\sqrt{\tan{x}}\log{\sin{x}}\,\mathrm dx=-\frac{\pi\sqrt{2}}{48}(\pi^2+12\pi \log{2}+24\log^2{2}) $
- Proof of the duality of the dominance order on partitions
- Measure theoretic proof of $|\Bbb{Z}^d/A\Bbb{Z}^d| = |\det(A)|$
- **Ended Competition:** What is the shortest proof of $\exists x \forall y (D(x) \to D(y)) $?
- Prove that a continuous function on a closed interval attains a maximum

- sequential continuity vs. continuity
- Why can you chose how to align infinitely long equations when adding them?
- A few counterexamples in the convergence of functions
- Recursive sequence convergence with trigonometric terms
- Please verify my proof of: There is no integer $\geq2$ sum of squares of whose digits equal the integer itself.
- Easy proof for sum of squares $\approx n^3/3$
- Proof for $-\sup(A) = \inf(-A)$
- Mollifiers: Asymptotic Convergence vs. Mean Convergence
- Sandwiching Limsups & liminfs of expectations
- Convergence in metric and a.e

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.

- Field extensions and monomorphisms
- Horse and snail problem.
- Indefinite integral: $\int \frac{\mathrm dx}{\sqrt x(1+\sqrtx)}$
- Eigenvalues and eigenvectors in physics?
- Isomorphism between dual space and bilinear forms
- Count subsets of an i-set in two ways
- Holomorphic extension of a function to $\mathbb{C}^n$
- Is is possible to obtain exactly 16 black cells?
- Evaluating limit $\lim_{k\to \infty}\prod_{r=1}^k\cos{\left(\frac {x}{2^r}\right)}$
- GAP semidirect product algorithm
- Line joining the orthocenter to the circumcenter of a triangle ABC is inclined to BC at an angle $\tan^{-1}(\frac{3-\tan B\tan C}{\tan B-\tan C})$
- The number $2^{29}$ has exactly $9$ distinct digits. Which digit is missing?
- Can there be a point on a Riemann surface such that every rational function is ramified at this point?
- What is the rank of the matrix consisting of all permutations of one vector?
- combinatorics circular arrangement problem