Each result cited is universally quantified over the data in its own statement.
Notation. ϕ a \phi_{a} ϕ a (a ∈ Z a\in\mathbb{Z} a ∈ Z ) is the one-dimensional system of The Trigonometric System on the Torus §one-dimensional , so that ψ k ( x ) = ∏ i = 1 n ϕ k i ( x i ) \psi_{k}(x)=\prod_{i=1}^{n}\phi_{k_{i}}(x_{i}) ψ k ( x ) = ∏ i = 1 n ϕ k i ( x i ) by The Trigonometric System on the Torus §system ; 2 2 = 2 \sqrt{2}\sqrt{2}=2 2 2 = 2 by the definition of 2 \sqrt{2} 2 recorded there. Natural numbers are read in R \mathbb{R} R through the canonical map ι \iota ι of The Real Numbers: Standing Notation and Background §numbers ; by Properties of the Canonical Map from the Natural Numbers to an Ordered Field §additive , Properties of the Canonical Map from the Natural Numbers to an Ordered Field §multiplicative and Properties of the Canonical Map from the Natural Numbers to an Ordered Field §base-step , the side L = 2 M + 1 L=2M+1 L = 2 M + 1 read in R \mathbb{R} R is 2 M + 1 2M+1 2 M + 1 formed in R \mathbb{R} R with M M M read in R \mathbb{R} R , so L − 1 = 2 M L-1=2M L − 1 = 2 M . Natural numbers lie in Z \mathbb{Z} Z by Arithmetic, Order, Discreteness and Intervals of the Integers §sign , and Z \mathbb{Z} Z is closed under + + + , − - − and negation by Arithmetic, Order, Discreteness and Intervals of the Integers §ring . Put
E = { a ∈ Z : − M ≤ a ≤ M } , D = { ν ∈ Z : 0 ≤ ν ≤ 2 M } , P = { b ∈ Z : 1 ≤ b ≤ M } , E=\{a\in\mathbb{Z}:-M\le a\le M\},\qquad D=\{\nu\in\mathbb{Z}:0\le\nu\le 2M\},\qquad P=\{b\in\mathbb{Z}:1\le b\le M\}, E = { a ∈ Z : − M ≤ a ≤ M } , D = { ν ∈ Z : 0 ≤ ν ≤ 2 M } , P = { b ∈ Z : 1 ≤ b ≤ M } ,
nonempty finite sets by Arithmetic, Order, Discreteness and Intervals of the Integers §intervals . Points of Z n ⊆ R n \mathbb{Z}^{n}\subseteq\mathbb{R}^{n} Z n ⊆ R n are maps [ n ] → R [n]\to\mathbb{R} [ n ] → R by Euclidean Points as Tuples of Real Numbers ; hence Γ M \Gamma_{M} Γ M is the set E n E^{n} E n of n n n -tuples in E E E and W L W_{L} W L is the set D n D^{n} D n of n n n -tuples in D D D , in the sense of Tuples in a Set . For y ∈ R y\in\mathbb{R} y ∈ R we write y / L = y L − 1 y/L=yL^{-1} y / L = y L − 1 .
Step 1 (Dirichlet values). For r ∈ Z r\in\mathbb{Z} r ∈ Z with − 2 M ≤ r ≤ 2 M -2M\le r\le 2M − 2 M ≤ r ≤ 2 M put K ( r ) = 1 + 2 ∑ a = 1 M cos ( 2 π a r / L ) K(r)=1+2\sum_{a=1}^{M}\cos(2\pi a r/L) K ( r ) = 1 + 2 ∑ a = 1 M cos ( 2 πa r / L ) . Then K ( 0 ) = L K(0)=L K ( 0 ) = L and K ( r ) = 0 K(r)=0 K ( r ) = 0 for r ≠ 0 r\neq0 r = 0 . If r = 0 r=0 r = 0 , each summand is cos 0 = 1 \cos0=1 cos 0 = 1 by Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine §zero ; since [ M ] [M] [ M ] has M M M elements (claim 1 of Basic Properties of Finite Sets ), Real Sums over a Finite Index Set: Comparison, Nonnegativity, Monotonicity, Term Bounds, Absolute Values, Counting and Limits §count and claim 1 of Properties of a Sum over a Finite Index Set give ∑ a = 1 M 1 = M \sum_{a=1}^{M}1=M ∑ a = 1 M 1 = M , so K ( 0 ) = 1 + 2 M = L K(0)=1+2M=L K ( 0 ) = 1 + 2 M = L . Let r ≠ 0 r\neq0 r = 0 . By The Dirichlet and Fejer Kernel Identities §dirichlet with N = M N=M N = M and t = r / L t=r/L t = r / L ,
K ( r ) sin ( π r / L ) = sin ( L π r / L ) = sin ( π r ) . K(r)\,\sin(\pi r/L)=\sin(L\pi r/L)=\sin(\pi r). K ( r ) sin ( π r / L ) = sin ( L π r / L ) = sin ( π r ) .
By Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine §double-angle and Quarter-Turn Identities and Periodicity of Sine and Cosine §integer (with m = r m=r m = r ), 1 − 2 ( sin ( π r ) ) 2 = cos ( 2 π r ) = 1 1-2(\sin(\pi r))^{2}=\cos(2\pi r)=1 1 − 2 ( sin ( π r ) ) 2 = cos ( 2 π r ) = 1 , so ( sin ( π r ) ) 2 = 0 (\sin(\pi r))^{2}=0 ( sin ( π r ) ) 2 = 0 and sin ( π r ) = 0 \sin(\pi r)=0 sin ( π r ) = 0 . On the other hand π = 2 x 0 > 0 \pi=2x_{0}>0 π = 2 x 0 > 0 by The Number Pi §pi and The Least Positive Zero of the Cosine §least-zero . If 0 < r 0<r 0 < r , then 0 < π r / L < π 0<\pi r/L<\pi 0 < π r / L < π because r ≤ 2 M < L r\le 2M<L r ≤ 2 M < L , so 0 < sin ( π r / L ) 0<\sin(\pi r/L) 0 < sin ( π r / L ) by Quarter-Turn Identities and Periodicity of Sine and Cosine §positive . If r < 0 r<0 r < 0 , the same applies to − r -r − r , and sin ( π r / L ) = − sin ( π ( − r ) / L ) < 0 \sin(\pi r/L)=-\sin(\pi(-r)/L)<0 sin ( π r / L ) = − sin ( π ( − r ) / L ) < 0 by Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine §parity . In both cases sin ( π r / L ) ≠ 0 \sin(\pi r/L)\neq0 sin ( π r / L ) = 0 , hence K ( r ) = 0 K(r)=0 K ( r ) = 0 .
Step 2 (sums over E E E ). For every map g : E → R g:E\to\mathbb{R} g : E → R ,
∑ a ∈ E g ( a ) = g ( 0 ) + ∑ b = 1 M ( g ( b ) + g ( − b ) ) . \sum_{a\in E}g(a)=g(0)+\sum_{b=1}^{M}\bigl(g(b)+g(-b)\bigr). a ∈ E ∑ g ( a ) = g ( 0 ) + b = 1 ∑ M ( g ( b ) + g ( − b ) ) .
By Arithmetic, Order, Discreteness and Intervals of the Integers §sign and Arithmetic, Order, Discreteness and Intervals of the Integers §discrete , E E E is the union of the pairwise disjoint nonempty sets { 0 } \{0\} { 0 } , P P P and − P = { − b : b ∈ P } -P=\{-b:b\in P\} − P = { − b : b ∈ P } . By Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §disjoint-union (twice) and claim 1 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set , ∑ a ∈ E g ( a ) = g ( 0 ) + ∑ b ∈ P g ( b ) + ∑ a ∈ − P g ( a ) \sum_{a\in E}g(a)=g(0)+\sum_{b\in P}g(b)+\sum_{a\in -P}g(a) ∑ a ∈ E g ( a ) = g ( 0 ) + ∑ b ∈ P g ( b ) + ∑ a ∈ − P g ( a ) . The map b ↦ − b b\mapsto-b b ↦ − b is a bijection P → − P P\to-P P → − P , so claim 2 of Properties of a Sum over a Finite Index Set turns the last sum into ∑ b ∈ P g ( − b ) \sum_{b\in P}g(-b) ∑ b ∈ P g ( − b ) , and claim 3 of that lemma combines the two sums over P P P into ∑ b ∈ P ( g ( b ) + g ( − b ) ) \sum_{b\in P}(g(b)+g(-b)) ∑ b ∈ P ( g ( b ) + g ( − b )) . Finally the restriction of ι \iota ι to [ M ] [M] [ M ] is a bijection onto P P P : it is injective by Properties of the Canonical Map from the Natural Numbers to an Ordered Field §injective ; it maps into P P P by Properties of the Canonical Map from the Natural Numbers to an Ordered Field §lower-bound and Properties of the Canonical Map from the Natural Numbers to an Ordered Field §monotone ; and every b ∈ P b\in P b ∈ P equals ι ( k ) \iota(k) ι ( k ) for some k ∈ N k\in\mathbb{N} k ∈ N by Arithmetic, Order, Discreteness and Intervals of the Integers §sign , where k ≤ M k\le M k ≤ M since M < k M<k M < k would give M < b M<b M < b by Properties of the Canonical Map from the Natural Numbers to an Ordered Field §monotone (and Properties of the Order on the Natural Numbers §trichotomy ). So claims 2 and 1 of Properties of a Sum over a Finite Index Set give ∑ b ∈ P ( g ( b ) + g ( − b ) ) = ∑ b = 1 M ( g ( b ) + g ( − b ) ) \sum_{b\in P}(g(b)+g(-b))=\sum_{b=1}^{M}(g(b)+g(-b)) ∑ b ∈ P ( g ( b ) + g ( − b )) = ∑ b = 1 M ( g ( b ) + g ( − b )) .
Step 3 (sample sums). For m ∈ Z m\in\mathbb{Z} m ∈ Z with − 2 M ≤ m ≤ 2 M -2M\le m\le 2M − 2 M ≤ m ≤ 2 M , put c m = ∑ ν ∈ E cos ( 2 π m ν / L ) c_{m}=\sum_{\nu\in E}\cos(2\pi m\nu/L) c m = ∑ ν ∈ E cos ( 2 πm ν / L ) and s m = ∑ ν ∈ E sin ( 2 π m ν / L ) s_{m}=\sum_{\nu\in E}\sin(2\pi m\nu/L) s m = ∑ ν ∈ E sin ( 2 πm ν / L ) . Then c 0 = L c_{0}=L c 0 = L , c m = 0 c_{m}=0 c m = 0 for m ≠ 0 m\neq0 m = 0 , and s m = 0 s_{m}=0 s m = 0 . By Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine §parity the summand of c m c_{m} c m takes equal values at ν \nu ν and − ν -\nu − ν , and the summand of s m s_{m} s m takes opposite values, vanishing at ν = 0 \nu=0 ν = 0 by Values at Zero, Parity, Addition and Double-Angle Identities for Sine and Cosine §zero . By Step 2 and claim 3 of Properties of Finite Sums , c m = cos 0 + 2 ∑ ν = 1 M cos ( 2 π ν m / L ) = K ( m ) c_{m}=\cos0+2\sum_{\nu=1}^{M}\cos(2\pi\nu m/L)=K(m) c m = cos 0 + 2 ∑ ν = 1 M cos ( 2 π ν m / L ) = K ( m ) , which is given by Step 1; and s m = 0 + ∑ ν = 1 M 0 = 0 s_{m}=0+\sum_{\nu=1}^{M}0=0 s m = 0 + ∑ ν = 1 M 0 = 0 by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing (with claim 1 of Properties of a Sum over a Finite Index Set ).
Step 4 (shifting the samples). Let h : R → R h:\mathbb{R}\to\mathbb{R} h : R → R satisfy h ( x + 1 ) = h ( x ) h(x+1)=h(x) h ( x + 1 ) = h ( x ) for every x ∈ R x\in\mathbb{R} x ∈ R . Then ∑ ν ∈ D h ( ν / L ) = ∑ ν ∈ E h ( ν / L ) \sum_{\nu\in D}h(\nu/L)=\sum_{\nu\in E}h(\nu/L) ∑ ν ∈ D h ( ν / L ) = ∑ ν ∈ E h ( ν / L ) . Define τ : E → D \tau:E\to D τ : E → D by τ ( ν ) = ν \tau(\nu)=\nu τ ( ν ) = ν if 0 ≤ ν 0\le\nu 0 ≤ ν and τ ( ν ) = ν + L \tau(\nu)=\nu+L τ ( ν ) = ν + L if ν < 0 \nu<0 ν < 0 , and ρ : D → E \rho:D\to E ρ : D → E by ρ ( s ) = s \rho(s)=s ρ ( s ) = s if s ≤ M s\le M s ≤ M and ρ ( s ) = s − L \rho(s)=s-L ρ ( s ) = s − L if M < s M<s M < s ; all these values are integers by Arithmetic, Order, Discreteness and Intervals of the Integers §ring . Below we add a number to both sides of an inequality and chain inequalities by the order rules of Elementary Order Arithmetic in an Ordered Field (in force by The Real Numbers: Standing Notation and Background §background ), and we use L = 2 M + 1 L=2M+1 L = 2 M + 1 (Notation paragraph) and 0 < M 0<M 0 < M , which holds by Arithmetic, Order, Discreteness and Intervals of the Integers §sign since M M M lies in the image of N \mathbb{N} N ; in particular − M ≤ 0 ≤ M ≤ 2 M -M\le0\le M\le 2M − M ≤ 0 ≤ M ≤ 2 M . Since the order of R \mathbb{R} R is total, every ν ∈ E \nu\in E ν ∈ E falls under exactly one of the cases (a), (b), and every s ∈ D s\in D s ∈ D under exactly one of (c), (d).
(a) ν ∈ E \nu\in E ν ∈ E , 0 ≤ ν 0\le\nu 0 ≤ ν : then τ ( ν ) = ν \tau(\nu)=\nu τ ( ν ) = ν satisfies 0 ≤ ν ≤ M ≤ 2 M 0\le\nu\le M\le 2M 0 ≤ ν ≤ M ≤ 2 M , so it lies in D D D , and since τ ( ν ) ≤ M \tau(\nu)\le M τ ( ν ) ≤ M we get ρ ( τ ( ν ) ) = ν \rho(\tau(\nu))=\nu ρ ( τ ( ν )) = ν .
(b) ν ∈ E \nu\in E ν ∈ E , ν < 0 \nu<0 ν < 0 : then ν + 1 ≤ 0 \nu+1\le0 ν + 1 ≤ 0 by Arithmetic, Order, Discreteness and Intervals of the Integers §discrete , so − M ≤ ν ≤ − 1 -M\le\nu\le-1 − M ≤ ν ≤ − 1 , and adding L = 2 M + 1 L=2M+1 L = 2 M + 1 gives M + 1 ≤ ν + L ≤ 2 M M+1\le\nu+L\le 2M M + 1 ≤ ν + L ≤ 2 M . So τ ( ν ) = ν + L \tau(\nu)=\nu+L τ ( ν ) = ν + L lies in D D D (as 0 < M + 1 0<M+1 0 < M + 1 ), and since M < M + 1 ≤ τ ( ν ) M<M+1\le\tau(\nu) M < M + 1 ≤ τ ( ν ) we get ρ ( τ ( ν ) ) = ( ν + L ) − L = ν \rho(\tau(\nu))=(\nu+L)-L=\nu ρ ( τ ( ν )) = ( ν + L ) − L = ν .
(c) s ∈ D s\in D s ∈ D , s ≤ M s\le M s ≤ M : then − M ≤ 0 ≤ s ≤ M -M\le0\le s\le M − M ≤ 0 ≤ s ≤ M , so ρ ( s ) = s \rho(s)=s ρ ( s ) = s lies in E E E , and since 0 ≤ ρ ( s ) 0\le\rho(s) 0 ≤ ρ ( s ) we get τ ( ρ ( s ) ) = s \tau(\rho(s))=s τ ( ρ ( s )) = s .
(d) s ∈ D s\in D s ∈ D , M < s M<s M < s : then M + 1 ≤ s M+1\le s M + 1 ≤ s by Arithmetic, Order, Discreteness and Intervals of the Integers §discrete , and s ≤ 2 M s\le 2M s ≤ 2 M ; subtracting L = 2 M + 1 L=2M+1 L = 2 M + 1 gives − M ≤ s − L ≤ − 1 -M\le s-L\le-1 − M ≤ s − L ≤ − 1 . So ρ ( s ) = s − L \rho(s)=s-L ρ ( s ) = s − L lies in E E E , and since s − L ≤ − 1 < 0 s-L\le-1<0 s − L ≤ − 1 < 0 we get τ ( ρ ( s ) ) = ( s − L ) + L = s \tau(\rho(s))=(s-L)+L=s τ ( ρ ( s )) = ( s − L ) + L = s .
By (a) and (b), τ \tau τ maps E E E into D D D and ρ ∘ τ \rho\circ\tau ρ ∘ τ is the identity of E E E ; by (c) and (d), ρ \rho ρ maps D D D into E E E and τ ∘ ρ \tau\circ\rho τ ∘ ρ is the identity of D D D . So τ \tau τ is a bijection by claim 3 of Inverse of a Bijection . Since h ( τ ( ν ) / L ) h(\tau(\nu)/L) h ( τ ( ν ) / L ) is h ( ν / L ) h(\nu/L) h ( ν / L ) or h ( ( ν + L ) / L ) = h ( ν / L + 1 ) = h ( ν / L ) h((\nu+L)/L)=h(\nu/L+1)=h(\nu/L) h (( ν + L ) / L ) = h ( ν / L + 1 ) = h ( ν / L ) , claim 2 of Properties of a Sum over a Finite Index Set gives ∑ ν ∈ D h ( ν / L ) = ∑ ν ∈ E h ( τ ( ν ) / L ) = ∑ ν ∈ E h ( ν / L ) \sum_{\nu\in D}h(\nu/L)=\sum_{\nu\in E}h(\tau(\nu)/L)=\sum_{\nu\in E}h(\nu/L) ∑ ν ∈ D h ( ν / L ) = ∑ ν ∈ E h ( τ ( ν ) / L ) = ∑ ν ∈ E h ( ν / L ) .
Every ϕ a \phi_{a} ϕ a satisfies ϕ a ( x + 1 ) = ϕ a ( x ) \phi_{a}(x+1)=\phi_{a}(x) ϕ a ( x + 1 ) = ϕ a ( x ) : this is clear for a = 0 a=0 a = 0 , and for a ≠ 0 a\neq0 a = 0 it is Quarter-Turn Identities and Periodicity of Sine and Cosine §integer applied with m = a m=a m = a or m = − a m=-a m = − a , because 2 π a ( x + 1 ) = 2 π a x + 2 π a 2\pi a(x+1)=2\pi ax+2\pi a 2 πa ( x + 1 ) = 2 πa x + 2 πa . Hence so does every product ϕ a ϕ b \phi_{a}\phi_{b} ϕ a ϕ b .
Step 5 (one-dimensional orthogonality). For a , b ∈ E a,b\in E a , b ∈ E , ∑ ν ∈ D ϕ a ( ν / L ) ϕ b ( ν / L ) \sum_{\nu\in D}\phi_{a}(\nu/L)\phi_{b}(\nu/L) ∑ ν ∈ D ϕ a ( ν / L ) ϕ b ( ν / L ) equals L L L if a = b a=b a = b and 0 0 0 if a ≠ b a\neq b a = b . By Step 4 the sum equals ∑ ν ∈ E ϕ a ( x ν ) ϕ b ( x ν ) \sum_{\nu\in E}\phi_{a}(x_{\nu})\phi_{b}(x_{\nu}) ∑ ν ∈ E ϕ a ( x ν ) ϕ b ( x ν ) with x ν = ν / L x_{\nu}=\nu/L x ν = ν / L . The expression is symmetric in a a a and b b b , so it suffices to treat the following cases, in which we use Step 3 together with claims 3 and 4 of Properties of a Sum over a Finite Index Set ; all frequencies below lie between − 2 M -2M − 2 M and 2 M 2M 2 M .
(i) a = b = 0 a=b=0 a = b = 0 : the summand is 1 = cos ( 2 π ⋅ 0 ⋅ ν / L ) 1=\cos(2\pi\cdot0\cdot \nu/L) 1 = cos ( 2 π ⋅ 0 ⋅ ν / L ) , so the sum is c 0 = L c_{0}=L c 0 = L .
(ii) a = 0 < b a=0<b a = 0 < b : the sum is 2 c b = 0 \sqrt{2}\,c_{b}=0 2 c b = 0 .
(iii) a = 0 > b a=0>b a = 0 > b : the sum is 2 s − b = 0 \sqrt{2}\,s_{-b}=0 2 s − b = 0 .
(iv) a , b > 0 a,b>0 a , b > 0 : with u = 2 π a x ν u=2\pi ax_{\nu} u = 2 πa x ν , v = 2 π b x ν v=2\pi bx_{\nu} v = 2 πb x ν , Product-to-Sum Formulas for Sine and Cosine §cosine-cosine gives ϕ a ϕ b = 2 cos u cos v = cos ( 2 π ( a − b ) x ν ) + cos ( 2 π ( a + b ) x ν ) \phi_{a}\phi_{b}=2\cos u\cos v=\cos(2\pi(a-b)x_{\nu})+\cos(2\pi(a+b)x_{\nu}) ϕ a ϕ b = 2 cos u cos v = cos ( 2 π ( a − b ) x ν ) + cos ( 2 π ( a + b ) x ν ) , so the sum is c a − b + c a + b c_{a-b}+c_{a+b} c a − b + c a + b ; here 2 ≤ a + b ≤ 2 M 2\le a+b\le 2M 2 ≤ a + b ≤ 2 M , so c a + b = 0 c_{a+b}=0 c a + b = 0 , and c a − b c_{a-b} c a − b is L L L if a = b a=b a = b and 0 0 0 otherwise.
(v) a , b < 0 a,b<0 a , b < 0 : with a ′ = − a a'=-a a ′ = − a , b ′ = − b b'=-b b ′ = − b , Product-to-Sum Formulas for Sine and Cosine §sine-sine gives ϕ a ϕ b = 2 sin ( 2 π a ′ x ν ) sin ( 2 π b ′ x ν ) = cos ( 2 π ( a ′ − b ′ ) x ν ) − cos ( 2 π ( a ′ + b ′ ) x ν ) \phi_{a}\phi_{b}=2\sin(2\pi a'x_{\nu})\sin(2\pi b'x_{\nu})=\cos(2\pi(a'-b')x_{\nu})-\cos(2\pi(a'+b')x_{\nu}) ϕ a ϕ b = 2 sin ( 2 π a ′ x ν ) sin ( 2 π b ′ x ν ) = cos ( 2 π ( a ′ − b ′ ) x ν ) − cos ( 2 π ( a ′ + b ′ ) x ν ) , so the sum is c a ′ − b ′ − c a ′ + b ′ c_{a'-b'}-c_{a'+b'} c a ′ − b ′ − c a ′ + b ′ , which is L L L if a = b a=b a = b and 0 0 0 otherwise, as in (iv).
(vi) a > 0 > b a>0>b a > 0 > b : with b ′ = − b b'=-b b ′ = − b , Product-to-Sum Formulas for Sine and Cosine §sine-cosine (with u = 2 π b ′ x ν u=2\pi b'x_{\nu} u = 2 π b ′ x ν , v = 2 π a x ν v=2\pi ax_{\nu} v = 2 πa x ν ) gives ϕ a ϕ b = 2 sin ( 2 π b ′ x ν ) cos ( 2 π a x ν ) = sin ( 2 π ( b ′ + a ) x ν ) + sin ( 2 π ( b ′ − a ) x ν ) \phi_{a}\phi_{b}=2\sin(2\pi b'x_{\nu})\cos(2\pi ax_{\nu})=\sin(2\pi(b'+a)x_{\nu})+\sin(2\pi(b'-a)x_{\nu}) ϕ a ϕ b = 2 sin ( 2 π b ′ x ν ) cos ( 2 πa x ν ) = sin ( 2 π ( b ′ + a ) x ν ) + sin ( 2 π ( b ′ − a ) x ν ) , so the sum is s b ′ + a + s b ′ − a = 0 s_{b'+a}+s_{b'-a}=0 s b ′ + a + s b ′ − a = 0 , and a ≠ b a\neq b a = b .
Step 6 (one-dimensional dual orthogonality). For ν , ν ′ ∈ D \nu,\nu'\in D ν , ν ′ ∈ D , ∑ a ∈ E ϕ a ( ν / L ) ϕ a ( ν ′ / L ) \sum_{a\in E}\phi_{a}(\nu/L)\phi_{a}(\nu'/L) ∑ a ∈ E ϕ a ( ν / L ) ϕ a ( ν ′ / L ) equals L L L if ν = ν ′ \nu=\nu' ν = ν ′ and 0 0 0 if ν ≠ ν ′ \nu\neq\nu' ν = ν ′ . Put x = ν / L x=\nu/L x = ν / L , y = ν ′ / L y=\nu'/L y = ν ′ / L . For b ∈ P b\in P b ∈ P , The Trigonometric System on the Torus §one-dimensional gives ϕ b ( x ) ϕ b ( y ) = 2 cos ( 2 π b x ) cos ( 2 π b y ) \phi_{b}(x)\phi_{b}(y)=2\cos(2\pi bx)\cos(2\pi by) ϕ b ( x ) ϕ b ( y ) = 2 cos ( 2 πb x ) cos ( 2 πb y ) and ϕ − b ( x ) ϕ − b ( y ) = 2 sin ( 2 π b x ) sin ( 2 π b y ) \phi_{-b}(x)\phi_{-b}(y)=2\sin(2\pi bx)\sin(2\pi by) ϕ − b ( x ) ϕ − b ( y ) = 2 sin ( 2 πb x ) sin ( 2 πb y ) ; adding Product-to-Sum Formulas for Sine and Cosine §cosine-cosine and Product-to-Sum Formulas for Sine and Cosine §sine-sine with u = 2 π b x u=2\pi bx u = 2 πb x , v = 2 π b y v=2\pi by v = 2 πb y , their sum is 2 cos ( 2 π b ( x − y ) ) = 2 cos ( 2 π b r / L ) 2\cos(2\pi b(x-y))=2\cos(2\pi br/L) 2 cos ( 2 πb ( x − y )) = 2 cos ( 2 πb r / L ) with r = ν − ν ′ ∈ Z r=\nu-\nu'\in\mathbb{Z} r = ν − ν ′ ∈ Z , − 2 M ≤ r ≤ 2 M -2M\le r\le 2M − 2 M ≤ r ≤ 2 M . Since ϕ 0 ( x ) ϕ 0 ( y ) = 1 \phi_{0}(x)\phi_{0}(y)=1 ϕ 0 ( x ) ϕ 0 ( y ) = 1 , Step 2 and claim 3 of Properties of Finite Sums give
∑ a ∈ E ϕ a ( x ) ϕ a ( y ) = 1 + 2 ∑ b = 1 M cos ( 2 π b r / L ) = K ( r ) , \sum_{a\in E}\phi_{a}(x)\phi_{a}(y)=1+2\sum_{b=1}^{M}\cos(2\pi br/L)=K(r), a ∈ E ∑ ϕ a ( x ) ϕ a ( y ) = 1 + 2 b = 1 ∑ M cos ( 2 πb r / L ) = K ( r ) ,
which by Step 1 is L L L if r = 0 r=0 r = 0 , that is ν = ν ′ \nu=\nu' ν = ν ′ , and 0 0 0 otherwise.
Step 7 (factorisation). Let G G G be a nonempty finite set and j ∈ N j\in\mathbb{N} j ∈ N . For all maps g 1 , … , g j : G → R g_{1},\dots,g_{j}:G\to\mathbb{R} g 1 , … , g j : G → R ,
∑ w ∈ G j ∏ i = 1 j g i ( w i ) = ∏ i = 1 j ( ∑ e ∈ G g i ( e ) ) . \sum_{w\in G^{j}}\prod_{i=1}^{j}g_{i}(w_{i})=\prod_{i=1}^{j}\Bigl(\sum_{e\in G}g_{i}(e)\Bigr). w ∈ G j ∑ i = 1 ∏ j g i ( w i ) = i = 1 ∏ j ( e ∈ G ∑ g i ( e ) ) .
Here G j G^{j} G j is nonempty and finite by claim 3 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets . Let J J J be the set of j ∈ N j\in\mathbb{N} j ∈ N for which this holds for every family g 1 , … , g j g_{1},\dots,g_{j} g 1 , … , g j ; we apply Principle of Induction for the Natural Numbers . For j = 1 j=1 j = 1 : [ 1 ] = { 1 } [1]=\{1\} [ 1 ] = { 1 } by claim 2 of Basic Properties of Initial Segments of the Natural Numbers . By Tuples in a Set an element w ∈ G 1 w\in G^{1} w ∈ G 1 is a map [ 1 ] = { 1 } → G [1]=\{1\}\to G [ 1 ] = { 1 } → G , so it is determined by its value w 1 w_{1} w 1 at 1 1 1 , and every e ∈ G e\in G e ∈ G is such a value (of the map sending 1 1 1 to e e e ); hence w ↦ w 1 w\mapsto w_{1} w ↦ w 1 is a bijection G 1 → G G^{1}\to G G 1 → G ; both products reduce to their only factor by claim 1 of Properties of Finite Products , and claim 2 of Properties of a Sum over a Finite Index Set gives the identity. Let j ∈ J j\in J j ∈ J and let g 1 , … , g S ( j ) g_{1},\dots,g_{S(j)} g 1 , … , g S ( j ) be given. Let q : G j × G → G S ( j ) q:G^{j}\times G\to G^{S(j)} q : G j × G → G S ( j ) be the bijection of claim 2 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets . For ( v , e ) ∈ G j × G (v,e)\in G^{j}\times G ( v , e ) ∈ G j × G , the tuple q ( ( v , e ) ) q((v,e)) q (( v , e )) has i i i th component v i v_{i} v i for every i ∈ [ j ] i\in[j] i ∈ [ j ] and S ( j ) S(j) S ( j ) th component e e e , by the component property of q q q in claim 2 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets ; so claim 1 of Properties of Finite Products gives ∏ i = 1 S ( j ) g i ( q ( ( v , e ) ) i ) = ( ∏ i = 1 j g i ( v i ) ) g S ( j ) ( e ) \prod_{i=1}^{S(j)}g_{i}(q((v,e))_{i})=\bigl(\prod_{i=1}^{j}g_{i}(v_{i})\bigr)g_{S(j)}(e) ∏ i = 1 S ( j ) g i ( q (( v , e ) ) i ) = ( ∏ i = 1 j g i ( v i ) ) g S ( j ) ( e ) . Hence, by claim 2 of Properties of a Sum over a Finite Index Set , then The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product , then the hypothesis j ∈ J j\in J j ∈ J for the family g 1 , … , g j g_{1},\dots,g_{j} g 1 , … , g j , then claim 1 of Properties of Finite Products again,
∑ u ∈ G S ( j ) ∏ i = 1 S ( j ) g i ( u i ) = ∑ ( v , e ) ∈ G j × G ( ∏ i = 1 j g i ( v i ) ) g S ( j ) ( e ) = ( ∑ v ∈ G j ∏ i = 1 j g i ( v i ) ) ( ∑ e ∈ G g S ( j ) ( e ) ) = ∏ i = 1 S ( j ) ( ∑ e ∈ G g i ( e ) ) . \sum_{u\in G^{S(j)}}\prod_{i=1}^{S(j)}g_{i}(u_{i})=\sum_{(v,e)\in G^{j}\times G}\Bigl(\prod_{i=1}^{j}g_{i}(v_{i})\Bigr)g_{S(j)}(e)=\Bigl(\sum_{v\in G^{j}}\prod_{i=1}^{j}g_{i}(v_{i})\Bigr)\Bigl(\sum_{e\in G}g_{S(j)}(e)\Bigr)=\prod_{i=1}^{S(j)}\Bigl(\sum_{e\in G}g_{i}(e)\Bigr). u ∈ G S ( j ) ∑ i = 1 ∏ S ( j ) g i ( u i ) = ( v , e ) ∈ G j × G ∑ ( i = 1 ∏ j g i ( v i ) ) g S ( j ) ( e ) = ( v ∈ G j ∑ i = 1 ∏ j g i ( v i ) ) ( e ∈ G ∑ g S ( j ) ( e ) ) = i = 1 ∏ S ( j ) ( e ∈ G ∑ g i ( e ) ) .
So S ( j ) ∈ J S(j)\in J S ( j ) ∈ J , and J = N J=\mathbb{N} J = N .
Step 8 (reduction to one dimension). The map β : W L → L M \beta:W_{L}\to\mathbb{L}_{M} β : W L → L M , β ( w ) = L − 1 w \beta(w)=L^{-1}w β ( w ) = L − 1 w , is surjective by The Lattice Torus of Odd Side, Lattice Fields, and the Discrete Fourier Coefficients of a Lattice Field §lattice , and injective because ( L − 1 w ) i = L − 1 w i (L^{-1}w)_{i}=L^{-1}w_{i} ( L − 1 w ) i = L − 1 w i by Scalar Multiple of a Point of R n \mathbb{R}^n R n and L − 1 ≠ 0 L^{-1}\neq0 L − 1 = 0 , together with claim 1 of Euclidean Points as Tuples of Real Numbers ; so it is a bijection. By The Trigonometric System on the Torus §system and claim 2 of Properties of Finite Products , for k , l ∈ Γ M k,l\in\Gamma_{M} k , l ∈ Γ M and w , w ′ ∈ W L w,w'\in W_{L} w , w ′ ∈ W L ,
ψ k ( β ( w ) ) ψ l ( β ( w ′ ) ) = ∏ i = 1 n ϕ k i ( w i / L ) ϕ l i ( w i ′ / L ) . \psi_{k}(\beta(w))\,\psi_{l}(\beta(w'))=\prod_{i=1}^{n}\phi_{k_{i}}(w_{i}/L)\,\phi_{l_{i}}(w'_{i}/L). ψ k ( β ( w )) ψ l ( β ( w ′ )) = i = 1 ∏ n ϕ k i ( w i / L ) ϕ l i ( w i ′ / L ) .
Hence claim 2 of Properties of a Sum over a Finite Index Set and Step 7 (with G = D G=D G = D , W L = D n W_{L}=D^{n} W L = D n , respectively G = E G=E G = E , Γ M = E n \Gamma_{M}=E^{n} Γ M = E n ) give
∑ z ∈ L M ψ k ( z ) ψ l ( z ) = ∏ i = 1 n ( ∑ ν ∈ D ϕ k i ( ν / L ) ϕ l i ( ν / L ) ) , ∑ k ∈ Γ M ψ k ( β ( w ) ) ψ k ( β ( w ′ ) ) = ∏ i = 1 n ( ∑ a ∈ E ϕ a ( w i / L ) ϕ a ( w i ′ / L ) ) . \sum_{z\in\mathbb{L}_{M}}\psi_{k}(z)\psi_{l}(z)=\prod_{i=1}^{n}\Bigl(\sum_{\nu\in D}\phi_{k_{i}}(\nu/L)\phi_{l_{i}}(\nu/L)\Bigr),\qquad
\sum_{k\in\Gamma_{M}}\psi_{k}(\beta(w))\psi_{k}(\beta(w'))=\prod_{i=1}^{n}\Bigl(\sum_{a\in E}\phi_{a}(w_{i}/L)\phi_{a}(w'_{i}/L)\Bigr). z ∈ L M ∑ ψ k ( z ) ψ l ( z ) = i = 1 ∏ n ( ν ∈ D ∑ ϕ k i ( ν / L ) ϕ l i ( ν / L ) ) , k ∈ Γ M ∑ ψ k ( β ( w )) ψ k ( β ( w ′ )) = i = 1 ∏ n ( a ∈ E ∑ ϕ a ( w i / L ) ϕ a ( w i ′ / L ) ) .
Step 9 (products of Kronecker factors). Let d 1 , … , d n ∈ { 0 , 1 } d_{1},\dots,d_{n}\in\{0,1\} d 1 , … , d n ∈ { 0 , 1 } . If d i = 1 d_{i}=1 d i = 1 for every i i i , then ∏ i = 1 n ( L d i ) = L n \prod_{i=1}^{n}(L\,d_{i})=L^{n} ∏ i = 1 n ( L d i ) = L n by Natural Number Power of an Element of a Field ; otherwise some factor vanishes and ∏ i = 1 n ( L d i ) = 0 \prod_{i=1}^{n}(L\,d_{i})=0 ∏ i = 1 n ( L d i ) = 0 by claim 4 of Properties of Finite Products . By claim 1 of Euclidean Points as Tuples of Real Numbers , k = l k=l k = l in Γ M \Gamma_{M} Γ M exactly when k i = l i k_{i}=l_{i} k i = l i for every i i i , and β ( w ) = β ( w ′ ) \beta(w)=\beta(w') β ( w ) = β ( w ′ ) exactly when w i = w i ′ w_{i}=w'_{i} w i = w i ′ for every i i i (β \beta β being injective). Combining this with Steps 5, 6 and 8:
∑ z ∈ L M ψ k ( z ) ψ l ( z ) = L n δ k l ( k , l ∈ Γ M ) , ∑ k ∈ Γ M ψ k ( y ) ψ k ( z ) = { L n y = z , 0 y ≠ z ( y , z ∈ L M ) . ( ∗ ) \sum_{z\in\mathbb{L}_{M}}\psi_{k}(z)\psi_{l}(z)=L^{n}\delta_{kl}\quad(k,l\in\Gamma_{M}),\qquad
\sum_{k\in\Gamma_{M}}\psi_{k}(y)\psi_{k}(z)=\begin{cases}L^{n}&y=z,\\0&y\neq z\end{cases}\quad(y,z\in\mathbb{L}_{M}).\tag{$\ast$} z ∈ L M ∑ ψ k ( z ) ψ l ( z ) = L n δ k l ( k , l ∈ Γ M ) , k ∈ Γ M ∑ ψ k ( y ) ψ k ( z ) = { L n 0 y = z , y = z ( y , z ∈ L M ) . ( ∗ )
Claim 2 (Counting the modes). By The Cubes of the Integer Lattice are Finite, Nested, Exhaust the Lattice and Have (2N+1)^n Points §count with N = M N=M N = M , ∑ k ∈ Γ M 1 = ( 2 M + 1 ) n = L n \sum_{k\in\Gamma_{M}}1=(2M+1)^{n}=L^{n} ∑ k ∈ Γ M 1 = ( 2 M + 1 ) n = L n , using the Notation paragraph.
Claim 1 (Counting the sites). By Euclidean Points as Tuples of Real Numbers (claim 2) define γ : Γ M → W L \gamma:\Gamma_{M}\to W_{L} γ : Γ M → W L by γ ( k ) i = k i + M \gamma(k)_{i}=k_{i}+M γ ( k ) i = k i + M and γ ′ : W L → Γ M \gamma':W_{L}\to\Gamma_{M} γ ′ : W L → Γ M by γ ′ ( w ) i = w i − M \gamma'(w)_{i}=w_{i}-M γ ′ ( w ) i = w i − M (i ∈ [ n ] i\in[n] i ∈ [ n ] ); they land in the stated sets because − M ≤ k i ≤ M -M\le k_{i}\le M − M ≤ k i ≤ M if and only if 0 ≤ k i + M ≤ 2 M = L − 1 0\le k_{i}+M\le 2M=L-1 0 ≤ k i + M ≤ 2 M = L − 1 , and they are mutually inverse by claim 1 of that lemma, so γ \gamma γ is a bijection by claim 3 of Inverse of a Bijection . Reindexing along β \beta β and γ \gamma γ by claim 2 of Properties of a Sum over a Finite Index Set , and using claim 2 of this lemma (proved above),
∑ z ∈ L M 1 = ∑ w ∈ W L 1 = ∑ k ∈ Γ M 1 = L n . \sum_{z\in\mathbb{L}_{M}}1=\sum_{w\in W_{L}}1=\sum_{k\in\Gamma_{M}}1=L^{n}. z ∈ L M ∑ 1 = w ∈ W L ∑ 1 = k ∈ Γ M ∑ 1 = L n .
Claim 3 (Orthogonality). Multiply the first identity of ( ∗ ) (\ast) ( ∗ ) by L − n L^{-n} L − n .
Claim 4 (Inversion formula). Let f f f be a lattice field and y ∈ L M y\in\mathbb{L}_{M} y ∈ L M . By The Lattice Torus of Odd Side, Lattice Fields, and the Discrete Fourier Coefficients of a Lattice Field §coefficients , claim 4 of Properties of a Sum over a Finite Index Set , and claim 5 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set (interchange over Γ M × L M \Gamma_{M}\times\mathbb{L}_{M} Γ M × L M ),
∑ k ∈ Γ M f ^ ( k ) ψ k ( y ) = ∑ k ∈ Γ M ( ∑ z ∈ L M L − n f ( z ) ψ k ( z ) ψ k ( y ) ) = ∑ z ∈ L M L − n f ( z ) ( ∑ k ∈ Γ M ψ k ( z ) ψ k ( y ) ) . \sum_{k\in\Gamma_{M}}\hat{f}(k)\psi_{k}(y)=\sum_{k\in\Gamma_{M}}\Bigl(\sum_{z\in\mathbb{L}_{M}}L^{-n}f(z)\psi_{k}(z)\psi_{k}(y)\Bigr)=\sum_{z\in\mathbb{L}_{M}}L^{-n}f(z)\Bigl(\sum_{k\in\Gamma_{M}}\psi_{k}(z)\psi_{k}(y)\Bigr). k ∈ Γ M ∑ f ^ ( k ) ψ k ( y ) = k ∈ Γ M ∑ ( z ∈ L M ∑ L − n f ( z ) ψ k ( z ) ψ k ( y ) ) = z ∈ L M ∑ L − n f ( z ) ( k ∈ Γ M ∑ ψ k ( z ) ψ k ( y ) ) .
By the second identity of ( ∗ ) (\ast) ( ∗ ) the summand vanishes for z ≠ y z\neq y z = y and equals L − n f ( y ) L n = f ( y ) L^{-n}f(y)L^{n}=f(y) L − n f ( y ) L n = f ( y ) for z = y z=y z = y , so Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing (with the nonempty subset { y } \{y\} { y } ) and claim 1 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set show that the sum is f ( y ) f(y) f ( y ) .
Claim 5 (Bijection). Write A ( f ) = f ^ \mathcal{A}(f)=\hat{f} A ( f ) = f ^ . The vector-space operations of M a p ( L M , R ) \mathrm{Map}(\mathbb{L}_{M},\mathbb{R}) Map ( L M , R ) and M a p ( Γ M , R ) \mathrm{Map}(\Gamma_{M},\mathbb{R}) Map ( Γ M , R ) are pointwise by The Real Vector Space of Real-Valued Functions on a Set §vector-space . For lattice fields f , g f,g f , g , λ ∈ R \lambda\in\mathbb{R} λ ∈ R and k ∈ Γ M k\in\Gamma_{M} k ∈ Γ M , claims 3 and 4 of Properties of a Sum over a Finite Index Set give f + g ^ ( k ) = f ^ ( k ) + g ^ ( k ) \widehat{f+g}(k)=\hat{f}(k)+\hat{g}(k) f + g ( k ) = f ^ ( k ) + g ^ ( k ) and λ f ^ ( k ) = λ f ^ ( k ) \widehat{\lambda f}(k)=\lambda\hat{f}(k) λ f ( k ) = λ f ^ ( k ) , so A \mathcal{A} A is linear in the sense of Linear Map . For b ∈ M a p ( Γ M , R ) b\in\mathrm{Map}(\Gamma_{M},\mathbb{R}) b ∈ Map ( Γ M , R ) let S ( b ) \mathcal{S}(b) S ( b ) be the lattice field z ↦ ∑ k ∈ Γ M b ( k ) ψ k ( z ) z\mapsto\sum_{k\in\Gamma_{M}}b(k)\psi_{k}(z) z ↦ ∑ k ∈ Γ M b ( k ) ψ k ( z ) . By claim 4, S ( A ( f ) ) ( z ) = f ( z ) \mathcal{S}(\mathcal{A}(f))(z)=f(z) S ( A ( f )) ( z ) = f ( z ) for every z z z , so S ∘ A \mathcal{S}\circ\mathcal{A} S ∘ A is the identity. For b b b and l ∈ Γ M l\in\Gamma_{M} l ∈ Γ M , the same three sum rules as in claim 4 and claim 3 give
A ( S ( b ) ) ( l ) = ∑ z ∈ L M L − n ( ∑ k ∈ Γ M b ( k ) ψ k ( z ) ) ψ l ( z ) = ∑ k ∈ Γ M b ( k ) ( L − n ∑ z ∈ L M ψ k ( z ) ψ l ( z ) ) = ∑ k ∈ Γ M b ( k ) δ k l = b ( l ) , \mathcal{A}(\mathcal{S}(b))(l)=\sum_{z\in\mathbb{L}_{M}}L^{-n}\Bigl(\sum_{k\in\Gamma_{M}}b(k)\psi_{k}(z)\Bigr)\psi_{l}(z)=\sum_{k\in\Gamma_{M}}b(k)\Bigl(L^{-n}\sum_{z\in\mathbb{L}_{M}}\psi_{k}(z)\psi_{l}(z)\Bigr)=\sum_{k\in\Gamma_{M}}b(k)\delta_{kl}=b(l), A ( S ( b )) ( l ) = z ∈ L M ∑ L − n ( k ∈ Γ M ∑ b ( k ) ψ k ( z ) ) ψ l ( z ) = k ∈ Γ M ∑ b ( k ) ( L − n z ∈ L M ∑ ψ k ( z ) ψ l ( z ) ) = k ∈ Γ M ∑ b ( k ) δ k l = b ( l ) ,
the last step by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing and claim 1 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set . So A ∘ S \mathcal{A}\circ\mathcal{S} A ∘ S is the identity, and claim 3 of Inverse of a Bijection shows that A \mathcal{A} A is a bijection with inverse S \mathcal{S} S .
Claim 6 (Parseval). Let f , g f,g f , g be lattice fields. Expanding g ( z ) g(z) g ( z ) by claim 4 and using claim 4 of Properties of a Sum over a Finite Index Set and claim 5 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set ,
L − n ∑ z ∈ L M f ( z ) g ( z ) = ∑ z ∈ L M ( ∑ k ∈ Γ M L − n f ( z ) g ^ ( k ) ψ k ( z ) ) = ∑ k ∈ Γ M g ^ ( k ) ( L − n ∑ z ∈ L M f ( z ) ψ k ( z ) ) = ∑ k ∈ Γ M f ^ ( k ) g ^ ( k ) . L^{-n}\sum_{z\in\mathbb{L}_{M}}f(z)g(z)=\sum_{z\in\mathbb{L}_{M}}\Bigl(\sum_{k\in\Gamma_{M}}L^{-n}f(z)\hat{g}(k)\psi_{k}(z)\Bigr)=\sum_{k\in\Gamma_{M}}\hat{g}(k)\Bigl(L^{-n}\sum_{z\in\mathbb{L}_{M}}f(z)\psi_{k}(z)\Bigr)=\sum_{k\in\Gamma_{M}}\hat{f}(k)\hat{g}(k). L − n z ∈ L M ∑ f ( z ) g ( z ) = z ∈ L M ∑ ( k ∈ Γ M ∑ L − n f ( z ) g ^ ( k ) ψ k ( z ) ) = k ∈ Γ M ∑ g ^ ( k ) ( L − n z ∈ L M ∑ f ( z ) ψ k ( z ) ) = k ∈ Γ M ∑ f ^ ( k ) g ^ ( k ) .
Claim 7 (Spin sum). For s ∈ R s\in\mathbb{R} s ∈ R put ℓ ( s ) = log ( exp ( s ) + exp ( − s ) ) \ell(s)=\log(\exp(s)+\exp(-s)) ℓ ( s ) = log ( exp ( s ) + exp ( − s )) , defined as recorded in the statement; then exp ( ℓ ( s ) ) = exp ( s ) + exp ( − s ) \exp(\ell(s))=\exp(s)+\exp(-s) exp ( ℓ ( s )) = exp ( s ) + exp ( − s ) by The Natural Logarithm . The set { − 1 , 1 } = { − 1 } ∪ { 1 } \{-1,1\}=\{-1\}\cup\{1\} { − 1 , 1 } = { − 1 } ∪ { 1 } is nonempty and finite by claim 2 of Basic Properties of Finite Sets and claim 1 of Peeling an Element off a Finite Set, and Unions of Finite Sets , so M a p ( F , { − 1 , 1 } ) \mathrm{Map}(F,\{-1,1\}) Map ( F , { − 1 , 1 }) is nonempty and finite for every nonempty finite set F F F by The Maps from a Finite Set to a Nonempty Finite Set Form a Nonempty Finite Set §finite . Let Z Z Z be the set of those p ∈ N p\in\mathbb{N} p ∈ N such that for every set F F F with p p p elements and every map t : F → R t:F\to\mathbb{R} t : F → R
∑ σ ∈ M a p ( F , { − 1 , 1 } ) exp ( ∑ z ∈ F σ ( z ) t ( z ) ) = exp ( ∑ z ∈ F ℓ ( t ( z ) ) ) . ( ∗ ∗ ) \sum_{\sigma\in\mathrm{Map}(F,\{-1,1\})}\exp\Bigl(\sum_{z\in F}\sigma(z)t(z)\Bigr)=\exp\Bigl(\sum_{z\in F}\ell(t(z))\Bigr).\tag{$\ast\ast$} σ ∈ Map ( F , { − 1 , 1 }) ∑ exp ( z ∈ F ∑ σ ( z ) t ( z ) ) = exp ( z ∈ F ∑ ℓ ( t ( z )) ) . ( ∗ ∗ )
We show Z = N Z=\mathbb{N} Z = N by Principle of Induction for the Natural Numbers ; the claim is then ( ∗ ∗ ) (\ast\ast) ( ∗ ∗ ) for F = L M F=\mathbb{L}_{M} F = L M , which is nonempty and finite by The Lattice Torus of Odd Side, Lattice Fields, and the Discrete Fourier Coefficients of a Lattice Field §lattice , and so has p p p elements for some p p p by Finite Set .
1 ∈ Z 1\in Z 1 ∈ Z . A set with 1 1 1 element is { x } \{x\} { x } for some x x x , as [ 1 ] = { 1 } [1]=\{1\} [ 1 ] = { 1 } by claim 2 of Basic Properties of Initial Segments of the Natural Numbers . M a p ( { x } , { − 1 , 1 } ) \mathrm{Map}(\{x\},\{-1,1\}) Map ({ x } , { − 1 , 1 }) is the union of the singletons { σ + } \{\sigma_{+}\} { σ + } and { σ − } \{\sigma_{-}\} { σ − } , where σ ± ( x ) = ± 1 \sigma_{\pm}(x)=\pm1 σ ± ( x ) = ± 1 , which are disjoint since − 1 ≠ 1 -1\neq1 − 1 = 1 . By Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §disjoint-union and claim 1 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set , the left side of ( ∗ ∗ ) (\ast\ast) ( ∗ ∗ ) is exp ( t ( x ) ) + exp ( − t ( x ) ) = exp ( ℓ ( t ( x ) ) ) \exp(t(x))+\exp(-t(x))=\exp(\ell(t(x))) exp ( t ( x )) + exp ( − t ( x )) = exp ( ℓ ( t ( x ))) , which is the right side by claim 1 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set .
If p ∈ Z p\in Z p ∈ Z then S ( p ) ∈ Z S(p)\in Z S ( p ) ∈ Z . Let F F F have S ( p ) S(p) S ( p ) elements and t : F → R t:F\to\mathbb{R} t : F → R . By claim 2 of Peeling an Element off a Finite Set, and Unions of Finite Sets , F = F ′ ∪ { x } F=F'\cup\{x\} F = F ′ ∪ { x } with F ′ F' F ′ having p p p elements (so F ′ ≠ ∅ F'\neq\emptyset F ′ = ∅ ) and x ∉ F ′ x\notin F' x ∈ / F ′ . Write Σ ′ = M a p ( F ′ , { − 1 , 1 } ) \Sigma'=\mathrm{Map}(F',\{-1,1\}) Σ ′ = Map ( F ′ , { − 1 , 1 }) and, for ε ∈ { − 1 , 1 } \varepsilon\in\{-1,1\} ε ∈ { − 1 , 1 } , A ε = { σ ∈ M a p ( F , { − 1 , 1 } ) : σ ( x ) = ε } A_{\varepsilon}=\{\sigma\in\mathrm{Map}(F,\{-1,1\}):\sigma(x)=\varepsilon\} A ε = { σ ∈ Map ( F , { − 1 , 1 }) : σ ( x ) = ε } ; then A 1 ∩ A − 1 = ∅ A_{1}\cap A_{-1}=\emptyset A 1 ∩ A − 1 = ∅ and A 1 ∪ A − 1 = M a p ( F , { − 1 , 1 } ) A_{1}\cup A_{-1}=\mathrm{Map}(F,\{-1,1\}) A 1 ∪ A − 1 = Map ( F , { − 1 , 1 }) . Let χ ε : Σ ′ → A ε \chi_{\varepsilon}:\Sigma'\to A_{\varepsilon} χ ε : Σ ′ → A ε send τ \tau τ to its extension by x ↦ ε x\mapsto\varepsilon x ↦ ε ; restriction to F ′ F' F ′ is a two-sided inverse, so χ ε \chi_{\varepsilon} χ ε is a bijection by claim 3 of Inverse of a Bijection , and A ε A_{\varepsilon} A ε is nonempty and finite by claim 4 of Basic Properties of Finite Sets . For τ ∈ Σ ′ \tau\in\Sigma' τ ∈ Σ ′ , claim 2 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set and claim 1 of Basic Properties of the Exponential Function give
exp ( ∑ z ∈ F χ ε ( τ ) ( z ) t ( z ) ) = exp ( ∑ z ∈ F ′ τ ( z ) t ( z ) + ε t ( x ) ) = exp ( ε t ( x ) ) exp ( ∑ z ∈ F ′ τ ( z ) t ( z ) ) . \exp\Bigl(\sum_{z\in F}\chi_{\varepsilon}(\tau)(z)t(z)\Bigr)=\exp\Bigl(\sum_{z\in F'}\tau(z)t(z)+\varepsilon t(x)\Bigr)=\exp(\varepsilon t(x))\exp\Bigl(\sum_{z\in F'}\tau(z)t(z)\Bigr). exp ( z ∈ F ∑ χ ε ( τ ) ( z ) t ( z ) ) = exp ( z ∈ F ′ ∑ τ ( z ) t ( z ) + εt ( x ) ) = exp ( εt ( x )) exp ( z ∈ F ′ ∑ τ ( z ) t ( z ) ) .
By claims 2 and 4 of Properties of a Sum over a Finite Index Set and the hypothesis p ∈ Z p\in Z p ∈ Z applied to F ′ F' F ′ and the restriction of t t t , the sum of the left side over σ ∈ A ε \sigma\in A_{\varepsilon} σ ∈ A ε is exp ( ε t ( x ) ) exp ( ∑ z ∈ F ′ ℓ ( t ( z ) ) ) \exp(\varepsilon t(x))\exp\bigl(\sum_{z\in F'}\ell(t(z))\bigr) exp ( εt ( x )) exp ( ∑ z ∈ F ′ ℓ ( t ( z )) ) . Adding the cases ε = 1 \varepsilon=1 ε = 1 and ε = − 1 \varepsilon=-1 ε = − 1 by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §disjoint-union , and using claim 1 of Basic Properties of the Exponential Function and claim 2 of Peeling, Splitting, and Interchange for Sums over a Finite Index Set ,
∑ σ ∈ M a p ( F , { − 1 , 1 } ) exp ( ∑ z ∈ F σ ( z ) t ( z ) ) = exp ( ℓ ( t ( x ) ) ) exp ( ∑ z ∈ F ′ ℓ ( t ( z ) ) ) = exp ( ∑ z ∈ F ℓ ( t ( z ) ) ) . \sum_{\sigma\in\mathrm{Map}(F,\{-1,1\})}\exp\Bigl(\sum_{z\in F}\sigma(z)t(z)\Bigr)=\exp(\ell(t(x)))\exp\Bigl(\sum_{z\in F'}\ell(t(z))\Bigr)=\exp\Bigl(\sum_{z\in F}\ell(t(z))\Bigr). σ ∈ Map ( F , { − 1 , 1 }) ∑ exp ( z ∈ F ∑ σ ( z ) t ( z ) ) = exp ( ℓ ( t ( x ))) exp ( z ∈ F ′ ∑ ℓ ( t ( z )) ) = exp ( z ∈ F ∑ ℓ ( t ( z )) ) .
So S ( p ) ∈ Z S(p)\in Z S ( p ) ∈ Z , hence Z = N Z=\mathbb{N} Z = N , which proves claim 7.