Approximation, convolution and integer Sobolev density
Written by GPT-6 Astra (OpenAI). Self-checked by the writing AI. Original exposition: CC0.
The rough-coefficient arguments need norm approximation, translation continuity, convolution bounds and actual compact smooth cores. This reading proves these facts with their exact endpoints. The freely accessible comparison is Terence Tao's Lecture notes 2, Theorem 6.4 and the approximate-identity discussion in Theorem 6.8 and Problem 6.9, printed pages 16–18. The proofs below do not use an interpolation theorem or cite a density assertion in place of proving it. Norm approximation is asserted for ; the uniform statement for continuous functions is separate.
The measure construction, monotone and dominated convergence and complete inequalities are proved in the earlier local measure and function-space construction; exact Euclidean product interchange is proved in Euclidean products. The latter also proves that finite-measure measurable sets can be approximated in measure by finite unions of bounded boxes. The same reading proves Fourier inversion and Plancherel, with and inverse factor . The facts proved here do not depend on choosing that transform or its unitary normalization.
1. The integral inequalities, including their endpoints
For conjugate exponents , the scalar inequality follows by minimizing over at , with the endpoint and derivative justified in the proved real powers and scalar Young inequality. Normalize two functions by their norms, integrate this inequality and undo the normalization. This proves Hölder's inequality. A zero norm is treated directly; the endpoint follows by taking an essential supremum out of the integral. Repeating the two-factor inequality proves the finite-factor version whenever the reciprocals of its exponents sum to one; a factor with exponent infinity is handled by its supremum.
We also use the triangle inequality in . For , apply Hölder to and divide by . One can first truncate to a finite-measure set with bounded functions, then pass to the limit; if the norm is zero there is nothing to divide. For or the assertion is the pointwise triangle inequality followed by the integral or essential supremum.
Theorem 1.1 (Young's inequality). If and then and have an almost everywhere absolutely defined convolution, and
Proof. If either input has zero norm the assertion is immediate, so assume both norms are positive. Choose Borel representatives, as supplied by the completed-measure construction. The function is then jointly measurable. A change of representative is supported, in coordinates , on a product with a null factor; its product measure is zero by Tonelli and a countable bounded-box exhaustion. The invertible linear change has determinant of absolute value one, so the proved linear substitution formula preserves that null set. Fubini then proves that the resulting convolution is independent of the representatives almost everywhere and is measurable. It suffices to bound the convolution of absolute values. If , (A1) is precisely the conjugate-exponent condition, so Hölder at each output point proves the assertion. If , then , and nonnegative product interchange gives (A2).
Otherwise ; (A1) implies , so both input exponents are finite. Factor the integrand as Apply the finite-factor Hölder inequality with reciprocal exponents , , , whose sum is one. If a latter exponent is zero, omit that factor, which is identically one. Raising the result to the power yields Integration in and the already proved product theorem give (A2). One can perform this first for bounded, compactly supported nonnegative functions and then increase their truncations; monotone convergence gives both the norm estimate and almost everywhere finiteness of the absolute convolution. This also justifies every displayed integral for the original functions.
2. Density and translation in finite integral norms
Theorem 2.1. For , compact smooth functions are dense in , and, with ,
Proof. Truncate to , . Dominated convergence makes its difference from tend to zero in . On the bounded box containing its support, approximate the real and imaginary parts by finite step functions with mesh tending to zero in the value variable. The uniform value error times the box volume to the power tends to zero. Thus simple functions with finite-measure level sets suffice.
For each such level set, the earlier box-approximation proof supplies a finite union of bounded boxes with symmetric difference of arbitrarily small measure. The distance of the two indicators is exactly the th root of that measure. A finite grid of their coordinate endpoints rewrites a finite union as a sum of indicators of boxes with disjoint interiors, up to faces of measure zero. For one box, products of smooth one-variable cutoffs, between zero and one, approximate its indicator pointwise away from its faces. They are supported in one fixed larger box. Dominated convergence gives convergence in . The full smoothness proof and these cutoffs are the explicit constructions (EF16)–(EF18); their transition intervals can be chosen inside any fixed enlargement of the box. Combining these finite approximations proves density.
Translation is an isometry of by invariance of Lebesgue measure. For and , the difference has support in one bounded set, and the proved line-segment fundamental theorem gives the uniform bound . Hence its norm tends to zero. For general choose such a with small error and use First make the first term arbitrarily small and then let tend to zero. This proves (A5).
3. The precise approximation by convolution
Choose a real nonnegative with integral one by taking the normalized flat bump at radius , and set .
Theorem 3.1. For every , , The convolution is smooth. If has compact support, it is compactly supported. If is continuous with compact support, convergence also holds uniformly. More generally uniform convergence holds for every bounded uniformly continuous .
Proof. By the substitution the difference is . Hölder against the probability measure gives, for , For this is the integral triangle inequality. Theorem 2.1 gives convergence of the integrand; its bound is integrable. Dominated convergence proves (A7). The absolute convolution and these interchanges are also justified by Theorem 1.1.
On each compact set of , every derivative of is bounded and supported in one fixed compact set of , where is integrable by Hölder. Differentiation under the integral is justified by dominated convergence, proving smoothness and its derivative formulas. The support is contained in the sum of the supports of and . For a bounded uniformly continuous , its modulus of continuity bounds the same difference uniformly by , which tends to zero. A continuous compactly supported function is uniformly continuous: on a sufficiently large compact ball use a finite cover by continuity neighborhoods, and outside that ball the function is zero. This proves the remaining claims.
No analogous norm statement is asserted for an arbitrary function. For example let and choose the normalized radial bump just described. Reflection in preserves the kernel and its integral, while the hyperplane is null, so . The convolution is , continuous in by dominated convergence, since each limiting hyperplane is null. Its limit at is . On strips of positive measure arbitrarily close to that hyperplane the error therefore approaches for every fixed . In particular its essential-supremum norm cannot tend to zero.
4. Integer Sobolev derivatives and compact smooth cores
For an integer put with the unitary Fourier norm. The distributional transform, its invertibility, its agreement with the transform, and its weighted multipliers are proved in Fourier duality and weak derivatives. If , multiplication by shows that is represented by an function. Thus is represented by its inverse. Conversely any weighted transform defines this tempered distribution. Multiplying copies of and grouping monomials gives with every coefficient positive and bounded above and below by positive constants depending only on . Plancherel and (F4) therefore show This equivalence includes membership: the distributional identity , proved by testing and integration by parts, identifies these derivatives with functions exactly when the polynomially weighted Fourier integrals are finite. The zeroth term already puts in . More explicitly, if all weak derivatives through order are , (F4) and the agreement of the two transforms identify each with its transform, and the finite positive sum just computed is integrable. The converse uses the same sum and inverse unitarity. With the norm , the weighted transform is an isometric bijection onto : its inverse first multiplies in frequency by and then applies the inverse unitary transform. Pulling back the inner product therefore also proves that is a complete Hilbert space.
Theorem 4.1. Compact smooth functions are dense in , and translations act continuously in its norm. Multiplication by a compact smooth function obeys the distributional product rule and is continuous on .
Proof. Translation continuity follows by applying (A5) with to each derivative in (A9). The weak product rule follows for one derivative by applying the weak-derivative identity to the test function multiplied by the smooth factor; induction gives its full multi-index form. For a compact smooth factor, its derivatives through order are bounded, so this product rule and (A9) give continuity.
Choose , where is smooth, compactly supported and one near zero. The term tends to zero in by dominated convergence. Every other term in is bounded in by with . It too tends to zero. Hence in .
For a fixed , convolution of with is compactly supported and smooth by Theorem 3.1. Its weak derivatives satisfy To check this equality, test against a compact smooth function, interchange the integrals, and use the weak derivative identity on ; the integrals are absolutely convergent on the relevant compact sets by local and Hölder. Theorem 3.1 at makes every right-hand side tend to in . Thus mollification converges in . Choose large and then small to make the two errors arbitrarily small. This proves density.
For a coefficient in finite with compact support, Theorem 3.1 therefore supplies compact smooth approximants in the actual coefficient norm. For a continuous compactly supported leading coefficient it supplies uniform approximants. These are exactly the two distinct approximations used when a rough differential expression is smoothed.
5. Oscillatory integrals and continuous Hilbert-space averages
Proposition 5.1. If , then as .
Proof. By Theorem 2.1 choose with arbitrarily small . The Fourier difference has supremum at most this norm. For each nonzero , choose with and integrate the compact smooth Fourier integral by parts in . This gives . Thus tends uniformly to zero outside large balls. The arbitrarily small Fourier error proves the assertion.
The Hilbert-valued averages used to preserve symmetry can be constructed without assuming an integration theorem for operator-valued functions. If is continuous with compact support and is a complete Hilbert space, subdivide a box containing the support into small boxes and form tagged Riemann sums. Uniform continuity on the large box bounds the norm difference of sums on a common refinement by its volume times the modulus of continuity. Hence the sums are Cauchy as the mesh tends to zero and define . The triangle inequality on the sums gives . Pairing with any fixed vector commutes with the limit, so it commutes with this integral. Scalar continuous integrals here agree with their Lebesgue integrals: upper and lower simple sums differ by the same vanishing modulus bound. The same tagged step functions converge to in the Bochner norm, with error at most the box volume times that modulus, so this integral also equals the proved Banach-valued integral.
In particular, for a nonnegative integer , if is bounded and , then is continuous in . Indeed for , split its difference as The first term tends to zero by translation continuity and boundedness of ; the second does so by translation continuity. Multiplying by a compact smooth averaging weight therefore gives the integral just constructed. If each translated expression is symmetric on compact smooth inputs and the averaging weight is real, its integrated pairing identity proves symmetry of the average. This is the precise integral used in the elliptic-domain approximation; no coefficient derivative or unproved operator-valued integral is needed.
Further reading
Tao's free notes supply the classical convolution statements and the approximate-identity comparison. Section 1 gives a direct finite-factor Hölder proof of Young's inequality, including all endpoints; Sections 2–4 prove the particular density and derivative statements required here. The finite- restriction in the approximation theorem and the separate uniform-continuity hypothesis are explicit. In particular, the printed endpoint of Theorem 6.8 conflicts with Problem 6.9; the half-space calculation above explains why it is excluded here. The proof retains the valid endpoint as well. The earlier programme measure and Fourier proofs, together with the arguments on this page, supply the actual prerequisites for these statements.