Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Compatible extensions from the finite simple core

Statement

Assume countable choice and the hypotheses and measure-space alternatives of Riesz–Thorin estimate on the finite simple core. For each 0θ1 its core operator extends uniquely to a bounded complex-linear map Tθ:Lpθ(μ)Lqθ(ν) with the interpolated bound for interior theta and the original bound at either endpoint. Every two extensions agree as measurable a.e. classes on their domain intersection. Thus T0f0+T1f1 defines a well-defined linear map on Lp0+Lp1, and each interpolated extension is its restriction.

Facts & Assumptions

[F1]

The core map has a finite interpolated norm bound and the given endpoint bounds Riesz–Thorin estimate on the finite simple core.

[F2]

Under countable choice every complex Lq is complete and norm convergence has an a.e.-convergent subsequence, including q=infinity Complex Lp completeness and almost-everywhere subsequences.

[F3]

Finite simple functions with finite-measure support are dense for finite input exponents on every measure space Complex finite-simple and smooth compact-support density for finite p.

[F4]

Countable choices of approximants and representatives are permitted The Axiom of Countable Choice (ACω).

[F5]

The quotient norms are homogeneous and satisfy the triangle inequality Complex Holder, Minkowski, and the quotient norm.

[F6]

Pointwise convergence under an integrable majorant gives convergence of the integrals of the nonnegative errors Dominated convergence.

[F7]

The integer part uniquely specifies rounding to a mesh; positive values round down and negative values round up toward zero Integer part: for every real x there is exactly one integer m with mx<m+1.

[F8]

Integral monotonicity bounds the measures of positive level sets by finite moments Monotonicity and nonnegative homogeneity of the nonnegative integral.

[F9]

Products of positive bases and iterated real powers obey the exponent laws The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents.

[F10]

The real exponential is continuous and strictly increasing The exponential function is strictly increasing.

[F11]

For positive t, exp(log t)=t, so strict increase gives log t positive above one and negative below one The natural logarithm as the inverse of the exponential function.

[F12]

Positive real powers are exp of the exponent times the logarithm; zero to a positive power is zero Real powers for positive bases, with the zero-base positive-exponent convention.

Proof

Given: The objects and hypotheses in the statement.

1.1

Fix theta, put p=pθ and q=qθ, and denote its finite core bound by K (the stated endpoint bound when theta is an endpoint). Density and countable choice give finite simple sn for n1 with snfp<1/n for any fixed fLp. The bound TsnTsmqKsnsmp makes Tsn Cauchy. Completeness, with its stated countable-choice hypothesis, gives a limit; define Tθf to be that limit.

F1F2F3F4
1.2

To compare parameters a,b, fix a finite-valued measurable representative fLpaLpb. For n1, set En={1/nfn}. This set has finite measure because npaμ(En)fpa. On En, round each real and imaginary component toward zero to a multiple of 1/n2, and put sn=0 elsewhere. The rounding has finitely many values because the components are bounded by n; its fibers are measurable intervals, and its support lies in En. Also snf. At a point with f nonzero, it eventually belongs to En and the rounding error is at most 2/n2; at a zero of f every sn is zero. Thus snf pointwise and snfpj2pjfpj for j=a,b. Dominated convergence applied to these errors gives simultaneous convergence in both source norms.

F6givenF7F8F9
2.1

If (tn)n1 is a second core approximation converging to f, TsnTtnqK(snfp+tnfp)0, so the definition is independent of approximation. Approximate f and g separately; αsn+βtn approximates αf+βg, and core linearity gives linearity of the limits. Norm continuity gives TθfqKfp. Any bounded extension has the same limit on a dense core, proving uniqueness. This includes K=0.

F5step 1.1
3.1

By step 2.1, the one sequence Tsn converges in Lqa to Taf and in Lqb to Tbf. The a.e.-subsequence theorem first gives a subsequence converging a.e. to a representative of Taf; apply it again to that subsequence in Lqb to get a further subsequence converging a.e. to Tbf. Choosing representatives and taking the countable union of their measurable null discrepancies makes the two pointwise limits comparable on one conull set. Uniqueness of complex pointwise limits gives Taf=Tbf as classes. The supplier covers q=infinity as well.

F2F4step 2.1step 1.2
4.1

If f0+f1=g0+g1 with endpoint components, then h=f0g0=g1f1 lies in Lp0Lp1. Agreement gives T0h=T1h, so T0f0+T1f1=T0g0+T1g1. Componentwise addition and scalar multiplication prove linearity of this sum map.

step 2.1step 3.1
5.1

If p0p1 and fLpθ, split u=f1{f>1}, v=f1{f1}. For t>0, ts=exp(slogt); since exp is increasing and exp(0)=1, logt has the sign of t1. Thus powers increase with the exponent for t>1 and decrease for 0<t1; at t=0 all positive powers are zero. On the first set fp0fpθ, and on the second fp1fpθ. Thus uLp0Lpθ and vLp1Lpθ. Pairwise agreement and linearity give Tθf=T0u+T1v. If p1<p0, reverse the endpoint labels in this split. If they coincide, f is already in both endpoint spaces. This proves the restriction assertion for all theta, including the endpoints.

step 2.1step 3.1step 4.1F10F11F12

Depends on

Used by

Dependency tree · two levels

67 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