Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04
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 (X,A,μ) and (Y,B,ν) be measure spaces. Let 1p0,p1<, let 1<q0,q1<, let 0<θ<1, and define 1pθ:=1θp0+θp1,1qθ:=1θq0+θq1, with the convention 1/:=0.

Suppose T is a linear operator on the finite simple functions of finite measure support on X, and suppose Tfq0M0fp0,Tfq1M1fp1 for every such f. Then T extends uniquely to a bounded linear operator T~:Lpθ(μ)Lqθ(ν) satisfying T~fqθM01θM1θfpθ(fLpθ(μ)).

Facts & Assumptions

Given: The operator T on finite simple functions of finite measure support, endpoint bounds with constants M0,M1, and a parameter 0<θ<1.

[L1]

For finite p, simple functions with finite-measure support are dense in Lp. (Simple functions with finite-measure support are dense in Lp(μ) for 1p<)

[L2]

For 1q<, the Lq norm is the supremum of pairings against unit Lq functions. (The Lp norm is the supremum of pairings against unit Lq functions)

[L3]

Each Lq with 1q is complete. (Riesz-Fischer completeness of Lp for 1p)

Proof

technique · direct
1.1

First assume that f and g are finite simple functions of finite support [L1, L2, given, choose] on X and Y, respectively, with g chosen from Lqθ(ν) and gqθ=1. Write f=j=1maj1Ej,g=k=1bk1Fk, with the sets Ej,Fk pairwise disjoint and of finite measure.

L1L2givenchoose
2.1

Define the analytic families [step 1.1, construct, algebra] fz:=j=1mαjajpθ((1z)/p0+z/p1)1Ej, gz:=k=1βkbkqθ((1z)/q0+z/q1)1Fk, where αj=aj/aj and βk=bk/bk when the coefficient is nonzero and 0 otherwise. Then fθ=f and gθ=g. For real t, direct calculation on each simple coefficient gives fitp0=fpθpθ/p0,f1+itp1=fpθpθ/p1, and likewise gitq0=gqθqθ/q0=1,g1+itq1=gqθqθ/q1=1.

step 1.1constructalgebra
3.1

Put [step 2.1, given, algebra] Φ(z):=Y(Tfz)(y)gz(y)dν(y). Because fz and gz are finite linear combinations of exponentials in z, Φ is continuous on the closed strip S={zC:0Rez1} and holomorphic on its interior. For real t, the endpoint bounds and Holder give Φ(it)M0fitp0gitq0M0fpθ, Φ(1+it)M1f1+itp1g1+itq1M1fpθ.

step 2.1givenalgebra
4.1

Fix δ>0 and define [step 3.1, construct, algebra] Ψδ(z):=Φ(z)(M0+δ)z1(M1+δ)z. By step 3.1, Ψδ is at most 1 on the two boundary lines of the strip. Multiplying once more by exp(ε(z21)) and applying the maximum-modulus principle on large rectangles inside the strip shows that Ψδ(z)1 throughout S. Evaluating at z=θ and letting first ε0 and then δ0 yields Φ(θ)M01θM1θfpθ.

step 3.1constructalgebra
5.1

Since Φ(θ)=(Tf)gdν, step 4.1 gives [L1, L2, step 4.1, algebra] (Tf)gdνM01θM1θfpθ for every unit gLqθ(ν) that is finite simple with finite support. By density [L1] and norm recovery [L2], it follows that TfqθM01θM1θfpθ for every finite simple f of finite support.

L1L2step 4.1algebra
6.1

Now let fLpθ(μ). By [L1], choose finite simple functions [L1, L3, step 5.1, algebra] fn of finite support with fnf in Lpθ(μ). Step 5.1 makes (Tfn) Cauchy in Lqθ(ν), so [L3] gives a limit hLqθ(ν) with hTfnqθ0. If (gn) is another such approximating sequence for f, then step 5.1 applied to fngn shows TfnTgnqθM01θM1θfngnpθ0, so the limit h is independent of the chosen approximation. Define T~f:=h. Passing to the limit in step 5.1 yields T~fqθM01θM1θfpθ.

L1L3step 5.1algebra
7.1

The definition in step 6.1 extends T, because a constant approximating [step 6.1, algebra] sequence may be used when f is already finite simple of finite support. Applying step 6.1 to f+g and to cf shows that T~ is linear, since linearity holds termwise on every approximating sequence. If S is any other bounded linear extension of T to Lpθ(μ), then for every fLpθ(μ) and every approximating sequence (fn) from step 6.1, SfT~fqθS(ffn)qθ+T~(fnf)qθ0, so S=T~.

step 6.1algebra
8.1

Steps 5.1, 6.1, and 7.1 prove the interpolated bounded extension theorem.

step 5.1step 6.1step 7.1

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