TheoremBase

Both identities are proved by induction on the order at a fixed point. The Dirichlet step uses the sine-cosine product formula together with the oddness of the sine, and the Fejer step uses the Dirichlet identity for the increment together with the factorisation of a difference of squared sines.

Proof

Each result cited is universally quantified over the data in its own statement. Write 3=2+13=2+1. Fix t∈Rt\in\mathbb{R}; since tt is arbitrary, proving each identity for every N∈NN\in\mathbb{N} at this tt proves the claims. Abbreviate, for N∈NN\in\mathbb{N},

DN=1+2βˆ‘m=1Ncos⁑(2Ο€mt),GN=N+2βˆ‘m=1N(Nβˆ’m)cos⁑(2Ο€mt).D_{N}=1+2\sum_{m=1}^{N}\cos(2\pi mt), \qquad G_{N}=N+2\sum_{m=1}^{N}(N-m)\cos(2\pi mt).

Both claims are proved by applying Principle of Induction for the Natural Numbers to the set of those N∈NN\in\mathbb{N} for which the identity in question holds at this tt.

Claim 1. Let TT be the set of N∈NN\in\mathbb{N} satisfying DNsin⁑(Ο€t)=sin⁑((2N+1)Ο€t)D_{N}\sin(\pi t)=\sin((2N+1)\pi t).

The base point. By claim 1 of Properties of Finite Sums a sum with one summand equals that summand, so βˆ‘m=11cos⁑(2Ο€mt)=cos⁑(2Ο€t)\sum_{m=1}^{1}\cos(2\pi mt)=\cos(2\pi t) and D1=1+2cos⁑(2Ο€t)D_{1}=1+2\cos(2\pi t). Product-to-Sum Formulas for Sine and Cosine (iii), taken with u=Ο€tu=\pi t and v=2Ο€tv=2\pi t, gives

sin⁑(3Ο€t)+sin⁑(βˆ’Ο€t)=2sin⁑(Ο€t)cos⁑(2Ο€t),\sin(3\pi t)+\sin(-\pi t)=2\sin(\pi t)\cos(2\pi t),

since Ο€t+2Ο€t=3Ο€t\pi t+2\pi t=3\pi t and Ο€tβˆ’2Ο€t=βˆ’Ο€t\pi t-2\pi t=-\pi t. By Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine (ii) the second term on the left is βˆ’sin⁑(Ο€t)-\sin(\pi t), so 2cos⁑(2Ο€t)sin⁑(Ο€t)=sin⁑(3Ο€t)βˆ’sin⁑(Ο€t)2\cos(2\pi t)\sin(\pi t)=\sin(3\pi t)-\sin(\pi t) and therefore

D1sin⁑(Ο€t)=sin⁑(Ο€t)+2cos⁑(2Ο€t)sin⁑(Ο€t)=sin⁑(3Ο€t).D_{1}\sin(\pi t)=\sin(\pi t)+2\cos(2\pi t)\sin(\pi t)=\sin(3\pi t).

Since 2β‹…1+1=32\cdot 1+1=3, this says 1∈T1\in T.

The inductive step. Let N∈TN\in T. By the recursion in claim 1 of Properties of Finite Sums,

βˆ‘m=1N+1cos⁑(2Ο€mt)=βˆ‘m=1Ncos⁑(2Ο€mt)+cos⁑(2Ο€(N+1)t),\sum_{m=1}^{N+1}\cos(2\pi mt)=\sum_{m=1}^{N}\cos(2\pi mt)+\cos\bigl(2\pi(N+1)t\bigr),

so DN+1=DN+2cos⁑(2Ο€(N+1)t)D_{N+1}=D_{N}+2\cos(2\pi(N+1)t), and hence, by the inductive hypothesis,

DN+1sin⁑(Ο€t)=sin⁑((2N+1)Ο€t)+2cos⁑(2Ο€(N+1)t)sin⁑(Ο€t).D_{N+1}\sin(\pi t)=\sin\bigl((2N+1)\pi t\bigr)+2\cos\bigl(2\pi(N+1)t\bigr)\sin(\pi t).

Product-to-Sum Formulas for Sine and Cosine (iii), taken with u=Ο€tu=\pi t and v=2Ο€(N+1)tv=2\pi(N+1)t, gives

sin⁑((2N+3)Ο€t)+sin⁑(βˆ’(2N+1)Ο€t)=2sin⁑(Ο€t)cos⁑(2Ο€(N+1)t),\sin\bigl((2N+3)\pi t\bigr)+\sin\bigl(-(2N+1)\pi t\bigr)=2\sin(\pi t)\cos\bigl(2\pi(N+1)t\bigr),

since Ο€t+2Ο€(N+1)t=(2N+3)Ο€t\pi t+2\pi(N+1)t=(2N+3)\pi t and Ο€tβˆ’2Ο€(N+1)t=βˆ’(2N+1)Ο€t\pi t-2\pi(N+1)t=-(2N+1)\pi t; and the second term on the left equals βˆ’sin⁑((2N+1)Ο€t)-\sin((2N+1)\pi t) by Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine (ii). Substituting,

DN+1sin⁑(Ο€t)=sin⁑((2N+1)Ο€t)+sin⁑((2N+3)Ο€t)βˆ’sin⁑((2N+1)Ο€t)=sin⁑((2N+3)Ο€t).D_{N+1}\sin(\pi t)=\sin\bigl((2N+1)\pi t\bigr)+\sin\bigl((2N+3)\pi t\bigr)-\sin\bigl((2N+1)\pi t\bigr)=\sin\bigl((2N+3)\pi t\bigr).

