Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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 dominated convergence theorem

Statement

Assume ACω. Let fn:ΩX be strongly measurable, suppose fn(ω)f(ω) in norm for almost every ω, and let g be a nonnegative integrable scalar function with fn(ω)g(ω) almost everywhere for every n. Then f and all fn are Bochner integrable,

fnfdμ0,

and fndμfdμ in norm.

Facts & Assumptions

[A1]

Countable Choice selects one member from every countable family of nonempty sets (The Axiom of Countable Choice (ACω)).

[L1]

Finite norm integral characterizes Bochner integrability for a strongly measurable function (Bochner integrability criterion).

[L2]

Strong measurability is a.e. pointwise norm approximation by finite-valued measurable simple functions (Strongly measurable Banach-valued function).

[L3]

Pointwise scalar limits and countable suprema preserve measurability (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable).

[L4]

Scalar dominated convergence yields L1 convergence (Dominated convergence).

[L5]

A Bochner integral is bounded in norm by the integral of the pointwise norm (Bochner integral norm inequality).

[L6]

Simple Banach-valued integrals are linear (The Banach-valued simple integral is well defined).

Proof

technique · direct

Given: The sequence, limit, domination, and ACω in the Statement.

1.1

Select simultaneous strong-measurability witnesses. [given, A1, L2, choose] Use [A1] exactly once to choose, for every n, a simple approximation sequence witnessing the strong measurability in [L2]. Unite their exceptional null sets with those from convergence and domination; countable additivity makes the union null. Modify all functions and approximants to be zero there. We now have pointwise convergence everywhere and a doubly indexed family of simple approximants.

givenA1L2choose
2.1

Obtain a common countable range and measurable distances. [L3, step 1.1] Let D be {0} together with all values of all selected simple approximants. It is countable. For each n, the range of fn lies in D, hence the pointwise limit f also takes values in D. For yD, the functions fny are measurable by applying [L3] to the simple approximants, and fy is measurable by applying [L3] once more to fnf.

L3step 1.1
3.1

Build finite-valued approximants to the limit. [L2, step 2.1, construct] Enumerate D with repetitions as (yj). For each m, assign sm(ω) to be the least-indexed nearest point to f(ω) among y1,,ym. The finitely many tie-broken Voronoi cells are measurable by step 2.1, so sm is simple; density gives sm(ω)f(ω). Thus f is strongly measurable.

L2step 2.1construct
4.1

Apply the scalar dominated-convergence theorem. [L1, L4, step 3.1] Passing to the pointwise limit in fng gives fg. By [L1], f and every fn are Bochner integrable. Moreover fnf2g, so [L4] gives fnf0.

L1L4step 3.1
5.1

Pass from L1 convergence to integral convergence. [L1, L5, L6, step 4.1] Combining simple approximations to fn and f, [L6] and approximation independence from [L1] show that (fnf)=fnf. Apply [L5]: fnffnf0 by step 4.1. If the measure space is empty or g=0 a.e., every integral is zero; no separate endpoint convention is needed.

L1L5L6step 4.1

Depends on

Used by

Dependency tree · two levels

29 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