Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31
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.

Lp norms converge to the essential supremum for essentially bounded Lr functions

Statement

Let 0<r<, let fLr(μ)L(μ), and put M:=f. Then fLp(μ) for every finite pr and

limpfp=M.

Facts & Assumptions

Given: A real exponent r>0 and a function fLr(μ)L(μ).

[L1]

If M=f<, then fM almost everywhere and M is the least essential bound (The essential supremum is attained as the least essential bound).

[L3]

The nonnegative integral is monotone and homogeneous (Monotonicity and nonnegative homogeneity of the nonnegative integral).

Proof

technique · The upper bound is $\|f\|_p^p\le\|f\|_\infty^{p-r}\|f\|_r^r$. For the lower bound, every $\varepsilon$ below the essential supremum leaves a set of positive measure where $|f|$ exceeds $\|f\|_\infty-\varepsilon$, forcing the $p$-norm above that level as $p$ grows
1.1

If M=0, then [L1] gives f=0 almost everywhere, so fpp=fpdμ=0 for every finite pr. Hence fp=0=M for all such p, and the conclusion follows in this case.

L1L3given
1.2

Assume from now on that M>0. For every finite pr, one has fpp=fpdμMprfrdμ=Mprfrr, because [L1] gives fp=frfprMprfr almost everywhere. Thus fLp(μ) and fpM1r/pfrr/p. In particular, lim suppfpM.

L1L2L3givenalgebra
2.1

Fix ε with 0<ε<M. Because M is the least essential bound, the set Eε:={f>Mε} has positive measure. For every finite pr, step 1.2 gives fp<, so fpp=fpdμEεfpdμ(Mε)pμ(Eε) forces μ(Eε)<. Therefore fp(Mε)μ(Eε)1/p, and letting p gives lim infpfpMε.

L1L3step 1.2given
3.1

Because 0<ε<M was arbitrary in the case M>0, step 2.1 yields lim infpfpM. Combined with step 1.2, this proves fpM, while step 1.1 already handled the case M=0.

step 1.1step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

11 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