Since 2(N+1)+1=2N+32(N+1)+1=2N+3, this says N+1∈TN+1\in T. By Principle of Induction for the Natural Numbers, applied to the inductive set TT, one has T=NT=\mathbb{N}, which is claim 1.

Claim 2. Let Tβ€²T' be the set of N∈NN\in\mathbb{N} satisfying GN(sin⁑(Ο€t))2=(sin⁑(NΟ€t))2G_{N}(\sin(\pi t))^{2}=(\sin(N\pi t))^{2}.

The base point. By claim 1 of Properties of Finite Sums a sum with one summand equals that summand, so βˆ‘m=11(1βˆ’m)cos⁑(2Ο€mt)=(1βˆ’1)cos⁑(2Ο€t)=0\sum_{m=1}^{1}(1-m)\cos(2\pi mt)=(1-1)\cos(2\pi t)=0, the last step by claim 1 of Zero Products and Elementary Identities in a Field. Hence G1=1G_{1}=1 and G1(sin⁑(Ο€t))2=(sin⁑(Ο€t))2G_{1}(\sin(\pi t))^{2}=(\sin(\pi t))^{2}, so 1∈Tβ€²1\in T'.

Consecutive sums. Let N∈NN\in\mathbb{N}. The summand of GN+1G_{N+1} at m=N+1m=N+1 carries the factor (N+1)βˆ’(N+1)=0(N+1)-(N+1)=0 and so vanishes, by claim 1 of Zero Products and Elementary Identities in a Field; so the recursion in claim 1 of Properties of Finite Sums gives

βˆ‘m=1N+1((N+1)βˆ’m)cos⁑(2Ο€mt)=βˆ‘m=1N((N+1)βˆ’m)cos⁑(2Ο€mt).\sum_{m=1}^{N+1}\bigl((N+1)-m\bigr)\cos(2\pi mt)=\sum_{m=1}^{N}\bigl((N+1)-m\bigr)\cos(2\pi mt).

For every m∈[N]m\in[N] one has ((N+1)βˆ’m)βˆ’(Nβˆ’m)=1((N+1)-m)-(N-m)=1, so

((N+1)βˆ’m)cos⁑(2Ο€mt)+(βˆ’1)(Nβˆ’m)cos⁑(2Ο€mt)=cos⁑(2Ο€mt)\bigl((N+1)-m\bigr)\cos(2\pi mt)+(-1)(N-m)\cos(2\pi mt)=\cos(2\pi mt)

by the distributivity of multiplication over addition in R\mathbb{R}. Summing over m∈[N]m\in[N] and using claims 2 and 3 of Properties of Finite Sums, the first for additivity and the second for the scalar βˆ’1-1,

βˆ‘m=1N((N+1)βˆ’m)cos⁑(2Ο€mt)βˆ’βˆ‘m=1N(Nβˆ’m)cos⁑(2Ο€mt)=βˆ‘m=1Ncos⁑(2Ο€mt).\sum_{m=1}^{N}\bigl((N+1)-m\bigr)\cos(2\pi mt)-\sum_{m=1}^{N}(N-m)\cos(2\pi mt)=\sum_{m=1}^{N}\cos(2\pi mt).

Since GN+1βˆ’GNG_{N+1}-G_{N} equals 11 plus twice the left-hand side, by the two displays and the definitions of GN+1G_{N+1} and GNG_{N}, it follows that

GN+1=GN+1+2βˆ‘m=1Ncos⁑(2Ο€mt)=GN+DN.G_{N+1}=G_{N}+1+2\sum_{m=1}^{N}\cos(2\pi mt)=G_{N}+D_{N}.

The inductive step. Let N∈Tβ€²N\in T'. By the relation just proved, by the inductive hypothesis, and by claim 1 of the present lemma in the form DN(sin⁑(Ο€t))2=(DNsin⁑(Ο€t))sin⁑(Ο€t)D_{N}(\sin(\pi t))^{2}=\bigl(D_{N}\sin(\pi t)\bigr)\sin(\pi t),

GN+1(sin⁑(Ο€t))2=(sin⁑(NΟ€t))2+sin⁑((2N+1)Ο€t)sin⁑(Ο€t).G_{N+1}\bigl(\sin(\pi t)\bigr)^{2} =\bigl(\sin(N\pi t)\bigr)^{2}+\sin\bigl((2N+1)\pi t\bigr)\sin(\pi t).

Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine (v), taken with x=(N+1)Ο€tx=(N+1)\pi t and y=NΟ€ty=N\pi t, for which x+y=(2N+1)Ο€tx+y=(2N+1)\pi t and xβˆ’y=Ο€tx-y=\pi t, gives

(sin⁑((N+1)Ο€t))2βˆ’(sin⁑(NΟ€t))2=sin⁑((2N+1)Ο€t)sin⁑(Ο€t).\bigl(\sin((N+1)\pi t)\bigr)^{2}-\bigl(\sin(N\pi t)\bigr)^{2}=\sin\bigl((2N+1)\pi t\bigr)\sin(\pi t).

Substituting this into the previous display leaves GN+1(sin⁑(Ο€t))2=(sin⁑((N+1)Ο€t))2G_{N+1}(\sin(\pi t))^{2}=(\sin((N+1)\pi t))^{2}, so N+1∈Tβ€²N+1\in T'. By Principle of Induction for the Natural Numbers, applied to the inductive set Tβ€²T', one has Tβ€²=NT'=\mathbb{N}, which is claim 2.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…