Alphabeta Math
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.

✓ 21 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 20 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Lp Spaces Holder Minkowski and Riesz Fischer

1 · Prerequisites

2 · Summary

This first Lp page fixes the quotient-first convention used everywhere later: elements of Lp(μ) are almost-everywhere classes, not pointwise functions. It proves the three structural landmarks the later pages actually consume: Holder, Minkowski, and Riesz-Fischer; records the finite-counting-space agreement seams against the published finite-dimensional inequalities; and keeps the comparison block together with the deliberately small 0<p<1 appendix.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Conjugate exponents, including the endpoint conventions

Definition

Numbers p,q∈[1,∞] are conjugate exponents when

1p+1q=1,

with the convention 1/∞:=0. Thus the endpoint pairs (1,∞) and (∞,1) are conjugate, and if 1<p<∞ then the conjugate of p is

q=pp−1.

No other endpoint pair is conjugate: (1,1) gives 2, while (∞,∞) gives 0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The essential supremum of a measurable function with respect to a measure

Definition

Let (X,A,μ) be a measure space, and let f:X→R be measurable. The essential supremum of ∣f∣ with respect to μ is

∥f∥∞,μ:=inf⁡{M∈[0,∞]:∣f∣≤M μ-almost everywhere}.

When the measure is fixed from context, this is written ∥f∥∞. The phrase essentially bounded means ∥f∥∞<∞.

The later proposition The essential supremum is attained as the least essential bound proves that when ∥f∥∞<∞, the inequality ∣f∣≤∥f∥∞ itself holds almost everywhere and that this bound is the least essential bound.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-31Open item page →

The function space Lp(μ) for 0<p<∞

Definition

Let (X,A,μ) be a measure space and let p be a real number with 0<p<∞. Write M(X,μ) for the measurable functions f:X→R. For f∈M(X,μ) define the extended-valued p-functional

∥f∥p:={(∫∣f∣p dμ)1/p,∫∣f∣p dμ<∞,+∞,∫∣f∣p dμ=+∞.

The finite power uses Real powers for positive bases, with the zero-base positive-exponent convention, while the second clause avoids applying real powers to the extended value +∞. The integral is the nonnegative Lebesgue integral of The nonnegative Lebesgue integral.

The class

Lp(μ):={f∈M(X,μ):∥f∥p<∞}

is the measurable-function space used on this page before passing to almost-everywhere equivalence classes.

For 1≤p<∞, the pointwise operations make Lp(μ) a real vector space by Lp and L∞ are vector spaces for p≥1.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The space L∞(μ) of essentially bounded measurable functions

Definition

Let (X,A,μ) be a measure space. The class

L∞(μ):={f:X→R:f measurable and ∥f∥∞<∞}

of essentially bounded measurable functions is the page's p=∞ space. Its size is measured by the essential-supremum functional of The essential supremum of a measurable function with respect to a measure.

The later theorem Lp and L∞ are vector spaces for p≥1 proves that L∞(μ) is a real vector space under pointwise addition and scalar multiplication.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-31Open item page →

The null subspace of measurable functions that vanish almost everywhere

Definition

Let (X,A,μ) be a measure space. Define

N(μ):={f:X→R:f measurable and f=0 μ-almost everywhere}.

This is the family of null representatives that will be quotiented out of each Lp(μ) and of L∞(μ). The linear-subspace claim implicit in that phrasing is proved in Null functions form a linear subspace and are exactly the zero-seminorm class.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-09-24 (gpt-6-sol)Open item page →

The space Lp(μ) as the quotient by null functions

Definition

Let (X,A,μ) be a measure space.

  • For 0<p<∞, define an equivalence relation on Lp(μ) by f∼g⟺f−g∈N(μ), and write Lp(μ) for the set of classes [f].
  • For p=∞, define the same relation on L∞(μ) and again write L∞(μ) for the set of classes.

Thus an element of Lp(μ) is an almost-everywhere equivalence class of measurable representatives.

When 1≤p≤∞, the displayed set quotient agrees with the usual quotient-vector-space construction of The quotient vector space V/W and its canonical projection.

For 0<p<1, the same class notation is used; under its stated choice hypothesis, the later item The Lp distance for 0<p<1 is a complete translation-invariant metric supplies the metric structure rather than a normed-space structure.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Elements of Lp are equivalence classes, so pointwise statements require a representative

Elements of The space Lp(μ) as the quotient by null functions are classes [f], not chosen functions. So formulas such as "f(x)=0" or "f(x)→g(x)" are not meaningful until a representative is named. Quantities invariant under changing f on a null set, such as ∥[f]∥p, are meaningful on the quotient; pointwise assertions are not.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

ℓp is the Lp space of counting measure

Remark

On (N,P(N),#) with counting measure, every function f:N→R is measurable. Writing ak:=f(k), one has

∫∣f∣p d#=∑k=0∞∣ak∣p(0<p<∞),

by the counting-measure integral dictionary, so Lp(#) is exactly the usual sequence class ℓp. Also

∥f∥∞=sup⁡k∈N∣ak∣,

because a subset of N has counting measure zero only when it is empty. Hence the quotient by almost-everywhere equality does nothing: for counting measure on N, equality almost everywhere means equality everywhere.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

Holder's inequality for integrals, including the endpoint cases

Statement

Let (X,A,μ) be a measure space, let p,q∈[1,∞] be conjugate exponents, and let f,g be measurable real-valued functions.

  1. If 1≤p<∞ and q<∞ with f∈Lp(μ) and g∈Lq(μ), then ∫∣fg∣ dμ≤∥f∥p∥g∥q.
  2. If p=1 and q=∞ with f∈L1(μ) and g∈L∞(μ), then ∫∣fg∣ dμ≤∥f∥1∥g∥∞.
  3. If p=∞ and q=1 with f∈L∞(μ) and g∈L1(μ), then ∫∣fg∣ dμ≤∥f∥∞∥g∥1.

In every case the right-hand side is finite, so fg is integrable.

Facts & Assumptions

Given: A measure space (X,A,μ), conjugate exponents p,q∈[1,∞], and measurable real-valued functions f,g in the spaces named in the relevant clause of the Statement.

[L1]
[L2]

For 0<r<∞, membership in Lr(μ) means ∫∣h∣r dμ<∞, while L∞(μ) means finite essential supremum (The function space Lp(μ) for 0<p<∞, The space L∞(μ) of essentially bounded measurable functions).

[L3]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[L4]

If h∈L∞(μ), then ∣h∣≤∥h∥∞ almost everywhere (The essential supremum is attained as the least essential bound).

[L5]

Young's inequality says uv≤up/p+vq/q for u,v≥0 when 1<p,q<∞ are conjugate (Young's inequality for conjugate real exponents).

[L6]

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

[L7]

The nonnegative integral is additive (Additivity of the nonnegative Lebesgue integral).

[L8]

The integral of a nonnegative function over a null set is zero (A nonnegative integral over a null set vanishes).

Proof

technique · For $1 < p < infinity$, normalize the nonzero norms and apply the published Young inequality pointwise before integrating. Treat the endpoint pairs $(1,\infty)$ and $(\infty,1)$ separately from the essential-bound definition
1.1L2L3L8given

Assume first 1<p,q<∞, and put A:=∥f∥p and B:=∥g∥q. If A=0 or B=0, then the corresponding power integral is 0, so [L3] makes the corresponding function vanish outside a measurable null set. By [L8], ∫∣fg∣ dμ=0. Thus only the case A,B>0 remains.

1.2L2L4L6L7L8given

For the endpoint pair (p,q)=(1,∞), let M:=∥g∥∞. By [L4] there is a measurable null set N outside which ∣fg∣≤M∣f∣. On N, [L8] gives zero integral for ∣fg∣χN and M∣f∣χN. Integrating the inequality on X∖N with [L6] and [L7] therefore gives ∫∣fg∣ dμ≤M∫∣f∣ dμ=∥g∥∞∥f∥1.

2.1step 1.1L1L2L5L6L7algebra

In the remaining strict-exponent case, Young's inequality applied pointwise to u=∣f∣/A and v=∣g∣/B gives [step 1.1, L1, L2, L5, L6, L7, algebra] ∣f∣∣g∣AB≤∣f∣ppAp+∣g∣qqBq. Integrating and using additivity, monotonicity, homogeneity, and the definitions of A and B yields ∫∣fg∣ dμ≤BpAp−1∫∣f∣p dμ+AqBq−1∫∣g∣q dμ=ABp+ABq=AB.

2.2step 1.2given

The case (p,q)=(∞,1) is identical after exchanging f and g. [step 1.2, given] ∫∣fg∣ dμ≤∥f∥∞∥g∥1.

3.1step 2.1step 1.2step 2.2L2∎

Step 2.1 proves the strict-exponent case, and steps 1.2 and 2.2 prove the two endpoint cases. In every case the right-hand side is finite by [L2], so fg is integrable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

Equality in Holder's inequality for 1<p<∞

Statement

Let 1<p<∞, let q be its conjugate exponent, and let f∈Lp(μ) and g∈Lq(μ). Then equality holds in Holder's inequality

∫∣fg∣ dμ=∥f∥p∥g∥q

if and only if at least one of f,g is zero almost everywhere, or there is a constant c>0 such that

∣f∣p=c ∣g∣qμ-almost everywhere.

Facts & Assumptions

Given: A measure space, an exponent 1<p<∞, its conjugate exponent q, and functions f∈Lp(μ), g∈Lq(μ).

[L1]

Holder's inequality for integrals has already been proved (Holder's inequality for integrals, including the endpoint cases).

[L2]

Young's inequality is the scalar step used in that proof (Young's inequality for conjugate real exponents).

