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.

Finite-spin random-scan heat-bath update

Definition

Input a finite nonempty site set V, a finite nonempty spin set S with a fixed total order s1≺⋯≺sr, a strictly positive finite weight w:SV→(0,∞), an initial configuration x0∈SV, an integer t≥0, a site schedule i1,…,it∈V, numbers u1,…,ut∈[0,1], and a finite family of observables f1,…,fm:SV→R (the family may be empty). Put Z=∑x∈SVw(x) and π(x)=w(x)/Z. For i∈V, an exterior configuration η∈SV∖{i}, and s∈S, let ηi,s∈SV agree with η away from i and have spin s at i, and set qi(s∣η)=w(ηi,s)∑a∈Sw(ηi,a). The denominator is finite and strictly positive. For k=1,…,t, set η=xk−1∣V∖{ik}, put c0=0 and cj=∑ℓ=1jqik(sℓ∣η), and replace the spin at ik by the first sj for which uk<cj; when uk=1, replace it by sr. Leave every other spin unchanged to obtain xk. Thus the intervals are [cj−1,cj) for j<r and [cr−1,1] for j=r. Return the trajectory (x0,…,xt) and the values fa(xk) for a=1,…,m and k=0,…,t. For the random-scan heat-bath chain, take the ik independently uniform on V and the uk independently uniform on [0,1], with all site and uniform draws mutually independent. The procedure makes no independence claim about successive configurations or observable values.

Remarks

For a separately proved finite-time bias bound under explicit influence hypotheses, see Finite Dobrushin bound for random-scan heat-bath sampling. A finite run can still have initialization bias, and its outputs are generally dependent; this definition gives no confidence interval, independent-sample guarantee, or central limit theorem.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources