TheoremBase

The basis, weights and variances are read off the rescaled trigonometric basis and the weight identities of the negative Sobolev lemma, with summability of the inverse powers of the Fourier weights at exponent m+1. On H−mH^{-m} the noise-space series reduce term by term to the squared Fourier coefficients, so Parseval, injectivity and Riesz-Fischer identify the noise space with L2L^2.

Proof

Each result cited is universally quantified over the data in its own statement. Elementary arithmetic and order facts about real numbers (commutativity and associativity of products, multiplication of an inequality by a nonnegative number, positivity of products and of inverses of positive numbers, t t−1=1t\,t^{-1}=1, t2=ttt^{2}=tt for natural powers, transitivity of ≤\le, 1⋅t=t1\cdot t=t) are in force by the numbers clause of the real Hilbert space setting, which puts the background of the real-number setting in force. Throughout, j∈Nj\in\mathbb{N} and we write k=κ(j)k=\kappa(j). Since κ\kappa is an enumeration, it is a bijection of N\mathbb{N} onto Zn\mathbb{Z}^{n}, so in particular κ(j)=κ(j′)\kappa(j)=\kappa(j') implies j=j′j=j'.

Preliminary: the Fourier weights. By Properties of the Fourier Coefficients on the Torus, and the Realisation of Weighted Coefficient Families, μk\mu_{k} is the weight of Summability of the Negative Powers of the Fourier Weights of the Torus, which applies with s=m+1s=m+1 since n≤m+1n\le m+1; 1≤μk1\le\mu_{k}, and hence μk\mu_{k} is positive, for every k∈Znk\in\mathbb{Z}^{n} by Summability of the Negative Powers of the Fourier Weights of the Torus §product.

Claim 1. By the Hilbert space clause of the negative Sobolev lemma, H−m(Tn)H^{-m}(\mathbb{T}^{n}) is a real Hilbert space. By its basis clause, applied with the present mm and the enumeration κ\kappa, the sequence (ζm,κ(j))j∈N=(ej)j∈N(\zeta_{m,\kappa(j)})_{j\in\mathbb{N}}=(e_{j})_{j\in\mathbb{N}} is an orthonormal basis of H−m(Tn)H^{-m}(\mathbb{T}^{n}), and, by the same clause with k=κ(j)k=\kappa(j), ⟨Φ,ej⟩H−m=⟨Φ,ζm,κ(j)⟩H−m=ρκ(j)mΦ(κ(j))\langle\Phi,e_{j}\rangle_{H^{-m}}=\langle\Phi,\zeta_{m,\kappa(j)}\rangle_{H^{-m}}=\rho_{\kappa(j)}^{m}\Phi(\kappa(j)) for every Φ∈H−m(Tn)\Phi\in H^{-m}(\mathbb{T}^{n}).

Claim 2. By the weights clause of the negative Sobolev lemma, 0<ρkm≤10<\rho_{k}^{m}\le1. Hence aj=ρkmρkma_{j}=\rho_{k}^{m}\rho_{k}^{m} is positive, as a product of positive numbers, and multiplying ρkm≤1\rho_{k}^{m}\le1 by the nonnegative number ρkm\rho_{k}^{m} gives aj≤ρkm≤1a_{j}\le\rho_{k}^{m}\le1. Thus aa is a sequence of positive real numbers with aj≤aˉa_{j}\le\bar{a} for every jj, where aˉ=1\bar{a}=1; by the definition of weight sequences, aa is a weight sequence, and aj≤1a_{j}\le1 for every jj.

Claim 3. The negative Sobolev lemma holds for every natural number in place of its mm; applying its weights clause with m+1∈Nm+1\in\mathbb{N} in place of mm gives 0<ρkm+10<\rho_{k}^{m+1} and (ρkm+1)2=1μkm+1(\rho_{k}^{m+1})^{2}=\frac{1}{\mu_{k}^{m+1}}. Hence cj=(ρkm+1)2c_{j}=(\rho_{k}^{m+1})^{2} is positive, as the square of a positive number, and cj=1μκ(j)m+1c_{j}=\frac{1}{\mu_{\kappa(j)}^{m+1}}. By the summability clause of the summability lemma, applied with s=m+1s=m+1 (admissible since n≤m+1n\le m+1, see the preliminary) and with the injective map κ\kappa, the series ∑j=1∞1μκ(j)m+1\sum_{j=1}^{\infty}\frac{1}{\mu_{\kappa(j)}^{m+1}} converges. Its terms are the numbers cjc_{j}, so the series ∑j=1∞cj\sum_{j=1}^{\infty}c_{j} is the same series and converges. By the definition of variance sequences, cc is a variance sequence.

Claim 4. By the weights clause of the negative Sobolev lemma, ρkm+1=ρkmρk\rho_{k}^{m+1}=\rho_{k}^{m}\rho_{k}, and ρk2=1μk\rho_{k}^{2}=\frac{1}{\mu_{k}} by the choice of ρk\rho_{k} in Properties of the Fourier Coefficients on the Torus, and the Realisation of Weighted Coefficient Families. Rearranging the product,

cj=(ρkmρk)(ρkmρk)=(ρkm)2ρk2=aj 1μk,c_{j}=(\rho_{k}^{m}\rho_{k})(\rho_{k}^{m}\rho_{k})=(\rho_{k}^{m})^{2}\rho_{k}^{2}=a_{j}\,\frac{1}{\mu_{k}},

and multiplying by μk\mu_{k}, which is positive by the preliminary, gives μkcj=aj(μk1μk)=aj\mu_{k}c_{j}=a_{j}\bigl(\mu_{k}\frac{1}{\mu_{k}}\bigr)=a_{j}, that is aj=μκ(j)cja_{j}=\mu_{\kappa(j)}c_{j}. Since 1≤μk1\le\mu_{k} by the preliminary and cjc_{j} is positive by claim 3, multiplying 1≤μk1\le\mu_{k} by cjc_{j} gives cj≤μkcj=ajc_{j}\le\mu_{k}c_{j}=a_{j}.

Claim 5. The data of The Noise Space of a Weight Sequence on a Hilbert Space with an Orthonormal Basis are available: H−m(Tn)H^{-m}(\mathbb{T}^{n}) is a real Hilbert space with orthonormal basis (ej)j∈N(e_{j})_{j\in\mathbb{N}} by claim 1, and aa is a weight sequence by claim 2. For Φ∈H−m(Tn)\Phi\in H^{-m}(\mathbb{T}^{n}) its coordinates are Φj=⟨Φ,ej⟩H−m=ρκ(j)mΦ(κ(j))\Phi_{j}=\langle\Phi,e_{j}\rangle_{H^{-m}}=\rho_{\kappa(j)}^{m}\Phi(\kappa(j)) by claim 1. Since aj=(ρkm)2a_{j}=(\rho_{k}^{m})^{2} is positive, aj−1(ρkm)2=1a_{j}^{-1}(\rho_{k}^{m})^{2}=1, so for Φ,Ψ∈H−m(Tn)\Phi,\Psi\in H^{-m}(\mathbb{T}^{n})

aj−1ΦjΨj=aj−1(ρkm)2 Φ(k)Ψ(k)=Φ(κ(j)) Ψ(κ(j))for every j∈N.(∗)a_{j}^{-1}\Phi_{j}\Psi_{j}=a_{j}^{-1}(\rho_{k}^{m})^{2}\,\Phi(k)\Psi(k)=\Phi(\kappa(j))\,\Psi(\kappa(j))\qquad\text{for every }j\in\mathbb{N}.\qquad(*)

By the definition of the noise space, XaX^{a} is the set of those Φ∈H−m(Tn)\Phi\in H^{-m}(\mathbb{T}^{n}) for which ∑j=1∞aj−1Φj2\sum_{j=1}^{\infty}a_{j}^{-1}\Phi_{j}^{2} converges; by (∗)(*) with Ψ=Φ\Psi=\Phi this series has the same terms as ∑j=1∞Φ(κ(j))2\sum_{j=1}^{\infty}\Phi(\kappa(j))^{2}, so Φ∈H−m(Tn)\Phi\in H^{-m}(\mathbb{T}^{n}) lies in XaX^{a} if and only if ∑j=1∞Φ(κ(j))2\sum_{j=1}^{\infty}\Phi(\kappa(j))^{2} converges. By the definition of the noise pairing and (∗)(*), ⟨Φ,Ψ⟩a=∑j=1∞Φ(κ(j))Ψ(κ(j))\langle\Phi,\Psi\rangle_{a}=\sum_{j=1}^{\infty}\Phi(\kappa(j))\Psi(\kappa(j)) for Φ,Ψ∈Xa\Phi,\Psi\in X^{a}.

Let U∈L2(Tn)U\in L^{2}(\mathbb{T}^{n}). Then U^∈H−m(Tn)\hat{U}\in H^{-m}(\mathbb{T}^{n}) by the embedding clause of the negative Sobolev lemma, and the series ∑j=1∞U^(κ(j))2\sum_{j=1}^{\infty}\hat{U}(\kappa(j))^{2} converges by Parseval's identity applied with U′=UU'=U; hence U^∈Xa\hat{U}\in X^{a}, so U↦U^U\mapsto\hat{U} maps L2(Tn)L^{2}(\mathbb{T}^{n}) into XaX^{a}. For U,U′∈L2(Tn)U,U'\in L^{2}(\mathbb{T}^{n}) the formula for the noise pairing and Parseval's identity give ⟨U^,U^′⟩a=∑j=1∞U^(κ(j))U^′(κ(j))=⟨U,U′⟩L2\langle\hat{U},\hat{U}'\rangle_{a}=\sum_{j=1}^{\infty}\hat{U}(\kappa(j))\hat{U}'(\kappa(j))=\langle U,U'\rangle_{L^{2}}. The map is injective by injectivity of the Fourier coefficients. It is onto XaX^{a}: let Φ∈Xa\Phi\in X^{a}. Then Φ∈H−m(Tn)\Phi\in H^{-m}(\mathbb{T}^{n}), which by the definition of the Sobolev space is a set of coefficient families, and ∑j=1∞Φ(κ(j))2\sum_{j=1}^{\infty}\Phi(\kappa(j))^{2} converges by the characterisation of XaX^{a} above; so by the Riesz--Fischer clause there is U∈L2(Tn)U\in L^{2}(\mathbb{T}^{n}) with U^=Φ\hat{U}=\Phi. Hence U↦U^U\mapsto\hat{U} is a bijection from L2(Tn)L^{2}(\mathbb{T}^{n}) onto XaX^{a}.

Claim 6. By the weights clause of the negative Sobolev lemma, 0<ρkm0<\rho_{k}^{m}, so ρkm\rho_{k}^{m} is a nonnegative real number whose square is aja_{j}. By Existence and Uniqueness of the Nonnegative Square Root, aja_{j}, which is positive by claim 2, has exactly one nonnegative square root, so aj1/2=ρkma_{j}^{1/2}=\rho_{k}^{m}. Hence aj1/2ej=ρkmζm,ka_{j}^{1/2}e_{j}=\rho_{k}^{m}\zeta_{m,k}. The vector operations of H−m(Tn)H^{-m}(\mathbb{T}^{n}) are the pointwise operations on coefficient families by the definition of the Sobolev space, and by the basis clause of the negative Sobolev lemma ζm,k(k′)\zeta_{m,k}(k') equals 1ρkm\frac{1}{\rho_{k}^{m}} if k′=kk'=k and 00 if k′≠kk'\ne k. Therefore (ρkmζm,k)(k′)=ρkm1ρkm=1(\rho_{k}^{m}\zeta_{m,k})(k')=\rho_{k}^{m}\frac{1}{\rho_{k}^{m}}=1 if k′=kk'=k and (ρkmζm,k)(k′)=ρkm⋅0=0(\rho_{k}^{m}\zeta_{m,k})(k')=\rho_{k}^{m}\cdot0=0 if k′≠kk'\ne k (by claim 1 of Zero Products and Elementary Identities in a Field). By the trigonometric classes clause, E^k\hat{E}_{k} takes the same values at every k′∈Znk'\in\mathbb{Z}^{n}, so the two coefficient families coincide: aj1/2ej=E^κ(j)a_{j}^{1/2}e_{j}=\hat{E}_{\kappa(j)}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…