Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-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.

The Lp range: interpolation below two and adjoint duality above two

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)).

Let T be a linear operator defined on L1(Rn)+L2(Rn) that is bounded on L2(Rn) with norm B, let T∗ denote its adjoint with respect to the L2 pairing, and suppose that T and T∗ both satisfy the weak (1,1) bound ∣{∣Tf∣>λ}∣≤Aλ−1∥f∥1 for every f∈L1(Rn) and λ>0 (and likewise for a compatible linear extension of T∗ to L1+L2). Then for every 1<p<∞, p≠2, T is bounded on Lp(Rn): for 1<p<2 the operator norm is at most Cp:=[p(2Ap−1+4B22−p)]1/p, and for 2<p<∞ it is at most Cp′, the same expression evaluated at the conjugate exponent p′=p/(p−1)∈(1,2).

Facts & Assumptions

Given: A linear operator T on L1+L2, bounded on L2 with norm B; its L2 adjoint T∗; weak (1,1) bounds with constant A for both T and T∗; an exponent 1<p<∞, p≠2, with conjugate p′; Countable Choice.

[F1]

T∗ is the bounded L2 adjoint: ⟨Tf,g⟩=⟨f,T∗g⟩ for all f,g∈L2(Rn;C) with the first-variable-linear pairing ⟨u,v⟩=∫uv‾, and T∗ is likewise bounded on L2 with norm B (The Hilbert-space adjoint of a bounded operator, Complex Lp classes and Euclidean test-function conventions).

[F2]

Let (X,μ) be σ-finite, 1<q<2, and let S be a sublinear operator on L1(X)+L2(X), weak (1,1) with constant A and strong (2,2) with constant B. Then ∥Sf∥q≤[q(2A/(q−1)+4B2/(2−q))]1/q∥f∥q for every f∈Lq(X) (Marcinkiewicz interpolation from weak (1,1) and strong (2,2)).

[F3]

Complex finite simple functions, and under Countable Choice also Cc∞(Rn;C), are dense in Lp(Rn;C) for every 1≤p<∞ (Complex finite-simple and smooth compact-support density for finite p, The Axiom of Countable Choice (ACω)).

[F4]

For 1≤p<∞ and conjugate q, ∥f∥p=sup⁡{∣∫fg dμ∣:g∈Lq,∥g∥q≤1} (The Lp norm is the supremum of pairings against unit Lq functions); the Hölder and Minkowski inequalities for the complex Lp spaces are recorded in Complex Holder, Minkowski, and the quotient norm, and the integral conventions in The class L1(μ) of integrable functions. Monotone convergence is Monotone convergence for the integral.

Proof

technique · direct
1.1F2given

Let 1<q<2 and f∈Lq∩L2. Then f∈L1+L2 and T is defined at f; sublinearity is automatic for the linear T, the weak (1,1) and strong (2,2) hypotheses are those assumed, so [F2] applies with (X,μ)=(Rn,λ) and gives ∥Tf∥q≤Cq∥f∥q with Cq=[q(2A/(q−1)+4B2/(2−q))]1/q.

2.1F3step 1.1algebra

Consequently, for every 1<q<2 the operator T has a unique bounded extension to all of Lq(Rn;C) with norm at most Cq: since Cc∞(Rn;C)⊆Lq∩L2 is dense in Lq by [F3], step 1.1 applied to differences of test functions shows that g↦Tg is uniformly continuous on this dense subspace, so it extends uniquely to the closure with the same bound.

3.1F1step 2.1given

The adjoint T∗ is a bounded linear operator on L2 with norm B by [F1]; it satisfies the weak (1,1) bound with constant A by hypothesis, and it is linear, hence sublinear. Therefore step 2.1 applies to T∗ at the exponent p′∈(1,2) whenever 2<p<∞: for every h∈Lp′(Rn;C), ∥T∗h∥p′≤Cp′∥h∥p′.

4.1F1F4step 3.1algebra

Let 2<p<∞, f∈Lp∩L2 and g∈Lp′∩L2 with ∥g∥p′≤1. Using g‾∈Lp′∩L2 and the adjoint identity of [F1] applied to the pair (Tf,g‾), ∣∫Rn(Tf)g dλ∣=∣⟨Tf,g‾⟩∣=∣⟨f,T∗g‾⟩∣≤∥f∥p ∥T∗g‾∥p′≤Cp′∥f∥p, where the first inequality is Hölder's inequality [F4] and the second is step 3.1 applied to h=g‾, which has ∥g‾∥p′=∥g∥p′≤1. To establish Tf∈Lp before using norm recovery, put u=Tf∈L2, EN=B(0,N)∩{∣u∣≤N} and aN=(∫EN∣u∣p)1/p. If aN>0, take gN=1EN∣u∣p−1θu/aNp−1, with θu=u‾/∣u∣ on u≠0 and zero otherwise. This test is bounded on a finite-measure set, hence lies in Lp′∩L2, and satisfies ∥gN∥p′=1, ∫ugN=aN. The preceding pairing bound gives aN≤Cp′∥f∥p; if aN=0 the same inequality is immediate. Since EN increases to a full-measure set, monotone convergence gives ∥Tf∥p≤Cp′∥f∥p.

5.1F3step 2.1step 4.1∎

If 2<p<∞, step 4.1 and the density [F3] of Cc∞⊆Lp∩L2 in Lp extend the bound to all f∈Lp with the same constant Cp′, exactly as in step 2.1. Together with step 2.1 for 1<p<2, this proves the asserted bounds for every 1<p<∞, p≠2.

Depends on

Used by

Dependency tree · two levels

58 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