TheoremBase

Proof of The Reproducing Identity for the Fejer Kernels of the Torus

lemmalem:fejer-kernel-reproducing-torus-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
· 7,168 chars · 15 deps · depth 28 Reason: Proof of the reproducing identity (Block D).

The one-variable identity is the cosine addition formula applied to the cosine sum defining the Fejer kernel, with the symmetric index range split into a negative block, the zero term and a positive block; the product identity follows by generalized distributivity, and symmetry is read off from it.

Proof

Each result cited is universally quantified over the data in its own statement. Throughout, ι\iota denotes the canonical map from N\mathbb{N} to R\mathbb{R}, written explicitly where the distinction between a natural number and its image matters; so the integer aN1a-N-1 of the statement is ι(a)ι(N)1\iota(a)-\iota(N)-1. Let 2=1+12=1+1, and let cos\cos, sin\sin, π\pi and the maps Cm,SmC_{m},S_{m} for mZm\in\mathbb{Z} be as in Cell Integrals of the Trigonometric Monomials, so that Cm(t)=cos(2πmt)C_{m}(t)=\cos(2\pi mt) and Sm(t)=sin(2πmt)S_{m}(t)=\sin(2\pi mt), and let 2\sqrt{2} be the nonnegative real number with 22=2\sqrt{2}\sqrt{2}=2 fixed in The Trigonometric System on the Torus; by The Trigonometric System on the Torus §one-dimensional, ϕ0(t)=1\phi_{0}(t)=1, ϕm=2Cm\phi_{m}=\sqrt{2}\,C_{m} for 0<m0<m and ϕm=2Sm\phi_{m}=\sqrt{2}\,S_{-m} for m<0m<0.

Claim 1. Fix t,sRt,s\in\mathbb{R} and put r=tsr=t-s.

Step 1: the kernel as a cosine sum. By its definition in The One-Dimensional Fejer Kernel: Regularity, Nonnegativity, Mass and Far-Field Decay, FN(r)=1N(N+2m=1N(Nm)cos(2πmr))F_{N}(r)=\tfrac{1}{N}\bigl(N+2\sum_{m=1}^{N}(N-m)\cos(2\pi mr)\bigr). Distributing 1N\tfrac{1}{N} over the two terms, using 1NN=1\tfrac{1}{N}N=1, and applying the homogeneity of finite sums, claim 3 of Properties of Finite Sums, twice to move the factor 2N\tfrac{2}{N} inside the sum, gives

FN(r)=1+m=1Ncmcos(2πmr),cm=2(Nm)N=2(1mN)(m[N]).F_{N}(r)=1+\sum_{m=1}^{N}c_{m}\cos(2\pi mr),\qquad c_{m}=\frac{2(N-m)}{N}=2\Bigl(1-\frac{m}{N}\Bigr)\quad(m\in[N]).

Step 2: the addition formula. Let mNm\in\mathbb{N}, read in R\mathbb{R} as ι(m)\iota(m), so that 0<ι(m)0<\iota(m) and ι(m)<0-\iota(m)<0 by claim 1 of Arithmetic, Order and Discreteness of the Integers, with ι(m)Z-\iota(m)\in\mathbb{Z} by claim 2 of that lemma. Since 2πmr=2πmt+(2πms)2\pi mr=2\pi mt+(-2\pi ms), the addition formula for the cosine, Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine §addition, applied with x=2πmtx=2\pi mt and y=2πmsy=-2\pi ms, followed by the parity identities Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine §parity, gives

cos(2πmr)=cos(2πmt)cos(2πms)+sin(2πmt)sin(2πms)=Cm(t)Cm(s)+Sm(t)Sm(s).\cos(2\pi mr)=\cos(2\pi mt)\cos(2\pi ms)+\sin(2\pi mt)\sin(2\pi ms)=C_{m}(t)C_{m}(s)+S_{m}(t)S_{m}(s).

By the sign information just recorded, ϕm=2Cm\phi_{m}=\sqrt{2}\,C_{m} and ϕm=2Sm\phi_{-m}=\sqrt{2}\,S_{m}, the latter because (ι(m))=ι(m)-(-\iota(m))=\iota(m). Hence, using 22=2\sqrt{2}\sqrt{2}=2,

ϕm(t)ϕm(s)+ϕm(t)ϕm(s)=2(Cm(t)Cm(s)+Sm(t)Sm(s))=2cos(2πmr).\phi_{m}(t)\phi_{m}(s)+\phi_{-m}(t)\phi_{-m}(s)=2\bigl(C_{m}(t)C_{m}(s)+S_{m}(t)S_{m}(s)\bigr)=2\cos(2\pi mr).

