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.

Likelihood ratio martingale

Example

Assume AC. Let NN0, let P,Q be probability measures on (Ω,FN) with QP, and let F0FN. With L=dQ/dP, set Zn=EP[LFn] for 0nN. This is a nonnegative P-martingale and Zn is a density of QFn relative to PFn. If F0 is trivial, Z0=1 a.s.

Facts & Assumptions

Given: The hypotheses and conventions in the example.

[F1]

Under AC, a finite absolutely continuous measure dominated by a sigma-finite measure has a real integrable density; here the dominating probability P is sigma-finite. A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density.

[F2]

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

[F3]

Conditioning one fixed integrable terminal variable gives a martingale. Conditional expectation process is a martingale.

[F4]

Conditional expectation is linear, order preserving and expectation preserving. Basic algebra and order properties of conditional expectation.

[F5]

An integrable variable measurable for the conditioning sigma-algebra conditions to itself. Conditioning a known variable and an independent variable.

[F6]

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

[F7]

Countable unions of measurable null sets are null Finite and countable subadditivity of measures.

Verification

technique · direct
1.1

Repair first the integral foundation inherited by RN. Augment any finite disjoint display of a nonnegative simple function by the complement with coefficient 0. Pairwise intersections of two augmented displays partition the whole space and have equal coefficients on nonempty cells; 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 and the sets {fjcs}, 0<c<1, give monotone convergence; increasing simple approximations give nonnegative additivity, and positive/negative plus real/imaginary decompositions give finite L1 linearity. With these facts substituted for the affected foundation, the cited RN proof applies. Apply it to μ=P,ν=Q with the constant exhaustion Xj=Ω. Both masses and the total variation of the positive Q are one. Thus L is real measurable, integrable and ALdP=Q(A) for every AFN. It is nonnegative a.s.: for each positive integer j, put Bj={L1/j}. Then 0Q(Bj)=BjLdPP(Bj)/j, so each Bj is null, and j1Bj={L<0}. Testing Ω gives EPL=1.

givenF1F7construct
2.1

Extend the filtration constantly after N to apply [F3]; up to N, it makes Z a martingale. Conditional positivity gives Zn0 a.s. For every AFn, the defining event identity gives AZndP=ALdP=Q(A), exactly the restricted density assertion. At n=N known-variable conditioning gives ZN=L. If F0 is trivial, the constant one has the same integrals as L on its two events, so it is the conditional class Z0. AC covers RN and CE existence and the finite choice of versions.

F2F3F4F5F6step 1.1
3.1

For instance let N=1, Ω={a,b}, P(a)=P(b)=1/2, Q(a)=3/4, Q(b)=1/4, and F0 trivial. Then L(a)=3/2, L(b)=1/2, and Z0=1, Z1=L. The average (3/2+1/2)/2=1 verifies the martingale equality, and (1/2)(3/2)=3/4 verifies the restricted density on {a}.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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