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

Equivalent sigma-finite positive measures have reciprocal Radon-Nikodym derivatives almost everywhere

Statement

Assume the Axiom of Choice. Let μ and ν be equivalent sigma-finite positive measures on the same measurable space. Then dνdμdμdν=1ν-almost everywhere, and therefore also μ-almost everywhere.

Facts & Assumptions

Given: AC and sigma-finite positive measures μ and ν with μ≪ν≪μ.

[L1]

Under AC and one exhaustion finite for the outer and intermediate positive measures and the variation of the inner measure, the chain rule gives dη/dλ=(dη/dκ)(dκ/dλ) almost everywhere along η≪κ≪λ (Radon-Nikodym derivatives satisfy the chain rule along nu << mu << lambda).

[L2]

The constant function 1 represents dμ/dμ because μ(E)=∫E1 dμ for every measurable set, and the representing density is unique up to almost-everywhere equality. (A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density)

[L3]

AC supplies existence of the two RN densities and the hypotheses of the chain rule; identifying the density1 itself requires no new choice. (The Axiom of Choice)

Proof

technique · direct
1.1L1L2L3construct

Choose increasing finite-measure exhaustions (An) for μ and (Bn) for ν, and put Xn:=An∩Bn. After replacing both exhaustions by finite unions, (Xn) is increasing, covers X, and is finite for both measures. Under AC as in [L3], apply [L1] to the chain μ≪ν≪μ on this common exhaustion. Then dμdμ=dμdνdνdμμ-almost everywhere. By [L2], dμ/dμ=1 almost everywhere, so dμdνdνdμ=1μ-almost everywhere.

2.1step 1.1L1algebra∎

Interchanging the roles of μ and ν gives dνdμdμdν=1ν-almost everywhere. Because μ and ν have the same null sets, the two almost-everywhere conclusions are equivalent.

Depends on

Used by

Dependency tree · two levels

16 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