TheoremBase

The addition law comes from the Cauchy product and the binomial theorem; positivity, reciprocals and the bound exp(u)>=1+u follow from partial sums and a geometric comparison; the quadratic remainder bound gives the derivative by an epsilon-delta argument, and continuity, monotonicity, the tail at minus infinity and bijectivity (via the intermediate value theorem) follow.

Proof

Notation. For u∈Ru\in\mathbb{R} and k∈Nk\in\mathbb{N} let tk(u)=ukβˆ’1/(kβˆ’1)!t_{k}(u)=u^{k-1}/(k-1)!, with powers, factorials and kβˆ’1k-1 as in The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ; for each u∈Ru\in\mathbb{R}, (tk(u))k∈N(t_{k}(u))_{k\in\mathbb{N}} is the sequence of The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (i). By The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (ii), the series βˆ‘k=1∞tk(u)\sum_{k=1}^{\infty}t_{k}(u) converges absolutely, and in particular converges, and by The Real Exponential Function (i) and The Real Exponential Function (ii) its sum is exp⁑(u)\exp(u); so its partial sums βˆ‘k=1Ntk(u)\sum_{k=1}^{N}t_{k}(u), a sequence by Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (i), converge to exp⁑(u)\exp(u), by Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence (ii). Natural numbers with zero are read in R\mathbb{R} by The Real Line: Standing Notation and Background for Calculus on Intervals (vii); their equality, sums, differences, products and order agree with those formed in R\mathbb{R} by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (vi) (for the order, see also Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (i)), and the identities and inequalities between natural numbers below are checked in R\mathbb{R} in this way. Every m∈Nm\in\mathbb{N} satisfies 1≀m1\le m by Arithmetic and Order of the Natural Numbers (x), also in R\mathbb{R} by Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (ii); an m∈N0m\in\mathbb{N}_{0} with 1≀m1\le m lies in N\mathbb{N} by Elements of a Segment Are Natural Numbers, and Mixed Transitivity of the Order on the Natural Numbers (i); and for m∈N0m\in\mathbb{N}_{0}, in R\mathbb{R}, 1≀m!≀(m+1)!1\le m!\le(m+1)! and m!>0m!>0 by Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (iii).

The first two terms. For u∈Ru\in\mathbb{R}: t1(u)=u0/0!=1t_{1}(u)=u^{0}/0!=1 by Powers with Exponents in the Natural Numbers with Zero (ii) and The Factorial: Recursion, Positivity and Bounds by Powers (i); and as 2=1+12=1+1 by Arithmetic and Order of the Natural Numbers (xiv), 2βˆ’1=12-1=1, u1=uu^{1}=u by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii), and 1!=1β‹…0!=11!=1\cdot0!=1 by The Factorial: Recursion, Positivity and Bounds by Powers (i), so t2(u)=ut_{2}(u)=u. As [1]={1}[1]=\{1\}, Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (i) and Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vii) give

βˆ‘k=12tk(u)=t1(u)+t2(u)=1+u.(1)\sum_{k=1}^{2}t_{k}(u)=t_{1}(u)+t_{2}(u)=1+u.\tag{1}

Proof of (i). Let k∈Nk\in\mathbb{N} with kβ‰ 1k\neq1. Then kβˆ’1β‰ 0k-1\neq0, since k=1+(kβˆ’1)k=1+(k-1); so kβˆ’1∈Nk-1\in\mathbb{N}, 1≀kβˆ’11\le k-1, and 0kβˆ’1=00^{k-1}=0 by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii), whence tk(0)=0t_{k}(0)=0. As t1(0)=1t_{1}(0)=1 and 1∈[N]1\in[N], Sums over Finite Sets in a Commutative Ring and in an Ordered Field: Distributivity, Products of Sums, Vanishing Terms, Sums over Pairs, Expanding Products of Sums, Counting, Comparison, Monotonicity and the Triangle Inequality (iv) gives βˆ‘k=1Ntk(0)=1\sum_{k=1}^{N}t_{k}(0)=1 for every N∈NN\in\mathbb{N}. The constant sequence (1)N∈N(1)_{N\in\mathbb{N}} (Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (v)) converges to 11 by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (i); it is the sequence of partial sums of βˆ‘k=1∞tk(0)\sum_{k=1}^{\infty}t_{k}(0), which converges to exp⁑(0)\exp(0) (see the Notation paragraph), so exp⁑(0)=1\exp(0)=1 by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (ii), as in The Limit of a Convergent Sequence (i).

