Weighted positivity from Gaussian packets
Written by GPT-6 Astra (OpenAI). Self-checked by the writing AI. Original exposition: CC0.
This reading proves the precise positivity estimate used by the near-frequency resolvent argument, including symbols without compact frequency support. The construction uses positive Gaussian-packet quantization, as presented in Nicolas Lerner's freely available author Chapter 2, Definition 2.4.1 and Proposition 2.4.3(1)–(3), printed pages 101–103. The proof below supplies its own localization and error estimates. It does not import the general metric Gårding theorem or a symbol-composition theorem.
Use , , and an inner product linear in the first entry. The earlier programme reading A finite-derivative bound for left quantization proves Fourier inversion, Plancherel, Schwartz density, the Gaussian transform, the packet resolution of the identity and the Schur estimate. Its preceding measure subsection proves the Euclidean interchanges used here. We use those full proofs with the same inverse Fourier factor .
The local Hilbert representing-vector and adjoint proofs provide the Hilbert tools needed here. In particular, if is linear in , conjugate-linear in , and , apply the representing-vector theorem to . It gives a unique with and . Uniqueness makes linear, hence a bounded operator representing the form. This proves the precise form-to-operator step used in the cutoff limit below, for the stated inner-product convention.
The exact estimate
Theorem 1. Let , and let be a smooth real nonnegative function satisfying Then its left operator is bounded on and The constant uses only finitely many constants in (P1). In particular it is uniform for any family having uniform displayed seminorms. No compact support or extra decay in is assumed. The case is nonnegative scalar multiplication.
We prove two elementary operator estimates before the localization.
A bound for amplitudes with two position variables
Lemma 2. For each dimension there is an integer such that the operator is bounded on when all derivatives of through order in each of the three variable groups are bounded. Its norm is at most a dimensional constant times their maximum. The integral is the cutoff oscillatory integral. This includes left, right and Weyl quantization and every intermediate evaluation , uniformly for .
Proof. Take an integer , , and, for definiteness, . Use the normalized packets The cited packet identity gives the isometry and .
First suppose is compactly supported in all its variables. Its kernel is bounded with compact position support, so is already bounded and its packet matrix is legitimate. For input packet and output packet put , , , and . Apart from a constant phase and a dimensional factor, the matrix element is Integrate first by parts in , using on , to extract . Next use on the first exponential in (P4). This extracts .
The remaining integrand is a finite sum of derivatives of within the stated orders, derivatives of the two Gaussians, polynomial factors in , and a factor bounded by a constant times . Derivatives in can introduce at most factors of ; derivatives in introduce only polynomial factors in or improve derivatives of its denominator. The Gaussian-polynomial factors are integrable, and makes the remaining integral finite. Consequently where is the finite derivative maximum. Its row and column integrals are bounded because . The proved Schur estimate bounds , and gives the assertion.
For a general amplitude multiply it by fixed smooth cutoffs at radius in each variable group. Their derivative maxima remain uniformly bounded for . On two Schwartz test functions the oscillatory pairing has a well-defined limit: integration by parts with supplies ; derivatives of the input are integrable in , and the output test is integrable in . This is an absolute majorant independent of , so dominated convergence gives the limiting pairing. The uniform operator bound passes to that pairing and gives a bounded operator by Hilbert-space representation and density. This proves both its existence and the claimed norm estimate. The affine evaluation in the last sentence of the lemma changes these finite derivative bounds by dimensional factors uniform in .
Positivity at one spatial scale
Lemma 3. Suppose , is smooth, and Then , with depending on finitely many and independent of .
Proof. Put and Plancherel in followed by integration in proves, exactly as for the unit-width packets, . Thus the bounded operator defined by is nonnegative and has norm at most .
Its Weyl symbol is , where convolution is in both phase-space variables and Here is the normalization check. With , , the two packet factors have product The Fourier transform in of is . Substitution in the kernel of (P7) gives exactly the Weyl kernel with symbol . For bounded symbols the identity is first checked with cutoffs and then paired with Schwartz tests; the packet isometry and the Gaussian majorants justify the limit.
The Gaussian (P8) has mass one, zero first moments, second position moments , and second frequency moments in each coordinate. The mass follows by the Gaussian integral in each variable, and oddness gives the first moments. For the second moments, integration of over the whole space gives ; the boundary term vanishes by Gaussian decay. Applying the same calculation with replaced by proves the frequency moment. Apply Taylor's formula with its integral second-order remainder separately to convolution in position and in frequency. Convolution does not increase a supremum norm. For every fixed pair of multi-indices this proves The first-order Taylor terms integrate to zero. Lemma 2, applied to Weyl evaluation, therefore bounds by .
We must also account for the choice of quantization. In the difference of left and Weyl kernels, Move from the exponential by integration by parts in . The resulting amplitude is All its derivatives required by Lemma 2 are bounded by , by (P6), uniformly in . This proves . The identity is also justified by frequency cutoffs: their extra differentiated terms contain a factor tending to zero and have the same bounded-amplitude estimates, while the remaining pairings converge as in Lemma 2. Combining (P7), (P9) and (P10) proves the lemma.
A square partition and the localization error
Choose smooth nonnegative functions , , with whose supports have comparable to , with a fixed overlap bound. One explicit construction starts with a radial smooth function , equal to one on the unit ball, zero outside the ball of radius two, and nonincreasing on radial lines. Set , for . These functions sum to one and have fixed finite overlap. Divide each by . The denominator is bounded below by the reciprocal square root of the overlap bound, so differentiation gives (P11). The smooth cutoff construction supplies with these properties. Choose equal to one on , with slightly larger comparable annular support and the same derivative bounds.
The symbols satisfy (P6), by (P1) and . Since multiplication on the output is exact in left quantization, by Lemma 3. Summing the error magnitudes gives at most .
It remains to justify the localization with this same weighted error. Let denote the off-diagonal left kernel. For , apply the same radial telescoping construction as in (P11) to the frequency variable, using the functions before square normalization. This frequency partition gives for any fixed , with a finite-seminorm constant. To verify this, a frequency piece with comparable to has kernel bounded by . Indeed its derivatives of order are bounded by , and integration by parts with gives that bound. The low-frequency piece has the same bound with . For , sum separately over and ; both geometric sums are when . For , choose and sum . The same bounds hold for every finite partial sum of the frequency partition.
The difference , initially in Schwartz quadratic forms, has kernel multiplier It satisfies . If , the Lipschitz inequality makes all weights along the segment comparable to . Only a fixed number of supports can meet that segment, and (P11) gives .
Consider the weighted kernel , with . For and , (P13) bounds it by . For but , it is bounded by . In the remaining region one has , and . The same kernel is bounded by a fixed constant on , and by on . Choosing gives an integrable majorant depending only on . Thus its row and column integrals are uniformly bounded. The proved Schur estimate yields
For completeness there is no unexamined diagonal distribution in this argument. First replace by a finite partial sum of the frequency partition. Its kernel is an ordinary smooth function, and (P13)–(P15) hold uniformly. The factor (P14) cancels the near-diagonal singularity by two powers of . The integrable weighted majorant therefore permits passage to the limit in the error form. The left-operator forms converge on Schwartz inputs by the defining Fourier integral and dominated convergence. The partitioned forms converge too: the finite-derivative bound is uniform in the frequency cutoff, so their tails are bounded by a constant times , which tends to zero. These facts prove the exact limiting form identity defining and (P15).
Now sum (P12), add (P15), and use (P11) to obtain (P2) on Schwartz space. The left finite-derivative theorem bounds on since (P1) bounds all its required derivatives. Schwartz density, and boundedness of multiplication by , extend (P2) to all of . Every error above uses a fixed finite derivative list once the dimension is fixed, proving the asserted uniformity. This completes Theorem 1.
Fourier form and the exact negative order
For , direct insertion of the two unitary Fourier transforms gives . Because is real, its adjoint is ; the two have the same real quadratic form. Theorem 1 is therefore equivalently Plancherel gives . The symbol's frequency order here is and the error is the square of the norm. These are distinct orders. Theorem 1, rather than an external citation, proves precisely this full rotated class, including the class used in the resolvent lesson's fourth exercise.
A uniform norm when frequency derivatives are small
The same packet construction also proves the precise high-frequency norm estimate needed by the smooth elliptic-domain argument. It permits complex symbols and keeps the leading supremum separate from the derivative constants.
Theorem 4. Suppose , is a smooth complex scalar symbol, and Then Here uses only a fixed finite list of the constants and is independent of . Consequently a uniformly bounded family of classical order-zero symbols vanishing on has norm at most , if their suprema are at most . In particular its norm is at most for a suitable constant and every .
Proof. Use the width packets of Lemma 3. Their normalized analysis map is an isometry, by the already proved packet identity. For a complex symbol define , where multiplies a phase-space function by . The definition and give ; nonnegativity is not needed for this norm bound. The kernel computation (P7)–(P8), which is linear in the symbol, still gives the Weyl symbol .
Taylor expansion with zero Gaussian first moments, separately in the two variable groups, now gives, for each fixed , The input second position derivatives are bounded by (P17), and the second frequency derivatives gain ; convolution cannot increase their suprema. Lemma 2 bounds the corresponding Weyl difference by . The exact left-minus-Weyl amplitude (P10), with replaced by , has every required derivative bounded by , since it contains one frequency derivative of . Lemma 2 bounds this difference by too. Combining them proves , and hence (P18). The cutoff justification in Lemmas 2–3 applies equally to complex amplitudes.
For the last assertion, the ordinary order-zero bound is . On the nonzero derivative supports, ; all derivatives vanish on the open ball and by continuity have the same bound on its boundary. Thus (P17) holds. Increasing the constant if necessary, for , proving the stated square-root version. All constants use finite derivative lists; in particular only needs to be independent of a separately fixed coefficient approximation.
Why the two packet scales differ
In Lemma 3 the position and frequency errors in (P9) are and . Equating them gives and error , which matches the weighted lower bound after spatial localization. In Theorem 4 the corresponding errors are and . Their balance gives and error .
In both cases the positive packet operator is controlled directly by the isometry. For real nonnegative symbols this gives the sign; for complex symbols it preserves coefficient one in front of the supremum . The two-position amplitude bound then controls the Gaussian-convolution error and the exact change from Weyl to left quantization at the appropriate scale.