Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck 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.

A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra

Statement

Assume the Axiom of Countable Choice. Let (X,A0,μ) be a measure space and let (X,A0‾,μ‾) be its completion. If f:X→R‾ is measurable with respect to A0‾, then there is an A0-measurable function g:X→R‾ such that f=g almost everywhere.

Facts & Assumptions

Given: The Axiom of Countable Choice, a measure space (X,A0,μ), its completion (X,A0‾,μ‾), and an A0‾-measurable function f:X→R‾.

[L1]

Every measurable function admits simple approximations dominated by its absolute value. (Every measurable function admits simple approximations dominated by its absolute value)

[L2]

A completed measurable set has the form A∪N with A∈A0 and N contained in a measurable null set. (The completion domain and proposed completed set function of a measure space)

[L3]

Assuming Countable Choice, the completion is a complete measure space extending the original measure, and countable unions of completed null sets are completed null sets. (Assuming countable choice, every measure space has a unique complete extension to its completion, Null sets are closed under countable unions and, in a complete space, under arbitrary subsets)

[L4]

Pointwise limsup of a sequence of measurable functions is measurable. (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)

Proof

technique · direct
1.1L1choose

By [L1], choose simple A0‾-measurable functions [L1, choose] sk:X→R with ∣sk∣≤∣f∣ and sk(x)→f(x) for every x∈X. Write the canonical representation of sk as sk=∑j=1mkck,j 1Ek,j, where the Ek,j are pairwise disjoint completed measurable level sets.

1.2L2L3choose

For each pair (k,j), apply [L2] to Ek,j and choose [L2, L3, choose] Ak,j∈A0 together with a completed null set Nk,j such that Ek,j=Ak,j∪Mk,j with Mk,j⊆Nk,j. Because Ak,j⊆Ek,j, the sets Ak,j remain pairwise disjoint. Define tk:=∑j=1mkck,j 1Ak,j. Then each tk is A0-measurable and simple. Let N:=⋃k,jNk,j. By [L3], N is a completed measurable null set, and for every x∉N one has tk(x)=sk(x) for all k.

2.1step 1.1step 1.2L4

Define [step 1.1, step 1.2, L4] g:=lim sup⁡k→∞tk. By [L4], the function g is A0-measurable. If x∉N, then step 1.2 gives tk(x)=sk(x) for every k, and step 1.1 gives sk(x)→f(x), so g(x)=lim sup⁡ktk(x)=lim⁡ksk(x)=f(x). Hence g=f on X∖N.

3.1step 2.1L3∎

The null set N is measurable in the completion by [L3], so step 2.1 says [step 2.1, L3] exactly that f=g almost everywhere. Since g is A0-measurable, it is the required base-measurable representative.

Depends on

Used by

Dependency tree · two levels

19 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