Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Bochner Lp is complete for a Banach value space

Statement

Let X be a real Banach space, 0<T<∞, and 1≤p<∞. Then Lp(0,T;X), with norm ∥f∥Lp(X)=(∫0T∥f(t)∥Xpdt)1/p, is complete under Countable Choice.

Facts & Assumptions

Given: A real Banach space X, 0<T<∞, 1≤p<∞, and a Cauchy sequence in Lp(0,T;X).

[F1]

Every Cauchy sequence in X has a limit in X (Banach space).

[F2]

Here Lp(0,T;X) is the space of a.e.-classes of strongly measurable X-valued functions f with ∫0T∥f(t)∥Xp dt<∞, with norm ∥f∥Lp(X)=(∫0T∥f(t)∥Xp dt)1/p. Strong measurability means a.e. pointwise norm convergence of measurable simple functions (Strongly measurable Banach-valued function).

[F3]

After modifying representatives to be zero on exceptional null sets, finite sums and differences of strongly measurable functions are strongly measurable, and their norm functions are measurable: finite sums of simple approximants are simple, while the norm is continuous and pointwise limits of measurable scalar functions are measurable (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable).

[F4]

The scalar Lp norm satisfies Minkowski's inequality. Together with ∥u(t)+v(t)∥X≤∥u(t)∥X+∥v(t)∥X, this gives the triangle inequality for the displayed Bochner Lp norm (Minkowski's inequality for integrals, including p=∞).

[F5]

Increasing nonnegative measurable functions satisfy monotone convergence for their integrals (Monotone convergence for the integral).

[F6]

Dominated convergence holds for nonnegative measurable functions, and the nonnegative integral is monotone (Dominated convergence, Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F7]

Measures are monotone and countably subadditive, and a nonnegative extended series is the supremum of its finite partial sums (Measures are monotone, Finite and countable subadditivity of measures, Series in the nonnegative extended real line).

[A1]

Countable Choice selects representatives and simple-function approximating sequences for the countable subsequence, and indices mk from countably many nonempty approximation sets (The Axiom of Countable Choice (ACω)). Subsequence indices can be chosen by least-index recursion.

Proof

1.1A1F3F4F5F6given

The Cauchy sequence has a subsequence (fk) with ∥fk+1−fk∥Lp(X)≤2−k for k≥1, by recursively taking the least eligible indices. Countable Choice [A1] selects strongly measurable representatives for these classes. Put gN(t)=∑k=1N∥fk+1(t)−fk(t)∥X. By [F3], gN is measurable; Minkowski [F4] gives ∥gN∥Lp≤∑k=1N2−k≤1. Monotone convergence [F5] gives g(t)=∑k≥1∥fk+1(t)−fk(t)∥X with ∫gp≤1. Thus g<∞ almost everywhere: for A={g=∞}, Mp1A≤gp for every M>0, and [F6] gives Mpμ(A)≤1, forcing μ(A)=0.

2.1A1F1F2F3F4F6F7F8step 1.1

Outside the null set where g=∞, the sequence fk(t) is Cauchy in X and converges to f(t)∈X by [F1]; set f=0 on that null set. For each k, choose a simple sequence sk,m→fk almost everywhere, as supplied by [F2] and [A1]. The sets Ek,m={t:∥sk,m(t)−fk(t)∥X>2−k} are measurable by [F3], and their indicators tend to zero almost everywhere as m→∞. Dominated convergence [F6] on the finite interval [F8] lets Countable Choice [A1] select mk with μ(Ek,mk)≤2−k. By [F7], the set N=⋂j≥1⋃k≥jEk,mk has measure at most ∑k≥j2−k≤21−j for every j, hence is null. Outside N and the previous null set, sk,mk(t)→f(t), so f is strongly measurable by [F2]. Also ∥f−f1∥X≤g almost everywhere; [F6] makes this difference Lp, and Minkowski [F4] gives f∈Lp. For each N, ∥f(t)−fN(t)∥X≤∑k≥N∥fk+1(t)−fk(t)∥X→0 and is bounded by g(t). Dominated convergence [F6] gives ∥f−fN∥Lp(X)→0.

3.1F4step 2.1given∎

The original sequence is Cauchy and has the subsequence fN→f; given ε>0, choose N with ∥fN−f∥Lp(X)<ε/2 and then take the original index sufficiently far out that its distance to fN is below ε/2. The triangle inequality [F4] proves convergence of the entire sequence to f, so Lp(0,T;X) is complete.

Depends on

Used by

Dependency tree · two levels

64 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