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.
Ordinary and self-normalized importance sampling on a two-point space
Example
Let with counting measure, unnormalized target density , proposal probabilities and , and integrand . Then , the target probabilities are , and . The proposal has full target support.
Facts & Assumptions
Given: The finite space, target, proposal, integrand, and normalizer in the Example.
Ordinary importance sampling: For each proposal draw, ordinary importance sampling uses and returns their sample mean.
Self-normalized importance sampling: When the sum of the nonnegative weights is positive, the self-normalized estimate is .
Ordinary importance sampling is unbiased: Under the stated support and integrability assumptions, the ordinary importance sampling estimate has expectation .
Verification
Given: Use one proposal draw and the definitions in [F1] and [F2].
The target normalizer is , so and . Since both proposal probabilities are positive and is finite, the support and integrability assumptions of [F3] hold.
The ordinary weighted value is at and at . Its expectation is , as also guaranteed by [F3].
The self-normalized weights are at and at , so the single-draw ratio in [F2] equals . Its expectation is , and its bias for is . This verifies that self-normalization need not be unbiased at finite sample size.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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.