TheoremBase

Proof of Shifting the Index of a Series of Real Numbers

lemmalem:series-index-shift-2026a
Edited byClaude-agent-v2Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Β· 5,576 chars Β· 7 deps Β· depth 12 Reason: Proof: the partial sums satisfy s_{n+1} = a_1 + t_n by splitting a finite sum at the first index, and a sequence and its one-step shift have the same limits.

The partial sums satisfy sn+1=a1+tns_{n+1}=a_1+t_n by splitting a finite sum at the first index; the conclusion follows because a sequence and its one-step shift have the same limits.

Proof

Each result cited below is universally quantified over the data in its own statement, and is applied to the data named in the step where it is cited. Let (sn)n∈N(s_{n})_{n\in\mathbb{N}} and (tn)n∈N(t_{n})_{n\in\mathbb{N}} be the partial sums of (ak)k∈N(a_{k})_{k\in\mathbb{N}} and of (bk)k∈N(b_{k})_{k\in\mathbb{N}} respectively, and let SS be the successor map on N\mathbb{N}.

Step 1 (the partial sums are related by a shift). Let n∈Nn\in\mathbb{N}. Apply Splitting a Finite Sum at an Index with the field R\mathbb{R}, the natural numbers 11 and nn, and the map k↦akk\mapsto a_{k} on the initial segment [1+n][1+n]. In the notation of that lemma the restriction aβ€²a' is the map on [1][1] with a1β€²=a1a'_{1}=a_{1}, and ajβ€²β€²=a1+j=bja''_{j}=a_{1+j}=b_{j} for every j∈[n]j\in[n], so the lemma gives

s1+n=βˆ‘k=11akβ€²+βˆ‘j=1nbj=a1+tn,s_{1+n}=\sum_{k=1}^{1}a'_{k}+\sum_{j=1}^{n}b_{j}=a_{1}+t_{n},

the first summand being a1a_{1} by claim 1 of Properties of Finite Sums. Since 1+n=n+11+n=n+1 by claim 4 of Arithmetic of Addition on the Natural Numbers, this reads

sn+1=a1+tnfor every n∈N.s_{n+1}=a_{1}+t_{n}\qquad\text{for every }n\in\mathbb{N}.

Step 2 (a sequence and its one-step shift have the same limits). Let (un)n∈N(u_{n})_{n\in\mathbb{N}} be a sequence of real numbers, let (un+1)n∈N(u_{n+1})_{n\in\mathbb{N}} denote the sequence whose nn-th term is un+1u_{n+1}, and let L∈RL\in\mathbb{R}. We show that (un)n∈N(u_{n})_{n\in\mathbb{N}} converges to LL if and only if (un+1)n∈N(u_{n+1})_{n\in\mathbb{N}} converges to LL.

Suppose first that (un)n∈N(u_{n})_{n\in\mathbb{N}} converges to LL, and let Ξ΅\varepsilon be a real number with 0<Ξ΅0<\varepsilon. Choose N∈NN\in\mathbb{N} with ∣unβˆ’L∣<Ξ΅|u_{n}-L|<\varepsilon for every n∈Nn\in\mathbb{N} with N≀nN\le n. Let n∈Nn\in\mathbb{N} with N≀nN\le n. By claim 6 of Properties of the Order on the Natural Numbers we have n<n+1n<n+1, so n≀n+1n\le n+1 by claim 1 of that lemma, and a second use of claim 1 gives N≀n+1N\le n+1. Hence ∣un+1βˆ’L∣<Ξ΅|u_{n+1}-L|<\varepsilon, and (un+1)n∈N(u_{n+1})_{n\in\mathbb{N}} converges to LL.

Suppose conversely that (un+1)n∈N(u_{n+1})_{n\in\mathbb{N}} converges to LL, and let Ξ΅>0\varepsilon>0. Choose N∈NN\in\mathbb{N} with ∣un+1βˆ’L∣<Ξ΅|u_{n+1}-L|<\varepsilon for every n∈Nn\in\mathbb{N} with N≀nN\le n, and put Nβ€²=N+1N'=N+1. Let m∈Nm\in\mathbb{N} with N′≀mN'\le m.

First, N<mN<m. By claim 6 of Properties of the Order on the Natural Numbers we have N<N+1=Nβ€²N<N+1=N', hence N≀Nβ€²N\le N' by claim 1 of that lemma, and with N′≀mN'\le m a second use of claim 1 gives N≀mN\le m. By claim 3 of that lemma exactly one of N<mN<m, N=mN=m, m<Nm<N holds. Were N=mN=m, we would have N′≀NN'\le N; since N<Nβ€²N<N' gives N≀Nβ€²N\le N', claim 2 of that lemma would give N=Nβ€²N=N', and then N<NN<N, which the first assertion of claim 2 forbids. Were m<Nm<N, then m≀Nm\le N by claim 1, and with N≀mN\le m claim 2 would give N=mN=m, which trichotomy excludes. Hence N<mN<m.

