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 , a finite nonempty spin set with a fixed total order , a strictly positive finite weight , an initial configuration , an integer , a site schedule , numbers , and a finite family of observables (the family may be empty). Put and . For , an exterior configuration , and , let agree with away from and have spin at , and set The denominator is finite and strictly positive. For , set , put and , and replace the spin at by the first for which ; when , replace it by . Leave every other spin unchanged to obtain . Thus the intervals are for and for . Return the trajectory and the values for and . For the random-scan heat-bath chain, take the independently uniform on and the independently uniform on , 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.