Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-10
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.

Conditional monotone convergence

Statement

Assume AC. For nonnegative measurable X (possibly infinite), E[XG] is the unique almost-sure class of nonnegative G-measurable Y satisfying AYdP=AXdP for every AG. If 0XnX almost surely, then E[XnG]E[XG] almost surely. Every increasing integrable nonnegative approximation to X gives the same class. For integrable real VnV almost surely with V0,VL1, E[VnG]E[VG] almost surely.

Facts & Assumptions

Given: AC and nonnegative measurable inputs X and 0XnX almost surely; for the decreasing clause, real VnV with V0,VL1.

[F1]

The extended version is the increasing truncation limit. (Conditional expectation for nonnegative variables)

[F2]

Integrable versions preserve order and finite linear combinations. (Basic algebra and order properties of conditional expectation)

[F3]

Ordinary MCT applies to nonnegative increasing functions. (Monotone convergence for the integral)

[F4]

Positive/negative parts, level sets and increasing limits are measurable. (Closure properties of measurable functions used by the integral)

[F5]

Integrals of nonnegative functions on measurable null sets vanish. (A nonnegative integral over a null set vanishes)

[F6]

AC selects countably many versions and covers inherited existence choices. (The Axiom of Choice)

Proof

technique · direct
1.1

For the ordered nonnegative versions Un of [F1], ordinary MCT on each event gives AlimnUn=limnAUn=limnA(Xn)=AX. Changes on the common measurable null set have zero event integral by [F5]. Thus the limit has the stated event characterization. If inputs are changed almost surely, their nonnegative integrals also agree by splitting each event into its part in and outside the measurable exceptional null set.

F1F3F5F6
2.1

For uniqueness, let Y,Z be two characterized versions and set Ak,m={YZ+1/k, Zm} for positive integers k,m. This is in G: the difference is formed only on the finite-Z set. On Ak,m, Zm, and the event identities give Y=Z<. Integration of YZ+1/k there yields P(Ak,m)/k0. Their countable union is {Y>Z}, since strict extended inequality forces the smaller value to be finite. Thus P(Y>Z)=0; interchanging the two variables gives equality almost surely. No infinite integrals are subtracted.

step 1.1F4
3.1

More generally, if XX almost surely and Y,Z are their characterized versions, then AYAZ on all G events. On the same Ak,m as in step 2.1, the right integral is finite and the inequality forces P(Ak,m)=0. Thus YZ almost surely. This extends order to the nonnegative classes, including infinite values.

step 1.1step 2.1
4.1

Choose versions Yn for the given Xn using [F6]. By step 3.1 remove one G-null union of consecutive order-exception sets and set all Yn to zero there. Their limit Y is measurable by [F4]. MCT and the event identities give AY=limnAXn=AX. For almost-sure input monotonicity the common ambient measurable null set can be removed from the inputs using [F5]; this does not require that set to belong to G. Step 2.1 now identifies Y with E[XG]. The same argument works for any increasing integrable nonnegative approximations.

step 1.1step 2.1step 3.1F3F4F5F6
5.1

Finally 0V0VnV0V almost surely, and all these variables are integrable because VnV0+V. Apply step 4.1 and linearity [F2] to obtain E[V0G]E[VnG]E[V0G]E[VG]. The fixed first term is finite almost surely, so subtraction gives the claimed decreasing convergence.

step 4.1F2

Source notes

Van der Vaart Lemma 1.10(i), printed p.4; Durrett Theorem 4.1.9(c) and its decreasing-limit remark, printed pp.210–211. Extended uniqueness and order are supplied locally by finite-level localization; the decreasing clause preserves the coverage promise.

Depends on

Used by

Cited to discharge well-definedness by Conditional expectation for nonnegative variables.

Dependency tree · two levels

26 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