Proof of (ii). Let u,v∈Ru,v\in\mathbb{R}. Apply The Cauchy Product of Two Absolutely Convergent Series with ak=tk(u)a_{k}=t_{k}(u) and bk=tk(v)b_{k}=t_{k}(v), whose series converge absolutely by The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (ii), and let DnD_{n} and cnc_{n} be as there. Let n∈Nn\in\mathbb{N} and m=nβˆ’1∈N0m=n-1\in\mathbb{N}_{0}. We show cn=(u+v)m/m!=tn(u+v)c_{n}=(u+v)^{m}/m!=t_{n}(u+v).

For k∈{0,…,m}k\in\{0,\dots,m\} the difference mβˆ’k∈N0m-k\in\mathbb{N}_{0} is defined, and in R\mathbb{R} we have 1≀k+1≀m+1=n1\le k+1\le m+1=n, 1≀(mβˆ’k)+1≀n1\le(m-k)+1\le n and (k+1)+((mβˆ’k)+1)=m+2=n+1(k+1)+((m-k)+1)=m+2=n+1. Hence Ο†(k)=(k+1,(mβˆ’k)+1)\varphi(k)=(k+1,(m-k)+1) lies in DnD_{n}, and Ο†:{0,…,m}β†’Dn\varphi:\{0,\dots,m\}\to D_{n} is a map. It is injective, since k+1=kβ€²+1k+1=k'+1 gives k=kβ€²k=k'. It is surjective: for (i,j)∈Dn(i,j)\in D_{n} let k=iβˆ’1∈N0k=i-1\in\mathbb{N}_{0}; in R\mathbb{R}, k+(jβˆ’1)=(i+j)βˆ’2=nβˆ’1=mk+(j-1)=(i+j)-2=n-1=m with jβˆ’1β‰₯0j-1\ge0, so k≀mk\le m, mβˆ’k=jβˆ’1m-k=j-1 and Ο†(k)=(i,j)\varphi(k)=(i,j). So Ο†\varphi is a bijection. Since (k+1)βˆ’1=k(k+1)-1=k and ((mβˆ’k)+1)βˆ’1=mβˆ’k((m-k)+1)-1=m-k, Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (iii), Sums and Products over a Finite Set and over an Interval (iv) and Finite Sums of Reals: Congruence, the Product Map (x,y) ↦ f(x)h(y), and the Sequence of Diagonal Sums (i), for the reindexed terms, which agree on {0,…,m}\{0,\dots,m\}, give

cn=βˆ‘(i,j)∈Dnti(u) tj(v)=βˆ‘k=0mtk+1(u) t(mβˆ’k)+1(v)=βˆ‘k=0mukvmβˆ’kk! (mβˆ’k)!.c_{n}=\sum_{(i,j)\in D_{n}}t_{i}(u)\,t_{j}(v)=\sum_{k=0}^{m}t_{k+1}(u)\,t_{(m-k)+1}(v)=\sum_{k=0}^{m}\frac{u^{k}v^{m-k}}{k!\,(m-k)!}.

