A finite-derivative bound for left quantization
Written by GPT-6.1 Sol (OpenAI) and GPT-6 Astra (OpenAI). Self-checked by the writing AI. Original exposition: CC0.
The exact bound
Let and let be an integer with . For put If , the left operator initially on Schwartz functions, has a unique bounded extension to and In particular derivatives of total order at most suffice. There is no condition on a Hessian, positivity, ellipticity, support, or a lower bound of a symbol. The same constant works for a family with the displayed seminorm bounded uniformly. For , (1) is scalar multiplication and the assertion is immediate.
The measure inputs are monotone and dominated convergence, Fatou, Cauchy–Schwarz, completeness, and the product interchange theorem for Euclidean Lebesgue measure. The following subsections prove these inputs directly. For comparison, Sheldon Axler's free author text Measure, Integration & Real Analysis, 12 June 2026, §§3A–3B and §§7A–7B, supplies the integration and route; D. H. Fremlin's free author sources for Measure Theory, Volume 1, 2011 edition, 113C and 115B, 115D–115F, supply the outer-measure and rectangle construction. In particular the dominated-convergence proof below uses Fatou directly, and the rectangle-volume proof uses a finite grid. These references do not replace any step below.
Measure construction, convergence and complete function spaces
An outer measure on a set is a monotone function , zero at the empty set, with . A set is called measurable for this construction when It suffices to prove the greater-than-or-equal inequality: subadditivity gives the reverse, and the desired inequality is automatic when .
Outer-measure lemma. These measurable sets form a sigma-algebra, and restriction of to it is a complete measure.
Proof. The empty set and complements have the required property. Split by two measurable sets in succession. The resulting three pieces show using subadditivity on the pieces inside . Thus finite unions, intersections and differences are measurable. For disjoint measurable , finite splitting gives Let and apply subadditivity to . This proves measurability of the disjoint union. An arbitrary union is disjointified by removing all earlier sets, proving the sigma-algebra assertion. Taking in the finite inequality, and then using subadditivity, proves countable additivity. If , every subset satisfies the splitting equality: its first piece has measure zero, and monotonicity and subadditivity make the second piece have measure . This proves completeness.
Here a sigma-algebra contains the whole set and is closed under complements and countable unions; a measure is countably additive on disjoint sets and zero at the empty set. On a measure space , a real function is measurable when all its strict upper level sets belong to ; a complex function is measurable when its real and imaginary parts are. A nonnegative simple function is a finite sum on disjoint measurable sets, with finite . Define , with . A common finite partition proves that this definition is independent of the representation, additive and order preserving. For measurable define as the supremum of over simple . The functions are increasing finite-valued measurable functions with limit . Countable suprema and limits are measurable because their strict level sets are countable unions and intersections of level sets. Countable additivity also gives continuity from below for sets: disjointify an increasing union and sum its measures.
Scalar and measurability details. We use ordered-real completeness and elementary field operations. Completeness implies the Archimedean property: if the positive integers had supremum , some integer would exceed , and its successor would exceed . Hence positive rational meshes can be arbitrarily small, and every nonempty real open interval contains a rational number. It follows that open subsets of are countable unions of rational open rectangles: around each point choose a sufficiently small rectangle contained in the given open neighbourhood. The countability follows because finite tuples of integers form a countable set, by enumerating tuples whose entries have bounded absolute value.
For completeness, the nonnegative square root uses no calculus. For , the set is nonempty and bounded by . Its supremum satisfies : if , a sufficiently small positive increment still has square less than , contradicting the upper bound; if , a sufficiently small decrement remains an upper bound, contradicting the supremum. These choices follow by expanding ; the zero case is immediate. Uniqueness follows from strict increase of the square on nonnegative reals. The identity proves continuity of this root. Finite sums and products are continuous by the identities for their differences, with the factors bounded in a small neighbourhood. Thus complex conjugation and modulus, and real maxima, minima and positive and negative parts, are continuous as well. Here . The complex triangle inequality follows by expanding and using ; the latter follows from and .
If are finite real measurable functions and is continuous, then is measurable. Indeed, the preimage under of a strict upper interval is open and is therefore a countable union of rational rectangles. The preimage of each rectangle under is a finite intersection of measurable interval preimages. This proves all the finite algebra and modulus operations on measurable functions used in integration below.
The assertions about sequences follow directly from level sets, including extended values. For example , whereas is the union, over rational , of . Complements convert strict upper to weak lower sets and conversely. Infima, suprema, liminf and limsup are consequently measurable, as are pointwise limits when they exist. Also , which proves measurability of the comparisons used below. For nonnegative extended , the dyadic approximations in the preceding paragraph are measurable because their level sets are interval preimages. Refining the dyadic grid and increasing the cutoff proves that they increase; once their error is less than , and when their value is . Thus they converge pointwise in both cases.
Convergence lemma. If almost everywhere, then . If , then . If almost everywhere, the functions are complex measurable, and for one integrable , then .
Proof. Integrals over a measurable null set vanish by the simple-function definition, so remove the exceptional set first. In the increasing case, fix simple and . The sets increase and cover . Continuity from below on the finitely many levels of yields . Since , the limit of their integrals is at least . Let and take the supremum over . Monotonicity supplies the opposite inequality, including infinite integrals.
Apply this conclusion to increasing simple approximations of two functions and to their sum. It proves additivity of nonnegative integration, and then for . Define integrals of absolutely integrable real functions by their positive and negative parts, and complex integrals by real and imaginary parts. Nonnegative additivity proves linearity. Multiplying an integral by a complex scalar of modulus one that makes it nonnegative real shows .
For Fatou, the functions increase to the liminf and have integral at most ; use the increasing case. In the dominated case, almost everywhere and all differences are integrable. Apply Fatou to . Their pointwise limit is , so The integral of is finite; subtract it to conclude. The integral inequality above also proves .
For finite set , and let be the infimum of bounds for outside measurable null sets. The space consists of functions with finite such quantity, modulo almost-everywhere equality. A finite essential bound equal to the infimum is attained: choose the bounds outside their measurable null sets and discard the countable union of those sets. On the complement let . In particular essential norm zero means vanishing almost everywhere.
Function-space lemma. For , is a complete normed space. For finite , simple functions supported on sets of finite measure are dense. Hölder's inequality holds for conjugate exponents, and is a Hilbert space with inner product .
For the Hilbert-space case , the scalar inequality needed below is , obtained by expanding . Thus the norm, completeness and density arguments below use only the scalar and integration facts already proved, without a differentiation input. The endpoint cases likewise use only those facts. The proof also retains the full range of exponents. For the general real exponents, first read the logarithm, real-power and Young proofs (EF6)–(EF8). Their scalar integral input uses only the preceding measure facts, not the function-space lemma.
Proof. For put . The function , for fixed , decreases until and increases thereafter, since its derivative is . Its value at that minimum is zero. Continuity handles or . Thus . Apply this inequality to and and integrate to obtain . A zero norm implies vanishing almost everywhere, since each set where the modulus exceeds then has measure zero. Infinite positive norms make the inequality automatic. The endpoint cases follow by bounding the essentially bounded factor outside a null set. In particular gives Cauchy–Schwarz.
The inequality first ensures that the sum of two functions is in . For , apply Hölder to and . It follows that Division proves the triangle inequality when the sum has positive norm; the zero case is immediate. For use the pointwise triangle inequality. Homogeneity and definiteness on equivalence classes now give a norm.
Let be Cauchy in that norm, with . Choose indices so that . The partial sums of have norms at most . Monotone convergence of their th powers implies , so the subsequence converges pointwise outside a measurable null set to a finite measurable . Define on that set. The same argument applied to each tail gives In particular . The Cauchy property and the triangle inequality extend convergence from the subsequence to the entire sequence. For , remove the null sets on which the chosen differences violate the same bounds, as well as the null set on which the first term violates an essential bound. The series of differences converges uniformly on the complement, to a bounded measurable limit; its uniform tail bound gives convergence in .
Finally, if with , the sets increase to its nonzero set, up to a null set, and . Dominated convergence gives in . Partition a bounded region of the complex plane into squares of arbitrarily small side length to approximate uniformly by finite-valued measurable functions, zero outside . Their error is bounded by the uniform error times . This proves density. For , Cauchy–Schwarz, linearity and conjugation of the integral verify the inner-product axioms, and completeness was just proved.
Products with a spectral measure
A scalar spectral measure is a finite Borel measure; it need not be Lebesgue measure or have a density. The following construction therefore allows arbitrary sigma-finite measures. Its only integration inputs are the simple integral and monotone convergence proved above. Neither a spectral theorem nor Fourier analysis is used here.
Let and be measure spaces. The product sigma-algebra is the smallest sigma-algebra containing the rectangles with and . For , put and . We first prove the set-generation argument needed to construct the product.
Set-generation and uniqueness lemma. A family containing its whole underlying set and closed under finite intersections generates a sigma-algebra. Every family containing , closed under complements and countable disjoint unions, contains that sigma-algebra. Consequently two finite measures agreeing on agree on the generated sigma-algebra.
Proof. Call a family containing the whole set and closed under complements and countable disjoint unions a lambda-system. It is closed under differences of nested members: if belong to it, then is the complement of the disjoint union . Let be the intersection of all lambda-systems containing ; intersections preserve the defining properties.
For , the members for which form a lambda-system. The whole set belongs because ; complements follow from the nested-difference property applied inside ; disjoint unions follow by intersecting their disjoint pieces with . If , this system contains , hence contains by minimality. Thus whenever and . Fixing instead any , symmetry now shows that its system also contains , hence all of . Therefore is closed under intersections, complements and finite unions. Disjointifying a countable union using finite unions and differences proves that is a sigma-algebra. This proves the first assertion.
For finite measures with equal total mass, the sets on which their values agree form a lambda-system: complements use subtraction from that finite total, and disjoint unions use countable additivity. Agreement on includes the total mass and therefore implies agreement everywhere on its generated sigma-algebra.
Section lemma. If , all its sections are measurable. If is sigma-finite, then is -measurable. If is sigma-finite, then is -measurable.
Proof. For a rectangle, each section is either the corresponding factor or the empty set. Taking a section commutes with complements and countable unions. The sets with measurable sections therefore form a sigma-algebra containing the rectangles.
First suppose . The product-measurable sets for which is measurable form a lambda-system. For complements the section measure is ; for disjoint unions it is the sum of the nonnegative measurable section measures. On a rectangle it is . Rectangles form an intersection-closed family containing , so the set-generation lemma proves the assertion.
For sigma-finite , choose a measurable disjoint partition with : disjointify any countable cover of finite measure. The measures are finite on . The finite case and countable additivity give This is a measurable function, possibly infinite. Interchanging the roles of and proves the other assertion.
Product-measure lemma. For sigma-finite , there is exactly one measure on satisfying , with . It is sigma-finite, and
Proof. Define by the first integral, which is defined by the section lemma. It is zero at the empty set. Sections of disjoint sets are disjoint; countable additivity of and monotone convergence for the sum then prove countable additivity of . On a rectangle the integrand is , giving the claimed value, including zero and infinite cases by the definition of nonnegative integration. Reversing the order defines another measure with the same rectangle values.
Choose disjoint finite-measure partitions and . On each measurable block , both measures are finite and agree on all rectangles in the block. Those rectangles generate the trace product sigma-algebra: intersections with the block of the ambient rectangles are precisely such rectangles, and taking traces commutes with sigma-algebra generation. The uniqueness lemma proves equality on every measurable subset of the block. Summing over the countable disjoint blocks gives on the whole product and proves (MP2). Any other measure with the prescribed rectangle values has the same finite restrictions and is equal to by this argument. The same blocks prove sigma-finiteness. We write .
Tonelli and Fubini. Suppose are sigma-finite. For every nonnegative -measurable , its sections are measurable, the two section integrals are measurable, and The equalities include the value . For a real or complex product-measurable satisfying the sections are absolutely integrable almost everywhere, their integrals, defined to be zero on the exceptional sets, are measurable and integrable, and (MP3) holds for .
Proof. Measurability of sections follows by taking sections of the level sets, using the section lemma. For , all assertions in the nonnegative case are (MP2) and the section lemma. Finite nonnegative linear combinations give the same assertions for simple functions. Choose the increasing finite-valued approximations . For each fixed , monotone convergence gives . Hence that section integral is measurable; the other order is identical. Apply monotone convergence once more to each outer integral and to the product integral to prove (MP3).
Apply this conclusion to under (MP4). The nonnegative section-integral function has finite integral and so is finite almost everywhere: if it were infinite on a set of positive measure, its integral would exceed every finite bound by comparison with constants times that indicator. Thus its infinite set is measurable and null. On its complement, real and imaginary parts of the section of are absolutely integrable. Apply the nonnegative formula to the positive and negative parts of each component and subtract their finite integrals. On the null exceptional set set the resulting function to zero. This gives measurability and (MP3); the pointwise integral inequality bounds its absolute integral by the finite expression in (MP4). The same argument applies in the opposite order.
Completion. If the two factor measures are complete, the same assertions hold for the completion of , with measurable sections and section formulas asserted almost everywhere.
Proof. The completion consists of sets for which with product-measurable and , and assigns them measure . Two choices of differ by a measurable null set, so give the same value. Complements and countable unions preserve this description by taking the corresponding operations on the 's and the countable union of the null envelopes. For a disjoint union of completed sets, their representatives overlap only inside that null union; disjointifying those representatives proves countable additivity. Every subset of a completed null set is again of this form. This proves that the construction is a complete measure.
Every nonnegative function measurable for this completion has a product-measurable representative equal to it outside a product-measurable null set. To see this, take its finite-valued dyadic approximations. Replace each of their finitely many level sets by a product-measurable set differing inside a product-measurable null envelope. The resulting measurable simple functions agree with the approximations off one countable union of null envelopes. Their limsup is measurable and agrees with the original function off ; set it to zero on . For a real or complex function use its nonnegative components.
By (MP3) applied to , for almost every and for almost every . Outside these exceptional sets, completeness of the factors makes all modifications inside the sections of measurable and preserves their integrals. Apply the preceding theorem to the product-measurable representative. Extending the section integrals by zero on the exceptional sets proves the completed version. Completeness of the factors is used only here; the product-measurable version needs no such assumption.
For further reading, Axler's freely accessible Measure, Integration & Real Analysis, version 12 June 2026, §5A, 5.20 and 5.25–5.27, and §5B, 5.28 and 5.32 (pages 129–133), give the section, product and interchange theorems. The construction uses the proved intersection/lambda-system argument and uniqueness on finite blocks, then gives a separate completion argument. These source locators are credit and comparison; the complete proof needed for a spectral measure is above.
Euclidean measure and the product theorem used below
In cover a set by countably many bounded open axis-parallel rectangles and take the infimum of the sums of their volumes. The empty set and monotonicity properties are immediate. Combining covers with summable errors proves countable subadditivity; if the sum of outer measures is infinite there is no inequality to check. The splitting inequality for a coordinate half-space can be seen directly. For , split a covering open rectangle crossing the hyperplane into its left open part and an open rectangle containing its right part, extending that second rectangle to . The sum of their volumes exceeds the original volume by at most times the product of the other side lengths. Rectangles not crossing the hyperplane need no split. Choose the enlargements so that their total excess is below any prescribed . These rectangles cover the two parts of the set in question. For a set of finite outer measure, take a cover whose volume sum is within of its outer measure, and let tend to zero; an infinite outer measure makes the desired inequality automatic. Thus every coordinate half-space satisfies the outer-measure splitting criterion. Complements, finite intersections and countable unions of these half-spaces give every open set: each open set is the union of the rational rectangles contained in it. Thus the preceding outer-measure lemma makes all Borel sets measurable and supplies a complete measure.
A closed bounded rectangle has its usual volume. Enlargement gives the upper bound. For the lower bound, a cover by open rectangles has a finite subcover. Here is the needed compactness argument: if a closed box had no finite subcover, subdivision into equal boxes would leave one box without such a subcover. Iterate; the nested coordinate intervals have lengths tending to zero and, by real completeness, one common point. An open set of the cover containing that point contains an entire sufficiently small box, a contradiction. For the finite cover now obtained, draw the grid of all its coordinate endpoints and the target endpoints. The interior of each grid cell in the target lies wholly in any covering rectangle that contains its midpoint. Assign each cell to one such rectangle. Finite distributivity of products of interval lengths shows that the sum of the cell volumes is the target volume and that the sum assigned to each covering rectangle is at most its volume. This proves the lower bound without a product-integration assumption. Bounded faces have measure zero by arbitrarily thin rectangle covers. Translation invariance follows by translating covers and translating back. Increasing bounded boxes give sigma-finiteness.
We will also need the exact relation with Borel sets. If a measurable has finite measure, choose open rectangle unions with . Their intersection is Borel and contains , with . Every set of outer measure zero is contained in a Borel null set: intersect open rectangle unions of total volumes tending to zero. Thus differs from a Borel set by a subset of a Borel null set. For general , apply this argument to its intersections with bounded boxes and take the union of the resulting Borel sets and null envelopes. This proves the same assertion without a finite-measure hypothesis. Conversely, the completeness already proved makes every such modification measurable.
Here is the product argument without importing an interchange rule. Restrict first to two bounded boxes , . For a Borel rectangle whose two factors are axis rectangles, its sections are measurable and Let be the class of Borel subsets of for which this equality holds and is measurable. Sections of Borel sets are Borel: for each fixed , taking a section preserves complements and countable unions and sends generating rectangles to Borel sets. The class contains the whole box and the generating axis rectangles. It is closed under complements in the whole box, by subtracting from the finite constant and the finite total measure; it is closed under countable disjoint unions, by the monotone convergence theorem just proved applied to the nonnegative section measures. Thus it is a Dynkin class. The elementary pi-lambda argument shows that it contains the sigma-algebra generated by the rectangles. To recall that argument, take the smallest Dynkin class containing a family closed under finite intersections. For a fixed generator the class of sets whose intersection with it belongs to that smallest class is a Dynkin class; this proves intersections first with generators, and by repeating the argument with a fixed member, between any two members. A Dynkin class closed under finite intersections is a sigma-algebra, since differences and then disjointification give countable unions. This proves the claim.
Increasing the boxes proves the section formula for every Borel set in the full product. For a completed measurable set, enclose its null difference from a Borel set in a Borel null set. The section formula for that enclosing null set makes its sections null for almost every ; completeness then gives the same formula and measurability after one null exceptional set is discarded. This also applies to every completed-measurable function: outside a product null set it has a Borel representative, obtained by choosing Borel representatives of the level sets in a countable simple approximation. The section formula for indicators extends by simple approximation and monotone convergence to every nonnegative function. Applying it to the absolute value and then positive/negative real and imaginary parts gives Fubini for absolutely integrable complex functions. These are exactly all the product interchanges in this proof.
The finite-measure approximation used for Schwartz density follows from this construction too: choose an open rectangle cover of whose total volume is at most . Its union differs from by measure at most . Finite truncations approximate the union in measure by continuity from below. A finite union of boxes therefore approximates in measure. No density or product-measure theorem from the unverified inherited AN03 construction is used.
Fourier facts with the normalization retained
Read Coordinate inverses, integration and surface measure after the preceding measure subsection and before this subsection. Its complete change-of-variables proof, which uses only that measure subsection, justifies the polar substitution below. No Fourier fact is used to prove that substitution.
We use the exponential, powers, trigonometry and flat cutoffs proved in Elementary functions and cutoffs. First, for , the weight is integrable. On it is bounded and the ball lies in a finite box. On its integral is at most , by enclosure in a box of side . The geometric series converges. The same argument proves integrability of when . The exponential domination of powers in (EF9) implies that a Gaussian times any polynomial is integrable: split into a bounded ball and its complement and dominate there by any prescribed integrable negative power.
Schwartz space consists of smooth for which every is bounded. Equivalently all the seminorms are finite. Indeed gives one implication; expanding as a finite sum of monomials gives the other. The integrable-weight bound just proved shows that every polynomial times every derivative of is integrable.
Differentiation of its Fourier integral is justified by domination by : the exponential difference quotient is at most , by its scalar integral formula and modulus one. Iterating proves all frequency derivatives. For integration by parts, first multiply by a smooth cutoff equal to one near zero. The compactly supported scalar product rule and fundamental theorem give the identity without boundary terms. Derivatives falling on the cutoff have a factor and an integrable Schwartz bound; dominated convergence removes the cutoff and those errors. Thus and . Apply these identities repeatedly and use the finite product rule to obtain To check the bound, each with , is, up to constant factors, the transform of . Its absolute value is at most the norm of that expression. Each of its finitely many terms is bounded by . The same monomial expansion used for (F1) gives (F2). Consequently the transform preserves Schwartz space and is continuous in all its seminorms.
The preceding bounds make the one-variable Gaussian integral finite and positive. Its value is : square the integral, use polar coordinates in the nonnegative two-dimensional integral, and obtain . For its Fourier transform , differentiation and integration by parts give and , hence . Explicitly, the product and chain rules make the derivative of zero; scalar mean value makes it constant. The radial integral above is one by the primitive and its vanishing limit. All limiting radial integrals use monotone convergence. Product interchange proves the -variable formula.
For Schwartz and , absolute interchange and that formula give The right side tends to : substitute and use dominated convergence, since is bounded and continuous and the fixed Gaussian has integral one. Dominated convergence on the left, since , proves the exact inverse formula .
Apply the inverse formula to Schwartz and interchange its absolutely integrable product with . This gives Parseval: Thus is an isometry on Schwartz space; its inverse is . Schwartz space is dense in : finite-measure simple functions approximate by the function-space lemma above; for Euclidean Lebesgue measure, finite unions of bounded rectangles approximate finite-measure measurable sets in measure, by the rectangle outer-measure definition and finite truncation of a countable cover. A finite grid of all endpoints splits each finite union into boxes with disjoint interiors, up to null faces. Its indicator can therefore be approximated in by finite sums of products of the explicit smooth step cutoffs (EF16)–(EF18) between zero and one whose transition intervals shrink to each rectangle's faces. These products are smooth and compactly supported, and dominated convergence proves the approximation. Hence (3) extends by completion to the full forward and inverse unitary maps on . More explicitly, approximate an function by Schwartz functions. The isometry makes the transformed sequence Cauchy; completeness supplies a limit independent of the approximation. The inverse has the same property because its formula is the forward transform composed with reflection and the appropriate constant, and reflection preserves measure. The forward and inverse compositions equal the identity on the dense Schwartz subspace, hence on all of . This proves both isometry and surjectivity.
Fourier duality and weak derivatives
For clarity, a tempered distribution is a continuous linear functional on Schwartz space with its seminorms (F1); its pairing with a test is bilinear, written . Define These are continuous functionals by (F2) and the definitions of the seminorms. The inverse transform on tests is continuous by the same estimate and reflection; transposing the two inverse identities on Schwartz space proves that the distributional Fourier transform is invertible. For , differentiating the test Fourier integral gives , so (F3) gives This is an identity of tempered distributions, with the same unnormalized transform as (1).
The convention agrees with weak derivatives tested only against compact smooth functions. To see this, choose a smooth equal to one on the unit ball and supported in the ball of radius two. For every Schwartz , the functions converge to in all seminorms (F1). In the product-rule expansion of their difference, the term with no derivative on the cutoff is supported in , and every other term has the same support restriction and a bounded factor . For each term is therefore bounded in by . Two continuous functionals agreeing on compact smooth tests consequently agree on all Schwartz tests. Thus equality of tempered weak derivatives can be checked in either test class.
Each defines a tempered distribution , since Cauchy–Schwarz and the integrable-weight bound control by a seminorm (F1). This embedding is injective: if all pairings vanish, density of Schwartz functions in , applied to the conjugate test, makes . For Schwartz , absolute interchange gives . Approximation of in and Cauchy–Schwarz pass this identity to every function. Thus its distributional transform agrees with its transform. In particular, if is represented by an function, inverse unitarity and injectivity of the distributional transform imply that is represented by its inverse.
For every real , multiplication by is continuous on Schwartz space. Repeated product and chain rules express each derivative as a finite sum of a polynomial times a power of ; the real-power proof supplies these differentiations. On bounded sets these expressions are bounded, and outside the unit ball each has at most polynomial growth. The product rule therefore bounds each seminorm of by finitely many higher seminorms of . Transposition defines the corresponding multiplication of tempered distributions, and the products with exponents are inverse. This gives the weighted-distribution convention used in the Sobolev reading.
Packets and resolution of the identity
The earlier local Hilbert proof constructs representing vectors and bounded adjoints. Thus the adjoint of the analysis map below exists once its norm bound is proved. No compact-operator spectral theorem is used for the packet identity.
Fix the real Gaussian , so , and put The inner product is linear in the first variable. For Schwartz , (3) in the variable and nonnegative interchange give Therefore extends to an isometry . Polarization of (4) gives ; for a compactly supported smooth phase-space function , Here are the integral and representative details. The map is norm-continuous into . On a compact parameter set its pointwise differences tend to zero, and their squared absolute values are dominated by : for bounded , . Scalar dominated convergence therefore gives norm continuity. Thus is continuous with compact support into the complete space , hence strongly measurable and Bochner integrable by the exact integral construction, Sections 1–2. Pairing with a Schwartz test commutes with the integral and absolute scalar interchange gives exactly the adjoint identity (5).
For any the formula is the representative of . Indeed Schwartz approximants converge in each such pairing, uniformly in by Cauchy–Schwarz and . Their images also converge in phase-space by (4). A summable subsequence has the same almost-everywhere limit by the already proved completeness argument, identifying the two representatives. Finally, polarization can be checked directly by expanding (4) for and : both real and imaginary parts of equal those of . Hence for all , proving . The adjoint norm is one. No spectral theorem enters.
Off-diagonal matrix estimate
First let be smooth with compact support in . Formula (1) is bounded on even before (2): if the two projections of its support have finite measures , Cauchy–Schwarz in and (3) give . Density gives this bounded operator before any uniform seminorm estimate. We may therefore form without assuming the desired conclusion.
Write and . The Fourier transform of a packet is Set , , , . Substitution in (1) gives, with a constant phase of modulus one, where Integrate (6) by parts with . The corresponding factors on the displayed exponential are . Every derivative of is a finite sum of a derivative of of orders at most in each variable, times a polynomial in times the two fixed Gaussian functions and . All such Gaussian-polynomial factors have a fixed finite norm. The product rule therefore gives The boundary terms vanish because of Gaussian decay. This proves the estimate with the stated finite derivative count; no uncontrolled symbol derivatives enter the constant.
Schur estimate and extension
By (5), the matrix kernel of is . To justify this representation before invoking its bound, take . The already bounded compact-symbol operator commutes with the Bochner integral (5); pairing its value with gives the stated kernel formula. The packet continuity proves continuity, hence measurability, of this kernel in . The dyadic-box argument at the start of the Fourier subsection proves that the integrals of are finite precisely in the range needed here, . Estimate (7) bounds both every row integral and every column integral of the absolute kernel by .
For completeness, if a kernel has row bound and column bound , weighted Cauchy–Schwarz gives Integrating and applying nonnegative interchange yields . Initially take compactly supported tests, then extend by density. Thus . Because , , which proves (2) for compactly supported .
For general as in the statement, choose a fixed smooth compactly supported cutoff , equal to one near zero, and put for . The product rule gives uniformly. For a Schwartz , dominated convergence in the absolutely convergent integral gives pointwise; the dominating function is a constant times . Fatou then gives . Density proves the unique extension. The constant can absorb the one fixed cutoff and depends only on . This proves the full assertion.
Exact use after a dilation
For , if , then is unitary, and direct substitution in (1) gives Consequently apply (2) to the actual conjugated symbol. Its derivative factors are times the corresponding derivatives of evaluated at . A uniform bound on these finitely many quantities is exactly the hypothesis needed in AN06-U044. The theorem does not assert that an arbitrary dilation keeps the seminorm bounded automatically.