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
Assume countable choice. Work with complex-valued spaces and a complex-linear operator. Let and be measure spaces. Let , let , let , and define
Suppose is a complex-linear map from the almost-everywhere classes of complex finite simple functions with finite-measure nonzero set on to measurable complex almost-everywhere classes on , and suppose satisfy for every such . Then extends uniquely to a bounded linear operator satisfying
Facts & Assumptions
Given: Countable choice, the complex-linear operator on finite simple classes, endpoint bounds with nonnegative constants , and .
On arbitrary measure spaces, the finite-simple-core interpolation lemma gives for every complex finite simple class when . Its proof normalizes nonzero inputs and dual tests, establishes finite pairing integrals and strip holomorphy, then uses three-lines and finite-simple dual tests to prove target membership. (Riesz–Thorin estimate on the finite simple core)
Complex finite simple classes with finite-measure nonzero set are dense in for finite , on every measure space. (Complex finite-simple and smooth compact-support density for finite p)
Assuming countable choice, every complex is complete. (Complex Lp completeness and almost-everywhere subsequences, The Axiom of Countable Choice ())
Proof
Since both target endpoint exponents are finite, [L1] applies on the arbitrary measure spaces in the statement. Put . For every finite simple class in the domain of , it proves both and [L1, given] The source proof treats separately and normalizes every nonzero before applying the three-lines bound, so the endpoint powers of its norm are not replaced by a first power without justification. This also covers or .
Let . Since , [L2] supplies a sequence of finite simple classes in . By step 1.1, is Cauchy in . Countable choice is used through [L3] to obtain its limit; define .
If is another finite-simple approximation, step 1.1 gives [step 1.1, step 2.1] so the limit is independent of the approximation. Taking limits in the same estimate gives . Constant approximations show that extends , and termwise linearity shows that it is complex-linear.
Any bounded linear extension agrees with on the dense core from [L2]; continuity makes it agree with on every . Thus the extension is unique and has the asserted norm bound.
Depends on
Used by
Dependency tree · two levels
22 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)