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.

Independent fixed-level splitting

Definition

Input the nested levels and exact conditional samplers for πℓ−1 from Nested rare-event levels and conditional laws, a particle count N≥1, and a declared per-draw work cost cℓ>0 for each level. If any conditional sampler is unavailable, return conditional-sampler-unavailable.

For each level ℓ=1,…,L, independently of every other level, draw Xℓ,1,…,Xℓ,N IID from πℓ−1. Set p^ℓ=N−1∑i=1N1Aℓ(Xℓ,i),p^=∏ℓ=1Lp^ℓ. Return p^, the level counts, total draw work W=N∑ℓ=1Lcℓ, and status success if all level counts are positive or zero-level-estimate otherwise. The zero estimate is not a proof that P(AL)=0.

The procedure is an ideal independent-level baseline. It does not assert that a branching or Markov mutation method produces independent exact conditional draws.

Depends on

Used by

Dependency tree · two levels

2 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