Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 finite bridge-ratio estimator

Definition

Input a finite nonempty state space X, an integer K≥1, positive finite weights w0,…,wK:X→(0,∞), positive integers n0,…,nK−1, and, on a common probability space (Ω,F,P), supplied random variables Xk,j:Ω→(X,P(X)) for 0≤k<K and 1≤j≤nk. For each k, set Zk=∑x∈Xwk(x) and πk(x)=wk(x)/Zk, a probability mass function on X and thus a probability measure on P(X). Require P(Xk,j=x)=πk(x) for every x∈X and require the entire finite family (Xk,j)k,j to be mutually independent. These exact draws are inputs, not outputs of this procedure; approximate Gibbs draws, correlated trajectories, and adaptively chosen bridges are outside its contract.

For each k=0,…,K−1, compute R‾k=nk−1∑j=1nkwk+1(Xk,j)/wk(Xk,j). Return R^=∏k=0K−1R‾k. The procedure evaluates only raw-weight ratios; it neither computes nor requires any Zk as a numeric input.

Depends on

Dependency tree · 2 levels

Sources