Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

Finite-measure sets are approximable in measure by sets from a countable generating algebra

Statement

Assume the Axiom of Countable Choice.

Let (X,A,μ) be a sigma-finite measure space whose sigma-algebra is countably generated. Then there is a countable algebra A0A such that for every EA with μ(E)< and every ε>0 there exists AA0 with

μ(EA)<ε.

Facts & Assumptions

Given: The Axiom of Countable Choice, a sigma-finite measure space (X,A,μ) with A countably generated.

[L1]

A countable generator yields a countable algebra (A countable generator of a sigma-algebra yields a countable algebra of sets).

[L2]

Sigma-finite measures admit an increasing exhaustion X1X2 by measurable finite-measure sets (Finite, sigma-finite, and semifinite measures).

[L3]

If two families contain one another inside generated sigma-algebras, then they generate the same sigma-algebra (Two families generate the same sigma-algebra when each lies in the sigma-algebra generated by the other, The sigma-algebra generated by a family of sets).

[L4]

Continuity from below and the symmetric-difference measure calculus are available (Continuity from below for measures, Measure of a set difference when the smaller set has finite measure).

Proof

technique · direct
1.1

Let G be a countable generator of A, and choose a [L1, L2, L3, given, choose] sigma-finite exhaustion (Xm) by [L2]. Apply [L1] to the countable family G{Xm:m1} to obtain a countable algebra A0A. Because GA0A, [L3] gives σ(A0)=A.

L1L2L3givenchoose
1.2

Fix m and let Mm be the family of measurable subsets [L4, algebra] BXm for which every ε>0 admits AA0 with AXm and μ(BA)<ε. Because XmA0, the family Mm contains A0Xm. On the finite-measure space Xm, the class Mm is a sigma-algebra: complements are handled inside Xm, and increasing unions are handled by approximating one large stage and using continuity from below. Therefore Mm is a sigma-algebra containing the trace of A0, so it contains every measurable subset of Xm.

L4algebra
2.1

Now let EA with μ(E)< and let ε>0. [L4, choose, algebra] By [L4], choose m so large that μ(EXm)<ε/2. Since EXm is a measurable subset of Xm, the construction above yields AA0 with AXm and μ((EXm)A)<ε/2. Then μ(EA)μ(EXm)+μ((EXm)A)<ε. So finite-measure sets are approximable by members of the countable algebra A0.

L4choosealgebra

Depends on

Used by

Dependency tree · two levels

17 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