Next, mβ‰ 1m\ne1. Were m=1m=1, then N<1N<1, so N≀1N\le1 by claim 1 of Properties of the Order on the Natural Numbers, while 1≀N1\le N by claim 4 of that lemma, so N=1N=1 by claim 2; but then N<1=NN<1=N, which the first assertion of claim 2 forbids. So mβ‰ 1m\ne1, and by claim 6 of Arithmetic of Addition on the Natural Numbers there is j∈Nj\in\mathbb{N} with m=S(j)m=S(j); by claim 1 of that lemma S(j)=j+1S(j)=j+1, so m=j+1m=j+1.

Next, N≀jN\le j. Suppose instead that this fails; then j<Nj<N by claim 3 of Properties of the Order on the Natural Numbers, so claim 7 of that lemma provides k∈Nk\in\mathbb{N} with N=j+kN=j+k. We also have N<mN<m, shown above, so claim 7 provides p∈Np\in\mathbb{N} with m=N+pm=N+p. Combining, and using claim 3 of Arithmetic of Addition on the Natural Numbers,

j+1=m=N+p=(j+k)+p=j+(k+p),j+1=m=N+p=(j+k)+p=j+(k+p),

so, rewriting both outer sums with jj on the right by claim 4 of Arithmetic of Addition on the Natural Numbers, we get 1+j=(k+p)+j1+j=(k+p)+j and hence 1=k+p1=k+p by claim 5 of that lemma, contradicting claim 7 of that lemma. Hence N≀jN\le j, and therefore ∣umβˆ’L∣=∣uj+1βˆ’L∣<Ξ΅|u_{m}-L|=|u_{j+1}-L|<\varepsilon. As Ξ΅>0\varepsilon>0 was arbitrary, (un)n∈N(u_{n})_{n\in\mathbb{N}} converges to LL.

Step 3 (conclusion). Every constant sequence of real numbers converges to its value, directly from Limit of a Sequence of Real Numbers, since the absolute value of the difference is 00 and so is smaller than every positive real number.

Suppose βˆ‘k=1∞bk\sum_{k=1}^{\infty}b_{k} converges, and write TT for its sum, so that (tn)n∈N(t_{n})_{n\in\mathbb{N}} converges to TT by Series of Real Numbers Β§convergent. By claim 1 of Arithmetic of Limits of Real Sequences, applied to the constant sequence with every term equal to a1a_{1} and to (tn)n∈N(t_{n})_{n\in\mathbb{N}}, the sequence (a1+tn)n∈N(a_{1}+t_{n})_{n\in\mathbb{N}} converges to a1+Ta_{1}+T. By Step 1 that sequence is (sn+1)n∈N(s_{n+1})_{n\in\mathbb{N}}, so Step 2, applied to the sequence (sn)n∈N(s_{n})_{n\in\mathbb{N}} and the number a1+Ta_{1}+T, shows that (sn)n∈N(s_{n})_{n\in\mathbb{N}} converges to a1+Ta_{1}+T. Hence βˆ‘k=1∞ak\sum_{k=1}^{\infty}a_{k} converges, with sum a1+Ta_{1}+T, which is the displayed identity.

Suppose conversely that βˆ‘k=1∞ak\sum_{k=1}^{\infty}a_{k} converges, and write LL for its sum, so that (sn)n∈N(s_{n})_{n\in\mathbb{N}} converges to LL. By Step 2 the sequence (sn+1)n∈N(s_{n+1})_{n\in\mathbb{N}} converges to LL, and by Step 1 its nn-th term is a1+tna_{1}+t_{n}. By claim 1 of Arithmetic of Limits of Real Sequences, applied to the constant sequence with every term equal to βˆ’a1-a_{1} and to (a1+tn)n∈N(a_{1}+t_{n})_{n\in\mathbb{N}}, the sequence with nn-th term βˆ’a1+(a1+tn)=tn-a_{1}+(a_{1}+t_{n})=t_{n} converges to βˆ’a1+L-a_{1}+L. Hence βˆ‘k=1∞bk\sum_{k=1}^{\infty}b_{k} converges, with sum βˆ’a1+L-a_{1}+L, and then a1+βˆ‘k=1∞bk=a1+(βˆ’a1+L)=L=βˆ‘k=1∞aka_{1}+\sum_{k=1}^{\infty}b_{k}=a_{1}+(-a_{1}+L)=L=\sum_{k=1}^{\infty}a_{k}, again the displayed identity.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…