TheoremBase

Modelled on the real helper: powers, factorials and reciprocals are maps on the natural numbers with zero, composed with the predecessor map; the sum is the function of limits of the partial sums in the metric space of complex numbers.

Proof

Throughout, the result on limits in metric spaces cited below is read in the current definitions of sequences, metric spaces, convergence and limits (The Earlier and the New Versions of the Definitions of Sequences, Limits, Cauchy Sequences, Series and Iterated Operations Agree (i), The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (i), The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (iii), The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (iv)).

Uniqueness. C\mathbb{C} is a field (The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (v)), hence a commutative ring (Fields (i)). A sequence in C\mathbb{C} is a map N→C\mathbb{N}\to\mathbb{C} (Sequences (i)), and two maps with the same values are equal. So the sequences of (i) and (ii) are unique once they exist, and only their existence is shown below.

The predecessor map. For k∈Nk\in\mathbb{N} we have 1≀k1\le k (Arithmetic and Order of the Natural Numbers (x)), so kβˆ’1k-1 is the only j∈N0j\in\mathbb{N}_{0} with ((1,j),k)∈+((1,j),k)\in{+} for the addition of N0\mathbb{N}_{0} (The Difference of Two Natural Numbers with Zero (i)). This condition on kk and jj is predicative (Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iv)), so by Maps from Functional Predicative Relations, and Families of Sections (ii) there is a map Ο€:Nβ†’N0\pi:\mathbb{N}\to\mathbb{N}_{0} with Ο€(k)=kβˆ’1\pi(k)=k-1 for every k∈Nk\in\mathbb{N}.

Proof of (i). Let u∈Cu\in\mathbb{C}. By Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (iv) there is a map P:N0β†’CP:\mathbb{N}_{0}\to\mathbb{C} with P(n)=unP(n)=u^{n}, so Pβˆ˜Ο€P\circ\pi is a sequence in C\mathbb{C} with kk-th term ukβˆ’1u^{k-1} (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii)). Combining (ck)(c_{k}) and Pβˆ˜Ο€P\circ\pi through the multiplication CΓ—Cβ†’C\mathbb{C}\times\mathbb{C}\to\mathbb{C} gives a sequence in C\mathbb{C} with kk-th term ckukβˆ’1c_{k}u^{k-1} (Composite Maps into Classes, Images of Singletons, and Agreement of Maps by Induction (i)).

Proof of (ii). Let n∈N0n\in\mathbb{N}_{0}. Read in C\mathbb{C}, n!n! is ΞΉ\iota of n!n! read in R\mathbb{R} (The Complex Numbers, with the Real Numbers Identified with a Subset of the Complex Numbers (iv)). The latter is nonzero (Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (iii)), and ΞΉ\iota is injective with ΞΉ(0)=0\iota(0)=0 (The Complex Numbers, with the Real Numbers Identified with a Subset of the Complex Numbers (iv)); so n!β‰ 0n!\neq0 in C\mathbb{C}.

For the sequence, The Factorial as a Map on the Natural Numbers with Zero (i) gives a map F:N0β†’N0F:\mathbb{N}_{0}\to\mathbb{N}_{0} with F(n)=n!F(n)=n!, and Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (ii), with R=CR=\mathbb{C}, a map Ξ½:N0β†’C\nu:\mathbb{N}_{0}\to\mathbb{C} sending each nn to its image in C\mathbb{C}; so Ο‡=ν∘F:N0β†’C\chi=\nu\circ F:\mathbb{N}_{0}\to\mathbb{C} has Ο‡(n)=n!\chi(n)=n! read in C\mathbb{C}. The condition yβ‹…Ο‡(n)=1y\cdot\chi(n)=1 on nn and yy is predicative (Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iii), Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (v)), and since Ο‡(n)β‰ 0\chi(n)\neq0 and C\mathbb{C} is a field, exactly one y∈Cy\in\mathbb{C} satisfies it for each n∈N0n\in\mathbb{N}_{0}, namely 1/n!1/n!. By Maps from Functional Predicative Relations, and Families of Sections (ii) there is a map ρ:N0β†’C\rho:\mathbb{N}_{0}\to\mathbb{C} with ρ(n)=1/n!\rho(n)=1/n!, and Οβˆ˜Ο€\rho\circ\pi is a sequence in C\mathbb{C} with kk-th term 1/(kβˆ’1)!1/(k-1)!.

Proof of (iii): a formula for the sums up to nn. For u∈Cu\in\mathbb{C} let (ak(u))(a_{k}(u)) be the sequence of (i), and Οƒ(u)\sigma(u) its sequence of partial sums, which exists by Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (i) with the addition of C\mathbb{C}. By Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vii), s=Οƒ(u)s=\sigma(u) satisfies

s:Nβ†’C,s(1)=c1,s(n+1)=s(n)+cn+1unforΒ everyΒ n∈N,s:\mathbb{N}\to\mathbb{C},\qquad s(1)=c_{1},\qquad s(n+1)=s(n)+c_{n+1}u^{n}\quad\text{for every }n\in\mathbb{N},

the equation s(1)=c1s(1)=c_{1} because u0=1u^{0}=1 (Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (iv)); and by induction on nn (Induction for Predicative Formulas, and the Order of β„• below 1 and below n+1 (i)) it is the only set that does. This condition on uu and ss is predicative: the map condition by Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii); the equations between values of maps, sums and products by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (v); the successor n+1n+1 of nn (Order and Arithmetic of β„•β‚€ in Flat Form (ii)) by Atomic Predicative Formulas: Equality with Unordered Pairs, Singletons and Successors (iii) and the power unu^{n} by Powers with a Variable Base: a Predicative Formula and the Map (x, m) ↦ x^m (i), both eliminated as in Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ii). So Οƒ(u)\sigma(u) is an expression in uu in the sense of Maps and Relations Given by Formulas (i).

Proof of (iii): the sum map. Let u∈Du\in D. By hypothesis Οƒ(u)\sigma(u) is convergent, with limit βˆ‘k=1∞ckukβˆ’1\sum_{k=1}^{\infty}c_{k}u^{k-1} (Series of Complex Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence (ii)); by Limits of Complex Sequences: Uniqueness, Real and Imaginary Parts, Arithmetic, Real Sequences, Conjugates, Moduli, the Cauchy Criterion and the Modulus Metric (vii) it converges to this sum also in the metric space (C,dC)(\mathbb{C},d_{\mathbb{C}}) of Metric Spaces: Balls, the Metric Topology, and the Real and Complex Numbers as Metric Spaces (v). DD is a set, being a subclass of the set C\mathbb{C} (Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (i)). So Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (v), with (C,dC)(\mathbb{C},d_{\mathbb{C}}) for (X,d)(X,d), DD for aa and Οƒ(u)\sigma(u) for t(u)t(u), gives exactly one function h:Dβ†’Ch:D\to\mathbb{C} with

h(u)=lim⁑σ(u)=βˆ‘k=1∞ckukβˆ’1(u∈D).h(u)=\lim\sigma(u)=\sum_{k=1}^{\infty}c_{k}u^{k-1}\qquad(u\in D).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…