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

Complex Lp completeness and almost-everywhere subsequences

Statement

Assume countable choice. For every measure space and 1p, Lp(μ;C) is complete. Every sequence converging in this norm has a subsequence of measurable representatives converging a.e. to a measurable representative of its norm limit. For finite p no pointwise convergence of the whole sequence is asserted.

Facts & Assumptions

Given: Countable choice, a measure space, 1p, and a complex Lp Cauchy sequence ([fn]).

[F1]

The component maps on classes are contractions, and the complex norm is bounded by the sum of the component norms (Complex Holder, Minkowski, and the quotient norm).

[F2]

Real Lp is complete for every exponent in this range (Riesz-Fischer completeness of Lp for 1p).

[F3]

Real norm convergence supplies an a.e.-convergent subsequence of measurable representatives with the correct limit class (Lp-convergent sequences have almost-everywhere convergent subsequences).

[F4]

Countable choice selects elements from a countable family of nonempty sets (The Axiom of Countable Choice (ACω)).

[F5]

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

Proof

technique · Take real component limits and then two successive real subsequences
1.1

For un=Re[fn] and vn=Im[fn], F1 gives unump,vnvmp[fn][fm]p. Both real sequences are therefore Cauchy. F2 supplies real classes u,v with unu, vnv.

F1F2given
1.2

For a sequence already converging to [f], its real components converge to Re[f] by F1. Apply F3 to obtain indices nk and real representatives akU off a measurable null set. Its imaginary components still converge in norm; apply F3 to that subsequence to obtain further indices kj and imaginary representatives bjV off a second measurable null set. Then akj+ibj represents [fnkj] and converges to U+iV outside the union of those two null sets, which is null by F5.

F1F3F5
2.1

Choose measurable representatives U,V of these two classes and put f=U+iV. F1 shows fLp(μ;C) and [fn][f]punup+vnvp0. Thus every Cauchy sequence converges, at infinity as well as at finite p.

F1step 1.1
3.1

The simultaneous representative selections used by the real results are permitted by F4; selection of the two limit representatives requires only two choices. All functions can be assigned zero on the measurable exceptional sets: a function pieced from a measurable function on a measurable set and zero on its complement is measurable. If predetermined measurable representatives are desired, their disagreement sets with the selected representatives are themselves measurable and null; F5 applied to their countable union preserves the a.e. convergence. Hence the assertions hold on incomplete measures without prescribing arbitrary, possibly nonmeasurable, values on null sets.

F4F5step 2.1step 1.2

Depends on

Used by

Dependency tree · two levels

30 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