[L3]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[L4]

Membership in Lp(μ) and Lq(μ) means finiteness of the corresponding power integrals (The function space Lp(μ) for 0<p<∞).

[L5]

For a weight strictly between zero and one, equality in the two-point exponential convexity inequality holds exactly when its two inputs agree (The two-point convexity inequality for the exponential function).

Proof

technique · Trace where equality can occur in the normalized Young-inequality proof. Equality in Young forces the normalized powers $|f|^p$ and $|g|^q$ to be proportional almost everywhere, and conversely that proportionality makes the inequality an equality
1.1L1L3L4

If ∥f∥p=0 or ∥g∥q=0, then the corresponding function is zero almost everywhere, and Holder's inequality becomes equality with both sides 0.

1.2L1L2L3

Assume now that A:=∥f∥p>0 and B:=∥g∥q>0. The proof of [L1] integrated the nonnegative function [L1, L2, L3] H:=∣f∣ppAp+∣g∣qqBq−∣fg∣AB. If equality holds in Holder, then ∫H dμ=0, so H=0 almost everywhere. Thus equality holds in Young's inequality pointwise almost everywhere for u=∣f∣/A and v=∣g∣/B.

2.1L2L5step 1.2algebra

To check the equality condition omitted from [L2]'s Statement, first suppose u,v>0. Apply [L5] to log⁡(up) and log⁡(vq) with weights 1/p and 1/q: its geometric side is uv, its arithmetic side is up/p+vq/q, and equality holds exactly when up=vq. If one of u,v is zero, equality in Young holds only when both vanish, again exactly when up=vq. Applying this criterion to step 1.2 gives [step 1.2, L2, L5, algebra] ∣f∣pAp=∣g∣qBqμ-almost everywhere, so ∣f∣p=(Ap/Bq)∣g∣q almost everywhere.

3.1step 1.1step 2.1L1L4algebra

Conversely, if ∣f∣p=c∣g∣q almost everywhere for some c>0 and neither function vanishes almost everywhere, integration gives Ap=cBq. Thus the normalized powers agree almost everywhere, so the scalar criterion from step 2.1 makes Young an equality almost everywhere and the integrated Holder proof becomes an equality. If either function vanishes almost everywhere, step 1.1 already applies.

4.1step 1.1step 2.1step 3.1∎

Step 1.1 handles the zero-function case, step 2.1 proves the strict necessity, and step 3.1 proves sufficiency. These are exactly the alternatives in the Statement.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

Generalized Holder inequality puts products into Lr

Statement

Let 1≤p,q,r≤∞ satisfy

1r=1p+1q,

with the convention 1/∞=0. If f and g lie in the corresponding measurable-function spaces (Lp(μ) or L∞(μ) according to whether the exponent is finite or infinite), then fg lies in the corresponding space for r and

∥fg∥r≤∥f∥p∥g∥q.

Facts & Assumptions

Given: Exponents p,q,r with 1/r=1/p+1/q and measurable functions f,g in the spaces named in the Statement.

[L1]

Holder's inequality for integrals, including the endpoint cases, is available (Holder's inequality for integrals, including the endpoint cases).

[L2]

Conjugate exponents include the endpoint convention 1/∞=0 (Conjugate exponents, including the endpoint conventions).

[L3]

For 0<s<∞, h∈Ls(μ) means ∫∣h∣s dμ<∞, and L∞(μ) means finite essential supremum (The function space Lp(μ) for 0<p<∞, The space L∞(μ) of essentially bounded measurable functions).

[L4]

If h∈L∞(μ), then ∣h∣≤∥h∥∞ almost everywhere (The essential supremum is attained as the least essential bound).

Proof

technique · Raise $|fg|$ to the $r$-th power and apply Holder to $|f|^r$ and $|g|^r$ with conjugate exponents $p/r$ and $q/r$
1.1L2L3L4given

If r=∞, then 1/p=1/q=0, so p=q=∞ by [L2]. Hence ∣fg∣≤∥f∥∞∥g∥∞ almost everywhere, and taking essential suprema gives ∥fg∥∞≤∥f∥∞∥g∥∞..

1.2L2L3L4given

If p=∞ and r<∞, then q=r. The pointwise bound and the definition of ∥g∥r give ∥fg∥rr≤∥f∥∞r∥g∥rr. Indeed, [L4] gives ∣f∣≤∥f∥∞ almost everywhere, so ∣fg∣r≤∥f∥∞r∣g∣r almost everywhere. Taking r-th roots yields the claim. The case q=∞ is symmetric.

1.3L1L2L3givenalgebra

Assume now that r<∞ and p,q<∞. Then 1=rp+rq, so the exponents p/r and q/r are conjugate. Because ∣f∣r∈Lp/r(μ) and ∣g∣r∈Lq/r(μ), [L1] applied to these two functions gives ∫∣fg∣r dμ≤(∫∣f∣p dμ)r/p(∫∣g∣q dμ)r/q=∥f∥pr∥g∥qr..

2.1step 1.1step 1.2step 1.3∎

Step 1.1 covers r=∞, step 1.2 covers the one-infinite endpoint cases, and step 1.3 covers the fully finite case. [step 1.1, step 1.2, step 1.3] In each case ∥fg∥r≤∥f∥p∥g∥q, so fg lies in the stated r-space.

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Cauchy-Schwarz inequality for L2

Statement

If f,g∈L2(μ), then

∫∣fg∣ dμ≤∥f∥2∥g∥2.

Equality holds if and only if at least one of f,g is zero almost everywhere, or there is a constant c>0 with

∣f∣2=c ∣g∣2μ-almost everywhere.

Facts & Assumptions

Given: Functions f,g∈L2(μ).

