TheoremBase

Sketch: the functional equation from the Cauchy product and the binomial theorem; reciprocals from it; conjugates and real arguments by passing conjugation and the embedding of the reals through the partial sums; the modulus from the square |exp z|^2 = exp(2 Re z).

Proof

Routine facts about numbers, maps and finite sums are used without comment (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity); the results on conjugates and moduli cited below are read for the present complex numbers, conjugate and modulus by The Earlier and the New Versions of the Definitions of the Natural Numbers, the Complex Numbers, the Conjugate and the Modulus Agree, and the Two Versions of Real Correspond (ii), The Earlier and the New Versions of the Definitions of the Natural Numbers, the Complex Numbers, the Conjugate and the Modulus Agree, and the Two Versions of Real Correspond (iii) and The Earlier and the New Versions of the Definitions of the Natural Numbers, the Complex Numbers, the Conjugate and the Modulus Agree, and the Two Versions of Real Correspond (iv), and the results on real series and the real exponential in the present definitions of sequences and series by The Earlier and the New Versions of the Definitions of Sequences, Limits, Cauchy Sequences, Series and Iterated Operations Agree (i) and The Earlier and the New Versions of the Definitions of Sequences, Limits, Cauchy Sequences, Series and Iterated Operations Agree (v). Elements of N0\mathbb{N}_{0}, such as factorials and binomial coefficients, are read in C\mathbb{C} through the embedding ι\iota (The Complex Numbers, with the Real Numbers Identified with a Subset of the Complex Numbers (iv), The Complex Numbers, with the Real Numbers Identified with a Subset of the Complex Numbers (vi)).

For u∈Cu\in\mathbb{C} and k∈Nk\in\mathbb{N} write

ak(u)=uk−1(k−1)!,so thatexp⁡u=∑k=1∞ak(u)a_{k}(u)=\frac{u^{k-1}}{(k-1)!},\qquad\text{so that}\qquad \exp u=\sum_{k=1}^{\infty}a_{k}(u)

by the definition of the exponential (The Complex Exponential Function (i)).

The value at zero. We have 00=10^{0}=1 and 0!=10!=1, so the first term is a1(0)=1a_{1}(0)=1; and 0j=00^{j}=0 for j≥1j\ge1 (Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii)), so ak(0)=0a_{k}(0)=0 for every k≥2k\ge2. Consequently every partial sum of ∑kak(0)\sum_{k}a_{k}(0) equals 11. A constant sequence converges to its value (Limits of Complex Sequences: Uniqueness, Real and Imaginary Parts, Arithmetic, Real Sequences, Conjugates, Moduli, the Cauchy Criterion and the Modulus Metric (iii)), so the series converges with sum 11 (Series of Complex Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence (ii)). This proves (i).

The Cauchy product of two exponential series. Let z,w∈Cz,w\in\mathbb{C}, and for n∈Nn\in\mathbb{N} let

cn=∑k=1nak(z) an+1−k(w)c_{n}=\sum_{k=1}^{n}a_{k}(z)\,a_{n+1-k}(w)