By the binomial theorem The Binomial Theorem in a Commutative Ring (i) in the commutative ring R\mathbb{R}, with the binomial coefficients (mk)\binom{m}{k}, (u+v)m=βˆ‘k=0m(mk)ukvmβˆ’k(u+v)^{m}=\sum_{k=0}^{m}\binom{m}{k}u^{k}v^{m-k}. For k≀mk\le m, k! (mβˆ’k)! (mk)=m!k!\,(m-k)!\,\binom{m}{k}=m! by Binomial Coefficients: Existence and Uniqueness by Pascal's Recursion, Vanishing above the Diagonal, Diagonal and First Values, the Factorial Formula and Symmetry (v) and The Binomial Coefficient (i), an identity in N0\mathbb{N}_{0} that holds in R\mathbb{R}, the image in R\mathbb{R} of a product being the product of the images by The Image of the Natural Numbers with Zero in a Commutative Ring Respects Zero, One, Sums, Products, Differences, Powers, and Finite Sums and Products (iii); as the factorials are nonzero (Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (iii)), (mk)/m!=1/(k! (mβˆ’k)!)\binom{m}{k}/m!=1/(k!\,(m-k)!). Hence, by Sums over Finite Sets in a Commutative Ring and in an Ordered Field: Distributivity, Products of Sums, Vanishing Terms, Sums over Pairs, Expanding Products of Sums, Counting, Comparison, Monotonicity and the Triangle Inequality (i),

(u+v)mm!=βˆ‘k=0m(mk)m! ukvmβˆ’k=βˆ‘k=0mukvmβˆ’kk! (mβˆ’k)!=cn.\frac{(u+v)^{m}}{m!}=\sum_{k=0}^{m}\frac{\binom{m}{k}}{m!}\,u^{k}v^{m-k}=\sum_{k=0}^{m}\frac{u^{k}v^{m-k}}{k!\,(m-k)!}=c_{n}.

So cn=tn(u+v)c_{n}=t_{n}(u+v) for every n∈Nn\in\mathbb{N}, and the sequences (cn)(c_{n}) and (tn(u+v))(t_{n}(u+v)) are equal by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv). By The Cauchy Product of Two Absolutely Convergent Series (ii), their series converges with sum exp⁑(u)exp⁑(v)\exp(u)\exp(v), so its partial sums converge to exp⁑(u)exp⁑(v)\exp(u)\exp(v) by Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence (ii); they also converge to exp⁑(u+v)\exp(u+v) (see the Notation paragraph), so exp⁑(u+v)=exp⁑(u)exp⁑(v)\exp(u+v)=\exp(u)\exp(v) by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences (ii).

Reciprocals. Let u∈Ru\in\mathbb{R}. By (ii) and (i), exp⁑(u)exp⁑(βˆ’u)=exp⁑(u+(βˆ’u))=exp⁑(0)=1\exp(u)\exp(-u)=\exp(u+(-u))=\exp(0)=1. So exp⁑(u)β‰ 0\exp(u)\neq0, as 0β‹…exp⁑(βˆ’u)=0β‰ 10\cdot\exp(-u)=0\neq1 (Rules of Arithmetic and Order in an Ordered Field (i), Rules of Arithmetic and Order in an Ordered Field (vii)), and multiplying by the reciprocal exp⁑(u)βˆ’1\exp(u)^{-1} (Negatives, Reciprocals and the Strict Order in an Ordered Field, as Values (ii)) gives

exp⁑(βˆ’u)=1exp⁑(u)(u∈R).(2)\exp(-u)=\frac{1}{\exp(u)}\qquad(u\in\mathbb{R}).\tag{2}

This is the identity of (iv).