[L1]

Holder's inequality holds for conjugate exponents (Holder's inequality for integrals, including the endpoint cases).

[L2]

The strict-exponent equality criterion for Holder has already been proved (Equality in Holder's inequality for 1<p<∞).

Proof

technique · Specialize Holder to $p=q=2$, and inherit the equality clause from the strict-exponent equality theorem
1.1L1

The exponent 2 is conjugate to itself, so [L1] with p=q=2 gives [L1] ∫∣fg∣ dμ≤∥f∥2∥g∥2.

2.1L2step 1.1∎

Because 2>1, the equality clause is exactly the specialization of [L2] to [L2, step 1.1] p=q=2.

RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-08-31Open item page →

Finite counting measure recovers finite Holder and implies the signed Cauchy-Schwarz inequality

Via ℓp is the Lp space of counting measure, the measure space {0,…,n−1} with counting measure identifies Lp with the published p-norm structure of The p-norms ∥x∥p for rational p≥1, and ∥x∥∞. Under that identification, Holder's inequality for integrals, including the endpoint cases becomes Holder's inequality for finite sums and conjugate real exponents for p,q>1. At p=q=2, Cauchy-Schwarz inequality for L2 gives the stronger absolute-product estimate

∑k<n∣xkyk∣≤∥x∥2∥y∥2.

The real triangle inequality then gives ∣∑k<nxkyk∣≤∑k<n∣xkyk∣, recovering the signed estimates in The Cauchy-Schwarz inequality for finite sums and Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation. Thus the integral and finite forms are compatible, but the absolute-product and signed left sides are not identical.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

Minkowski's inequality for integrals, including p=∞

Statement

Let (X,A,μ) be a measure space.

  1. If 1≤p<∞ and f,g∈Lp(μ), then ∥f+g∥p≤∥f∥p+∥g∥p.
  2. If f,g∈L∞(μ), then ∥f+g∥∞≤∥f∥∞+∥g∥∞.

Facts & Assumptions

Given: A measure space and functions f,g in the spaces named in the relevant clause of the Statement.

[L1]

Holder's inequality for integrals is available (Holder's inequality for integrals, including the endpoint cases).

[L3]

If h∈L∞(μ), then ∣h∣≤∥h∥∞ almost everywhere (The essential supremum is attained as the least essential bound).

[L4]

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

[L5]

The nonnegative integral is additive (Additivity of the nonnegative Lebesgue integral).

[L6]

Holder's inequality for finite sums gives, for nonnegative reals a,b, a+b≤21/q(ap+bp)1/p when q=p/(p−1) (Holder's inequality for finite sums and conjugate real exponents).

Proof

technique · For $1 < p < infinity$, first use the two-term finite Holder inequality to show $|f + g|^p$ is integrable, then apply the standard Holder step to $|f + g| |f + g|^{p - 1}$. The cases $p = 1$ and $p = \infty$ are handled directly from subadditivity of absolute value and the essential-supremum bound
1.1L4L5given

If p=1, then ∣f+g∣≤∣f∣+∣g∣ pointwise, so [L4, L5, given] ∥f+g∥1=∫∣f+g∣ dμ≤∫∣f∣ dμ+∫∣g∣ dμ=∥f∥1+∥g∥1.

1.2L1L2L4L5L6givenalgebra

Assume 1<p<∞ and let q:=p/(p−1). Then [L1, L2, L4, L5, L6, given, algebra] ∫∣f+g∣p dμ≤2p−1(∫∣f∣p dμ+∫∣g∣p dμ)<∞. Indeed, [L6] applied pointwise to the two-term families (∣f(x)∣,∣g(x)∣) and (1,1) gives ∣f(x)∣+∣g(x)∣≤21/q(∣f(x)∣p+∣g(x)∣p)1/p, so ∣f+g∣p≤(∣f∣+∣g∣)p≤2p−1(∣f∣p+∣g∣p) pointwise. Thus f+g∈Lp(μ). Put C:=∥f+g∥p. If C=0, the claim is immediate. Otherwise ∣f+g∣p=∣f+g∣ ∣f+g∣p−1≤∣f∣ ∣f+g∣p−1+∣g∣ ∣f+g∣p−1. Because (p−1)q=p, the function ∣f+g∣p−1 lies in Lq(μ) and has q-norm Cp−1. Integrating and applying [L1] with conjugate exponents p and q to each term yields Cp≤∥f∥p(∫∣f+g∣(p−1)q dμ)1/q+∥g∥p(∫∣f+g∣(p−1)q dμ)1/q. Since (p−1)q=p, this becomes Cp≤(∥f∥p+∥g∥p)Cp−1. If C>0, divide by Cp−1 to obtain the claim.

1.3L2L3given

For p=∞, let M:=∥f∥∞ and N:=∥g∥∞. Then [L2, L3, given] ∣f+g∣≤∣f∣+∣g∣≤M+N. Indeed, outside the union of the two null exceptional sets supplied by [L3], one has ∣f∣≤M and ∣g∣≤N. Therefore ∥f+g∥∞≤M+N.

2.1step 1.1step 1.2step 1.3∎

Steps 1.1, 1.2, and 1.3 prove the p=1, 1<p<∞, and p=∞ cases.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

Equality in Minkowski's inequality for 1<p<∞

Statement

Let 1<p<∞ and let f,g∈Lp(μ). Then equality holds in Minkowski's inequality

∥f+g∥p=∥f∥p+∥g∥p

if and only if at least one of f,g is zero almost everywhere, or there is a constant λ>0 such that

f=λgμ-almost everywhere.

Facts & Assumptions

Given: An exponent 1<p<∞ and functions f,g∈Lp(μ).

[L1]

Minkowski's inequality has already been proved (Minkowski's inequality for integrals, including p=∞).

[L2]

