Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Riesz-Fischer completeness of Lp for 1p

Statement

Let (X,A,μ) be a measure space and let 1p. Then Lp(μ), with the norm of The Lp norm descends to the quotient and makes Lp a normed space for 1p, 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 and an exponent 1p.

[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

Proof technique: For 1p<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.1

Assume 1p< 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+1unkp<2k(k0). For representatives fk of unk, put hk:=fk+1fk. Then each hk is measurable, belongs to Lp(μ), and satisfies hkp<2k. If gm:=k<mhk, then gmpk<mhkpk=02k<, so each gm lies in Lp(μ). Monotone convergence then gives a measurable pointwise limit g:=k=0hk with gLp(μ).

1.2

Assume now p= and let (un) be Cauchy in L(μ). Choose least indices nk with [L4, L6, L7, given, choose] unk+1unk<2k. Choose representatives fk of unk. By [L7], for each k there is a measurable null set Ek such that fk+1fk2kon XEk. With E:=kEk, [L6] makes E measurable and null, and for xXE and m>n, fm(x)fn(x)k=nm12k. So (fk(x)) is Cauchy in R, hence converges to some value f(x). Defining f arbitrarily on E, [L4] makes it measurable.

2.1

Because g< almost everywhere, outside a measurable null set the series kfk+1fk converges. Hence the telescoping sums fk converge pointwise almost everywhere to a measurable function f, and [step 1.1, L3, L4] ffkjkhjg. Dominated convergence in [L3] therefore gives ffkp0. So the subsequence unk converges to [f], and its representatives converge to f almost everywhere.

2.2

For xXE, the same tail estimate gives [step 1.2] f(x)fn(x)k=n2k21n. Therefore unk[f]0. Given ε>0, choose K with unum<ε/2 for m,nK, then choose k with nkK and unk[f]<ε/2. Hence un[f]ununk+unk[f]<ε, so un[f] in L(μ).

3.1

Since (un) is Cauchy, for every ε>0 there is K with unump<ε/2 whenever m,nK. Choose k with nkK and unk[f]p<ε/2 from step 2.1. Then for every nK, [step 2.1, L2] un[f]pununkp+unk[f]p<ε. So the whole sequence converges to [f]. This proves completeness for 1p<.

4.1

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.

step 2.1step 2.2step 3.1L1

Depends on

Used by

Dependency tree · two levels

49 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