Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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.

Integrating against a Radon-Nikodym derivative recovers integration against the measure

Statement

Let μ be a sigma-finite positive measure and let ν be a signed measure or a finite complex measure with νμ. If h is a representative of dν/dμ, then ν(E)=Ehdμ(EA). More generally, if g=j=1mcj1Ej is the canonical disjoint representation of a simple measurable function and ν(Ej)<+ for every j, then gdν=j=1mcjEjhdμ. In particular, whenever the Lebesgue integral of gh is defined, one has gdν=ghdμ.

Facts & Assumptions

Given: A representative h of dν/dμ.

[L3]

For a simple function in canonical disjoint form with each ν(Ej)<+, the simple integral against ν is gdν=j=1mcjν(Ej). (The simple integral against a signed or complex measure)

[L4]

The Lebesgue integral is linear on L1(μ). (The Lebesgue integral is linear on L1(μ))

Proof

technique · direct
1.1

The measurable-set identity ν(E)=Ehdμ is exactly [L1].

L1given
2.1

If g=j=1mcjχEj is canonical disjoint and each ν(Ej)<+, then [L3] and step 1.1 give gdν=j=1mcjν(Ej)=j=1mcjEjhdμ. If, in addition, the Lebesgue integral of gh is defined, then [L4] identifies the same finite sum with ghdμ.

L3L4step 1.1algebra

Depends on

Used by

Dependency tree · two levels

21 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