Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Measurable Lebesgue decomposition of a kernel on a countably generated space

Statement

Let (X,X) be countably generated, let μ be a nonzero σ-finite measure, and let K be a probability kernel. There are a jointly measurable p:X×X→[0,∞] and a subprobability kernel S such that K(x,A)=∫Ap(x,y) μ(dy)+S(x,A), where S(x,⋅) and μ are mutually singular for each x.

Facts & Assumptions

Given: The countably generated space, σ-finite reference measure, and probability kernel in the Statement.

[F1]

Measurable spaces and measurable sets: a countable generating family yields an increasing sequence of finite partitions generating X.

[F2]

Measure kernel and probability kernel: x↦K(x,A) is measurable and K(x,⋅) is a probability measure.

[F4]

Doob submartingale convergence theorem gives almost-sure convergence for a submartingale whose positive parts have uniformly bounded expectations. Levy upward convergence of conditional expectations identifies the almost-sure limit of conditional expectations along an increasing generating sequence with the conditional expectation on the generated sigma-algebra.

[F5]

Measurability of integration against a kernel: integrating a nonnegative jointly measurable function against a kernel preserves measurability.

[F6]

Approximation in symmetric difference by a generating algebra: under a finite measure, every measurable set is approximable in symmetric difference by members of a generating algebra.

[F7]

Finite, sigma-finite, and semifinite measures: a sigma-finite measure admits a countable partition into finite-measure pieces.

[F8]

The measure with density f relative to μ: integrating a nonnegative measurable density against the reference measure defines a measure.

[A1]

The Axiom of Choice: select sectionwise RN decompositions and singular support sets, and supply the AC hypotheses of the Doob and Levy convergence theorems in [F4].

Proof

Given: The hypotheses and facts [F1]–[F7], with [A1].

1.1F1F2F3F7A1

Choose a disjoint measurable partition (Ej)j≥1 with μ(Ej)<∞ and positive total measure. Set cj=2−j/(1+μ(Ej)) and c=∑jcjμ(Ej). Then 0<c<∞, and μˉ(A)=c−1∑jcjμ(A∩Ej) is an equivalent probability measure. Its density w=cj/c on Ej is positive. For each fixed x, choose K(x,⋅)=fxμˉ+Sx from [F3]. Let (Pn) be increasing finite partitions generating X, and set fn(x,y)=∑B∈Pn:μˉ(B)>0K(x,B)μˉ(B)1B(y), with value zero on zero-measure cells. For a positive-measure cell B∈Pn, its average at level n+1 integrates over B to the sum of K(x,C) over the positive-measure children C⊆B, which is at most K(x,B); zero-measure parents and all their children have value zero. Thus (fn(x,⋅)) is a nonnegative μˉ-supermartingale. Also ∫fn(x,⋅) dμˉ≤K(x,X)=1, so −fn(x,⋅) has uniformly bounded positive-part expectations and [F4] gives a finite almost-sure limit for fn(x,⋅).

2.1F2F4A1step 1.1

Define f∞(x,y)=lim sup⁡nfn(x,y), a jointly measurable extended nonnegative function; for each fixed x it agrees almost everywhere with the finite limit from step 1.1. The conditional-expectation averages gnx of the integrable density fx over Pn are defined by gnx(y)=μˉ(B)−1∫Bfx dμˉ on positive-measure cells B, and by zero on zero-measure cells. Since ∫fx dμˉ≤1, [F4] and the AC hypothesis [A1] give gnx→fx almost everywhere: Pn generates X. Cellwise gnx≤fn(x,⋅) because ∫Bfx dμˉ≤K(x,B), with both averages zero on null cells. Taking limits proves fx≤f∞(x,⋅) almost everywhere.

3.1F3F4F6F8A1step 2.1

For a cell B at partition level N, every n≥N has ∫Bfn(x,y)μˉ(dy)≤K(x,B), since the positive-measure level-n cells inside B contribute only a sub-sum of the kernel masses of a partition of B. Fatou therefore gives ∫Bf∞(x,y)μˉ(dy)≤K(x,B). By [F8], the left side defines a measure; Fatou at the whole space gives its total mass at most one, so both sides are finite measures. Their sum is a finite measure, and [F6] approximates any measurable set in symmetric difference under that sum; the inequality extends from the generating partition algebra to every measurable set. Choose a singular support Nx with μˉ(Nx)=0 and Sx(Nxc)=0. Since the left measure has density f∞ with respect to μˉ, it assigns zero mass to Nx. Applying the inequality to A∩Nxc therefore gives ∫Af∞ dμˉ≤∫Afx dμˉ. Together with step 2.1, this proves f∞=fx almost everywhere.

4.1F2F3F5step 3.1∎

Since μˉ(dy)=w(y)μ(dy), set p(x,y)=f∞(x,y)w(y) and S(x,A)=K(x,A)−∫Ap(x,y)μ(dy). Step 3.1 shows sectionwise that S(x,⋅)=Sx, a nonnegative subprobability measure singular to μ. The integral is measurable in x by [F5]; hence S(⋅,A) is measurable for every A, and its sections are countably additive. Thus S is a subprobability kernel and the decomposition holds.

Depends on

Used by

Dependency tree · two levels

51 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