Step 3: splitting the sum. Let g:[2N+1]Rg:[2N+1]\to\mathbb{R} be the map g(a)=wN,aϕaN1(t)ϕaN1(s)g(a)=w_{N,a}\,\phi_{a-N-1}(t)\,\phi_{a-N-1}(s), so that the right-hand side of claim 1 is a=12N+1g(a)\sum_{a=1}^{2N+1}g(a). Since 2N+1=N+(N+1)2N+1=N+(N+1), Splitting a Finite Sum at an Index, applied with m=Nm=N and n=N+1n=N+1 there, gives

a=12N+1g(a)=a=1Ng(a)+j=1N+1g(N+j).\sum_{a=1}^{2N+1}g(a)=\sum_{a=1}^{N}g(a)+\sum_{j=1}^{N+1}g(N+j).

Since N+1=1+NN+1=1+N by claim 4 of Arithmetic of Addition on the Natural Numbers, the same lemma applied with m=1m=1 and n=Nn=N there to the map jg(N+j)j\mapsto g(N+j) on [N+1][N+1], together with k=11ak=a1\sum_{k=1}^{1}a_{k}=a_{1} from claim 1 of Properties of Finite Sums and the associativity N+(1+j)=(N+1)+jN+(1+j)=(N+1)+j from claim 3 of Arithmetic of Addition on the Natural Numbers, gives

j=1N+1g(N+j)=g(N+1)+j=1Ng(N+1+j).\sum_{j=1}^{N+1}g(N+j)=g(N+1)+\sum_{j=1}^{N}g(N+1+j).

Step 4: the three pieces. For the middle term, ι(N+1)=ι(N)+1\iota(N+1)=\iota(N)+1 by claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field, so the integer attached to a=N+1a=N+1 is 00; hence wN,N+1=10N=1w_{N,N+1}=1-\tfrac{|0|}{N}=1, because 0=0|0|=0 by Absolute Value in an Ordered Field, and g(N+1)=ϕ0(t)ϕ0(s)=1g(N+1)=\phi_{0}(t)\phi_{0}(s)=1.

Let j[N]j\in[N]. By claims 1 and 4 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field, ι(N+1+j)=ι(N)+1+ι(j)\iota(N+1+j)=\iota(N)+1+\iota(j), so the integer attached to a=N+1+ja=N+1+j is ι(j)\iota(j); it is positive by claim 3 of that lemma, so ι(j)=ι(j)|\iota(j)|=\iota(j) by Absolute Value in an Ordered Field. Hence g(N+1+j)=(1jN)ϕj(t)ϕj(s)g(N+1+j)=\bigl(1-\tfrac{j}{N}\bigr)\phi_{j}(t)\phi_{j}(s).

For the first piece, let σN:[N][N]\sigma_{N}:[N]\to[N] be the reversing bijection of Reversal of a Finite Sum §map, so that ι(σN(a))=ι(N)+1ι(a)\iota(\sigma_{N}(a))=\iota(N)+1-\iota(a) for a[N]a\in[N]; the integer attached to σN(a)\sigma_{N}(a) is therefore ι(a)-\iota(a), and ι(a)=ι(a)=ι(a)|-\iota(a)|=|\iota(a)|=\iota(a) by claim 2 of Properties of the Absolute Value in an Ordered Field and Absolute Value in an Ordered Field, the number ι(a)\iota(a) being positive by claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field. Hence g(σN(a))=(1aN)ϕa(t)ϕa(s)g(\sigma_{N}(a))=\bigl(1-\tfrac{a}{N}\bigr)\phi_{-a}(t)\phi_{-a}(s), and Reversal of a Finite Sum §sum gives

a=1Ng(a)=a=1Ng(σN(a))=a=1N(1aN)ϕa(t)ϕa(s).\sum_{a=1}^{N}g(a)=\sum_{a=1}^{N}g(\sigma_{N}(a))=\sum_{a=1}^{N}\Bigl(1-\frac{a}{N}\Bigr)\phi_{-a}(t)\phi_{-a}(s).

Step 5: assembling. Combining Steps 3 and 4 and rearranging the three real summands by the commutativity and associativity of addition,

a=12N+1g(a)=1+(a=1N(1aN)ϕa(t)ϕa(s)+a=1N(1aN)ϕa(t)ϕa(s)).\sum_{a=1}^{2N+1}g(a)=1+\Bigl(\sum_{a=1}^{N}\Bigl(1-\frac{a}{N}\Bigr)\phi_{-a}(t)\phi_{-a}(s)+\sum_{a=1}^{N}\Bigl(1-\frac{a}{N}\Bigr)\phi_{a}(t)\phi_{a}(s)\Bigr).

