Alphabeta Math
TheoremStatement: 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.

Independent splitting estimator moments and work

Statement

Run Independent fixed-level splitting on the nested levels of Nested rare-event levels and conditional laws with N≥1 draws per level. Then E[p^]=p,Var⁡(p^)p2=∏ℓ=1L(1+1−pℓNpℓ)−1,W=N∑ℓ=1Lcℓ. In absolute error, Var⁡(p^)≤(1+14N)L−1. For fixed L, the right side is O(L/N), uniformly in the rarity of p; the relative-variance formula has factors 1/pℓ and gives no uniform relative-efficiency claim.

Facts & Assumptions

Given: Nested events and conditional laws, independent exact conditional samples at every level, N≥1, and per-draw costs cℓ>0.

[F1]

Nested rare-event levels and conditional laws: pℓ=P(Aℓ)/P(Aℓ−1)>0 and p=P(AL).

[F2]

Nested-event probabilities factor into conditional levels: p=∏ℓ=1Lpℓ.

[F3]

Independent fixed-level splitting: p^=∏ℓ=1Lp^ℓ, with p^ℓ the level-ℓ mean of N indicators sampled from πℓ−1; the level arrays are independent and W=N∑ℓcℓ.

[F4]

Unbiasedness and exact variance of the IID Monte Carlo mean: The mean of N IID Bernoulli-pℓ indicators has expectation pℓ and variance pℓ(1−pℓ)/N.

Proof

1.1F1F3F4given

Under πℓ−1, the indicator 1Aℓ is Bernoulli with success probability P(Aℓ)/P(Aℓ−1)=pℓ. Thus [F4] gives Ep^ℓ=pℓ and Ep^ℓ2=pℓ2+pℓ(1−pℓ)/N at each level.

2.1F2F3step 1.1algebra

The level arrays are independent by [F3], so Ep^=∏ℓpℓ=p by [F2], and Ep^2=∏ℓ[pℓ2+pℓ(1−pℓ)/N]. Subtracting p2=∏ℓpℓ2 gives the displayed variance and, after division by p2>0, the relative-variance formula. The work equality is the LN declared draws weighted by their level costs in [F3].

3.1step 2.1algebra

Put aℓ=pℓ2 and vℓ=pℓ(1−pℓ)/N. Then 0≤aℓ≤1 and 0≤vℓ≤1/(4N). By step 2.1 and finite product expansion, Var⁡(p^)=∏ℓ=1L(aℓ+vℓ)−∏ℓ=1Laℓ=∑∅≠S⊆{1,…,L}(∏ℓ∈Svℓ)(∏j∉Saj)≤∑∅≠S⊆{1,…,L}(14N)∣S∣=(1+14N)L−1.

4.1step 2.1step 3.1algebra∎

For fixed L, expansion of the finite binomial gives (1+1/(4N))L−1≤L4N(1+1/(4N))L−1=O(L/N). The relative formula in step 2.1 still contains (1−pℓ)/(Npℓ), so this absolute bound does not give a rarity-uniform relative bound.

Depends on

Used by

Dependency tree · two levels

13 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