Alphabeta Math
PropositionStatement: 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 section-measure functions are measurable

Statement

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

x↦ν(Ex),y↦μ(Ey)

are measurable from X and Y into [0,∞].

Facts & Assumptions

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

[L1]

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

[L2]

If an algebra generates a sigma-algebra, then its monotone class is that same sigma-algebra. (The monotone class generated by an algebra equals the sigma-algebra it generates)

[L3]
[L4]

Measures are continuous on increasing sequences, and on decreasing sequences whose first term has finite measure. (Continuity from below for measures, Continuity from above when one set has finite measure)

[A1]

Since ν is sigma-finite, there are measurable sets Ym↑Y with ν(Ym)<∞ for every m. Likewise there are measurable Xn↑X with μ(Xn)<∞.

[A2]

If Fk↑F, then (Fk)x↑Fx and ν((Fk)x∩Ym)↑ν(Fx∩Ym) for every x. If Fk↓F, then (Fk)x∩Ym↓Fx∩Ym, and continuity from above on the finite-measure space Ym gives ν((Fk)x∩Ym)↓ν(Fx∩Ym).

Proof

technique · direct
1.1L1A1givenalgebra

Fix m≥1 and let Cm consist of product-measurable sets F for which x↦ν(Fx∩Ym) is measurable. If F is a finite disjoint union of rectangles Aj×Bj, its sections are disjoint unions of those Bj with x∈Aj. Finite additivity therefore gives ν(Fx∩Ym)=∑jν(Bj∩Ym)1Aj(x). All coefficients are finite by [A1]. On each of the finitely many measurable Boolean atoms of the sets Aj, this function is constant; hence the inverse image of any Borel set is a finite union of those atoms. The empty union gives the zero function. Thus the entire generating algebra from [L1], not merely its individual rectangles, is contained in Cm.

2.1L1L2L3L4A1A2step 1.1

Sections commute with increasing unions and decreasing intersections. For an increasing sequence in Cm, [L4] identifies the section-measure function of its union with the pointwise increasing limit. For a decreasing sequence, all restricted sections have measure at most ν(Ym)<∞, so [L4] likewise identifies the function of the intersection with the decreasing limit. In both cases [L3] makes that limit measurable. Thus Cm is a monotone class, and [L1], [L2] and step 1.1 imply that it contains every product-measurable set.

3.1A1L3L4step 2.1

Applying step 2.1 to E shows that gm(x):=ν(Ex∩Ym) is measurable for every m. Since Ym↑Y, [L4] gives gm(x)↑ν(Ex) for each x, and [L3] proves measurability of x↦ν(Ex).

4.1A1L3L4step 1.1step 2.1step 3.1∎

Interchanging the two factors and using the finite-measure exhaustion Xn↑X proves measurability of y↦μ(Ey) by the same argument. Therefore both section-measure functions are measurable.

Depends on

Used by

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