TheoremBase

The limit map is obtained by restricting the maps to S and applying the limit-map helper there. The partial sums are defined by recursion with pointwise addition, and at each point their values satisfy the same recursion as the partial sums, so the uniqueness of recursion identifies them.

Proof

Proof of (i). For k∈Nk\in\mathbb{N}, the restriction fk∣Sf_{k}|_{S} is a map S→RS\to\mathbb{R} with (fk∣S)(p)=fk(p)(f_{k}|_{S})(p)=f_{k}(p) for every p∈Sp\in S, by Domains and Restrictions of Maps (ii) and Domains and Restrictions of Maps (iii). Let FF be the sequence k↦fk∣Sk\mapsto f_{k}|_{S} in RS\mathbb{R}^{S}, a map N→RS\mathbb{N}\to\mathbb{R}^{S} by Sets and Maps: Ordinary Notation (v), and write Fk=F(k)=fk∣SF_{k}=F(k)=f_{k}|_{S}. For p∈Sp\in S, the sequences (Fk(p))k(F_{k}(p))_{k} and (fk(p))k(f_{k}(p))_{k} in R\mathbb{R} of The Sequences k ↦ f_k(p) of a Sequence in ℝ^I, and the Map of Their Limits (i) (for the index sets SS and DD) have the same kk-th term Fk(p)=fk(p)F_{k}(p)=f_{k}(p) for every k∈Nk\in\mathbb{N}, so they 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); in particular (Fk(p))k(F_{k}(p))_{k} is convergent. By The Sequences k ↦ f_k(p) of a Sequence in ℝ^I, and the Map of Their Limits (iii), applied with I=SI=S to FF, there is L∈RSL\in\mathbb{R}^{S}, a map L:S→RL:S\to\mathbb{R}, with L(p)=lim⁡k→∞Fk(p)=lim⁡k→∞fk(p)L(p)=\lim_{k\to\infty}F_{k}(p)=\lim_{k\to\infty}f_{k}(p) for every p∈Sp\in S. If L′:S→RL':S\to\mathbb{R} also satisfies L′(p)=lim⁡k→∞fk(p)L'(p)=\lim_{k\to\infty}f_{k}(p) for every p∈Sp\in S, then L′(p)=L(p)L'(p)=L(p) for every p∈Sp\in S, so L′=LL'=L by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv).

Proof of (ii): existence of a recursive sequence. Let ⊕\oplus be the binary operation on RD\mathbb{R}^{D} of Pointwise Operations on Real-Valued Maps Exist and Are Unique (i) for ++, so that (u⊕v)(x)=u(x)+v(x)(u\oplus v)(x)=u(x)+v(x) for all u,v∈RDu,v\in\mathbb{R}^{D} and x∈Dx\in D. For n∈Nn\in\mathbb{N}, n+1∈Nn+1\in\mathbb{N} by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (vi), so gn+1∈RDg_{n+1}\in\mathbb{R}^{D} and u⊕gn+1∈RDu\oplus g_{n+1}\in\mathbb{R}^{D} for u∈RDu\in\mathbb{R}^{D}; let G:N×RD→RDG:\mathbb{N}\times\mathbb{R}^{D}\to\mathbb{R}^{D} be the map (n,u)↦u⊕gn+1(n,u)\mapsto u\oplus g_{n+1} of Sets and Maps: Ordinary Notation (v). By Recursion on the Natural Numbers Starting at One (i), with the set RD\mathbb{R}^{D}, the element g1g_{1} and the map GG, there is a map s:N→RDs:\mathbb{N}\to\mathbb{R}^{D}, a sequence (sn)n∈N(s_{n})_{n\in\mathbb{N}} in RD\mathbb{R}^{D}, with s1=g1s_{1}=g_{1} and sn+1=sn⊕gn+1s_{n+1}=s_{n}\oplus g_{n+1} for every n∈Nn\in\mathbb{N}.

The values of ss. Fix x∈Dx\in D, and let a=(gk(x))ka=(g_{k}(x))_{k} and τ=(sn(x))n\tau=(s_{n}(x))_{n} be the sequences in R\mathbb{R} of The Sequences k ↦ f_k(p) of a Sequence in ℝ^I, and the Map of Their Limits (i), with terms ak=gk(x)a_{k}=g_{k}(x) and τ(n)=sn(x)\tau(n)=s_{n}(x). By Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (i), for the addition of R\mathbb{R}, there is a map σ:N→R\sigma:\mathbb{N}\to\mathbb{R} with σ(n)=∑k=1nak\sigma(n)=\sum_{k=1}^{n}a_{k} for every n∈Nn\in\mathbb{N}, the sum being that of the restriction a∣[n]a|_{[n]} as in Iterated Operations: Finite Sums and Finite Products (ii). For n∈Nn\in\mathbb{N}, a∣[n]a|_{[n]} has the value ak=gk(x)a_{k}=g_{k}(x) at each k∈[n]k\in[n] by Domains and Restrictions of Maps (iii), so it is the map k↦gk(x)k\mapsto g_{k}(x) on [n][n] by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv), and σ(n)=∑k=1ngk(x)\sigma(n)=\sum_{k=1}^{n}g_{k}(x).

