Convolution estimates and weak-gradient embeddings
Exposition by GPT-6 Astra (OpenAI), 4 October 2026. Public domain (CC0).
Kernel estimates recover functions from their weak derivatives. Near a kernel's singularity, local averages control the input; far away, integrability or cancellation supplies decay. We prove the needed maximal and fractional estimates before applying the Newtonian gradient identity. The resulting global estimates determine a function only modulo the constants or polynomials invisible to its prescribed derivatives.
We use complex-valued functions, completed Lebesgue measure on , , and . Supremum norms are essential suprema unless continuity has been proved. Write
with value zero if there are no distinct pairs.
The integration foundations, Sections 15.0–15.4 and 16, prove the measure, convergence, Fubini, Hölder, Minkowski, two-factor Young, density and mollification facts used below. Section 15.6 proves the planar polar formula. U011, Theorem 2.1 and Corollary 2.2, supplies boundary integration by parts; U020, Theorem 1.1, supplies the complete Newtonian normalization; U021, B0–B3 and Theorems 1.1, 2.1, 4.1, supplies distributional convolution and its local smoothness. U032, Lemma 1.3, proves the zero-coordinate-derivative result on joint tests. The Fourier foundations, F3, proves the Gaussian integral used in Solution 7. Additional maximal, fractional and dyadic facts are proved here.
Every finite number of Young factors
Theorem 1.1 (finite-factor Young, including endpoints). If , , and
, the successive convolution of belongs to , with
For compact continuous inputs the estimate holds at every point.
Proof. Put . Since the omitted reciprocals are at most one,
The included reciprocals give . Thus every intermediate exponent is allowed, , , and
. Apply the full two-factor Young proof in the integration foundations, Section 15.2, at each step. It includes zero norms and every infinite endpoint, and constructs the successive almost-everywhere convolutions. When this is just equality. Convolution of two compact continuous functions is compactly supported and continuous by dominated convergence on a fixed integration set; induction gives the same for factors. A continuous function satisfying an essential bound satisfies it everywhere, since a strict violation persists on a ball of positive measure.
Endpoint norms and the reflected kernel
Lemma 1.2 (smooth tests determine every integral norm). For and ,
Either side may be infinite. The pairing is bilinear; its maximizing phase is the conjugate of the phase of .
Proof. Hölder gives the upper bound whenever the left side is finite. To prove the reverse bound, suppose the supremum on the right is a finite number . Its defining inequality extends to every bounded measurable compactly supported . Indeed choose a nonnegative compact smooth of integral one. The integration foundations, Sections 15.2–15.4, give
, including , and convergence to in . Choose a sequence with errors at most . Tonelli shows that the sum of the absolute errors is finite almost everywhere, so this sequence converges almost everywhere. The smoothed functions have modulus at most and supports in one compact set. Dominated convergence against the locally integrable therefore yields
This argument uses no density assertion in the norm.
Put where , and zero elsewhere. For , take
With , (E2) gives . The integral is finite. Division when it is positive gives ; when it is zero this is immediate. Monotone convergence proves . For , use , whose supremum norm is at most one, and then monotone convergence. For and , if has positive measure, it has an intersection of positive finite measure with some bounded ball. The function has integral norm one, and (E2) gives . Thus almost everywhere. These arguments also show that a finite supremum forces a finite norm, settling the infinite case.
Proposition 1.3 (exact endpoint criteria and dual bounds). Let , and write . A bound
holds if and only if
The best constants agree, for all . In particular,
When either criterion holds, the ordinary almost-everywhere convolution on all of the stated input space has this same operator norm.
Proof. Convolution of a locally integrable with a compact smooth test is smooth: on every compact output neighborhood, all kernel values used in
lie in a fixed compact set; derivatives of the test are uniformly bounded there, so dominated difference quotients apply. Fubini, with both test supports compact, gives
Absolute integrability follows by bounding the tests and integrating over the bounded set of their differences, with one additional finite support-volume factor. Assuming (E3), Hölder bounds the left side by . Lemma 1.2 applied to , with , proves (E4). Reflection twice and the same argument prove the converse, with the identical constant.
If , continuity makes the essential bound in (E3) valid at zero. Hence
Lemma 1.2 gives . Conversely Hölder gives the convolution bound with exactly . For , use (E4), whose output exponent is infinity; the criterion just proved gives , and Young supplies sufficiency. Reflection preserves every norm. Young and Hölder define the convolution on the whole input space with the stated upper bound; the smooth tests already force the same lower bound. At input exponent infinity, this is a direct integral construction, with no assertion that compact smooth functions are norm dense.
The locally integrable function hypothesis matters. The distribution acts by the identity on , but it is not an kernel function. For , , the integral diverges both at zero and at infinity. To see both divergences without a polar formula, integrate on the disjoint shells . Scaling gives the same positive finite integral on every shell, for all integers . The endpoint criteria therefore rule out both strong and bounds. The intermediate estimates below have a different mechanism.
A kernel difference is a Hölder estimate
Theorem 2.1 (every homogeneous kernel). Let be homogeneous of real degree . If and
then for compactly supported , every convolution value is absolutely defined, is continuous, and
.
For , the exponent is .
Proof. Homogeneity and the chain rule give
and
, using maxima on the compact unit sphere. Fix , . On
, each argument of either kernel is within of its own singularity. If , put , with for . Inner dyadic shells of radius bound the integral of by a constant times . To see the bound for either sign of , use the larger of and on the shell and its containing cube of volume . The sum converges because .
Outside those two balls, and the segment has length from the origin at least . The fundamental theorem gives
The outward-shell integral converges because
. Taking -th roots of both estimates yields
At , one has and extends . On the near region the supremum is ; on the far region it is . Thus the same inequality holds with .
The local estimate makes the convolution with compact input absolutely finite at every ; away from the possible singularity the kernel is bounded on the fixed integration set. Hölder applied to the difference of the two kernels gives the claimed modulus and continuity. Fubini on a compact output test identifies this function with the compact-factor distributional convolution. No positivity, radiality, or derivatives beyond were used.
Example 2.2 (a complex asymmetric kernel). On , take
For , splitting the integral at gives
The endpoint values are and . Theorem 2.1 gives exponent using , and using . Dividing the change at zero by and rationalizing gives limit . Thus no exponent greater than holds at that endpoint.
The fractional kernel has a finite strong range
We first prove the maximal estimate needed for fractional integration. Using cubes makes their measure and every dilation factor explicit. Set
For locally integrable , the average at fixed is continuous in : on any bounded region localize to an function, and bound the change by its translation difference, proved in the integration foundations. A supremum of continuous functions is lower semicontinuous, so is measurable.
Lemma 3.0 (complete maximal estimates). For and ,
For ,
and is a contraction on .
Proof. Take any compact subset of . For every , choose a witnessing cube centred at with integral greater than times its volume. A finite subfamily covers . Sort it by decreasing side length, retaining a cube exactly when it is disjoint from all retained cubes. Every discarded cube intersects a retained cube of at least its side length and is contained in that retained cube dilated by three about its centre, by the coordinate triangle inequality. Thus
Inner regularity of Lebesgue measure, already proved in the integration foundations, gives the weak bound for the open level set, including when its measure was initially allowed to be infinite.
For , split , where
and . The function is in , since . Sublinearity and imply
For any nonnegative measurable , the scalar identity
and Tonelli give its integral identity, even with infinite values. Apply it to , insert the preceding estimate, and use Tonelli again:
This proves finiteness and the strong estimate without an interpolation theorem. The assertion follows from the bound on each average.
Theorem 3.1 (strong and weak fractional integration). Put
If and , then
.
For , its potential is absolutely finite almost everywhere and
Neither strong nor strong holds.
Proof. Work with , so every preliminary integral is nonnegative and Tonelli applies before finiteness is established. Let , , and put . On the inner shells , the kernel and the centred-cube bound give
Indeed the -th bound is
. If , Hölder and outward shells give
Here the kernel power has exponent
; summing its shell integrals proves the bound. At , the far kernel is at most , giving the same estimate with .
If , the potential is zero. Otherwise at every point, since some large cube about any point contains positive input mass; Lemma 3.0 makes finite almost everywhere. At such a point choose . With , the two bounds become
For , let , so . Taking the -th power, integrating, and applying Lemma 3.0 gives the claimed estimate and absolute finiteness. For , and a level set of the potential is contained, up to the null set where , in
The weak maximal bound gives
, as required. The relation of exponents in the theorem is exactly .
For the first excluded endpoint choose . On the outer cube shell , , the potential is bounded below by , since on the input cube. The shell has volume . Its contribution to the -th power integral is bounded below by a fixed positive number, because . Disjoint shells force divergence.
For the other endpoint put , choose , and define
Since , its power norm is a constant times , while its norm is a constant times
.
For , , and , one has . The contribution from is therefore at least . Hence on a cube of positive measure. These sums tend to infinity, proving infinite essential supremum. The weak endpoint just proved still gives almost-everywhere finiteness for this input.
Proposition 3.2 (the sup-norm interpolation estimate). For and ,
The integral is absolutely defined at every point.
Proof. Set and . The same inner-shell argument, using almost everywhere, gives . The far estimate above gives , including . For positive norms choose ; both terms have the form
, and . These estimates hold at every , since translating a null exceptional set does not affect an integral. If either norm is zero, almost everywhere and the conclusion follows directly.
Example 3.3 (one kernel, three bounds). For , , the same unnormalized kernel maps to , since . It maps to weak , in the level-set sense of Theorem 3.1. For , Proposition 3.2 gives
.
A distribution with an integrable gradient is a function
We will use two uniqueness facts explicitly. A locally integrable function defining the zero distribution is zero almost everywhere: localize it, convolve with a compact smooth mollifier, and test the zero distribution on its translates on a smaller region. The convolutions vanish there and converge in local to the function, by the integration foundations, Section 15.4. A distribution whose every coordinate derivative is zero is a scalar on each product box: apply U032, Lemma 1.3, one coordinate at a time. Each remaining derivative of the reduced distribution is zero, as seen by testing with a normalized bump in the removed coordinate. After the last coordinate only a scalar remains. On overlapping boxes the scalars agree. On , a segment between two points has a finite chain of such overlapping boxes, so the scalar is global.
Lemma 4.0 (recover the local representative first). If on an arbitrary open , and for all , , then .
Theorem 4.1 (the local Sobolev exponent). Under the same hypotheses with , one has
.
Proof of both assertions. For , the Newtonian proof in U020, Theorem 1.1, gives the locally integrable kernels
Here is the area of the unit sphere with the normalization used in that proved theorem. At , take ; its derivative is by integration by parts on the half-lines.
Choose a cutoff compactly supported in , equal to one near a relatively compact region . The distribution extends compactly by zero. Differentiation of proper convolutions, proved in U021, gives
The inputs of the second sum have compact support separated from . Their convolution is smooth on , by U021's localized kernel proof in Theorem 4.1. For , the first sum only uses on a bounded region. These truncated kernels are , including ; Young's bound puts this sum in . This proves the local representative assertion before any multiplication of a function representative was presumed. Such representatives agree almost everywhere on overlaps by the uniqueness fact just proved.
For , necessarily , and
.
Apply Theorem 3.1 with to each compact input . The first sum is locally , and the smooth second sum belongs to that space on every compact subset of . This proves Theorem 4.1.
Theorem 4.2 (global Sobolev, modulo one constant). For , if and , there is a unique scalar with
Proof. Define , using the absolutely almost-everywhere integrals of Theorem 3.1. Then with the required bound. We must prove all its gradient identities; equality of Laplacians alone would not suffice.
Choose equal to one near zero, and put
.
These kernels are compact distributions and can be convolved with the original . Commuting distributional derivatives and using gives
The function is smooth and compactly supported away from zero. The last equality uses the degree of . Therefore
For almost every , the integrable majorant
permits dominated convergence as in the defining integral. The differences are bounded by
, where uses the unnormalized kernel . Dominated convergence for their -th powers thus proves
in .
Passing the derivative identity to distributions gives .
Every derivative of is zero, so the preceding box argument gives globally. A nonzero constant is not in finite , since the space contains infinitely many disjoint unit cubes. Thus this scalar is unique.
Theorem 4.3 (global and local Morrey, with the Lipschitz endpoint). If and all , then has a unique continuous representative and
On any open , local gradients give a continuous representative with finite seminorm of that exponent on every compact .
Proof. For and finite , the difference estimate in Theorem 2.1 applies to each with degree and . Define
Hölder and that full difference norm prove absolute convergence at every , , and
It remains to identify its derivatives. Use as above and subtract the resulting potential's value at zero. These values are finite: the compact kernel is in , since makes . Let
.
It vanishes near zero. The product rule and homogeneity give
For the cutoff-derivative term this uses on its annular support; for the other term it uses .
Fix and take small enough that . The segment from to then yields
The norm of this right side is , by outward shells or dilation, since . Thus the renormalized truncated potentials converge to uniformly on every bounded set. Their derivatives equal by the identity proved above, and their errors tend uniformly to zero. Hence in distributions. The zero-gradient argument gives and the desired representative and seminorm.
For and , put . Hölder on the oriented interval gives
Fubini against compact tests gives , and U032, Lemma 1.3, in dimension zero gives .
For , Lemma 4.0 first supplies . With a nonnegative smooth compact mass-one mollifier, let . U021 proves smoothness and
, so the segment integral gives
The approximate-identity proof gives in local . This convergence is locally uniform: for two parameters the difference has Lipschitz constant at most . Average
over a cube of fixed small radius about . On a compact set of centres, all cubes lie in one enlarged compact set. Choose their diameter to make the second term small and then use the -Cauchy property to make the first averaged term small uniformly in . Thus converges locally uniformly to a continuous representative with the same Lipschitz bound. Continuous representatives are unique, since their difference is zero almost everywhere and a nonzero continuous value persists on a ball.
Finally, for use Lemma 4.0 and a cutoff near . The compact function , extended by zero, has gradient
. Apply the global conclusion to this function. It yields the asserted local modulus on , including every cutoff term. Local representatives agree by uniqueness, so they define a continuous representative throughout , without assumptions on its boundary or connectedness.
Example 4.4 (the infinite-exponent endpoint is exact). On the line, integration by parts on the half-lines gives
and .
The gradient has norm one and the function has Lipschitz seminorm one. It is not classically differentiable at its corner.
Every lower derivative and the polynomial ambiguity
Theorem 5.1 (the full local higher-derivative range). Suppose , , and all order- derivatives of are locally . For , one has for every finite satisfying
It has a locally Hölder representative of every satisfying
Proof. Apply Lemma 4.0 to each derivative of order , whose gradient is the known order- array. Repeat downward to obtain local for every derivative through order , before seeking a gain.
Fix and . If , descend through the full derivative arrays using
At the -th step, , because
. Theorem 4.1 thus gives the next array in . Bounded-region Hölder inclusion supplies every smaller finite , proving the stated range in this case.
If an intermediate exponent is , then , since the original . On a fixed larger compact region, its gradients in lie in every , . The subcritical theorem gives exponent , arbitrarily large as ; bounded-region inclusion gives every finite exponent. If instead an intermediate exponent exceeds , local Morrey gives a bounded continuous representative, hence again all finite local exponents. For every remaining descent choose one sufficiently large finite exponent and apply the first-order assertions. This proves all finite when , without asserting boundedness at the critical equality.
For the Hölder claim choose a finite with
Such a positive reciprocal exists by the claimed hypothesis; if the lower bound is zero choose any sufficiently small positive value below the positive upper bound. The finite-integrability result for the order- array gives its local membership. If , these are the given order- derivatives and the inequalities force , so no higher-order gain is assumed. Morrey applied to gives exponent . On a compact set a bound at a larger exponent implies the smaller one by the factor ; singleton or empty sets have zero seminorm. The initial local membership also covers . At order itself there is only this latter inclusion, not an extra gain.
Theorem 5.2 (the global equality ranges, modulo polynomials). Suppose all order- derivatives of belong to , , . For , put . If , there is a polynomial of degree at most such that
If , a polynomial subtraction instead gives
In the first case is unique modulo polynomials of degree less than . In the second it is unique modulo degree at most , reduced to degree less than by normalizing all the order- representatives to zero at the origin.
Proof. Write . In the finite- case . Start with . At step , set . The preceding order- array lies in , with . Theorem 4.2 gives a scalar for each , such that
.
Subtract
in addition to . For , : a different same-degree monomial has a coordinate exponent smaller than the differentiating exponent and vanishes. All higher derivatives of vanish, so every preceding estimate is preserved. Iterating the finite array bounds proves the claimed norm estimate. The descent can continue through all orders for which , giving one compatible polynomial for all those conclusions.
For the Hölder case . Perform only the first Sobolev steps. The order- array then belongs to , where
Apply Theorem 4.3 to every order- derivative to obtain the bound. For there are no preliminary steps and . Subtracting
sets those values to zero without changing their seminorms or any higher derivative.
We prove the two polynomial facts behind uniqueness. If a nonzero polynomial has degree , its highest homogeneous part is nonzero at some nonzero real point. Here is the elementary algebra needed for that assertion. A one-variable polynomial vanishing at factors by , by applying to each term. Induction on its degree therefore bounds its distinct real roots by its degree. For several variables, write a nonzero polynomial as a polynomial in the last variable; one coefficient is a nonzero polynomial in fewer variables. By induction choose the other coordinates making that coefficient nonzero, and then choose the last coordinate outside the finite root set. Continuity permits the resulting nonzero value to be attained away from the origin. Scale such a point into , and choose a small closed box of positive volume in that annulus on which . On , homogeneity and the uniformly smaller lower-degree terms give for all large . These boxes are disjoint and have volumes . Their finite- integrals therefore have lower bounds
, whose sum diverges even when . Thus no nonzero polynomial belongs to finite global .
For , along a ray where the difference from grows like ; division by , , is unbounded. Thus a polynomial with finite global -seminorm is constant.
The order- derivative differences of two admissible subtractions are polynomials in in the first case, hence zero, and are polynomials with finite -seminorm in the second, hence constant. The monomial derivative calculation then says that the original difference has degree less than , or at most , respectively. The normalization removes the degree- part. Degree less than zero means the zero polynomial. No finite- or conclusion is asserted here at , and lies outside this global Hölder statement.
Decompose the input and use its zero means
Lemma 6.1 (dyadic decomposition on the full domain). For and , there exist disjoint half-open dyadic cubes and
Each is supported in , has integral zero, and
.
For compactly supported , all these functions have one common compact support.
Proof. Use cubes , , . At each scale they partition the space, and any two cubes from the lattice are disjoint or nested, by the one-dimensional dyadic interval property in each coordinate. Define
The lattice is countable, making measurable. Any cube of average greater than has a maximal such ancestor, because sufficiently large ancestors have average at most . The maximal high cubes are disjoint and cover the level set, so
Here is the needed differentiation theorem on this exact lattice. Let be the unique cube containing with side . For a continuous compactly supported , its averages on tend to , by continuity and the diameter tending to zero. For , define the measurable function
For any such , the triangle inequality gives
.
Consequently
The first term uses the dyadic weak bound; the second uses
.
Compact smooth density makes the right side arbitrarily small for every . Taking the union over positive reciprocal integers proves almost everywhere. Applying this to proves its average differentiation as well.
Now choose all maximal cubes whose average of exceeds . Their parents have average at most , so
Outside their union every dyadic average is at most ; the proved differentiation gives almost everywhere there. Put
Then , also for complex . Hence , , and
.
Each integral of is zero. Absolute convergence in follows from completeness or directly from the summable integrals; the pointwise decomposition off cube faces proves the stated identity.
If is supported in a compact set , a selected cube has side at most
, and its positive input integral forces its closure to meet . All selected cubes lie in one bounded enlargement of , giving a common compact support with . For , take and no cubes.
Lemma 6.2 (cancellation outside a doubled cube). Let have centre , side , and let be its concentric double. If is supported in and , then
with a constant independent of .
Proof. Write , . Off the doubled cube,
, whereas . On the entire segment,
Since , the fundamental theorem and the zero integral give
Each integral is absolutely finite there. On outward shells,
Raising the preceding pointwise estimate to the -th power and integrating cancels . Taking its -th root proves the assertion. Faces have measure zero by the supplied coordinate measure construction.
From cancellation to strong fractional estimates
The decomposition and tail estimate give a second proof of the fractional inequalities. The integral defining the operator, including the infinite sum of bad pieces, can be handled before using any weak bound.
Proposition 6.3 (the cancellation route to the weak endpoint). For , , and , the convolution is absolutely finite almost everywhere and
This follows from Proposition 3.2 and Lemmas 6.1–6.2 alone.
Proof. The inner-shell computation in Proposition 3.2 gives , since . For any bounded measurable ,
For the first inequality split at ; on the outer part . Tonelli gives the second. Exhausting space by bounded balls proves almost-everywhere absolute finiteness and continuity of this convolution map from into .
It suffices to take ; the zero function is immediate, and scalar multiplication will restore its norm. Decompose at height by Lemma 6.1:
, with disjoint cubes . Its proof gives
Proposition 3.2 at therefore gives
. Choose
. If , then
Indeed ; Lemma 6.2 and finite Minkowski give the bound for finite sums, and monotone convergence of their -th powers gives it for the full nonnegative sum. On every bounded , (C2) also shows
. Thus the series converges absolutely almost everywhere locally and in , and its sum is : apply (C2) to the remainders of Lemma 6.1. This identifies the series used in (C3) with the actual convolution.
Outside , exceeding requires the bad sum to exceed . For any nonnegative , the pointwise inequality bounds its level-set measure. Equations (C3) and the chosen give
For general nonzero , apply this to at level . This proves (C1).
Proposition 6.4 (a level-set interpolation proof). If and , then
Proposition 6.3 and the supremum estimate of Proposition 3.2 suffice; no maximal-function estimate is needed in this proof.
Proof. First , since . The zero input is immediate; normalize a nonzero input to . For each , split
The high part is integrable:
.
The low part belongs to . Thus its convolution is absolutely defined everywhere by Proposition 3.2, and the high part's is absolutely defined almost everywhere by (C2). Taking, for example, first proves that the absolute convolution of exists almost everywhere independently of subsequent choices of level.
Put , where is a positive constant valid in Proposition 3.2. Because , that proposition gives . For level choose . The weak bound for then implies
The level-set identity follows directly from
and Tonelli. Hence
Here is the integral triangle estimate with the weight actually required. For a nonnegative measurable and ,
To prove it, replace by
.
Its integral is bounded and supported on a set of finite -measure. Tonelli and Hölder give
Divide when the norm is positive, and treat its zero value directly. These truncations increase to ; monotone convergence, first in and then in , proves (C7), including infinite values. Hölder for this measure is the same scalar normalization proof as in Section 15.2 of the integration foundations.
Apply (C7) to . Since ,
At , both sides are zero. The right side of (C6) is therefore at most
which is a constant under our normalization. Taking the -th root and rescaling proves (C4) for every input. The proof includes absolute convergence and requires neither a prior strong fractional bound nor a limiting passage from compact inputs.
Figure. Left: averages of , with , approach the kernel as the unit-mass input concentrates. Solution 11 gives the exact formulas and endpoint norms. Right: for , the positive input has potential , whereas the mean-zero input has potential . Their absolute values have respective asymptotics and , proved in Solution 5. The logarithmic axes display the extra power supplied by cancellation. Editable figure script.
Interpolating two strong operator bounds
This section permits arbitrary measure spaces and ; no sigma-finiteness or semifiniteness is assumed. Functions and operators are complex-valued and complex-linear. Each consists of equivalence classes modulo null sets, with its usual integral norm or essential supremum. The scalar Hölder and completeness proofs in integration §§15.2–15.3 work on these spaces. The analytic input is precisely the finite-exponential-sum strip lemma proved in HA-LCA-08, Lemma 7.0.
Lemma 7.1 (convexity of reciprocal exponents). If , , , and
then
Proof. If either endpoint norm is zero, then almost everywhere. Suppose both are positive. When both exponents are finite, set , . They are positive and sum to one. Hölder applied to gives
Taking the -th root proves (S1). If and , then . Bound the factor by and integrate the remaining . This gives the same conclusion. Interchange the indices for the other mixed endpoint. If both are infinite, (S1) is equality.
Lemma 7.2 (simultaneous simple approximation). Suppose belongs to a finite list of spaces , , and at least one is finite. There are simple functions , each supported on a measurable set of finite measure, converging to in every listed norm, including any norm in the list.
Proof. Choose a representative finite outside a null set and set it to zero there. Put . A finite exponent gives . For every finite exponent, dominated convergence gives in its norm. If an infinity norm is present, take an essentially bounded representative. For , only values of modulus less than are removed; hence the supremum-norm error is at most .
Quantize the bounded complex values on with a finite square grid of mesh , and set the approximation to zero off . The pointwise error is at most ; each finite-norm error is at most , and the infinity-norm error is at most . Choose so all these finitely many errors are at most . If , choose the zero approximation. The triangle inequality proves every asserted convergence. This is approximation by measurable simple functions; it does not assert smooth or continuous density in .
Theorem 7.3 (Riesz–Thorin, with all endpoints). Let
be linear, where all four exponents lie in , and suppose
on the entire stated intersection, with finite . For , set
Then
If , extends uniquely to a bounded map with this bound and agrees with its original values on the intersection. If , the original domain already is all of .
Proof: zero constants and an infinite input exponent. If either , (S2) makes every original output zero as a function class, so the result follows, including its zero extension when required. Assume . If , (S3) forces . Apply Lemma 7.1 to in the two output norms, then (S2). This proves (S4) on the entire domain without any density argument.
Proof: simple inputs and finite output exponent. Now let . Begin with a nonzero simple of finite-measure support and normalize . On its nonzero set write , and set
with value zero on its zero set. Powers of a positive number use its real logarithm. At , one has : for finite this is ; for its modulus is one on its support.
Suppose first . Take a nonzero simple of finite-measure support in and normalize . If , define
Again it is zero on the zero set. Since , this gives and boundary norms , including infinite endpoint conjugates. If , (S3) forces ; use instead, retaining its infinity norm one.
Consider the bilinear scalar expression
This is a finite sum of exponentials with real exponents. Indeed write as finite disjoint simple sums. Linearity expands (S7) into constants times fixed phases and exponentials of real multiples of . Each constant is finite by an endpoint Hölder bound: , and for either endpoint. Thus there is no unproved parameter differentiation under an infinite integral.
Hölder and (S2) give on both vertical lines. The proved strip lemma gives . Since and , rescaling both inputs yields
for every such simple pair.
To obtain the output norm without assuming a representation of the dual space, write . At least one is finite because ; hence
has finite measure. On , is bounded. Uniform finite-grid approximation there extends (S8) to any bounded measurable supported there, in both the pairing and its norm, including . For , use . With , (S8) gives
If the required bound is immediate; otherwise divide. For , use , with norm at most one. Monotone convergence as proves (S4) for these simple .
Proof: the output infinity endpoint. If , then . Keep the simple normalized and choose representatives of the finitely many , finite everywhere after null modifications. Formula (S5) expresses as a finite combination of these same ; denote that representative by .
For and each rational , the endpoint bound gives outside a null set. Remove their countable union. For every remaining , the finite exponential formula is continuous in ; density of the rationals extends both bounds to every real . Apply the strip lemma to
It gives on this one full-measure set. Since represents , (S4) follows. This argument does not require finite-measure tests to determine the infinity norm on .
Proof: the full original domain and the extension. Given an original , Lemma 7.1 first places it in . At least one input endpoint exponent is finite. Lemma 7.2 gives simple of finite-measure support converging in both endpoint input norms and in . The endpoint estimates imply in both endpoint output norms.
When , choose a finite output endpoint exponent. Norm convergence in that finite exponent has an almost-everywhere convergent subsequence: select errors with summable norms and apply the summable-tail proof in HA-LCA-08, Lemma 0.1. Fatou applied to along that subsequence proves (S4) for . When , both endpoint output convergences are in the infinity norm, so the bound passes directly to that norm limit.
Finally simple finite-measure-support functions are dense in all of , by Lemma 7.2 applied just to this finite exponent. For an arbitrary Cauchy approximation, (S4) makes its images Cauchy in . Completeness, including , gives a limit independent of the approximants and a linear extension with the same bound. The preceding full-domain bound applied to shows agreement on the original intersection. Density proves uniqueness.
Figure 1. The left panel gives , ; an infinity exponent is represented by reciprocal zero. The right panel gives the exact norm of , not merely an upper estimate. The same straight exponent segment has endpoint constants 1 and 4. See Theorem 7.3 and Solution 14.
Exercises
Exercise 1 (basic). Put on the line. Find , its maximum, and its squared norm. Check the Young estimates using exponent triples and .
Exercise 2 (basic). Suppose all third derivatives of a distribution on belong to . State the global conclusions for derivatives of orders two, one and zero, including the polynomial ambiguity. Give the corresponding local finite-integrability and Hölder ranges on an arbitrary open set.
Exercise 3 (intermediate). For and , , compute , and . Determine the exponent for which can hold uniformly in .
Exercise 4 (intermediate). At level , perform the full dyadic decomposition of
Find the maximal selected cubes, the good and zero-mean functions, and all norms. Check every decomposition bound.
Exercise 5 (intermediate). Let and . Compute for . Prove its norm outside is at most . Compare its tail with that of .
Exercise 6 (intermediate). On , put for . Prove its weak gradient belongs to , while has no bounded or continuous representative near zero. Check every finite local conclusion.
Exercise 7 (advanced). For on , recover the scalar in Theorem 4.2 at , compute the resulting norm and each gradient norm, and derive a necessary lower bound on the theorem's constant.
Exercise 8 (advanced). On , let , with an arbitrary affine polynomial. Identify the polynomial in the order-two, , global embedding and its uniqueness. Using , prove a uniform estimate by the full Hessian array controls a finite global norm only at .
Exercise 9 (advanced). Put on the line and . Find and the exact global -Hölder seminorm. Rule out a uniform bound with a larger exponent from this gradient norm alone.
Exercise 10 (advanced). For , put
Prove , but has infinite essential supremum. Establish divergence on sets of positive measure. Explain its almost-everywhere existence and compare the other strong endpoint using .
Exercise 11 (introductory: exact endpoint norms). On , let . Find the norms of convolution by from to every , and from to , including both infinite endpoints. For , compute and show that these unit- inputs approach the first family of norms. Find an input attaining the norm.
Exercise 12 (intermediate: a weighted integral triangle calculation). Take , , and , where and . Evaluate both sides of (C7) for the function used in (C8), with . Explain why equality holds and verify the exponent identity in (C8).
Exercise 13 (advanced: countably many cancellation pieces). Suppose , each is supported in a cube , , and . The cubes need not be disjoint. Show that is an function and that
Identify the convolution with the full sum, and explain why cancellation is needed for the bound outside the doubled cubes.
Exercise 14 (foundation: an exact interpolation segment). On the real line let . Find its exact norm for all . Evaluate it on the segment , including its endpoints, and compare with (S4).
Exercise 15 (intermediate: the kind of approximation matters). Prove that finite-measure-support simple functions are dense in for the maximum of the two norms. Show that compact continuous functions are not dense there, by proving their infinity-norm distance from is at least .
Exercise 16 (advanced: a nonsemifinite output space). Give a one-point measure space on which every nonzero set has infinite measure. Identify , its finite-measure-support simple functions and every for finite . Construct a nonzero operator satisfying Theorem 7.3 with , and explain why testing only against finite-measure-support functions would miss its output.
Complete solutions
Solution 1. The overlap length gives
Indeed the intersection of and has length on , on , and zero elsewhere. Integrate this expression at over . The identity
then gives
It vanishes outside , by the support of the defining integral, and on that interval equals
The middle expression is , with maximum at ; the end pieces are at most . Their squared integrals contribute . The middle square integral is
Thus . Every finite norm of , and its supremum norm, is one. The triple has reciprocal sum and gives the bound in . The triple has sum and gives in .
Solution 2. Here . For order two, , so ; for order one, , so . Subtract the quadratic polynomial given by the constants at order two, and then the linear polynomial given at order one. The proof of Theorem 5.2 supplies one polynomial , of degree at most two, with
The last step is Morrey, since the first derivatives now lie in , and . The order-two conclusion alone fixes modulo affine polynomials. The order-one conclusion also fixes its linear part, leaving only a constant; the Hölder conclusion leaves that same freedom. Requiring fixes the constant as well.
On an arbitrary open set, every order-two derivative is locally for ; every first derivative is locally for ; and the function is locally for every finite . It is locally Hölder for every . Theorem 5.1 gives no positive Hölder exponent for orders one or two, since at those orders. The given third derivatives have the bounded-region inclusion .
Solution 3. Direct integration gives
The quotient in the proposed estimate is . If , it diverges as ; if , it diverges as . Thus only is possible, and any constant must be at least . Proposition 3.2 with proves that this exponent does give a uniform estimate, without a claim that its constant is optimal.
Solution 4. The absolute input integral is
. The cube has average , whereas its parent has average , and all further ancestors have smaller averages. Every high-average smaller dyadic interval lies in ; every disjoint interval has zero input integral. Thus there is exactly one maximal selected cube, . Its complex mean is
The single bad function, zero outside , is
Its integral is
.
Moreover,
These follow by multiplying each displayed modulus by its interval length. The measure bound is , and the selected average satisfies . Since , one has and . Pointwise , so the exact norm also satisfies . Hence , the stated combined bound. Both functions have support in the compact set , and almost everywhere.
Solution 5. For , both integration intervals lie to its left. Integrating the two square-root kernels gives
Since , subtract inside its integral. For , the fundamental theorem yields
The kernel is even and is odd, so their convolution is odd, by . Therefore
giving the required norm bound.
For an exact tail comparison, twice the scalar fundamental theorem gives, for any function on ,
Indeed write the left side as
, integrate over , and interchange the integrals. With , its second derivative is . Since the weight integrates to one and uniformly on ,
In contrast,
Multiplication by gives limit . For all sufficiently large , its square is bounded below by , whose integral diverges. The zero mean is precisely what removed this nonintegrable tail.
Solution 6. For ,
These are also its distributional derivatives. To check this before using any embedding, note that and the displayed gradient are locally integrable by the planar polar formula: the latter's radial integrand is , and the former is . Integrate by parts on a punctured disk containing the support of a test , using U011, Theorem 2.1 and Corollary 2.2. The outer boundary term is zero; the inner boundary term is bounded in modulus by
To verify the displayed boundary limit explicitly, write ; then , using . Local integrability permits passage to the limit in both volume terms, proving the weak derivative identity.
The vector gradient has the exact squared norm
For every finite , the same substitution gives
For completeness, choose an integer . On , , and the positive exponential series gives ; the remaining bound is an integrable multiple of . This also justifies the local integrability above and the vanishing boundary term, since logarithmic powers are dominated by these exponential bounds after substitution.
For any , all sufficiently small nonzero satisfy . Each such punctured disk has positive measure. Thus no almost-everywhere alteration can make bounded near zero. A continuous representative would be bounded on a sufficiently small closed disk by compactness, a contradiction. Here : the finite local conclusions hold for every finite , but the theorem gives no positive Hölder exponent at this equality.
Solution 7. The scalar is exactly the given . Indeed the Gaussian belongs to , and adding a nonzero constant makes its absolute value bounded below outside a sufficiently large ball, so it is no longer in finite .
The Gaussian integral from the Fourier foundations, F3, and the linear change of scale give
for . Tonelli in three coordinates yields
Each derivative is . Integrating
over and letting gives
The boundary values tend to zero and both integrals converge, since polynomial powers times a Gaussian are integrable by the exponential-series bound used in Solution 6. Thus
The constant in the sum-of-coordinate-norms version of Theorem 4.2 must therefore satisfy
This is a necessary lower bound, not a sharpness assertion.
Solution 8. For , the equality is . The polynomial is precisely the specified affine : the Gaussian is in , whereas its difference from any distinct affine subtraction has a nonzero polynomial part and is not in . For the last assertion, use the disjoint boxes in Theorem 5.2: the Gaussian tends to zero uniformly on those boxes at infinity, so it cannot cancel the polynomial's lower bound. Equivalently, two admissible subtractions differ by a polynomial in , necessarily zero. The first-derivative conclusion, obtained in the first step, is .
Put , . Every second derivative is a polynomial times that Gaussian, so its norm is finite by the preceding scalar exponential bounds and Tonelli. At least one such derivative is nonzero on a ball, making the sum of norms positive. Linear change of variables and the chain rule give
A uniform estimate for any finite would bound a positive constant times for all . If , this diverges as ; if , it diverges as . Thus is necessary, and Theorem 5.2 proves it sufficient. Allowing other affine subtractions cannot change this argument: every nonzero affine remainder has infinite finite- norm, as just proved.
Even is impossible uniformly: any nonconstant affine subtraction is unbounded, and subtracting a constant from , whose range has infimum zero and supremum one, leaves supremum norm at least by the triangle inequality. The Hessian bound tends to zero as .
Solution 9. One has , and
The pieces agree at both endpoints. Integration by parts on the three intervals therefore leaves no point masses and proves weakly. For a separation , its increment is at most
.
For , division by gives at most ; for , it gives at most . The pair attains one. Hence
For every larger exponent , that same pair gives the quotient , which diverges as . Thus the gradient norm alone gives no uniform larger-exponent bound. Additive constants have no effect on any of these quotients.
Solution 10. With , direct integration gives
Hölder on the interval of length gives
.
For , restrict the positive potential to . Since ,
For every prescribed level, this lower bound exceeds the level on an entire sufficiently short interval of positive measure. Thus the essential supremum is infinite; this is stronger than divergence at a single point. Theorem 3.1 at its weak endpoint guarantees absolute finiteness almost everywhere and the weak level-set estimate, since . Here denotes exactly that level-set conclusion.
For the other endpoint, . Solution 5 computed its potential and proved that the squared tail has divergent integral. Thus strong fails as well, despite the valid weak estimate.
Solution 11. For finite , direct integration gives
; .
Proposition 1.3 therefore gives
At the first formula in the second brace is , since .
Integrating the exponential on either side of zero yields
The two expressions agree at the endpoints. They converge pointwise to ; at zero, use . For and , the first expression is bounded by a fixed constant times , while on every average is at most one. Dominated convergence of the -th power of the difference proves convergence in each finite . Also : the absolute-value function is Lipschitz and the derivative of has modulus at most one for . Averaging gives uniform error at most . Thus the output norms converge to all the first-family values with input norms exactly one.
For , take , whose norm is one. Splitting the convolution integral at and for gives
Its maximum is one, attained at zero, and continuity makes the essential supremum one as well. This attains the norm in (E7).
Solution 12. Put . Then
For each , ; it vanishes elsewhere. Integration gives exactly the same answer. All nonzero sections are the same nonnegative function of , so the triangle estimate loses nothing. The exponent is
, and ensures integrability at . This checks the weighted calculation for actual sections, not just a formal exponent relation.
Solution 13. Tonelli gives . The series thus converges absolutely almost everywhere to , and its remainders have norms at most the tails of the convergent sum of norms. By (C2), the convolved series is absolutely convergent in for every bounded , and its sum equals there. Taking a countable exhaustion makes this an almost-everywhere identity on the whole space.
For , countable subadditivity gives , without disjointness. Lemma 6.2 and the finite triangle inequality give
.
Monotone convergence gives the same bound with for the whole sum. Apply outside , and include its measure, to obtain (C9). Cancellation is the hypothesis of Lemma 6.2 that supplies its integrable tail. Solution 5's positive interval input has a nonintegrable tail for , so this step cannot simply omit the zero-mean condition.
Solution 14. Hölder gives , including and . Also , with . Thus
The upper bound is attained by : its norm is , and its output is . The same calculation includes both infinite endpoints. On the indicated segment and , so (S10) is . Its endpoint norms are 1 and 4, giving equality in (S4) at every parameter.
Solution 15. Lemma 7.2 gives simultaneous convergence for the list , which is precisely convergence in the maximum norm. Suppose a continuous had . On the open negative half-line, continuity upgrades the almost-everywhere bound to everywhere; a strict violation would persist on an interval of positive measure. Taking limits to zero gives . On , the same argument gives , hence . The triangle inequality would imply . Therefore the distance is at least , even without requiring compact support. Measurable simple approximation and continuous approximation have different endpoint behavior.
Solution 16. Let , with measure zero on the empty set and infinity on . There are no nonempty null sets. Every scalar value is an function, and its norm is its absolute value. For finite , a nonzero scalar has infinite -th power integral, so . The only finite-measure-support simple function is zero.
Take with mass one, and . All input norms are the absolute value. Thus for any and , both endpoint constants are one and the interpolated norm is one. Every pairing against a finite-measure-support simple output test is zero, even when . The countable-boundary-values argument (S9) instead controls the actual output representative and proves its infinity norm directly.
Sources and exact proof dependencies
Lars Hörmander, The Analysis of Linear Partial Differential Operators I, second edition, Springer, §7.1, Theorem 7.1.12: interpolation between strong operator bounds.
HA-LCA-08, Lemmas 0.1 and 7.0: summable tails and the complete strip estimate for finite exponential sums. Theorem 7.3 uses these supplied arguments on arbitrary measure spaces and treats both infinite input and output exponents explicitly.
Terence Tao's freely available UCLA 247A Notes 3, pages 1–4, 13–14 and 23–24, provides the finite covering, maximal-function, density/differentiation and dyadic-decomposition mechanisms. Lemmas 3.0 and 6.1 above supply the full estimates and differentiation proof, including the strong maximal bound directly from level sets. No interpolation theorem is left as an external prerequisite.
The freely available MIT OpenCourseWare 18.S997 lecture 30, “Hardy–Littlewood–Sobolev inequality”, Sections 2–3, pages 1–4, develops the maximal-function and near/far balancing method. Theorem 3.1 above proves each shell estimate, balances the powers explicitly and proves both strong-endpoint failures for the precise unnormalized kernel used in this lesson.
Tao's UCLA 247A Notes 4, Lemma 2.7, pages 7–8, supplies the mean-zero kernel-subtraction mechanism. Lemma 6.2 gives the full argument for this lesson's fractional kernel, with its actual doubled cube and scale-independent tail integral. The gradient conclusions use the supplied Newtonian and distributional programme proofs identified before Section 1, and are derived fully in Sections 4–5. Every exercise has its complete solution here.
Lars Hörmander, The Analysis of Linear Partial Differential Operators I, second edition, Section 4.5, pages 116–124, treats Young bounds, fractional integration and weak-gradient embeddings. Lemma 1.2 and Proposition 1.3 give the endpoint norm and reflected-kernel arguments; Propositions 6.3–6.4 give the cancellation and level-set route to the fractional estimates, including the countable sums and weighted integral triangle inequality.