be the nn-th term of the Cauchy product of the series of exp⁡z\exp z and exp⁡w\exp w. Put m=n−1m=n-1 and substitute j=k−1j=k-1; as kk runs over 1,…,n1,\dots,n, jj runs over 0,…,m0,\dots,m (Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (viii)), and n+1−k=m−j+1n+1-k=m-j+1. The factorial formula j! (m−j)!(mj)=m!j!\,(m-j)!\binom{m}{j}=m! (Binomial Coefficients: Existence and Uniqueness by Pascal's Recursion, Vanishing above the Diagonal, Diagonal and First Values, the Factorial Formula and Symmetry (v)), for the binomial coefficients of The Binomial Coefficient (i), holds in N0\mathbb{N}_{0} and therefore in C\mathbb{C}; since j! (m−j)!≠0j!\,(m-j)!\neq0 and m!≠0m!\neq0 in C\mathbb{C} (Complex Power Series: the Sequence of Terms and the Sum as a Function on the Set of Convergence (ii)), it gives 1/(j! (m−j)!)=(mj)/m!1/(j!\,(m-j)!)=\binom{m}{j}/m!. Hence, using the binomial theorem (The Binomial Theorem in a Commutative Ring (i)) in the last step,

cn=∑j=0mzjwm−jj! (m−j)!=1m!∑j=0m(mj)zjwm−j=(z+w)n−1(n−1)!=an(z+w).c_{n}=\sum_{j=0}^{m}\frac{z^{j}w^{m-j}}{j!\,(m-j)!}=\frac{1}{m!}\sum_{j=0}^{m}\binom{m}{j}z^{j}w^{m-j}=\frac{(z+w)^{n-1}}{(n-1)!}=a_{n}(z+w).

The functional equation. The series ∑kak(z)\sum_{k}a_{k}(z) and ∑kak(w)\sum_{k}a_{k}(w) converge absolutely (The Complex Exponential Series Converges Absolutely, and Its Sum Is a Function on ℂ (ii)). By the theorem on Cauchy products (Series of Complex Numbers: Absolute Convergence, Comparison, Linearity, Index Shifts, Real and Imaginary Parts, Conjugates, Real Series and the Cauchy Product (viii)), the series ∑ncn\sum_{n}c_{n} therefore converges, with sum exp⁡z⋅exp⁡w\exp z\cdot\exp w. By the previous paragraph its terms are an(z+w)a_{n}(z+w), so its sum is also exp⁡(z+w)\exp(z+w). This proves (ii).

Reciprocals. Taking w=−zw=-z in (ii) and using (i),

exp⁡z⋅exp⁡(−z)=exp⁡0=1.\exp z\cdot\exp(-z)=\exp0=1.

So exp⁡z≠0\exp z\neq0, and exp⁡(−z)=1/exp⁡z\exp(-z)=1/\exp z. This proves (iii).

Conjugates. Conjugation preserves sums and products and fixes exactly the elements of R\mathbb{R} (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (i)). By induction on the exponent it carries zk−1z^{k-1} to z‾ k−1\overline{z}^{\,k-1}, and it fixes the real number 1/(k−1)!1/(k-1)!; hence ak(z)‾=ak(z‾)\overline{a_{k}(z)}=a_{k}(\overline{z}) for every kk. Since conjugation commutes with the sum of a convergent series (Series of Complex Numbers: Absolute Convergence, Comparison, Linearity, Index Shifts, Real and Imaginary Parts, Conjugates, Real Series and the Cauchy Product (vi)),

exp⁡z‾=∑k=1∞ak(z)‾=∑k=1∞ak(z‾)=exp⁡z‾.\overline{\exp z}=\sum_{k=1}^{\infty}\overline{a_{k}(z)}=\sum_{k=1}^{\infty}a_{k}(\overline{z})=\exp\overline{z}.

This proves (iv).

Real arguments. Let xx be a real number. Each term ak(x)a_{k}(x) is ι(xk−1/(k−1)!)\iota\big(x^{k-1}/(k-1)!\big), the kk-th term of the real exponential series at xx read in C\mathbb{C}. The real series ∑kxk−1/(k−1)!\sum_{k}x^{k-1}/(k-1)! converges (The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (ii)), so the complex series converges to ι\iota of the real sum (Series of Complex Numbers: Absolute Convergence, Comparison, Linearity, Index Shifts, Real and Imaginary Parts, Conjugates, Real Series and the Cauchy Product (vii)); and the real sum is exp⁡R(x)\exp_{\mathbb{R}}(x) (The Real Exponential Function (i), The Real Exponential Function (ii)). Thus exp⁡x=exp⁡R(x)\exp x=\exp_{\mathbb{R}}(x), a real number. This proves (v).

The modulus. We use, in turn, uu‾=∣u∣2u\overline{u}=|u|^{2} (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (iii)), (iv), (ii), z+z‾=2Re⁡zz+\overline{z}=2\operatorname{Re}z (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (ii)), (v), and the functional equation of the real exponential (Basic Properties of the Exponential Function (ii)):

∣exp⁡z∣2=exp⁡z⋅exp⁡z‾=exp⁡z⋅exp⁡z‾=exp⁡(z+z‾)=exp⁡(2Re⁡z)=exp⁡R(2Re⁡z)=exp⁡R(Re⁡z)2.|\exp z|^{2}=\exp z\cdot\overline{\exp z}=\exp z\cdot\exp\overline{z}=\exp(z+\overline{z})=\exp(2\operatorname{Re}z)=\exp_{\mathbb{R}}(2\operatorname{Re}z)=\exp_{\mathbb{R}}(\operatorname{Re}z)^{2}.

Both ∣exp⁡z∣≥0|\exp z|\ge0 (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (iii)) and exp⁡R(Re⁡z)>0\exp_{\mathbb{R}}(\operatorname{Re}z)>0 (Basic Properties of the Exponential Function (iii)), and two nonnegative reals with equal squares are equal; so ∣exp⁡z∣=exp⁡R(Re⁡z)|\exp z|=\exp_{\mathbb{R}}(\operatorname{Re}z). For a real number yy we have Re⁡(iy)=0\operatorname{Re}(iy)=0 and exp⁡R(0)=1\exp_{\mathbb{R}}(0)=1 (Basic Properties of the Exponential Function (i)), hence ∣exp⁡(iy)∣=1|\exp(iy)|=1. This proves (vi).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…