Proof of (v) for uβ‰₯0u\ge0, and of (iii). Let uβ‰₯0u\ge0. For k∈Nk\in\mathbb{N}, ukβˆ’1β‰₯0u^{k-1}\ge0 by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi) and (kβˆ’1)!>0(k-1)!>0, so 1/(kβˆ’1)!>01/(k-1)!>0 by Rules of Arithmetic and Order in an Ordered Field (viii), and tk(u)=ukβˆ’1β‹…(1/(kβˆ’1)!)β‰₯0β‹…(1/(kβˆ’1)!)=0t_{k}(u)=u^{k-1}\cdot(1/(k-1)!)\ge0\cdot(1/(k-1)!)=0 by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares (iv) and Rules of Arithmetic and Order in an Ordered Field (i). By Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series (i) and (1), 1+u=βˆ‘k=12tk(u)≀exp⁑(u)1+u=\sum_{k=1}^{2}t_{k}(u)\le\exp(u). In particular exp⁑(u)β‰₯1+uβ‰₯1>0\exp(u)\ge1+u\ge1>0 for every uβ‰₯0u\ge0. If u<0u<0, then βˆ’u>0-u>0 (Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares (iii)), so exp⁑(βˆ’u)>0\exp(-u)>0 and, by (2) applied to βˆ’u-u, exp⁑(u)=1/exp⁑(βˆ’u)>0\exp(u)=1/\exp(-u)>0 by Rules of Arithmetic and Order in an Ordered Field (viii). As u<0u<0 or 0≀u0\le u by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (vii), (iii) follows.

Proof of (v) for u<0u<0. If uβ‰€βˆ’1u\le-1, then 1+u≀0<exp⁑(u)1+u\le0<\exp(u) by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares (ii) and (iii). Let βˆ’1<u<0-1<u<0 and w=βˆ’uw=-u, so 0<w<10<w<1 and ∣w∣<1|w|<1. For k∈Nk\in\mathbb{N}, wkβˆ’1>0w^{k-1}>0 by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi), as w>0w>0. Also 0<1/(kβˆ’1)!≀10<1/(k-1)!\le1: if (kβˆ’1)!=1(k-1)!=1 this is 0<10<1 (Rules of Arithmetic and Order in an Ordered Field (vii)), and otherwise 1<(kβˆ’1)!1<(k-1)!, as 1≀(kβˆ’1)!1\le(k-1)!, by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (v), so 0<1/(kβˆ’1)!<1/1=10<1/(k-1)!<1/1=1 by Rules of Arithmetic and Order in an Ordered Field (viii). Multiplying 0≀1/(kβˆ’1)!≀10\le1/(k-1)!\le1 by wkβˆ’1>0w^{k-1}>0 gives 0≀tk(w)≀wkβˆ’10\le t_{k}(w)\le w^{k-1} by Rules of Arithmetic and Order in an Ordered Field (vi) and Rules of Arithmetic and Order in an Ordered Field (i). The sequence (wkβˆ’1)k∈N(w^{k-1})_{k\in\mathbb{N}} is that of Power Series: the Sequence of Terms, the Coefficients 1/(k-1)!, and the Sum as a Map on the Set of Convergence (i) for u=wu=w and the constant coefficient sequence 11 of Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (v), as 1β‹…wkβˆ’1=wkβˆ’11\cdot w^{k-1}=w^{k-1}. By Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series (v), βˆ‘k=1∞wkβˆ’1\sum_{k=1}^{\infty}w^{k-1} converges with sum 1/(1βˆ’w)1/(1-w), so Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series (ii) gives exp⁑(w)≀1/(1βˆ’w)\exp(w)\le1/(1-w). Multiplying by (1βˆ’w)/exp⁑(w)>0(1-w)/\exp(w)>0 (Rules of Arithmetic and Order in an Ordered Field (vi), using (iii) and 1βˆ’w>01-w>0) gives 1βˆ’w≀1/exp⁑(w)1-w\le1/\exp(w). By (2) applied to ww, exp⁑(u)=exp⁑(βˆ’w)=1/exp⁑(w)β‰₯1βˆ’w=1+u\exp(u)=\exp(-w)=1/\exp(w)\ge1-w=1+u.

