Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)
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.

Doob-Dynkin factorization through the sigma-algebra generated by a function

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let f:X→R and g:X→R‾. Then g is σ(f)-measurable if and only if there is a Borel measurable function h:R→R‾ such that

g=h∘f.

Facts & Assumptions

Given: ACω and functions f:X→R and g:X→R‾.

[L1]

The sigma-algebra generated by f is σ(f)={f−1(B):B∈B(R)}. (The sigma-algebra generated by a function)

[L2]

Threshold measurability characterizes R‾-valued measurability. (Threshold characterisations of real-valued and extended-real-valued measurability)

[L3]

Q is countable (Q is countably infinite), so The Axiom of Countable Choice (ACω) selects one Borel lift for each rational threshold in step 1.2.

Proof

technique · direct
1.1L1given

If g=h∘f for Borel h, then for each Borel C⊆R‾, g−1(C)=f−1(h−1(C))∈σ(f) by [L1].

1.2L1L2L3choosealgebra

Conversely suppose g is σ(f)-measurable. For every rational q, [L1] and [L2] say that the family of Borel A⊆R with f−1(A)={g≤q} is nonempty. By [L3], Q is countable; apply the stated ACω to choose one Aq for every q. Define Bq=⋂r∈Q, r>qAr. These sets are Borel and increasing in q, and f−1(Bq)=⋂r>q{g≤r}={g≤q}, including when g takes an infinite value.

2.1step 1.2algebra

The family also satisfies Bq=⋂r∈Q, r>qBr. Indeed the right side expands to the intersection of all As with rational s>r>q; every rational s>q has a rational r strictly between q and s, and every s>r>q also has s>q. Thus the two collections of As have the same intersection.

3.1L2step 1.2step 2.1

For y∈R put h(y)=inf⁡{q∈Q:y∈Bq} in R‾, with empty infimum +∞. For rational q, monotonicity and step 2.1 give {h≤q}=⋂r∈Q, r>qBr=Bq: if the infimum is at most q, some index below each r>q belongs to the defining set, and conversely membership in every Br forces the infimum at most q. The threshold criterion [L2] therefore makes h Borel measurable.

4.1L2step 1.1step 1.2step 3.1∎

For every x∈X and rational q, steps 1.2 and 3.1 give h(f(x))≤q exactly when g(x)≤q. Rational thresholds distinguish all points of R‾, including both infinities, hence h(f(x))=g(x). Together with step 1.1 this proves the equivalence.

Depends on

Used by

Nothing in the library uses this result yet.

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