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

Depends on

Used by

…and 20 more results.

Dependency tree · two levels

54 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