Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-09-08 (Codex)
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.

For sigma-finite measures, the two section-measure integrals of a measurable set agree

Statement

Let (X,A,μ) and (Y,B,ν) be sigma-finite measure spaces, and let E∈A⊗B. Then

∫Xν(Ex) dμ=∫Yμ(Ey) dν.

Facts & Assumptions

Given: Sigma-finite measure spaces (X,A,μ) and (Y,B,ν), and a set E∈A⊗B.

[L1]

The section-measure functions x↦ν(Ex) and y↦μ(Ey) are measurable. (For sigma-finite measures, the section-measure functions are measurable)

[L2]

Finite disjoint unions of measurable rectangles form an algebra generating A⊗B. (Finite disjoint unions of measurable rectangles form an algebra generating the product sigma-algebra)

[L3]

The monotone class generated by an algebra coincides with the generated sigma-algebra. (The monotone class generated by an algebra equals the sigma-algebra it generates)

[L4]

Monotone convergence allows integrals of increasing nonnegative functions to pass to the limit. (Monotone convergence for the integral)

[A1]

Since μ and ν are sigma-finite, there are measurable exhaustions Xn↑X and Yn↑Y with μ(Xn),ν(Yn)<∞.

Proof

technique · direct
1.1L2L3A1

Fix n,m≥1. Let Dn,m be the family of measurable subsets F⊆Xn×Ym such that ∫Xnν(Fx) dμ=∫Ymμ(Fy) dν. If F=(A×B)∩(Xn×Ym), then Fx=(B∩Ym) for x∈A∩Xn and ∅ otherwise, so both integrals equal μ(A∩Xn)ν(B∩Ym). Finite additivity gives the same equality for the algebra of [L2].

2.1L1L2L3L4A1step 1.1

If Fk↑F inside Xn×Ym, then [L1] and [L4] give ∫Xnν((Fk)x) dμ↑∫Xnν(Fx) dμ, and similarly on Ym. Hence Dn,m is closed under increasing unions. For F∈Dn,m, put Fc=(Xn×Ym)∖F. Each section-integral of Fc equals the finite number μ(Xn)ν(Ym) minus the corresponding section-integral of F. This follows by adding the complementary sections and integrating; all quantities are finite because they are bounded by that finite product. Thus Fc∈Dn,m. If Fk↓F, their relative complements increase to Fc; closure under increasing unions and complements therefore gives F∈Dn,m. The class is now proved monotone in both directions and contains the relative rectangle algebra by step 1.1. Applying [L2] and [L3] on Xn×Ym yields every product-measurable subset of that rectangle.

3.1step 2.1A1

Put En,m:=E∩(Xn×Ym). Step 2.1 gives ∫Xnν((En,m)x) dμ=∫Ymμ((En,m)y) dν. Now (En,m)x=Ex∩Ym for x∈Xn and ∅ otherwise, so as n,m→∞ the two integrands increase pointwise to ν(Ex) and μ(Ey).

4.1L4step 3.1L1∎

Applying [L4] on both sides of step 3.1 and then letting n,m→∞ gives ∫Xν(Ex) dμ=∫Yμ(Ey) dν. This is the claimed equality.

Depends on

Used by

Dependency tree · two levels

30 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