The equality case in Holder has already been proved (Equality in Holder's inequality for 1<p<∞).

[L3]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[L4]

The nonnegative integral is additive (Additivity of the nonnegative Lebesgue integral).

Proof

technique · Examine the Holder step in the standard proof of Minkowski. Equality forces the nonnegative functions $|f|$ and $|g|$ to be proportional almost everywhere, and the pointwise triangle inequality then forces the same sign
1.1L1given

If at least one of f,g is zero almost everywhere, then equality is immediate.

1.2L1given

If f=λg almost everywhere for some λ>0, then [L1, given] ∣f+g∣=(λ+1)∣g∣ almost everywhere, so ∥f+g∥p=(λ+1)∥g∥p=∥f∥p+∥g∥p.

1.3L1L2L3L4

Conversely, assume equality in Minkowski and that neither f nor g is zero almost everywhere. [L1, L2, L3, L4] The proof of [L1] showed that equality in Minkowski can only occur when both inequalities ∣f+g∣≤∣f∣+∣g∣ and ∫∣f∣ ∣f+g∣p−1 dμ≤∥f∥p∥f+g∥pp−1 and its g-analogue are equalities. The second and third equalities force the pairs (∣f∣,∣f+g∣p−1) and (∣g∣,∣f+g∣p−1) to satisfy Holder equality. By [L2], this makes ∣f∣ and ∣g∣ proportional almost everywhere. The first inequality then forces (∣f∣+∣g∣)−∣f+g∣ to have integral 0; [L3] and [L4] therefore give ∣f+g∣=∣f∣+∣g∣μ-almost everywhere.

2.1step 1.3algebra

Let ∣f∣=c∣g∣ almost everywhere with c>0. Then [step 1.3, algebra] on the set where g≠0, step 1.3 gives equality in the real triangle inequality for f and g, so they have the same sign there. Hence f=cg almost everywhere on {g≠0}, and on {g=0} both sides vanish. Thus f=λg almost everywhere for λ=c>0.

3.1step 1.1step 1.2step 1.3step 2.1∎

Steps 1.1 and 1.2 prove sufficiency, while steps 1.3 and 2.1 prove necessity.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

On a finite counting space, Minkowski agrees with the published finite theorem for p>1

Under the finite counting-measure identification of ℓp is the Lp space of counting measure, the integral Minkowski inequality of Minkowski's inequality for integrals, including p=∞ becomes the published finite-sum theorem Minkowski's inequality for finite sums and real exponent p greater than one for real p>1 on the same coordinates. The integral theorem's p=1 and p=∞ clauses also specialize to the corresponding elementary finite-sum inequalities, but those endpoints are outside the cited theorem's statement. This is an agreement seam, not a second construction.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

The essential supremum is attained as the least essential bound

Statement

Let f:X→R be measurable on a measure space (X,A,μ), and suppose ∥f∥∞<∞. Then

∣f∣≤∥f∥∞μ-almost everywhere.

Moreover, if M≥0 and ∣f∣≤M almost everywhere, then

∥f∥∞≤M.

So ∥f∥∞ is the least essential bound of ∣f∣.

Facts & Assumptions

Given: A measurable real-valued function f with finite essential supremum s:=∥f∥∞.

[L1]

The essential supremum is the infimum of the essential bounds (The essential supremum of a measurable function with respect to a measure).

[L2]

Absolute values and threshold sets of measurable functions are measurable (Closure properties of measurable functions used by the integral).

[L3]

Countable subadditivity bounds the measure of a countable union (Finite and countable subadditivity of measures).

Proof

technique · Take the countable family of bad sets $\{|f|>\|f\|_\infty+1/n\}$; each is null by minimality of the infimum. Their union is null, giving $|f|\le\|f\|_\infty$ almost everywhere, and leastness is built into the definition
1.1L1L2given

For each n≥1, the number s+1/n is strictly larger than the infimum in [L1], so it is an essential bound. Therefore the measurable set En:={∣f∣>s+1/n} has measure 0.

1.2L1

If M≥0 and ∣f∣≤M almost everywhere, then M is one of the essential bounds in [L1], so the infimum s satisfies s≤M. [L1].

2.1step 1.1L3algebra

Put E:=⋃n=1∞En. Then E is measurable and μ(E)≤∑n=1∞μ(En)=0. If x∉E, then ∣f(x)∣≤s+1/n for every n, hence ∣f(x)∣≤s. Therefore ∣f∣≤s almost everywhere.

3.1step 2.1step 1.2∎

Step 2.1 proves that s itself is an essential bound, and step 1.2 proves that no smaller essential bound exists. Thus s=∥f∥∞ is the least essential bound. [step 2.1, step 1.2].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

Lp and L∞ are vector spaces for p≥1

Statement

Let (X,A,μ) be a measure space.

  1. For each 1≤p<∞, the class Lp(μ) is a real vector space under pointwise addition and scalar multiplication.
  2. The class L∞(μ) is a real vector space under the same operations.

Facts & Assumptions

Given: A measure space (X,A,μ).

[L2]

Sums, scalar multiples, and absolute values of measurable real-valued functions are measurable (Closure properties of measurable functions used by the integral).

[L3]

The nonnegative integral is monotone, additive, and homogeneous for positive finite scalars; the zero function has integral zero (Additivity of the nonnegative Lebesgue integral, Monotonicity and nonnegative homogeneity of the nonnegative integral).

[L4]

A finite essential supremum is an attained essential bound (The essential supremum is attained as the least essential bound).

[L5]

Countable unions of measurable null sets are measurable and null (Finite and countable subadditivity of measures).

[L6]

A vector space over R means the structure defined in Vector space over a field.

Proof

technique · direct
1.1L1L2L3givenalgebra

Fix 1≤p<∞ and let f,g∈Lp(μ) and a∈R. Measurability of f+g and af follows from [L2]. Pointwise, ∣f+g∣p≤(2max⁡{∣f∣,∣g∣})p≤2p(∣f∣p+∣g∣p). By [L3], ∫∣f+g∣p dμ≤2p(∫∣f∣p dμ+∫∣g∣p dμ)<∞. If a≠0, positive homogeneity in [L3] gives ∫∣af∣p dμ=∣a∣p∫∣f∣p dμ<∞; if a=0, the integral is zero without forming 0⋅∞. Thus f+g,af∈Lp(μ). The zero function belongs to the class, and additive inverses use a=−1.

1.2

Let f,g∈L∞(μ) with M:=∥f∥∞ and N:=∥g∥∞. There are measurable null sets Ef,Eg such that ∣f∣≤M on X∖Ef and ∣g∣≤N on X∖Eg. With E:=Ef∪Eg, E is measurable and null, and on X∖E one has [L1, L2, L4, L5, given] ∣f+g∣≤∣f∣+∣g∣≤M+N,∣af∣=∣a∣∣f∣≤∣a∣M. Thus f+g and af are essentially bounded; measurability again comes from [L2].

2.1step 1.1L6

The pointwise addition and scalar-multiplication identities are inherited from real-valued functions. Hence [L6] makes Lp(μ) a real vector space for every 1≤p<∞.

3.1step 1.2L6∎

The pointwise identities are again inherited from real-valued functions, so [L6] makes L∞(μ) a real vector space.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

Null functions form a linear subspace and are exactly the zero-seminorm class

Statement

Let (X,A,μ) be a measure space.

  1. For each 1≤p<∞, the set Np(μ):=Lp(μ)∩N(μ) is a linear subspace of Lp(μ), and for f∈Lp(μ) one has f∈N(μ)⟺∥f∥p=0.
  2. The set N∞(μ):=L∞(μ)∩N(μ) is a linear subspace of L∞(μ), and for f∈L∞(μ) one has f∈N(μ)⟺∥f∥∞=0.

Facts & Assumptions

Given: A measure space (X,A,μ).

[L1]

The null functions are those that vanish almost everywhere (The null subspace of measurable functions that vanish almost everywhere).

[L2]

Lp(μ) and L∞(μ) are vector spaces in the relevant ranges (Lp and L∞ are vector spaces for p≥1).

[L3]

A countable union of measurable null sets is null (Finite and countable subadditivity of measures).

[L4]

A linear subspace means the three closure conditions of Linear subspace of a vector space.

[L5]

For 1≤p<∞, a nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[L6]

If ∥f∥∞<∞, then ∣f∣≤∥f∥∞ almost everywhere (The essential supremum is attained as the least essential bound).

Proof

technique · Use countable-union stability of null sets for addition and scalar multiplication. For $1 \le p < infinity$, the $p$-seminorm vanishes exactly when the integral of $|f|^p$ is zero; for $p = infinity$, vanishing means the essential supremum is zero
1.1L1L2L3L4

Fix 1≤p<∞. If f,g∈Np(μ), choose measurable null sets Ef,Eg outside which f=0 and g=0. Their union is null, and on its complement one has f+g=0 and af=0 for every a∈R. Because Lp(μ) is a vector space, [L4] makes Np(μ) a linear subspace.

1.2

If f∈Np(μ), then ∣f∣p=0 almost everywhere, so [L1, L5] ∫∣f∣p dμ=0, hence ∥f∥p=0. Conversely, if ∥f∥p=0, then the same theorem [L5] forces ∣f∣p=0 almost everywhere and therefore f=0 almost everywhere.

1.3L1L6

If f∈N∞(μ), then 0 is an essential bound for ∣f∣, so ∥f∥∞=0. Conversely, if ∥f∥∞=0, then [L6] gives ∣f∣≤0 almost everywhere, hence f=0 almost everywhere.

2.1L1L2L3L4

If f,g∈N∞(μ), the same null-set union argument as in step 1.1 shows that f+g and af vanish almost everywhere, and [L2] places them in L∞(μ). Therefore [L4] makes N∞(μ) a linear subspace.

3.1step 1.1step 1.2step 2.1step 1.3∎

Steps 1.1 and 2.1 prove the two subspace claims, and steps 1.2 and 1.3 identify the zero-seminorm class in every range.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

The Lp norm descends to the quotient and makes Lp a normed space for 1≤p≤∞

Statement

Let (X,A,μ) be a measure space.

  1. For 1≤p<∞, the rule ∥[f]∥p:=∥f∥p([f]∈Lp(μ)) is well defined on the quotient classes.
  2. For p=∞, the rule ∥[f]∥∞:=∥f∥∞([f]∈L∞(μ)) is well defined.
  3. In either case, with the quotient vector-space operations of Coset equality, well-defined quotient operations, and the canonical projection with kernel W, the resulting pair (Lp(μ),∥⋅∥p) is a normed space in the sense of A norm on a real vector space, the induced metric, and the dictionary with the metric axioms.

Facts & Assumptions

Given: A measure space (X,A,μ) and an exponent 1≤p≤∞.

[L1]

The quotient spaces Lp(μ) are those of The space Lp(μ) as the quotient by null functions.

[L2]

The null representatives are exactly the zero-seminorm class (Null functions form a linear subspace and are exactly the zero-seminorm class).

[L3]

Minkowski's inequality supplies the triangle inequality for the representative seminorms (Minkowski's inequality for integrals, including p=∞).

