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.
A zero-particle prefix does not prove a zero event probability
Example
Take with uniform law, a single level , and SIR particles. The event probability is positive, but the all-zero first event-potential branch has positive probability and returns the zero estimate.
Facts & Assumptions
Given: is uniform on , , and the full-resampling SIR splitting algorithm is used with .
Nested rare-event levels and conditional laws: A one-level target has probability .
Full-resampling fixed-level SIR splitting with invariant mutations: If any incremental event-weight average is zero, the algorithm returns status zero-particle-prefix and estimate zero.
Fixed-level full-resampling SIR splitting is unbiased: The estimator is unbiased in expectation under the theorem's positive-prefix model.
Verification
. The two initial particles are IID from , so the probability that both equal and therefore both have zero -weight is .
On this branch resampling the initial population still selects only particles equal to , and the identity transition leaves them there. Thus the first average event weight, from , is zero, so [F2] returns estimate zero despite . This does not contradict [F3]: unbiasedness is an expectation over all branches and does not imply that each realization is positive.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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.