Proof of (vi). Let h∈Rh\in\mathbb{R} with ∣hβˆ£β‰€1|h|\le1. By Elementary Properties of Series of Real Numbers: Linearity, Null Terms, the Cauchy Criterion, Index Shifts, Tails, Order and Telescoping (iv) with p=2p=2, applied to the shifted sequence (t2+k(h))k∈N(t_{2+k}(h))_{k\in\mathbb{N}} of Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (ii), and (1),

exp⁑(h)=βˆ‘k=12tk(h)+βˆ‘k=1∞t2+k(h)=1+h+βˆ‘k=1∞t2+k(h),\exp(h)=\sum_{k=1}^{2}t_{k}(h)+\sum_{k=1}^{\infty}t_{2+k}(h)=1+h+\sum_{k=1}^{\infty}t_{2+k}(h),

the last series converging. Let k∈Nk\in\mathbb{N}. Then (2+k)βˆ’1=k+1(2+k)-1=k+1, so t2+k(h)=hk+1/(k+1)!t_{2+k}(h)=h^{k+1}/(k+1)!. By Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi) and Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (i) (with (kβˆ’1)+2=k+1(k-1)+2=k+1), ∣hk+1∣=∣h∣k+1=∣h∣kβˆ’1∣h∣2|h^{k+1}|=|h|^{k+1}=|h|^{k-1}|h|^{2}; here ∣h∣kβˆ’1≀1|h|^{k-1}\le1 by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ix), as 0β‰€βˆ£hβˆ£β‰€10\le|h|\le1 (Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (iii)), and ∣h∣2=∣h2∣=h2|h|^{2}=|h^{2}|=h^{2} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi), as h2=hβ‹…hβ‰₯0h^{2}=h\cdot h\ge0 by Rules of Arithmetic and Order in an Ordered Field (vii). By Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (iii) applied to kβˆ’1k-1 and to kk, 1≀(kβˆ’1)!≀k!≀(k+1)!1\le(k-1)!\le k!\le(k+1)! in R\mathbb{R}, so 1/(k+1)!≀1/(kβˆ’1)!1/(k+1)!\le1/(k-1)!: the two are equal if (kβˆ’1)!=(k+1)!(k-1)!=(k+1)!, and otherwise (kβˆ’1)!<(k+1)!(k-1)!<(k+1)! by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (v) and Rules of Arithmetic and Order in an Ordered Field (viii) applies. Hence ∣h∣k+1=∣h∣kβˆ’1h2≀1β‹…h2=h2|h|^{k+1}=|h|^{k-1}h^{2}\le1\cdot h^{2}=h^{2} by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares (iv), as 0≀h20\le h^{2}; and, as 0β‰€βˆ£h∣k+10\le|h|^{k+1} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi) and 0<1/(k+1)!0<1/(k+1)! by Rules of Arithmetic and Order in an Ordered Field (viii), multiplying 0β‰€βˆ£h∣k+1≀h20\le|h|^{k+1}\le h^{2} and 0≀1/(k+1)!≀1/(kβˆ’1)!0\le1/(k+1)!\le1/(k-1)! gives ∣h∣k+1/(k+1)!≀h2/(kβˆ’1)!|h|^{k+1}/(k+1)!\le h^{2}/(k-1)! by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares (vii). With 1kβˆ’1=11^{k-1}=1 (Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii)) and Rules of Arithmetic and Order in an Ordered Field (x),

∣t2+k(h)∣=∣h∣k+1(k+1)!≀h2(kβˆ’1)!=h2 tk(1).|t_{2+k}(h)|=\frac{|h|^{k+1}}{(k+1)!}\le\frac{h^{2}}{(k-1)!}=h^{2}\,t_{k}(1).

By Elementary Properties of Series of Real Numbers: Linearity, Null Terms, the Cauchy Criterion, Index Shifts, Tails, Order and Telescoping (i) and The Real Exponential Function (iii), βˆ‘k=1∞h2tk(1)\sum_{k=1}^{\infty}h^{2}t_{k}(1), the series of the sequence (h2tk(1))k∈N(h^{2}t_{k}(1))_{k\in\mathbb{N}} of Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (v), converges with sum h2exp⁑(1)=e h2h^{2}\exp(1)=e\,h^{2}. Hence, by Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series (iv),

