Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Dyadic conditional expectation martingale

Example

Assume AC. On (0,1] with Lebesgue probability, let In,j=(j/2n,(j+1)/2n] for 0j<2n and let Fn be their finite-partition sigma-algebra. For real fL1(P), Mn=j=02n1(2nIn,jfdP)1In,j is a version of E[fFn], and (Mn) is a martingale.

Facts & Assumptions

Given: The hypotheses and conventions in the example.

[F2]

Restriction of a measure to a measurable set is a measure. The restriction of a measure to a measurable set is a measure.

[F3]

Under AC every integrable input has a measurable integrable conditional version. Conditional expectation as an ae class.

[F4]

Finite linear combinations remain integrable and their integrals are linear. The Lebesgue integral is linear on L1(μ).

[F5]

The absolute integral is bounded by the integral of the absolute value. The modulus of an integral is bounded by the integral of the modulus.

[F6]

Conditional expectations of a fixed L1 variable along a filtration form a martingale. Conditional expectation process is a martingale.

[F7]

AC supplies the inherited conditional-expectation existence and any stated choice of versions. The Axiom of Choice.

Verification

technique · direct
1.1

First justify the finite integral operations locally. Augment every finite disjoint simple display by the complement with coefficient 0. Intersections of two augmented displays partition the whole space and have equal coefficients on every nonempty cell, so finite additivity and 0(+)=0 prove representation independence. Common refinements give simple addition and monotonicity; scalar zero is direct and positive scalars are termwise. Supremum over simple minorants, increasing simple approximation and the sets {fjcs}, 0<c<1, give monotone convergence and nonnegative additivity. Positive/negative and real/imaginary decompositions give the finite L1 linearity and triangle estimate used below. The trace restriction of Lebesgue measure to (0,1] has total mass one. The displayed half-open cells Half-open boxes in Rn and their volume are disjoint, exhaust the space and have probability 2n>0. Their unions form a sigma-algebra because unions and complements select cells from a finite partition. Each cell at n is exactly the union of its children at n+1, so the sigma-algebras increase. Every cell integral of f is finite. The displayed finite-valued Mn is Fn-measurable, and EMn=jIn,jfdPjIn,jfdP=Ef<.

givenF1F2F4F5construct
2.1

For A=jJIn,jFn, finite addition and the cell mass give AMndP=jJ2n(In,jfdP)2n=AfdP. Thus Mn meets every defining conditional-expectation requirement. Apply [F6] to obtain the martingale. For f=1(0,1/2], the first average is M0=1/2 and every finer cell lies entirely in (0,1/2] or its complement, so Mn=f for n1. In particular E[M1F0]=1/2. AC supplies the Lebesgue construction and CE existence; the explicit finite averages require no version selection.

F1F3F4F6F7step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

43 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