Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Feynman–Kac path Radon–Nikodym weight

Statement

Assume AC and the setup of Feynman–Kac path targets and normalizers through a fixed horizon t≤T. Let ν0 be a proposal probability on X0, and for 1≤k≤t let Rk:Xk−1⇝Xk be proposal probability kernels. Define Qs(dx0:s)=ν0(dx0)∏k=1sRk(xk−1,dxk). Suppose μ0≪ν0, and for each k suppose Mk(x,⋅)≪Rk(x,⋅) for almost every x under the last-coordinate marginal of Qk−1. Choose a measurable version ρ0=dμ0/dν0 and, using Jointly measurable Radon–Nikodym derivatives for probability kernels, measurable versions rk(x,⋅)=dMk(x,⋅)/dRk(x,⋅) for these preceding-state marginals.

Then γs≪Qs for every s≤t, with product density Ws(x0:s)=G0(x0)ρ0(x0)∏k=1sGk(xk)rk(xk−1,xk). That is, γs(A)=∫AWs dQs for every measurable A⊆X0:s. If 0<Zs<∞, the normalized path target has density Ws/Zs with respect to Qs.

Facts & Assumptions

Given: AC, the finite-horizon Feynman–Kac setup, the proposal laws, the initial domination, and the transition domination hypotheses in the Statement.

[A1]

The Axiom of Choice: AC is used through the path-law and Radon–Nikodym suppliers.

[F1]

Feynman–Kac path targets and normalizers: γs is the state path law with density factor ∏j=0sGj.

[F2]

Jointly measurable Radon–Nikodym derivatives for probability kernels: For each transition, almost-everywhere kernel domination under the preceding proposal marginal supplies one jointly measurable kernel derivative version.

[F3]

Ionescu-Tulcea construction of a Markov chain: The target and proposal kernels define finite-prefix path laws by ordered iterated integration.

[F5]

Integrating against a Radon-Nikodym derivative recovers integration against the measure: A Radon–Nikodym representative h satisfies the setwise identity P(A)=∫Ah dQ for every measurable A. It also proves the corresponding integration identity for simple functions whose level sets have finite total variation.

[F6]

Measurability of integration against a kernel: Integrating a nonnegative product-measurable function against a probability kernel gives a measurable section integral.

[F7]

Every nonnegative measurable function is the increasing limit of simple measurable functions: Every nonnegative measurable function is the pointwise increasing limit of nonnegative simple measurable functions.

[F8]

Monotone convergence for the integral: Integrals of an increasing sequence of nonnegative measurable functions converge to the integral of its pointwise limit.

[F9]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere: A nonnegative measurable function with integral zero vanishes almost everywhere.

[F10]

Composition with a Borel measurable outer map preserves measurability: Composing a measurable function with a Borel function preserves measurability.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F3F4F9F10given

For each 0≤s≤t, let PsM and Qs be the target and proposal finite-prefix path laws supplied by [F3]. Initially choose a real-valued Radon–Nikodym representative ρ~0 from [F4]. Since μ0 is positive, for N−:={ρ~0<0} its setwise identity gives 0≤μ0(N−)=∫N−ρ~0 dν0≤0. Thus ∫N−ρ~0− dν0=0, and [F9] implies ρ~0−=0 ν0-almost everywhere. Replace ρ~0 by the measurable nonnegative version ρ0=max⁡(ρ~0,0); [F10] gives measurability and the modification preserves the setwise density identity. Hence P0M≪Q0 with base density ρ0; after weighting by G0 in [F1], γ0 has density W0=G0ρ0.

1.2F5F7F8

First record the nonnegative extension used below. If finite measures P,Q satisfy P(A)=∫Au dQ for every measurable A, with u≥0, choose by [F7] simple functions gn↑g for any nonnegative measurable g. The simple-function identity in [F5] gives ∫gn dP=∫gnu dQ for each n; [F8] and monotone convergence of gnu give ∫g dP=∫gu dQ, with infinity allowed. All measures to which this fact is applied below are probabilities, so the finite-level-set condition in [F5] holds.

2.1A1F1F2F3F6step 1.1step 1.2given

Fix 1≤k≤t and assume Pk−1M≪Qk−1 with density Dk−1(x0:k−1)=ρ0(x0)∏j=1k−1rj(xj−1,xj). For nonnegative product-measurable h, define ψ(x0:k−1)=∫h(x0:k−1,xk)Mk(xk−1,dxk); [F6] makes ψ measurable. For Qk−1-almost every history, the kernel Radon–Nikodym identity and step 1.2 give ψ(x0:k−1)=∫h(x0:k−1,xk)rk(xk−1,xk)Rk(xk−1,dxk). Step 1.2 also extends the induction density identity from sets to ψ, so ordered integration from [F3] gives ∫h dPkM=∫ψ dPk−1M=∫Dk−1(x0:k−1) ψ(x0:k−1) Qk−1(dx0:k−1)=∫h(x0:k)Dk−1(x0:k−1)rk(xk−1,xk) Qk(dx0:k). Thus PkM≪Qk with density Dk=Dk−1rk. The kernel identity is needed only on a Qk−1-conull set; the same is true for Pk−1M by the induction density, and changes on the exceptional set do not affect these nonnegative integrals.

3.1A1F1step 1.2step 2.1algebra∎

Induction in step 2.1 gives the proposal density of every finite-horizon state path. The target measure γs is obtained by integrating the nonnegative path potential Vs=∏j=0sGj against PsM. For each measurable A, apply step 1.2 to g=1AVs and the density Ds=ρ0∏j=1srj to obtain γs(A)=∫AVsDs dQs=∫AWs dQs. Dividing by Zs is valid exactly when 0<Zs<∞.

Depends on

Used by

Dependency tree · two levels

50 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