[L4]

The essential supremum is an attained essential bound (The essential supremum is attained as the least essential bound).

[L5]

The quotient operations are well defined and produce a vector space (Coset equality, well-defined quotient operations, and the canonical projection with kernel W).

[L6]

A normed space means a real vector space with separation, homogeneity, and triangle inequality (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

Proof

technique · Use the previous proposition to identify the null functions as the kernel of the seminorm. Hence the seminorm is constant on cosets and separates points on the quotient, while Minkowski and homogeneity descend from representatives
1.1

Suppose first 1≤p<∞ and f−g∈Np(μ). Then ∥f−g∥p=0. Applying Minkowski twice yields [L2, L3] ∥f∥p≤∥g∥p+∥f−g∥p=∥g∥p,∥g∥p≤∥f∥p+∥f−g∥p=∥f∥p, so ∥f∥p=∥g∥p. Thus ∥[f]∥p:=∥f∥p is well defined.

1.2L2L4

For p=∞, if f−g∈N∞(μ) then f=g almost everywhere. Any essential bound for f is therefore an essential bound for g and conversely, so ∥f∥∞=∥g∥∞. Thus ∥[f]∥∞:=∥f∥∞ is well defined.

1.3L2

For separation, ∥[f]∥p=0 means ∥f∥p=0, and then [L2] gives f∈Np(μ) or N∞(μ). Hence [f]=[0]. The converse is immediate because the zero representative has norm 0.

2.1step 1.1step 1.2L1L3L5

By [L1] and [L5], each quotient Lp(μ) is already a real vector space. The representative functionals are homogeneous, and [L3] supplies the triangle inequality on representatives; steps 1.1 and 1.2 show that these formulas depend only on the class, so homogeneity and triangle inequality descend to the quotient.

3.1step 2.1step 1.3L6∎

Steps 2.1 and 1.3 verify the three norm axioms named in [L6]. Therefore (Lp(μ),∥⋅∥p) is a normed space for every 1≤p≤∞.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

Riesz-Fischer completeness of Lp for 1≤p≤∞

Statement

Assume countable choice (in particular, the Axiom of Choice suffices). Let (X,A,μ) be a measure space and let 1≤p≤∞. Then Lp(μ), with the norm of The Lp norm descends to the quotient and makes Lp a normed space for 1≤p≤∞, is complete. Equivalently, the metric induced by that norm is a complete metric in the sense of Complete metric space: every Cauchy sequence converges in the space.

Moreover, if a sequence in Lp(μ) converges in norm, then some subsequence admits measurable representatives converging almost everywhere in the sense of Convergence almost everywhere relative to a measure.

Facts & Assumptions

Given: A measure space, an exponent 1≤p≤∞, and countable choice, available under the Axiom of Choice (The Axiom of Choice). Its only use is to select a countable family of measurable representatives.

[L2]

Minkowski's inequality holds in Lp (Minkowski's inequality for integrals, including p=∞).

[L3]

Monotone convergence and dominated convergence are available (Monotone convergence for the integral, Dominated convergence).

[L5]

Sums and absolute values of measurable functions are measurable (Closure properties of measurable functions used by the integral).

[L6]

Countable unions of measurable null sets are measurable and null (Finite and countable subadditivity of measures).

[L7]

Finite essential suprema are attained almost everywhere (The essential supremum is attained as the least essential bound).

Proof

technique · For $1 \le p < infinity$, choose a rapidly Cauchy subsequence by least indices, sum the successive differences with monotone convergence and Minkowski, and recover the limit by dominated convergence. For $p = infinity$, union the exceptional null sets and take the pointwise limit outside them
1.1givenL2L3L4L5choose

Assume 1≤p<∞ and let (un) be Cauchy in Lp(μ). Choose by least indices a strictly increasing sequence (nk) such that [L2, L3, L4, L5, given, choose] ∥unk+1−unk∥p<2−k(k≥0). Use countable choice (the countable instance of AC) to choose measurable representatives fk of unk, and put hk:=∣fk+1−fk∣. Then each hk is measurable, belongs to Lp(μ), and satisfies ∥hk∥p<2−k. If gm:=∑k<mhk, then ∥gm∥p≤∑k<m∥hk∥p≤∑k=0∞2−k<∞, so each gm lies in Lp(μ). Monotone convergence then gives a measurable pointwise limit g:=∑k=0∞hk with g∈Lp(μ).

1.2givenL4L5L6L7choose

Assume now p=∞ and let (un) be Cauchy in L∞(μ). Choose least indices nk with [L4, L6, L7, given, choose] ∥unk+1−unk∥∞<2−k. Use countable choice (the countable instance of AC) to choose measurable representatives fk of unk. By [L7], the explicitly defined measurable set Ek:={x:∣fk+1(x)−fk(x)∣>2−k} is null, and ∣fk+1−fk∣≤2−kon X∖Ek. With E:=⋃kEk, [L6] makes E measurable and null, and for x∈X∖E and m>n, ∣fm(x)−fn(x)∣≤∑k=nm−12−k. So (fk(x)) is Cauchy in R, hence converges to some value f(x). Set f=0 on E. The measurable functions equal to fk on X∖E and zero on E converge everywhere to f, so [L4] makes f measurable. Indeed, their inverse images of Borel sets are obtained by intersecting those of fk with X∖E and adjoining E exactly when the Borel set contains zero. No completeness of the measure is assumed.

2.1step 1.1L2L3L4

In the finite-p case, E:={g=∞} is measurable and null: for every M>0, Mpμ(E)≤∫gp<∞, hence μ(E)=0. On X∖E the series ∑k∣fk+1−fk∣ converges, so fk has a finite limit f. Set f=0 on E. Replacing each fk by zero on E gives measurable functions converging everywhere to f, so [L4] gives measurability. Almost everywhere, ∣f∣≤∣f0∣+g, so [L2] gives f∈Lp, and [step 1.1, L2, L3, L4] ∣f−fk∣≤∑j≥khj≤g. Dominated convergence in [L3] therefore gives ∥f−fk∥p→0. So the subsequence unk converges to [f], and its representatives converge to f almost everywhere.

