Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedprecheck pendingjudge 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.

Full-resampling fixed-level SIR splitting with invariant mutations

Definition

Input the nested levels of Nested rare-event levels and conditional laws on a standard Borel state space (Ω,F), a particle count N≥1, and probability kernels Kℓ for 1≤ℓ<L. Each mutation kernel must satisfy Kℓ(x,Aℓ)=1(x∈Aℓ),πℓKℓ=πℓ. If a required kernel is unavailable or violates its declared conditions, return mutation-kernel-unavailable.

Apply the canonical full-resampling sequential importance-resampling procedure of Sequential importance resampling for Feynman–Kac path targets to the following finite Feynman–Kac model: initial law P, initial potential G0≡1, identity transition M1, event potential G1=1A1, and, for 2≤ℓ≤L, transition Mℓ=Kℓ−1 and potential Gℓ=1Aℓ. Use multinomial full resampling at every selection and proposal kernels equal to the target transitions, so each Radon–Nikodym correction is one.

Return the SIR normalizer estimate p^ and the full particle output. If any incremental average event weight is zero, report status zero-particle-prefix and p^=0, as in the canonical SIR procedure. This status does not assert that the target probability is zero. The exact conditional level sampler is not inferred from the existence of an invariant kernel; kernel accessibility is an input requirement.

Depends on

Used by

Dependency tree · two levels

20 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