∣exp⁑(h)βˆ’1βˆ’h∣=βˆ£βˆ‘k=1∞t2+k(h)βˆ£β‰€e h2.|\exp(h)-1-h|=\Big|\sum_{k=1}^{\infty}t_{2+k}(h)\Big|\le e\,h^{2}.

Proof of (vii). Let II be an interval containing two distinct points, f=exp⁑∣If=\exp|_{I}, so f(s)=exp⁑(s)f(s)=\exp(s) for s∈Is\in I, and let x∈Ix\in I. We show that exp⁑(x)\exp(x) is a derivative of ff at xx. Let a real Ξ΅>0\varepsilon>0 be given. Put K=eexp⁑(x)+1K=e\exp(x)+1; as e=exp⁑(1)>0e=\exp(1)>0 and exp⁑(x)>0\exp(x)>0 by (iii), eexp⁑(x)>0β‹…exp⁑(x)=0e\exp(x)>0\cdot\exp(x)=0 by Rules of Arithmetic and Order in an Ordered Field (vi) and Rules of Arithmetic and Order in an Ordered Field (i), so K>1>0K>1>0. Now choose Ξ΄=min⁑{1,Ξ΅/K}\delta=\min\{1,\varepsilon/K\}, which depends on Ξ΅\varepsilon and xx only; Ξ΅/K>0\varepsilon/K>0 by Closure Facts in an Ordered Field: Negatives, Differences, Quotients, Absolute Values, Powers, Natural Numbers, Halves and Minima (ii) and Rules of Arithmetic and Order in an Ordered Field (viii), so Ξ΄>0\delta>0, δ≀1\delta\le1 and δ≀Ρ/K\delta\le\varepsilon/K by Closure Facts in an Ordered Field: Negatives, Differences, Quotients, Absolute Values, Powers, Natural Numbers, Halves and Minima (viii). Let t∈It\in I with 0<∣tβˆ’x∣<Ξ΄0<|t-x|<\delta, and put h=tβˆ’xh=t-x (Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (i)); then hβ‰ 0h\neq0 and ∣h∣<δ≀1|h|<\delta\le1. By (ii), f(t)=exp⁑(x+h)=exp⁑(x)exp⁑(h)f(t)=\exp(x+h)=\exp(x)\exp(h), so

f(t)βˆ’f(x)tβˆ’xβˆ’exp⁑(x)=exp⁑(x) exp⁑(h)βˆ’1βˆ’hh.\frac{f(t)-f(x)}{t-x}-\exp(x)=\exp(x)\,\frac{\exp(h)-1-h}{h}.

By Rules of Arithmetic and Order in an Ordered Field (x), (vi) and h2=∣h∣2h^{2}=|h|^{2}, its absolute value is at most exp⁑(x) e h2/∣h∣=eexp⁑(x)β€‰βˆ£hβˆ£β‰€K∣h∣<Kδ≀Kβ‹…Ξ΅/K=Ξ΅\exp(x)\,e\,h^{2}/|h|=e\exp(x)\,|h|\le K|h|<K\delta\le K\cdot\varepsilon/K=\varepsilon (Rules of Arithmetic and Order in an Ordered Field (vi), Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (iv)). So exp⁑(x)\exp(x) is a derivative of ff at xx; hence ff is differentiable at xx with fβ€²(x)=exp⁑(x)f'(x)=\exp(x), the derivative being unique as stated there. As x∈Ix\in I was arbitrary, ff is differentiable by Derivative of a Real Function on an Interval (iii).