2.2step 1.2L1L2

For x∈X∖E, the same tail estimate gives [step 1.2] ∣f(x)−fn(x)∣≤∑k=n∞2−k≤21−n. Taking n=0 also gives ∣f∣≤∣f0∣+2 almost everywhere, so f∈L∞. Therefore ∥unk−[f]∥∞→0. Given ε>0, choose K with ∥un−um∥∞<ε/2 for m,n≥K, then choose k with nk≥K and ∥unk−[f]∥∞<ε/2. Hence ∥un−[f]∥∞≤∥un−unk∥∞+∥unk−[f]∥∞<ε, so un→[f] in L∞(μ).

3.1step 2.1L1L2

Since (un) is Cauchy, for every ε>0 there is K with ∥un−um∥p<ε/2 whenever m,n≥K. Choose k with nk≥K and ∥unk−[f]∥p<ε/2 from step 2.1. Then for every n≥K, [step 2.1, L2] ∥un−[f]∥p≤∥un−unk∥p+∥unk−[f]∥p<ε. So the whole sequence converges to [f]. This proves completeness for 1≤p<∞.

4.1step 2.1step 2.2step 3.1L1∎

Step 2.1 proves the almost-everywhere convergent subsequence clause in the finite-p case, and step 2.2 gives the same for p=∞. Steps 3.1 and 2.2 prove completeness in every case, which by [L1] is exactly completeness of the norm metric.

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

Assuming Countable Choice, Lp-convergent sequences have almost-everywhere convergent subsequences

Statement

Assume Countable Choice. Let 1≤p≤∞. If un→u in Lp(μ), then some subsequence of (un) admits measurable representatives converging almost everywhere to a measurable representative of u.

Facts & Assumptions

Given: Countable Choice (The Axiom of Countable Choice (ACω)) and a norm-convergent sequence (un) in Lp(μ).

[L1]

Under Countable Choice, Riesz-Fischer completeness states that every norm-convergent sequence in Lp(μ) has an almost-everywhere convergent subsequence of representatives (Riesz-Fischer completeness of Lp for 1≤p≤∞). Applying that representative-selection clause in step 1.1 is the use of Countable Choice here.

Proof

technique · Choose a rapidly convergent subsequence from an $L^p$-convergent sequence and re-use the subsequence construction inside Riesz-Fischer
1.1L1given

The sequence (un) is Cauchy because it converges in norm. Applying [L1] to that Cauchy sequence gives an Lp limit together with an almost-everywhere convergent subsequence of representatives. Because metric limits are unique, the limit supplied by [L1] must be the given u.

2.1step 1.1∎

That subsequence is the required one.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

Convergence in Lp implies convergence in measure

Statement

Let 1≤p≤∞, let un,u∈Lp(μ), and choose measurable representatives fn,f. If ∥un−u∥p→0, then fn→f in measure.

Facts & Assumptions

Given: Representatives fn,f of classes un,u∈Lp(μ) with ∥un−u∥p→0.

[L1]

Convergence in measure means the bad-set measures μ({∣fn−f∣>ε}) tend to 0 for every ε>0 (Convergence in measure).

[L3]

Chebyshev-Markov gives μ({h≥t})≤t−1∫h dμ for nonnegative measurable h (Chebyshev-Markov inequality for the integral).

[L4]

If ∥g∥∞<∞, then ∣g∣≤∥g∥∞ almost everywhere (The essential supremum is attained as the least essential bound).

Proof

technique · For $1 \le p < infinity$, apply Chebyshev-Markov to $|f_n-f|^p$. For $p = infinity$, the essential-supremum bound makes the bad set null for all large $n$
1.1L3L2givenalgebra

Assume 1≤p<∞ and fix ε>0. Apply [L3] to [L2, L3, given, algebra] h:=∣fn−f∣p and t:=εp: μ({∣fn−f∣>ε})=μ({∣fn−f∣p>εp})≤ε−p∫∣fn−f∣p dμ=ε−p∥un−u∥pp. By [L2], the right-hand side tends to 0.

1.2L2L4given

Assume p=∞ and fix ε>0. Because ∥un−u∥∞→0, [L2, L4, given] for all large n one has ∥un−u∥∞<ε. Then [L4] gives ∣fn−f∣≤ε almost everywhere, so μ({∣fn−f∣>ε})=0. Hence the bad-set measures are eventually 0.

2.1step 1.1step 1.2L1∎

Step 1.1 proves the finite-p case and step 1.2 proves the [step 1.1, step 1.2, L1] p=∞ case, so [L1] gives convergence in measure.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

Finite-measure Lr includes into Lp for p<r

Statement

Let (X,A,μ) be a measure space with μ(X)<∞.

  1. If 1≤p<r<∞ and f∈Lr(μ), then f∈Lp(μ) and ∥f∥p≤μ(X)1/p−1/r∥f∥r.
  2. If 1≤p<∞ and f∈L∞(μ), then f∈Lp(μ) and ∥f∥p≤μ(X)1/p∥f∥∞.

Facts & Assumptions

Given: A finite measure space (X,A,μ).

[L1]

Holder's inequality for integrals is available (Holder's inequality for integrals, including the endpoint cases).

[L2]
[L3]
[L4]

If h∈L∞(μ), then ∣h∣≤∥h∥∞ almost everywhere (The essential supremum is attained as the least essential bound).

Proof

technique · Write $|f|^p$ as $|f|^p\cdot1$ and apply Holder with exponents $r/p$ and $r/(r-p)$. The finite total measure contributes the factor $\mu(X)^{1/p-1/r}$
1.1L1L2L3givenalgebra

Suppose 1≤p<r<∞ and put a:=rp,b:=rr−p. Then a,b∈(1,∞) and 1/a+1/b=1, so [L2] makes them conjugate. Apply [L1] to the functions ∣f∣p and 1: ∫∣f∣p dμ≤(∫∣f∣pa dμ)1/a(∫1b dμ)1/b=(∫∣f∣r dμ)p/rμ(X)1−p/r. Taking p-th roots gives the claimed bound.

1.2L3L4givenalgebra

If f∈L∞(μ), then ∫∣f∣p dμ≤∥f∥∞pμ(X). Indeed, ∣f∣p≤∥f∥∞p almost everywhere by [L4]. Thus f∈Lp(μ) and ∥f∥p≤μ(X)1/p∥f∥∞.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove the finite-measure inclusion laws. [step 1.1, step 1.2].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31Open item page →

ℓp includes into ℓr for p<r

Statement

Let 1≤p<r≤∞. If a=(an)n≥0∈ℓp, then a∈ℓr. When r<∞ one has

∥a∥r≤∥a∥p,

and when r=∞ one has

∥a∥∞≤∥a∥p.

Facts & Assumptions

Given: A real sequence a=(an)n≥0 in ℓp.

Proof

technique · For counting measure, only finitely many terms can exceed $1$ when a sequence lies in $\ell^p$. Split the series at that finite set and compare $|a_n|^r$ to $|a_n|^p$ on the tail where $|a_n|\le1$
1.1L1

If r=∞, then for each n, [L1] ∣an∣p≤∑k=0∞∣ak∣p=∥a∥pp, so taking p-th roots gives ∣an∣≤∥a∥p. Hence ∥a∥∞≤∥a∥p.

1.2L1L2

Assume r<∞. Because ∑n∣an∣p<∞, only finitely many indices can satisfy ∣an∣>1; otherwise the p-series would dominate the divergent sum of infinitely many 1's. Thus ∣an∣≤1 for all sufficiently large n. Since r>p, one has ∣an∣r≤∣an∣p on that tail, so ∑n∣an∣r converges. [L1, L2].