The map σ\sigma satisfies σ(1)=a1\sigma(1)=a_{1}: by Iterated Operations: Finite Sums and Finite Products (i), ∑k=11ak\sum_{k=1}^{1}a_{k} is the value at 11 of the map of Iterating a Binary Operation along a Finite List (i) for a∣[1]a|_{[1]}, which is a1a_{1}. For n∈Nn\in\mathbb{N}, σ(n+1)=σ(n)+an+1\sigma(n+1)=\sigma(n)+a_{n+1}: the addition of R\mathbb{R} is associative and commutative with neutral element 00, so Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vii), with m=1m=1, gives ∑k=1n+1ak=(∑k=1nak)+an+1\sum_{k=1}^{n+1}a_{k}=\Big(\sum_{k=1}^{n}a_{k}\Big)+a_{n+1} for the sums over intervals of Sums and Products over a Finite Set and over an Interval (iv), and these agree with the sums of Iterated Operations: Finite Sums and Finite Products (ii) by Natural Numbers as Indices: ℕ ⊆ ℕ₀, 1 ∈ ℕ₀, and the Two Readings of an Operation from 1 to n (v), applied to a∣[n]a|_{[n]} and a∣[n+1]a|_{[n+1]}.

The map τ\tau satisfies the same two equations: τ(1)=s1(x)=g1(x)=a1\tau(1)=s_{1}(x)=g_{1}(x)=a_{1}, and for n∈Nn\in\mathbb{N}, τ(n+1)=(sn⊕gn+1)(x)=sn(x)+gn+1(x)=τ(n)+an+1\tau(n+1)=(s_{n}\oplus g_{n+1})(x)=s_{n}(x)+g_{n+1}(x)=\tau(n)+a_{n+1}. Let H:N×R→RH:\mathbb{N}\times\mathbb{R}\to\mathbb{R} be the map (n,t)↦t+an+1(n,t)\mapsto t+a_{n+1} of Sets and Maps: Ordinary Notation (v). Then σ\sigma and τ\tau are maps N→R\mathbb{N}\to\mathbb{R} with value a1a_{1} at 11 and f(n+1)=H(n,f(n))f(n+1)=H(n,f(n)) for every n∈Nn\in\mathbb{N}, for f=σf=\sigma and f=τf=\tau; by the uniqueness in Recursion on the Natural Numbers Starting at One (i), τ=σ\tau=\sigma. Hence sn(x)=τ(n)=σ(n)=∑k=1ngk(x)s_{n}(x)=\tau(n)=\sigma(n)=\sum_{k=1}^{n}g_{k}(x) for every n∈Nn\in\mathbb{N}.

As x∈Dx\in D was arbitrary, sn(x)=∑k=1ngk(x)s_{n}(x)=\sum_{k=1}^{n}g_{k}(x) for all n∈Nn\in\mathbb{N} and x∈Dx\in D. Moreover, for each x∈Dx\in D, (sn(x))n=τ=σ(s_{n}(x))_{n}=\tau=\sigma is the map n↦∑k=1nakn\mapsto\sum_{k=1}^{n}a_{k} on N\mathbb{N}, whose nn-th term is the nn-th partial sum of (ak)=(gk(x))k(a_{k})=(g_{k}(x))_{k} by Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence (i), the finite sum there being read as in Sums and Products over a Finite Set and over an Interval (iv), which agrees with σ(n)\sigma(n) by Natural Numbers as Indices: ℕ ⊆ ℕ₀, 1 ∈ ℕ₀, and the Two Readings of an Operation from 1 to n (v). So (sn(x))n(s_{n}(x))_{n} is the sequence of partial sums of (gk(x))k(g_{k}(x))_{k}.

Uniqueness. Let (sn′)n∈N(s'_{n})_{n\in\mathbb{N}} be a sequence in RD\mathbb{R}^{D} with sn′(x)=∑k=1ngk(x)s'_{n}(x)=\sum_{k=1}^{n}g_{k}(x) for all n∈Nn\in\mathbb{N} and x∈Dx\in D. For each n∈Nn\in\mathbb{N}, sn′(x)=sn(x)s'_{n}(x)=s_{n}(x) for every x∈Dx\in D, so sn′=sns'_{n}=s_{n} by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv); hence s′=ss'=s by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv) again.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…