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.
Riesz-Thorin interpolation theorem
Statement
Let and be measure spaces. Let , let , let , and define with the convention .
Suppose is a linear operator on the finite simple functions of finite measure support on , and suppose for every such . Then extends uniquely to a bounded linear operator satisfying
Facts & Assumptions
Given: The operator on finite simple functions of finite measure support, endpoint bounds with constants , and a parameter .
For finite , simple functions with finite-measure support are dense in . (Simple functions with finite-measure support are dense in for )
For , the norm is the supremum of pairings against unit functions. (The norm is the supremum of pairings against unit functions)
Each with is complete. (Riesz-Fischer completeness of for )
Proof
First assume that and are finite simple functions of finite support [L1, L2, given, choose] on and , respectively, with chosen from and . Write with the sets pairwise disjoint and of finite measure.
Define the analytic families [step 1.1, construct, algebra] where and when the coefficient is nonzero and otherwise. Then and . For real , direct calculation on each simple coefficient gives and likewise
Put [step 2.1, given, algebra] Because and are finite linear combinations of exponentials in , is continuous on the closed strip and holomorphic on its interior. For real , the endpoint bounds and Holder give
Fix and define [step 3.1, construct, algebra] By step 3.1, is at most on the two boundary lines of the strip. Multiplying once more by and applying the maximum-modulus principle on large rectangles inside the strip shows that throughout . Evaluating at and letting first and then yields
Since , step 4.1 gives [L1, L2, step 4.1, algebra] for every unit that is finite simple with finite support. By density [L1] and norm recovery [L2], it follows that for every finite simple of finite support.
Now let . By [L1], choose finite simple functions [L1, L3, step 5.1, algebra] of finite support with in . Step 5.1 makes Cauchy in , so [L3] gives a limit with If is another such approximating sequence for , then step 5.1 applied to shows so the limit is independent of the chosen approximation. Define Passing to the limit in step 5.1 yields
The definition in step 6.1 extends , because a constant approximating [step 6.1, algebra] sequence may be used when is already finite simple of finite support. Applying step 6.1 to and to shows that is linear, since linearity holds termwise on every approximating sequence. If is any other bounded linear extension of to , then for every and every approximating sequence from step 6.1, so .
Steps 5.1, 6.1, and 7.1 prove the interpolated bounded extension theorem.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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
- Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, 2nd ed., Theorem 6.27 (standard reference, not scraped)
- Richard F. Bass, Real Analysis for Graduate Students, Chapter 24.2 (standard reference, not scraped)