2.1step 1.1step 1.2L1algebra

For every n, ∑k<n∣ak∣r≤(sup⁡k∣ak∣r−p)∑k<n∣ak∣p≤∥a∥∞r−p∑k<n∣ak∣p. Using step 1.1, this becomes ∑k<n∣ak∣r≤∥a∥pr−p∑k<n∣ak∣p. Letting n→∞ yields ∥a∥rr≤∥a∥pr, hence ∥a∥r≤∥a∥p.

3.1step 1.1step 2.1∎

Step 1.1 proves the endpoint r=∞, and step 2.1 proves the finite-r estimate. [step 1.1, step 2.1].

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

Lyapunov interpolation inequality for Lp norms

Statement

Let 1≤p0<p<p1<∞ and let θ∈(0,1) satisfy

1p=θp0+1−θp1.

If f∈Lp0(μ)∩Lp1(μ), then f∈Lp(μ) and

∥f∥p≤∥f∥p0θ∥f∥p11−θ.

Facts & Assumptions

Given: Exponents p0<p<p1 and a function f∈Lp0(μ)∩Lp1(μ).

[L1]

Holder's inequality for integrals is available (Holder's inequality for integrals, including the endpoint cases).

[L2]
[L3]

Membership in Ls(μ) means finiteness of the s-power integral (The function space Lp(μ) for 0<p<∞).

Proof

technique · If $1/p = \theta/p_0 + (1 - \theta)/p_1$, rewrite $|f|^p$ as the product $|f|^{\theta p}|f|^{(1-\theta)p}$ and apply Holder with conjugate exponents $p_0/(\theta p)$ and $p_1/((1-\theta)p)$
1.1L1L2L3givenalgebra

Put [L1, L2, L3, given, algebra] a:=p0θp,b:=p1(1−θ)p. Then 1a+1b=θpp0+(1−θ)pp1=1, so [L2] makes a and b conjugate exponents. Also (∣f∣θp)a=∣f∣p0,(∣f∣(1−θ)p)b=∣f∣p1. Applying [L1] to the factors ∣f∣θp and ∣f∣(1−θ)p therefore yields ∫∣f∣p dμ≤(∫∣f∣p0 dμ)θp/p0(∫∣f∣p1 dμ)(1−θ)p/p1=∥f∥p0θp∥f∥p1(1−θ)p.

2.1step 1.1L3∎

Taking p-th roots yields the Lyapunov interpolation inequality, and the right-hand side is finite by [L3], so f∈Lp(μ).

RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-08-31Open item page →

Lyapunov inequality is equivalent to log-convexity of the reciprocal-exponent norm profile

Fix a measurable f and an interval of exponents on which every ∥f∥p is finite and positive. Write

s:=1p,s0:=1p0,s1:=1p1.

Then Lyapunov interpolation inequality for Lp norms says exactly that

∥f∥p≤∥f∥p0θ∥f∥p11−θ

whenever s=θs0+(1−θ)s1. Equivalently,

∥f∥1/s≤∥f∥1/s0θ∥f∥1/s11−θ.

So the map s↦∥f∥1/s is log-convex in the sense of Log-convex positive functions on the reciprocal-exponent interval, and conversely that log-convexity is exactly the Lyapunov interpolation statement.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

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

Statement

Let 0<r<∞, let f∈Lr(μ)∩L∞(μ), and put M:=∥f∥∞. Then f∈Lp(μ) for every finite p≥r and

lim⁡p→∞∥f∥p=M.

Facts & Assumptions

Given: A real exponent r>0 and a function f∈Lr(μ)∩L∞(μ).

[L1]

If M=∥f∥∞<∞, then ∣f∣≤M 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.1L1L3given

If M=0, then [L1] gives ∣f∣=0 almost everywhere, so ∥f∥pp=∫∣f∣p dμ=0 for every finite p≥r. Hence ∥f∥p=0=M for all such p, and the conclusion follows in this case.

1.2L1L2L3givenalgebra

Assume from now on that M>0. For every finite p≥r, one has ∥f∥pp=∫∣f∣p dμ≤Mp−r∫∣f∣r dμ=Mp−r∥f∥rr, because [L1] gives ∣f∣p=∣f∣r∣f∣p−r≤Mp−r∣f∣r almost everywhere. Thus f∈Lp(μ) and ∥f∥p≤M1−r/p∥f∥rr/p. In particular, lim sup⁡p→∞∥f∥p≤M.

2.1L1L3step 1.2given

Fix ε with 0<ε<M. Because M is the least essential bound, the set Eε:={∣f∣>M−ε} has positive measure. For every finite p≥r, step 1.2 gives ∥f∥p<∞, so ∥f∥pp=∫∣f∣p dμ≥∫Eε∣f∣p dμ≥(M−ε)pμ(Eε) forces μ(Eε)<∞. Therefore ∥f∥p≥(M−ε)μ(Eε)1/p, and letting p→∞ gives lim inf⁡p→∞∥f∥p≥M−ε.

3.1step 1.1step 1.2step 2.1∎

Because 0<ε<M was arbitrary in the case M>0, step 2.1 yields lim inf⁡p→∞∥f∥p≥M. Combined with step 1.2, this proves ∥f∥p→M, while step 1.1 already handled the case M=0.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

The parallelogram law in L2

Statement

For u,v∈L2(μ) one has

∥u+v∥22+∥u−v∥22=2∥u∥22+2∥v∥22.

Facts & Assumptions

Given: Classes u,v∈L2(μ) with measurable representatives f,g.

[L2]

Products of two L2 functions lie in L1 (Generalized Holder inequality puts products into Lr).

[L3]

The Lebesgue integral is linear on L1 (The Lebesgue integral is linear on L1(μ)).

Proof

technique · Expand $|f + g|^2 + |f - g|^2$ pointwise to $2|f|^2 + 2|g|^2$ and integrate
1.1L2L3givenalgebra

Because f,g∈L2(μ), step [L2] puts fg in L1(μ), so every term [L2, L3, given, algebra] in the algebraic expansions below is integrable. Pointwise, ∣f+g∣2+∣f−g∣2=(f+g)2+(f−g)2=2f2+2g2. Integrating and using [L3] gives ∫∣f+g∣2 dμ+∫∣f−g∣2 dμ=2∫∣f∣2 dμ+2∫∣g∣2 dμ.

2.1step 1.1L1∎

Rewriting the four integrals as ∥u+v∥22, ∥u−v∥22, [step 1.1, L1] ∥u∥22, and ∥v∥22 is legitimate by [L1]. That yields the parallelogram identity.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

The p-functional need not be a norm for 0<p<1

Statement

Let 0<p<1. Then the functional

[f]⟼(∫∣f∣p dμ)1/p

on Lp(μ) need not satisfy the triangle inequality. Consequently it is not a norm in general in the sense of A norm on a real vector space, the induced metric, and the dictionary with the metric axioms.

Facts & Assumptions

Given: A real exponent 0<p<1.

[L3]

Counting measure on a two-point set is a measure (Counting measure on an arbitrary set, Counting measure is a measure).

Proof

technique · Use two disjoint equal-mass indicators, so the triangle inequality becomes the scalar inequality $2^{1/p}\le2$, which fails because $1/p>1$
1.1L3given

Work on the two-point counting space {0,1} from [L3]. Let [L3, given] e0:=χ{0} and e1:=χ{1}. Then ∥e0∥p=∥e1∥p=1,∥e0+e1∥p=(1+1)1/p=21/p.

2.1L1step 1.1

Because 0<p<1, one has 1/p>1. Strict monotonicity in [L1] therefore [L1, step 1.1] gives 21/p>21=2. So ∥e0+e1∥p>∥e0∥p+∥e1∥p.

