Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-27
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.

Integrable simple functions are dense in L1(μ)

Statement

For every f∈L1(μ) there is a sequence of integrable simple functions (sn) such that ∫∣f−sn∣ dμ⟶0.

Facts & Assumptions

Given: An integrable function f.

[L1]

Every nonnegative measurable function is the increasing limit of simple measurable functions (Every nonnegative measurable function is the increasing limit of simple measurable functions).

[L2]

Real and complex integrability are defined in Integrable real and complex functions, and their integrals.

[L3]

Dominated convergence gives L1 convergence under an integrable majorant (Dominated convergence).

Proof

technique · direct
1.1L1L2L3construct

Suppose first that f is real-valued. Choose simple un↑f+ and vn↑f− by [L1], and put sn:=un−vn. Then sn is an integrable simple function and ∣f−sn∣=(f+−un)+(f−−vn)↓0, with ∣f−sn∣≤∣f∣. By [L3], ∫∣f−sn∣ dμ→0.

2.1step 1.1L2L4∎

For complex f=u+iv, apply step 1.1 separately to u and v to obtain real simple functions pn,qn with ∫∣u−pn∣ dμ→0,∫∣v−qn∣ dμ→0. Set sn:=pn+iqn. Then sn is a simple integrable function and ∣f−sn∣≤∣u−pn∣+∣v−qn∣. By [L4], ∫∣f−sn∣ dμ≤∫∣u−pn∣ dμ+∫∣v−qn∣ dμ⟶0, so (sn) converges to f in L1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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