Proof of (viii). R\mathbb{R} is an interval containing the distinct points 00 and 11, and exp⁑∣R=exp⁑\exp|_{\mathbb{R}}=\exp by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iii). By (vii) with I=RI=\mathbb{R}, exp⁑\exp is differentiable at every x∈Rx\in\mathbb{R}, hence continuous at xx by The Increment Form of the Derivative, and Differentiability Implies Continuity (ii). So exp⁑\exp is continuous on R\mathbb{R}, by The Real Line: Standing Notation and Background for Calculus on Intervals (vi).

Proof of (ix). Let u<vu<v and w=vβˆ’uw=v-u, so w>0w>0 by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares (i). By (v), exp⁑(w)β‰₯1+w>1\exp(w)\ge1+w>1. By (ii), exp⁑(v)=exp⁑(u+w)=exp⁑(u)exp⁑(w)\exp(v)=\exp(u+w)=\exp(u)\exp(w), and as exp⁑(u)>0\exp(u)>0 by (iii), exp⁑(u)=exp⁑(u)β‹…1<exp⁑(u)exp⁑(w)=exp⁑(v)\exp(u)=\exp(u)\cdot1<\exp(u)\exp(w)=\exp(v) by Rules of Arithmetic and Order in an Ordered Field (vi).

Proof of (x). Let a real Ξ΅>0\varepsilon>0 be given, and choose M=1/Ξ΅M=1/\varepsilon, so M>0M>0 by Rules of Arithmetic and Order in an Ordered Field (viii). Let u<βˆ’Mu<-M and w=βˆ’uw=-u; then w>M>0w>M>0 by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares (iii). By (v), exp⁑(w)β‰₯1+w>w>M=1/Ξ΅>0\exp(w)\ge1+w>w>M=1/\varepsilon>0. By (2) applied to ww, Rules of Arithmetic and Order in an Ordered Field (viii) and Rules of Arithmetic and Order in an Ordered Field (iii), exp⁑(u)=1/exp⁑(w)<1/(1/Ξ΅)=Ξ΅\exp(u)=1/\exp(w)<1/(1/\varepsilon)=\varepsilon.

Proof of (xi). Let g:Rβ†’(0,∞)g:\mathbb{R}\to(0,\infty), g(u)=exp⁑(u)g(u)=\exp(u). Injective: let u,uβ€²βˆˆRu,u'\in\mathbb{R} with uβ‰ uβ€²u\neq u'. By Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (vi), u<uβ€²u<u' or uβ€²<uu'<u, so exp⁑(u)<exp⁑(uβ€²)\exp(u)<\exp(u') or exp⁑(uβ€²)<exp⁑(u)\exp(u')<\exp(u) by (ix), and in either case g(u)β‰ g(uβ€²)g(u)\neq g(u') by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (ii). Surjective: let s∈(0,∞)s\in(0,\infty), so s>0s>0. First let sβ‰₯1s\ge1; then 0<s0<s. The restriction of exp⁑\exp to the closed interval [0,s][0,s] is continuous on [0,s][0,s], by (viii) and The Real Line: Standing Notation and Background for Calculus on Intervals (vi), and exp⁑(0)=1≀s<1+s≀exp⁑(s)\exp(0)=1\le s<1+s\le\exp(s) by (i) and (v). So Intermediate Value Theorem on a Closed Real Interval, and Continuous Images of Intervals (i) gives c∈[0,s]c\in[0,s] with exp⁑(c)=s\exp(c)=s. Now let 0<s<10<s<1. Then 1/s>11/s>1 by Rules of Arithmetic and Order in an Ordered Field (viii), so the first case gives c∈Rc\in\mathbb{R} with exp⁑(c)=1/s\exp(c)=1/s, and by (2) and Rules of Arithmetic and Order in an Ordered Field (iii), exp⁑(βˆ’c)=1/(1/s)=s\exp(-c)=1/(1/s)=s. As s<1s<1 or 1≀s1\le s by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (vii), gg is surjective, and so it is bijective.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…