3.1L2step 2.1∎

The triangle inequality from [L2] fails on this concrete measure space, so [L2, step 2.1] the p-functional is not a norm in general for 0<p<1.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

The Lp distance for 0<p<1 is a complete translation-invariant metric

Statement

Assume the Axiom of Choice. Let 0<p<1 and let Lp(μ) denote the set of almost-everywhere classes of functions in Lp(μ). Define

dp([f],[g]):=∫∣f−g∣p dμ.

Then dp is a translation-invariant metric on Lp(μ), and (Lp(μ),dp) is complete.

Facts & Assumptions

Given: The Axiom of Choice, a measure space (X,A,μ) and an exponent 0<p<1.

[A1]

The countable instance of the Axiom of Choice selects representatives of a countable sequence of nonempty almost-everywhere equivalence classes (The Axiom of Choice).

[L1]

The class notation Lp(μ) means almost-everywhere equivalence classes of Lp(μ) representatives (The space Lp(μ) as the quotient by null functions).

[L3]
[L4]
[L5]

Sums, scalar multiples, absolute values, and pointwise limits of measurable functions are measurable (Closure properties of measurable functions used by the integral).

[L6]

Countable unions of measurable null sets are measurable and null (Finite and countable subadditivity of measures).

[L7]

For 0<p<1 and nonnegative reals a,b, (a+b)p≤ap+bp. Indeed, if a+b=0 the claim is trivial. Otherwise set s:=a+b>0, u:=a/s, and v:=b/s. Then u,v∈[0,1] and u+v=1. If 0<u≤1, then log⁡u≤0, so plog⁡u≥log⁡u because 0<p<1; strict increase of the exponential and the definition of real power therefore give up≥u. The same holds for v. Hence ap+bp=sp(up+vp)≥sp(u+v)=sp=(a+b)p. (Real powers for positive bases, with the zero-base positive-exponent convention, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential function is strictly increasing) [given]

Proof

technique · Because $(a+b)^p\le a^p+b^p$ for $0<p<1$, $d_p([f],[g])=\int|f-g|^p\,d\mu$ defines a metric on quotient classes and is translation invariant. Completeness follows by repeating the Riesz-Fischer telescoping argument without taking $p$-th roots
1.1L1L5L6L7

If f∼f′ and g∼g′, then f−f′ and g−g′ vanish almost everywhere. Outside the union of those two null sets, one has f−g=f′−g′, so ∣f−g∣p=∣f′−g′∣p almost everywhere. Hence dp([f],[g]) is well defined. The same union-of-null-sets argument shows that addition and scalar multiplication descend to the quotient classes, and the inequality in [L7] shows that Lp(μ) is closed under those operations.

1.2L7L2L4

Symmetry of dp is immediate. If dp([f],[g])=0, then ∫∣f−g∣p dμ=0, so f=g almost everywhere and hence [f]=[g]. For the triangle inequality, the pointwise inequality from [L7] gives [L2, L4, L7] ∣f−h∣p=∣(f−g)+(g−h)∣p≤∣f−g∣p+∣g−h∣p, and integrating yields dp([f],[h])≤dp([f],[g])+dp([g],[h]). Thus [L2] makes dp a metric.

1.3L3L5givenchooseA1

Let (un) be Cauchy in dp. Choose by least indices a subsequence (unk) with [L3, L5, given, choose] dp(unk+1,unk)<2−k. By [A1], choose a sequence of representatives fk of unk and define hk:=∣fk+1−fk∣p,gm:=∑j<mhj. Each hk is measurable and integrable, and [L3] gives a measurable pointwise limit g:=∑j=0∞hj with ∫g dμ=lim⁡m→∞∫gm dμ≤∑j=0∞2−j<∞. Hence g<∞ almost everywhere. This is the only use of Choice in the argument.

2.1step 1.1

Translation invariance is pointwise: [step 1.1] dp([f]+[u],[g]+[u])=∫∣(f+u)−(g+u)∣p dμ=dp([f],[g]).

2.2step 1.3L3L7L5

Put E:={x:g(x)=∞}, a measurable null set by step 1.3. Fix x∉E. Then ∑j∣fj+1(x)−fj(x)∣p<∞, so the terms tend to 0. Thus ∣fj+1(x)−fj(x)∣≤1 for all large j, and then [step 1.3, L3, L7] ∣fj+1(x)−fj(x)∣≤∣fj+1(x)−fj(x)∣p=hj(x). So the real series ∑j∣fj+1(x)−fj(x)∣ converges by comparison with ∑jhj(x), which makes (fk(x)) converge to some real value f(x). Define f=0 on E. The measurable functions equal to fk on X∖E and zero on E converge pointwise to f, so [L3] and [L5] make f measurable. Moreover, ∣f∣p≤∣f0∣p+g on X∖E by [L7], and f=0 on E. Since f0∈Lp(μ) and g is integrable, f∈Lp(μ), so [f] is a valid element of Lp(μ). Also ∣f(x)−fk(x)∣p≤(∑j≥k∣fj+1(x)−fj(x)∣)p≤∑j≥khj(x). Integrating and using monotone convergence on the tails yields dp(unk,[f])≤∑j≥kdp(unj+1,unj)≤∑j≥k2−j→0.

3.1step 1.2step 2.2

Because (un) is Cauchy, given ε>0 choose K with dp(un,um)<ε/2 for m,n≥K, then choose k with nk≥K and dp(unk,[f])<ε/2 from step 2.2. The triangle inequality from step 1.2 gives dp(un,[f])<ε for all n≥K. Hence (Lp(μ),dp) is complete.

4.1step 1.2step 2.1step 3.1∎

Steps 1.2 and 2.1 prove that dp is a translation-invariant metric, and step 3.1 proves completeness.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

The p-power triangle inequality for nonnegative functions when 0<p<1

Statement

Let 0<p<1 and let f,g∈Lp(μ) be nonnegative. Then

∥f+g∥pp≤∥f∥pp+∥g∥pp.

Equivalently,

∫(f+g)p dμ≤∫fp dμ+∫gp dμ.

Facts & Assumptions

Given: An exponent 0<p<1 and nonnegative functions f,g∈Lp(μ).

[L1]

For 0<p<1 and 0<u≤1, plog⁡u≥log⁡u, hence up≥u by the definition of real power and strict increase of the exponential. The same inequality holds at u=0 (Real powers for positive bases, with the zero-base positive-exponent convention, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential function is strictly increasing).

Proof

technique · For nonnegative numbers $a,b$ and $0<p<1$ one has $(a+b)^p\le a^p+b^p$. Apply this pointwise to $f$ and $g$ and integrate
1.1L1givenalgebra

For nonnegative reals a,b with a+b>0, set s=a+b, u=a/s and v=b/s. Then u,v∈[0,1], u+v=1, and [L1] gives ap+bp=sp(up+vp)≥sp=(a+b)p; for a+b=0 equality is immediate. Apply this scalar inequality pointwise to f,g to obtain [L1, given, algebra] (f+g)p≤fp+gp.

2.1L2step 1.1∎

Integrating and using monotonicity and additivity from [L2] yields [step 1.1, L2] ∫(f+g)p dμ≤∫fp dμ+∫gp dμ. This is exactly the displayed ∥ ⋅ ∥pp inequality.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Lp completeness and the Banach-property wording

Riesz-Fischer completeness of Lp for 1≤p≤∞ proves the mathematics this page needs: with the descended norm, Lp(μ) is complete for 1≤p≤∞. Later functional-analysis pages supply the vocabulary seam by naming a complete normed space a Banach space. The terminology is deferred; the completeness proof is not.

5 · Examples, counterexamples and false statements

None yet.

Sources