How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Carleson restricted weak interpolation
Statement
Assume AC. If the uniformly linearised finite model operators are restricted weak type (r,r) and (s,s), with 1<r<p<s<infinity, they are strong type (p,p), uniformly in the selector and finite family.
Facts & Assumptions
The layer-cake identity computes from the level-set measures, also when the integral is infinite For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function.
Weak and strong type have their distribution and norm meanings Sublinear operators and weak or strong type bounds.
Each finite model is complex-linear and consists of finitely many Schwartz packet coefficients multiplied by measurable selector indicators Carleson tiles wave packets and tile order.
Complex Hölder and Minkowski hold, including on finite counting measure spaces Complex Holder, Minkowski, and the quotient norm.
Dominated convergence holds Dominated convergence.
Assume AC The Axiom of Choice, as inherited by the finite packet construction and its Fourier interfaces.
Proof
Given: and a finite model A. Restricted weak type means that there are constants independent of A such that for q=r,s, every measurable E with finite measure and every lambda>0 satisfies . This interpretation uses only characteristic inputs; the stronger convention allowing bounded supported inputs also suffices.
For q>1 define the testing functional , where the supremum is over measurable B of finite positive measure. It is homogeneous and subadditive by the integral triangle inequality. If , F1 with exponent one, applied on B, gives . For K>0 split the integral at ; for K=0 every positive level set is null and the bound is zero. Thus , where . Conversely, if , apply the definition to . When its measure is positive, ; when zero the same measure bound holds. Increasing R gives . This proves both comparisons even if the original level set could have infinite measure.
If u is a nonnegative simple function with , list its finitely many positive values in increasing order. It is the sum of their successive nonnegative differences times the indicators of the corresponding superlevel sets. Each such set lies in E and the differences sum to at most a. Linearity and step 1.1 therefore give for q=r,s. A complex simple u with is the sum of the positive and negative real parts and i times the positive and negative imaginary parts, each bounded by . Hence . The same result is zero for null E because its indicator has zero output almost everywhere by the assumed restricted bound and linearity of the finite coefficient formula.
Let f be a complex simple function supported on a set of finite measure. Put , and . There are only finitely many nonempty E_k, they are disjoint, and almost everywhere. For each integer n, split by summing over k>=n and k<n respectively. Subadditivity of the testing functional and step 2.1 give and , with . Since implies that one of the two pieces has magnitude greater than , the converse comparison in step 1.1 bounds its level-set measure by
Set . The sum over n of times the first term in step 3.1, apart from its constant, is For nonnegative numbers x_j and summable nonnegative weights w_j, finite Hölder gives . Here has finite sum W_r because p>r. Applying this inequality, then summing over n, bounds the display by . One may first use finite sets of n,j and then increase them: every summand is nonnegative and each shifted sum of the finitely supported b is at most . Likewise the second term gives where since s>p. These are two explicit geometric sums, not an interpolation theorem used as an undeclared supplier.
Apply F1 to Af and split the positive t-axis into . Monotonicity of its level-set measure yields . The nonnegative sum is valid whether or not finiteness is known initially. Steps 3.1 and 4.1 bound it by , because on E_k. Thus the strong bound is established for every finite-support simple f, with C depending only on r,p,s and the two restricted constants, not on the finite family or selector.
For general , the same finite model formula makes sense: each packet belongs to and by its Schwartz decay, so F4 makes the coefficients absolute. More explicitly an exponent M with Mp>1 and Mp'>1 gives integrable powers of the packet bound. For every integer define , with , and put . Each component of takes only the values with , so is a simple measurable function supported on a finite-measure set. Componentwise rounding toward zero gives , while almost everywhere. Hence , and F5 gives . Hölder gives convergence of every packet coefficient; more strongly, the triangle inequality and selector bound give This finite auxiliary sum may depend on S; it is used only to identify the limit, not in the uniform estimate. Pass to the limit in step 5.1 using Minkowski's norm continuity to obtain the stated uniform strong bound. Empty finite families, zero simple functions and zero endpoint constants are covered without division by them. The strict inequalities r<p<s are exactly what makes the two geometric weights summable; no endpoint weak-to-strong inference is made. AC is inherited as identified in F6. This conditional interpolation proof does not assume that the Hunt restricted estimates have already been proved.
Depends on
Used by
Dependency tree · two levels
42 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Lacey, Carleson’s Theorem: Proof, Complements, Variations (standard reference, not scraped)