Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Finite-budget stopped-kernel measurability and event normalizer

Statement

Assume AC. Under the hypotheses of Finite-budget stopped-event kernel with a cemetery outcome, every κm is a measurable probability kernel from E to C. For an initial probability law μ, let pm=∫Eκm(x,{hit}) μ(dx). Then pm=Pμ(τT<τR, τT≤m). In the one-step Feynman–Kac model with initial law μ, transition κm, initial potential 1, and terminal potential 1{hit}, the normalizer is exactly pm. The limit lim⁡m→∞pm=Pμ(τT<τR) is the exact-hitting normalizer; an exact simulator with finite expected work requires a separate termination-cost bound.

Facts & Assumptions

Given: A measurable state space, probability kernel M, disjoint measurable target and return sets T,R, and the finite-budget kernels from Finite-budget stopped-event kernel with a cemetery outcome.

[A1]

The Axiom of Choice: AC is inherited through the path-law construction used by the finite-horizon supplier.

[F1]

Finite-budget stopped-event kernel with a cemetery outcome: κ0 assigns hit, return, or cemetery according to the current state; κm+1 fixes terminal states and otherwise integrates κm after one M-transition.

[F2]

Measurability of integration against a kernel: Integrating a nonnegative measurable section against a probability kernel gives a measurable function of the source state.

[F3]

Ionescu-Tulcea construction of a Markov chain: Finite-prefix path laws have the prescribed iterated-kernel probabilities.

[F4]

Feynman–Kac path targets and normalizers: A finite-horizon Feynman–Kac normalizer is the integral of the product of its potentials against the ordered path law.

Proof

1.1F1given

For m=0, the three status probabilities are the indicators of the disjoint partition T,R,S; they are measurable and sum to one. Thus κ0 is a probability kernel.

1.2F1F3giveninduction

At m=0 the hit status occurs exactly when X0∈T. For m+1, points in T or R stop immediately, while from S the first M-transition is followed by the budget-m rule. The finite-prefix law [F3] and induction therefore identify κm(x,{hit}) with Px(τT<τR,τT≤m); integrating against μ gives pm.

2.1F1F2step 1.1given

Suppose κm is a probability kernel. For each c∈C, the function y↦κm(y,{c}) is measurable. By [F2], its M(x,⋅)-integral is measurable in x. On T and R the next status is the corresponding point mass; on S the three integrals sum to ∫1 M(x,dy)=1. Hence κm+1 is a probability kernel, and induction proves the first claim.

3.1A1F3F4step 1.2given∎

In the one-step Feynman–Kac model, the product of potentials is 1{hit}; [F4] therefore gives normalizer ∫1{hit} d(μκm)=pm. The success events by budgets m increase to {τT<τR}; countable additivity gives the limit identity.

Depends on

Used by

Dependency tree · two levels

24 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