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.
Interpolate L1 to Linfinity and L2 to L2 bounds
Statement
On sigma-finite measure spaces suppose a complex-linear finite-simple-core operator satisfies and , for finite . For , with , At p=1 and p=2 retain the respective given estimates. Under countable choice these maps have the unique compatible bounded extensions to the full Lp spaces.
Facts & Assumptions
The core interpolation bound holds at reciprocal-affine exponents on sigma-finite spaces Riesz–Thorin estimate on the finite simple core.
Conjugacy means reciprocal exponents sum to one, with reciprocal infinity zero Conjugate exponents, including the endpoint conventions.
Under countable choice the core bounds give unique compatible extensions Compatible extensions from the finite simple core.
Countable choice is assumed only for the full-space extension conclusion The Axiom of Countable Choice ().
Proof
Given: The objects and hypotheses in the statement.
For , set . Then , , and . Thus the core interpolation theorem with endpoints and gives exactly and proves membership in . Zero A or B is allowed because the interior powers are positive.
At p=1 the target is infinity and at p=2 the target is two, so the asserted estimates are the respective hypotheses. Assuming countable choice, the compatible-extension result applies with finite source endpoint exponents 1 and 2 and the given sigma-finite spaces, providing the claimed unique bounded extensions and agreement.
Depends on
Used by
Dependency tree · two levels
25 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
- Laugesen Theorem C.6 pp.168–173; Teschl Corollary 15.4 p.415 as application motivation (standard reference, not scraped)