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.

Monotone coupling from the past for finite ferromagnetic Ising weights

Definition

Input a finite nonempty set V, a set E⊆[V]2 of unordered pairs of distinct sites, finite dimensionless couplings Ke≥0, finite dimensionless fields hi∈R, and a two-sided iid stream (Is,Us)s∈Z in which Is is uniform on V, Us is uniform on [0,1], and all these variables are mutually independent. On Ω={−1,+1}V, define σ≤τ by σi≤τi for every i∈V, using −1<+1; its least and greatest elements are − and +. For the finite-spin heat-bath update, use the total sampling order +1≺−1, which is distinct from ≤. Define the strictly positive finite weight w(σ)=exp⁡ ⁣(∑{i,j}∈EK{i,j}σiσj+∑i∈Vhiσi). At time s, let Fs:Ω→Ω be the one-site finite-spin heat-bath update at site Is with uniform value Us, leaving every other spin unchanged; explicitly, site i is set to +1 exactly when Us<exp⁡(Hi(η))exp⁡(Hi(η))+exp⁡(−Hi(η)),Hi(η)=hi+∑{i,j}∈EK{i,j}ηj, where η is the exterior configuration at i, and otherwise is set to −1. For T=1,2,4,…, initialize lower and upper configurations at time −T to − and +, respectively, and apply in chronological order the same stored maps F−T+1,…,F0 to both. If their time-zero outputs agree, return that common configuration. Otherwise double T and replay all maps in the enlarged interval, reusing the already stored maps at every overlapping time. This is a random procedure; no finite running-time bound is part of its definition.

Remarks

The order-preserving update is part of the specified coupling. Replacing a previously stored seed when a horizon is doubled changes the procedure. Termination and exactness are proved separately.

Depends on

Dependency tree · 1 level

Sources