By the additivity of finite sums, claim 2 of Properties of Finite Sums, the two sums in parentheses combine into a=1N(1aN)(ϕa(t)ϕa(s)+ϕa(t)ϕa(s))\sum_{a=1}^{N}\bigl(1-\tfrac{a}{N}\bigr)\bigl(\phi_{-a}(t)\phi_{-a}(s)+\phi_{a}(t)\phi_{a}(s)\bigr), after factoring the common coefficient by distributivity. By Step 2 its aath summand equals (1aN)2cos(2πar)=cacos(2πar)\bigl(1-\tfrac{a}{N}\bigr)\,2\cos(2\pi ar)=c_{a}\cos(2\pi ar). Two finite sums whose summands agree at every index are equal, so

a=12N+1g(a)=1+a=1Ncacos(2πar)=FN(r)\sum_{a=1}^{2N+1}g(a)=1+\sum_{a=1}^{N}c_{a}\cos(2\pi ar)=F_{N}(r)

by Step 1. This proves claim 1.

Claim 2. Fix x,yRnx,y\in\mathbb{R}^{n}. By the definition of ΦN\Phi_{N} and the coordinatewise formation of the difference, (xy)i=xiyi(x-y)_{i}=x_{i}-y_{i} for every i[n]i\in[n] and ΦN(xy)=i=1nFN(xiyi)\Phi_{N}(x-y)=\prod_{i=1}^{n}F_{N}(x_{i}-y_{i}). For i[n]i\in[n] and a[2N+1]a\in[2N+1] put dia=wN,aϕaN1(xi)ϕaN1(yi)d_{ia}=w_{N,a}\,\phi_{a-N-1}(x_{i})\,\phi_{a-N-1}(y_{i}), which defines an nn-tuple dd of (2N+1)(2N+1)-tuples of real numbers. By claim 1, FN(xiyi)=a=12N+1diaF_{N}(x_{i}-y_{i})=\sum_{a=1}^{2N+1}d_{ia} for every i[n]i\in[n], so Generalized Distributivity: Expanding a Product of Finite Sums, applied to dd with m=2N+1m=2N+1 there and with the dimension nn as its nn, gives

ΦN(xy)=i=1n(a=12N+1dia)=a[2N+1]n i=1ndiai.\Phi_{N}(x-y)=\prod_{i=1}^{n}\Bigl(\sum_{a=1}^{2N+1}d_{ia}\Bigr)=\sum_{a\in[2N+1]^{n}}\ \prod_{i=1}^{n}d_{i\,a_{i}} .

Fix a[2N+1]na\in[2N+1]^{n}. Since k(a)i=aiN1k(a)_{i}=a_{i}-N-1 for every i[n]i\in[n], two applications of the multiplicativity of finite products, claim 2 of Properties of Finite Products, give

i=1ndiai=(i=1nwN,ai)(i=1nϕk(a)i(xi))(i=1nϕk(a)i(yi))=WN,aek(a)(x)ek(a)(y),\prod_{i=1}^{n}d_{i\,a_{i}}=\Bigl(\prod_{i=1}^{n}w_{N,a_{i}}\Bigr)\Bigl(\prod_{i=1}^{n}\phi_{k(a)_{i}}(x_{i})\Bigr)\Bigl(\prod_{i=1}^{n}\phi_{k(a)_{i}}(y_{i})\Bigr)=W_{N,a}\,e_{k(a)}(x)\,e_{k(a)}(y),

the last two products being ek(a)(x)e_{k(a)}(x) and ek(a)(y)e_{k(a)}(y) by The Trigonometric System on the Torus §system. Two sums over [2N+1]n[2N+1]^{n} whose summands agree at every index are equal, which proves claim 2.

Claim 3. Let x,yRnx,y\in\mathbb{R}^{n}. By claim 2, applied once to the pair x,yx,y and once to the pair y,xy,x, the numbers ΦN(xy)\Phi_{N}(x-y) and ΦN(yx)\Phi_{N}(y-x) are sums over [2N+1]n[2N+1]^{n} whose summands WN,aek(a)(x)ek(a)(y)W_{N,a}\,e_{k(a)}(x)\,e_{k(a)}(y) and WN,aek(a)(y)ek(a)(x)W_{N,a}\,e_{k(a)}(y)\,e_{k(a)}(x) agree at every aa by the commutativity of multiplication in R\mathbb{R}; hence they are equal.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…