Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Simultaneous rational conditional distribution function versions

Statement

Assume AC. Let X:Ω→R be measurable on a probability space (Ω,F,P) and G⊆F a sub-sigma-algebra. There are real G-measurable versions Gq of P(X≤q∣G) for every q∈Q and one N∈G, P(N)=0, such that outside N, simultaneously,

0≤Gq≤1,q<r⟹Gq≤Gr,Gn⟶1,G−n⟶0,Gq+1/n⟶Gq.

Here n=1,2,… and the final assertion holds for every rational q. The versions may moreover be filled on N by Gq=1{q≥0}, so all these properties hold everywhere.

The proof also establishes the restricted integral interface used here and below: arbitrary nonnegative simple displays give the same integral after zero-complement refinement; the resulting nonnegative integral is monotone, additive, positively homogeneous, has ∫0=0 as a separate zero-scalar clause, and satisfies monotone convergence. On a finite measure space, bounded decreasing convergence follows. Under AC, every event has a bounded conditional-density version, unique almost surely, and these versions preserve inclusion, constants, and monotone event limits.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

The simple and nonnegative integrals are respectively the finite coefficient sum with 0⋅(+∞)=0 and the supremum over nonnegative simple minorants. The integral of a nonnegative simple function, The nonnegative Lebesgue integral, Integral over a measurable subset.

[F2]

Every nonnegative measurable function has prescribed increasing simple approximants. Every nonnegative measurable function is the increasing limit of simple measurable functions.

[F3]

Hahn decomposition applies to the finite signed measures used in the density construction. Hahn decomposition for signed measures, unique up to total-variation-null sets.

[F4]

Measures are countably additive and continuous from below. Measures on sigma-algebras, Continuity from below for measures.

[F5]

AC selects maximizing sequences, Hahn decompositions and the rational family of densities. The Axiom of Choice.

[F6]

The rationals and their finite products are countable. Q is countably infinite, A product of two at most countable sets is at most countable.

[F7]

A specified countable union of measurable null sets is null. Finite and countable subadditivity of measures.

[F8]

Limsup, liminf and convergence sets of measurable functions are measurable. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable.

Proof

technique · direct
1.1F1F4construct

We first repair the integral interface. Given two finite disjoint simple displays s=∑ici1Ei=∑jdj1Fj, adjoin E0=Ω∖⋃iEi and F0=Ω∖⋃jFj, both with coefficient zero. The intersections Ei∩Fj, now including indices zero, form a finite measurable partition of all of Ω. On every nonempty cell the two coefficients agree, so finite additivity gives equal coefficient sums. This includes infinite-measure zero cells because both corresponding products are the stipulated 0⋅(+∞)=0. Thus the simple integral in [F1] is representation-independent. A common zero-complement refinement now proves monotonicity and additivity for simple functions. For a scalar a>0, termwise multiplication proves positive homogeneity; for a=0, the zero display gives ∫0=0 directly, without forming 0⋅(+∞).

2.1step 1.1F1F2F4

The supremum definition in [F1] therefore gives monotonicity of the nonnegative integral and agreement with the simple integral. Multiplication by a>0 bijects the simple minorants of f and af, giving positive homogeneity; again ∫0=0 is separate. If 0≤fn↑f, let L=sup⁡n∫fn. For a simple s≤f and 0<a<1, put An={fn≥as}. Then An↑Ω. The formula A↦∫As is a measure by the finite partition formula from step 1.1, so [F4] gives ∫Ans↑∫s. Since as1An≤fn, positive homogeneity gives a∫Ans≤L; let first n and then a↑1 to obtain ∫s≤L. Taking the supremum over s proves monotone convergence. Using the approximants in [F2], simple additivity and monotone convergence give ∫(f+g)=∫f+∫g. Consequently A↦∫Af is a measure: apply monotone convergence to finite unions of a disjoint sequence. If the ambient measure is finite and 0≤fn↓f≤M, then M−fn↑M−f; additivity in the finite identity fn+(M−fn)=M proves bounded decreasing convergence.

3.1step 2.1F3F5F7F8assume-contracontradiction: maximalitydischarge-contradiction

We next construct conditional densities without importing a conditional-expectation theorem. For an event C∈F, set νC(A)=P(A∩C) on G. Let H be the nonnegative measurable h satisfying ∫Ah dP≤νC(A) for every A∈G, and let M=sup⁡h∈H∫h dP≤1. The maximum of two members remains in H: split each test event over {h≥k} and its complement and use step 2.1. By [F5] choose hj∈H with integrals tending to M, and put fj=max⁡i≤jhi↑f. By F8 the supremum f is measurable. Step 2.1 gives f∈H and ∫f=M. The set function ρ(A)=νC(A)−∫Af dP is a finite positive measure. If it were not singular to P∣G, choose by [F3] a positive set Qm for ρ−P/m for every m≥1. If every P(Qm)=0, their union is null by [F7], and on its complement ρ(A)≤P(A)/m for every m, so ρ is concentrated on a P-null set, a contradiction. Hence some Qm has positive P-measure, and f+m−11Qm∈H has integral greater than M, again a contradiction. Thus ρ⊥P. Since 0≤ρ≤νC≤P, it is also absolutely continuous, so its singular carrier immediately gives ρ=0. We have proved νC(A)=∫Af dP for all A∈G.

4.1step 2.1step 3.1F4F7

Since ∫f≤1, the sets {f≥n} show that f<∞ almost surely. Comparing νC≤P on {f≥1+1/m} shows that f≤1 almost surely. Changing f on the measurable union of these null sets gives a real [0,1]-valued density. If f,g represent νC,νD and C⊆D, then on Am={f≥g+1/m}, step 2.1 gives ∫Amf≥∫Amg+P(Am)/m, whereas the representation identities give ∫Amf≤∫Amg. Hence P(Am)=0 for every m, so f≤g almost surely. Taking C=D in both directions proves uniqueness; C=∅,Ω proves the constant-zero and constant-one assertions. For Cj↑C, set all selected densities to zero on the countable union of their order failures and put u=lim⁡jfj. Step 2.1 and [F4] give ∫Au=lim⁡jP(A∩Cj)=P(A∩C), so uniqueness identifies u with the density of C. Decreasing event limits follow by applying this to complements and using ∫A(1−f)=P(A)−∫Af, an instance of the finite additivity from step 2.1. This proves every restricted conditional-density assertion in the statement.

5.1step 3.1step 4.1F5F6

Apply step 3.1 to Cq={X≤q} and use [F5] to select one real G-measurable density Gq for each rational q. The selection is countable by [F6]. Step 4.1 gives 0≤Gq≤1 almost surely and Gq≤Gr almost surely whenever q<r. Since Cn↑Ω, C−n↓∅, and Cq+1/n↓Cq, the event-limit clause of step 4.1 gives the two tail limits and every rational right-limit almost surely.

6.1step 2.1step 5.1F6F7F8∎

Form the union N of the failure sets for the bounds, rational order comparisons, two tail limits, and the right-limit assertion for each rational q. They belong to G by rational-cut descriptions and [F8], and they are null by step 5.1. There are countably many by [F6], so [F7] gives P(N)=0. Replace each Gq on N by 1{q≥0}. Pasting preserves measurability. A bounded difference supported on N has absolute value at most a constant times 1N, whose integral is zero by step 2.1, so all event integrals are unchanged and the functions remain versions. The filler is increasing, has the required tails, and satisfies the right-limit property also at q=0.

Depends on

Used by

Dependency tree · two levels

47 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