Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-26 (gpt-6-sol)
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 Lp spaces and a complex-linear operator. Let (X,A,μ) and (Y,B,ν) be measure spaces. Let 1≤p0,p1<∞, let 1<q0,q1<∞, let 0<θ<1, and define 1pθ:=1−θp0+θp1,1qθ:=1−θq0+θq1,

Suppose T is a complex-linear map from the almost-everywhere classes of complex finite simple functions with finite-measure nonzero set on X to measurable complex almost-everywhere classes on Y, and suppose M0,M1≥0 satisfy ∥Tf∥q0≤M0∥f∥p0,∥Tf∥q1≤M1∥f∥p1 for every such f. Then T extends uniquely to a bounded linear operator T~:Lpθ(μ;C)→Lqθ(ν;C) satisfying ∥T~f∥qθ≤M01−θM1θ∥f∥pθ(f∈Lpθ(μ)).

Facts & Assumptions

Given: Countable choice, the complex-linear operator T on finite simple classes, endpoint bounds with nonnegative constants M0,M1, and 0<θ<1.

[L1]

On arbitrary measure spaces, the finite-simple-core interpolation lemma gives ∥Tf∥qθ≤M01−θM1θ∥f∥pθ for every complex finite simple class when q0,q1<∞. 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)

[L2]

Complex finite simple classes with finite-measure nonzero set are dense in Lp(μ;C) for finite p, on every measure space. (Complex finite-simple and smooth compact-support density for finite p)

Proof

technique · the published normalized finite-simple-core estimate, followed by completion
1.1L1given

Since both target endpoint exponents are finite, [L1] applies on the arbitrary measure spaces in the statement. Put K=M01−θM1θ. For every finite simple class f in the domain of T, it proves both Tf∈Lqθ(ν;C) and [L1, given] ∥Tf∥qθ≤K∥f∥pθ. The source proof treats f=0 separately and normalizes every nonzero f 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 M0=0 or M1=0.

2.1L2L3step 1.1

Let f∈Lpθ(μ;C). Since pθ<∞, [L2] supplies a sequence of finite simple classes fn→f in Lpθ. By step 1.1, (Tfn) is Cauchy in Lqθ. Countable choice is used through [L3] to obtain its limit; define T~f=lim⁡nTfn.

3.1step 1.1step 2.1

If gn→f is another finite-simple approximation, step 1.1 gives [step 1.1, step 2.1] ∥Tfn−Tgn∥qθ≤K∥fn−gn∥pθ→0, so the limit is independent of the approximation. Taking limits in the same estimate gives ∥T~f∥qθ≤K∥f∥pθ. Constant approximations show that T~ extends T, and termwise linearity shows that it is complex-linear.

4.1L2step 3.1∎

Any bounded linear extension agrees with T on the dense core from [L2]; continuity makes it agree with T~ on every f. 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